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.
Eliminating Prime Hashing Makes RSA Accumulators Viable for Decentralized Systems
This new RSA accumulator construction bypasses the slow "hashing into primes" bottleneck, fundamentally enabling succinct, dynamic, and practical set membership proofs on-chain.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation
Introducing the first ZKP system with memory scaling to the square-root of computation size, this breakthrough enables privacy-preserving verification on edge devices.
