Limitless Scalability: A High-Throughput and Replica-Agnostic BFT Consensus
Chenyu Zhang, Xiulong Liu, Hao Xu, Haochen Ren, Muhammad Shahzad, Guyue Liu, Keqiu Li
摘要
—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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper14
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly 等S&P 2018 · 被引用 1,145 次
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 被引用 1,084 次
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi 等CCS 2016 · 被引用 974 次
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 被引用 259 次
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 被引用 255 次
相关 Paper
- Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted ComponentsShaokang Xie, Dakai Kang, Hanzheng Lyu, Jianyu Niu 等VLDB 2026 · 被引用 8 次
- MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant ConsensusZeshun Peng, Yanfeng Zhang, Tinghao Feng, Weixing Zhou 等ICDE 2025 · 被引用 1 次
- Scaling Blockchain Consensus via a Robust Shared MempoolFangyu Gai, Jianyu Niu, Ivan Beschastnikh, Chen Feng 等ICDE 2023 · 被引用 25 次
- Chitu: Avoiding Unnecessary Fallback in Byzantine ConsensusRongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan 等USENIX ATC 2025 · 被引用 3 次
- Sailfish: Towards Improving the Latency of DAG-Based BFTNibesh Shrestha, Rohan Shrothrium, Aniket Kate, Kartik NayakS&P 2025
