Year: 2026
Type: preprint
Abstract: The Flowering protocol of Delavenne, Medevielle and Roussel (ISIT 2025, arXiv:2501.14337) and its generalization by Delavenne and Lallemand (CANS 2025, arXiv:2508.10510) are Interactive Oracle Proofs of Proximity (IOPPs) for codes on graphs with Reed-Solomon local codes. Similarly to FRI for Reed-Solomon codes, the graph is recursively cut into isomorphic subgraphs and the word is folded along the cuts. We show that the soundness claims of both papers are false. The commit soundness proofs identify the vertex distance of a word to the code with the fraction of its unsatisfied local constraints, while only one inequality holds, in the wrong direction. We furthermore give an explicit counterexample.
Source: arXiv (Cornell University)
Author: Delavenne, Hugo
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235122718
