Résumé: 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 ft-2, there is an execution with f failures that requires f+2 rounds.

Langue: Anglais