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 | HyperNova: Recursive Arguments for Customizable Constraint Systems |
|---|---|
| What the text proposes | HyperNova generalises folding to customisable constraint systems so a recursive proof can follow the arithmetisation the circuit actually uses. |
| Who may write | Abhiram Kothapalli and Srinath Setty |
| What is settled | The relation being folded is no longer fixed as plain R1CS. |
| Load-bearing assumption | This does not make proving free. |
| 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 |