Recursive Zero-Knowledge Secures Private Verifiable AI Model Inference
The new recursive ZK framework allows constant-size proofs for massive AI models, solving the critical trade-off between model privacy and verifiability.
Scalable Formal Verification Secures Zero-Knowledge Proof Constraint Systems
New modular verification technique CIVER formally guarantees zero-knowledge circuit integrity, eliminating subtle cryptographic vulnerabilities in rollups.
Libra Achieves Optimal Linear Prover Time for Succinct Zero-Knowledge Proofs
Libra is the first ZKP to achieve optimal linear prover time $O(C)$ and logarithmic succinctness, fundamentally enabling verifiable computation at scale.
ZKProphet Pinpoints Number-Theoretic Transform as Zero-Knowledge Proof Bottleneck
Systematic performance analysis shifts optimization focus from MSM to NTT, unlocking the next generation of scalable verifiable computation.
Optimal ZKP Prover Time Unlocks Practical Succinct Verifiable Computation
Libra achieves the theoretical optimum for ZKP prover efficiency, utilizing a linear-time GKR algorithm to finally scale zero-knowledge proofs.
Distributed Zero-Knowledge Proofs Decouple Prover Efficiency from Centralization Risk
New fully distributed ZKP schemes cut prover time and communication to $O(1)$, decentralizing zkRollup block production and boosting throughput.
Vector Oblivious Linear Evaluation Unlocks Efficient Zero-Knowledge Proof Systems
VOLE-ZK leverages MPC primitives to construct highly efficient, CPU-friendly zero-knowledge proofs for complex computation.
Optimal Prover Time Succinct Zero-Knowledge Proofs Redefine Scalability
The Libra proof system achieves optimal linear prover time, solving the primary bottleneck of ZKPs to unlock practical, large-scale verifiable computation.
Plonky2-FRI Enables Scalable Zero-Knowledge Proof for Cryptographic Hashing Verification
This research integrates Plonky2 with FRI to generate succinct proofs for SHA-256 integrity, fundamentally decoupling computational work from verification cost.