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 | Fast Reed-Solomon Interactive Oracle Proofs of Proximity |
|---|---|
| What the text proposes | FRI is the proximity test: fold the polynomial in rounds until a constant remains, and sample enough points that a cheating polynomial is caught. |
| Who may write | Eli Ben-Sasson, Iddo Bentov, Yinon Horesh and Michael Riabzev |
| What is settled | No trapdoor. The security is hash-based. |
| Load-bearing assumption | FRI is a component, not a virtual machine. |
| What this library says afterwards | A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name. |
| Rights | Official external source only |