Obfuscated Consensus
The classic Fischer, Lynch, and Paterson impossibility proof [7, 12] demonstrates that any deterministic protocol for consensus in either a message-passing or shared-memory system must violate at least one of termination, validity, or agreement in some execution. But it does not provide an efficient procedure to find such a bad execution.
Authors
- James Aspnes (ORCID: https://orcid.org/0000-0001-6188-1663)
- Shlomi Dolev (ORCID: https://orcid.org/0000-0001-5418-6670)
- Amit Hendin
Institutions
- Ben-Gurion University of the Negev (IL)
- Yale University (US)
Publication Details
- Published
- 2026-06-30
- DOI
- https://doi.org/10.1145/3820355.3820383
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00