Fetching from the wire…
Public story · 2026-07-27 · high
The project's GitHub stars jumped by 4,577 in the week ending July 27, though its own benchmark shows precision from 44 to 79 percent.
Why now: The 4,577-star jump landed in the week ending July 27, right as the project's benchmark numbers started making the rounds.
code-review-graph builds a searchable graph of a repo's functions, classes and imports, then feeds AI agents only the files a question touches, per its GitHub page.
That matters for anyone paying per-token costs to run coding agents: the project's own benchmarks report a median 82x reduction in tokens per question across six test repos, ranging from 38x on the low end to 528x on the high end.
The tool works by parsing source into a Tree-sitter AST, then linking functions, classes and imports through call, inheritance and test-coverage edges. It stores that graph in SQLite under a .code-review-graph/ folder and exposes it as an MCP server, so an agent can query what calls a function instead of grepping the whole repo.
Language coverage is wide: 30+ languages plus Jupyter, Databricks and Ansible, with Vue and Svelte support, and custom languages can be added through a languages.toml file without forking the project.
Impact-accuracy F1 sits at 0.71, with precision ranging 0.44 to 0.79 depending on the repo. That's a wide enough spread that a graph query can hand an agent the wrong file for anywhere between one in five and one in two questions, depending on which codebase you point it at.
I run a homegrown version of this same idea, and the token savings are real, they drop API costs and speed up how fast an agent lands on a correct answer. But the precision range means I still keep grep in my back pocket for anything I don't want to get wrong. Watch whether precision holds above 0.7 as more people point this at messier, older codebases than the six it was benchmarked on.
Each link below shares sources, entities, or timing with this story.
tirth8205/code-review-graph topped GitHub daily trending at 22.5k total stars, MIT licensed, building a persistent Tree-sitter map so coding agents read only relevant context. Claimed ~82x median per-question token reduction across six repos (range 38x to 528x) at 0.714 averag...
Triple-stream retrieval (BM25 keyword, vector embeddings, knowledge-graph traversal) fused via Reciprocal Rank Fusion on the iii engine, with SQLite for state and an in-memory vector index, no external database. The economic claim: ~170K tokens/year (~$10) versus ~650K tokens...
1. Use claude agents --json to build session dashboards. Claude Code v2.1.145 outputs all live agent sessions as structured JSON with status, model, elapsed time, and parent relationships. Pipe it into a tmux status bar widget or session picker script for switching between bac...
This is the install-this-today story. code-review-graph (3.5K GitHub stars) builds a persistent AST-based knowledge graph of your codebase using Tree-sitter, then queries it at review time to compute the minimal context set Claude actually needs. On a 27,732-file Next.js monor...
A repo nobody was talking about yesterday just became the fastest-growing developer tool on GitHub. colbymchenry/codegraph gained 4,222 stars in a single day, landing at 12,200 and climbing. The reason is simple: it solves the biggest cost and speed bottleneck in AI-assisted c...
lean-ctx is a Rust-based system that sits between AI coding tools and LLMs, compressing file reads by 60-99% and shell output by 60-95% using Tree-sitter AST parsing for 18 languages. Cached re-reads cost only 13 tokens. Works as a standard MCP server with 49 tools. Compatible...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.