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.
GPU Bottlenecks Hinder Zero-Knowledge Proof Scalability and Adoption
This research identifies Number-Theoretic Transform as the primary GPU bottleneck for Zero-Knowledge Proofs, proposing architectural and tuning solutions to unlock verifiable computing at scale.
ZKProphet: Optimizing Zero-Knowledge Proof Performance on GPU Architectures
This research identifies Number-Theoretic Transform as the critical bottleneck in GPU-accelerated Zero-Knowledge Proofs, proposing optimizations for enhanced verifiable computation.
