All You Need is DAG
By Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, Alexander Spiegelman. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2021
307 citations recorded by the source corpus.
We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all values proposed by correct processes eventually get delivered. We construct DAG-Rider in two layers: In the first layer, processes reliably broadcast their proposals and build a structured Directed Acyclic Graph (DAG) of the communication among them. In the second layer, processes locally observe their DAGs and totally order all proposals with no extra communication.
View Paper: https://www.semanticscholar.org/paper/a40fa41177feb0a9aa59fff45caa4cfa7058fd51
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Neil Giridharan
- Alberto Sonnino
- Eleftherios Kokoris-Kogias
- George Danezis
- Lefteris Kokoris-Kogias
- Alexander Spiegelman
- Binghui Wang
- Prateek Mittal
Citations in the corpus
- Bullshark: DAG BFT Protocols Made Practical (2022, methodology): “Following DAG-Rider [25], our result focuses on the Byzantine”
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus (2021, methodology): “This mechanism’s safety argument is similar to DAG-Rider [28], and we provide here only an intuition.”