Equifficient Polynomial Commitments Enable Fastest, Smallest Zero-Knowledge SNARKs
New Equifficient Polynomial Commitments (EPCs) enforce polynomial basis consistency, yielding SNARKs with record-smallest proof size and fastest prover time.
Equifficient Polynomial Commitments Enable Faster, Smaller zk-SNARKs
Research introduces Equifficient Polynomial Commitments, a new primitive that yields Pari, the smallest SNARK at 160 bytes, and Garuda, a prover three times faster than Groth16.
