Borrowing it
Nothing to install: this file belongs to Graph-tl/graph. Take a copy, put it at the same path in your own repository, and replace the rules that are about this project with yours.
curl -O https://raw.githubusercontent.com/Graph-tl/graph/main/CLAUDE.mdgit clone --depth 1 https://github.com/Graph-tl/graphWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/instructions/graph-tl/graph/claude-md)<a href="https://agentmods.dev/instructions/graph-tl/graph/claude-md"><img src="https://agentmods.dev/badge/instructions/graph-tl/graph/claude-md/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/instructions/graph-tl/graph/claude-md"><img src="https://agentmods.dev/badge/instructions/graph-tl/graph/claude-md.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.01011 | $0.01011 |
| Opus 5.5 | $0.00404 | $0.00404 |
| Sonnet 5.5 | $0.00202 | $0.00202 |
| Haiku 4.5 | $0.00101 | $0.00101 |
Grade A, and why
graph CLAUDE.md scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2mo ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 55 lines — stays where its author put it; the contents beside it link to each section on GitHub.
CLAUDE.md
This file provides guidance to Claude Code (claude.ai/code) when working with code in this repository.
Project
Graph is an MCP server that gives AI agents persistent memory across sessions. Agents decompose work into dependency trees, claim tasks, record evidence, and hand off to the next session automatically. Published as @graph-tl/graph on npm.
Commands
npm test # Run all tests (vitest, ~161 tests across 6 files)
npm run build # Build with tsup (ESM, node20 target)
npx vitest run test/tools.test.ts # Run a single test file
npx vitest run -t "creates a new project" # Run a single test by name
Architecture
MCP server (src/server.ts) — registers 14 tools, handles tool calls via switch statement, manages version banner and agent file auto-update on first call.
Tool handlers (src/tools/*.ts) — one file per tool. Each exports a handleXxx(input, agent) function. Tools: open, plan, next, context, update, connect, query, restructure, history, onboard, tree, status, knowledge (4 sub-tools), agent-config.
Data layer:
db.ts— SQLite via better-sqlite3, WAL mode, schema migrations. DB is lazy-initialized on first tool call.nodes.ts— CRUD for nodes (tasks). Handles depth computation, parent-child, project summaries.rowToNode()converts SQLite integers/JSON strings to typed objects.edges.ts— Dependency edges with cycle detection (DFS).findNewlyActionable()walks the graph to find nodes unblocked by a resolution.events.ts— Audit trail. Every mutation logs a timestamped event with field-level changes.types.ts— Core interfaces:Node,Evidence,Edge,Event,NodeRow(SQLite row shape).
Validation (validate.ts) — Two error types: ValidationError (bad input) and EngineError(code, message) (business logic, e.g. cycle_detected, evidence_required, delete_protected).
Gating (gates.ts, license.ts) — License tier enforcement (free/pro). Gates checked in server.ts before calling handlers.
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2mo ago First seen · 55 lines · 1,011 tokens per session scan A d0172aeb028c
graph CLAUDE.md is an instructions file published in the GitHub repository Graph-tl/graph (7 stars, last pushed 8mo ago), licensed MIT. It adds 1,011 tokens to every session, about $0.0040 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
graph CLAUDE.md compared with instructions from other repositories
| Mod | Type | Stars | Last push | Licence | Scan | Tokens | Works with |
|---|---|---|---|---|---|---|---|
| graph CLAUDE.mdGraph-tl/graph | Instructions file | 7 | 8mo ago | MIT | A | 1,011 | Claude Code |
| vscode buildNext.instructions.mdmicrosoft/vscode | Instructions file | 195k | yesterday | MIT | A | 9,719 | GitHub Copilot |
| next.js AGENTS.mdvercel/next.js | Instructions file | 143k | yesterday | MIT | A | 7,461 | Codex, OpenCode |
| langchain AGENTS.mdlangchain-ai/langchain | Instructions file | 149k | yesterday | MIT | A | 4,680 | Codex, OpenCode |
| vscode oss-third-party-notices.instructions.mdmicrosoft/vscode | Instructions file | 195k | yesterday | MIT | A | 5,516 | GitHub Copilot |
| vscode copilot-instructions.mdmicrosoft/vscode | Instructions file | 195k | yesterday | MIT | A | 3,093 | GitHub Copilot |
| deepseek-harness AGENTS.mddeepseek-ai/deepseek-harness | Instructions file | 274k | 2d ago | MIT | A | 4,313 | Codex, OpenCode |