Notes

• The security of small-field hash-based SNARGs relies on the combination of proximity error and list size parameters of linear codes.
• Existing deployment systems operate under capacity mechanism, but security may be overestimated.
• The research proposes a general attack method, and the success probability depends on the list size parameter.
• Analysis of extension codes in small fields shows that combining lower bounds leads to strong attacks.
• This challenges the optimistic assumption of the near-gap conjecture, affecting actual deployment systems.
• The research provides important references for Ethereum Proximity Prize and security evaluation.

• 小域哈希SNARG的安全性依赖线性码的距离保持误差和列表大小两个组合参数
• 现有部署系统在容量机制下操作，但安全性可能被高估
• 研究提出通用攻击方法，其成功概率取决于列表大小参数
• 对扩展码在小基域上的分析显示组合下界会导致强攻击
• 这挑战了接近间隙猜想的乐观假设，影响实际部署系统
• 研究为Ethereum Proximity Prize等安全评估提供重要参考