Recursive Proofs Are Here

Proof of a proof of a proof. Sounds redundant but it enables infinite compression and composition.

A proof of a proof of a proof. It sounds completely redundant but it actually enables infinite compression and composition of computational proofs. I find this one of the most elegant concepts in modern cryptography. You can compress an entire month of trading history into a single proof. Not summaries or aggregates but literally every single trade, every parameter, every intermediate state, all verified by one small proof that takes milliseconds to verify. Each new proof validates the previous proof plus the new data. The recursion depth is theoretically unlimited. Each level aggregates proofs from the previous level. The final proof is the same size whether it represents 10 transactions or 10 million. This isn't just an optimization.