Design Review of Nova + CycleFold Implementation
TL;DR
Nova turns "prove a long computation" into "prove one step and fold it into a running claim," using a folding scheme for committed relaxed R1CS. CycleFold is a clean way to use a cycle of curves so that (most of) those elliptic-curve costs don't bloat the recursive verifier circuit.
This research paper provides a deep-dive into the architectural nuances and security considerations of combining Nova’s folding proof system with the CycleFold optimization.
Full Paper
Loading paper…