#1 AI CodingUnknown
orihime — alternative #1 to codebase-memory-mcp
🐍 🏠 🍎 🪟 🐧 - Cross-repository code knowledge graph MCP server for Java, Kotlin, JavaScript, and TypeScript. Indexes source into embedded Kuzu...
GitHub source
Recorded alternatives
Alternatives to codebase-memory-mcp
Every candidate below sits in AI Coding. What ends up on this page is decided entirely by a recorded score — not by bidding, not by editor taste. Review both records, check current vendor terms, then decide.
#2 AI CodingUnknown
m1nd — alternative #2 to codebase-memory-mcp
⭐ 22 — Local-first MCP server that gives a CLI coding agent a neuro-symbolic code graph over the repo: impact/why/change-reasoning across a...
GitHub source
#3 AI CodingUnknown
passbaton — alternative #3 to codebase-memory-mcp
📇 🏠 🍎 🪟 🐧 - Zero-config session continuity for Claude Code, OpenAI Codex CLI & Google Gemini CLI, sharing one local db. Auto context injecti...
GitHub source
#4 AI CodingUnknown
TempoGraph — alternative #4 to codebase-memory-mcp
🐍 🏠 🍎 🪟 🐧 - Code graph context engine with 24 MCP tools for structural code intelligence. Tree-sitter parsing for 170+ languages, dependency...
GitHub source
#5 AI CodingUnknown
trace-mcp — alternative #5 to codebase-memory-mcp
📇 🏠 🍎 🪟 🐧 - Framework-aware code intelligence that indexes source code into a cross-language dependency graph. Understands framework semanti...
GitHub source
#6 AI CodingUnknown
agentmako — alternative #6 to codebase-memory-mcp
📇 🏠 🍎 🪟 🐧 - Local-first codebase intelligence engine. Gives coding agents structured context packets, indexed code/schema facts, and diagnos...
GitHub source
#7 AI CodingUnknown
mcp-codebase-index — alternative #7 to codebase-memory-mcp
🐍 🏠 🍎 🪟 🐧 - Structural codebase indexer exposing 17 query tools (functions, classes, imports, dependency graphs, change impact) via MCP. Zer...
GitHub source
#8 AI CodingUnknown
mcp-injector — alternative #8 to codebase-memory-mcp
🏎️ 🏠 🍎 🪟 🐧 - Local MCP daemon that pre-indexes your codebase into a SQLite catalog and serves AST-compressed snapshots to Claude Code, Curso...
GitHub source
Questions about this page
How were these alternatives selected?
Each candidate is a live catalogue record in the same primary category, picked by a deterministic score that Oryxen records in its catalogue: how many meaningful words the two listings share, whether their pricing classes oppose (a paid product against a free one), whether both are open source, and whether either record is featured. The same catalogue state always produces the same list — no randomness, no manual ranking.
Are these alternatives ranked by payment?
No. Rows are ordered only by the recorded score, highest first, with alphabetical ties — payment never influences the order, nothing here is paid placement, and Oryxen charges no listing or placement fee.
Always verify current terms with codebase-memory-mcp directly — Oryxen records pricing classes, not live quotes.