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 | HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates |
|---|---|
| What the text proposes | HyperPlonk replaces that transform with a sumcheck so the prover is linear in the number of gates, and it allows higher-degree custom gates. |
| Who may write | Binyi Chen, Benedikt Bünz, Dan Boneh and Zhenfei Zhang |
| What is settled | Sumcheck is the new backbone. |
| Load-bearing assumption | Linear time is not free in constants. The paper is not a benchmark of 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 |