Embedding a Deterministic BFT Protocol in a Block DAG

by   Maria A. Schett, et al.

This work formalizes the structure and protocols underlying recent distributed systems leveraging block DAGs, which are essentially encoding Lamport's happened-before relations between blocks, as their core network primitives. We then present an embedding of any deterministic Byzantine fault tolerant protocol 𝒫 to employ a block DAG for interpreting interactions between servers. Our main theorem proves that this embedding maintains all safety and liveness properties of 𝒫. Technically, our theorem is based on the insight that a block DAG merely acts as an efficient reliable point-to-point channel between instances of P while also using 𝒫 for efficient message compression.


page 1

page 2

page 3

page 4


Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication

Byzantine fault tolerant (BFT) state machine replication (SMR) is an imp...

The Checkpointed Longest Chain: User-dependent Adaptivity and Finality

Longest-chain protocols such as the one invented by Nakamoto for Bitcoin...

The fault-tolerant cluster-sending problem

The development of fault-tolerant distributed systems that can tolerate ...

Simulating Authenticated Broadcast in Networks of Bounded Degree

The authenticated broadcast is simulated in the bounded-degree networks ...

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance

Traditional Byzantine Fault Tolerance (BFT) state machine replication pr...

StakeCube: Combining Sharding and Proof-of-Stake to build Fork-free Secure Permissionless Distributed Ledgers

Our work focuses on the design of a scalable permissionless blockchain i...

Twins: White-Glove Approach for BFT Testing

Byzantine Fault Tolerant (BFT) systems have seen extensive study for mor...