Recursive Proof Folding Enables Constant-Time Verifiable Computation
A new folding scheme for Relaxed R1CS achieves constant-time incremental proof generation, fundamentally enabling scalable verifiable computation.
Efficiently Updating Zero-Knowledge Proofs for Dynamic Data
This research introduces dynamic zk-SNARKs, a breakthrough enabling efficient, incremental proof updates crucial for verifiable AI and evolving blockchain states.