Linear-Time Prover SNARK with Constant Proof Size Achieves ZKP Optimality
Samaritan introduces a multilinear polynomial commitment scheme that achieves the theoretical optimum: linear prover time and constant proof size for scalable verifiable computation.
Zeromorph Unifies Multilinear Proofs with Efficient Univariate Commitments
Zeromorph is a cryptographic recipe that maps complex multilinear polynomials to simpler univariate forms, radically reducing ZK-SNARK verification cost.
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.
