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 | Cordial Miners: Fast and Efficient Consensus for Every Eventuality |
|---|---|
| What the text proposes | Cordial Miners build a DAG with a simple cordial rule for including other miners' blocks, aiming at responsiveness without the certificate tax of the earlier DAG BFTs. |
| Who may write | Idit Keidar, Oded Naor, Ouri Poupko and Ehud Shapiro |
| What is settled | Inclusion of other blocks is a duty in the protocol, not a favour. |
| Load-bearing assumption | The name miner here is not proof of work. |
| What this library says afterwards | A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network. |
| Rights | Official external source only |