Zero-Knowledge Proof of Time Enables Private Verifiable Temporal Commitments
Proof of Time introduces a ZKP-based primitive that allows proving a time-elapsed commitment without revealing the original event's timestamp, securing time-sensitive decentralized applications.
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.
Sublinear Vector Commitments Optimize Stateless Blockchain State Updates
A novel vector commitment scheme achieves sublinear update complexity, fundamentally reducing the overhead for light clients to maintain and verify global blockchain state.
Functional Commitments Verify Program Output without Revealing Logic
This new Functional Commitment Scheme allows committing to a program's logic while efficiently proving its output, enabling private, verifiable outsourced computation.
Sublinear Vector Commitments Enable Trustless Stateless Data Availability
A new vector commitment scheme allows light clients to verify massive datasets with logarithmic communication, fundamentally solving the stateless data availability problem.
Lattice Commitments Secure Transparent Post-Quantum Zero-Knowledge Proofs
A new lattice-based polynomial commitment scheme secures zero-knowledge proofs against quantum attacks, eliminating the need for a trusted setup.
