Zero-trust, air-gapped Enterprise GraphRAG MCP server with offline, citation-grounded answers.
Copy the AI prompt to install this server into Claude Code, Cursor, or another agent β or use 1-click editor setup below.
π‘ Paste the JSON block into your client's configuration file under mcpServers, then restart the application.
Stop chunking blindly. Combine the structure of Tree-Search with the reasoning of Knowledge Graphs. Runs locally or in the cloud.
π― Traditional RAG guesses based on similarity. VeritasGraph reasons based on structure.
Don't just find the documentβunderstand the connection.
|
Why choose? VeritasGraph includes the hierarchical "Table of Contents" navigation of PageIndex PLUS the semantic reasoning of a Knowledge Graph. |
| Feature | Vector RAG | PageIndex | VeritasGraph |
|---|---|---|---|
| Retrieval Type | Similarity | Tree Search | π Tree + Graph Reasoning |
| Attribution | β Low | β οΈ Medium | β 100% Verifiable |
| Multi-hop Reasoning | β | β | β |
| Tree Navigation (TOC) | β | β | β |
| Semantic Search | β | β | β |
| Cross-section Linking | β | β | β |
| Visual Graph Explorer | β | β | β Built-in UI |
| 100% Local/Private | β οΈ Varies | β Cloud | β On-Premise |
| Open Source | β οΈ Varies | β Proprietary | β MIT License |
| Cross-section linking | β | β | β |
VeritasGraph is a production-ready framework that solves the fundamental problem with vector-search RAG: context blindness. While traditional RAG chunks your documents into isolated fragments and hopes cosine similarity finds the right one, VeritasGraph builds a knowledge graph that actually understands how your information connects.
The result? Multi-hop reasoning that answers complex questions, transparent attribution for every claim, and a hierarchical tree structure that navigates documents like a human wouldβall running on your own infrastructure.
No GPU? No problem. Try VeritasGraph instantly:
That's it. This launches an interactive demo using cloud APIs (OpenAI/Anthropic)βno local models required.
βΆοΈ Watch VeritasGraph build reasoning paths in real-time.
βΆοΈ Convert Charts & Tables to Knowledge Graphs in Minutes | Vision RAG Tutorial
π‘ What you're seeing: A query triggers multi-hop reasoning across the knowledge graph. Nodes light up as connections are discovered, showing exactly how the answer was foundβnot just what was found.
| Mode | Best For | Requirements |
|---|---|---|
--mode=lite | Quick demo, no GPU | OpenAI/Anthropic API key |
--mode=local | Privacy, offline use | Ollama + 8GB RAM |
--mode=full | Production, all features | Docker + Neo4j |
Once you're ready to integrate VeritasGraph into your code:
The Power of PageIndex's Tree + The Flexibility of a Graph
VeritasGraph now combines two powerful retrieval paradigms:
| Traditional RAG | VeritasGraph with Trees |
|---|---|
| Chunks documents randomly | Preserves document structure |
| Loses section context | Maintains parent-child relationships |
| Can't navigate by structure | Supports TOC-style navigation |
| No hierarchy awareness | Full tree traversal (ancestors, siblings, children) |
VeritasGraph offers multiple ways to ingest content into your knowledge graph:
Traditional RAG splits documents into arbitrary 500-token chunks, destroying context. VeritasGraph's document-centric mode treats whole pages or sections as single retrievable nodes:
Add content to your knowledge graph with one click:
| Source | How It Works |
|---|---|
| πΊ YouTube | Paste URL β auto-extracts transcript |
| π° Web Articles | Paste URL β extracts main content |
| π PDFs | Upload β document-centric extraction |
| π Text | Paste directly β instant indexing |
No reviews yet β be the first to share how this listing worked for you.
Showcase your server listing on GitHub or your project documentation. Embed this dynamic SVG badge to highlight official listing status and live engagement.
[](https://allmcps.com/mcp/veritasgraph)<a href="https://allmcps.com/mcp/veritasgraph"><img src="https://allmcps.com/api/badge/veritasgraph?style=directory" alt="Veritasgraph on AllMCPs" /></a>