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 | Pinocchio: Nearly Practical Verifiable Computation |
|---|---|
| What the text proposes | Compile the program to a quadratic arithmetic program and prove it was satisfied. Verification is a small number of pairings, independent of the program's length, after a trusted setup. |
| Who may write | Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova |
| What is settled | The setup produces a proving key and a verification key. |
| Load-bearing assumption | The setup is trusted. Whoever knows the trapdoor can forge proofs. |
| What this library says afterwards | A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name. |
| Rights | Official external source only |