Codebase Memory MCP vs Leghis Smart Thinking
A side-by-side look at the Codebase Memory MCP and Leghis Smart Thinking MCP servers: transport, auth, tools, quality signals, and the config to install either one in Claude, Cursor, Windsurf or VS Code.
Verdict: choose Codebase Memory MCP for knowledge & memory work as a local process; choose Leghis Smart Thinking for knowledge & memory as a local process. You can also run both side by side in one mcpServers block.
Which MCP server should you choose?
Choose Codebase Memory MCP when
- You need dedicated capabilities in the Knowledge & Memory domain.
- You prefer a local stdio subprocess transport.
- Its auth model fits you: No auth required.
- You want tools like
index_repository, search_graph, query_graph.
Choose Leghis Smart Thinking when
- You need dedicated capabilities in the Knowledge & Memory domain.
- You prefer a local stdio subprocess transport.
- You want tools like
capabilities, run_create, run_get.
Feature & specification comparison
Rows where the two servers differ are marked.
| Spec | ||
|---|---|---|
| Category | Knowledge & Memory | Knowledge & Memory |
| Quality signal | 73/100 · Great | 65/100 · Great |
| Install command | Confirmed | Confirmed |
| Transport | Local subprocess (stdio) | Local subprocess (stdio) |
| Auth | No auth required | Not declared |
| Pricing | Free | Not declared |
| Required env vars | None listed | None listed |
| Verified owner | Community listing | Community listing |
| GitHub stars | 47,386 | 33 |
| Directory activity | 9 views 1 installs 1 upvotes | 2 views 0 installs 0 upvotes |
| Tools | 17 | 43 |
| Full listing | View Codebase Memory MCP | View Leghis Smart Thinking |
Tools & capabilities
Codebase Memory MCP tools 17
index_repositoryIndex a repository. full/moderate add semantics; fast omits them; cross-repo-intelligence links services. Reports coverage gaps.search_graphFind 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_graphRead-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_pathTrace 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_snippetRead 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_outlineDeclaration 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_schemaGet node-label and edge-type counts. diagnostics=full also lists queryable properties.compare_graphsCompare 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.get_architectureCompact counts, languages, packages, entry points. Request structure, dependencies, routes, hotspots, boundaries, layers, clusters, cycles, or file_tree; path scopes a directory.search_codeGraph-ranked text search: compact symbols, full bounded source, or file paths.list_projectsList projects with stable paging. Identity is lean; stats adds graph sizes.delete_projectDelete a project from the index- +5 more on the listing page
Leghis Smart Thinking tools 43
capabilitiesDescribe configured capabilities and explicit limits, including dossier capacity, scientific worker bounds, build metadata, the software supervisor (rubrics, review policy, approved recipes and execution) and the published catalogue fingerprint.run_createCreate an owned dossier when you need tracked claims, evidence with sources, coverage or audit. For a single exact check prefer calculate/solve_math/solve_logic instead. Restricted runs stay within server storage. profile picks an operator-approved budget envelope (standard by default; larger envelopes are bounded by the operator policy). For anonymous access the reply embeds a one-time dossier capability in the returned identifier: keep it exactly as returned — it authorizes every later operation on this dossier and is never re-issued.run_getRead a compact owned dossier. Explicit detail=full returns the complete document with its published bounds (mutation receipts omitted; use run_export when a bound is reached), never keys or server policies. presentation=detailed returns unprojected output; the opaque `cursor` continues claim pagination.run_listList owned run summaries with pagination.calculateExact arithmetic without floating-point truth claims. Grammar: rationals, factorial(n), binomial(n,k), gcd, lcm, mod(a,m), powmod(a,e,m), n!, `a mod b`, and ONE top-level comparison (=, !=, <, <=, >, >=). Pure operation: no dossier, no audit record. Supply expected to compare and get matchesExpected.calculate_batchEvaluate independent exact expressions in one call (same kernel and domains as calculate). Partial mode keeps valid items when others fail; atomic mode refuses the whole batch. References between items are not accepted in this version.checkOne-shot structured check without a dossier. Accepts a deterministic ClaimSpec (arithmetic, linear, ordering, boolean) and returns the shared verifier status. Kinds needing artifacts or the symbolic worker are refused with a hint. Exact inputs never call Jev.finite_computeBounded declarative computation: range_reduce (sum/product/count over an inclusive integer range; optional modulus), linear_recurrence (a_n = c0*a_(n-1) + c1*a_(n-2) + ..., coefficients listed most recent first; optional modulus), bounded_search (exhaustive enumeration of a bounded integer space against one comparison predicate). Declarative only: no clock, network, files or dynamic code; a reached limit returns a partial result, never a fake maximum or absence.casIsolated symbolic recipes: identity (expression equal to rhs?), simplify, solve (ONE symbol, univariate polynomial, rational coefficients, degree <= 8, exact roots including multiplicities). Runs only in the separate IAM-protected worker with pinned image; no arbitrary Python and no local fallback. A library result is not proof-kernel certification. assumptions is optional, e.g. "t=real, u=positive". Domain assumptions are applied: roots excluded by the declared domain are reported in excludedRoots and never counted as solutions. The worker bounds are published in capabilities.scientific (expression <= 2000 bytes, <= 8 symbols).solve_mathExact rational linear system solver. Unique, inconsistent and underdetermined are distinct. Pure operation: no dossier required.solve_logicSolve explicitly supplied ordering constraints, without guessing a prose translation. Pure operation: no dossier required.claimRegister an explicit structured claim inside a dossier. The host formalizes text; Jev cannot invent proof inputs.- +31 more on the listing page
Ready-to-paste client configs
Paste either block (or both) into your client config, e.g. claude_desktop_config.json or ~/.cursor/mcp.json. We only show a config when the install command is confirmed.
Codebase Memory MCP
{
"mcpServers": {
"deusdata-codebase-memory-mcp": {
"command": "npx",
"args": [
"-y",
"codebase-memory-mcp"
]
}
}
}
Leghis Smart Thinking
{
"mcpServers": {
"leghis-smart-thinking": {
"command": "npx",
"args": [
"-y",
"smart-thinking-mcp@16.3.1"
]
}
}
}
Frequently asked questions
Codebase Memory MCP is categorized under Knowledge & Memory and uses a local stdio subprocess. Leghis Smart Thinking belongs to Knowledge & Memory and uses a local stdio subprocess. Pick Codebase Memory MCP for knowledge & memory work and Leghis Smart Thinking for knowledge & memory.
Copy the mcpServers block from the config section on this page into your client's config (for example claude_desktop_config.json or ~/.cursor/mcp.json), then fully restart the client.
Codebase Memory MCP is listed as free. Auth: no auth required. Leghis Smart Thinking has no declared pricing — check the project's own site. If a server needs environment variables such as API keys, define them under the env key in your client's MCP config.
Yes. MCP clients support multiple servers: add deusdata-codebase-memory-mcp and leghis-smart-thinking as separate keys in the same mcpServers object, and your assistant will call tools from either one.
On AllMCPs, Codebase Memory MCP has a quality signal of 73/100 (Great) with 9 views, 1 installs and 47,386 GitHub stars. Leghis Smart Thinking has 65/100 (Great) with 2 views, 0 installs and 33 GitHub stars.