ON · 2026-10-22 02:32 UTC

Nova: Efficient and Scalable Zero-Knowledge Proofs Through Folding

Nova is a cryptographic approach for incrementally verifiable computation using folding schemes instead of traditional SNARKs, offering efficiency and scalability for zero-knowledge proofs. The system works by folding previous computation steps into current steps using R1CS instances, reducing computational overhead and achieving a constant-size verifier circuit.

Loading the story on Tree News…