The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
HotStuff: BFT Consensus with Linearity and Responsiveness
Open accessAbstract
We present HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model. Once network communication becomes synchronous, HotStuff enables a correct leader to drive the protocol to consensus at the pace of actual (vs. maximum) network delay--a property called responsiveness---and with communication complexity that is linear in the number of replicas. To our knowledge, HotStuff is the first partially synchronous BFT replication protocol exhibiting these combined properties. Its simplicity enables it to be further pipelined and simplified into a practical, concise protocol for building large-scale replication services.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
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
Impossibility 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
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Practical 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
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
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
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
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
Bitcoin-NG: A Scalable Blockchain ProtocolPreprint
Eyal, I., Gencer, A. E., Sirer, E. G., & van Renesse, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.02037 · Cited by 1,106
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
Buchman, E. (2016) · The Atrium (University of Guelph) · Cited by 851
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
Rogaway, P., & Shrimpton, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_24 · Cited by 614
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
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
State Machine Replication for the Masses with BFT-SMART
Bessani, A., Sousa, J., & Alchieri, E. E. P. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.43 · Cited by 567
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
Cachin, C., Kursawe, K., & Shoup, V. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0318-0 · Cited by 437
Casper the Friendly Finality Gadget
Schwarz-Schilling, C., Saleh, F., Thiery, T., Pan, J., Shah, N., & Monnot, B. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.aft.2023.30 · Cited by 405
Zyzzyva: Speculative Byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2009) · ACM Transactions on Computer Systems · doi:10.1145/1658357.1658358 · Cited by 292
Blockchain Consensus Protocols in the Wild
Cachin, C., & Vukolić, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.01873 · Cited by 252
Clement, A., Kapritsos, M., Lee, S., Wang, Y., Alvisi, L., Dahlin, M., & Riche, T. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629602 · Cited by 247
Bounds on information exchange for Byzantine agreement
Dolev, D., & Reischuk, R. (1985) · Journal of the ACM · doi:10.1145/2455.214112 · Cited by 237
On Expected Constant-Round Protocols for Byzantine Agreement
Katz, J., & Koo, C.-Y. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_27 · Cited by 225
Thunderella: Blockchains with Optimistic Instant Confirmation
Pass, R., & Shi, E. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78375-8_1 · Cited by 213
HotStuff: BFT Consensus in the Lens of BlockchainPreprint
Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.opodis.2022.18 · Cited by 207
Self-citationAublin, P.-L., Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2015) · ACM Transactions on Computer Systems · doi:10.1145/2658994 · Cited by 204
Prime: Byzantine Replication under Attack
Amir, Y., Coan, B., Kirsch, J., & Lane, J. (2011) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2010.70 · Cited by 192
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Abraham, I., Malkhi, D., & Spiegelman, A. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331612 · Cited by 182
Self-citationThe Rampart toolkit for building high-integrity services
Reiter, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_7 · Cited by 174
Self-citationA Modular Approach for the Analysis of Blockchain Consensus Protocol Under Churn (Poster)
Freitas de Souza, L., Tonkikh, A., Tucci-Piergiovanni, S., Sirdey, R., Stan, O., Quero, N., & Kuznetsov, P. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.aft.2025.15 · Cited by 171
Polynomial algorithms for multiple processor agreement
Dolev, D., & Strong, H. R. (1982) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800070.802215 · Cited by 153
Cramer, R. L. (2005) · Data Archiving and Networked Services (DANS) · Cited by 108
The Blockchain Consensus Layer and BFT
Abraham, I., & Malkhi, D. (2017) · Bulletin of the European Association for Theoretical Computer Science · Cited by 102
Self-citationParsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Ramasamy, H. V., & Cachin, C. (2006) · Lecture notes in computer science · doi:10.1007/11795490_9 · Cited by 90
Bosco: One-Step Byzantine Asynchronous Consensus
Song, Y. J., & van Renesse, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87779-0_30 · Cited by 73
Bounds on the time to reach agreement in the presence of timing uncertainty
Attiya, H., Dwork, C., Lynch, N., & Stockmeyer, L. J. (1994) · Journal of the ACM · doi:10.1145/174644.174649 · Cited by 72
Revisiting Fast Practical Byzantine Fault TolerancePreprint
Abraham, I., Gueta, G. G., Malkhi, D., Alvisi, L., Kotla, R., & Martin, J.-P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.01367 · Cited by 57
Self-citationRevisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and ZelmaPreprint
Abraham, I., Gueta, G., Malkhi, D., & Martin, J.-P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10022 · Cited by 35
Self-citationMickens, J. W. (2014) · ;login:: the magazine of USENIX & SAGE · Cited by 9
Cited by
A Scalable Multi-Layer PBFT Consensus for Blockchain
Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. A. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3042392 · Cited by 442
Wang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
Survey: sharding in blockchains
Yu, G., Wang, X., Yu, K., Ni, W., Zhang, J. A., & Liu, R. P. (2020) · IEEE Access · doi:10.1109/access.2020.2965147 · Cited by 267
“Insight 3.”
BackgroundInfluentialA Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
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
- Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I.
- Venue
- Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
- Publisher
- ACM
- Published
- 2019-07-16
- Pages
- 347-356
- OpenAlex
- W2964159515
- Cited by
- 1,028
- References
- 43
- FWCI
- 73.87
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.