Home > Resources > papers > BBHR18-FRI

Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI)

URL: https://drops.dagstuhl.de/storage/00lipics/lipics-vol107-icalp2018/LIPIcs.ICALP.2018.14/LIPIcs.ICALP.2018.14.pdf

Summary

Introduces the FRI (Fast Reed-Solomon IOP of Proximity) protocol — the polynomial commitment scheme at the core of STARK proofs. FRI enables transparent, post-quantum-secure polynomial commitments with logarithmic verification. It is the key ingredient that makes STARKs efficient and is used in systems like StarkWare, Plonky2, and RISC Zero.

Used by

• FRI

Related resources

• Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities (paper, 1980)
• STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)