License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2022.39
URN: urn:nbn:de:0030-drops-172305
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/17230/
Abraham, Ittai ;
Crooks, Natacha ;
Giridharan, Neil ;
Howard, Heidi ;
Suri-Payer, Florian
Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols
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.
BibTeX - Entry
@InProceedings{abraham_et_al:LIPIcs.DISC.2022.39,
author = {Abraham, Ittai and Crooks, Natacha and Giridharan, Neil and Howard, Heidi and Suri-Payer, Florian},
title = {{Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {39:1--39:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17230},
URN = {urn:nbn:de:0030-drops-172305},
doi = {10.4230/LIPIcs.DISC.2022.39},
annote = {Keywords: Consensus, blockchain, BFT}
}
|
Keywords: |
|
Consensus, blockchain, BFT |
|
Collection: |
|
36th International Symposium on Distributed Computing (DISC 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
17.10.2022 |
