Home Projects MegaMemory
MegaMemory

MegaMemory

by 0xK3vin · GitHub

Persistent project knowledge graph for coding agents. MCP server with semantic search, in-process embeddings, and web explorer.

View on GitHub
⭐ Stars
🍴 Forks
🔥 Trending
📜 License
Commercial use OK
📅 Created
🔄 Last commit
🏷️ Category
💻 Language
You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
MegaMemory — GitHub preview card
📈 Star history
309302
2026-07-242026-07-29
📈 Track MegaMemory

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Persistent project knowledge graph for coding agents. MCP server with semantic search, in-process embeddings, and web explorer.

MegaMemory has 309 stars on GitHub. It has been forked 32 times. MegaMemory is written mainly in TypeScript. It has been in active development since 2026. MegaMemory is available under the MIT license. Its main topics are agentic-coding, ai, ai-agents, claude-code.

Frequently asked questions

What is MegaMemory?

Persistent project knowledge graph for coding agents. MCP server with semantic search, in-process embeddings, and web explorer.

Is MegaMemory open source?

MegaMemory is an open-source project. It is released under the MIT license.

Is MegaMemory free?

Yes. MegaMemory is free and open source — you can use, modify and self-host it.

What license does MegaMemory use?

MegaMemory is available under the MIT license.

What language is MegaMemory written in?

MegaMemory is written mainly in TypeScript.

🏅 Maintainer of this project?
olud.ai badge — MegaMemory

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=0xk3vin-megamemory)](https://olud.ai/project/0xk3vin-megamemory.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.