Limitless Scalability: A High-Throughput and Replica-Agnostic BFT Consensus
Chenyu Zhang, Xiulong Liu, Hao Xu, Haochen Ren, Muhammad Shahzad, Guyue Liu, Keqiu Li
Abstract
—Traditional Byzantine Fault Tolerance (BFT) consensus protocols adopt a star topology with a leader to handle all message transmission, causing performance to degrade rapidly as replicas grow. Recently, many studies have sought to improve scalability by exploring multi-layer topology (e.g., tree structures) to reduce the leader’s fanout. However, these approaches either depend on a polynomial fanout to preserve fault tolerance or are constrained by the impact of topology depth on throughput, ultimately leading to only modest scalability gains. To this end, we propose Tide, the first leader-based BFT protocol that maintains robust performance as replica count grows, which is enabled by our design of logarithmic-fanout topology and high-parallel pipelining. Tide utilizes redundant connections as a key insight in topology, reducing fanout without compromising resilience. Tide further introduces a novel pipelining where inter-layer interactions dynamically determine the degree of proposal parallelism, thereby decoupling throughput from topology depth. Real-world experiments with 100 cloud servers demonstrate that as the replica count scales from 100 to 1,000, state-of-the-art protocols experience a 65% to 90% decrease in throughput and a 50× increase in latency. In contrast, Tide maintains a replica-agnostic high throughput of around 50ktps, over 5x higher than others, while its latency remains at 0.3s-0.4s.
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 78ea8a64-5b7d-4fd0-965a-bd22d81de44cBuilds on14
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly et al.S&P 2018 · 1,145 citations
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 1,084 citations
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 259 citations
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 255 citations
Related papers
- Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted ComponentsShaokang Xie, Dakai Kang, Hanzheng Lyu, Jianyu Niu et al.VLDB 2026 · 8 citations
- MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant ConsensusZeshun Peng, Yanfeng Zhang, Tinghao Feng, Weixing Zhou et al.ICDE 2025 · 1 citation
- Scaling Blockchain Consensus via a Robust Shared MempoolFangyu Gai, Jianyu Niu, Ivan Beschastnikh, Chen Feng et al.ICDE 2023 · 25 citations
- Chitu: Avoiding Unnecessary Fallback in Byzantine ConsensusRongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan et al.USENIX ATC 2025 · 3 citations
- Sailfish: Towards Improving the Latency of DAG-Based BFTNibesh Shrestha, Rohan Shrothrium, Aniket Kate, Kartik NayakS&P 2025
