Recursive Proof Folding Enables Constant-Time Verifiable Computation
A new folding scheme for Relaxed R1CS achieves constant-time incremental proof generation, fundamentally enabling scalable verifiable computation.
