- Authors:
- M. J. Fischer,
- N. A. Lynch,
- M. S. Paterson
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. We show 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.
Cited By
Duan S, Zhang H, Sui X, Huang B, Mu C, Di G and Wang X Dashing and Star: Byzantine Fault Tolerance with Weak Certificates Proceedings of the Nineteenth European Conference on Computer Systems, (250-264)- Zhang H, Duan S, Zhao B and Zhu L WaterBear Proceedings of the 32nd USENIX Conference on Security Symposium, (5341-5357)
- Ruan P, Dinh T, Loghin D, Zhang M, Chen G, Lin Q and Ooi B Blockchains vs. Distributed Databases Proceedings of the 2021 International Conference on Management of Data, (1504-1517)
- Ahmed M, Elahi I, Abrar M, Aslam U, Khalid I and Habib M Understanding Blockchain Proceedings of the 3rd International Conference on Future Networks and Distributed Systems, (1-8)
- Zhao W, Yang S and Luo X On Consensus in Public Blockchains Proceedings of the 2019 International Conference on Blockchain Technology, (1-5)
- Garcia Molina H, Pittelli F and Davidson S (1986). Applications of Byzantine agreement in database systems, ACM Transactions on Database Systems, 11:1, (27-47), Online publication date: 1-Mar-1986.
- Garcia-Molina H, Pittelli F and Davidson S Is byzantine agreement useful in a distributed database? Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, (61-69)
- Ben-Or M Another advantage of free choice (Extended Abstract) Proceedings of the second annual ACM symposium on Principles of distributed computing, (27-30)
Recommendations
Impossibility of distributed consensus with one faulty process
PODS '83: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systemsThe 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. We show that every protocol for this problem has the possibility of nontermination,...
Impossibility of distributed consensus with one faulty process
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 ...
The gap in circumventing the impossibility of consensus
The impossibility of reaching deterministic consensus in an asynchronous and crash prone system was established for a weak variant of the problem, usually called weak consensus, where a set of processes need to decide on a common value in {0,1}, so that ...