Recursive Folding Unlocks Logarithmic Prover Time for Polynomial Commitments
PolyLog introduces a recursive folding primitive to reduce the zero-knowledge prover's commitment time from linear to logarithmic, enabling massive ZK-rollup scaling.
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.
Multi-Linear Commitments Achieve Logarithmic ZK Proof Time
New multi-linear commitment scheme reduces ZK prover complexity to logarithmic time, fundamentally accelerating verifiable computation and on-chain privacy.
