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 | Redshift: a transparent SNARK with a universal setup |
|---|---|
| What the text proposes | Redshift proposes a SNARK with a universal and updatable setup, in the transparent-setup line, aimed at proving general circuits without a fresh ceremony per circuit. |
| Who may write | Assimakis Kattis, Konstantin Panarin and Alexander Vlasov |
| What is settled | The paper's commitment scheme and the polynomial protocol are the mechanism. A product that cites Redshift still has to say which version. |
| Load-bearing assumption | This note does not say any current zkEVM runs this construction unmodified. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |