A Simple Proof of the Uniform Consensus Synchronous Lower Bound.

Abstract:

We give a simple and intuitive proof of a 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 <
t-1, there is an execution with f failures that requires
f+2 rounds.