Recursive Proof

A zero-knowledge proof that verifies other proofs — because verifying a proof is itself a computation, a proof can attest that it correctly checked earlier proofs. This lets many proofs be aggregated into one cheap-to-verify proof, or a huge computation to be proven in pieces while keeping the final proof small. Recursion (and folding schemes like Nova) is a core reason ZK systems scale, but it concentrates trust in the recursion logic — a flaw there compromises everything the proof covers.