Alin Tomescu

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

 
  • Sep 15, 2025

tl;dr: For now, this page gathers some resources on FRI1.

$ $

Videos

  • Dan Boneh’s “FRI and Proximity Proofs” ZK whiteboarding session, part 1 and part 2

Papers

  • A summary on the FRI low degree test2, Ulrich Haböck, 2022

Subsequent work

  • STIR: Reed–Solomon Proximity Testing with Fewer Queries3, Arnon et al., 2024
  • WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification4, Arnon et al., 2024

References

For cited works, see below 👇👇

  1. Fast Reed-Solomon Interactive Oracle Proofs of Proximity, by Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev, in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 2018, [URL] ↩

  2. A summary on the {FRI} low degree test, by Ulrich Haböck, in Cryptology {ePrint} Archive, Paper 2022/1216, 2022, [URL] ↩

  3. STIR: Reed–Solomon Proximity Testing with Fewer Queries, by Gal Arnon and Alessandro Chiesa and Giacomo Fenzi and Eylon Yogev, in Cryptology {ePrint} Archive, Paper 2024/390, 2024, [URL] ↩

  4. WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification, by Gal Arnon and Alessandro Chiesa and Giacomo Fenzi and Eylon Yogev, in Cryptology {ePrint} Archive, Paper 2024/1586, 2024, [URL] ↩

Search