Nova

Nova is a folding scheme for incrementally verifiable computation: each new step is combined with an accumulated proof state, so verification work does not grow with the number of steps. A separate compression proof can make the final result easier to check externally. Unlike a standalone Groth16 proof, Nova's final size and setup assumptions depend on the selected commitment and compression layers.