The full upstream README, mirrored here for reference. Install config, tool schemas, adoption signals, and an original overview live on the Echocache listing page.
An MCP server for a cached LLM response — the way an HTTP cache caches an expensive server response, not the way a browser caches a static asset. Ask a question you already answered once, and the answer echoes back instead of being re-derived.
Two lookup paths, inspired by two different kinds of caching:
cache_get / cache_set key on (model, prompt, params), with
ttl_seconds and stale_while_revalidate_seconds behaving like Cache-Control: fresh, stale,
or expired.cache_query finds related entries by meaning, not just exact key; cache_related walks
graph edges (auto-linked "similar" entries, or explicit "derived-from" parents) to surface
everything already known before an agent redoes work from scratch. cache_invalidate can
cascade through those derived-from edges when a source changes.Runs as a standard stdio MCP server, so it works with Claude Code, Claude Desktop, Cursor, VS
Code + Copilot, or any other MCP-capable host — see Install below, and
AGENTS.md for the tool-use protocol any connected agent should follow.
Cache what an agent concluded, never what it read. This is the whole design, and it is worth stating plainly because the intuitive use is the wrong one: serving a cached file read costs the reader exactly the tokens that reading the file cost, since the content still has to enter the context. So caching file reads saves nothing at any hit rate, and if the agent re-emits the file to store it, that's output-rate tokens paid for zero benefit. A cache only pays when a hit stands in for regenerating something.
Where it pays, and where measurement said it does not:
express/lib — six
files, 62KB — re-reading the source costs 15,504 tokens against 549 to serve the cached
orientation, about 28× fewer. That holds when the later session genuinely needs broad
understanding; if it only needs one specific answer, it will grep and read a slice for ~900
tokens, and the cache isn't competitive.offset/limit, so they were already taking slices rather than whole files.
Substituting a shared derivation for those slices measured 27% worse than what they actually
did: grep is already a cheap, precise pointer, and a cached map competes with it on its own
ground and loses.The rule all three point at: cache what grep cannot reconstruct. A conclusion, a judgement, the reason something is the way it is, a cross-file synthesis no single search reveals, a research finding, the fact that something is absent. Never a location — grep finds those for less than the cache costs to consult — and never a file.
When a cached entry does carry file paths or line numbers, that is to point a reader at exact
detail, not to replace reading it. And reach for cache_query rather than cache_get when
looking for a match: a later session, or another agent, will not phrase the question the way the
writer did.
What this is not: a way to avoid reading files, a source of truth, or a substitute for prompt caching within one conversation, which is cheaper and needs no server. echocache is for results that must outlive the context that produced them.
If your only host is Claude Code, its own persistent memory already does the core of this: write a conclusion to a memory file instead of the files it came from, and a later session reads it back before redoing the work. That's the same rule this project converged on, running for free, with no server to register. This project's own findings and measurements from building it are stored there, not in echocache itself — worth noticing, since it means the tool wasn't used to cache the very research that produced it.
What's actually different, in order of how much it matters:
cache_query finds a match by meaning, independent of how it was phrased or
which file it's filed under. Memory is retrieved by an always-loaded index plus the agent's own
judgment about what to open — no vector search.derived_from
invalidation catch a source going stale automatically. Memory has neither; staleness is caught
only if an agent happens to notice.For a single user on a single host in one project, memory already captures most of the value here for free. What's left as echocache's actual case is narrower than "a cache for LLM responses": it's specifically sharing a derivation across projects or hosts that don't already share a memory store — and that narrower case is unproven, not just untested, until it's been measured the way everything else in this document has.
No clone or build needed — register it straight from npm.
Claude Code
Claude Desktop / Cursor / VS Code — add a stdio entry to the host's MCP config
(claude_desktop_config.json, .cursor/mcp.json, .vscode/mcp.json):
OpenCode — add an entry to opencode.jsonc (global: ~/.config/opencode/opencode.jsonc, or
project-level in the repo root):
Any other MCP-capable host takes the same launch command; only the config file differs. Then point
your agent at AGENTS.md so it knows when to reach for the cache — the protocol
matters more than the wiring, since caching the wrong things costs tokens rather than saving them.
This repo also ships the usage protocol as skills, discovered automatically by hosts that support
project skills: .claude/skills/ for Claude Code, .opencode/skills/
for OpenCode (echocache-cache, echocache-deps, echocache-gain). No extra setup beyond
registering the MCP server above — the skill directory is discovered from the project root.
Every setting is an environment variable, all optional:
| Variable | Default | Meaning |
|---|---|---|
ECHOCACHE_DB_PATH | ~/.echocache/cache.db | SQLite file location |
ECHOCACHE_MAX_ENTRIES | 10000 | LRU ceiling on retained entries |
ECHOCACHE_MAX_BYTES | 268435456 (256MB) | LRU ceiling on retained response bytes |
ECHOCACHE_DEFAULT_TTL_SECONDS | 86400 (1 day) | Freshness lifetime when a caller omits one |
ECHOCACHE_SIMILARITY_THRESHOLD | 0.25 | Similarity floor for auto-linking entries |
ECHOCACHE_LINK_CANDIDATE_POOL | 500 | Recent entries a new write is compared against |
ECHOCACHE_ENCRYPTION_KEY | unset | 64 hex chars (32 bytes); enables AES-256-GCM at rest |
The database directory is created 0700 and its files 0600. Set an encryption key to also
encrypt entry contents at rest:
Turning encryption on or off requires a fresh database — there is no in-place migration, and a key/database mismatch is refused at startup rather than failing on some later read.
| Tool | Purpose |
|---|---|
cache_get | Exact-match lookup with fresh / stale / expired freshness |
cache_set | Store a result; auto-links it into the similarity graph |
cache_query | Semantic search across all cached entries |
cache_related | Graph traversal from one entry to entries linked to it |
cache_invalidate | Delete an entry, optionally cascading to its dependents |
cache_stats | Exact-match hit rate, queryHits/queryMisses, and tokens served |
One SQLite file backs all of them, shared across every project that registers the server — a conclusion reached in one repo is queryable from another. Concurrent readers and writers from separate processes are the expected case, not an edge case.
See CLAUDE.md for architecture and the module reference.
MIT