Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
A novel proof system reduces ZKP memory from linear to square-root scaling, fundamentally unlocking privacy-preserving computation for all mobile and edge devices.
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.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation
Introducing the first ZKP system with memory scaling to the square-root of computation size, this breakthrough enables privacy-preserving verification on edge devices.
