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 | Aurora: Transparent Succinct Arguments for R1CS |
|---|---|
| What the text proposes | Aurora proves rank-one constraint systems with a transparent setup, using a FRI-style proximity test rather than a pairing. |
| Who may write | Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza and Nicholas P. Ward |
| What is settled | Transparent means the setup is public randomness. |
| Load-bearing assumption | Transparent does not mean trustless in the sense of no assumption. The hash and the code are the assumptions. |
| 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 |