Kage vs Codebase Memory MCP — MCP Server Comparison | AllMCPs
Side-by-Side Model Context Protocol Comparison
Kage vs Codebase Memory MCP
In-depth architectural comparison of the Kage and Codebase Memory MCP MCP servers. Compare execution transports, security boundaries, tool capabilities, quality scores, and ready-to-paste client installation snippets for Claude, Cursor, Windsurf, and VS Code.
At a Glance & Executive Verdict
Kage
Knowledge & Memory · Local stdio
Quality: 56/100 (Good) | Auth: No auth required
Codebase Memory MCP
Knowledge & Memory · Local stdio
Quality: 73/100 (Great) | Auth: No auth required
Verdict Summary: Choose Kage if you need specialized Knowledge & Memory tools running via a local process. Choose Codebase Memory MCP if your workspace requires Knowledge & Memory integration with local subprocess execution. Both servers can be configured concurrently in your client's mcpServers manifest.
Which MCP Server Should You Choose?
Choose Kage when:
You need dedicated capabilities in the Knowledge & Memory domain.
You prefer local stdio subprocess transport architecture.
Your security boundary fits: No auth required (Free / Open Source).
Primary tools included: OKF-compatible Markdown memory in Git, Citation validation at write and recall time, Local BM25 and vector retrieval.
Verified, git-native memory for coding agents. Memory is plain JSON packets committed in your repo, each checked against the code it cites — hallucinated citations rejected at write, stale or changed memory withheld at recall, plus diff-time stale-catch. Local-only (BM25 + vectors), no account, no API key. npx -y @kage-core/kage-graph-mcp install
Code-intelligence engine that indexes a repo into a persistent knowledge graph — functions, classes, call chains, HTTP routes, cross-service links. 159 languages via tree-sitter + Hybrid LSP, sub-ms structural queries, 99% fewer tokens than grep. Single static binary, zero dependencies, 100% local. npx codebase-memory-mcp
Tools & Capabilities Breakdown
Kage Tools (6)
OKF-compatible Markdown memory in Git
Citation validation at write and recall time
Local BM25 and vector retrieval
Isolated worktree orchestration
Independent test, diff, and citation checks
Agent setup and local project UI
Codebase Memory MCP Tools (17)
index_repository
Index a repository. full/moderate add semantics; fast omits them; cross-repo-intelligence links services. Reports coverage gaps.
Ready-to-Paste Client Configurations
Paste either (or both) of these JSON server blocks into your client config file (e.g. claude_desktop_config.json or ~/.cursor/mcp.json).
Kage is categorized under Knowledge & Memory and uses a local stdio subprocess. In contrast, Codebase Memory MCP belongs to Knowledge & Memory using local stdio subprocess. Select Kage when you need capabilities focused on knowledge & memory and Codebase Memory MCP when you require tools for knowledge & memory.
Find symbols via BM25 query, regex name/qn filters, or semantic_query. Rows keep qn/file/lines and in/out over CALLS/USAGE/CALL_REFERENCE/INHERITS/IMPLEMENTS.
query_graph
Read-only Cypher for multi-hop, aggregation, complexity, or cross-service analysis. Default: 200 visible rows with exact/lower-bound totals and truncation; continue safely with next_cursor. graph=missed is a file tree of flagged coverage gaps; absence is not proof of completeness. Use get_graph_schema(diagnostics=full) for properties.
trace_path
Trace callers/callees, data flow, or cross-service paths. Defaults exclude tests and resolver evidence. Rows keep qn/hop with explicit totals, relations, and continuations.
get_code_snippet
Read a search_graph symbol. auto bounds source and outlines large containers; full restores up to 500 lines. Source/outline pages continue; coverage_note marks gaps.
get_file_outline
Declaration outline of one exact repository-relative file: optional exact label filter, source order, exact total/offset/limit paging; file/folder/container nodes excluded.
get_graph_schema
Get node-label and edge-type counts. diagnostics=full also lists queryable properties.
compare_graphs
Compare two indexed snapshots: deterministic target-only additions and base-only removals of stable node/edge identities; each set capped by limit and a 512 KiB budget with exact totals and truncation reasons.