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 | Symphony: execution-aware consensus and proposer disaggregation |
|---|---|
| What the text proposes | Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it. |
| Who may write | Ritual |
| What is settled | Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check. |
| Load-bearing assumption | This note quotes no latency and no throughput. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |