{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T17:30:06Z","timestamp":1777138206777,"version":"3.51.4"},"reference-count":0,"publisher":"California Digital Library (CDL)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Research"],"abstract":"<p>This paper presents Mir-BFT, a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maxi-mizing throughput on wide-area networks (WANs), targetingdeployments in decentralized networks, such as permissionedand Proof-of-Stake permissionless blockchain systems. Mir-BFT is the first BFT protocol that allows multiple lead-ers to propose request batches independently (i.e., parallelleaders), while effectively precluding performance degrada-tion due to request duplication by rotating the assignmentof a partitioned request hash space to leaders. As this mech-anism removes the single-leader bandwidth bottleneck andexposes a computation bottleneck related to authenticatingclients even on a WAN, our protocol further boosts through-put using a client signature verification sharding optimization.Our evaluation shows that Mir-BFT outperforms state-of-the-art single-leader protocols and orders more than 60000 signedBitcoin-sized (500-byte) transactions per second on a widelydistributed setup (100 nodes, 1 Gbps WAN) with typical la-tencies of few seconds. Moreover, our evaluation exposesthe impact of duplicate requests on parallel leader protocolswhich Mir-BFT eliminates. We also evaluate Mir-BFT un-der different crash and Byzantine faults, demonstrating itsperformance robustness. Mir-BFT relies on classical BFT protocol constructs, whichsimplifies reasoning about its correctness. Specifically, Mir-BFT is a generalization of the celebrated and scrutinizedPBFT protocol. In a nutshell, Mir-BFT follows PBFT \u201csafety-wise\u201d, with changes needed to accommodate novel featuresrestricted to PBFT liveness.<\/p>","DOI":"10.5070\/sr32159278","type":"journal-article","created":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T04:22:14Z","timestamp":1666585334000},"source":"Crossref","is-referenced-by-count":23,"title":["[Solution] Mir-BFT: Scalable and Robust BFT for Decentralized Networks"],"prefix":"10.5070","volume":"2","author":[{"given":"Chrysoula","family":"Stathakopoulou","sequence":"first","affiliation":[]},{"given":"Tudor","family":"David","sequence":"additional","affiliation":[]},{"given":"Matej","family":"Pavlovic","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Vukoli\u0107","sequence":"additional","affiliation":[]}],"member":"29705","published-online":{"date-parts":[[2022,1,1]]},"container-title":["Journal of Systems Research"],"original-title":[],"link":[{"URL":"https:\/\/escholarship.org\/content\/qt36g369xq\/qt36g369xq.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T23:40:06Z","timestamp":1777074006000},"score":1,"resource":{"primary":{"URL":"https:\/\/escholarship.org\/uc\/item\/36g369xq"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1,1]]}},"URL":"https:\/\/doi.org\/10.5070\/sr32159278","relation":{},"ISSN":["2770-5501"],"issn-type":[{"value":"2770-5501","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}