Invited Paper: Lessons from HotStuff
Authors: 
Dahlia Malkhi, Maofan YinAuthors Info & Claims
Dahlia Malkhi, Maofan YinAuthors Info & ClaimsArticle No.: 3, Pages 1 - 8
Abstract
This article will take you on a journey to the core of blockchains, their Byzantine consensus engine, where HotStuff emerged as a new algorithmic foundation for the classical Byzantine generals consensus problem. The first part of the article underscores the theoretical advances HotStuff enabled, including several models in which HotStuff-based solutions closed problems which were opened for decades. The second part focuses on HotStuff performance in real life setting, where its simplicity drove adoption of HotStuff as the golden standard for blockchain design, and many variants and improvements built on top of it. Both parts of this document are meant to describe lessons drawn from HotStuff as well as dispel certain myths.
References
[1]
Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Rama Kotla, and Jean-Philippe Martin. 2017. Revisiting Fast Practical Byzantine Fault Tolerance. arXiv:cs.DC/1712.01367
[2]
Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (2019).
[3]
Mark Abspoel, Thomas Attema, and Matthieu Rambaud. 2020. Malicious security comes for free in consensus with leaders. Cryptology ePrint Archive (2020).
[4]
Marcos Kawazoe Aguilera and Sam Toueg. 1999. A simple bivalency proof that t-resilient consensus requires t+ 1 rounds. Inform. Process. Lett. 71, 3--4 (1999), 155--158.
[5]
Gabriel Bracha. 1987. Asynchronous Byzantine Agreement Protocols. Inf. Comput. 75 (1987), 130--143.
[6]
Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation. University of Guelph.
[7]
Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. arXiv preprint arXiv:1710.09437 (2017).
[8]
Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. IACR Cryptol. ePrint Arch. (2001), 6. http://eprint.iacr.org/2001/006
[9]
Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, February 22--25, 1999, Margo I. Seltzer and Paul J. Leach (Eds.). USENIX Association, 173--186. https://dl.acm.org/citation.cfm?id=296824
[10]
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2022. Byzantine Consensus Is Θ(n2): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!. In International Symposium on Distributed Computing.
[11]
Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. 2009. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI'09). USENIX Association, 153--168.
[12]
George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5 - 8, 2022, Yérom-David Bromberg, Anne-Marie Kermarrec, and Christos Kozyrakis (Eds.). ACM, 34--50.
[13]
Danny Dolev and Rüdiger Reischuk. 1985. Bounds on information exchange for Byzantine agreement. Journal of the ACM (JACM) 32, 1 (1985), 191--204.
[14]
Eli Gafni. 1998. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC '98).
[15]
Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. 2022. Jolteon and Ditto: Network-adaptive efficient consensus with asynchronous fallback. In Financial Cryptography and Data Security: 26th International Conference, FC 2022. Springer, 296--315.
[16]
Neil Giridharan, Heidi Howard, Ittai Abraham, Natacha Crooks, and Alin Tomescu. 2021. No-commit proofs: Defeating livelock in BFT. Cryptology ePrint Archive (2021).
[17]
Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: A Scalable and Decentralized Trust Infrastructure. In Proceedings - 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2019 (Proceedings - 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2019). 568--580.
[18]
Mohammad M Jalalzai, Jianyu Niu, Chen Feng, and Fangyu Gai. 2020. Fast-HotStuff: A fast and resilient HotStuff protocol. arXiv preprint arXiv:2010.11454 (2020).
[19]
Dakai Kang, Sajjad Rahnama, Jelle Hellings, and Mohammad Sadoghi. 2023. Practical View-Change-Less Protocol through Rapid View Synchronization. arXiv:cs.DB/2302.02118
[20]
Jonathan Katz and Chiu-Yuen Koo. 2009. On expected constant-round protocols for Byzantine agreement. J. Comput. System Sci. 75, 2 (2009), 91--112.
[21]
Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. Zyzzyva: Speculative Byzantine Fault Tolerance. In Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles (SOSP '07). Association for Computing Machinery, 45--58.
[22]
Klaus Kursawe and Victor Shoup. 2005. Optimistic Asynchronous Atomic Broadcast. In Automata, Languages and Programming. 204--215.
[23]
Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4, 3 (jul 1982), 382--401.
[24]
Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. 2019. FairLedger: A Fair Blockchain Protocol for Financial Institutions. In International Conference on Principles of Distributed Systems.
[25]
Andrew Lewis-Pye. 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. ArXiv abs/2201.01107 (2022).
[26]
Yuan Lu, Zhenliang Lu, and Qiang Tang. 2022. Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFT. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2022).
[27]
Dahlia Malkhi and Oded Naor. 2022. The Latest View on View Synchronization. https://blog.chain.link/view-synchronization/ (2022).
[28]
Dahlia Malkhi and Kartik Nayak. 2023. Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive, Paper 2023/397. https://eprint.iacr.org/2023/397 https://eprint.iacr.org/2023/397.
[29]
Jean-Philippe Martin and L. Alvisi. 2006. Fast Byzantine Consensus. Dependable and Secure Computing, IEEE Transactions on 3 (08 2006), 202--215.
[30]
James Mickens. 2014. The Saddest Moment. login Usenix Mag. 39, 3 (2014). https://www.usenix.org/publications/login/june14/mickens
[31]
Atsuki Momose and Ling Ren. 2022. Constant Latency in Sleepy Consensus. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7--11, 2022. 2295--2308.
[32]
Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2019. Cogsworth: Byzantine View Synchronization. https://arxiv.org/pdf/1909.05204.pdf (2019).
[33]
Oded Naor and Idit Keidar. 2020. Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. ArXiv abs/2002.07539 (2020).
[34]
Rafael Pass and Elaine Shi. 2017. The Sleepy Model of Consensus. In Advances in Cryptology - ASIACRYPT 2017. Springer International Publishing, 380--409.
[35]
HariGovind V. Ramasamy and Christian Cachin. 2005. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS'05). 88--102.
[36]
Michael K. Reiter. 1994. Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security (CCS '94). Association for Computing Machinery, 68--80.
[37]
Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: DAG BFT protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 2705--2718.
[38]
Chrysoula Stathakopoulou, Tudor David, Matej Pavlovic, and Marko Vukolic. 2022. [Solution] Mir-BFT: Scalable and Robust BFT for Decentralized Networks. J. Syst. Res. 2, 1 (2022).
[39]
Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukolic. 2022. State machine replication scalability made simple. In EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5 - 8, 2022, Yérom-David Bromberg, Anne-Marie Kermarrec, and Christos Kozyrakis (Eds.). ACM, 17--33.
[40]
The Diem Team. 2021. DiemBFT v4: State Machine Replication in the Diem Blockchain. (2021). https://developers.diem.com/docs/technical-papers/state-machine-replication-paper.
[41]
Gavin Wood. 2023. Polkadot: vision for a heterogeneous multi-chain framework. Cryptology ePrint Archive, Paper 2023/397. https://eprint.iacr.org/2023/397 https://eprint.iacr.org/2023/397.
[42]
Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2018. HotStuff: BFT Consensus in the Lens of Blockchain. CoRR abs/1803.05069 (2018). arXiv:1803.05069
[43]
Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC 19). Association for Computing Machinery, 347--356.
Index Terms
- Invited Paper: Lessons from HotStuff
Recommendations
HotStuff: BFT Consensus with Linearity and Responsiveness
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed ComputingWe 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 ...
ZK-BFT: A Zero-knowledge and Byzantine Fault Tolerant Consensus for Permissioned Blockchain Networks
ICBTA '23: Proceedings of the 2023 6th International Conference on Blockchain Technology and ApplicationsConsensus algorithms play an essential role in blockchains, directly impacting their performance. These algorithms involve validating and ordering pending transactions into new blocks, a process that exposes data to consensus nodes, raising privacy ...
A Blockchain Consensus for Message Queue Based on Byzantine Fault Tolerance
Economics of Grids, Clouds, Systems, and ServicesAbstractBlockchain technology is developing rapidly, and many companies that develop and apply blockchain technology have gradually risen. Most companies choose to use the consortium blockchain. Because the consortium blockchain is for small-scale groups ...
Comments
Information & Contributors
Information
Published In
June 2023
103 pages
Copyright © 2023 Owner/Author(s).
This work is licensed under a Creative Commons Attribution-ShareAlike International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 3 of 4 submissions, 75%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 544Total Downloads
- Downloads (Last 12 months)398
- Downloads (Last 6 weeks)68
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in