Skip to content
Open access

Veritas Gateway: A Framework for Zero-Knowledge Proofs on Database Queries with a Model Context Protocol Interface

Sep 2026 · Journal of universal computer science (Online) · Vol 32, pp. 1289-1310 · 0 citations · 13 references

TL;DR

The results suggest that Veritas Gateway provides backend-agnostic, verifiable querying with predictable latency, improving trust in the MCP-driven agent workflow while maintaining the benefits of tool-based integration and facilitating deployment in privacy-sensitive environments.

Abstract

Veritas Gateway is a zero-knowledge verification layer that acts as an intermediary between AI agents and diverse data stores through the Model Context Protocol (MCP). Database snapshots are committed to with Poseidon based Merkle commitments and query answers are returned with succinct SNARK proofs that can be locally verified without satisfying predicates on raw values or trusted hardware. The prototype implements this stack across relational, NoSQL, time-series and vector databases through generic adapters and is empirically evaluated along four dimensions: scalability across MySQL as snapshot size and Merkle height varies, a hash-primitive ablation study with Poseidon, MiMC-7 and SHA-256, a proof-system ablation across Groth16, PLONK and STARKs on a common circuit, and horizontal portability across SQLite, PostgreSQL, MongoDB, InfluxDB and Qdrant under a fixed workload. Measurements include build time, proving time, query time, query assembly time, query verification, memory footprint, and derived throughputs. It is found that build time increases predictably with snapshot size and height, proving cost is driven by path depth and is consistent across iterations, query assembly time is consistently sub-second, and verification completes in ≈ 8 − 12 ms across all settings. Poseidon incurs the lowest in-circuit latency and variance, with SHA-256 only competitive for out-of-circuit pre-hashing. Groth16 results in the shortest verified-latency path, PLONK results in a reduction of proving time, and STARKs result in transparent setup at a higher memory cost. Cross-backend variation is dominated by build overhead and the data-path overheads for each backend’s cryptographic verification, for which cost is never a bottleneck. These results suggest that Veritas Gateway provides backend-agnostic, verifiable querying with predictable latency, improving trust in the MCP-driven agent workflow while maintaining the benefits of tool-based integration and facilitating deployment in privacy-sensitive environments.

Read PDF

Similar papers

Conference Sep 2026

A Unified Model Context Protocol SQL Tool Interface for Agentic AI Systems: Architecture and a Reproducible SQL Execution Baseline

Large language model (LLM) agents increasingly need reliable access to structured databases, yet that access is often fragmented across custom drivers, framework-specific tools, and non-standard execution interfaces. This paper presents a unified SQL tool interface based on the Model Context Protocol (MCP): database op...

Eric Julianto, Dian Alhusari, S. A. Ardiyansa et al. · 0 citations
Open access Sep 2026

Task-Bound Authorization and Compliance Auditing with Quantum-Safe Task Passports for Privacy-Preserving Computation in Trusted Data Spaces

This work presents a task-bound lifecycle and state model instantiated by a quantum-safe task passport (QTP) that binds purpose, scope, computation type, participants, validity, evidence-key metadata, and an initial governed-resource profile.

Si-Hang Qin, Yu-Rou Wu, Jie-Ling Wen et al. · 0 citations
Open access Sep 2026

MimicDB: Runtime Defense against Wrong-Result Bugs in Database Query Optimizers via Query-Rewriting Diversity

These findings characterize the potential of single-engine diversity to detect wrong-result failures and select correct results, together with the execution costs and reference-validity constraints that shape its practical use.

Ze-Lin Wang, Ping Chen, Jin Wei et al. · 0 citations
Preprint Sep 2026

Fresh-Challenge VDF Attestations for Model-Relative Response Latency

Can a finite verifier obtain public, model-relative evidence about response latency for sequential computation? Verifiable delay functions (VDFs) make this possible in principle: evaluation requires T sequential steps, whereas verification is efficient in the security parameter and polylogarithmic in the numerical valu...

Ansar Yesmukhanov, Aruzhan Tlessova · 0 citations
Book Open access Oct 2026

Formal Runtime Verification for Tool-Using LLM Agents: An Offline Same-Benchmark Study on AgentDojo and STAC

Results show that formal temporal monitoring adds value exactly when the trace exposes trustworthy history, and quantify how far current benchmarks are from that point and propose a twelve-field enforcement-ready trace schema.

Nikolaos Kekatos, Stylianos Basagiannis, Marinelio Chintri et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.