JavaScript is disabled for your browser. Some features of this site may not work without it.
A Simple Bivalency Proof that t-Resilient Consensus Requires t+1 Rounds

Author
Aguilera, Marcos Kawazoe; Toueg, Sam
Abstract
We use a straightforward bivalency argument borrowed from [FLP85] to show that in a synchronous system with up to t crash failures solving consensus requires at least t+1 rounds. The proof is simpler and more intuitive than the traditional one: It uses an easy forward induction rather than a more complex backward induction which needs the induction hypothesis several times.
Date Issued
1998-09Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1701
Type
technical report