Real Life Is Uncertain. Consensus Should Be Too!
Modern distributed systems rely on consensus protocols to build a fault-tolerant-core upon which they can build applications. Consensus protocols are correct under a specific failure model, where up to f machines can fail. We argue that this f -threshold failure model oversimplifies the real world and limits potential opportunities to optimize for cost or performance. We argue instead for a probabilistic failure model that captures the complex and nuanced nature of faults observed in practice. Probabilistic consensus protocols can explicitly leverage individual machine failure curves and explore side-stepping traditional bottlenecks such as majority quorum intersection, enabling systems that are more reliable, efficient, cost-effective, and sustainable.
Authors
- Marcos K. Aguilera (ORCID: https://orcid.org/0000-0003-3489-2468)
- Natacha Crooks (ORCID: https://orcid.org/0000-0002-3567-801X)
- Reginald Frank (ORCID: https://orcid.org/0000-0002-0423-1071)
- Neil Giridharan (ORCID: https://orcid.org/0009-0008-2175-2611)
- Soujanya Ponnapalli (ORCID: https://orcid.org/0009-0006-1449-1447)
- Octavio Lomeli
Institutions
- Berkeley College (US)
- Broadcom (United States) (US)
- University of California, Berkeley (US)
Publication Details
- Published
- 2025-05-14
- DOI
- https://doi.org/10.1145/3713082.3730374
- Primary Topic
- Blockchain Technology Applications and Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00