ZKP Frontier Tracker 🎯零知识证明 前沿热点追踪 🎯ZKP 最前線追跡🎯
Wed星期三水曜日
09.10
2025
https://eprint.iacr.org/2025/1390
Beriane et al. proposed an optimization method for zk-Rollup architecture backend verification in their paper, using polynomial aggregation and scalar decomposition techniques to significantly reduce on-chain verification costs.Beriane 等人在论文中提出了一种优化zk-Rollup架构后端验证的方法，通过多项式聚合和标量分解等技术显著降低了链上验证成本。Berianeらは論文において、多項式集約とスカラー分解技術を用いてzk-Rollupアーキテクチャのバックエンド検証を最適化する手法を提案し、オンチェーンでの検証コストを大幅に削減しました。
NotesNotes要点
- Proposes optimizations for high on-chain verification costs in zk-Rollups
- Key optimization: Reduces G1 exponentiations from 40 to 31, saving 108k Gas per verification
- Replaces FFT with dynamic barycentric interpolation, cutting Gas by 92-95% for sparse polynomials
- Introduces proof aggregation to minimize precompile calls while maintaining 128-bit security
- Experimental results: Total verification cost reduced from 857.2k to 748.45k Gas
- Optimizations are compatible with Pectra upgrade and provide blueprint for efficient on-chain verification