Journal of the ACM
Impossibility of distributed consensus with one faulty process
✓ Free legal copy found
Preprint, hosted by Massachusetts Institute of Technology (dspace.mit.edu)
This is the authors’ own version from before peer review, so it may differ from the published paper.
Read the free PDF →Licence: CC BY-NC
Abstract
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.
DOI: 10.1145/3149.214121 · Publisher: Association for Computing Machinery (ACM)