PLONK: Universal, Updatable SNARKs with Efficient Prover Performance
PLONK introduces a novel SNARK construction that significantly reduces prover overheads while maintaining universal and updatable trusted setups, enabling practical verifiable computation.
Libra: Optimal Prover Time, Succinct Zero-Knowledge Proofs Achieved
Libra's linear-time GKR prover and efficient zero-knowledge masking reduce proof generation, enabling practical, scalable verifiable computation.
KZG Polynomial Commitments Elevate Blockchain Scalability and Data Integrity
KZG polynomial commitments enable succinct verifiable computation and data representation, fundamentally advancing blockchain scaling.
KZG Commitments Enable Scalable, Cost-Effective Data Availability for Ethereum Rollups
KZG polynomial commitments fundamentally transform blockchain data availability, reducing rollup costs and enhancing scalability through efficient, verifiable off-chain data blobs.
Optimizing ZK-SNARKs by Minimizing Expensive Cryptographic Group Elements
Polymath redesigns zk-SNARKs by shifting proof composition from $mathbb{G}_2$ to $mathbb{G}_1$ elements, significantly reducing practical proof size and on-chain cost.
Constant-Size Polynomial Commitments Unlock Massively Scalable Data Availability Sampling
KZG, a polynomial commitment scheme, provides constant-sized cryptographic proofs, fundamentally enabling efficient Data Availability Sampling for scalable rollups.
Optimal Polynomial Commitment Batching Unlocks Scalable Decentralized Cryptography
New KZG batching algorithm achieves optimal $O(N log N)$ prover time and constant proof size, dramatically accelerating Verifiable Secret Sharing.
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.
Poly-Universal Proofs Achieve Universal Setup and Updatable Security
This new polynomial commitment scheme decouples proof generation from circuit structure, enabling a single, secure, and continuously updatable universal setup.
