by syncable-dev
Structural memory for AI coding agents. Bi-temporal graph, MCP-native, zero LLM calls. Cursor · Claude Code · Codex · Hermes · VS Code · Windsurf.
# Add to your Claude Code skills
git clone https://github.com/syncable-dev/memtrace-publicGuides for using ai agents skills like memtrace-public.
Last scanned: 5/30/2026
{
"issues": [],
"status": "PASSED",
"scannedAt": "2026-05-30T15:52:55.568Z",
"npmAuditRan": true,
"pipAuditRan": true
}memtrace-public is an open-source ai agents skill for AI coding assistants such as Claude Code, Codex CLI, and ChatGPT, built by syncable-dev. Structural memory for AI coding agents. Bi-temporal graph, MCP-native, zero LLM calls. Cursor · Claude Code · Codex · Hermes · VS Code · Windsurf. It has 183 GitHub stars.
Yes. memtrace-public passed SkillsLLM's automated security scan — a dependency vulnerability audit plus prompt-injection heuristics — with no high-severity issues. You can read the full report in the Security Report section on this page.
Clone the repository with "git clone https://github.com/syncable-dev/memtrace-public" and add it to your Claude Code skills directory (see the Installation section above).
memtrace-public is primarily written in Python. It is open-source under syncable-dev on GitHub, so you can review or fork the full source.
Yes. SkillsLLM lists many other AI Agents skills you can browse and compare side by side. Open the AI Agents category from the badge at the top of this page, or use the Related Skills and comparison links further down to weigh memtrace-public against similar tools.
No comments yet. Be the first to share your thoughts!
Three things, every release.
🧭 Run a fleet of coding agents on the same repo without merge hell. Each agent reads the same call graph, sees the same blast radius, inherits the same temporal history. No collisions. No stale context.
🔁 Replay any refactor with full causal awareness. Agents see exactly what depends on what, and what changed when. No more "I refactored a function and 14 tests broke that nobody saw."
⚡ Index a 50k-file repo in under 90 seconds. Rust + Tree-sitter, $0 in API costs, 20+ languages plus framework-aware scanners (Vapor, Lapis, Kong, GitHub Actions, Terraform, RLS policies, …), fully local. Your code never leaves your machine.
🆕 LeanCTX Native — compressed reads, smart trees, and a value ledger.
Four new compression modes on get_source_window, single-call directory maps, real-time token-savings dashboard, and an opt-in adaptive learner that beats the static table by ~14%. Full breakdown: docs/leanctx-native.md. Available in v0.3.57+.
https://github.com/user-attachments/assets/e7d6a1e9-c912-4e65-a421-bd0256dffa5a
| Operation | Memtrace | Best alternative | Δ |
|---|---|---|---|
| Index 1,500 files | 1.5s · $0 | Mem0: 31 min · $10–50 | ~1,200× faster |
| Exact symbol query (acc@1, lat) | 96.6% · 0.07 ms | GitNexus: 97.0% · 8.95 ms | 128× lower latency |
| Graph callers recall (Django) | 81.6% | GitNexus: 5.3% | 15.4× |
| Incremental re-index p95 | 42.5 ms | CodeGrapher: 613.7 ms | 14.4× |
| Hybrid acc@1 (Django, 3K cases) | 73.9% | GitNexus: 38.6% | 1.91× |
| PR code-review F1 (50 PRs) | 0.7268 | Cubic v2: 0.6077 | +19.60% |
| RSS / process | 26 MB | ChromaDB: 1,060 MB | 41× tighter |
| Languages | 16+ (Tree-sitter) | varies | — |
Reproducible benchmark suite: benchmarks/. Same machine, same corpora, same adapter contract. Ground truth from Python's ast and pyright LSP — never from any tool's own index. No system gets a home-field advantage in the dataset.
Detailed breakdowns: BENCHMARKS-v0.3.22.md · BENCHMARKS-v0.3.29.md · Code reviewer benchmark
Memtrace is in private beta. We're rolling out access in batches to keep the feedback loop tight — every cohort lands in a Discord channel where we ship fixes from real bug reports inside a week.
→ Join the waitlist at memtrace.io.
Already have access? npm install -g memtrace and you're indexing in 90 seconds. Full setup below.
🔒 Privacy. Memtrace runs entirely on your machine. Source code never leaves it. The only network traffic is license validation, aggregate node/edge counts, and opt-out crash telemetry — no source, no file paths, no symbol names. Full breakdown: PRIVACY.md, TELEMETRY.md. Disable telemetry with
MEMTRACE_TELEMETRY=off.
Good code-intelligence tools already exist. GitNexus and CodeGrapherContext build AST-based graphs that work for "what's in my repo right now."
Memtrace is a bi-temporal episodic structural knowledge graph. It builds on the same AST foundation and adds two dimensions:
On top of that, the structural layer is comprehensive:
| Symbols are nodes | functions, classes, interfaces, types, endpoints |
| Relationships are edges | CALLS, IMPLEMENTS, IMPORTS, EXPORTS, CONTAINS |
| Community detection | Louvain algorithm identifies architectural modules automatically |
| Hybrid retrieval | Tantivy BM25 + vector embeddings + Reciprocal Rank Fusion + cross-encoder rerank |
| Rust-native | compiled binary, no Python/JS runtime overhead, sub-8 ms p95 query latency |
The agent doesn't just search your code. It remembers it.
Mem0 and Graphiti are strong conversational memory engines designed for tracking entity knowledge (e.g. User -> Likes -> Apples). They excel at that. For code intelligence specifically, the tradeoff is that they rely on LLM inference to build their graphs — which adds cost and time when processing thousands of source files.
Graphiti processes data through add_episode(), which triggers multiple LLM calls per episode — entity extraction, relationship resolution, deduplication. At ~50 episodes/minute (source), ingesting 1,500 code files takes 1–2 hours.
Mem0 processes data through client.add(), which queues async LLM extraction and conflict resolution per memory item (source). Bulk ingestion with infer=True (default) means every file passes through an LLM pipeline. Throughput is bounded by your LLM provider's rate limits.
Both accumulate $10–50+ in API costs for large codebases because every relationship is inferred rather than parsed.
Memtrace takes a different approach: it indexes 1,500 files in 1.2–1.8 seconds for $0.00 — no LLM calls, no API costs, no rate limits. Native Tree-sitter AST parsers resolve deterministic symbol references (CALLS, IMPLEMENTS, IMPORTS) locally. The tradeoff is that Memtrace is purpose-built for code — it doesn't handle conversational entity memory the way Mem0 and Graphiti do.
Memtrace exposes a full structural toolkit via the Model Context Protocol.
Search & Discovery
find_code — hybrid BM25 + semantic + RRFfind_symbol — exact / fuzzy with LevenshteinRelationships
analyze_relationships — callers, callees, hierarchy, importsget_symbol_context — 360° view in one callImpact Analysis
get_impact — blast radius with risk ratingdetect_changes — diff-to-symbols scope mappingCode Quality
find_dead_code — zero-caller detectionfind_most_complex_functions — complexity hotspotscalculate_cyclomatic_complexityget_repository_statsTemporal Analysis
get_evolution — 6 scoring modesget_timeline — full version historydetect_changes — diff-based scopeGraph Algorithms
find_bridge_symbols — betweenness centralityfind_central_symbols — PageRank / degreelist_communities — Louvain moduleslist_processes / get_process_flowAPI Topology
get_api_topology — cross-repo HTTP graphfind_api_endpointsfind_api_callsIndexing & Watch
index_directory — parse, resolve, embedwatch_directory — live incrementalexecute_cypher — direct g