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 | Scalable Multi-party Computation for zk-SNARK Parameters |
|---|---|
| What the text proposes | Powers of Tau is a multi-party computation that builds the structured reference string so that if one participant deletes their randomness, the trapdoor is gone. |
| Who may write | Sean Bowe, Ariel Gabizon and Ian Miers |
| What is settled | One honest deletion is the security claim. |
| Load-bearing assumption | A ceremony with no honest participant is a trusted party. |
| 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 |