Efficient Lattice Polynomial Commitments Secure Post-Quantum ZK Systems
A novel lattice-based polynomial commitment scheme achieves post-quantum security with 8000x smaller proofs, enabling practical, scalable ZK-rollups.
Collaborative zk-SNARKs Enable Private, Decentralized, Scalable Proof Generation
Scalable collaborative zk-SNARKs use MPC to secret-share the witness, simultaneously achieving privacy and 24× faster proof outsourcing.
Sublinear Prover Memory Unlocks Universal Zero-Knowledge Computation and Decentralization
Reframing ZKP generation as a tree evaluation problem cuts prover memory from linear to square-root complexity, enabling ubiquitous verifiable computation.
Generic Folding Scheme Enables Efficient Non-Uniform Verifiable Computation
Protostar introduces a generic folding scheme for special-sound protocols, drastically reducing recursive overhead for complex, non-uniform verifiable computation.
Prom Layer 2 Boosts Ethereum Scaling with Modular ZK-Rollup Technology
Prom's ZK-rollup Layer 2 solution enhances Ethereum's scalability, enabling high-throughput dApps for DeFi, gaming, and NFTs.
