Fast-HotStuff: A Fast and Resilient HotStuff Protocol
Mohammad M. Jalalzai, Jianyu Niu, Chen Feng, Fangyu Gai
TL;DR
Fast-HotStuff is a new two-round BFT consensus protocol that maintains responsiveness and efficient view change, offering lower latency and increased robustness compared to HotStuff.
Contribution
It introduces a two-round BFT protocol, Fast-HotStuff, that achieves similar performance to HotStuff with fewer rounds, reducing latency and enhancing robustness.
Findings
Fast-HotStuff has lower latency than HotStuff.
It maintains responsiveness and efficient view change.
It is more robust against performance attacks.
Abstract
The HotStuff protocol is a breakthrough in Byzantine Fault Tolerant (BFT) consensus that enjoys both responsiveness and linear view change. It creatively adds an additional round to classic BFT protocols (like PBFT) using two rounds. This brings us to an interesting question: Is this additional round really necessary in practice? In this paper, we answer this question by designing a new two-round BFT protocol called Fast-HotStuff, which enjoys responsiveness and efficient view change that is comparable to linear view change in terms of performance. Compared to (three-round) HotStuff, Fast-HotStuff has lower latency and is more robust against performance attacks that HotStuff is susceptible to.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Security and Verification in Computing · Cognitive Functions and Memory