A simple proof of the uniform consensus synchronous lower bound
We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f less than or equal to t - 2, there is an execution with f failures that requires f + 2 rounds. (C) 2002 Elsevier Science B.V All rights reserved.
consensus lower bounds distributed computing fault tolerance