recursive proofs

Checkpoint: CP-007b Status: QUEUED — not yet run. No results exist for this experiment.

Question

Can many small proofs be recursively aggregated into one, and at what cost per aggregated proof?

Why it matters

Recursion is how a fixed per-proof cost becomes a per-batch cost. SP1 already supports compressed/recursive modes, so the first measurement is nearly free.

Gate

Blocked on CP-007.

---

This is a stub. It exists so the roadmap's structure is visible, not to imply work has been done. Nothing in ../../benchmarks/results/ refers to it yet.