Impossibility of Distributed Consensus with One Faulty Process
Summary: Shows that in a fully asynchronous system, no deterministic protocol can guarantee termination for binary consensus if even one process may fail (possibility of nontermination). Establishes the FLP impossibility separating asynchronous from synchronous/Byzantine solutions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 31 of 31 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,900 | Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems | 1992 | PODS | 5.4121918e-05 |
| 4,271 | Analysis of Distributed Commit Protocols | 1982 | SIGMOD | 6.8598563e-05 |
| 13,040 | Is Byzantine Agreement Useful In A Distributed Database? | 1984 | PODS | 5.1725247e-05 |
| 12,973 | Commitment In A Partitioned Distributed Database | 1988 | SIGMOD | 5.1725247e-05 |
| 7,408 | Determining the Last Process to Fail (Extended Abstract) | 1983 | PODS | 5.6897772e-05 |
| 7,675 | How Fast can a Distributed Transaction Commit? | 2017 | PODS | 5.6273708e-05 |
| 13,934 | Correctness in General Configurations of Transactional Components | 1999 | PODS | - |
| 6,476 | Optimal Termination Protocols for Network Partitioning | 1983 | PODS | 5.9268328e-05 |
| 7,980 | Scalable Byzantine Fault Tolerance via Partial Decentralization | 2022 | VLDB | 5.5692809e-05 |
| 11,162 | Distributed Consistency Beyond Queries | 2023 | PODS | 5.1725247e-05 |