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.
