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 | Spartan: Efficient and General-Purpose zkSNARKs without Trusted Setup |
|---|---|
| What the text proposes | Spartan encodes the circuit as a sparse matrix and uses a polynomial commitment so the prover's work tracks the number of constraints more tightly than a dense encoding. |
| Who may write | Srinath Setty |
| What is settled | Sparsity is the saving. A dense encoding pays for zeros. |
| Load-bearing assumption | The paper's costs are asymptotic and experimental for its implementation, not a quote for a product. |
| 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 |