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 | Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting |
|---|---|
| What the text proposes | The paper compresses an inner-product argument so a circuit proof can be logarithmic without a trusted setup, in the discrete-log model. |
| Who may write | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth and Christophe Petit |
| What is settled | No structured reference string. |
| Load-bearing assumption | Logarithmic is not constant size. Groth16 is still shorter. |
| 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 |