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 | Nova: Recursive Zero-Knowledge Arguments from Folding Schemes |
|---|---|
| What the text proposes | Incrementally verifiable computation without putting a SNARK inside a SNARK. A folding scheme compresses two instances of a computation into one instance of the same size. Repeating that fold is the recursion. The paper is about prover cost, not about a chain. |
| Who may write | Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla |
| What is settled | A folding scheme reduces two relaxed-R1CS instances to one. |
| Load-bearing assumption | Folding proves the steps that were folded. It does not fetch the data those steps read. |
| What this library says afterwards | A later implementation can choose curves, a non-uniform step, or a different fold. That is no longer this theorem. |
| Rights | Official external source only |