Complexity-Preserving SNARKs via Recursive Composition and Proof-Carrying Data
The first complexity-preserving SNARK in the plain model eliminates expensive setup, enabling efficient, publicly verifiable, and composable computation.
