@levalicious/server-memory 0.0.18 → 0.0.20

package/dist/server.js

@@ -101,7 +101,7 @@ function sortNeighbors(neighbors, sortBy = "llmrank", sortDir, rankMaps) {
         return mult * (aVal - bVal);
     });
 }
-export const MAX_CHARS = 16384;
+export const MAX_CHARS = 4096;
 function paginateItems(items, cursor = 0, maxChars = MAX_CHARS) {
     const result = [];
     let i = cursor;
@@ -953,7 +953,7 @@ export function createServer(memoryFilePath) {
                 sizes: ["any"]
             }
         ],
-        version: "0.0.18",
+        version: "0.0.20",
     }, {
         capabilities: {
             tools: {},
@@ -1105,7 +1105,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "search_nodes",
-                    description: "Search for nodes in the knowledge graph using a regex pattern. Results are paginated (max 512 chars).",
+                    description: "Search for nodes in the knowledge graph using a regex pattern. Results are paginated (max 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
@@ -1121,7 +1121,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "open_nodes",
-                    description: "Open specific nodes in the knowledge graph by their names. Results are paginated (max 512 chars).",
+                    description: "Open specific nodes in the knowledge graph by their names. Results are paginated (max 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
@@ -1139,7 +1139,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "get_neighbors",
-                    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).",
+                    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 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
@@ -1155,7 +1155,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "find_path",
-                    description: "Find a path between two entities in the knowledge graph. Results are paginated (max 512 chars).",
+                    description: "Find a path between two entities in the knowledge graph. Results are paginated (max 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
@@ -1170,7 +1170,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "get_entities_by_type",
-                    description: "Get all entities of a specific type. Results are paginated (max 512 chars).",
+                    description: "Get all entities of a specific type. Results are paginated (max 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {
@@ -1208,7 +1208,7 @@ export function createServer(memoryFilePath) {
                 },
                 {
                     name: "get_orphaned_entities",
-                    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).",
+                    description: "Get entities that have no relations (orphaned entities). In strict mode, returns entities not connected to 'Self' entity. Results are paginated (max 4096 chars).",
                     inputSchema: {
                         type: "object",
                         properties: {

package/dist/src/kb_load.js

@@ -350,6 +350,9 @@ export function loadDocument(text, title, st, topK = 15) {
             observations: [idx.phrase],
         });
     }
+    // Index hub — empty structural node linking Document to index entries
+    const indexHubId = `${title}__index`;
+    entities.push({ name: indexHubId, entityType: 'DocumentIndex', observations: [] });
     // ─── Assemble relations ─────────────────────────────────────────
     // Document → chain endpoints
     if (chunks.length > 0) {
@@ -365,12 +368,15 @@ export function loadDocument(text, title, st, topK = 15) {
         relations.push({ from: chunks[i].id, to: chunks[i + 1].id, relationType: 'follows' });
         relations.push({ from: chunks[i + 1].id, to: chunks[i].id, relationType: 'preceded_by' });
     }
-    // Document → index entries
+    // Document → index hub
+    relations.push({ from: title, to: indexHubId, relationType: 'has_index' });
+    relations.push({ from: indexHubId, to: title, relationType: 'indexes' });
+    // Index hub → index entries
     for (const idx of indexEntities) {
-        relations.push({ from: title, to: idx.id, relationType: 'has_index' });
-        relations.push({ from: idx.id, to: title, relationType: 'indexes' });
+        relations.push({ from: indexHubId, to: idx.id, relationType: 'contains' });
+        relations.push({ from: idx.id, to: indexHubId, relationType: 'contained_in' });
     }
-    // Index → highlighted chunks
+    // Index entries → highlighted chunks
     for (const idx of indexEntities) {
         relations.push({ from: idx.id, to: idx.chunk.id, relationType: 'highlights' });
         relations.push({ from: idx.chunk.id, to: idx.id, relationType: 'highlighted_by' });

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

@@ -1068,13 +1068,16 @@ describe('MCP Memory Server E2E Tests', () => {
             const docResult = await callTool(client, 'open_nodes', { names: ['test-doc'] });
             expect(docResult.entities.items).toHaveLength(1);
             expect(docResult.entities.items[0].entityType).toBe('Document');
-            // Check index entities (one per key phrase)
+            // Check index entities — one hub (0 observations) + entries (1 observation each)
             const indexEntities = await callTool(client, 'get_entities_by_type', { entityType: 'DocumentIndex' });
-            expect(indexEntities.items.length).toBeGreaterThan(0);
-            for (const idx of indexEntities.items) {
-                expect(idx.entityType).toBe('DocumentIndex');
-                expect(idx.observations.length).toBe(1);
-                expect(idx.observations[0].length).toBeLessThanOrEqual(140);
+            expect(indexEntities.items.length).toBeGreaterThan(1);
+            const hub = indexEntities.items.filter(e => e.observations.length === 0);
+            const entries = indexEntities.items.filter(e => e.observations.length > 0);
+            expect(hub).toHaveLength(1);
+            expect(entries.length).toBeGreaterThan(0);
+            for (const entry of entries) {
+                expect(entry.observations.length).toBe(1);
+                expect(entry.observations[0].length).toBeLessThanOrEqual(140);
             }
             // Check TextChunk entities exist via type query
             const chunks = await callTool(client, 'get_entities_by_type', { entityType: 'TextChunk' });

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@levalicious/server-memory",
-  "version": "0.0.18",
+  "version": "0.0.20",
   "description": "MCP server for enabling memory for Claude through a knowledge graph",
   "license": "MIT",
   "author": "Levalicious",