Mercury MLPCS Achieves Constant Proof Size and Linear Prover Time
Mercury, a new pairing-based multilinear polynomial commitment scheme, fundamentally resolves the proof size versus prover time trade-off for scalable verifiable computation.
Commit-and-Prove SNARKs Enable Efficient Verifiable Machine Learning
A new Commit-and-Prove SNARK architecture decouples witness commitment, achieving succinct verifier time for large, private inputs like ML models.