Asynchronous consensus and broadcast protocols
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated. With fail-stop processes, it is shown that ⌈( n + 1)/2⌉ correct processes are necessary and sufficient to reach agreement. In the malicious case, it is shown that ⌈(2 n + 1)/3⌉ correct processes are necessary and sufficient to reach agreement. This is contrasted with an earlier result, stating that there is no consensus protocol for the fail-stop case that always terminates within a bounded number of steps, even if only one process can fail. The possibility of reliable broadcast (Byzantine Agreement) in asynchronous systems is also investigated. Asynchronous Byzantine Agreement is defined, and it is shown that ⌈(2 n + 1)/3⌉ correct processes are necessary and sufficient to achieve it.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023 · cited 2×
“Malicious processes [ 6 ], beside failing to send the required messages, may also send false and contradictory messages, even according to some malevolent plan.”
BackgroundImpossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Unanimity in an unknown and unreliable environment
Dolev, D. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.53 · Cited by 61
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Self-citationPractical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10228 · Cited by 499
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
Self-citationBlockchain characteristics and consensus in modern business processes
Viriyasitavat, W., & Hoonsopon, D. (2019) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2018.07.004 · Cited by 440
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 400
Secure and Efficient Asynchronous Broadcast Protocols
Cachin, C., Kursawe, K., Petzold, F., & Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_31 · Cited by 371
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
PeerReview: practical accountability for distributed systems
Haeberlen, A., Kouznetsov, P., & Druschel, P. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294279 · Cited by 337
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
Rethinking Permissioned Blockchains
Vukolić, M. (2017) · Proceedings of the ACM Workshop on Blockchain, Cryptocurrencies and Contracts · doi:10.1145/3055518.3055526 · Cited by 284
Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus
Danezis, G., Kokoris-Kogias, L., Sonnino, A., & Spiegelman, A. (2022) · Proceedings of the Seventeenth European Conference on Computer Systems · doi:10.1145/3492321.3519594 · Cited by 261
Metadata
- Authors
- Bracha, G., & Toueg, S.
- Venue
- Journal of the ACM
- Published
- 1985-10
- Volume
- 32
- Issue
- 4
- Pages
- 824-840
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2073126252
- Cited by
- 513
- References
- 6
- FWCI
- 3.38
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.