GitHub
Connect AI assistants to GitHub - manage repos, issues, PRs, and workflows through natural language.
作者提供的说明(英文原文)
Pre-computed atlas of your codebase for Claude Code: LSP + ADRs + git. 45-72% token reduction.
这三项永远不会合并成一个分数:意见、测量和人气是不同的东西。
我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。
选择你使用的 AI 应用,然后复制设置。
你需要
你用的是哪个应用?
在上方选择你的应用。我们会记住它,下次按钮会显示“安装到 …”。
打开 Claude Desktop → Settings → Developer → Edit Config,把下面的内容粘贴到 claude_desktop_config.json
{
"mcpServers": {
"contextatlas": {
"command": "npx",
"args": [
"-y",
"contextatlas"
]
}
}
}在终端中运行这条命令
claude mcp add contextatlas -- npx -y contextatlas粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json
{
"mcpServers": {
"contextatlas": {
"command": "npx",
"args": [
"-y",
"contextatlas"
]
}
}
}浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。
粘贴到项目中的 .vscode/mcp.json
{
"servers": {
"contextatlas": {
"type": "stdio",
"command": "npx",
"args": [
"-y",
"contextatlas"
]
}
}
}浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。
这个服务器在你的电脑上运行,而 ChatGPT 只能连接互联网上的服务器。请选择其他应用。
你的选择通过 Cookie 保存在这台设备上,无需账户。
这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同,请以 README 为准。
它在你的电脑上运行;安装后,工具列表会显示在你的 AI 应用中。
我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月7日
注册名称已通过 GitHub 账户 traviswye 验证,该账户拥有此仓库
我们还没有从 GitHub 读取这个仓库
我们还没有从 GitHub 读取这个仓库
它在你的电脑上运行,没有互联网端点
在你的电脑上运行,改用本地设置
它在你的电脑上运行;我们只能读取互联网端点的工具列表
与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。
它在 1 项适用的基础检查中通过了 1 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。
注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。
它在你的电脑上运行。你的 AI 应用会在需要时启动它,数据不会经过作者的服务器(除非它自己调用在线服务)。
GitHub 仓库最后更新于–,最新版本(1.0.1)于6个月前进入注册中心。
支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。你的电脑上还需要有 Node.js。
同一分类中有:GitHub, Desktop Commander, Cloudflare MCP
同一分类中其他作者的服务器,按星标数排序。
如何看卡片:★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i
Connect AI assistants to GitHub - manage repos, issues, PRs, and workflows through natural language.
MCP server for terminal commands, file operations, and process management
Cloudflare MCP servers
按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。
Stop watching Claude burn tokens grepping for context it can't possibly find.
ContextAtlas turns your codebase into a *single-call* context bundle for Claude Code — fusing LSP-grade structure, architectural intent from your Architectural Decision Records (ADRs), git history, and test associations. Measured 45-72% token reduction with zero quality regression across benchmark axes on architectural prompts across the hono / httpx / cobra benchmark suite.
Quick start → · Benchmark results → · Why not graph-based? → · Architecture → · ADRs →
ContextAtlas ships two equivalent paths — CLI and Claude Code Skills — both producing the same atlas.json. See Quick Start for setup.
Claude Code currently learns your codebase by brute force. Every session starts fresh. Every "where is X?" triggers multiple grep calls. Every "what depends on Y?" is another flurry of file reads. On a mid-sized codebase, answering a single architectural question can consume 40+ tool calls and 100,000+ tokens before Claude has enough context to reason well.
Worse: the architectural intent that governs your code — the ADRs, the design decisions, the "we did it this way because" — is invisible to Claude. The rule that OrderProcessor must be idempotent lives in docs/adr/. When Claude proposes a change, it has no way to know that constraint exists.
Yesterday's understanding doesn't carry to today. Every conversation starts from zero. Your ADRs, your commit history, your test coverage — none of it is on the agent's table.
What if expensive understanding happened once, at index time, and every query became a dictionary lookup?
That's ContextAtlas.
ContextAtlas is an MCP server that gives Claude Code a curated atlas of your codebase — fusing LSP-grade structural precision with architectural intent extracted from your ADRs, docs, and git history, delivered to Claude in single-call context bundles.
Every bundle Claude receives combines four independent signals about a symbol:
One MCP call returns all four, fused. No ADRs in your repo yet? You still get LSP + git + tests in one call instead of fifteen — a meaningful baseline improvement. Add ADRs and the bundles get richer. The architecture is designed so any subset of signals produces value.
Given an ADR stating that OrderProcessor must be idempotent, a call to get_symbol_context("OrderProcessor") returns:
SYM OrderProcessor@src/orders/processor.ts:42 class
SIG class OrderProcessor extends BaseProcessor INTENT ADR-07 hard "must be idempotent" RATIONALE "All order processing must be safely retryable." INTENT ADR-12 soft "prefer async base class for new processors" REFS 23 [billing:14 admin:9] TOP ref:ts:src/billing/charges.ts:88 TOP ref:ts:src/admin/orders.ts:12 GIT hot last=2026-03-14 RECENT "Fix idempotency bug in retry path" a3f2c1d TESTS src/orders/processor.test.ts (+11)
When Claude is asked to modify OrderProcessor, it sees the idempotency constraint *before* proposing changes — not after a user review catches the violation.
Who this is for. ContextAtlas is built for the average developer using Claude Code on real codebases — not just engineers at large orgs working on 500,000-file monorepos. Token-burn reduction scales with codebase size — dramatic on a 200-file framework, modest on a 30-file library. But architectural intent capture is size-invariant. A 30-file library can have meaningful architectural decisions worth surfacing, and Claude respecting them matters just as much as on a larger codebase.
Efficiency and quality are necessary but not sufficient. The substantive value of context-grounding shows up in design choices on non-trivial code-change tasks.
A/B trial during v0.3 development. Identical 3-paragraph prompt across two ContextAtlas clones: implement a known bug fix — locate the bug, design and implement the fix, write tests, document via ADR. The only setup difference: MCP availability.
| Arm | MCP | Approach selected |
|---|---|---|
| A (vanilla) | none | Recall-first approach (broader matching; fought the project's precision-thesis with noise) |
| B (CA-aided) | ContextAtlas | Precision-optimization approach (aligned with the project's pre-extracted-claims-with-structural-attribution thesis) |
Arm B's approach landed in main. Both arms functionally fixed the bug at similar wall-clock and token cost. The substantive difference was *alignment with project design thesis* — the CA-aided arm could read the relevant ADR + prior architectural work from the atlas, and made a choice that fit. The vanilla arm couldn't see that context and chose an approach that worked but fought the architecture.
Arm A's substantive consideration wasn't lost — captured as future-work investigation trigger. The recall-vs-precision tradeoff is preserved.
Full synthesis at v0.3 Round 3 dogfood evidence.
N=1 trial; this is anecdote, not benchmark. The systematic benchmark suite (hono / httpx / cobra) measures efficiency and quality (see §The Numbers below). This A/B trial measures the substantively-distinct *design-alignment* axis — which doesn't fit benchmark-suite methodology (every code-change task is repo- specific) but is the substantive value proposition for cohort developers building on real codebases.
We benchmark ContextAtlas against baseline Claude Code on three repositories chosen to reflect realistic developer workloads:
| Repo | Language | Source files | Role |
|---|---|---|---|
| honojs/hono | TypeScript | 186 | Mid-sized framework |
| encode/httpx | Python | 23 | Focused production library |
| spf13/cobra | Go | 19 | CLI framework |
Methodology. 24 prompts per repo, 6 task buckets, blind manual grading, pre-registered rubric, no cherry-picking. Full methodology in RUBRIC.md.
Phase 5 reference run on hono, six pre-registered prompts:
| Prompt | Bucket | Alpha calls | CA calls | Δ | Alpha $ | CA $ |
|---|---|---|---|---|---|---|
| h1-context-runtime | win | 18 | 9 | −50% | $2.36 | $1.52 |
| h2-router-contract | win | 11 | 5 | −55% | $0.60 | $0.53 |
| h3-middleware-onion | win | 5 | 5 | 0% | $0.38 | $0.47 |
| h4-validator-typeflow | win | 21 | 6 | −71% | $2.95 | $0.52 |
| h5-hono-generics | tie | 11 | 13 | +18% | $0.79 | $1.17 |
| h6-fetch-signature | trick | 3 | 4 | +33% | $0.17 | $0.29 |
| aggregate | 69 | 42 | −39% | $7.25 | $4.50 (−38%) |
The headline case: h4-validator-typeflow ran 7.3× cheaper ($2.95 → $0.52) at equivalent answer depth. CA opens with the governing ADR by number; the baseline reconstructs the architecture from source. Tie and trick buckets (h5, h6) show CA net-negative as the rubric predicted — CA over-engineers on questions where architectural intent doesn't carry load. Bucket-aware methodology surfaces these expected cases rather than burying them.
Cross-language replication: the same architectural-intent win mechanism holds on Python (Phase 6 — httpx) and Go (Phase 7 — cobra). Phase 8 re-ran the locked prompt sets against v0.3-sharpened atlases at the same pinned target SHAs: 45-72% token reduction on architectural-intent prompts across all three target languages. Full synthesis at phase-8-v0.3-reference-run.md.
v0.5 shipped the LLM-judge methodology under paired-mode anonymization (per ADR-19). Cross-cell rollup paired-t at N=27 differences per axis (5 anchor cells × n=5 trials × 2 conditions; hono h1 auto-stretch to n=8):
| Quality axis | Mean Δ (0-3 scale) | 95% CI | Tier |
|---|---|---|---|
| Factual correctness | +0.370 | [0.176, 0.565] | CLEAN |
| Hallucination | +0.296 | [0.032, 0.561] | Borderline |
| Actionability | +0.148 | [0.005, 0.291] | Borderline |
| Completeness | +0.037 | [-0.039, 0.113] | Not distinguishable |
Threshold pre-registration: the three-tier framing (≥0.05 CLEAN; 0.001-0.05 BORDERLINE; ≤0 NOT distinguishable) was locked before precision values were computed. No goalpost-shifting after data. 76% tie rate confirms anonymization worked — the judge couldn't tell which condition was which on three-quarters of comparisons.
Full per-axis numerics + 9 named findings at the Phase-9 reference doc. Honest methodology limits documented in §Methodology and Honest Limits below.
A few deliberate framings — what ContextAtlas is and isn't relative to neighboring tools:
vs. graph-based code intelligence (Graphify and similar). We're in the same category — both build pre-computed indexes over codebases for LLM agents via MCP. That's genuine category overlap, and we want to be straight about it. Where we differ:
graph_query, get_neighbors, shortest_path) that callers compose.只显示了开头部分;其余内容请在仓库中阅读