Equifficient Polynomial Commitments Achieve Smallest Proof Size and Fastest SNARKs
Equifficient Polynomial Commitments are a new primitive that enforces polynomial basis representation, enabling SNARKs with 160-byte proofs and triple-speed proving.
Equifficient Polynomial Commitments Enable Ultra-Succinct, Faster Zero-Knowledge Proofs
Equifficient Polynomial Commitments introduce a new cryptographic primitive that separates linear and nonlinear constraints, setting the new frontier for zk-SNARK efficiency.
