Show HN: Persistent Memory for Claude Code (MCP)(github.com)

Show HN: Persistent Memory for Claude Code (MCP)

https://github.com/DiaaAj/a-mem-mcp

This is my attempt in building a memory that evolves and persist for claude code.

My approach is inspired from Zettelkasten method, memories are atomic, connected and dynamic. Existing memories can evolve based on newer memories. In the background it uses LLM to handle linking and evolution.

I have only used it with claude code so far, it works well with me but still early stage, so rough edges likely. I'm planning to extend it to other coding agents as I use several different agents during development.

Looking for feedbacks!

2 コメント

yodon6 か月前

Sounds similar to steve yegge's beads[0]

0: https://github.com/steveyegge/beads

AttentionBlock6 か月前

Thanks for the pointer! But it seems to me beads is a different tool? Beads is a task tracker for multi-agent system, A-MEM is agentic memory for accumulated knowledge.