Embedding a Deterministic BFT Protocol in a Block DAG
arXiv:2102.09594 · doi:10.1145/3465084.3467930
Abstract
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.
References in corpus (7)
- Secure History Preservation Through Timeline Entanglement
- The Consensus Number of a Cryptocurrency (Extended Version)
- Blockmania: from Block DAGs to Consensus
- Embedding a Deterministic BFT Protocol in a Block DAG
- Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
- Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
- Verifying the Hashgraph Consensus Algorithm