State machine replication scalability made simple
Chrysoula Stathakopoulou, Matej Pavlovic, Marko Vukolic
Abstract
Consensus, state machine replication (SMR) and total order broadcast (TOB) protocols are notorious for being poorly scalable with the number of participating nodes. Despite the recent race to reduce overall message complexity of leader-driven SMR/TOB protocols, scalability remains poor and the throughput is typically inversely proportional to the number of nodes. We present Insanely Scalable State Machine Replication, a generic construction to turn leader-driven protocols into scalable multi-leader ones. For our scalable SMR construction we use a novel primitive called Sequenced (Total Order) Broadcast (SB) which we wrap around PBFT, HotStuff and Raft leader-driven protocols to make them scale. Our construction is general enough to accommodate most leader-driven ordering protocols (BFT or CFT) and make them scale. Our implementation improves the peak throughput of PBFT, HotStuff, and Raft by 37x, 56x, and 55x, respectively, at a scale of 128 nodes.
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.
Cited by top-tier papers21
- Shoal++: High Throughput DAG BFT Can Be Fast and Robust!Balaji Arun, Zekun Li, Florian Suri-Payer, Sourav Das et al.NSDI 2025 · 37 citations
- Dissecting BFT Consensus: In Trusted Components we Trust!Suyash Gupta, Sajjad Rahnama, Shubham Pandey, Natacha Crooks et al.EuroSys 2023 · 27 citations
- PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation MechanismsGengrui Zhang, Fei Pan, Sofia Tijanic, Hans-Arno JacobsenICDE 2024 · 21 citations
- Nezha: Deployable and High-Performance Consensus Using Synchronized ClocksJinkun Geng, Anirudh Sivaraman, Balaji Prabhakar, Mendel RosenblumVLDB 2023 · 15 citations
- Sui Lutris: A Blockchain Combining Broadcast and ConsensusSam Blackshear, Andrey Chursin, George Danezis, Anastasios Kichidis et al.CCS 2024 · 14 citations
Builds on1
Related papers
- Ladon: High-Performance Multi-BFT Consensus via Dynamic Global OrderingHanzheng Lyu, Shaokang Xie, Jianyu Niu, Chen Feng et al.EuroSys 2025 · 6 citations
- Bandle: Asynchronous State Machine Replication Made EfficientBo Wang, Shengyun Liu, He Dong, Xiangzhe Wang et al.EuroSys 2024 · 4 citations
- RL-Paxos: Relieving the Leader's Burden with Efficient Task Offloading in Distributed ConsensusChenhao Zhang, Jinquan Wang, Meng Han, Bing Wei et al.ICDE 2026
- Recover from Excessive Faults in Partially-Synchronous BFT SMRTiantian Gong, Gustavo Franco Camilo, Kartik Nayak, Andrew Lewis-Pye et al.USENIX Security 2025
- The Pipes Model for Latency and Throughput AnalysisAndrew Lewis-Pye, Kartik Nayak, Nibesh ShresthaS&P 2026 · 1 citation
