Kuriyama et al. proposed the SALSAA framework in paper , which optimizes lattice-based succinct arguments by integrating sumcheck techniques, achieving linear-time proving, smaller proof sizes, and supporting broad relations such as R1CS. Kuriyama等人在论文中提出SALSAA框架,通过集成sumcheck技术优化了格基简洁论证,实现了线性时间证明者和更小的证明尺寸,并支持R1CS等广泛关系。
Notes
SALSAA significantly improves lattice-based arguments efficiency via sumcheck integration, reducing proof size by 2-3x compared to RPS/RnR
The framework supports linear-time provers, overcoming the previous bottleneck of quasi-linear norm checks
First to natively support ℓ₂-norm constraints in lattice folding schemes, with highly efficient verification