# Contextmaxxer > Fully local MCP retrieval tool for coding agents. 161M encoder, ~1s per tool call, no API, no LLM in the query path. No file reads: line numbers, callers, callees and exact call sites, packed to a token budget. 2-4x the file coverage of BM25 and TF-IDF on SWE-Explore, and tops the paper's own sub-1B code model on CORE-Bench. - **Type:** MCP server - **Install:** `agentstack add mcp-codeus-morbid-contextmaxxer` - **Verified:** Yes — security-reviewed for prompt injection and unsafe behavior - **Seller:** [codeus-morbid](https://agentstack.voostack.com/s/codeus-morbid) - **Installs:** 0 - **Category:** [AI & ML](https://agentstack.voostack.com/c/ai-and-ml) - **Latest version:** 0.1.0 - **License:** MIT - **Upstream author:** [codeus-morbid](https://github.com/codeus-morbid) - **Source:** https://github.com/codeus-morbid/contextmaxxer ## Install ```sh agentstack add mcp-codeus-morbid-contextmaxxer ``` Requires the [AgentStack CLI](https://agentstack.voostack.com/docs/cli). Works with Claude Code, Cursor, and any MCP-compatible agent. ## About # Contextmaxxer [](https://github.com/codeus-morbid/contextmaxxer/actions/workflows/ci.yml) [](LICENSE) [](go.mod) [](https://github.com/codeus-morbid/contextmaxxer/releases/latest) > Local code-graph search for coding agents. Contextmaxxer gives Claude Code, Cursor and Codex an MCP tool for finding the small set of symbols that answers a question — with source lines, callers, callees and exact call sites already attached. Scored on **all 848 instances** of [SWE-Explore](https://arxiv.org/html/2606.07297v1) — an external benchmark whose baselines are the paper's own, not ours — it reaches **2.4× the file coverage of the best classical retriever** at the five results the benchmark compares every method at, which is also what the product serves. In paired agent runs on CockroachDB's 90K symbols it answered every architecture question with **zero source-file reads**: the agent cited from what the tool returned and opened nothing by hand, which is the result that reproduces in every run. Read the limits with it. Agentic localizers that put a model inside the search loop still score higher on file coverage; here the graph is built once at indexing time and a query makes no model call at all. And whether any of this makes an agent write **better patches** is not measured — an early read on 25 SWE-bench instances did not move it. [BENCHMARK.md](BENCHMARK.md) has the protocol, the run-to-run spread and every negative result. Everything needed for indexing and search runs locally. Your repository is not uploaded to a search service. ## When to reach for it, and when not to Use it on a **large codebase you do not already know**, especially when following a call chain ("what actually runs when X happens") or when you cannot name the thing you are looking for and have to describe it. Use `grep` instead on a small or familiar repository, or when you already know the symbol's name. A text search is hard to beat when the name is the query; this tool earns its keep when the haystack is large and the question is about behaviour rather than spelling. ## See the difference Ask the agent a normal question: fit retrieved symbols into the token budget Contextmaxxer returns the relevant implementation and its structural context in one response: 1. retrieve.Pack internal/retrieve/packer.go:19-47 19 | func Pack(symbols []ScoredResult, budgetTokens int, fullBodyCount int) ([]ScoredResult, int) { | ... 27 | var selected []ScoredResult 28 | total := 0 29 | for i, s := range symbols { 30 | if fullBodyCount >= 0 && i >= fullBodyCount { 31 | s.Body = compactBody(s) 32 | s.Detail = "compact" Called by: - retrieve.runPipeline Calls: - retrieve.compactBody packer.go:31 - retrieve.estimateTokens packer.go:36 Two things matter in that block. The body arrives **line-numbered**, so the agent can cite `packer.go:31` without reopening the file. And every neighbour comes with the line where the call happens — following the chain into `compactBody` costs no second search, whatever the size of the repository. This example is a checked-in public self-eval case, not a prompt written after seeing the ranking. ## Why use it - **Fewer round-trips.** One semantic query replaces repeated glob, grep and file-read calls during code discovery. - **Structure, not only similarity.** Retrieval uses symbols, lexical and vector search, the call graph, PageRank, a cross-encoder and an intent ranker. - **Agent-ready evidence.** Results are packed to a token budget and include the relationships needed to follow a code path. - **Local-first.** Indexes, embeddings and feedback logs stay on your machine. - **Polyglot.** Thirteen languages, all with symbols and call edges; Go, Python and TypeScript resolve calls by declared type. Contextmaxxer is designed for large codebases, where discovery fan-out becomes the bottleneck. On small projects a strong model with grep is already cheap. ## Quick start 1. Download the archive for your platform from the [latest release](https://github.com/codeus-morbid/contextmaxxer/releases/latest) — Windows amd64, Linux amd64 and macOS arm64, each with `checksums.txt`. Verify it, unpack it, and put `contextmaxxer` on PATH. [INSTALL.md](INSTALL.md) has the per-platform commands, including clearing the Gatekeeper mark on macOS; [Build from source](#build-from-source) has the toolchain list if you would rather build it yourself. 2. Pre-download the models and ONNX Runtime: contextmaxxer warmup 3. From the repository you want to search, wire it into your agent: contextmaxxer init --host claude-code . # or: cursor, codex 4. Restart the agent and approve the contextmaxxer MCP server. For a large repository, start with the structural index: contextmaxxer --fast init --host claude-code . This makes symbol, lexical and graph retrieval available first. Run warmup when you are ready for semantic search and reranking. The init command merges the host configuration instead of replacing it. Use **--no-write** to print the proposed configuration without changing host files. See [INSTALL.md](INSTALL.md) for the full agent-oriented installation flow. ## How it works ```mermaid flowchart LR A["Source repository"] --> B["Tree-sitter symbols"] B --> C["BM25 + local embeddings"] B --> D["Call graph"] C --> E["RRF seed fusion"] D --> F["Personalized PageRank"] E --> F F --> G["Cross-encoder + intent ranker"] G --> H["Token-budget evidence"] H --> I["Coding agent"] ``` The index is a local SQLite database. Embeddings and reranking run through ONNX Runtime; an in-memory vector cache keeps the non-model portion of a warm query under tens of milliseconds. The MCP server exposes: - **find_context** — ranked, line-numbered symbols with graph context. A query shaped like `path/to/file.go:142` — or a whole `rg -n` output line pasted verbatim — is looked up rather than searched: it returns the symbol enclosing that line with its callers and callees, runs no embedding and no reranking, and is the cheapest call the server serves. It is the door an agent holding a grep hit would otherwise have no way to open; - **find_related_edits** — given the diff just made, where else the names it touched already live, ranked by how rare they are. Names at the common end are everywhere and evidence of nothing, so they are dropped; - **expand_context** — the full indexed body of one result, when its excerpt cut the branch you needed; no second semantic search; - **continue_context** — the next page when a response reports `status:more`; - **record_feedback** — optional usefulness labels tied to a retrieval request. ### What it costs to keep running The first index is the only slow part, and it is paid once. | | | |---|---| | First index, 99 files / 995 symbols | 40.4 s | | **Re-index after editing one file** | **230 ms** — 1 file re-parsed, 98 skipped as unchanged | | Server ready on CockroachDB's 90K symbols | 1.2 s, both ONNX models and a 278 MB vector cache loaded | | Warm query, 90K symbols | median 996 ms, fastest 652 ms | | Warm query, this repository | median 462 ms, fastest 246 ms | Files are hashed, so a re-index touches only what actually changed; with `--watch` the server does this in the background while you edit and the models stay loaded, so the 230 ms above is the whole cost of absorbing a change. The vector cache is what keeps startup at a second: a cold SQL load of 90K embeddings measured 39.5 s before it existed. Measured on one consumer GPU (RTX 3060, DirectML) at the served default of five results, driven through the real MCP server rather than a library harness. A CPU-only machine will be slower; the shape — one slow index, cheap everything after — does not change. Latency is not the lever it looks like. Our own measurement puts it at roughly 2% of an agent's wall time; what actually costs the agent is how many searches it runs and how heavy each answer is. The second is the reason there is no model call in the query path at all. ## Measured results ### SWE-Explore: an external benchmark with published baselines Everything else in this section is our own measurement. This one is not: [SWE-Explore](https://arxiv.org/html/2606.07297v1) hands an explorer an issue and a repository snapshot and grades the ranked `(file, start, end)` regions it returns against line-level ground truth distilled from the trajectories of agents that actually solved the task — what a solver had to READ, not what the patch changed. Every baseline below is the paper's own number. All 848 instances, line budget B = 500. The paper fixes K = 5 for every explorer it compares ("each explorer is asked to return its five most relevant regions"), so the **served default of 5** — which is also what the product hands an agent — is the column to read against the baselines. The **list of 20** is outside that protocol: it is published because it shows what a longer list reaches, not as a comparison with methods that were capped at five. | | **Ctxmaxxer**list of 20 | **Ctxmaxxer**served (5) | BM25 | TF-IDF | Potion (RAG) | CoSIL | Claude Code | Oracle | |---|---:|---:|---:|---:|---:|---:|---:|---:| | HitFile | **0.529** | 0.342 | 0.079 | 0.140 | 0.088 | 0.544 | 0.667 | 0.923 | | Prec | 0.339 | **0.396** | 0.055 | 0.117 | 0.055 | 0.581 | 0.598 | 1.000 | | Rec_l | **0.047** | 0.036 | 0.021 | 0.049 | 0.025 | 0.788 | 0.154 | 0.953 | | HitRegion | **0.375** | 0.267 | 0.065 | 0.121 | 0.069 | 0.544 | 0.531 | 0.915 | Several times every non-agentic retriever on both columns — at the compared five, 2.4× the best of them. Against [CoSIL](https://www.arxiv.org/abs/2503.22424v1), the closest comparison in kind because it localises from a call graph too, the served five does not reach it on any column, and that gap is real: 0.342 file coverage against 0.544. CoSIL puts a model *inside* the search loop, up to ten calls an issue; here the graph is built once at indexing time and a query needs no model at all. One caveat this table does not resolve: the benchmark counts regions, and a result here is a symbol that may show several non-adjacent windows, so five results can carry more than five regions. The line-level metrics charge only the lines actually shown, but the region count is not normalised to the paper's unit, and we have not measured how far apart the two are. Read the rest honestly: - **The five-result default trades a third of the file coverage for a sixth more precision** (0.529 → 0.342 HitFile, 0.338 → 0.396 Prec) and sends 58 visible lines instead of 89. That is the shipped tradeoff: the paper's own analysis puts context efficiency at r = +0.950 with downstream resolve rate, above every recall measure, and an agent that misses can rephrase and retry. Both rows come from the same binary in one sitting; the list-of-20 arm reproduced the published figures to three decimals, so the only difference between the columns is how many results were asked for. - **The agents are ahead on precision** (0.598 and 0.581 against 0.396), and CoSIL is ahead on every column. This is not a claim to beat them. - **Line recall is our weakest number by an order of magnitude**, and it is a design position rather than a defect: bodies are trimmed to query-relevant windows, so a 500-line budget carries 58-89 lines. Filling it is possible and costs precision. - **The comparison is like-for-like.** Both sides are the same 848 instances; all three sub-datasets are complete. One snapshot was found truncated by an index-size check and re-fetched before scoring. Protocol, per-repository breakdown, the sweeps, and the seven things that were tried against the ceiling and failed are in [docs/research/swe-explore.md](docs/research/swe-explore.md). The dataset is CC-BY-NC-ND: numbers may be published, the data is not redistributed and no part of it is in this repository. ### Agent-level discovery Paired agents answered the same questions on pinned public repositories. | Repository | Correctness | Discovery calls | File reads | Wall time | |---|---:|---:|---:|---:| | Prometheus, grep | 5/5 | 51 | 4 | 142 s | | Prometheus, Contextmaxxer | 5/5 | **8** | **0** | **47 s** | | CockroachDB, grep | 6/6 | 34 | 9 | 96 s | | CockroachDB, Contextmaxxer | 6/6 | **7** | **0** | **45 s** | Both rows are the runs written up in [BENCHMARK.md](BENCHMARK.md) — Prometheus from the paired-sonnet comparison, CockroachDB from the v0.1.0-beta.5 replication on six paraphrastic questions. Each is a single run; the same measurement repeated on one arm has come back 57% apart, so the ratios are indicative and the zero source reads are the durable part. Raw token savings are situational because the agent's own base context can dominate total usage. [BENCHMARK.md](BENCHMARK.md) has the questions, the protocol, the limitations and the negative results. ### Retrieval quality Start with the part you can run yourself. A public self-eval — 18 development and 12 reserved queries over this repository — ships in `internal/eval/testdata`: go build -o .task/build/eval ./cmd/eval .task/build/eval --manifest internal/eval/testdata/manifest.public.json Behind that, an internal 144-case corpus across five real projects was used while developing the served configuration. Its 58-case reserved split measured Hit@1 0.72, **Hit@3 0.91**, Recall@5 0.93, Recall@10 0.98. Those cases come from private projects and are not published, so treat those numbers as our development record rather than as something you can check. ### CORE-Bench: the retrieval stage, isolated SWE-Explore above scores the whole product. CORE-Bench scores one stage of it, and that is exactly what makes it worth running: the dataset ships its own corpus — `{_id, text}` chunks with no paths, symbol names or kinds — so the extractors, the call graph, PageRank and the intent ranker are not in this path at all. What remains is the embedder and the seed fusion, measured against numbers we did not produce. A whole-pipeline table like the one above cannot exist here, and a benchmark that isolates one stage is the right instrument for comparing models rather than systems. Level-2 *issue-to-edit localization* ([arXiv:2606.11864](https://arxiv.org/abs/2606.11864), HF `zhangfw123/CORE-Bench`): real GitHub issues as queries, per-query temporal filters, 253 repositories, ~2,080 scoreable queries, ~2.2M corpus chunks. Every row marked *paper* is the paper's own published number, read from v3 (EMNLP 2026, revised 2026-08-24). | Retriever | Params | NDCG@10 | Recall@100 | |---|---:|---:|---:| | *paper:* gte-Qwen2-1.5B, general-purpose | 1.5B | 0.035 | 0.159 | | *paper:* bge-m3, general-purpose | 568M | 0.046 | 0.183 | | *paper:* CodeRankEmbed, code-specific | <1B | 0.121 | 0.329 | | **jina-v2-base-code + BM25, RRF** — shipped default | **161M** | **0.150** | **0.438** | | *paper:* Qwen3-Embedding-8B, zero-shot | 8B | 0.203 | 0.480 | | *paper:* SweRankEmbed-Large (CC-BY-NC) | 7B | 0.224 | 0.521 | | *research:* ft2 fine-tune + BM25, RRF | 161M | **0.233** | 0.498 | | *paper:* Qwen3-8B-SFT, their fine-tune | 8B | 0.328 | 0.664 | **Read that table as system against model, not model against model.** Every *paper* row is a retriever scoring alone; our row is that retriever fused with BM25, which is what the product ships and therefore what a user gets — but it is not a like-for-like encoder comparison. Stripped to the encoder, against CodeRankEmbed — the paper's own code-specific model in the same sub-1B class — the shipped default ties on NDCG@10 (0.122 against 0.121) and leads on Recall@100 (0.383 against 0.329). The 0.150 is the fusion's, not the encoder's. Against the general-purpose embedders of 3.5× and 9× its size the margin is 3-4× an … ## Source & license This open-source MCP server is cataloged on AgentStack and links to its original source — we do not rehost the code. - **Author:** [codeus-morbid](https://github.com/codeus-morbid) - **Source:** [codeus-morbid/contextmaxxer](https://github.com/codeus-morbid/contextmaxxer) - **License:** MIT Install and usage instructions live in the source repository linked above. ## Pricing - **Free** — Free ## Security capabilities Automated source analysis of v0.1.0 — what this tool can access: - **Network access:** no - **Filesystem access:** no - **Shell / process execution:** no - **Environment & secrets:** no - **Dynamic code execution:** no *"Yes" means the capability is present in the source — more access means more to trust, not that it is unsafe.* ## Versions - **0.1.0** — security scan: passed — Imported from the upstream source. ## Links - Listing page: https://agentstack.voostack.com/l/mcp-codeus-morbid-contextmaxxer - Seller: https://agentstack.voostack.com/s/codeus-morbid - Browse the marketplace: https://agentstack.voostack.com/browse --- Listed on AgentStack — the marketplace for AI agent skills and MCP servers. Every listing is security-reviewed. Creators keep 70%.