zkVC Optimizes Zero-Knowledge Proofs for Fast Verifiable Machine Learning
zkVC introduces Constraint-reduced Polynomial Circuits to optimize zkSNARKs for matrix multiplication, achieving a 12x speedup for private verifiable AI.
Lattice-Based SNARKs Achieve Practical Post-Quantum Proof Size Reduction
A new lattice-based zkSNARK construction reduces post-quantum proof size by $10.3times$, collapsing the massive overhead that hindered quantum-secure verifiable computation.
Constant-Cost Batch Verification with Silently Verifiable Proofs
Silently Verifiable Proofs introduce a new zero-knowledge primitive that achieves constant verifier-to-verifier communication for arbitrarily large proof batches, drastically cutting overhead for private computation.
