Embedding a Deterministic BFT Protocol in a Block DAG

DOI10.1145/3465084.3467930MaRDI QIDQ6201945zbMATH OpenOpenAlexFDO

Authors Maria A. Schett, George Danezis

Publication date 26 March 2024

Published in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.09594

zbMATH Keywords

DAGblockchainByzantine fault tolerant protocols

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

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 $mathcalP$ to employ a block DAG for interpreting interactions between servers. Our main theorem proves that this embedding maintains all safety and liveness properties of $mathcalP$. 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 $mathcalP$ for efficient message compression.

Cited in

(1)

• Faithful simulation of randomized BFT protocols on block DAGs

This page was built for publication: Embedding a Deterministic BFT Protocol in a Block DAG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201945)