Trustless Logarithmic Commitment Secures Verifiable Computation
This new vector-based commitment achieves logarithmic proof size and trustless setup, fundamentally accelerating ZK-proof verification and scaling.
Zkspeed Hardware Dramatically Accelerates HyperPlonk Proving for Ubiquitous Verifiable Computation
A dedicated hardware accelerator for HyperPlonk achieves $801times$ speedup, fundamentally resolving the ZKP prover time bottleneck for scalable decentralized systems.
Recursive Proof Composition Enables Infinite Scalability and Constant Verification
Recursive proof composition collapses unbounded computation history into a single, constant-size artifact, unlocking theoretical infinite scalability.
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.
Optimal ZKP Prover Time Unlocks Practical Succinct Verifiable Computation
Libra achieves the theoretical optimum for ZKP prover efficiency, utilizing a linear-time GKR algorithm to finally scale zero-knowledge proofs.
