Home > Resources > papers > BMNW24-Arc

Arc: Accumulation for Reed–Solomon Codes (Bünz, Mishra, Nguyen, Wang 2024)

Last modified: 2026-10-23

URL: https://eprint.iacr.org/2024/1731

Summary

Gives the first accumulation scheme for proximity claims to Reed–Solomon codes, which supports an unbounded number of accumulation steps using only hash functions (unlike earlier hash-based schemes limited to a bounded depth). This enables proof-carrying data and IVC built from hash-based, plausibly post-quantum primitives with FRI/STARK-style commitments, a key ingredient for recursive transparent proof systems.

Related resources

• Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)