HotStuff: BFT Consensus with Linearity and Responsiveness

By Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2019

1,300 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/50dd47f615068b0eac1eeed60c91e95549aed3d4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus (2021, methodology): “1 Eventually synchronous consensus Established consensus algorithms operating under partial synchrony, such as Hotstuff [35] or LibraBFT [10], can leverage Narwhal to improve their performance.”
A Scalable Multi-Layer PBFT Consensus for Blockchain (2020, background): “The HotStuff leverages threshold signature to reduce communication complexity [30].”
All You Need is DAG (2021, background): “In contrast, many Byzantine State Machine Replication (SMR) protocols [17, 37, 43] require that in an infinite run, an infinite number of decisions are made, but not every proposed valid value has to be decided.”