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 | Plonky2: a recursive SNARK stack |
|---|---|
| What the text proposes | Plonky2 publishes a SNARK aimed at fast recursion: a proof can verify other proofs, which is the property a zkEVM uses to fold a large trace. |
| Who may write | Polygon Zero |
| What is settled | The field, the hash, and the gates are the proof system. A circuit written against them is an application. |
| Load-bearing assumption | This note does not quote a proving speed. |
| 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 |