ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Thu 星期四
10.23
2025
Symphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity Folding https://eprint.iacr.org/2025/1905
Binyi Chen et al. in paper proposed Symphony, a lattice-based high-arity folding SNARK, avoiding hash embedding in SNARK circuits, with memory efficiency, parallelization, and post-quantum security. Binyi Chen等人在论文中提出了Symphony，一种基于格的高阶折叠SNARK，避免在电路中嵌入哈希函数，具有内存高效、并行化和后量子安全等特性。
Notes
- Symphony avoids hash embedding in SNARK circuits, reducing security risks and proof overhead
- Adopting lattice-based folding scheme, providing post-quantum security guarantees
- Supporting memory efficiency, parallelization, and streaming processing, optimizing performance
- Proof size and verification time are multi-polynomial, enhancing scalability
- Universal compiler can convert folding scheme to SNARK, enhancing flexibility
- Having potential advantages in zkVM and proof learning applications