Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and
liveness guarantees for distributed systems that must operate in the presence of arbitrary …

The emergence of numerous consensus algorithms for distributed systems has resulted from
the swift advancement of blockchain and its related technologies. Consensus algorithms …

Blockchain has found applications to track ownership of digital assets. Yet, several
blockchains were shown vulnerable to network attacks. It is thus crucial for companies to …

Consensus, state machine replication (SMR) and total order broadcast (TOB) protocols are
notorious for being poorly scalable with the number of participating nodes. Despite the …

Byzantine fault tolerant (BFT) consensus protocols are becoming an appealing solution to
blockchains. As most blockchain systems are deployed on Wide Area Networks (WANs) …

This paper presents Mir-BFT (or, simply, Mir), a robust Byzantine fault-tolerant (BFT) total
order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs) …

Partially synchronous Byzantine consensus protocols typically structure their execution into
a sequence of views, each with a designated leader process. The key to guaranteeing …

Byzantine Fault-Tolerant (BFT) protocols cover a broad spectrum of design dimensions from
infrastructure settings, such as the communication topology, to more technical features, such …

Existing Byzantine fault tolerance (BFT) protocols face significant challenges in safety,
scalability, throughput, and latency. We present a new BFT protocol, Gosig, for the …

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication
protocol for the partially synchronous model with theoretical performance bounds during …