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 | Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS |
|---|---|
| What the text proposes | A preprocessing zkSNARK whose structured reference string is universal and can be updated, rather than baked for one circuit in a ceremony that must be trusted forever. The paper improves on Sonic's costs. It is still a SNARK, with a setup. |
| Who may write | Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely and Nicholas Ward |
| What is settled | A universal SRS is created once and can be updated. |
| Load-bearing assumption | A universal SRS is still a structured string. Losing the assumption means losing the proof system. |
| What this library says afterwards | The paper's benchmarks are the authors' implementation, not a network. |
| Rights | Official external source only |