Schett, MA;
Danezis, G;
(2021)
Embedding a Deterministic BFT Protocol in a Block DAG.
In:
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing.
(pp. pp. 177-186).
ACM
Preview |
Text
Schett_2102.09594v2.pdf - Accepted Version Download (398kB) | Preview |
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 ℘ while also using ℘ for efficient message compression.
Type: | Proceedings paper |
---|---|
Title: | Embedding a Deterministic BFT Protocol in a Block DAG |
Event: | 2021 ACM Symposium on Principles of Distributed Computing |
ISBN-13: | 9781450385480 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1145/3465084.3467930 |
Publisher version: | https://doi.org/10.1145/3465084.3467930 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10133256 |
Archive Staff Only
![]() |
View Item |