Field-Agnostic Polynomial Commitments Accelerate Multilinear Zero-Knowledge Proofs
A new polynomial commitment scheme, BaseFold, generalizes FRI using foldable codes, eliminating field restrictions and achieving 200x faster ZK prover times.
HyperPlonk’s Multilinear Arithmetization Unlocks Linear Prover Time for ZK-SNARKs
HyperPlonk eliminates the FFT bottleneck in Plonk by using multilinear polynomials over the boolean hypercube, enabling linear-time ZK-proof generation for massive circuits.
Hyper-Efficient Universal SNARKs Decouple Proving Cost from Setup
HyperPlonk introduces a new polynomial commitment scheme, achieving a universal and updatable setup with dramatically faster linear-time proving, enabling mass verifiable computation.