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 | On the Size of Pairing-based Non-interactive Arguments |
|---|---|
| What the text proposes | A pairing-based argument in three group elements. The proofs are tiny and cheap to verify. Each circuit needs its own setup, and a leaked setup can forge proofs. |
| Who may write | Jens Groth |
| What is settled | A circuit-specific common reference string. |
| Load-bearing assumption | Do not call a Groth16 deployment trustless. The setup is a trust assumption. |
| What this library says afterwards | Universal setups are PLONK and its relatives, not this paper. |
| Rights | Official external source only |