Parallel Memory MCP — Git skill for Claude Code
A memory MCP server that survives parallel agents: SQLite-serialised writes, unified across git worktrees, mirrored into graphify memory docs and Claude Code auto-memory.
How to install Parallel Memory MCP
This entry records only its repository, not the path inside it, so there is no
exact command to give. Open daichiyasunami-vottia/parallel-memory-mcp and copy the folder into
~/.claude/skills/, or the file into ~/.claude/agents/.
What Parallel Memory MCP does
A memory MCP server that survives parallel agents: SQLite-serialised writes, unified across git worktrees, mirrored into graphify memory docs and Claude Code auto-memory. Includes the benchmark showing what the alternatives lose.
Alternatives in Git
- Git MCP — GitHub Repo stars Free open-source remote MCP server for any GitHub project Git integration MCP 7.8k ★
- Intel — On-demand intelligence fetch for a target — CVEs, disclosed reports, new features 3.8k ★
- Perfup — Autonomous performance optimization: research, PoC, benchmark, implement, review, PR 3.6k ★
README
parallel-memory-mcp
A memory MCP server for agents that run in parallel — and a benchmark showing what the alternatives lose when they do.
Writes are serialised by SQLite, not by luck. Observations are mirrored into [graphify](https://github.com/Graphify-Labs/graphify) memory docs, so `graphify --update` and `graphify reflect` read them with no changes on their side.
The measurement
Twenty writes issued at once. `kept` is how many survived; every store reported success for all twenty, and none raised.
| case | @modelcontextprotocol/server-memory |
graphify memory docs | this repo |
|---|---|---|---|
| 20 writes, strictly one at a time | 20 / 20 | — | 20 / 20 |
| 20 distinct writes at once | 1 / 20 | 20 / 20 | 20 / 20 |
| same question, same instant | 1 / 20 | 1 / 20 | 20 / 20 |
| questions sharing a 50-char prefix | — | 1 / 20 | 20 / 20 |
| error responses / raised exceptions | 0 | 0 | 0 |
Reproduce it yourself — see [`bench/`](bench/).
Why each number comes out that way
**server-memory** (v2026.8.31) loses almost everything the moment writes overlap. Every mutation is a whole-graph read-modify-write:
async createEntities(entities) {
const graph = await this.loadGraph(); // read the entire file
graph.entities.push(...newEntities);
await this.saveGraph(graph); // write the entire file back
}
There is no lock anywhere in the file. The write itself is atomic — a temp file plus `rename(2)`, and the source says so — but atomicity is not isolation. Two overlapping calls both load the same graph and the second one's save erases the first one's work. Nothing errors, because from each caller's side nothing went wrong. It is also stdio-only, so "just run one shared process" is not available as a workaround, and even a single agent issuing two tool calls concurrently hits it.
This is a reference implementation of the protocol. Read it as one.
**graphify** does much better, by construction: one markdo
Related Skills
MCP Agent Mail Rust
Rust MCP server for multi-agent coordination: 34 tools, Git-backed archive, SQLite indexing, advisory file loc
MCP Memory Service
GitHub Repo stars MCP server providing semantic memory and persistent storage for Claude Memory service MCP
Claude Code Multimodel Workflow
v2: server-enforced merge gates for repos shared by humans and coding agents — merge-gate suite attestation, b
Bm
Ask basemind anything about the current codebase — outlines, refs, callers, git history, blame, diffs, docs, m
Claude Code Statusline
by rz1989s - Enhanced 4-line statusline for Claude Code with themes, cost tracking, and MCP server monitoring.
Rabbithole
An infinite canvas for learning — select text, ask, and answers branch out as documents. MCP server for Claude
Related Agents
Noor
Engine engineer. Owns the main process: sessions on the Claude Agent SDK, hooks, approvals, git worktrees, scr
Git Pull
Safely pull updates (fork/upstream aware), stash-first, resolve conflicts via memory-bank context, no auto-sta
Kb Tool Researcher
Research ONE peer tool against this repo's graph and its pinned source, and write a gap analysis in both direc