@levalicious/server-memory 0.0.8 → 0.0.10

package/README.md

@@ -8,33 +8,37 @@ A basic implementation of persistent memory using a local knowledge graph. This
 Entities are the primary nodes in the knowledge graph. Each entity has:
 - A unique name (identifier)
 - An entity type (e.g., "person", "organization", "event")
-- A list of observations
+- A list of observations (max 2, each max 140 characters)
+- Modification timestamps (`mtime` for any change, `obsMtime` for observation changes)
 
 Example:
 ```json
 {
   "name": "John_Smith",
   "entityType": "person",
-  "observations": ["Speaks fluent Spanish"]
+  "observations": ["Speaks fluent Spanish"],
+  "mtime": 1733423456789,
+  "obsMtime": 1733423456789
 }
 ```
 
 ### Relations
-Relations define directed connections between entities. They are always stored in active voice and describe how entities interact or relate to each other.
+Relations define directed connections between entities. They are always stored in active voice and describe how entities interact or relate to each other. Each relation has a modification timestamp (`mtime`).
 
 Example:
 ```json
 {
   "from": "John_Smith",
   "to": "Anthropic",
-  "relationType": "works_at"
+  "relationType": "works_at",
+  "mtime": 1733423456789
 }
 ```
 ### Observations
 Observations are discrete pieces of information about an entity. They are:
 
-- Stored as strings
-- Attached to specific entities
+- Stored as strings (max 140 characters each)
+- Attached to specific entities (max 2 per entity)
 - Can be added or removed independently
 - Should be atomic (one fact per observation)
 
@@ -44,8 +48,7 @@ Example:
   "entityName": "John_Smith",
   "observations": [
     "Speaks fluent Spanish",
-    "Graduated in 2019",
-    "Prefers morning meetings"
+    "Graduated in 2019"
   ]
 }
 ```
@@ -59,7 +62,7 @@ Example:
     - Each object contains:
       - `name` (string): Entity identifier
       - `entityType` (string): Type classification
-      - `observations` (string[]): Associated observations
+      - `observations` (string[]): Associated observations (max 2, each max 140 chars)
   - Ignores entities with existing names
 
 - **create_relations**
@@ -76,9 +79,9 @@ Example:
   - Input: `observations` (array of objects)
     - Each object contains:
       - `entityName` (string): Target entity
-      - `contents` (string[]): New observations to add
+      - `contents` (string[]): New observations to add (each max 140 chars)
   - Returns added observations per entity
-  - Fails if entity doesn't exist
+  - Fails if entity doesn't exist or would exceed 2 observations
 
 - **delete_entities**
   - Remove entities and their relations
@@ -103,42 +106,45 @@ Example:
       - `relationType` (string): Relationship type
   - Silent operation if relation doesn't exist
 
-- **read_graph**
-  - Read the entire knowledge graph
-  - No input required
-  - Returns complete graph structure with all entities and relations
-
 - **search_nodes**
-  - Search for nodes based on query
-  - Input: `query` (string)
+  - Search for nodes using a regex pattern
+  - Input: `query` (string), `entityCursor` (number, optional), `relationCursor` (number, optional)
   - Searches across:
     - Entity names
     - Entity types
     - Observation content
-  - Returns matching entities and their relations
+  - Returns matching entities and their relations (paginated)
+
+- **open_nodes_filtered**
+  - Retrieve specific nodes by name with filtered relations
+  - Input: `names` (string[]), `entityCursor` (number, optional), `relationCursor` (number, optional)
+  - Returns:
+    - Requested entities
+    - Only relations where both endpoints are in the requested set
+  - Silently skips non-existent nodes (paginated)
 
 - **open_nodes**
   - Retrieve specific nodes by name
-  - Input: `names` (string[])
+  - Input: `names` (string[]), `entityCursor` (number, optional), `relationCursor` (number, optional)
   - Returns:
     - Requested entities
-    - Relations between requested entities
-  - Silently skips non-existent nodes
+    - Relations originating from requested entities
+  - Silently skips non-existent nodes (paginated)
 
 - **get_neighbors**
   - Get neighboring entities connected to a specific entity within a given depth
-  - Input: `entityName` (string), `depth` (number, default: 1)
-  - Returns entities connected within specified depth
+  - Input: `entityName` (string), `depth` (number, default: 0), `withEntities` (boolean, default: false), `entityCursor` (number, optional), `relationCursor` (number, optional)
+  - Returns relations (and optionally entities) connected within specified depth (paginated)
 
 - **find_path**
   - Find a path between two entities in the knowledge graph
-  - Input: `fromEntity` (string), `toEntity` (string), `maxDepth` (number, default: 5)
-  - Returns path between entities if one exists
+  - Input: `fromEntity` (string), `toEntity` (string), `maxDepth` (number, default: 5), `cursor` (number, optional)
+  - Returns path between entities if one exists (paginated)
 
 - **get_entities_by_type**
   - Get all entities of a specific type
-  - Input: `entityType` (string)
-  - Returns all entities matching the specified type
+  - Input: `entityType` (string), `cursor` (number, optional)
+  - Returns all entities matching the specified type (paginated)
 
 - **get_entity_types**
   - Get all unique entity types in the knowledge graph
@@ -156,14 +162,15 @@ Example:
   - Returns entity count, relation count, entity types count, relation types count
 
 - **get_orphaned_entities**
-  - Get entities that have no relations
-  - No input required
-  - Returns entities with no connections
+  - Get entities that have no relations (orphaned entities)
+  - Input: `strict` (boolean, default: false), `cursor` (number, optional)
+  - In strict mode, returns entities not connected to 'Self' entity (directly or indirectly)
+  - Returns entities with no connections (paginated)
 
 - **validate_graph**
-  - Validate the knowledge graph and return missing entities referenced in relations
+  - Validate the knowledge graph
   - No input required
-  - Returns list of missing entities
+  - Returns missing entities referenced in relations and observation limit violations
 
 - **evaluate_bcl**
   - Evaluate a Binary Combinatory Logic (BCL) program
@@ -182,6 +189,12 @@ Example:
   - No input required
   - Resets BCL constructor
 
+- **sequentialthinking**
+  - Record a thought in the knowledge graph
+  - Input: `observations` (string[], max 2, each max 140 chars), `previousCtxId` (string, optional)
+  - Creates a Thought entity and links it to the previous thought if provided
+  - Returns the new thought's context ID for chaining
+
 # Usage with Claude Desktop
 
 ### Setup

package/dist/server.js

@@ -2,6 +2,7 @@
 import { Server } from "@modelcontextprotocol/sdk/server/index.js";
 import { CallToolRequestSchema, ListToolsRequestSchema, } from "@modelcontextprotocol/sdk/types.js";
 import { promises as fs } from 'fs';
+import { randomBytes } from 'crypto';
 import path from 'path';
 import { fileURLToPath } from 'url';
 import lockfile from 'proper-lockfile';
@@ -13,6 +14,44 @@ const DEFAULT_MEMORY_FILE_PATH = process.env.MEMORY_FILE_PATH
         ? process.env.MEMORY_FILE_PATH
         : path.join(path.dirname(fileURLToPath(import.meta.url)), process.env.MEMORY_FILE_PATH)
     : defaultMemoryPath;
+/**
+ * Sort entities by the specified field and direction.
+ * Returns a new array (does not mutate input).
+ * If sortBy is undefined, returns the original array (no sorting - preserves insertion order).
+ */
+function sortEntities(entities, sortBy, sortDir) {
+    if (!sortBy)
+        return entities; // No sorting - preserve current behavior
+    const dir = sortDir ?? (sortBy === "name" ? "asc" : "desc");
+    const mult = dir === "asc" ? 1 : -1;
+    return [...entities].sort((a, b) => {
+        if (sortBy === "name") {
+            return mult * a.name.localeCompare(b.name);
+        }
+        // For timestamps, treat undefined as 0 (oldest)
+        const aVal = a[sortBy] ?? 0;
+        const bVal = b[sortBy] ?? 0;
+        return mult * (aVal - bVal);
+    });
+}
+/**
+ * Sort neighbors by the specified field and direction.
+ * If sortBy is undefined, returns the original array (no sorting).
+ */
+function sortNeighbors(neighbors, sortBy, sortDir) {
+    if (!sortBy)
+        return neighbors;
+    const dir = sortDir ?? (sortBy === "name" ? "asc" : "desc");
+    const mult = dir === "asc" ? 1 : -1;
+    return [...neighbors].sort((a, b) => {
+        if (sortBy === "name") {
+            return mult * a.name.localeCompare(b.name);
+        }
+        const aVal = a[sortBy] ?? 0;
+        const bVal = b[sortBy] ?? 0;
+        return mult * (aVal - bVal);
+    });
+}
 export const MAX_CHARS = 2048;
 function paginateItems(items, cursor = 0, maxChars = MAX_CHARS) {
     const result = [];
@@ -253,7 +292,7 @@ export class KnowledgeGraphManager {
         });
     }
     // Regex-based search function
-    async searchNodes(query) {
+    async searchNodes(query, sortBy, sortDir) {
         const graph = await this.loadGraph();
         let regex;
         try {
@@ -271,7 +310,7 @@ export class KnowledgeGraphManager {
         // Filter relations to only include those between filtered entities
         const filteredRelations = graph.relations.filter(r => filteredEntityNames.has(r.from) && filteredEntityNames.has(r.to));
         const filteredGraph = {
-            entities: filteredEntities,
+            entities: sortEntities(filteredEntities, sortBy, sortDir),
             relations: filteredRelations,
         };
         return filteredGraph;
@@ -304,25 +343,21 @@ export class KnowledgeGraphManager {
         };
         return filteredGraph;
     }
-    async getNeighbors(entityName, depth = 1, withEntities = false) {
+    async getNeighbors(entityName, depth = 1, sortBy, sortDir) {
         const graph = await this.loadGraph();
         const visited = new Set();
-        const resultEntities = new Map();
-        const resultRelations = new Map(); // Deduplicate relations
-        const relationKey = (r) => `${r.from}|${r.relationType}|${r.to}`;
+        const neighborNames = new Set();
         const traverse = (currentName, currentDepth) => {
             if (currentDepth > depth || visited.has(currentName))
                 return;
             visited.add(currentName);
-            if (withEntities) {
-                const entity = graph.entities.find(e => e.name === currentName);
-                if (entity) {
-                    resultEntities.set(currentName, entity);
-                }
-            }
             // Find all relations involving this entity
             const connectedRelations = graph.relations.filter(r => r.from === currentName || r.to === currentName);
-            connectedRelations.forEach(r => resultRelations.set(relationKey(r), r));
+            // Collect neighbor names
+            connectedRelations.forEach(r => {
+                const neighborName = r.from === currentName ? r.to : r.from;
+                neighborNames.add(neighborName);
+            });
             if (currentDepth < depth) {
                 // Traverse to connected entities
                 connectedRelations.forEach(r => {
@@ -332,10 +367,19 @@ export class KnowledgeGraphManager {
             }
         };
         traverse(entityName, 0);
-        return {
-            entities: Array.from(resultEntities.values()),
-            relations: Array.from(resultRelations.values())
-        };
+        // Remove the starting entity from neighbors (it's not its own neighbor)
+        neighborNames.delete(entityName);
+        // Build neighbor objects with timestamps
+        const entityMap = new Map(graph.entities.map(e => [e.name, e]));
+        const neighbors = Array.from(neighborNames).map(name => {
+            const entity = entityMap.get(name);
+            return {
+                name,
+                mtime: entity?.mtime,
+                obsMtime: entity?.obsMtime,
+            };
+        });
+        return sortNeighbors(neighbors, sortBy, sortDir);
     }
     async findPath(fromEntity, toEntity, maxDepth = 5) {
         const graph = await this.loadGraph();
@@ -357,9 +401,10 @@ export class KnowledgeGraphManager {
         };
         return dfs(fromEntity, toEntity, [], 0) || [];
     }
-    async getEntitiesByType(entityType) {
+    async getEntitiesByType(entityType, sortBy, sortDir) {
         const graph = await this.loadGraph();
-        return graph.entities.filter(e => e.entityType === entityType);
+        const filtered = graph.entities.filter(e => e.entityType === entityType);
+        return sortEntities(filtered, sortBy, sortDir);
     }
     async getEntityTypes() {
         const graph = await this.loadGraph();
@@ -382,14 +427,46 @@ export class KnowledgeGraphManager {
             relationTypes: relationTypes.size
         };
     }
-    async getOrphanedEntities() {
+    async getOrphanedEntities(strict = false, sortBy, sortDir) {
         const graph = await this.loadGraph();
-        const connectedEntityNames = new Set();
+        if (!strict) {
+            // Simple mode: entities with no relations at all
+            const connectedEntityNames = new Set();
+            graph.relations.forEach(r => {
+                connectedEntityNames.add(r.from);
+                connectedEntityNames.add(r.to);
+            });
+            const orphans = graph.entities.filter(e => !connectedEntityNames.has(e.name));
+            return sortEntities(orphans, sortBy, sortDir);
+        }
+        // Strict mode: entities not connected to "Self" (directly or indirectly)
+        // Build adjacency list (bidirectional)
+        const neighbors = new Map();
+        graph.entities.forEach(e => neighbors.set(e.name, new Set()));
         graph.relations.forEach(r => {
-            connectedEntityNames.add(r.from);
-            connectedEntityNames.add(r.to);
+            neighbors.get(r.from)?.add(r.to);
+            neighbors.get(r.to)?.add(r.from);
         });
-        return graph.entities.filter(e => !connectedEntityNames.has(e.name));
+        // BFS from Self to find all connected entities
+        const connectedToSelf = new Set();
+        const queue = ['Self'];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (connectedToSelf.has(current))
+                continue;
+            connectedToSelf.add(current);
+            const currentNeighbors = neighbors.get(current);
+            if (currentNeighbors) {
+                for (const neighbor of currentNeighbors) {
+                    if (!connectedToSelf.has(neighbor)) {
+                        queue.push(neighbor);
+                    }
+                }
+            }
+        }
+        // Return entities not connected to Self (excluding Self itself if it exists)
+        const orphans = graph.entities.filter(e => !connectedToSelf.has(e.name));
+        return sortEntities(orphans, sortBy, sortDir);
     }
     async validateGraph() {
         const graph = await this.loadGraph();
@@ -596,9 +673,9 @@ export class KnowledgeGraphManager {
                     throw new Error(`Observation exceeds 140 characters (${obs.length} chars): "${obs.substring(0, 50)}..."`);
                 }
             }
-            // Generate new context ID
+            // Generate new context ID (24-char hex)
             const now = Date.now();
-            const ctxId = `thought_${now}_${Math.random().toString(36).substring(2, 8)}`;
+            const ctxId = randomBytes(12).toString('hex');
             // Create thought entity
             const thoughtEntity = {
                 name: ctxId,
@@ -637,7 +714,7 @@ export function createServer(memoryFilePath) {
                 sizes: ["any"]
             }
         ],
-        version: "0.0.4",
+        version: "0.0.10",
     }, {
         capabilities: {
             tools: {},
@@ -790,6 +867,8 @@ export function createServer(memoryFilePath) {
                         type: "object",
                         properties: {
                             query: { type: "string", description: "Regex pattern to match against entity names, types, and observations." },
+                            sortBy: { type: "string", enum: ["mtime", "obsMtime", "name"], description: "Sort field for entities. Omit for insertion order." },
+                            sortDir: { type: "string", enum: ["asc", "desc"], description: "Sort direction. Default: desc for timestamps, asc for name." },
                             entityCursor: { type: "number", description: "Cursor for entity pagination (from previous response's nextCursor)" },
                             relationCursor: { type: "number", description: "Cursor for relation pagination" },
                         },
@@ -832,15 +911,15 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "get_neighbors",
-                    description: "Get neighboring entities connected to a specific entity within a given depth. Results are paginated (max 512 chars).",
+                    description: "Get names of neighboring entities connected to a specific entity within a given depth. Returns neighbor names with timestamps for sorting. Use open_nodes to get full entity data. Results are paginated (max 512 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
                             entityName: { type: "string", description: "The name of the entity to find neighbors for" },
-                            depth: { type: "number", description: "Maximum depth to traverse (default: 0)", default: 0 },
-                            withEntities: { type: "boolean", description: "If true, include full entity data. Default returns only relations for lightweight structure exploration.", default: false },
-                            entityCursor: { type: "number", description: "Cursor for entity pagination" },
-                            relationCursor: { type: "number", description: "Cursor for relation pagination" },
+                            depth: { type: "number", description: "Maximum depth to traverse (default: 1)", default: 1 },
+                            sortBy: { type: "string", enum: ["mtime", "obsMtime", "name"], description: "Sort field for neighbors. Omit for arbitrary order." },
+                            sortDir: { type: "string", enum: ["asc", "desc"], description: "Sort direction. Default: desc for timestamps, asc for name." },
+                            cursor: { type: "number", description: "Cursor for pagination" },
                         },
                         required: ["entityName"],
                     },
@@ -866,6 +945,8 @@ export function createServer(memoryFilePath) {
                         type: "object",
                         properties: {
                             entityType: { type: "string", description: "The type of entities to retrieve" },
+                            sortBy: { type: "string", enum: ["mtime", "obsMtime", "name"], description: "Sort field for entities. Omit for insertion order." },
+                            sortDir: { type: "string", enum: ["asc", "desc"], description: "Sort direction. Default: desc for timestamps, asc for name." },
                             cursor: { type: "number", description: "Cursor for pagination" },
                         },
                         required: ["entityType"],
@@ -897,10 +978,13 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "get_orphaned_entities",
-                    description: "Get entities that have no relations (orphaned entities). Results are paginated (max 512 chars).",
+                    description: "Get entities that have no relations (orphaned entities). In strict mode, returns entities not connected to 'Self' entity. Results are paginated (max 512 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
+                            strict: { type: "boolean", description: "If true, returns entities not connected to 'Self' (directly or indirectly). Default: false" },
+                            sortBy: { type: "string", enum: ["mtime", "obsMtime", "name"], description: "Sort field for entities. Omit for insertion order." },
+                            sortDir: { type: "string", enum: ["asc", "desc"], description: "Sort direction. Default: desc for timestamps, asc for name." },
                             cursor: { type: "number", description: "Cursor for pagination" },
                         },
                     },
@@ -994,7 +1078,7 @@ Use this to build chains of reasoning that persist in the graph. Each thought ca
                 await knowledgeGraphManager.deleteRelations(args.relations);
                 return { content: [{ type: "text", text: "Relations deleted successfully" }] };
             case "search_nodes": {
-                const graph = await knowledgeGraphManager.searchNodes(args.query);
+                const graph = await knowledgeGraphManager.searchNodes(args.query, args.sortBy, args.sortDir);
                 return { content: [{ type: "text", text: JSON.stringify(paginateGraph(graph, args.entityCursor ?? 0, args.relationCursor ?? 0)) }] };
             }
             case "open_nodes_filtered": {
@@ -1006,15 +1090,15 @@ Use this to build chains of reasoning that persist in the graph. Each thought ca
                 return { content: [{ type: "text", text: JSON.stringify(paginateGraph(graph, args.entityCursor ?? 0, args.relationCursor ?? 0)) }] };
             }
             case "get_neighbors": {
-                const graph = await knowledgeGraphManager.getNeighbors(args.entityName, args.depth, args.withEntities);
-                return { content: [{ type: "text", text: JSON.stringify(paginateGraph(graph, args.entityCursor ?? 0, args.relationCursor ?? 0)) }] };
+                const neighbors = await knowledgeGraphManager.getNeighbors(args.entityName, args.depth ?? 1, args.sortBy, args.sortDir);
+                return { content: [{ type: "text", text: JSON.stringify(paginateItems(neighbors, args.cursor ?? 0)) }] };
             }
             case "find_path": {
                 const path = await knowledgeGraphManager.findPath(args.fromEntity, args.toEntity, args.maxDepth);
                 return { content: [{ type: "text", text: JSON.stringify(paginateItems(path, args.cursor ?? 0)) }] };
             }
             case "get_entities_by_type": {
-                const entities = await knowledgeGraphManager.getEntitiesByType(args.entityType);
+                const entities = await knowledgeGraphManager.getEntitiesByType(args.entityType, args.sortBy, args.sortDir);
                 return { content: [{ type: "text", text: JSON.stringify(paginateItems(entities, args.cursor ?? 0)) }] };
             }
             case "get_entity_types":
@@ -1024,7 +1108,7 @@ Use this to build chains of reasoning that persist in the graph. Each thought ca
             case "get_stats":
                 return { content: [{ type: "text", text: JSON.stringify(await knowledgeGraphManager.getStats(), null, 2) }] };
             case "get_orphaned_entities": {
-                const entities = await knowledgeGraphManager.getOrphanedEntities();
+                const entities = await knowledgeGraphManager.getOrphanedEntities(args.strict ?? false, args.sortBy, args.sortDir);
                 return { content: [{ type: "text", text: JSON.stringify(paginateItems(entities, args.cursor ?? 0)) }] };
             }
             case "validate_graph":

package/dist/tests/memory-server.test.js

@@ -283,64 +283,43 @@ describe('MCP Memory Server E2E Tests', () => {
                 ]
             });
         });
-        it('should get neighbors at depth 0 (relations only by default)', async () => {
+        it('should get immediate neighbors at depth 0', async () => {
             const result = await callTool(client, 'get_neighbors', {
                 entityName: 'Root',
                 depth: 0
             });
-            expect(result.entities.items).toHaveLength(0); // withEntities defaults to false
-            expect(result.relations.items).toHaveLength(2); // Root's direct relations
+            // depth 0 returns immediate neighbors only
+            expect(result.items).toHaveLength(2);
+            const names = result.items.map(n => n.name);
+            expect(names).toContain('Child1');
+            expect(names).toContain('Child2');
         });
-        it('should get neighbors with entities when requested', async () => {
-            // Accumulate all entities across pagination
-            const allEntities = [];
-            let entityCursor = 0;
-            while (entityCursor !== null) {
-                const result = await callTool(client, 'get_neighbors', {
-                    entityName: 'Root',
-                    depth: 1,
-                    withEntities: true,
-                    entityCursor
-                });
-                allEntities.push(...result.entities.items);
-                entityCursor = result.entities.nextCursor;
-            }
-            expect(allEntities).toHaveLength(3);
-            expect(allEntities.map(e => e.name)).toContain('Root');
-            expect(allEntities.map(e => e.name)).toContain('Child1');
-            expect(allEntities.map(e => e.name)).toContain('Child2');
+        it('should get neighbors at depth 1 (includes neighbors of neighbors)', async () => {
+            const result = await callTool(client, 'get_neighbors', {
+                entityName: 'Root',
+                depth: 1
+            });
+            // depth 1: Child1, Child2 (immediate) + Grandchild (neighbor of Child1)
+            expect(result.items).toHaveLength(3);
+            const names = result.items.map(n => n.name);
+            expect(names).toContain('Child1');
+            expect(names).toContain('Child2');
+            expect(names).toContain('Grandchild');
         });
         it('should traverse to specified depth', async () => {
-            // Collect all entities and relations using pagination
-            const allEntities = [];
-            const allRelations = [];
-            let entityCursor = 0;
-            let relationCursor = 0;
-            // Paginate through all results
-            while (entityCursor !== null || relationCursor !== null) {
-                const result = await callTool(client, 'get_neighbors', {
-                    entityName: 'Root',
-                    depth: 2,
-                    withEntities: true,
-                    // Pass large cursor to skip when done, 0 to fetch
-                    entityCursor: entityCursor !== null ? entityCursor : 999999,
-                    relationCursor: relationCursor !== null ? relationCursor : 999999
-                });
-                // Collect entities if we still need them
-                if (entityCursor !== null) {
-                    allEntities.push(...result.entities.items);
-                    entityCursor = result.entities.nextCursor;
-                }
-                // Collect relations if we still need them
-                if (relationCursor !== null) {
-                    allRelations.push(...result.relations.items);
-                    relationCursor = result.relations.nextCursor;
-                }
-            }
-            expect(allEntities).toHaveLength(4); // All nodes
-            expect(allRelations).toHaveLength(3); // All relations
+            const result = await callTool(client, 'get_neighbors', {
+                entityName: 'Root',
+                depth: 2
+            });
+            // At depth 2 from Root: same as depth 1 since graph is small
+            // Child1, Child2, Grandchild (Root is excluded as starting point)
+            expect(result.items).toHaveLength(3);
+            const names = result.items.map(n => n.name);
+            expect(names).toContain('Child1');
+            expect(names).toContain('Child2');
+            expect(names).toContain('Grandchild');
         });
-        it('should deduplicate relations in traversal', async () => {
+        it('should deduplicate neighbors in traversal', async () => {
             // Add a bidirectional relation
             await callTool(client, 'create_relations', {
                 relations: [{ from: 'Child2', to: 'Root', relationType: 'child_of' }]
@@ -349,10 +328,10 @@ describe('MCP Memory Server E2E Tests', () => {
                 entityName: 'Root',
                 depth: 1
             });
-            // Each unique relation should appear only once
-            const relationKeys = result.relations.items.map(r => `${r.from}|${r.relationType}|${r.to}`);
-            const uniqueKeys = [...new Set(relationKeys)];
-            expect(relationKeys.length).toBe(uniqueKeys.length);
+            // Each neighbor should appear only once
+            const names = result.items.map(n => n.name);
+            const uniqueNames = [...new Set(names)];
+            expect(names.length).toBe(uniqueNames.length);
         });
         it('should find path between entities', async () => {
             const result = await callTool(client, 'find_path', {
@@ -441,6 +420,32 @@ describe('MCP Memory Server E2E Tests', () => {
             expect(result.items).toHaveLength(1);
             expect(result.items[0].name).toBe('Orphan');
         });
+        it('should find entities not connected to Self in strict mode', async () => {
+            await callTool(client, 'create_entities', {
+                entities: [
+                    { name: 'Self', entityType: 'Agent', observations: [] },
+                    { name: 'ConnectedToSelf', entityType: 'Node', observations: [] },
+                    { name: 'IndirectlyConnected', entityType: 'Node', observations: [] },
+                    { name: 'Island1', entityType: 'Node', observations: [] },
+                    { name: 'Island2', entityType: 'Node', observations: [] }
+                ]
+            });
+            await callTool(client, 'create_relations', {
+                relations: [
+                    { from: 'Self', to: 'ConnectedToSelf', relationType: 'knows' },
+                    { from: 'ConnectedToSelf', to: 'IndirectlyConnected', relationType: 'links' },
+                    { from: 'Island1', to: 'Island2', relationType: 'links' } // Connected to each other but not to Self
+                ]
+            });
+            // Non-strict: Island1 and Island2 are connected, so not orphaned
+            const nonStrict = await callTool(client, 'get_orphaned_entities', {});
+            expect(nonStrict.items).toHaveLength(0);
+            // Strict: Island1 and Island2 are not connected to Self
+            const strict = await callTool(client, 'get_orphaned_entities', { strict: true });
+            expect(strict.items).toHaveLength(2);
+            const names = strict.items.map(e => e.name).sort();
+            expect(names).toEqual(['Island1', 'Island2']);
+        });
         it('should validate graph and report violations', async () => {
             // Directly write invalid data to test validation
             const invalidData = [
@@ -486,7 +491,7 @@ describe('MCP Memory Server E2E Tests', () => {
             const result = await callTool(client, 'sequentialthinking', {
                 observations: ['First thought observation']
             });
-            expect(result.ctxId).toMatch(/^thought_\d+_[a-z0-9]+$/);
+            expect(result.ctxId).toMatch(/^[0-9a-f]{24}$/);
         });
         it('should chain thoughts with relations', async () => {
             // Create first thought
@@ -498,26 +503,26 @@ describe('MCP Memory Server E2E Tests', () => {
                 previousCtxId: first.ctxId,
                 observations: ['Following up']
             });
-            // Verify the chain via relations
+            // Verify the chain via neighbors
             const neighbors = await callTool(client, 'get_neighbors', {
                 entityName: first.ctxId,
                 depth: 1
             });
-            // Should have 'follows' relation from first to second
-            expect(neighbors.relations.items.some(r => r.from === first.ctxId && r.to === second.ctxId && r.relationType === 'follows')).toBe(true);
+            // Second thought should be a neighbor of first
+            expect(neighbors.items.some(n => n.name === second.ctxId)).toBe(true);
         });
         it('should ignore invalid previousCtxId gracefully', async () => {
             const result = await callTool(client, 'sequentialthinking', {
                 previousCtxId: 'nonexistent_thought',
                 observations: ['Orphaned thought']
             });
-            expect(result.ctxId).toMatch(/^thought_\d+_[a-z0-9]+$/);
-            // Verify no relations were created
+            expect(result.ctxId).toMatch(/^[0-9a-f]{24}$/);
+            // Verify no neighbors (no valid relations were created)
             const neighbors = await callTool(client, 'get_neighbors', {
                 entityName: result.ctxId,
                 depth: 1
             });
-            expect(neighbors.relations.totalCount).toBe(0);
+            expect(neighbors.items).toHaveLength(0);
         });
         it('should enforce observation limits on thoughts', async () => {
             await expect(callTool(client, 'sequentialthinking', {
@@ -536,4 +541,318 @@ describe('MCP Memory Server E2E Tests', () => {
             expect(thought.obsMtime).toBeDefined();
         });
     });
+    describe('Sorting', () => {
+        // Helper to create entities with controlled timestamps
+        async function createEntitiesWithDelay(entities) {
+            for (const entity of entities) {
+                await callTool(client, 'create_entities', { entities: [entity] });
+                // Small delay to ensure distinct mtime values
+                await new Promise(resolve => setTimeout(resolve, 10));
+            }
+        }
+        describe('search_nodes sorting', () => {
+            beforeEach(async () => {
+                // Create entities with distinct timestamps
+                await createEntitiesWithDelay([
+                    { name: 'Alpha', entityType: 'Letter', observations: ['First letter'] },
+                    { name: 'Beta', entityType: 'Letter', observations: ['Second letter'] },
+                    { name: 'Gamma', entityType: 'Letter', observations: ['Third letter'] }
+                ]);
+            });
+            it('should preserve insertion order when sortBy is omitted', async () => {
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter'
+                });
+                const names = result.entities.items.map(e => e.name);
+                expect(names).toEqual(['Alpha', 'Beta', 'Gamma']);
+            });
+            it('should sort by name ascending', async () => {
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter',
+                    sortBy: 'name',
+                    sortDir: 'asc'
+                });
+                const names = result.entities.items.map(e => e.name);
+                expect(names).toEqual(['Alpha', 'Beta', 'Gamma']);
+            });
+            it('should sort by name descending', async () => {
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter',
+                    sortBy: 'name',
+                    sortDir: 'desc'
+                });
+                const names = result.entities.items.map(e => e.name);
+                expect(names).toEqual(['Gamma', 'Beta', 'Alpha']);
+            });
+            it('should sort by mtime descending by default', async () => {
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter',
+                    sortBy: 'mtime'
+                });
+                const names = result.entities.items.map(e => e.name);
+                // Gamma was created last, so should be first when sorted desc
+                expect(names).toEqual(['Gamma', 'Beta', 'Alpha']);
+            });
+            it('should sort by mtime ascending when specified', async () => {
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter',
+                    sortBy: 'mtime',
+                    sortDir: 'asc'
+                });
+                const names = result.entities.items.map(e => e.name);
+                // Alpha was created first, so should be first when sorted asc
+                expect(names).toEqual(['Alpha', 'Beta', 'Gamma']);
+            });
+            it('should sort by obsMtime', async () => {
+                // Update observation on Alpha to make it have most recent obsMtime
+                await callTool(client, 'delete_observations', {
+                    deletions: [{ entityName: 'Alpha', observations: ['First letter'] }]
+                });
+                await callTool(client, 'add_observations', {
+                    observations: [{ entityName: 'Alpha', contents: ['Updated'] }]
+                });
+                const result = await callTool(client, 'search_nodes', {
+                    query: 'Letter|Updated',
+                    sortBy: 'obsMtime'
+                });
+                const names = result.entities.items.map(e => e.name);
+                // Alpha should be first because its obsMtime was just updated
+                expect(names[0]).toBe('Alpha');
+            });
+        });
+        describe('get_entities_by_type sorting', () => {
+            beforeEach(async () => {
+                await createEntitiesWithDelay([
+                    { name: 'Zebra', entityType: 'Animal', observations: ['Striped'] },
+                    { name: 'Aardvark', entityType: 'Animal', observations: ['Nocturnal'] },
+                    { name: 'Monkey', entityType: 'Animal', observations: ['Clever'] }
+                ]);
+            });
+            it('should preserve insertion order when sortBy is omitted', async () => {
+                const result = await callTool(client, 'get_entities_by_type', {
+                    entityType: 'Animal'
+                });
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Zebra', 'Aardvark', 'Monkey']);
+            });
+            it('should sort by name ascending (default for name)', async () => {
+                const result = await callTool(client, 'get_entities_by_type', {
+                    entityType: 'Animal',
+                    sortBy: 'name'
+                });
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Aardvark', 'Monkey', 'Zebra']);
+            });
+            it('should sort by name descending', async () => {
+                const result = await callTool(client, 'get_entities_by_type', {
+                    entityType: 'Animal',
+                    sortBy: 'name',
+                    sortDir: 'desc'
+                });
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Zebra', 'Monkey', 'Aardvark']);
+            });
+            it('should sort by mtime descending (default for mtime)', async () => {
+                const result = await callTool(client, 'get_entities_by_type', {
+                    entityType: 'Animal',
+                    sortBy: 'mtime'
+                });
+                const names = result.items.map(e => e.name);
+                // Monkey was created last
+                expect(names).toEqual(['Monkey', 'Aardvark', 'Zebra']);
+            });
+            it('should sort by mtime ascending', async () => {
+                const result = await callTool(client, 'get_entities_by_type', {
+                    entityType: 'Animal',
+                    sortBy: 'mtime',
+                    sortDir: 'asc'
+                });
+                const names = result.items.map(e => e.name);
+                // Zebra was created first
+                expect(names).toEqual(['Zebra', 'Aardvark', 'Monkey']);
+            });
+        });
+        describe('get_orphaned_entities sorting', () => {
+            beforeEach(async () => {
+                // Create orphaned entities (no relations)
+                await createEntitiesWithDelay([
+                    { name: 'Orphan_Z', entityType: 'Orphan', observations: ['Alone'] },
+                    { name: 'Orphan_A', entityType: 'Orphan', observations: ['Solo'] },
+                    { name: 'Orphan_M', entityType: 'Orphan', observations: ['Isolated'] }
+                ]);
+            });
+            it('should preserve insertion order when sortBy is omitted', async () => {
+                const result = await callTool(client, 'get_orphaned_entities', {});
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Orphan_Z', 'Orphan_A', 'Orphan_M']);
+            });
+            it('should sort by name ascending', async () => {
+                const result = await callTool(client, 'get_orphaned_entities', {
+                    sortBy: 'name'
+                });
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Orphan_A', 'Orphan_M', 'Orphan_Z']);
+            });
+            it('should sort by name descending', async () => {
+                const result = await callTool(client, 'get_orphaned_entities', {
+                    sortBy: 'name',
+                    sortDir: 'desc'
+                });
+                const names = result.items.map(e => e.name);
+                expect(names).toEqual(['Orphan_Z', 'Orphan_M', 'Orphan_A']);
+            });
+            it('should sort by mtime descending (default)', async () => {
+                const result = await callTool(client, 'get_orphaned_entities', {
+                    sortBy: 'mtime'
+                });
+                const names = result.items.map(e => e.name);
+                // Orphan_M was created last
+                expect(names).toEqual(['Orphan_M', 'Orphan_A', 'Orphan_Z']);
+            });
+            it('should work with strict mode and sorting', async () => {
+                // Create Self and connect one orphan to it
+                await callTool(client, 'create_entities', {
+                    entities: [{ name: 'Self', entityType: 'Agent', observations: [] }]
+                });
+                await callTool(client, 'create_relations', {
+                    relations: [{ from: 'Self', to: 'Orphan_A', relationType: 'knows' }]
+                });
+                const result = await callTool(client, 'get_orphaned_entities', {
+                    strict: true,
+                    sortBy: 'name'
+                });
+                const names = result.items.map(e => e.name);
+                // Orphan_A is now connected to Self, so only M and Z are orphaned
+                expect(names).toEqual(['Orphan_M', 'Orphan_Z']);
+            });
+        });
+        describe('get_neighbors sorting', () => {
+            beforeEach(async () => {
+                // Create a hub with neighbors created at different times
+                await callTool(client, 'create_entities', {
+                    entities: [{ name: 'Hub', entityType: 'Center', observations: [] }]
+                });
+                await createEntitiesWithDelay([
+                    { name: 'Neighbor_Z', entityType: 'Node', observations: ['First'] },
+                    { name: 'Neighbor_A', entityType: 'Node', observations: ['Second'] },
+                    { name: 'Neighbor_M', entityType: 'Node', observations: ['Third'] }
+                ]);
+                // Connect all to Hub
+                await callTool(client, 'create_relations', {
+                    relations: [
+                        { from: 'Hub', to: 'Neighbor_Z', relationType: 'connects' },
+                        { from: 'Hub', to: 'Neighbor_A', relationType: 'connects' },
+                        { from: 'Hub', to: 'Neighbor_M', relationType: 'connects' }
+                    ]
+                });
+            });
+            it('should return unsorted neighbors when sortBy is omitted', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub'
+                });
+                expect(result.items).toHaveLength(3);
+                // Just verify all neighbors are present
+                const names = result.items.map(n => n.name);
+                expect(names).toContain('Neighbor_Z');
+                expect(names).toContain('Neighbor_A');
+                expect(names).toContain('Neighbor_M');
+            });
+            it('should sort neighbors by name ascending', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'name'
+                });
+                const names = result.items.map(n => n.name);
+                expect(names).toEqual(['Neighbor_A', 'Neighbor_M', 'Neighbor_Z']);
+            });
+            it('should sort neighbors by name descending', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'name',
+                    sortDir: 'desc'
+                });
+                const names = result.items.map(n => n.name);
+                expect(names).toEqual(['Neighbor_Z', 'Neighbor_M', 'Neighbor_A']);
+            });
+            it('should sort neighbors by mtime descending (default)', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'mtime'
+                });
+                const names = result.items.map(n => n.name);
+                // Neighbor_M was created last
+                expect(names).toEqual(['Neighbor_M', 'Neighbor_A', 'Neighbor_Z']);
+            });
+            it('should sort neighbors by mtime ascending', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'mtime',
+                    sortDir: 'asc'
+                });
+                const names = result.items.map(n => n.name);
+                // Neighbor_Z was created first
+                expect(names).toEqual(['Neighbor_Z', 'Neighbor_A', 'Neighbor_M']);
+            });
+            it('should include mtime and obsMtime in neighbor objects', async () => {
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'name'
+                });
+                // Each neighbor should have timestamp fields
+                for (const neighbor of result.items) {
+                    expect(neighbor.mtime).toBeDefined();
+                    expect(neighbor.obsMtime).toBeDefined();
+                    expect(typeof neighbor.mtime).toBe('number');
+                    expect(typeof neighbor.obsMtime).toBe('number');
+                }
+            });
+            it('should sort by obsMtime after observation update', async () => {
+                // Update observation on Neighbor_Z to make it have most recent obsMtime
+                await callTool(client, 'delete_observations', {
+                    deletions: [{ entityName: 'Neighbor_Z', observations: ['First'] }]
+                });
+                await callTool(client, 'add_observations', {
+                    observations: [{ entityName: 'Neighbor_Z', contents: ['Updated recently'] }]
+                });
+                const result = await callTool(client, 'get_neighbors', {
+                    entityName: 'Hub',
+                    sortBy: 'obsMtime'
+                });
+                const names = result.items.map(n => n.name);
+                // Neighbor_Z should be first because its obsMtime was just updated
+                expect(names[0]).toBe('Neighbor_Z');
+            });
+        });
+        describe('sorting with pagination', () => {
+            it('should maintain sort order across paginated results', async () => {
+                // Create many entities to force pagination
+                const entities = [];
+                for (let i = 0; i < 20; i++) {
+                    entities.push({
+                        name: `Entity_${String(i).padStart(2, '0')}`,
+                        entityType: 'Numbered',
+                        observations: [`Number ${i}`]
+                    });
+                }
+                await callTool(client, 'create_entities', { entities });
+                // Fetch all pages sorted by name descending
+                const allEntities = [];
+                let entityCursor = 0;
+                while (entityCursor !== null) {
+                    const result = await callTool(client, 'search_nodes', {
+                        query: 'Numbered',
+                        sortBy: 'name',
+                        sortDir: 'desc',
+                        entityCursor
+                    });
+                    allEntities.push(...result.entities.items);
+                    entityCursor = result.entities.nextCursor;
+                }
+                // Verify all entities are in descending order
+                const names = allEntities.map(e => e.name);
+                const sortedNames = [...names].sort().reverse();
+                expect(names).toEqual(sortedNames);
+            });
+        });
+    });
 });

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@levalicious/server-memory",
-  "version": "0.0.8",
+  "version": "0.0.10",
   "description": "MCP server for enabling memory for Claude through a knowledge graph",
   "license": "MIT",
   "author": "Levalicious",
@@ -20,12 +20,12 @@
     "test": "NODE_OPTIONS='--experimental-vm-modules' jest"
   },
   "dependencies": {
-    "@modelcontextprotocol/sdk": "1.24.0",
+    "@modelcontextprotocol/sdk": "1.25.1",
     "proper-lockfile": "^4.1.2"
   },
   "devDependencies": {
     "@types/jest": "^30.0.0",
-    "@types/node": "^24",
+    "@types/node": "^25",
     "@types/proper-lockfile": "^4.1.4",
     "jest": "^30.2.0",
     "shx": "^0.4.0",