Byzantine Ordered Consensus without Byzantine Oligarchy
Yunhao Zhang, Srinath T. V. Setty, Qi Chen, Lidong Zhou, Lorenzo Alvisi
Abstract
The specific order of commands agreed upon when running state machine replication (SMR) is immaterial to faulttolerance: all that is required is for all correct deterministic replicas to follow it. In the permissioned blockchains that rely on Byzantine fault tolerant (BFT) SMR, however, nodes have a stake in the specific sequence that ledger records, as well as in preventing other parties from manipulating the sequencing to their advantage. The traditional specification of SMR correctness, however, has no language to express these concerns. This paper introduces Byzantine ordered consensus, a new primitive that augments the correctness specification of BFT SMR to include specific guarantees on the total orders it produces; and a new architecture for BFT SMR that, by factoring out ordering from consensus, can enforce these guarantees and prevent Byzantine nodes from controlling ordering decisions (a Byzantine oligarchy). These contributions are instantiated in Pompē, 1 a BFT SMR protocol that is guaranteed to order commands in a way that respects a natural extension of linearizability.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4aceec4b-80cc-4c1f-819b-1c6e7d4496eaCited by top-tier papers26
- Red Belly: A Secure, Fair and Scalable Open BlockchainTyler Crain, Christopher Natoli, Vincent GramoliS&P 2021 · 148 citations
- Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious LatencyYingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang et al.CCS 2022 · 72 citations
- The Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocols Analysis, Implementation, and ExperimentationMohammad Javad Amiri, Chenyuan Wu, Divyakant Agrawal, Amr El Abbadi et al.NSDI 2024 · 39 citations
- Non-Atomic Arbitrage in Decentralized FinanceLioba Heimbach, Vabuk Pahari, Eric SchertenleibS&P 2024 · 35 citations
- Basil: Breaking up BFT with ACID (transactions)Florian Suri-Payer, Matthew Burke, Zheng Wang, Yunhao Zhang et al.SOSP 2021 · 22 citations
Builds on6
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Enhancing Bitcoin Security and Performance with Strong Consistency via Collective SigningEleftherios Kokoris-Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi et al.USENIX Security 2016 · 769 citations
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 255 citations
- Order-Fairness for Byzantine ConsensusMahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari JuelsCRYPTO 2020 · 152 citations
- Replicated state machines without replicated executionJonathan Lee, Kirill Nikitin, Srinath T. V. SettyS&P 2020 · 40 citations
Related papers
- Equal Opportunity: A Correctness Condition for Ordered ConsensusYunhao Zhang, Haobin Ni, Soumya Basu, Shir Cohen et al.OSDI 2026
- LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness ProofsLongfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim et al.PLDI 2024 · 12 citations
- Themis: Fast, Strong Order-Fairness in Byzantine ConsensusMahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels et al.CCS 2023 · 50 citations
- Rashnu: Data-Dependent Order-FairnessHeena Nagda, Shubhendra Pal Singhal, Mohammad Javad Amiri, Boon Thau LooVLDB 2024 · 9 citations
- Recover from Excessive Faults in Partially-Synchronous BFT SMRTiantian Gong, Gustavo Franco Camilo, Kartik Nayak, Andrew Lewis-Pye et al.USENIX Security 2025
