@levalicious/server-memory 0.0.10 → 0.0.11

package/README.md

@@ -108,11 +108,12 @@ Example:
 
 - **search_nodes**
   - Search for nodes using a regex pattern
-  - Input: `query` (string), `entityCursor` (number, optional), `relationCursor` (number, optional)
-  - Searches across:
-    - Entity names
-    - Entity types
-    - Observation content
+  - Input: 
+    - `query` (string): Regex pattern to search
+    - `sortBy` (string, optional): Sort field ("mtime", "obsMtime", or "name")
+    - `sortDir` (string, optional): Sort direction ("asc" or "desc")
+    - `entityCursor` (number, optional), `relationCursor` (number, optional)
+  - Searches across entity names, types, and observation content
   - Returns matching entities and their relations (paginated)
 
 - **open_nodes_filtered**
@@ -132,9 +133,15 @@ Example:
   - 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: 0), `withEntities` (boolean, default: false), `entityCursor` (number, optional), `relationCursor` (number, optional)
-  - Returns relations (and optionally entities) connected within specified depth (paginated)
+  - Get names of neighboring entities connected to a specific entity within a given depth
+  - Input: 
+    - `entityName` (string): The entity to find neighbors for
+    - `depth` (number, default: 1): Maximum traversal depth
+    - `sortBy` (string, optional): Sort field ("mtime", "obsMtime", or "name")
+    - `sortDir` (string, optional): Sort direction ("asc" or "desc")
+    - `cursor` (number, optional): Pagination cursor
+  - Returns neighbor names with timestamps (paginated)
+  - Use `open_nodes` to get full entity data for neighbors
 
 - **find_path**
   - Find a path between two entities in the knowledge graph
@@ -143,7 +150,11 @@ Example:
 
 - **get_entities_by_type**
   - Get all entities of a specific type
-  - Input: `entityType` (string), `cursor` (number, optional)
+  - Input: 
+    - `entityType` (string): Type to filter by
+    - `sortBy` (string, optional): Sort field ("mtime", "obsMtime", or "name")
+    - `sortDir` (string, optional): Sort direction ("asc" or "desc")
+    - `cursor` (number, optional)
   - Returns all entities matching the specified type (paginated)
 
 - **get_entity_types**
@@ -163,8 +174,11 @@ Example:
 
 - **get_orphaned_entities**
   - 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)
+  - Input: 
+    - `strict` (boolean, default: false): If true, returns entities not connected to 'Self' entity
+    - `sortBy` (string, optional): Sort field ("mtime", "obsMtime", or "name")
+    - `sortDir` (string, optional): Sort direction ("asc" or "desc")
+    - `cursor` (number, optional)
   - Returns entities with no connections (paginated)
 
 - **validate_graph**
@@ -172,22 +186,22 @@ Example:
   - No input required
   - Returns missing entities referenced in relations and observation limit violations
 
-- **evaluate_bcl**
-  - Evaluate a Binary Combinatory Logic (BCL) program
-  - Input: `program` (string), `maxSteps` (number, default: 1000000)
-  - BCL syntax: T:=00|01|1TT where 00=K, 01=S, 1=application
-  - Returns evaluation result with halt status
-
-- **add_bcl_term**
-  - Add a BCL term to the constructor, maintaining valid syntax
-  - Input: `term` (string)
-  - Valid values: '1' or 'App' (application), '00' or 'K' (K combinator), '01' or 'S' (S combinator)
-  - Returns completion status
-
-- **clear_bcl_term**
-  - Clear the current BCL term being constructed and reset the constructor state
-  - No input required
-  - Resets BCL constructor
+- **decode_timestamp**
+  - Decode a millisecond timestamp to human-readable UTC format
+  - Input:
+    - `timestamp` (number, optional): Millisecond timestamp to decode. If omitted, returns current time
+    - `relative` (boolean, optional): If true, include relative time (e.g., "3 days ago")
+  - Returns timestamp, ISO 8601 string, formatted UTC string, and optional relative time
+  - Useful for interpreting `mtime`/`obsMtime` values from entities
+
+- **random_walk**
+  - Perform a random walk from a starting entity, following random relations
+  - Input:
+    - `start` (string): Name of the entity to start the walk from
+    - `depth` (number, default: 3): Number of hops to take
+    - `seed` (string, optional): Seed for reproducible walks
+  - Returns the terminal entity name and the path taken
+  - Useful for serendipitous exploration of the knowledge graph
 
 - **sequentialthinking**
   - Record a thought in the knowledge graph

package/dist/server.js

@@ -131,8 +131,6 @@ function paginateGraph(graph, entityCursor = 0, relationCursor = 0) {
 }
 // The KnowledgeGraphManager class contains all operations to interact with the knowledge graph
 export class KnowledgeGraphManager {
-    bclCtr = 0;
-    bclTerm = "";
     memoryFilePath;
     constructor(memoryFilePath = DEFAULT_MEMORY_FILE_PATH) {
         this.memoryFilePath = memoryFilePath;
@@ -503,163 +501,96 @@ export class KnowledgeGraphManager {
             observationViolations
         };
     }
-    // BCL (Binary Combinatory Logic) evaluator
-    async evaluateBCL(program, maxSteps) {
-        let stepCount = 0;
-        let max_size = program.length;
-        let mode = 0;
-        let ctr = 1;
-        let t0 = program;
-        let t1 = '';
-        let t2 = '';
-        let t3 = '';
-        let t4 = '';
-        while (stepCount < maxSteps) {
-            if (t0.length == 0)
-                break;
-            let b = t0[0];
-            t0 = t0.slice(1);
-            if (mode === 0) {
-                t1 += b;
-                let size = t1.length + t0.length;
-                if (size > max_size)
-                    max_size = size;
-                if (t1.slice(-4) === '1100') {
-                    mode = 1;
-                    t1 = t1.slice(0, -4);
-                }
-                else if (t1.slice(-5) === '11101') {
-                    mode = 3;
-                    t1 = t1.slice(0, -5);
-                }
-            }
-            else if (mode === 1) {
-                t2 += b;
-                if (b == '1') {
-                    ctr += 1;
-                }
-                else if (b == '0') {
-                    ctr -= 1;
-                    t2 += t0[0];
-                    t0 = t0.slice(1);
-                }
-                if (ctr === 0) {
-                    mode = 2;
-                    ctr = 1;
-                }
-            }
-            else if (mode === 2) {
-                if (b == '1') {
-                    ctr += 1;
-                }
-                else if (b == '0') {
-                    ctr -= 1;
-                    t0 = t0.slice(1);
-                }
-                if (ctr === 0) {
-                    t0 = t2 + t0;
-                    t2 = '';
-                    mode = 0;
-                    ctr = 1;
-                    stepCount += 1;
-                }
-            }
-            else if (mode === 3) {
-                t2 += b;
-                if (b == '1') {
-                    ctr += 1;
-                }
-                else if (b == '0') {
-                    ctr -= 1;
-                    t2 += t0[0];
-                    t0 = t0.slice(1);
-                }
-                if (ctr === 0) {
-                    mode = 4;
-                    ctr = 1;
-                }
+    async randomWalk(start, depth = 3, seed) {
+        const graph = await this.loadGraph();
+        // Verify start entity exists
+        const startEntity = graph.entities.find(e => e.name === start);
+        if (!startEntity) {
+            throw new Error(`Start entity not found: ${start}`);
+        }
+        // Create seeded RNG if seed provided, otherwise use crypto.randomBytes
+        let rngState = seed ? this.hashSeed(seed) : null;
+        const random = () => {
+            if (rngState !== null) {
+                // Simple seeded PRNG (xorshift32)
+                rngState ^= rngState << 13;
+                rngState ^= rngState >>> 17;
+                rngState ^= rngState << 5;
+                return (rngState >>> 0) / 0xFFFFFFFF;
             }
-            else if (mode === 4) {
-                t3 += b;
-                if (b == '1') {
-                    ctr += 1;
-                }
-                else if (b == '0') {
-                    ctr -= 1;
-                    t3 += t0[0];
-                    t0 = t0.slice(1);
-                }
-                if (ctr === 0) {
-                    mode = 5;
-                    ctr = 1;
-                }
+            else {
+                return randomBytes(4).readUInt32BE() / 0xFFFFFFFF;
             }
-            else if (mode === 5) {
-                t4 += b;
-                if (b == '1') {
-                    ctr += 1;
-                }
-                else if (b == '0') {
-                    ctr -= 1;
-                    t4 += t0[0];
-                    t0 = t0.slice(1);
-                }
-                if (ctr === 0) {
-                    t0 = '11' + t2 + t4 + '1' + t3 + t4 + t0;
-                    t2 = '';
-                    t3 = '';
-                    t4 = '';
-                    mode = 0;
-                    ctr = 1;
-                    stepCount += 1;
-                }
+        };
+        const path = [start];
+        let current = start;
+        for (let i = 0; i < depth; i++) {
+            // Get unique neighbors (both directions)
+            const neighbors = new Set();
+            for (const rel of graph.relations) {
+                if (rel.from === current && rel.to !== current)
+                    neighbors.add(rel.to);
+                if (rel.to === current && rel.from !== current)
+                    neighbors.add(rel.from);
             }
+            // Filter to only existing entities
+            const validNeighbors = Array.from(neighbors).filter(n => graph.entities.some(e => e.name === n));
+            if (validNeighbors.length === 0)
+                break; // Dead end
+            // Pick random neighbor (uniform over entities)
+            const idx = Math.floor(random() * validNeighbors.length);
+            current = validNeighbors[idx];
+            path.push(current);
         }
-        const halted = stepCount < maxSteps;
-        return {
-            result: t1,
-            info: `${stepCount} steps, max size ${max_size}`,
-            halted,
-            errored: halted && mode != 0,
-        };
+        return { entity: current, path };
     }
-    async addBCLTerm(term) {
-        const termset = ["1", "00", "01"];
-        if (!term || term.trim() === "") {
-            throw new Error("BCL term cannot be empty");
-        }
-        // Term can be 1, 00, 01, or K, S, App (application)
-        const validTerms = ["1", "App", "00", "K", "01", "S"];
-        if (!validTerms.includes(term)) {
-            throw new Error(`Invalid BCL term: ${term}\nExpected one of: ${validTerms.join(", ")}`);
-        }
-        let processedTerm = 0;
-        if (term === "00" || term === "K")
-            processedTerm = 1;
-        else if (term === "01" || term === "S")
-            processedTerm = 2;
-        this.bclTerm += termset[processedTerm];
-        if (processedTerm === 0) {
-            if (this.bclCtr === 0)
-                this.bclCtr += 1;
-            this.bclCtr += 1;
-        }
-        else {
-            this.bclCtr -= 1;
-        }
-        if (this.bclCtr <= 0) {
-            const constructedProgram = this.bclTerm;
-            this.bclCtr = 0;
-            this.bclTerm = "";
-            return `Constructed Program: ${constructedProgram}`;
-        }
-        else {
-            return `Need ${this.bclCtr} more term(s) to complete the program.`;
+    hashSeed(seed) {
+        // Simple string hash to 32-bit integer
+        let hash = 0;
+        for (let i = 0; i < seed.length; i++) {
+            const char = seed.charCodeAt(i);
+            hash = ((hash << 5) - hash) + char;
+            hash = hash & hash; // Convert to 32-bit integer
         }
+        return hash || 1; // Ensure non-zero for xorshift
     }
-    async clearBCLTerm() {
-        this.bclCtr = 0;
-        this.bclTerm = "";
+    decodeTimestamp(timestamp, relative = false) {
+        const ts = timestamp ?? Date.now();
+        const date = new Date(ts);
+        const result = {
+            timestamp: ts,
+            iso8601: date.toISOString(),
+            formatted: date.toUTCString(),
+        };
+        if (relative) {
+            const now = Date.now();
+            const diffMs = now - ts;
+            const diffSec = Math.abs(diffMs) / 1000;
+            const diffMin = diffSec / 60;
+            const diffHour = diffMin / 60;
+            const diffDay = diffHour / 24;
+            let relStr;
+            if (diffSec < 60) {
+                relStr = `${Math.floor(diffSec)} seconds`;
+            }
+            else if (diffMin < 60) {
+                relStr = `${Math.floor(diffMin)} minutes`;
+            }
+            else if (diffHour < 24) {
+                relStr = `${Math.floor(diffHour)} hours`;
+            }
+            else if (diffDay < 30) {
+                relStr = `${Math.floor(diffDay)} days`;
+            }
+            else if (diffDay < 365) {
+                relStr = `${Math.floor(diffDay / 30)} months`;
+            }
+            else {
+                relStr = `${Math.floor(diffDay / 365)} years`;
+            }
+            result.relative = diffMs >= 0 ? `${relStr} ago` : `in ${relStr}`;
+        }
+        return result;
     }
     async addThought(observations, previousCtxId) {
         return this.withLock(async () => {
@@ -714,7 +645,7 @@ export function createServer(memoryFilePath) {
                 sizes: ["any"]
             }
         ],
-        version: "0.0.10",
+        version: "0.0.11",
     }, {
         capabilities: {
             tools: {},
@@ -998,37 +929,27 @@ export function createServer(memoryFilePath) {
                     },
                 },
                 {
-                    name: "evaluate_bcl",
-                    description: "Evaluate a Binary Combinatory Logic (BCL) program",
+                    name: "decode_timestamp",
+                    description: "Decode a millisecond timestamp to human-readable UTC format. If no timestamp provided, returns the current time. Use this to interpret mtime/obsMtime values from entities.",
                     inputSchema: {
                         type: "object",
                         properties: {
-                            program: { type: "string", description: "The BCL program as a binary string (syntax: T:=00|01|1TT) 00=K, 01=S, 1=application." },
-                            maxSteps: { type: "number", description: "Maximum number of reduction steps to perform (default: 1000000)", default: 1000000 },
+                            timestamp: { type: "number", description: "Millisecond timestamp to decode. If omitted, returns current time." },
+                            relative: { type: "boolean", description: "If true, include relative time (e.g., '3 days ago'). Default: false" },
                         },
-                        required: ["program"],
                     },
                 },
                 {
-                    name: "add_bcl_term",
-                    description: "Add a BCL term to the constructor, maintaining valid syntax. Returns completion status.",
+                    name: "random_walk",
+                    description: "Perform a random walk from a starting entity, following random relations. Returns the terminal entity name and the path taken. Useful for serendipitous exploration of the knowledge graph.",
                     inputSchema: {
                         type: "object",
                         properties: {
-                            term: {
-                                type: "string",
-                                description: "BCL term to add. Valid values: '1' or 'App' (application), '00' or 'K' (K combinator), '01' or 'S' (S combinator)"
-                            },
+                            start: { type: "string", description: "Name of the entity to start the walk from." },
+                            depth: { type: "number", description: "Number of steps to take. Default: 3" },
+                            seed: { type: "string", description: "Optional seed for reproducible walks." },
                         },
-                        required: ["term"],
-                    },
-                },
-                {
-                    name: "clear_bcl_term",
-                    description: "Clear the current BCL term being constructed and reset the constructor state",
-                    inputSchema: {
-                        type: "object",
-                        properties: {},
+                        required: ["start"],
                     },
                 },
                 {
@@ -1113,13 +1034,12 @@ Use this to build chains of reasoning that persist in the graph. Each thought ca
             }
             case "validate_graph":
                 return { content: [{ type: "text", text: JSON.stringify(await knowledgeGraphManager.validateGraph(), null, 2) }] };
-            case "evaluate_bcl":
-                return { content: [{ type: "text", text: JSON.stringify(await knowledgeGraphManager.evaluateBCL(args.program, args.maxSteps), null, 2) }] };
-            case "add_bcl_term":
-                return { content: [{ type: "text", text: await knowledgeGraphManager.addBCLTerm(args.term) }] };
-            case "clear_bcl_term":
-                await knowledgeGraphManager.clearBCLTerm();
-                return { content: [{ type: "text", text: "BCL term constructor cleared successfully" }] };
+            case "decode_timestamp":
+                return { content: [{ type: "text", text: JSON.stringify(knowledgeGraphManager.decodeTimestamp(args.timestamp, args.relative ?? false)) }] };
+            case "random_walk": {
+                const result = await knowledgeGraphManager.randomWalk(args.start, args.depth ?? 3, args.seed);
+                return { content: [{ type: "text", text: JSON.stringify(result) }] };
+            }
             case "sequentialthinking": {
                 const result = await knowledgeGraphManager.addThought(args.observations, args.previousCtxId);
                 return { content: [{ type: "text", text: JSON.stringify(result) }] };

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

@@ -457,35 +457,6 @@ describe('MCP Memory Server E2E Tests', () => {
             expect(result.missingEntities).toContain('Missing');
         });
     });
-    describe('BCL Evaluator', () => {
-        it('should evaluate K combinator (identity for first arg)', async () => {
-            // K = 00, evaluating K applied to two args should return first
-            // This is a simplified test - BCL semantics are complex
-            const result = await callTool(client, 'evaluate_bcl', {
-                program: '00',
-                maxSteps: 100
-            });
-            expect(result.halted).toBe(true);
-        });
-        it('should construct BCL terms incrementally', async () => {
-            let result = await callTool(client, 'add_bcl_term', { term: 'App' });
-            expect(result).toContain('more term');
-            result = await callTool(client, 'add_bcl_term', { term: 'K' });
-            expect(result).toContain('more term');
-            result = await callTool(client, 'add_bcl_term', { term: 'S' });
-            expect(result).toContain('Constructed Program');
-        });
-        it('should clear BCL constructor state', async () => {
-            await callTool(client, 'add_bcl_term', { term: 'App' });
-            await callTool(client, 'clear_bcl_term', {});
-            // After clearing, we should need to start fresh
-            const result = await callTool(client, 'add_bcl_term', { term: 'K' });
-            expect(result).toContain('Constructed Program');
-        });
-        it('should reject invalid BCL terms', async () => {
-            await expect(callTool(client, 'add_bcl_term', { term: 'invalid' })).rejects.toThrow(/Invalid BCL term/);
-        });
-    });
     describe('Sequential Thinking', () => {
         it('should create a thought and return ctxId', async () => {
             const result = await callTool(client, 'sequentialthinking', {
@@ -541,6 +512,96 @@ describe('MCP Memory Server E2E Tests', () => {
             expect(thought.obsMtime).toBeDefined();
         });
     });
+    describe('Timestamp Decoding', () => {
+        it('should decode a specific timestamp', async () => {
+            const result = await callTool(client, 'decode_timestamp', {
+                timestamp: 1735200000000 // Known timestamp
+            });
+            expect(result.timestamp).toBe(1735200000000);
+            expect(result.iso8601).toBe('2024-12-26T08:00:00.000Z');
+            expect(result.formatted).toContain('2024');
+        });
+        it('should return current time when no timestamp provided', async () => {
+            const before = Date.now();
+            const result = await callTool(client, 'decode_timestamp', {});
+            const after = Date.now();
+            expect(result.timestamp).toBeGreaterThanOrEqual(before);
+            expect(result.timestamp).toBeLessThanOrEqual(after);
+        });
+        it('should include relative time when requested', async () => {
+            const oneHourAgo = Date.now() - 3600000;
+            const result = await callTool(client, 'decode_timestamp', {
+                timestamp: oneHourAgo,
+                relative: true
+            });
+            expect(result.relative).toContain('hour');
+            expect(result.relative).toContain('ago');
+        });
+        it('should handle future timestamps', async () => {
+            const oneHourFromNow = Date.now() + 3600000;
+            const result = await callTool(client, 'decode_timestamp', {
+                timestamp: oneHourFromNow,
+                relative: true
+            });
+            expect(result.relative).toContain('in');
+        });
+    });
+    describe('Random Walk', () => {
+        beforeEach(async () => {
+            // Create a small graph for walking
+            await callTool(client, 'create_entities', {
+                entities: [
+                    { name: 'Center', entityType: 'Node', observations: ['Hub node'] },
+                    { name: 'North', entityType: 'Node', observations: ['North node'] },
+                    { name: 'South', entityType: 'Node', observations: ['South node'] },
+                    { name: 'East', entityType: 'Node', observations: ['East node'] },
+                    { name: 'Isolated', entityType: 'Node', observations: ['No connections'] },
+                ]
+            });
+            await callTool(client, 'create_relations', {
+                relations: [
+                    { from: 'Center', to: 'North', relationType: 'connects' },
+                    { from: 'Center', to: 'South', relationType: 'connects' },
+                    { from: 'Center', to: 'East', relationType: 'connects' },
+                    { from: 'North', to: 'South', relationType: 'connects' },
+                ]
+            });
+        });
+        it('should perform a walk and return path', async () => {
+            const result = await callTool(client, 'random_walk', {
+                start: 'Center',
+                depth: 2
+            });
+            expect(result.path[0]).toBe('Center');
+            expect(result.path.length).toBeGreaterThanOrEqual(1);
+            expect(result.path.length).toBeLessThanOrEqual(3);
+            expect(result.entity).toBe(result.path[result.path.length - 1]);
+        });
+        it('should terminate early at dead ends', async () => {
+            const result = await callTool(client, 'random_walk', {
+                start: 'Isolated',
+                depth: 5
+            });
+            expect(result.path).toEqual(['Isolated']);
+            expect(result.entity).toBe('Isolated');
+        });
+        it('should produce reproducible walks with same seed', async () => {
+            const result1 = await callTool(client, 'random_walk', {
+                start: 'Center',
+                depth: 3,
+                seed: 'test-seed-123'
+            });
+            const result2 = await callTool(client, 'random_walk', {
+                start: 'Center',
+                depth: 3,
+                seed: 'test-seed-123'
+            });
+            expect(result1.path).toEqual(result2.path);
+        });
+        it('should throw on non-existent start entity', async () => {
+            await expect(callTool(client, 'random_walk', { start: 'NonExistent', depth: 2 })).rejects.toThrow(/not found/);
+        });
+    });
     describe('Sorting', () => {
         // Helper to create entities with controlled timestamps
         async function createEntitiesWithDelay(entities) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@levalicious/server-memory",
-  "version": "0.0.10",
+  "version": "0.0.11",
   "description": "MCP server for enabling memory for Claude through a knowledge graph",
   "license": "MIT",
   "author": "Levalicious",
@@ -15,7 +15,7 @@
   ],
   "scripts": {
     "build": "tsc && shx chmod +x dist/*.js",
-    "prepare": "npm run build",
+    "prepare": "husky && npm run build",
     "watch": "tsc --watch",
     "test": "NODE_OPTIONS='--experimental-vm-modules' jest"
   },
@@ -27,6 +27,7 @@
     "@types/jest": "^30.0.0",
     "@types/node": "^25",
     "@types/proper-lockfile": "^4.1.4",
+    "husky": "^9.1.7",
     "jest": "^30.2.0",
     "shx": "^0.4.0",
     "ts-jest": "^29.4.5",