홈 › Papers

Solution: SRB: SCALABLE AND ROBUST BFT FOR DECENTRALIZED NETWORKS

This paper presents SRB, a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs), targeting deployments in decentralized networks, such as permissioned and Proof-of-Stake permissionless blockchain systems. SRB is developed open-source and is planned to be integrated in a major permissioned blockchain project. SRB is the first BFT protocol that allows multiple leaders to propose request batches independently (i.e., parallel leaders), while effectively precluding performance degradation due to request duplication by rotating the assignment of a partitioned request hash space to leaders. As this mechanism removes the single-leader bandwidth bottleneck and exposes a computation bottleneck related to authenticating clients even on a WAN, our protocol further boosts throughput using a client signature verification sharding optimization. Our evaluation shows that SRB outperforms state-of-the-art single-leader protocols and orders more than 60000 signed Bitcoin-sized (500-byte) transactions per second on a widely distributed 100 nodes, 1 Gbps WAN setup, with typical latencies of few seconds. Moreover, our evaluation exposes the impact of duplicate requests on parallel leader protocols which SRB eliminates. We also evaluate SRB under different crash and Byzantine faults, demonstrating its performance robustness. SRB relies on classical BFT protocol constructs, which simplifies reasoning about its correctness. Specifically, SRB is a generalization of the celebrated and scrutinized PBFT protocol. In a nutshell, SRB follows PBFT ``safety-wise'', with changes needed to accommodate novel features restricted to PBFT liveness.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반