Recursive Proof Composition Achieves Logarithmic-Time Zero-Knowledge Verification
A novel folding scheme reduces the verification of long computations to a logarithmic function, fundamentally decoupling security from computational scale.
Hyper-Efficient Prover Unlocks Universal Transparent Zero-Knowledge Scaling
This new HyperPlonk scheme achieves linear prover time for universal transparent SNARKs, fundamentally accelerating verifiable computation for all decentralized applications.
