JavaScript is disabled for your browser. Some features of this site may not work without it.
Attention submitters: Web accessibility policy to take effect October 15, 2019
For more information, please see our web accessibility policy and web accessibility help for submitters.
For more information, please see our web accessibility policy and web accessibility help for submitters.
Correctness Proof of Ben-Or's Randomized Consensus Algorithm
Abstract
We present a correctness proof for Ben-Or's Randomized Consensus Algorithm for the case in which processes can fail by crashing, and a majority of processes is correct. This is the first time that the proof of Ben-Or's algorithm appears for this case. The proof has been extracted from [AT96]: it is a simplification of the correctness proof of a more complex consensus algorithm that involves both randomization and failure detection.
Date Issued
1998-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1682
Type
technical report