HackerPapers

arXiv:2511.19902cs.CR

Zero-Knowledge Proof Based Verifiable Inference of Models

Yunxiao Wang

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Recent advances in artificial intelligence (AI), particularly deep learning, have led to widespread adoption across various applications. Yet, a fundamental challenge persists: how can we verify the correctness of AI model inference when model owners cannot (or will not) reveal their parameters? These parameters represent enormous training costs and valuable intellectual property, making transparent verification difficult. In this paper, we introduce a zero-knowledge framework capable of verifying deep learning inference without exposing model internal parameters. Built on recursively composed zero-knowledge proofs and requiring no trusted setup, our framework supports both linear and nonlinear neural network layers, including matrix multiplication, normalization, softmax, and SiLU. Leveraging the Fiat-Shamir heuristic, we obtain a succinct non-interactive argument of knowledge (zkSNARK) with constant-size proofs. To demonstrate the practicality of our approach, we translate the DeepSeek model into a fully SNARK-verifiable version named ZK-DeepSeek and show experimentally that our framework delivers both efficiency and flexibility in real-world AI verification workloads.

arXiv comments
Journal reference
DOI
Subjects
cs.CRCryptography and Security cs.AIArtificial Intelligence

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Feb 2026 to Feb 2026.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Seems like that is possible now. For example [1] "Zero-Knowledge Proof Based Verifiable Inference of Models" [1] https://arxiv.org/html/2511.19902v1

      MattPalmer1086View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.