@lumenflow/memory 1.0.0

package/dist/memory-store.d.ts

@@ -0,0 +1,108 @@
+/**
+ * Memory Store (WU-1463)
+ *
+ * JSONL-based memory store with load, query, and append operations.
+ * Git-friendly format with one node per line for merge-safe diffs.
+ *
+ * Features:
+ * - Append-only writes (no full file rewrite)
+ * - Indexed lookups by ID and WU
+ * - Deterministic queryReady() ordering by priority then createdAt
+ *
+ * @see {@link tools/lib/__tests__/memory-store.test.mjs} - Tests
+ * @see {@link tools/lib/memory-schema.mjs} - Schema definitions
+ */
+import { type MemoryNode } from './memory-schema.js';
+/**
+ * Memory file name constant
+ */
+export declare const MEMORY_FILE_NAME = "memory.jsonl";
+/**
+ * Indexed memory result from loadMemory
+ */
+export interface IndexedMemory {
+    /** All loaded nodes in file order */
+    nodes: MemoryNode[];
+    /** Nodes indexed by ID */
+    byId: Map<string, MemoryNode>;
+    /** Nodes indexed by WU ID */
+    byWu: Map<string, MemoryNode[]>;
+}
+/**
+ * Loads memory from JSONL file and returns indexed nodes.
+ *
+ * Handles:
+ * - Missing file: returns empty result
+ * - Empty file: returns empty result
+ * - Empty lines: skipped gracefully
+ * - Malformed JSON: throws error with line info
+ * - Invalid nodes: throws validation error
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @returns Indexed memory nodes
+ * @throws If file contains malformed JSON or invalid nodes
+ *
+ * @example
+ * const memory = await loadMemory('/path/to/project');
+ * const node = memory.byId.get('mem-abc1');
+ * const wuNodes = memory.byWu.get('WU-1463') ?? [];
+ */
+export declare function loadMemory(baseDir: string): Promise<IndexedMemory>;
+/**
+ * Appends a single node to the memory file.
+ *
+ * Uses append mode to avoid full file rewrite.
+ * Creates file if it doesn't exist.
+ * Validates node before appending.
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param node - Node to append
+ * @returns The appended node
+ * @throws If node fails validation
+ *
+ * @example
+ * const node = await appendNode('/path/to/project', {
+ *   id: 'mem-abc1',
+ *   type: 'discovery',
+ *   lifecycle: 'wu',
+ *   content: 'Found relevant file',
+ *   created_at: new Date().toISOString(),
+ *   wu_id: 'WU-1463',
+ * });
+ */
+export declare function appendNode(baseDir: string, node: MemoryNode): Promise<MemoryNode>;
+/**
+ * Queries nodes ready for processing by WU ID.
+ *
+ * Returns nodes linked to the WU in deterministic order:
+ * 1. Priority (P0 first, then P1, P2, P3; nodes without priority last)
+ * 2. Created timestamp (oldest first for same priority)
+ * 3. ID (for stable sort when priority and timestamp match)
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param wuId - WU ID to query (e.g., 'WU-1463')
+ * @returns Deterministically ordered nodes for WU
+ *
+ * @example
+ * const ready = await queryReady('/path/to/project', 'WU-1463');
+ * // Process highest priority, oldest items first
+ * for (const node of ready) {
+ *   await processNode(node);
+ * }
+ */
+export declare function queryReady(baseDir: string, wuId: string): Promise<MemoryNode[]>;
+/**
+ * Queries all nodes linked to a WU ID.
+ *
+ * Returns nodes in file order (insertion order).
+ * Use queryReady() instead if you need deterministic priority ordering.
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param wuId - WU ID to query (e.g., 'WU-1463')
+ * @returns All nodes for WU in file order
+ *
+ * @example
+ * const nodes = await queryByWu('/path/to/project', 'WU-1463');
+ * console.log(`Found ${nodes.length} nodes for WU-1463`);
+ */
+export declare function queryByWu(baseDir: string, wuId: string): Promise<MemoryNode[]>;

package/dist/memory-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.d.ts","sourceRoot":"","sources":["../src/memory-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAMH;;GAEG;AACH,eAAO,MAAM,gBAAgB,iBAAiB,CAAC;AAsE/C;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,UAAU,CAAC,OAAO,KAAA;;;;GAiEvC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAsB,UAAU,CAAC,OAAO,KAAA,EAAE,IAAI,KAAA,gBAiB7C;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,UAAU,CAAC,OAAO,KAAA,EAAE,IAAI,KAAA,kBAQ7C;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAsB,SAAS,CAAC,OAAO,KAAA,EAAE,IAAI,KAAA,gBAG5C"}

package/dist/memory-store.js

@@ -0,0 +1,234 @@
+/**
+ * Memory Store (WU-1463)
+ *
+ * JSONL-based memory store with load, query, and append operations.
+ * Git-friendly format with one node per line for merge-safe diffs.
+ *
+ * Features:
+ * - Append-only writes (no full file rewrite)
+ * - Indexed lookups by ID and WU
+ * - Deterministic queryReady() ordering by priority then createdAt
+ *
+ * @see {@link tools/lib/__tests__/memory-store.test.mjs} - Tests
+ * @see {@link tools/lib/memory-schema.mjs} - Schema definitions
+ */
+import fs from 'node:fs/promises';
+import path from 'node:path';
+import { validateMemoryNode } from './memory-schema.js';
+/**
+ * Memory file name constant
+ */
+export const MEMORY_FILE_NAME = 'memory.jsonl';
+/**
+ * Priority ranking for deterministic ordering.
+ * Lower rank = higher priority.
+ * P0 is highest priority, nodes without priority are lowest.
+ */
+const PRIORITY_RANK = {
+    P0: 0,
+    P1: 1,
+    P2: 2,
+    P3: 3,
+};
+/** Default rank for nodes without priority (lowest priority) */
+const DEFAULT_PRIORITY_RANK = 999;
+/**
+ * Gets the priority rank for a node.
+ * Lower rank = higher priority.
+ *
+ * @param node - Memory node
+ * @returns Priority rank
+ */
+function getPriorityRank(node) {
+    const priority = node.metadata?.priority;
+    if (!priority) {
+        return DEFAULT_PRIORITY_RANK;
+    }
+    return PRIORITY_RANK[priority] ?? DEFAULT_PRIORITY_RANK;
+}
+/**
+ * Comparator for deterministic ordering: priority first, then createdAt.
+ *
+ * @param a - First node
+ * @param b - Second node
+ * @returns Comparison result (-1, 0, 1)
+ */
+function compareNodes(a, b) {
+    // Primary: sort by priority (lower rank first)
+    const priorityDiff = getPriorityRank(a) - getPriorityRank(b);
+    if (priorityDiff !== 0) {
+        return priorityDiff;
+    }
+    // Secondary: sort by created_at (oldest first)
+    const aTime = new Date(a.created_at).getTime();
+    const bTime = new Date(b.created_at).getTime();
+    if (aTime !== bTime) {
+        return aTime - bTime;
+    }
+    // Tertiary: stable sort by ID for identical priority and timestamp
+    return a.id.localeCompare(b.id);
+}
+/**
+ * Loads memory from JSONL file and returns indexed nodes.
+ *
+ * Handles:
+ * - Missing file: returns empty result
+ * - Empty file: returns empty result
+ * - Empty lines: skipped gracefully
+ * - Malformed JSON: throws error with line info
+ * - Invalid nodes: throws validation error
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @returns Indexed memory nodes
+ * @throws If file contains malformed JSON or invalid nodes
+ *
+ * @example
+ * const memory = await loadMemory('/path/to/project');
+ * const node = memory.byId.get('mem-abc1');
+ * const wuNodes = memory.byWu.get('WU-1463') ?? [];
+ */
+export async function loadMemory(baseDir) {
+    const filePath = path.join(baseDir, MEMORY_FILE_NAME);
+    const result = {
+        nodes: [],
+        byId: new Map(),
+        byWu: new Map(),
+    };
+    // Check if file exists
+    let content;
+    try {
+        content = await fs.readFile(filePath, { encoding: 'utf-8' });
+    }
+    catch (err) {
+        const error = err;
+        if (error.code === 'ENOENT') {
+            // File doesn't exist - return empty result
+            return result;
+        }
+        throw error;
+    }
+    // Parse JSONL content
+    const lines = content.split('\n');
+    for (let i = 0; i < lines.length; i++) {
+        const rawLine = lines[i];
+        const line = rawLine ? rawLine.trim() : '';
+        // Skip empty lines
+        if (!line) {
+            continue;
+        }
+        // Parse JSON line
+        let parsed;
+        try {
+            parsed = JSON.parse(line);
+        }
+        catch (err) {
+            const errMsg = err instanceof Error ? err.message : String(err);
+            throw new Error(`Malformed JSON on line ${i + 1}: ${errMsg}`);
+        }
+        // Validate against schema
+        const validation = validateMemoryNode(parsed);
+        if (!validation.success) {
+            const issues = validation.error.issues
+                .map((issue) => `${issue.path.join('.')}: ${issue.message}`)
+                .join(', ');
+            throw new Error(`Validation error on line ${i + 1}: ${issues}`);
+        }
+        const node = validation.data;
+        // Add to nodes array
+        result.nodes.push(node);
+        // Index by ID
+        result.byId.set(node.id, node);
+        // Index by WU ID if present
+        if (node.wu_id) {
+            if (!result.byWu.has(node.wu_id)) {
+                result.byWu.set(node.wu_id, []);
+            }
+            const wuNodes = result.byWu.get(node.wu_id);
+            if (wuNodes) {
+                wuNodes.push(node);
+            }
+        }
+    }
+    return result;
+}
+/**
+ * Appends a single node to the memory file.
+ *
+ * Uses append mode to avoid full file rewrite.
+ * Creates file if it doesn't exist.
+ * Validates node before appending.
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param node - Node to append
+ * @returns The appended node
+ * @throws If node fails validation
+ *
+ * @example
+ * const node = await appendNode('/path/to/project', {
+ *   id: 'mem-abc1',
+ *   type: 'discovery',
+ *   lifecycle: 'wu',
+ *   content: 'Found relevant file',
+ *   created_at: new Date().toISOString(),
+ *   wu_id: 'WU-1463',
+ * });
+ */
+export async function appendNode(baseDir, node) {
+    // Validate node before appending
+    const validation = validateMemoryNode(node);
+    if (!validation.success) {
+        const issues = validation.error.issues
+            .map((issue) => `${issue.path.join('.')}: ${issue.message}`)
+            .join(', ');
+        throw new Error(`Validation error: ${issues}`);
+    }
+    const filePath = path.join(baseDir, MEMORY_FILE_NAME);
+    const line = JSON.stringify(node) + '\n';
+    // Use append flag to avoid rewriting the file
+    await fs.appendFile(filePath, line, { encoding: 'utf-8' });
+    return node;
+}
+/**
+ * Queries nodes ready for processing by WU ID.
+ *
+ * Returns nodes linked to the WU in deterministic order:
+ * 1. Priority (P0 first, then P1, P2, P3; nodes without priority last)
+ * 2. Created timestamp (oldest first for same priority)
+ * 3. ID (for stable sort when priority and timestamp match)
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param wuId - WU ID to query (e.g., 'WU-1463')
+ * @returns Deterministically ordered nodes for WU
+ *
+ * @example
+ * const ready = await queryReady('/path/to/project', 'WU-1463');
+ * // Process highest priority, oldest items first
+ * for (const node of ready) {
+ *   await processNode(node);
+ * }
+ */
+export async function queryReady(baseDir, wuId) {
+    const memory = await loadMemory(baseDir);
+    // Get nodes for this WU
+    const wuNodes = memory.byWu.get(wuId) ?? [];
+    // Return sorted copy (don't mutate original)
+    return [...wuNodes].sort(compareNodes);
+}
+/**
+ * Queries all nodes linked to a WU ID.
+ *
+ * Returns nodes in file order (insertion order).
+ * Use queryReady() instead if you need deterministic priority ordering.
+ *
+ * @param baseDir - Directory containing memory.jsonl
+ * @param wuId - WU ID to query (e.g., 'WU-1463')
+ * @returns All nodes for WU in file order
+ *
+ * @example
+ * const nodes = await queryByWu('/path/to/project', 'WU-1463');
+ * console.log(`Found ${nodes.length} nodes for WU-1463`);
+ */
+export async function queryByWu(baseDir, wuId) {
+    const memory = await loadMemory(baseDir);
+    return memory.byWu.get(wuId) ?? [];
+}

package/dist/memory-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.js","sourceRoot":"","sources":["../src/memory-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAClC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAExD;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,cAAc,CAAC;AAE/C;;;;GAIG;AACH,MAAM,aAAa,GAAG;IACpB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;CACN,CAAC;AAEF,gEAAgE;AAChE,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAElC;;GAEG;AAEH;;;;;;;GAOG;AAEH;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,IAAI;IAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;IACzC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IACD,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,qBAAqB,CAAC;AAC1D,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC;IACxB,+CAA+C;IAC/C,MAAM,YAAY,GAAG,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,+CAA+C;IAC/C,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/C,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAED,mEAAmE;IACnE,OAAO,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAAO;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG;QACb,KAAK,EAAE,EAAE;QACT,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,IAAI,EAAE,IAAI,GAAG,EAAE;KAChB,CAAC;IAEF,uBAAuB;IACvB,IAAI,OAAO,CAAC;IACZ,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC5B,2CAA2C;YAC3C,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;IAED,sBAAsB;IACtB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAE7B,mBAAmB;QACnB,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QAED,kBAAkB;QAClB,IAAI,MAAM,CAAC;QACX,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACvE,CAAC;QAED,0BAA0B;QAC1B,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM;iBACnC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;iBAC3D,IAAI,CAAC,IAAI,CAAC,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC;QAE7B,qBAAqB;QACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAExB,cAAc;QACd,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,4BAA4B;QAC5B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAAO,EAAE,IAAI;IAC5C,iCAAiC;IACjC,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM;aACnC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;aAC3D,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,qBAAqB,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAEzC,8CAA8C;IAC9C,MAAM,EAAE,CAAC,UAAU,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAE7C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAAO,EAAE,IAAI;IAC5C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,CAAC;IAEzC,wBAAwB;IACxB,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAE5C,6CAA6C;IAC7C,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,OAAO,EAAE,IAAI;IAC3C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;AACrC,CAAC"}

package/package.json

@@ -0,0 +1,76 @@
+{
+  "name": "@lumenflow/memory",
+  "version": "1.0.0",
+  "description": "Memory layer for LumenFlow workflow framework - session tracking, context recovery, and agent coordination",
+  "keywords": [
+    "lumenflow",
+    "workflow",
+    "memory",
+    "session",
+    "context",
+    "coordination"
+  ],
+  "homepage": "https://github.com/hellmai/os",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/hellmai/os.git",
+    "directory": "packages/@lumenflow/memory"
+  },
+  "license": "Apache-2.0",
+  "author": {
+    "name": "HellmAI",
+    "url": "https://hellm.ai"
+  },
+  "type": "module",
+  "exports": {
+    ".": "./dist/index.js",
+    "./checkpoint": "./dist/mem-checkpoint-core.js",
+    "./init": "./dist/mem-init-core.js",
+    "./start": "./dist/mem-start-core.js",
+    "./ready": "./dist/mem-ready-core.js",
+    "./signal": "./dist/mem-signal-core.js",
+    "./cleanup": "./dist/mem-cleanup-core.js",
+    "./create": "./dist/mem-create-core.js",
+    "./summarize": "./dist/mem-summarize-core.js",
+    "./triage": "./dist/mem-triage-core.js",
+    "./schema": "./dist/memory-schema.js",
+    "./store": "./dist/memory-store.js",
+    "./dist/*": "./dist/*"
+  },
+  "main": "./dist/index.js",
+  "files": [
+    "dist",
+    "LICENSE",
+    "README.md"
+  ],
+  "dependencies": {
+    "ms": "^2.1.3",
+    "yaml": "^2.8.0",
+    "zod": "^4.3.5"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.0",
+    "vitest": "^2.1.0"
+  },
+  "peerDependencies": {
+    "@lumenflow/core": "1.0.0"
+  },
+  "peerDependenciesMeta": {
+    "@lumenflow/core": {
+      "optional": true
+    }
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc",
+    "build:dist": "tsc -p tsconfig.build.json",
+    "pack:dist": "pnpm pack",
+    "clean": "rm -rf dist *.tgz",
+    "test": "vitest run"
+  }
+}