Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | All You Need is DAG |
|---|---|
| What the text proposes | Replicas reliably broadcast proposals into a round-structured DAG. Once the DAG is local, each replica can read a total order off it without another round of consensus messages. The paper is the asynchronous, optimally resilient version of that idea. |
| Who may write | Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor and Alexander Spiegelman |
| What is settled | Each round, a replica broadcasts a vertex that points at a quorum of vertices from the previous round. |
| Load-bearing assumption | A known committee is assumed. Open membership is outside the paper. |
| What this library says afterwards | Practical garbage collection and the happy path under synchrony are what later papers, including Bullshark, add. |
| Rights | Official external source only |