The argument in one line.
Graphify front-loads codebase traversal once into a persistent knowledge graph, so every subsequent Claude Code query reads a compact map instead of re-scanning raw files, cutting token costs by roughly 60% with no loss in answer quality.
Read if. Skip if.
- You use Claude Code on codebases with 50+ files and notice it burning context or producing incomplete answers.
- You have hit session limits mid-task and wanted repo-structure memory that persists across sessions without re-indexing.
- You are onboarding to an unfamiliar large codebase and need architectural orientation fast.
- You want a free open-source alternative to setting up a full RAG pipeline specifically for code.
- Your codebase is under ~20 files — the indexing overhead will not pay back quickly.
- Your knowledge base is primarily unstructured documents (PDFs, policy files) rather than code — GraphRAG or a vector-based system will serve you better.
The full version, fast.
Graphify scans a repository in three passes — deterministic code-structure extraction (no API cost), audio/video transcription via faster-whisper, and LLM semantic analysis of docs and images — then assembles a knowledge graph of nodes, edges, and communities. Claude Code queries this graph instead of grepping raw files, producing faster, cheaper answers because connections are pre-mapped. A live comparison on the 203-file OpenDesign repo showed ~80K tokens with Graphify versus ~200K without for the same architectural question. The graph auto-rebuilds after each commit via a git hook at zero API cost, making it practical for active projects.
Chat with this breakdown — free.
Sign in and you get 23 free chat messages on us — ask for the hook, quote a framework, find the exact transcript moment, generate a markdown action plan. Bring your own key when you want unlimited.
Create a free account →Where the time goes.

01 · Hook / intro
Knowledge graph visualization shown, promise to solve Claude Code's memory problem stated.

02 · Graphify explained
What Graphify does, why a graph beats grepping, token savings context (up to 70x claimed; host calibrates lower but significant).

03 · How it works: three passes
Pass 1 (tree-sitter, free), Pass 2 (whisper audio), Pass 3 (LLM docs/images). Nodes, edges, communities explained. Graphify vs. GraphRAG comparison table on whiteboard.

04 · Sponsor
Chase AI+ Claude Code Masterclass plug.

05 · Installation + command ref
GitHub README walkthrough, pip install, graphify install, platform commands, full command reference.

06 · Demo setup: OpenDesign repo
OpenDesign (open-source Claude Design alternative) cloned; /graphify . run in Claude Code terminal.

07 · Demo results + token comparison
203 files, 1907 nodes, 3447 edges, 109 communities. Knowledge graph visualized. Side-by-side: ~80K tokens (Graphify) vs ~200K tokens (no Graphify) for identical architectural question.

08 · Living graph + team usage
graphify hook install auto-rebuilds AST on each commit at zero API cost. Works in multi-developer parallel setup.

09 · Final thoughts
Graphify positioned between Obsidian and full RAG. Upcoming Obsidian+Graphify video teased.
Lines worth screenshotting.
- Graphify gives Claude Code a structural map of your codebase; without it, the model is essentially doing Ctrl+F on every query.
- Pass 1 of Graphify is completely free — it uses tree-sitter to extract code structure locally with no LLM involved.
- The 70x token savings some users claim is on the high side; a realistic benchmark on a mid-size repo is closer to 60%.
- A knowledge graph query returns exact structural facts (A calls B); a RAG query returns semantic similarity (this seems related) — different tools for different questions.
- graphify hook install sets up a post-commit git hook that rebuilds the AST-only graph automatically after every commit at zero API cost.
- graphify claude install makes the graph always-on in Claude Code — no need to prefix every question with an explicit /graphify command.
- The god nodes output (most-connected functions and files) is itself a useful codebase orientation artifact, independent of any query savings.
- Graphify and GraphRAG are not competing products for the same use case — Graphify wins on structured code, GraphRAG wins on large unstructured document collections.
- Two developers committing to the same repo in parallel both benefit from the shared graph — the knowledge graph is a team asset, not a personal one.
- The Obsidian flag generates an entire Obsidian vault from any repo in one command — useful for non-code knowledge bases that do not need full RAG.
One index run, permanent token savings.
Graphify's core trade is upfront indexing cost for permanently cheaper queries — and because the AST rebuilds free on every commit, the savings compound across a project's lifetime.
- The first Graphify pass uses tree-sitter to extract code structure locally with no LLM and no API cost — even this alone gives an AI assistant a structural map it would otherwise reconstruct on every query.
- Running graphify hook install sets up a post-commit git hook that rebuilds the AST after each commit at zero API cost, keeping the graph current without manual intervention.
- The live side-by-side demo showed ~80K tokens with Graphify versus ~200K without for the same architectural question — roughly 60% savings, not the 70x some users claim, but consistent and repeatable.
- Graphify and GraphRAG answer different question shapes: use Graphify when you need exact structural answers about code wiring; use GraphRAG when you need semantic search across large unstructured document collections.
- The god nodes output — the most highly connected functions and files in the repo — is itself a useful architectural orientation artifact, independent of any token-savings benefit.
- graphify claude install makes the graph always-on inside Claude Code, removing the need to prefix every question with an explicit query command — the model consults the graph by default.
Terms worth knowing.
- Knowledge graph
- A network of nodes (code entities like functions and classes) and edges (their relationships), allowing structured queries about how parts of a system connect rather than just searching for keyword matches.
- God node
- In Graphify output, the most highly connected node in the graph — a function or file that touches the greatest number of other components, indicating a core architectural dependency.
- Community (graph)
- A cluster of nodes that are more densely connected to each other than to the rest of the graph, typically corresponding to a coherent module or subsystem within the codebase.
- GraphRAG
- A retrieval-augmented generation variant (e.g. Microsoft GraphRAG, LightRAG) that builds a graph structure from unstructured documents using LLM-generated embeddings, suited for semantic search over prose rather than code structure.
- Tree-sitter
- A fast incremental parsing library that extracts structural information (functions, imports, call graphs) directly from source code without running the code, forming Graphify's free first pass.
- AST (Abstract Syntax Tree)
- A tree representation of source code structure; Graphify uses AST-level diffing on each commit to rebuild only changed parts of the graph at no API cost.
- Betweenness centrality
- A graph metric measuring how often a node lies on the shortest path between other nodes — Graphify uses it to flag the highest-traffic bridges in a codebase, revealing hidden architectural coupling.
Things they pointed at.
Lines you could clip.
“This gives Claude code a map while grepping through files doesn't at all.”
“About 40% of the total cost of the non-graphified version, which is significant savings.”
“We've built it out already. We can always query it for cheap.”
Word for word.
Don't just watch it. Burn it in.
See every word as it's spoken — crank it to 2× and still catch all of it. The same dual-channel trick behind Amazon's Kindle + Audible.
The bait, then the rug-pull.
Sixty thousand stars and a bold claim: one open-source tool can give Claude Code a persistent, queryable map of any codebase and cut token costs by more than half. This breakdown walks the full mechanism — from the three extraction passes to a live side-by-side comparison — so you can judge the numbers yourself.
Named ideas worth stealing.
The Three Passes
- Pass 1: Code structure (tree-sitter, free, no LLM)
- Pass 2: Video/audio (faster-whisper, no API cost)
- Pass 3: Docs/papers/images (Claude subagent, costs tokens)
Graphify processes a repo in three distinct extraction passes with different cost profiles, combining outputs into a single knowledge graph.
Graphify vs. GraphRAG Decision Table
- Use Graphify for: code structure questions, exact call tracing, wiring diagrams
- Use GraphRAG for: unstructured documents, policy lookup, semantic similarity across prose
A 4-row comparison (Use when / Best question / How it builds / Answer type) positioning the two graph-based approaches by input type and question shape.
How they asked for the click.
“So not too long ago, I released the Claude Code masterclass, and it is the number one way to go from zero to AI dev no matter your technical background.”
Mid-video self-sponsor for Chase AI+. Placed at the theory-to-demo transition — smart timing since viewer interest peaks just before the hands-on section.







































































