Article Instance

HTTP 200 OK
Allow: GET
Content-Type: application/json
Vary: Accept

{
    "pk": 57194,
    "title": "[Solution] Mir-BFT: Scalable and Robust BFT for Decentralized Networks",
    "subtitle": null,
    "abstract": "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.\nMir-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.\nMir-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 “safety-wise”, with changes needed to accommodate novel featuresrestricted to PBFT liveness.",
    "language": "en",
    "license": {
        "name": "Creative Commons Attribution-NonCommercial  4.0",
        "short_name": "CC BY-NC 4.0",
        "text": "Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.\n\nNonCommercial — You may not use the material for commercial purposes.\n\nNo additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.",
        "url": "https://creativecommons.org/licenses/by-nc/4.0"
    },
    "keywords": [],
    "section": "Articles",
    "is_remote": true,
    "remote_url": "https://escholarship.org/uc/item/36g369xq",
    "frozenauthors": [
        {
            "first_name": "Chrysoula",
            "middle_name": "",
            "last_name": "Stathakopoulou",
            "name_suffix": "",
            "institution": "IBM Research Europe - Zurich, ETH Zürich",
            "department": ""
        },
        {
            "first_name": "Tudor",
            "middle_name": "",
            "last_name": "David",
            "name_suffix": "",
            "institution": "Oracle Labs",
            "department": ""
        },
        {
            "first_name": "Matej",
            "middle_name": "",
            "last_name": "Pavlovic",
            "name_suffix": "",
            "institution": "IBM Research Europe - Zurich",
            "department": ""
        },
        {
            "first_name": "Marko",
            "middle_name": "",
            "last_name": "Vukolić",
            "name_suffix": "",
            "institution": "Protocol Labs",
            "department": ""
        }
    ],
    "date_submitted": "2022-10-24T08:20:50Z",
    "date_accepted": "2022-10-24T08:20:50Z",
    "date_published": "2022-01-01T00:00:00Z",
    "render_galley": null,
    "galleys": [
        {
            "label": "",
            "type": "pdf",
            "path": "https://journalpub.escholarship.org/jsys/article/57194/galley/43391/download/"
        }
    ]
}