An improved implementation of persistent memory using a local knowledge graph with a customizable --memory-path. This lets Claude remember information about the user across chats.
Create multiple new entities in the knowledge graph. Input: entities (array of objects) - Each object contains: name (string), entityType (string), observations (string[]). Ignores entities with existing names.
Create multiple new relations between entities. Input: relations (array of objects) - Each object contains: from (string), to (string), relationType (string). Skips duplicate relations.
Add new observations to existing entities. Input: observations (array of objects) - Each object contains: entityName (string), contents (string[]). Returns added observations per entity. Fails if entity doesn't exist.
Remove entities and their relations. Input: entityNames (string[]). Cascading deletion of associated relations. Silent operation if entity doesn't exist.
Remove specific observations from entities. Input: deletions (array of objects) - Each object contains: entityName (string), observations (string[]). Silent operation if observation doesn't exist.
Remove specific relations from the graph. Input: relations (array of objects) - Each object contains: from (string), to (string), relationType (string). Silent operation if relation doesn't exist.
Read the entire knowledge graph. No input required. Returns complete graph structure with all entities and relations.
Search for nodes based on query. Input: query (string). Searches across entity names, entity types, observation content. Returns matching entities and their relations.
Retrieve specific nodes by name. Input: names (string[]). Returns requested entities and relations between requested entities. Silently skips non-existent nodes.
No reviews yet. Be the first to review!
Sign in to join the conversation
Highlight AIAfter downloading, you can run the MCP server in any client or IDE:
node path/to/downloaded/file.mjs