Interactive Oracle Proofs Enable Trustless, Scalable, Post-Quantum Verifiable Computation
Interactive Oracle Proofs generalize PCPs, constructing transparent, quasi-linear proof systems that eliminate trusted setup for mass-scale verifiable computation.
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.
