2026-08-10T16:18:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15802 2024-03-06T10:56:12Z ddc:004 open_access

Optimal Good-Case Latency for Rotating Leader Synchronous BFT Abraham, Ittai Nayak, Kartik Shrestha, Nibesh Distributed Computing Byzantine Fault Tolerance Synchrony This paper explores the good-case latency of synchronous Byzantine Fault Tolerant (BFT) consensus protocols in the rotating leader setting. We first present a lower bound that relates the latency of a broadcast when the sender is honest and the latency of switching to the next sender. We then present a matching upper bound with a latency of 2Δ (Δ is the pessimistic synchronous delay) with an optimistically responsive change to the next sender. The results imply that both our lower and upper bounds are tight. We implement and evaluate our protocol and show that our protocol obtains similar latency compared to state-of-the-art stable-leader protocol Sync HotStuff while allowing optimistically responsive leader rotation. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ittai Abraham and Kartik Nayak and Nibesh Shrestha 2022 Is Part Of LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2021.27 urn:nbn:de:0030-drops-158022 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.27 eng https://creativecommons.org/licenses/by/4.0/legalcode