Skip to main content

Context optimization for AI agents — 97 domain knowledge graphs (68 free + 29 Pro), MCP-native traversal. 4× F1 of RAG, 11× fewer tokens per query. Works with Claude, GPT-4o, Gemini, and any MCP client.

Project description

Context Optimization for AI Agents

Agent traversal · Agent team orchestration · 97 domains · MCP-native

Your agents retrieve. They should traverse.

PyPI version Downloads Python License: MIT Domains Free F1: 0.471 · 4× RAG KRB v0.6.2 Built by Graphify.md

Read-only. The server can only return edges that exist in the data. It returns nothing rather than inferring a path that isn't there.

Get Pro → · Benchmark → · graphifymd.com →


Context Optimization — The Problem

Every agent that reasons about a domain — HIPAA, GPU inference, calculus, contract law — does one of three things:

Approach What breaks
Long system prompt No structure. Drifts with every model update. Cannot traverse.
RAG retrieval Probabilistic. Accuracy degrades at each hop. Expensive per query.
Fine-tuning 6-month cycle. Stale by delivery. Retrains when knowledge shifts.

All three share the same failure: the agent re-infers domain structure on every query instead of reading structure that was declared once.

In our open benchmark (KRB v0.6.2 — reproduce it yourself): RAG achieves 0.123 macro F1 on multi-hop domain queries. CKG achieves 0.471. At 5 hops, the gap widens: RAG 0.170, CKG 0.772.

The token cost compounds the accuracy problem: the average RAG query costs 2,982 tokens. The average CKG traversal costs 269 — measured across 19 benchmark domains.

These numbers are ours, on our benchmark. The dataset is public on HuggingFace. Run it yourself.


Agent Traversal — The Solution

A Compressed Knowledge Graph (CKG) is a domain structured for traversal, not retrieval.

Not a document. Not a vector index. A pre-compiled DAG of concepts, typed dependency relationships, and prerequisite chains — compressed to the minimum tokens that carry the maximum structure. Served over MCP. Traversed deterministically.

Agent asks:   "What does TensorRT-LLM require to run on Hopper?"

CKG returns:  TensorRT-LLM
              ├─ [REQUIRES] CUDA Toolkit
              │    ├─ [ENABLES] cuBLAS
              │    └─ [ENABLES] CUDA Driver API
              ├─ [REQUIRES] FP8/FP4 Quantization
              │    └─ [REQUIRES] Hopper SM90 Architecture
              └─ [ENABLES] Triton Inference Server
                   └─ [ENABLES] NIM Microservice Runtime

              269 tokens · declared edges only · no inference at query time

RAG would:    ~2,982 tokens · probabilistic retrieval · degrades at 3+ hops

You go from prompting the domain into existence to asking questions inside it.

Typed edges carry semantic meaning

Edge type Meaning Agent use
REQUIRES Hard prerequisite — must exist first Sequencing, gap detection
ENABLES Unlocks a downstream capability Optimization paths
RELATES_TO Conceptual proximity Disambiguation
IMPLEMENTS Concrete realization of an abstraction Architecture mapping
CONTRASTS_WITH Meaningful opposition Tradeoff reasoning

Every domain is a plain-text DAG

ConceptID, ConceptLabel,      Dependencies,      TaxonomyID
1,         Taylor Series,     "",                Analysis
2,         Power Series,      "",                Analysis
3,         Convergence,       "2:REQUIRES",      Analysis
4,         Higher-Order Der., "5:REQUIRES",      Calculus
5,         Derivative,        "6:REQUIRES",      Calculus
6,         Continuity,        "7:REQUIRES",      Calculus

No embeddings. No probabilistic retrieval. Built once, reviewed once, traversed forever.

ckg-mcp — Every edge is a decision: REQUIRES · ENABLES · RELATES_TO · IMPLEMENTS

Agent Team Orchestration — The Scale Story

Single-agent traversal is the efficiency gain. Multi-agent orchestration is where it compounds.

Liu et al. (arXiv:2606.30986) measure Context Transaction Cost (CTC): the tax paid every time context crosses an agent boundary. Their finding: context efficiency collapses from 18.2 in Q1 to 1.6 by Q4 across pipeline stages — 91% degradation with no model change.

CKG addresses all three root causes they identify:

CTC component What it is CKG's response
Token Latency Burden Compute cost of transmitting context 269 tokens instead of 2,982
Handoff Cost Serialization loss at agent boundaries get_prerequisites() replaces re-retrieval
Compression Loss Information destroyed when context is summarized The graph is the compressed form — done once, offline

When agent A hands off to agent B, neither re-retrieves the domain. They both traverse the same declared graph. Structured context doesn't consume your context window — it opens it.

ckg-mcp — 11× fewer tokens: 269 vs 2,982 per query

Quickstart

uvx ckg-mcp          # no install — runs immediately
# or
pip install ckg-mcp  # Python ≥ 3.10

Claude Desktop

{
  "mcpServers": {
    "ckg": { "command": "uvx", "args": ["ckg-mcp"] }
  }
}

Claude Code

claude mcp add ckg -- uvx ckg-mcp

Cursor / Cline / Windsurf / any MCP client

{ "mcpServers": { "ckg": { "command": "uvx", "args": ["ckg-mcp"] } } }

System prompt snippet

You have access to the ckg MCP server — a typed dependency graph catalog
of 97 domains (mathematics, GPU inference, healthcare, law, robotics,
regulatory, AI tooling, and more). When answering questions about any of
these domains, call query_ckg() or get_prerequisites() before responding.
Do not infer dependency chains — traverse the graph instead.

Try it immediately

list_domains()
→ see all 68 free domains

query_ckg("Taylor Series", "calculus", 3)
→ prerequisite chain: Function → Limit → Continuity → Derivative →
  Higher-Order Derivatives → Convergence → Power Series → Taylor Series

get_prerequisites("Business Associate Agreement", "hipaa-compliance")
→ Covered Entity → PHI Definition → Minimum Necessary Standard →
  Access Controls → Breach Notification Rule → BAA

query_ckg("FlashAttention-3", "nvidia-gpu-inference", 3)
→ SRAM Tiling · On-Chip Memory Budget · Transformer Attention ·
  Softmax Stability → FlashAttention-3 → Multi-Head Attention → KV Cache

Benchmark

These are our numbers on our open benchmark. The dataset is on HuggingFace. Run it yourself before citing them.

git clone https://github.com/Yarmoluk/ckg-benchmark && cd ckg-benchmark
pip install -r evaluation/requirements.txt
python evaluation/ckg_harness.py --domain calculus
python evaluation/analyze_results.py
System Macro F1 Tokens / query Cost / 1K queries F1 at 5 hops
CKG (this package) 0.471 269 $7.81 0.772
RAG (text-embedding-3-small) 0.123 2,982 $76.23 0.170
GraphRAG (MS global, v1.1) 0.120 3,450+

What this means:

  • 4× F1 — in our benchmark, on our dataset. Open and reproducible.
  • 11× fewer tokens — the 269 and 2,982 figures are averages across 19 benchmark domains.
  • F1 rises with depth — CKG 0.37 at 1 hop → 0.77 at 5 hops. RAG is flat. Graph traversal does not degrade at depth; retrieval does.
  • GraphRAG — not a meaningful improvement over RAG at higher token cost. The word "graph" is not the win. A pre-compiled, declared graph is.

One derived metric we use internally: Retrieval Density Score (F1 ÷ tokens per query). CKG scores roughly 42× higher than RAG on this ratio. It is not a standard benchmark metric — we use it to reason about accuracy-per-token efficiency.

Full benchmark paper →


Domain Library

68 free · no API key required

Mathematics calculus · pre-calc · algebra-1 · linear-algebra · geometry-course · statistics-course · functions · fft-benchmarking

Engineering & Computer Science circuits · digital-electronics · computer-science · quantum-computing · signal-processing · intro-to-graph

Life Sciences biology · bioinformatics · genetics · ecology · chemistry

Clinical & Health (free) glp1-obesity · glp1-muscle-loss · dementia

Regulatory & Government fda-drug-approval-chain · fda-adverse-event-chain · federal-procurement-chain · gao-oversight-chain

AI, ML & Data machine-learning-textbook · data-science-course · conversational-ai · langchain-core · dbt-core · apache-iceberg

AI Tools (provider graphs) claude-anthropic · claude-skills · cursor · deepseek · gemini-api · grok-xai · kimi-moonshot · midjourney · openai-platform · qwen · vercel-ai-sdk

Robotics & Physical AI ros2-architecture · robot-motion-planning

Learning & Pedagogy prompt-class · tracking-ai-course · automating-instructional-design · microsims · infographics · it-management-graph

Business & Society economics-course · personal-finance · ethics-course · theory-of-knowledge · systems-thinking · digital-citizenship · blockchain · unicorns

Reference & Culture art-of-war · laudato-si · learning-linux · us-geography · asl-book · reading-for-kindergarten · moss


Free vs Pro

Free — MIT Pro — $99/mo
Domains 68 97
Healthcare & clinical HIPAA · CPT coding · ICD-10 · payer formulary · drug interactions · clinical decision chain · medical billing
Enterprise data stack Databricks Unity · Snowflake Horizon · PostgreSQL · AWS Data Catalog · Azure Purview · GCP Dataplex · OpenLineage
AI infrastructure NVIDIA GPU inference · context-as-a-service · agent reliability · AI governance · token cost crisis
Legal & compliance Legal citation chain · contract law elements · AML/KYC chain · investment risk chain
Agent blueprints 2 2 + priority access
Domain updates Community Managed
License MIT Commercial

Activate in 60 seconds:

export CKG_API_KEY=cs_live_your_key_here
# restart your MCP client — all 97 domains appear in list_domains()

Get Pro → graphifymd.com/pro


Agent Blueprints

Pre-built agent specs: which domains to load, step-by-step workflow, ready-to-paste system prompt, and a LangGraph orchestration hint. Skip writing the context layer from scratch.

list_agent_blueprints()
→ gpu-inference-optimizer      — trace GPU bottlenecks, surface optimization paths
  context-as-a-service-advisor — design CKG-based retrieval pipelines

get_agent_blueprint("gpu-inference-optimizer")
→ Required domains: nvidia-gpu-inference, context-as-a-service
  Workflow: diagnose → trace prerequisites → identify path → recommend
  Prompt template: [ready to paste]
  LangGraph hint: StateGraph · 4 nodes

The Six Tools

All read-only. No database. No embeddings. No API key for free domains.

Tool What it does
list_domains() Every available domain. Start here.
query_ckg(concept, domain, depth) Prerequisites + dependents, up to N hops
get_prerequisites(concept, domain) Full upstream chain in dependency order
search_concepts(query, domain) Find concepts by keyword — use before query_ckg
list_agent_blueprints() Browse pre-built agent configs
get_agent_blueprint(use_case) Full spec: domains, workflow, prompt, LangGraph hint

Why Graphify.md

ckg-mcp is the core product of Graphify.md.

We build the context optimization layer that sits between agents and the domains they operate in. The same layer that powers this package runs inside enterprise deployments, sealed appliances, and custom vertical CKGs.

What we can say without overstating:

  • The benchmark is open and reproducible — not self-reported, verifiable
  • The graphs are human-authored and human-reviewed — not generated
  • The methodology is patent pending — not just a wrapper around an existing system
  • Plain CSV DAGs, MIT-licensed for free domains — no lock-in

Compatibility — model-agnostic:

LLM Agent framework MCP client
Claude (all tiers) LangChain / LangGraph Claude Desktop
GPT-4o / GPT-4 AutoGen Claude Code
Gemini 2.0 / 2.5 smolagents Cursor
Llama 3.x CrewAI Cline
Mistral / DeepSeek OpenAI Agents SDK Any MCP stdio client

No graph database. No vector store. Python ≥ 3.10. Single dependency (mcp). stdio transport.


Custom Domains & Enterprise

The free and Pro catalog covers breadth. Enterprise needs are specific: your regulatory environment, your internal taxonomy, your product domain, your data stack.

Graphify.md builds and maintains custom CKG domain graphs for enterprise teams — compressed, versioned, deployed over your MCP stack.

Sealed Appliance — a private CKG + query server in your environment. Air-gapped. Your data stays yours.

Typical entry: a pilot on your highest-value domain, delivered in one session, measured against your existing retrieval setup.


Corrections Welcome

Spotted a wrong edge? A RELATES_TO that should be REQUIRES? A missing concept?

Edge corrections are the highest-value contribution — the graph gets more useful with every fix. Open an issue or PR on GitHub.


Ecosystem

Package What it does
ckg-mcp This repo — 97 domains, context optimization layer
ckg-nvidia-ai 20 NVIDIA AI domains, free, MCP-native
agentmem-mcp Cross-session agent memory
KRB Benchmark Open benchmark — reproduce the F1 numbers
ckg-eval Path-Fidelity Score — reasoning path correctness

EVAL

benchmark: ckg-benchmark v0.6.2
dataset: huggingface.co/datasets/danyarm/ckg-benchmark
benchmarked: true
this_domain_f1: 0.471
queries_tested: 19
rag_baseline_f1: 0.123
graphrag_baseline_f1: 0.120
mean_tokens: 269
paper: github.com/Yarmoluk/ckg-benchmark/blob/main/paper/main.pdf

Citation

@misc{yarmoluk2026ckg,
  title  = {Benchmarking Knowledge Retrieval Architectures Across Educational
            and Commercial Domains: RAG, GraphRAG, and Compressed Knowledge Graphs},
  author = {Yarmoluk, Daniel and McCreary, Dan},
  year   = {2026},
  note   = {v0.6.2. https://github.com/Yarmoluk/ckg-benchmark}
}

graphifymd.com · Pro · Benchmark

Patent pending. Built by Daniel Yarmoluk / Graphify.md.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

ckg_mcp-0.7.7.tar.gz (584.3 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

ckg_mcp-0.7.7-py3-none-any.whl (298.2 kB view details)

Uploaded Python 3

File details

Details for the file ckg_mcp-0.7.7.tar.gz.

File metadata

  • Download URL: ckg_mcp-0.7.7.tar.gz
  • Upload date:
  • Size: 584.3 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.11.14

File hashes

Hashes for ckg_mcp-0.7.7.tar.gz
Algorithm Hash digest
SHA256 253e4917caaf58468345af60105c3b3fa569786dffc876939e1ec82a66e9ff0b
MD5 c4833e1fecfe1f3dcd8551e59eb7f93b
BLAKE2b-256 e97350b383fdeede626e8499baeeea98ab9ff38afc777136d84bd2f52f056455

See more details on using hashes here.

File details

Details for the file ckg_mcp-0.7.7-py3-none-any.whl.

File metadata

  • Download URL: ckg_mcp-0.7.7-py3-none-any.whl
  • Upload date:
  • Size: 298.2 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.11.14

File hashes

Hashes for ckg_mcp-0.7.7-py3-none-any.whl
Algorithm Hash digest
SHA256 ad21bf5af8144612fd702bb519f2006fc2ab45dd343a799d87f9041e4579d694
MD5 6cb9f8adf78500484fd6ed992fbee6ed
BLAKE2b-256 e556c07d918952401583ec8a22f621f08e81e5b0ea6cf797f858a0433cee2af1

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page