Recursion in zero-knowledge proofs: the zk endgame
Thread152 words24 likes
Short introduction to recursion: proofs verify other proofs, nesting succinctness into one compact proof, which makes a proof system general purpose and enables recursive rollup structures like app-specific L3s.
Key claims
Recursion nests succinct proofs to verify inner proofs inside a circuit
It enables app-specific L3s on top of a general L2
0/ 馃殌 THE ZK ENDGAME - RECURSION
brief introduction to the concept of recursion in the context of zero knowledge proofs
馃У (0/4)
1/ on a high level, the idea of recursion is similar to folding as the main goal is to increase the efficiency of zk proof verification
2/ recursiveness as a property of a proof system means that the protocol is scalable and capable of proving arbitrarily complex facts, making it a "general purpose" protocol that can be used for a wide range of zero-knowledge applications
3/ an important benefit that comes with that, is that proofs can verify other proofs, allowing for recursive rollup structures (e.g. application-specific L3s) on top of the generalized L2
4/ so basically recursion means nesting succinctness of zk proofs to get a very succinct recursive proof that verifies some zk proofs inside of its circuit. The prover proves that they verified some inner proofs