Lattice-Based Polynomial Commitments Unlock Post-Quantum Succinct Zero-Knowledge Proofs
Greyhound, a new lattice-based polynomial commitment scheme, achieves sublinear verification and 8000X smaller proofs, ensuring quantum-safe scalability.
Greyhound Achieves Post-Quantum Polynomial Commitments with Unprecedented Efficiency
A new lattice-based polynomial commitment scheme, Greyhound, delivers post-quantum security and 8000X smaller proofs, unlocking scalable verifiable computation.
