THE SYNCHRONOUS CASE. Here, we prove that having ℓ > 3t is necessary and sufficient for solving synchronous Byzantine agreement, regardless of whether the processes are numerate or innumerate. To show that the condition ℓ > 3t is sufficient to reach agreement, we design a simulation, where each group of processes with a common identifier cooperatively simulate a single process.
Appears in 7 contracts
Samples: Byzantine Agreement, Byzantine Agreement, Byzantine Agreement
