Paper 2021/1138

Optimal Good-case Latency for Rotating Leader Synchronous BFT

Ittai Abraham, Kartik Nayak, and Nibesh Shrestha

Abstract

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\Delta$ ($\Delta$ 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Distributed computingblockchainsconsensus protocolsSMRSynchronyoptimistic responsiveness
Contact author(s)
nxs4564 @ rit edu
History
2021-09-07: received
Short URL
https://ia.cr/2021/1138
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1138,
      author = {Ittai Abraham and Kartik Nayak and Nibesh Shrestha},
      title = {Optimal Good-case Latency for Rotating Leader Synchronous BFT},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1138},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/1138}},
      url = {https://eprint.iacr.org/2021/1138}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.