Document Open Access Logo

Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols

Authors Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, Florian Suri-Payer

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2022.39.pdf
  • Filesize: 0.54 MB
  • 3 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Consensus
  • blockchain
  • BFT

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Modern chained BFT SMR protocols have poor liveness under failures as they require multiple consecutive honest leaders to commit a single block. Siesta, our proposed new BFT SMR protocol, is instead able to commit a block that spans multiple non-consecutive honest leaders. Siesta reduces the expected commit latency of HotStuff by a factor of three under failures, and the worst-case latency by a factor of eight.

Cite As Get BibTex

Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, and Florian Suri-Payer. Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 39:1-39:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.DISC.2022.39

Author Details

Ittai Abraham
  • VMware Research, Herzliya, Israel
Natacha Crooks
  • UC Berkeley, CA, USA
Neil Giridharan
  • UC Berkeley, CA, USA
Heidi Howard
  • Microsoft Research Cambridge, Cambridge, UK
Florian Suri-Payer
  • Cornell University, Ithaca, NY, USA

References

  1. Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, and Florian Suri-Payer. It’s not easy to relax: liveness in chained bft protocols, 2022. URL: https://doi.org/10.48550/arXiv.2205.11652.
  2. Vitalik Buterin and Virgil Griffith. Casper the friendly finality gadget. arXiv preprint, 2017. URL: https://doi.org/10.48550/arXiv.1710.09437.
  3. Mohammad M. Jalalzai, Jianyu Niu, and Chen Feng. Fast-hotstuff: A fast and resilient hotstuff protocol, 2020. URL: https://doi.org/10.48550/arXiv.2010.11454.
  4. The Diem Team. DiemBFT v4: State machine replication in the diem blockchain, 2021. Google Scholar
  5. Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. Hotstuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC '19, 2019. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact