LatticeFold+

Problem Statement

LatticeFold+ is the new folding protocol that improves LatticeFold in every respect:Makes proving fasterMakes the verification circuit simplerMakes folding proofs shorterLink to the LatticeFold+ paper: https://eprint.iacr.org/2025/247.pdf Link to the LatticeFold paper: https://eprint.iacr.org/2024/257.pdfThis repository provides anexperimental reference implementation of Latticefold+(L), a novel, quantum-secure SNARK-folding scheme over small (64-bit) fields. It brings the theoretical Latticefold+ protocol into working code—leveraging lattice-based Aitaj commitments, NTT-packed cyclotomic rings, and an integrated range-proof step to fold incremental proofs with minimal overhead.

Solution

We built this inRust(1.80+) using thearkworkscrates for finite‐field and NTT operations, plusrayonfor parallelism. We borrowed Nethermind’slsetup and Aitaj commitments, then re-implemented the Latticefold+ range-proof step with compile-time chunking macros and SIMD-accelerated NTT via Rust’spacked_simd.