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 | Constant-Size Commitments to Polynomials and Their Applications |
|---|---|
| What the text proposes | Commit to a polynomial and later open it at a point, in constant size, with a pairing. The commitment is binding if the setup's trapdoor stays secret. Modern data-availability schemes use this as a brick. The paper is older than those schemes. |
| Who may write | Aniket Kate, Gregory M. Zaverucha and Ian Goldberg |
| What is settled | A structured reference string of encrypted powers. |
| Load-bearing assumption | KZG is not a blockchain, a rollup, or a sampling protocol. It is a commitment. |
| What this library says afterwards | A universal setup shared by many teams is still a setup. Updatability has to be proved of the ceremony they actually ran. |
| Rights | Official external source only |