Nguyen et al. proposed Hachi, a lattice-based multilinear polynomial commitment scheme in their paper, achieving square-root verification time and compact proofs (~55KB) by integrating Greyhound with ring-switching. Nguyen等人在论文中提出了Hachi,一种基于格的多线性多项式承诺方案,通过结合Greyhound与环切换技术,实现了验证时间的平方根复杂度提升和约55KB的紧凑证明。
Notes
Hachi offers poly(ℓ,λ) proof size and Õ(√2^ℓλ) verifier time for ℓ-variate polynomials under Module-SIS
Achieves Õ(λ) asymptotic improvement over Greyhound, with 12.5x practical speedup
Uses sumcheck protocol but addresses bottlenecks in lattice-based constructions
Novel integration of Greyhound with ring-switching eliminates R_q multiplications for verifier
Generic reduction converts extension field proofs to cyclotomic ring statements
Technique applicable to lattice-based SNARKs for faster verification
Why does verifier time often become a bottleneck in lattice-based polynomial commitment schemes? 在基于格的多项式承诺方案中,为什么验证时间往往会成为瓶颈?
In lattice-based polynomial commitment schemes, verifying multilinear polynomials requires substantial algebraic computation. The verifier must perform costly ring operations and norm checks, causing its cost to grow quickly with the problem size and limiting scalability. 在基于格的多项式承诺中,验证多线性多项式通常需要大量代数运算。验证过程涉及昂贵的环乘法和规范检查,使验证器成本随问题规模快速增长,从而限制系统的可扩展性。
What efficiency issues does standard sumcheck face in lattice-based constructions? 标准 sumcheck 在格基构造中面临哪些效率问题?
Standard sumcheck assumes cheap field operations, but in lattice settings the verifier must often perform many multiplications over the ring R_q. These operations are expensive, making naive sumcheck inefficient. 标准 sumcheck 假设高效的域运算,但在格构造中,验证者往往需要在环 R_q 上执行多次乘法。这些操作代价高昂,使得直接套用 sumcheck 会显著拖慢验证过程。
What are the broader design implications of reducing extension-field proofs to cyclotomic rings? 将扩展域证明归约到分圆环在设计上有何深远影响?
This generic reduction shows that polynomial verification over extension fields can be mapped to more structured ring settings. It improves verifier efficiency and enables a modular, reusable design paradigm for lattice-based SNARK components. 这一通用归约表明,复杂扩展域上的多项式验证可以映射到更受控的环结构中。这不仅提升了验证效率,也为构建模块化、可复用的格基 SNARK 组件提供了新范式。