Trapdoored Matrices Enable Fast Secure Data-Oblivious Linear Algebra Delegation
Researchers introduce Trapdoored Matrices, a new cryptographic primitive that uses LPN to achieve fast, data-oblivious linear algebra delegation, fundamentally unlocking private on-chain AI.
Constraint-Reduced Circuits Accelerate Zero-Knowledge Verifiable Computation
Introducing Constraint-Reduced Polynomial Circuits, a novel zk-SNARK construction that minimizes arithmetic constraints for complex operations, unlocking practical, scalable verifiable computation.
Constraint-Reduced Polynomial Circuits Accelerate Verifiable Computation Proving Time
zkVC introduces CRPC and PSQ to reduce matrix multiplication constraints from O(n3) to O(n), achieving over 12x faster ZK proof generation for verifiable AI.
Fast Zero-Knowledge Proofs for Verifiable Machine Learning via Circuit Optimization
The Constraint-Reduced Polynomial Circuit (CRPC) dramatically lowers ZKP overhead for matrix operations, making private, verifiable AI practical.
