rea
Reverse engineer anything with agents, from app behavior down to native binaries.
Call graphs, blast radius and API-breakage gates. Every answer reports its own completeness.
Skills que enseñan a la IA este tipo de trabajo; funcionan junto a este
Reverse engineer anything with agents, from app behavior down to native binaries.
A single CLAUDE.md file to improve Claude Code behavior, derived from Andrej Karpathy's observations on LLM coding pitfalls.
Turn any codebase, with its docs, SQL schemas, configs, and PDFs, into a queryable knowledge graph. A /graphify skill for Claude Code, Cursor, Codex, and Gemini CLI: local deterministic AST parsing, every edge explained, no vector store.
Las listas se ordenan por una puntuación de uso (sobre 100) con estas partes
| Popularidad | 7/80 | Estrellas de GitHub o descargas semanales: la mayor cuenta 60, la menor 20 |
|---|---|---|
| Actualidad | 12/12 | Puntuación completa con una versión o cambio de código en 30 días |
| Sigue respondiendo | 0/8 | El endpoint en la nube respondió en la última revisión |
| Puntuación de uso | 19/100 |
Calidad: Pasó 3/3 revisiones básicas (se muestra, no ordena) · Impulso: Sin datos aún (Solo se usa en la pestaña En auge)
Elige la app de IA que usas y copia la configuración.
Pasó 3/3 revisiones · Funciona en tu computadora
Primero: ¿qué IA usas?
Elige tu app y los pasos aparecen abajo.
Claude todavía no puede conectar ctx — queryable code graph
El autor aún no ha puesto cómo instalarlo en el registro MCP
ChatGPT todavía no puede conectar ctx — queryable code graph
El autor aún no ha puesto cómo instalarlo en el registro MCP
B · Otros en Herramientas para desarrolladores que funcionan con ChatGPT
Elegidos entre los más usados de la misma categoría, solo los que se conectan con una dirección y sin clave
Claude Code todavía no puede conectar ctx — queryable code graph
El autor aún no ha puesto cómo instalarlo en el registro MCP
Cursor todavía no puede conectar ctx — queryable code graph
El autor aún no ha puesto cómo instalarlo en el registro MCP
VS Code todavía no puede conectar ctx — queryable code graph
El autor aún no ha puesto cómo instalarlo en el registro MCP
Otras apps que usan MCP, como Windsurf, Zed o Gemini CLI, añaden servidores de forma distinta. Míralo en la lista de apps
Ver todas las apps que usan MCP →
La configuración JSON está en “Para desarrolladores”, abajo
cargo: code-contextSegún cómo se conecta este servidor y la documentación de cada app, comprobado el 10 nov 2026.
Se ejecutan en tu computadora en
GooseLM StudioMsty StudioCherry StudioVisual StudioWindsurf (Devin Desktop)ZedKiroClineContinueJetBrains AI AssistantCodex CLIGemini CLIOpenCodenodecodeWarpLibreChatRaycast
Se ejecuta en tu computadora; la lista de herramientas aparece en tu app de IA después de instalarlo.
Revisamos información que cualquiera puede ver; no hemos leído el código. Las revisiones que no aplican no se cuentan. · Revisado el 19 nov 2026
El nombre en el registro se verificó con la cuenta de GitHub Eagle-Logic, dueña del repo
Último cambio de código: ayer
Usa MIT
Este se ejecuta en tu computadora; no hay endpoint en internet
Se ejecuta en tu computadora y usa ajustes locales en su lugar
Se ejecuta en tu computadora; solo podemos leer listas de herramientas de endpoints en internet
No revisado: solo se pueden revisar paquetes npm y PyPI con versión
Si lo creaste tú, pega este código en tu README. La insignia enlaza a esta página.
[](https://mcp.popnx.com/en/servers/eagle-logic-ctx)Pregunta, comparte un consejo o avisa de que no funciona. Ordenado por lo que la gente marcó como útil.
Aún no hay publicaciones. Sé la primera persona en preguntar o compartir.
Lo publicado aquí lo escriben usuarios, no el equipo de PopNx.
Aún no hay reseñas
Comparado con todos los servidores activos de esta categoría en el registro. Las estrellas solo cuentan cuando quien lo publica es dueño del repo.
Superó 3 de 3 revisiones básicas aplicables. No hemos leído el código. Antes de agregar una clave o un token, revisa qué acceso pide el servidor y usa una clave que tenga solo los permisos que necesitas.
El registro no indica ninguna clave obligatoria, aunque algunos servidores te piden iniciar sesión la primera vez que los usas.
Se ejecuta en tu computadora. Tu app de IA lo inicia cuando hace falta, y los datos no pasan por los servidores del creador (a menos que el propio servidor llame a un servicio en línea).
El repo de GitHub cambió por última vez ayer, y la última versión (0.28.1) llegó al registro hace 3 días.
Las apps compatibles con MCP, como Claude Desktop, Claude Code, Cursor y VS Code. También necesitas Rust en tu computadora.
En la misma categoría: GitDiagram, Appllama, Cloudflare MCP, Omnara, Repowise
Misma categoría, otros creadores, comandos ya revisados. Primero los oficiales, luego por estrellas.
Cómo leer una tarjeta:↓ Descargas por semanai★ Estrellas de GitHubiTres pilares: reseñas · revisiones · usoiActualizado = fecha en que se publicó la última versión en el registroi
Architecture diagrams, explanations and Mermaid source for public GitHub repositories.
Study screens, flows and paywalls from top-earning iOS apps, then build from what wins.
Cloudflare MCP servers
Deploy durable AI agents with Omnara, an open-source managed-agent platform.
Codebase intelligence for AI coding agents: graph, git history, docs, decisions, code health.
| Este ctx — queryable code graph | GitDiagram | Appllama | Cloudflare MCP | Omnara | Repowise | |
|---|---|---|---|---|---|---|
| Dónde se ejecuta | Se instala en tu equipo | Funciona en la nube, sin instalar nada | Funciona en la nube, sin instalar nada | Funciona en la nube, sin instalar nada | Funciona en la nube, sin instalar nada | En la nube o instalado en tu equipo |
| Necesita clave | No | No | No | No | No | No |
| Se añade con + en Claude | No | No | No | Sí | No | No |
| Revisiones básicas | 3/3 | 4/4 | 4/4 | 4/4 | 4/4 | 5/5 |
| Licencia | MIT | MIT | MIT | Apache-2.0 | Apache-2.0 | AGPL-3.0 |
| Precio | Sin coste en el registro | Sin coste en el registro | Sin coste en el registro | Sin coste en el registro | Sin coste en el registro | Sin coste en el registro |
Copiado tal cual del repo del creador. PopNx MCP no lo ha revisado ni lo respalda. Se quitaron HTML, imágenes y scripts. Los enlaces llevan fuera de este sitio.
*The binary is ctx. The crate is code-context (ctx was taken on crates.io in 2017).*
A queryable code graph for coding agents. Not a map you paste at boot — a set of queries an agent runs mid-task: *who calls this, how does execution get here, what breaks if I change it, what must a move touch, does my port still match the original.*
One Rust binary. Tree-sitter for Rust, Python, TypeScript/TSX, JavaScript/JSX, Go, Java, and Markdown. No language servers, no embeddings, no index to warm. The graph is a pure function of the source tree — same code in, same answer out — and it builds in ~100 ms, so every query runs against current source.
$ ctx callers resolve_call
1 caller(s) of 'resolve_call':
extract::Walk::rec (src/extract/mod.rs:2368-2462 #ab0418a77d9f) → resolve_call
completeness: no call site named resolve_call went unresolved anywhere in this tree — this blast radius is complete to the limit of what ctx parses. At least 1005 undescended region(s) in this tree were not read; see ctx doctor.
That last line is the whole idea, and it does two jobs. It claims completeness for what ctx read, and it bounds that claim by counting what it never read — macro bodies and static/const initializers, whose contents are not parsed as code. A call hiding in one is absent rather than unresolved, so nothing else would have revealed it. Every other code graph tells you what it found. `ctx` tells you what it missed — per edge, in aggregate, and with the grep list to check it yourself.
It matters because the failure mode of a code graph is silent. A blast radius that comes back short reads exactly like a blast radius that is complete, and an agent cannot tell the difference — so it changes the signature and ships the break. Every tool in this space has gaps; this one is built so you can enumerate them.
→ [EXAMPLES.md](EXAMPLES.md) — ten commands run against this repo, verbatim output, including the parts where ctx reports its own limits.
→ [BENCHMARK.md](BENCHMARK.md) — the same claims re-run on six public repositories pinned to exact commits, reproducible with ./bench/run.sh. Including the row where it finds a limitation in ctx.
→ [What the integration itself costs](#measuring-what-it-costs) — ctx's own MCP tool definitions sit in every turn whether a tool is ever called or not, which makes them 3.0× the standing cost of the CLI instructions block. That is the shape this project objects to, measured on itself.
Every static analyzer guesses. ctx is the one that says where.
An edge backed by a resolved import, a path, a self receiver, or a declared type is unmarked — rely on it. An edge inferred from an *opaque* receiver (expr.method(), where nothing in the source states the type) is marked ~. A branch of a dynamic-dispatch fan-out is marked *. And ctx doctor names every callee it could not pin at all, with counts:
## Internal recall — the number to trust
1521/1606 = 94.7% of call sites that could be internal, ctx pinned this many.
grep these; every other edge in the map is one ctx could prove. 50 walk 11 context 8 group 4 est_tokens
parity 18% heuristic (11/61 edges) main 7% heuristic (9/127 edges) refactor 5% heuristic (1/20 edges) extract 2% heuristic (4/235 edges)
The recall number comes with the exact grep list for everything it doesn't cover. The denominator is honest too: a call into std or a third-party crate is excluded, because no internal edge could exist for it however good the resolver gets — and that classification is by evidence (is this name defined anywhere under the root?), not a hardcoded list.
Heuristic method attribution is also language-scoped. A unique method name is evidence only within one language; across languages it is coincidence, so tok.apply_chat_template(...) in Python is never attributed to a Rust method of the same name. Before that guard, 45 of 50 reported callers of that name were artifacts and ~18% of module dep edges were impossible Python→Rust edges — which then distorted core's ranking.
The honest bit isn't that coverage is high. It's that the gaps are enumerable.
That property is not decoration — it is how this tool gets built. Go support went from 36.8% to 89.6% internal recall on go-chi/chi in six steps, and every step was a class of call site the census had already named by count: package scope spanning files, constructor return types, calls leaving through an external import, a func literal shadowing its enclosing scope, the /vN in a module path binding the wrong package name, and method chains. Not one of those was visible in the aggregate number. Each was one line in *What ctx missed*, with the grep to confirm it.
A tool that reported only "36.8%" would have told you it was bad without telling you why, which is the position every other code graph leaves you in.
changed --api — a breaking-change gate that names who breaksBuilds the public API surface at a base ref (in a throwaway detached worktree) and in the working tree, then reports what was removed or whose signature changed — each with the callers it breaks.
$ ctx changed --api --since HEAD~1
0 removed, 4 changed, 7 added.
--strict turns it into a CI gate, and fails only on removals. That asymmetry is deliberate. A removal is unambiguous: nothing can call what is gone. A signature change might be an added optional parameter or a new struct field — routine, compatible work — and ctx is structural, with no type resolution, so it cannot tell that from a changed parameter type. Failing on both was tried and would have blocked ordinary additive commits on the first real repo it met; a gate that cries wolf gets switched off, which is worse than no gate. So signature changes are reported, and under --strict say explicitly that they were reported and not failed.
Treat it as a tripwire that surfaces an unintended removal in review, not as a semver authority — a language-specific tool with a type system (cargo-semver-checks, apidiff, japicmp) is stricter within its language. The trade ctx makes is breadth: one gate across Rust, Python, TypeScript, JavaScript and Go in a polyglot repo.
# .github/workflows/ci.yml — PR-only; fetch-depth 0, the default shallow clone
This isn't a context tool. It's CI.
move-plan — a refactor oracle, not an actuatormove-plan emits every site a module relocation must touch; move-verify checks the result. ctx never writes source files.
ctx move-plan native::gate native::routing::gate # file move + every import rewrite
ctx move-verify native::gate native::routing::gate # exits non-zero if anything is orphaned
The reasoning: an agent can already make edits cheaply and precisely. What it cannot do is know it found *every* site, or prove nothing was orphaned. The scarce thing is ground truth, not typing — and staying read-only keeps ctx free of partial application and undo semantics.
Scope is bounded by what ctx can prove. Moves ride on import and link resolution — path arithmetic, deterministic, non-heuristic — which is ctx's strongest signal, so the site list is exact for the languages it parses. Dependents reached only by receiver inference have no literal string to rewrite and are listed separately as *unverified*, never mixed in with real sites. Rust mod declarations are not imports, so the plan names them as a required manual step rather than omitting them silently. Renaming a *method* is deliberately not offered: it would ride on receiver inference, which resolves a minority of call sites, and a plan built on that would silently miss some.
parity — cross-language port fidelityPorting Python to Rust, or TypeScript to Python? parity answers "is this port a faithful structural copy?" Because the item model is language-neutral, a source module and its port are two renderings of one skeleton.
$ ctx parity research/gate.py src/gate.rs --aliases py-rust
source 6 members · target 5 · aligned 5 (83% of source) · 1 via alias
fn Gate.record gate.py:18
fn Gate.score source=2 → port=1 gate.py:7
fn Gate.init → Gate.new (via init → new)
parity: 5/6 source aligned · 1 missing · 1 arity · 0 call · 0 moved
A dropped method, a dropped parameter, and the __init__→new rename, in one command. --strict exits non-zero on any missing member. I'm not aware of another tool that does this. It might be more or less useful depending on your specific languages and abstractions.
Aider's repo map — and the MCP servers that repackage it, like RepoMapper — compresses a repository into a ranked blob that gets injected at the start of a session, sized to a token budget. It's a good answer to "what is this codebase" for a model that has seen none of it.
ctx answers a different question. Once the agent is *in* a task, it doesn't need the repo ranked — it needs specific facts: trace, path, callers, context, changed --api, move-plan, parity. Those are queries mid-task, not a blob at boot. Ranking is one small command here (ctx core), not the product.
The nearer comparison is Serena, which does LSP-backed symbol navigation. Against it, ctx trades semantic precision for two things:
ctx | LSP-based (Serena) | |
|---|---|---|
| setup | one binary, grammars compiled in | a language server per language, configured and running |
| startup | ~100 ms graph build, per query | server warm-up, project indexing |
| determinism | pure function of the source tree | depends on server state, versions, build artifacts |
| uncertainty | marked per edge (~, *) + a miss census | resolved or absent, silently |
| coverage | 7 languages (today), one graph across all of them | as many as you install servers for |
If you need type-perfect resolution inside one language, use an LSP. If you want the same graph across a polyglot repo with nothing to install and answers that state their own confidence, that's this.
ctx does ship the boot map too (ctx map), so you can have it if you want it. But we'll say plainly what dogfooding taught us: it's the least useful thing here. More on why.
Often you should. Here is the measurement, including where grep wins.
Counting tokens. Every figure in this README is ctx's own estimate —
len/3, the same one `--max-tokens