Excited to share eprint.iacr.org/2025/1905.pdf that re-envisions how to use folding/accumulation in succinct proof systems. We provide a new framework to build folding-based SNARKs by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme.

eprint.iacr.org/2025/620.pdf Exciting paper that accelerates Hyperplonk proof generation by 801x over CPUs.