Fullerenes: Open-source persistent memory layer for coding agents cuts tokens by 64% on SWE-bench

Fullerenes is an open-source persistent memory layer for AI coding agents. Instead of re-reading files every session, it builds a local knowledge graph from your repo using Tree-sitter and exposes it over MCP (Model Context Protocol). Agents query the graph for functions, classes, imports, and call relationships rather than reading raw files — cutting token consumption drastically.
How it works
Run npx fullerenes init in your repo. It walks the codebase with Tree-sitter, extracts every function, class, import, and call relationship, and stores it in a local SQLite graph. Agents connect via MCP and ask targeted questions.
The design draws on retrieval research: Repoformer (retrieve only when needed), HippoRAG and G-Retriever (graph beats flat chunks), and LLMLingua (aggressive context compression). The goal is better signal per token, not more context.
Unique MCP tools
Two standout tools:
predict_impact({ functionName: "x" })— Before editing, the agent asks what else will break. Traverses the edge graph and returns direct + transitive dependents with a risk score. Blast radius before the first keystroke.get_function({ name: "x", includeBody: true })— Signature, body, and callers in one MCP call. No follow-upread_fileneeded.
Benchmark results
- SWE-bench Verified (1 instance so far): Codex baseline 91,949 tokens → with Fullerenes 32,945 tokens. 64% reduction.
- Internal (5 questions on this repo): Raw files 2,452 tokens avg → Fullerenes 137 tokens avg. 94.4% reduction.
- External (Gemini CLI on a Python project): Raw files 27,292 tokens → Fullerenes AGENTS.md 919 tokens. 96.6% reduction.
Limitations
Tree-sitter is structural, not semantic. Dynamic dispatch and metaprogramming will miss edges. LSP integration is on the roadmap. One SWE-bench instance is not a broad result — more are being run.
Local & open source
Everything runs locally: SQLite, no server, no API key, pure npm (no Python), works offline, MIT license. 589 npm downloads in 40 hours before the Reddit post. 14 stars. Just launched.
github.com/codebreaker77/Fullerenes
npmjs.com/package/fullerenes
Three questions the author is asking the community: Does graph-based retrieval change your agent workflows, or is long context winning? What MCP tools beyond the current 8? Does the SWE-bench methodology look sound?
📖 Read the full source: r/ClaudeAI
👀 See Also

Claude adds memory import feature to migrate from other AI providers
Claude now allows users to import context and preferences from other AI providers through a copy-paste process. The memory feature is available on all paid plans and helps maintain conversation history when switching platforms.

Benchmark Results: 6 Low-Cost Models vs. Claude Sonnet 4.6 for OpenClaw Orchestration
A developer tested six cheaper AI models against Claude Sonnet 4.6 as the main orchestrator for an OpenClaw setup. Only o4-mini matched Sonnet's perfect score, while others failed on critical judgment tasks like file inspection and delegation.

ATLAS: Adaptive Test-time Learning Framework Outperforms Claude Sonnet on Coding Benchmarks with $500 GPU
ATLAS achieves 74.6% pass@1-v(k=3) on LiveCodeBench with a frozen 14B model on a single consumer GPU, outperforming Claude 4.5 Sonnet's 71.4% at a fraction of the cost using constraint-driven generation and self-verified iterative refinement.

Two MCP Tools for Claude Code: Idea Validation and Trading Agent Memory
A developer built two MCP tools for Claude Code: idea-reality-mcp checks GitHub and Hacker News before coding to avoid duplicates, while tradememory-protocol provides memory for AI trading agents to store trades with context and track strategy performance. Both are open source and available on PyPI.