Folding Schemes Enable Linear-Time Recursive Zero-Knowledge Computation
Nova's folding scheme fundamentally solves recursive proof composition by accumulating instances instead of verifying SNARKs, unlocking infinite verifiable computation.
