HyperNova Recursion System Enables Practical Zero-Knowledge Virtual Machines
HyperNova, a novel recursive proof system, drastically reduces overhead for high-degree constraint computations, making efficient zkVMs a reality.
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.
Generic Folding Scheme Enables Efficient Non-Uniform Verifiable Computation
Protostar introduces a generic folding scheme for special-sound protocols, drastically reducing recursive overhead for complex, non-uniform verifiable computation.
Folding Schemes Enable Efficient Recursive Zero-Knowledge Arguments
A new cryptographic primitive, the folding scheme, dramatically reduces recursive proof overhead, unlocking practical incrementally verifiable computation.