evanmschultz/memcp
If you are the rightful owner of memcp and would like to certify it and/or have it hosted online, please leave a comment on the right or send an email to henry@mcphub.com.
MemCP is an extensible memory MCP server for AI coding agents, designed to build, maintain, and query a temporal knowledge graph of facts, entities, and relationships.
MemCP is a modular and extensible memory context protocol server designed for AI coding agents. It builds upon the Zep AI Graphiti MCP server, allowing AI agents to construct and query a temporal knowledge graph that evolves with new information. MemCP is designed to be a plug-and-play memory server compatible with any IDE or LLM client app that supports MCPs through local SSE or stdio connections. It has been primarily tested with the Cursor IDE. MemCP offers features such as automatic entity extraction, flexible configuration, and persistence through Neo4j, making it a robust solution for AI agents requiring dynamic memory capabilities.
Features
- Temporal Knowledge Graph: Allows AI agents to automatically build and query a temporal knowledge graph that evolves as new information is added.
- MCP Integration: Compatible with any MCP-compatible clients.
- Entity Extraction: Automatic entity and relationship extraction with coding-specific entity types.
- Flexible Configuration: Simple configuration via environment variables, TOML files, or CLI arguments.
- Persistence: Stores knowledge in Neo4j for persistence across sessions.
Usages
usage with Cursor IDE
{
"mcpServers": {
"MemCP": {
"transport": "sse",
"url": "http://localhost:8000/sse"
}
}
}Tools
add_episode
Add an episode to the knowledge graph (text, JSON, messages).
search_nodes
Search for entity nodes in the graph.
search_facts
Search for relationships between entities.
delete_entity_edge
Delete a relationship between entities.
delete_episode
Delete an episode from the knowledge graph.
get_entity_edge
Get details about a specific relationship.
get_episodes
Retrieve recent episodes.
clear_graph
Reset the knowledge graph (use with caution).
