zkVC reduces ZKP proving time for matrix multiplication by encoding the product as a polynomial evaluation, claiming 12x speedup and enabling verifiable Transformer models.
Pinocchio: Nearly practical verifiable computation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing
zkVC reduces ZKP proving time for matrix multiplication by encoding the product as a polynomial evaluation, claiming 12x speedup and enabling verifiable Transformer models.