Pre-structured domain knowledge. Zero hallucinations by construction.
A Compact Knowledge Graph is a pre-structured directed acyclic graph where every node is a typed domain concept and every edge is a typed dependency relationship. CKGs are serialized as CSV and delivered via MCP (Model Context Protocol) tools to AI agent orchestrators as pre-action context.
Instead of retrieving text chunks at runtime (RAG), CKG compiles domain knowledge ahead of time into a deterministic graph structure. When an agent needs to act, it queries the dependency structure before dispatching — so every hop is a cited edge, not a guess.
180 modules · 650 typed dependency edges
trace_downstream("RunnableSequence")
→ returns exact 23 dependent modules
→ before agent writes a single line
→ blast radius = deterministic, not invisible
RAG retrieves semantically similar text — which loses the structure that matters. When your domain has real dependencies (what gates what, what breaks if X ships, what depends on what), retrieval can't represent it. CKG encodes it explicitly as typed edges.
Result: Relationship errors become structurally impossible by construction, not just less likely.
Every relationship has a type (depends_on, causes, enables, etc.). No free-form connections.
Agents query the graph before acting, not after. Prevents blind decisions.
Every node is a concept. Every edge is a cited relationship. No generated connections.
F1 stays at 0.77 @ hop 5. RAG accuracy collapses past hop 2.
274 tokens per query, every time. No variance. Deterministic cost.
CSV serialization means knowledge updates go through version control.
ckg-mcp ships with 53 domains ready to use:
Install ckg-mcp:
• What is Retrieval Density Score (RDS)?
• Read the benchmark paper (PDF)
• GitHub: ckg-mcp
• Live demo on Hugging Face
Ready to build with structured knowledge?
Book a benchmark walkthrough