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 | Halo: Recursive Proof Composition without a Trusted Setup |
|---|---|
| What the text proposes | Recursion for inner-product arguments, without a structured setup. A proof can attest that another proof was checked. That is how a chain can fold a long history into one object. Halo 2 is a later system. |
| Who may write | Sean Bowe, Jack Grigg and Daira Hopwood |
| What is settled | Nested amortization of the inner-product argument. |
| Load-bearing assumption | Recursion does not make the statement true. It compresses verification of whatever was proved. |
| What this library says afterwards | No trusted setup is not the same as no cryptographic assumption. |
| Rights | Official external source only |