2 papers
cs.IT2025
A divide-and-conquer sumcheck protocol
Christophe Levrat, Tanguy Medevielle, Jade Nardi
We present a new sumcheck protocol called Fold-DCS (Fold-Divide-and-Conquer-Sumcheck) for multivariate polynomials based on a divide-and-conquer strategy. Its round complexity and…
cs.CC2025
Interactive Oracle Proofs of Proximity to Codes on Graphs
Hugo Delavenne, Tanguy Medevielle, Élina Roussel
We design an Interactive Oracle Proof of Proximity (IOPP) for codes on graphs inspired by the FRI protocol. The soundness is significantly improved compared to the FRI, the complex…