Throughput of Byzantine Broadcast

• Published in: Journal of parallel and distributed computing Vol. 203; p. 105104
• Main Authors: Hou, Ruomu, Yu, Haifeng, Saxena, Prateek
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.09.2025
• Subjects: Byzantine broadcast; Malicious majority; Throughput; Throughput-to-bandwidth ratio; Throughput; Byzantine broadcast; Throughput-to-bandwidth ratio; Malicious majority
• ISSN: 0743-7315
• DOI: 10.1016/j.jpdc.2025.105104

Byzantine broadcast is a classic problem in distributed computing, with a wide variety of target applications. This work is motivated by the emerging new application of byzantine broadcast in blockchains, which has prompted us to consider the throughput of byzantine broadcast protocols. To our knowledge, this work is the very first to investigate the throughput of byzantine broadcast. We first show that the throughput of existing byzantine broadcast protocols are all far from ideal. We then obtain a simple upper bound on the throughput of byzantine broadcast protocols, showing that no protocol can do better than this upper bound. As the central contribution of this work, we propose a novel byzantine broadcast protocol called OverlayBB. OverlayBB achieves the optimal throughput, and is the very first protocol that can do so. Our protocol does not sacrifice other aspects of the performance. •Investigating the throughput of byzantine broadcast protocols.•Achieving optimal throughput in byzantine broadcast.•Fragmentation and delay compensation in byzantine broadcast.