All Posts
Research

Recursive Folding Schemes for ZK Proofs

Recursive proof composition helps large computations become easier to verify, making zero-knowledge systems more practical for production applications.

Publication

May 20, 20262 min read

Zero-knowledge proofs let one party prove that a computation was performed correctly without revealing all of the underlying data. That property is powerful, but production systems often need to prove many computations, long computations, or repeated state transitions. Verifying each proof separately can become expensive or operationally awkward.

Recursive proof composition addresses this by allowing proofs to verify other proofs. Instead of asking a verifier to check every step directly, the system can compress many proof obligations into a smaller final proof. Folding schemes are one family of techniques for making this kind of recursive verification more efficient.

The intuition is straightforward. Imagine a long computation broken into many steps. Each step produces evidence that it was performed correctly. A folding scheme combines those pieces of evidence progressively, reducing the verification burden while preserving confidence in the full computation. The final proof can represent a much larger execution trace than its size suggests.

This matters for rollups, verifiable computation, privacy-preserving applications, and agent systems. A rollup may need to prove a long sequence of state transitions. A privacy application may need to prove valid behavior without exposing user-specific inputs. An AI or data product may need to prove that a pipeline followed agreed rules. Recursive proofs make these designs more practical because they reduce the cost of verification at the boundary where users, contracts, or other systems need certainty.

There are tradeoffs. Recursive systems are complex to implement, audit, and optimize. Prover time, memory usage, circuit design, and trusted setup assumptions can all matter. A good product team should not use recursion because it sounds advanced. It should use recursion when the application genuinely needs to compress repeated verification into a clean and affordable interface.

For Morca, recursive proof research is relevant because many product directions involve private execution, scalable settlement, or verifiable automation. The goal is not to make users think about folding schemes. The goal is to make advanced guarantees cheap enough that users can rely on them without noticing the machinery.

Recursive Folding Schemes for ZK Proofs | MorcaLabs