Incremental Vector Commitments Enable Practical Trustless AI Model Verification
We introduce Incremental Vector Commitments, a new primitive that decouples LLM size from ZK-proving cost, unlocking verifiable AI inference.
Lasso: Lookup Arguments Unlock Efficient Zero-Knowledge Computation
Lasso introduces a novel lookup argument that significantly optimizes zero-knowledge proofs by enabling efficient commitment to small field elements, transforming complex computations into succinct lookups.
SublonK: Sublinear Prover Time for Active Zero-Knowledge Circuits
SublonK introduces a novel SNARK achieving sub-linear prover runtime for conditional circuits, dramatically accelerating verifiable computation in applications like zkRollups.
Virgo++: Optimal Zero-Knowledge Proofs for Arbitrary Arithmetic Circuits
This research extends doubly efficient interactive proofs to arbitrary arithmetic circuits, achieving optimal linear prover time and succinct verification without requiring costly circuit layering.
Accelerating Zero-Knowledge Proofs for Practical Blockchain Integration
This research introduces novel ZKP protocols, significantly improving proof generation speed to enable broader, more efficient privacy-preserving applications.
