Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add instructions/michael-denyer/memory-mcp/claude-mdgit clone --depth 1 https://github.com/michael-denyer/memory-mcpWrote 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/michael-denyer/memory-mcp/claude-md)<a href="https://agentmods.dev/instructions/michael-denyer/memory-mcp/claude-md"><img src="https://agentmods.dev/badge/instructions/michael-denyer/memory-mcp/claude-md.svg" alt="Measured on agentmods" 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 | $0.01595 | $0.01595 |
| Opus 5 | $0.00797 | $0.00797 |
| Sonnet 5 | $0.00319 | $0.00319 |
| Haiku 4.5 | $0.00160 | $0.00160 |
Grade A, and why
memory-mcp 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 5d 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 — 176 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Memory MCP - Project Instructions
Core Value Proposition
The Engram Insight: Frequently-used patterns should be instantly available, not searched for.
This project differentiates from generic memory servers (like mcp-memory-service) through:
-
Two-Tier Memory Architecture
- Hot Cache: Session-aware context injected at 0ms (no tool call needed)
- Cold Storage: Semantic search for everything else
-
Salience-Based Promotion
- Unified salience score: importance + trust + access count + recency
- Auto-promote when salience ≥ 0.5 AND access count ≥ 3
- Auto-demote after 14 days without access
- Pin important memories to prevent auto-eviction
-
Hot Cache Resource
memory://hot-cache: Session-aware active context (~10 items)- Combines: recently recalled, predicted next, top promoted items
- Backed by promoted memories (~20 items)
-
Multi-Hop Recall
expand_relations=truetraverses knowledge graph- Finds associated memories via typed relationships
- Score decay prevents dilution of results
-
Episodic Memory
- Session-bound short-term context (7-day retention)
end_session()promotes top memories to long-term storage- Consolidates session context automatically
-
Pattern Mining from Usage
- Extracts imports, commands, project facts from Claude's outputs
- Frequency-based promotion candidates
- Human approval before promotion (auto-approve for high-confidence)
-
Knowledge Graph
- Link related memories with typed relationships
- Relation types:
relates_to,depends_on,contradicts,supersedes,refines,elaborates
-
Trust Management
- Strengthen/weaken memory confidence with contextual reasons
- Per-memory-type trust decay rates
- Audit trail for trust changes
-
Memory Consolidation
consolidateCLI merges semantically similar memories- Reduces redundancy while preserving information
Architecture
flowchart LR
subgraph LLM["Claude"]
REQ((Request))
end
subgraph Hot["Hot Tier · 0ms"]
HC[memory://hot-cache]
PM[(Promoted memories)]
end
subgraph Cold["Cold Tier · ~50ms"]
VS[(Vector Store)]
KG[(Knowledge Graph)]
end
REQ -->|"auto-injected"| HC
HC -.->|"draws from"| PM
REQ -->|"recall()"| VS
VS <-->|"expand_relations"| KG
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.
- 5d ago First seen · 176 lines · 1,595 tokens per session scan A 377c5b8d81ba
memory-mcp CLAUDE.md is an instructions file published in the GitHub repository michael-denyer/memory-mcp (7 stars, last pushed 16d ago), licensed MIT. It adds 1,595 tokens to every session, about $0.0080 per session on Opus 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.
Other instructions, from other repositories
cognirepo CLAUDE.md
Claude Code instructions for ashlesh-t/cognirepo, covering claude.md, key rules, session start sequence (run in this order), behavioral confirmation rule and personas (cognirepo-402, cognirepo-403).
aeon CLAUDE.md
Claude Code instructions for aeonfun/aeon, covering aeon, how aeon works, strategy, voice and soul file hierarchy (read in this order).
wayland-core copilot-instructions.md
Copilot instructions for FerroxLabs/wayland-core, covering ijfw rules, output discipline, memory routing, context discipline and cross-audit.
mcp-structured-memory CLAUDE.md
Claude Code instructions for nmeierpolys/mcp-structured-memory, a project described as: Structured Memory MCP Server.
inkwell-memory CLAUDE.md
Instructions for veronchenko/inkwell-memory, covering claude.md — inkwellmemory, layout, multi-tenant mode (inkwellmultitenant=1), conventions and testing.
memory-mcp-1file AGENTS.md
Instructions for pomazanbohdan/memory-mcp-1file, covering ⛔ l0 invariants (never violate under any circumstance), detection heuristic, 🔀 phase transition routing (⛔ blocking), gate-0: phase identification & loading and 🧾 proof-of-load requirement (critical).