Crites and Stewart in paper disproved multiple Reed-Solomon proximity gap conjectures, supporting the security and efficiency of FRI, DEEP-FRI, and other SNARK systems, and proposed minimal modifications to meet list decoding capacity bounds. Crites和Stewart在论文中证伪了多个Reed-Solomon邻近间隙猜想,这些猜想支撑FRI、DEEP-FRI等SNARK系统的安全性与效率,并提出最小修改方案。
Notes
Disproved multiple Reed-Solomon proximity gap conjectures, affecting the security of FRI, DEEP-FRI, and other SNARK systems
Proposed minimal modifications to meet list decoding capacity bounds
Proved the relationship between related protocols and list decoding, solving open problems
May weaken the security of ZK proof systems relying on these conjectures
Need to re-evaluate the theoretical foundations of existing proof systems
Provides new research directions for coding theory and ZK