How you use it
Index once, connect an agent, then ask questions instead of reading files.
Clone the engine, point it at a codebase, and let it build the graph. Everything runs and stays on your machine — no code leaves it.
A local code-intelligence engine for AI agents. It indexes a repository into a code graph, then answers targeted questions — symbols, dependencies, effects, contracts, similar code, and blast radius — over MCP and HTTP.
Built natively into REX, ClassEve’s desktop AI — so REX understands large codebases by meaning, not just text.
Open source under Apache-2.0 — clone it or browse the repo:
You pay for all 1,318 — every single time it asks.
The job is always the same three things: the function, the code it uses from other files, and the code that calls it. We measured what that costs 1,000 times on a real 375,000-line codebase of 2,944 files, picking the functions at random. Not an estimate. On an ordinary job your agent searches for the name, opens the 2 files that come back, and reads every line in them.
Both sides were given the same number of tokens to spend, so this is not a trade of cheaper for worse. It is a measurement of what your assistant is handed — not a claim about how it thinks.
There is no service to sign up for and no API key to paste in. The index is a database on your own computer, so nothing gets uploaded and nothing charges you per search. Pull the network cable and try it — the switch does exactly that.
Set how many jobs your agent runs in a day and what you pay per million tokens. The saving per job is measured; the price is yours, because we are not going to quote a rate that changes next month.
In a big repository, most of any file has nothing to do with your question — and that is the part that never gets sent. Measured on four different codebases.
2,443 files of scripts, release tooling, a website and this engine’s own source: 18,682 tokens a job down to 766 — 96% fewer, and 25× less across the whole run. The function you asked about came back every time, against 1 time in 21 by searching.
Index once, connect an agent, then ask questions instead of reading files.
Clone the engine, point it at a codebase, and let it build the graph. Everything runs and stays on your machine — no code leaves it.
Developer tools — and the agents built on top of them — inspect source one file at a time. For any non-trivial change that means opening many files, tracing transitive effects by hand, and still missing contract assumptions or behaviourally similar code.
Context Zero indexes the repository once into a PostgreSQL-backed code graph, then exposes the same investigation as structured queries: source, callers, callees, effects, tests, invariants, and impact. The goal is practical — make repository context easier to verify, audit, and reuse.
One real job: change a function. To do it safely an assistant must see the function, the code it uses from other files, and the code that calls it. Collecting those three things was measured 1,000 times — searching and reading files, against one Context Zero request. Engine 2.13.0, live, on the current build.
Both bars answer identical questions. The baseline is deliberately conservative: capped at the 25 files an agent would plausibly open before giving up, and limited to distinctive symbol names where searching by name is a fair proxy for what an agent would actually do.
Cheap is easy — an empty answer costs nothing. So both sides were given the same tokens to spend, and what came back was checked against the real source code on disk. Searching for a name finds the places that mention it, not the things it needs, which is why the cheaper answer is also the more complete one.
Four separate runs, each against the exact-symbol baseline. On a small repository a capsule saves a little; on a large one it replaces work that no longer fits in a context window. The first three are historical runs from the versions named in the benchmark file; the production rung is the 1,000-task run above, with both sides drawing on the same indexed set of files.
Savings shown are token reduction against the exact-symbol baseline: Engine self-ingest 63.1% · VS Code 91.96% · Seven public repos 92.2% · Production monorepo 87.9%.
Context Zero indexing its own codebase — 105 files, 7,753 symbols. Every pair is one symbol: what an agent would read to understand it, against the capsule that answers the same question. This is the run you can reproduce yourself.
Measured against the self-ingest snapshot on consumer-grade hardware — no server hardware, no clustering. Against the 125k-symbol VS Code snapshot the same queries stayed in the same range: blast radius 164 ms, strict capsule 49 ms.
The engine indexing its own source, measured 2026-08-26 at a named commit: symbol extraction, relation resolution, dispatch resolution, lineage, effect signatures, contract mining and concept families — 4 minutes 40 seconds, no failures. It ran against a database that already held other work, so the counts are what to compare; a clean database is faster. Clone the repository and run it yourself.
TypeScript and JavaScript use full AST analysis through the TypeScript compiler; Python uses LibCST; the rest use tree-sitter with language-specific walkers.
Tokens are estimated as ceil(bytes / 4) — a deterministic approximation chosen so runs are repeatable; exact counts differ by model, but the ratios hold. The production monorepo is private, so that run is not reproducible outside ClassEve; the self-ingest figures are, on this repository. Absolute timings vary with corpus, hardware, database configuration and engine version.
Reproduce the head-to-head on your own indexed repository with node scripts/bench-head-to-head.ts 40 /path/to/your/repo, and the ingest figures with npx ts-node scripts/bench-ingest.ts. The full method, the historical runs, and the cases where a capsule is larger than the file it replaces are in BENCHMARKS.md.
Context packages — source, dependencies, contracts, and effects in one call, with a five-level degradation ladder.
Structural, behavioural, contract, homolog, and historical impact analysis, with severity and confidence scoring.
Every function classified pure / read-only / read-write / side-effecting, with the effects propagated transitively.
Input and output types, error and security contracts, guard clauses, and invariants extracted from the source.
Find code by what it does — TF-IDF plus MinHash LSH similarity. No external APIs.
One call returns source, blast radius, callers, tests, and contracts — replacing eight or more separate lookups.
The graph follows the code. Edits are folded into the snapshot seconds after they hit disk — no scheduled job, no editor plugin.
Fifteen languages: TypeScript, JavaScript, Python, C, C++, CUDA, Go, Rust, Java, C#, Ruby, Kotlin, Swift, PHP, and Bash. TypeScript and JavaScript use full AST analysis through the TypeScript compiler; Python uses LibCST; the rest use tree-sitter with language-specific walkers. Thirteen analysis engines are exposed through sixty-one MCP tools.