To enable parallel processing, the Directed Acyclic Graph (DAG) structure is introduced to
the design of asyn-chronous Byzantine Fault Tolerant (BFT) consensus protocols, known as …

To improve the throughput of Byzantine Fault Tolerance (BFT) consensus protocols, the
Directed Acyclic Graph (DAG) topology has been introduced to parallel data processing …

Today's practical, high performance Byzantine Fault Tolerant (BFT) consensus protocols
operate in the partial synchrony model. However, existing protocols are often inefficient …

This paper presents a partially synchronous BFT consensus protocol powered by BBCA, a
lightly modified Byzantine Consistent Broadcast (CBC) primitive. BBCA provides a Complete …

Traditional partial synchronous Byzantine fault tolerant (BFT) protocols are confronted with
new challenges when applied to large-scale networks like IoT systems, which bring about …

To parallelize data processing within BFT consensus protocols, Directed Acyclic Graph
(DAG) structures have been integrated into consensus design, shaping the realm of DAG …

Recently, streamlined Byzantine Fault Tolerant (BFT) consensus protocols, such as HotStuff,
have been proposed as a means to circumvent the inefficient view-changes of traditional …

State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as
HoneyBadgerBFT, BEAT, and Dumbo, have shown a performance comparable to partially …

To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …

Asynchronous or partially synchronous Byzantine fault-tolerant (BFT) protocols can tolerate
up to one-third Byzantine faults, while synchronous Byzantine fault-tolerant protocols can …