Research

Paper

TESTING March 03, 2026

V3DB: Audit-on-Demand Zero-Knowledge Proofs for Verifiable Vector Search over Committed Snapshots

Authors

Zipeng Qiu, Wenjie Qu, Jiaheng Zhang, Binhang Yuan

Abstract

Dense retrieval services increasingly underpin semantic search, recommendation, and retrieval-augmented generation, yet clients typically receive only a top-$k$ list with no auditable evidence of how it was produced. We present V3DB, a verifiable, versioned vector-search service that enables audit-on-demand correctness checks for approximate nearest-neighbour (ANN) retrieval executed by a potentially untrusted service provider. V3DB commits to each corpus snapshot and standardises an IVF-PQ search pipeline into a fixed-shape, five-step query semantics. Given a public snapshot commitment and a query embedding, the service returns the top-$k$ payloads and, when challenged, produces a succinct zero-knowledge proof that the output is exactly the result of executing the published semantics on the committed snapshot -- without revealing the embedding corpus or private index contents. To make proving practical, V3DB avoids costly in-circuit sorting and random access by combining multiset equality/inclusion checks with lightweight boundary conditions. Our prototype implementation based on Plonky2 achieves up to $22\times$ faster proving and up to $40\%$ lower peak memory consumption than the circuit-only baseline, with millisecond-level verification time. Github Repo at https://github.com/TabibitoQZP/zk-IVF-PQ.

Metadata

arXiv ID: 2603.03065
Provider: ARXIV
Primary Category: cs.DB
Published: 2026-03-03
Fetched: 2026-03-04 03:41

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.03065v1</id>\n    <title>V3DB: Audit-on-Demand Zero-Knowledge Proofs for Verifiable Vector Search over Committed Snapshots</title>\n    <updated>2026-03-03T15:04:09Z</updated>\n    <link href='https://arxiv.org/abs/2603.03065v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.03065v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>Dense retrieval services increasingly underpin semantic search, recommendation, and retrieval-augmented generation, yet clients typically receive only a top-$k$ list with no auditable evidence of how it was produced. We present V3DB, a verifiable, versioned vector-search service that enables audit-on-demand correctness checks for approximate nearest-neighbour (ANN) retrieval executed by a potentially untrusted service provider. V3DB commits to each corpus snapshot and standardises an IVF-PQ search pipeline into a fixed-shape, five-step query semantics. Given a public snapshot commitment and a query embedding, the service returns the top-$k$ payloads and, when challenged, produces a succinct zero-knowledge proof that the output is exactly the result of executing the published semantics on the committed snapshot -- without revealing the embedding corpus or private index contents. To make proving practical, V3DB avoids costly in-circuit sorting and random access by combining multiset equality/inclusion checks with lightweight boundary conditions. Our prototype implementation based on Plonky2 achieves up to $22\\times$ faster proving and up to $40\\%$ lower peak memory consumption than the circuit-only baseline, with millisecond-level verification time.\n  Github Repo at https://github.com/TabibitoQZP/zk-IVF-PQ.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.DB'/>\n    <published>2026-03-03T15:04:09Z</published>\n    <arxiv:primary_category term='cs.DB'/>\n    <author>\n      <name>Zipeng Qiu</name>\n    </author>\n    <author>\n      <name>Wenjie Qu</name>\n    </author>\n    <author>\n      <name>Jiaheng Zhang</name>\n    </author>\n    <author>\n      <name>Binhang Yuan</name>\n    </author>\n  </entry>"
}