# All You Need is DAG

arXiv: https://arxiv.org/abs/2102.08325 · HTML: https://mlsanity.com/paper/2102.08325/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Feb 2021.

## Built on by (most cited first, 4 of 4)

- [Foundations for Grassroots Democratic Metaverse](https://mlsanity.com/paper/2203.04090/) (2022)
- [DeFL: Decentralized Weight Aggregation for Cross-silo Federated Learning](https://mlsanity.com/paper/2208.00848/) (2022)
- [Agora: Toward Autonomous Bug Detection in Production-Level Consensus Protocols with LLM Agents](https://mlsanity.com/paper/2605.29910/) (2026)
- [MuPlon: Multi-Path Causal Optimization for Claim Verification through Controlling Confounding](https://mlsanity.com/paper/2509.25715/) (2025)

## Abstract (arXiv)

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 messages proposed by correct processes eventually get decided. 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.