A Fast and Practical Sector-Based BFT Consensus With Sublinear Communication Complexity
- 16 December 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 1820-1837
Abstract
Byzantine fault-tolerant (BFT) consensus protocols are the core components of blockchain. In the process of improving the performance of BFT protocols, existing work faces the following three problems: 1) the binary dilemma between the leader’s performance bottleneck in star-based linear communication and compromised resilience in tree-based sublinear communication; 2) two- or three-round protocols restrict the phase number of one proposal, thereby limiting the number of concurrent proposals and causing high latency. 3) The fixed timeout makes the protocol sensitive to varying network delays. Therefore, this paper proposes Crackle, the first sector-based pipelined BFT protocol with a sublinear communication complexity, for a throughput improvement of consensus protocol with max resilience of $(\mathcal {N}\textrm {-} 1)/3$ . We propose a sector-based communication mode to disseminate messages from the leader to a subset of replicas in each phase to accelerate consensus and split the traditional two-round protocol into $2\mathsf {\kappa }$ phases to increase the basic pipeline scale. We refine the timer strategy so that the timeout $\Delta $ is adjusted with the proposal submission to cope with the changing network environment. We then address two technical challenges: 1) to ensure Quorum Certificate (QC) validation, we design a $\mathit {voteMap} s$ field within each block, and verify QC by the signature aggregation of $\mathit {voteMap} s$ in continuous $\mathsf {\kappa }$ phases; and 2) to achieve pipeline decoupling among shorter phases, we propose a vote-appending mechanism that relaxes the conditions for the leader to send new proposals. We provide comprehensive theoretical proof of the correctness of Crackle, including safety and $\mathit{liveness}$ . Moreover, we implement Crackle based on a public BFT framework and deploy it on 64 cloud servers. Real experimental results reveal that our Crackle protocol achieves up to 10.36x higher throughput and can dynamically adapt to network delay compared with state-of-the-art BFT protocols such as Kauri and Hotstuff.Keywords
Funding Information
- National Natural Science Foundation of China (62232002)
- National Natural Science Foundation of China (62502338)
- China Postdoctoral Science Foundation (2025M771566)
- Postdoctoral Fellowship Program of China Postdoctoral Science Foundation (GZB20250403)
This publication has 51 references indexed in Scilit:
- BRAVE: Benefit-aware data offloading in UAV edge computing using multi-agent reinforcement learningSimulation Modelling Practice and Theory, 2025
- Integrating Data Privacy and Energy Management in Smart Cities With Partial Sustainable IoT NetworksIEEE Access, 2025
- Synergia: Device-Edge Server Association for ISAC-assisted Mobile Edge Computing Systems2024
- Secure and privacy-preserving automated machine learning operations into end-to-end integrated IoT-edge-artificial intelligence-blockchain monitoring system for diabetes mellitus predictionComputational and Structural Biotechnology Journal, 2023
- Marlin: Two-Phase BFT with Linearity2022
- SBFT: A Scalable and Decentralized Trust Infrastructure2019
- State Machine Replication for the Masses with BFT-SMART2014
- Short Signatures from the Weil Pairing2001
- Secure and Efficient Asynchronous Broadcast Protocols2001
- The Elliptic Curve Digital Signature Algorithm (ECDSA)International Journal of Information Security, 2001