conatus 0.1.0

package/dist/knowledge/memory-compression.js

@@ -0,0 +1,289 @@
+import * as fsp from "node:fs/promises";
+import * as path from "node:path";
+import { z } from "zod";
+import { ShortTermEntrySchema, LessonEntrySchema, RetentionConfigSchema, } from "../types/memory-lifecycle.js";
+import { atomicWriteAsync, readJsonFileAsync, getDataFile, generateId, getDirectorySizeAsync, getRetentionLimit, } from "./memory-persistence.js";
+import { extractPatterns, distillLessons, validateCompressionQuality, storeLessonsLongTerm, updateStatistics, removeFromIndex, archiveOldestLongTermEntries, } from "./memory-phases.js";
+// ─── compressionDelay ───
+/**
+ * Compute the effective retention period for a goal/dimension combination.
+ *
+ * If DriveScorer is available:
+ *   dissatisfaction > 0.7 → retention_period * 2.0
+ *   dissatisfaction > 0.4 → retention_period * 1.5
+ *   otherwise             → retention_period
+ * If no DriveScorer → retention_period (unchanged).
+ */
+export function compressionDelay(deps, goalId, dimension) {
+    const retentionPeriod = getRetentionLimit(deps.config, goalId);
+    if (!deps.driveScorer) {
+        return retentionPeriod;
+    }
+    const dissatisfaction = deps.driveScorer.getDissatisfactionScore(dimension);
+    if (dissatisfaction > 0.7) {
+        return retentionPeriod * 2.0;
+    }
+    else if (dissatisfaction > 0.4) {
+        return retentionPeriod * 1.5;
+    }
+    return retentionPeriod;
+}
+// ─── compressToLongTerm ───
+/**
+ * Compress short-term entries to long-term using LLM-based pattern extraction.
+ * Never deletes short-term data if LLM compression fails.
+ */
+export async function compressToLongTerm(deps, goalId, dataType) {
+    const now = new Date().toISOString();
+    const dataFile = getDataFile(deps.memoryDir, goalId, dataType);
+    const allEntries = (await readJsonFileAsync(dataFile, z.array(ShortTermEntrySchema))) ?? [];
+    // Determine the retention limit for this goal
+    const retentionLimit = getRetentionLimit(deps.config, goalId);
+    // Find entries eligible for compression (loop_number exceeds retention limit)
+    const maxLoopNumber = allEntries.reduce((max, e) => Math.max(max, e.loop_number), 0);
+    const cutoffLoop = maxLoopNumber - retentionLimit;
+    const expiredEntries = allEntries.filter((e) => e.loop_number <= cutoffLoop);
+    if (expiredEntries.length === 0) {
+        return {
+            goal_id: goalId,
+            data_type: dataType,
+            entries_compressed: 0,
+            lessons_generated: 0,
+            statistics_updated: false,
+            quality_check: {
+                passed: true,
+                failure_coverage_ratio: 1,
+                contradictions_found: 0,
+            },
+            compressed_at: now,
+        };
+    }
+    let lessons = [];
+    let qualityCheck = {
+        passed: false,
+        failure_coverage_ratio: 0,
+        contradictions_found: 0,
+    };
+    try {
+        // Step 1: Extract patterns from entries
+        const patterns = await extractPatterns(deps.llmClient, expiredEntries);
+        // Step 2: Distill lessons from patterns
+        const rawLessons = await distillLessons(deps.llmClient, patterns, expiredEntries);
+        // Attach metadata to each lesson
+        const sourceLoops = expiredEntries.map((e) => `loop_${e.loop_number}`);
+        lessons = rawLessons.map((l) => LessonEntrySchema.parse({
+            ...l,
+            lesson_id: generateId("lesson"),
+            goal_id: goalId,
+            source_loops: sourceLoops,
+            extracted_at: now,
+            status: "active",
+            superseded_by: undefined,
+        }));
+        // Step 3: Quality check
+        qualityCheck = validateCompressionQuality(lessons, expiredEntries);
+        if (!qualityCheck.passed) {
+            // Quality check failed — do NOT delete short-term data
+            return {
+                goal_id: goalId,
+                data_type: dataType,
+                entries_compressed: 0,
+                lessons_generated: 0,
+                statistics_updated: false,
+                quality_check: {
+                    passed: false,
+                    failure_coverage_ratio: qualityCheck.failure_coverage_ratio,
+                    contradictions_found: qualityCheck.contradictions_found,
+                },
+                compressed_at: now,
+            };
+        }
+        // Step 4: Store lessons in long-term (by-goal, by-dimension, global)
+        await storeLessonsLongTerm(deps.memoryDir, goalId, lessons, expiredEntries);
+        // Phase 2 (5.2c): Auto-register lesson entries in VectorIndex
+        if (deps.vectorIndex) {
+            for (const lesson of lessons) {
+                const lessonText = `${lesson.type}: ${lesson.context}. ${lesson.lesson}`;
+                deps.vectorIndex
+                    .add(lesson.lesson_id, lessonText, {
+                    goal_id: goalId,
+                    is_lesson: true,
+                    lesson_type: lesson.type,
+                })
+                    .catch(() => {
+                    // Non-fatal: embedding failures are ignored
+                });
+            }
+        }
+        // Step 5: Update statistics
+        updateStatistics(deps.memoryDir, goalId, expiredEntries);
+        // Step 6: Purge compressed short-term entries (only if compression succeeded)
+        const compressedIds = new Set(expiredEntries.map((e) => e.id));
+        const remaining = allEntries.filter((e) => !compressedIds.has(e.id));
+        await atomicWriteAsync(dataFile, remaining);
+        // Remove purged entries from the short-term index
+        await removeFromIndex(deps.memoryDir, "short-term", compressedIds);
+    }
+    catch {
+        // LLM failure — never delete short-term data
+        return {
+            goal_id: goalId,
+            data_type: dataType,
+            entries_compressed: 0,
+            lessons_generated: 0,
+            statistics_updated: false,
+            quality_check: {
+                passed: false,
+                failure_coverage_ratio: 0,
+                contradictions_found: 0,
+            },
+            compressed_at: now,
+        };
+    }
+    return {
+        goal_id: goalId,
+        data_type: dataType,
+        entries_compressed: expiredEntries.length,
+        lessons_generated: lessons.length,
+        statistics_updated: true,
+        quality_check: {
+            passed: qualityCheck.passed,
+            failure_coverage_ratio: qualityCheck.failure_coverage_ratio,
+            contradictions_found: qualityCheck.contradictions_found,
+        },
+        compressed_at: now,
+    };
+}
+// ─── compressAllRemainingToLongTerm ───
+/**
+ * Force-compress all remaining entries to long-term (used on goal close).
+ */
+export async function compressAllRemainingToLongTerm(deps, goalId, dataType, entries) {
+    if (entries.length === 0)
+        return;
+    const now = new Date().toISOString();
+    const patterns = await extractPatterns(deps.llmClient, entries);
+    const rawLessons = await distillLessons(deps.llmClient, patterns, entries);
+    const sourceLoops = entries.map((e) => `loop_${e.loop_number}`);
+    const lessons = rawLessons.map((l) => LessonEntrySchema.parse({
+        ...l,
+        lesson_id: generateId("lesson"),
+        goal_id: goalId,
+        source_loops: sourceLoops,
+        extracted_at: now,
+        status: "active",
+        superseded_by: undefined,
+    }));
+    await storeLessonsLongTerm(deps.memoryDir, goalId, lessons, entries);
+    updateStatistics(deps.memoryDir, goalId, entries);
+    void dataType; // type info available for future audit logging
+}
+// ─── applyRetentionPolicy ───
+/**
+ * Apply retention policy — check each data type and trigger compression if needed.
+ * Phase 2 (5.2a): uses compressionDelay() per dimension for drive-based retention.
+ */
+export async function applyRetentionPolicy(deps, goalId) {
+    const dataTypes = [
+        "experience_log",
+        "observation",
+        "strategy",
+        "task",
+        "knowledge",
+    ];
+    const results = [];
+    for (const dataType of dataTypes) {
+        const dataFile = getDataFile(deps.memoryDir, goalId, dataType);
+        try {
+            await fsp.access(dataFile);
+        }
+        catch {
+            continue;
+        }
+        const entries = (await readJsonFileAsync(dataFile, z.array(ShortTermEntrySchema))) ?? [];
+        if (entries.length === 0)
+            continue;
+        const maxLoopNumber = entries.reduce((max, e) => Math.max(max, e.loop_number), 0);
+        const minLoopNumber = entries.reduce((min, e) => Math.min(min, e.loop_number), Infinity);
+        // Phase 2 (5.2a): compute effective retention limit using drive-based delay.
+        // Use the dimensions present in the entries to find the most conservative (highest) delay.
+        const allDimensions = [...new Set(entries.flatMap((e) => e.dimensions))];
+        let effectiveRetentionLimit;
+        if (allDimensions.length > 0 && deps.driveScorer) {
+            // Take the maximum delay across all dimensions (most conservative = longest retention)
+            effectiveRetentionLimit = Math.max(...allDimensions.map((dim) => compressionDelay(deps, goalId, dim)));
+        }
+        else {
+            effectiveRetentionLimit = getRetentionLimit(deps.config, goalId);
+        }
+        // Check for early compression candidates — reduce retention limit if any dimension is satisfied
+        const earlyDims = deps.earlyCompressionCandidates.get(goalId);
+        if (earlyDims && allDimensions.some(d => earlyDims.has(d))) {
+            effectiveRetentionLimit = Math.min(effectiveRetentionLimit, Math.floor(getRetentionLimit(deps.config, goalId) * 0.5));
+        }
+        // Trigger compression if span of loops exceeds effective retention limit
+        if (maxLoopNumber - minLoopNumber >= effectiveRetentionLimit) {
+            const result = await compressToLongTerm(deps, goalId, dataType);
+            results.push(result);
+        }
+    }
+    return results;
+}
+// ─── runGarbageCollection ───
+/**
+ * Run garbage collection to enforce size limits.
+ * Short-term: 10MB per goal (default). Long-term: 100MB total (default).
+ */
+export async function runGarbageCollection(deps) {
+    const shortTermGoalsDir = path.join(deps.memoryDir, "short-term", "goals");
+    try {
+        await fsp.access(shortTermGoalsDir);
+    }
+    catch {
+        return;
+    }
+    const goalDirs = (await fsp.readdir(shortTermGoalsDir, { withFileTypes: true }))
+        .filter((d) => d.isDirectory())
+        .map((d) => d.name);
+    const shortTermLimitBytes = deps.config.size_limits.short_term_per_goal_mb * 1024 * 1024;
+    // Check short-term size per goal
+    for (const goalId of goalDirs) {
+        const goalDir = path.join(shortTermGoalsDir, goalId);
+        const size = await getDirectorySizeAsync(goalDir);
+        if (size > shortTermLimitBytes) {
+            // Trigger early compression for all data types
+            const dataTypes = [
+                "experience_log",
+                "observation",
+                "strategy",
+                "task",
+                "knowledge",
+            ];
+            for (const dataType of dataTypes) {
+                try {
+                    await compressToLongTerm(deps, goalId, dataType);
+                }
+                catch {
+                    // Compression failure is non-fatal for GC
+                }
+            }
+        }
+    }
+    // Check long-term total size
+    const longTermDir = path.join(deps.memoryDir, "long-term");
+    try {
+        await fsp.access(longTermDir);
+        const longTermSize = await getDirectorySizeAsync(longTermDir);
+        const longTermLimitBytes = deps.config.size_limits.long_term_total_mb * 1024 * 1024;
+        if (longTermSize > longTermLimitBytes) {
+            // Archive oldest (by last_accessed) lessons from long-term index
+            await archiveOldestLongTermEntries(deps.memoryDir);
+        }
+    }
+    catch {
+        // longTermDir doesn't exist, nothing to do
+    }
+}
+// Re-export RetentionConfigSchema for convenience
+export { RetentionConfigSchema };
+//# sourceMappingURL=memory-compression.js.map

package/dist/knowledge/memory-compression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-compression.js","sourceRoot":"","sources":["../../src/knowledge/memory-compression.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,GAAG,MAAM,kBAAkB,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,8BAA8B,CAAC;AAStC,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,eAAe,EACf,cAAc,EACd,0BAA0B,EAC1B,oBAAoB,EACpB,gBAAgB,EAChB,eAAe,EACf,4BAA4B,GAC7B,MAAM,oBAAoB,CAAC;AAa5B,2BAA2B;AAE3B;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAA2D,EAC3D,MAAc,EACd,SAAiB;IAEjB,MAAM,eAAe,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/D,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACtB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;IAE5E,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC;QAC1B,OAAO,eAAe,GAAG,GAAG,CAAC;IAC/B,CAAC;SAAM,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC;QACjC,OAAO,eAAe,GAAG,GAAG,CAAC;IAC/B,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,6BAA6B;AAE7B;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAA2B,EAC3B,MAAc,EACd,QAAwB;IAExB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC/D,MAAM,UAAU,GACd,CAAC,MAAM,iBAAiB,CACtB,QAAQ,EACR,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC,IAAI,EAAE,CAAC;IAEX,8CAA8C;IAC9C,MAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE9D,8EAA8E;IAC9E,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CACrC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,WAAW,CAAC,EACxC,CAAC,CACF,CAAC;IACF,MAAM,UAAU,GAAG,aAAa,GAAG,cAAc,CAAC;IAClD,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,UAAU,CACnC,CAAC;IAEF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,QAAQ;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,CAAC;YACpB,kBAAkB,EAAE,KAAK;YACzB,aAAa,EAAE;gBACb,MAAM,EAAE,IAAI;gBACZ,sBAAsB,EAAE,CAAC;gBACzB,oBAAoB,EAAE,CAAC;aACxB;YACD,aAAa,EAAE,GAAG;SACnB,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,GAAkB,EAAE,CAAC;IAChC,IAAI,YAAY,GAIZ;QACF,MAAM,EAAE,KAAK;QACb,sBAAsB,EAAE,CAAC;QACzB,oBAAoB,EAAE,CAAC;KACxB,CAAC;IAEF,IAAI,CAAC;QACH,wCAAwC;QACxC,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAEvE,wCAAwC;QACxC,MAAM,UAAU,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAElF,iCAAiC;QACjC,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACvE,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7B,iBAAiB,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC;YACJ,SAAS,EAAE,UAAU,CAAC,QAAQ,CAAC;YAC/B,OAAO,EAAE,MAAM;YACf,YAAY,EAAE,WAAW;YACzB,YAAY,EAAE,GAAG;YACjB,MAAM,EAAE,QAAQ;YAChB,aAAa,EAAE,SAAS;SACzB,CAAC,CACH,CAAC;QAEF,wBAAwB;QACxB,YAAY,GAAG,0BAA0B,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;QAEnE,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;YACzB,uDAAuD;YACvD,OAAO;gBACL,OAAO,EAAE,MAAM;gBACf,SAAS,EAAE,QAAQ;gBACnB,kBAAkB,EAAE,CAAC;gBACrB,iBAAiB,EAAE,CAAC;gBACpB,kBAAkB,EAAE,KAAK;gBACzB,aAAa,EAAE;oBACb,MAAM,EAAE,KAAK;oBACb,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;oBAC3D,oBAAoB,EAAE,YAAY,CAAC,oBAAoB;iBACxD;gBACD,aAAa,EAAE,GAAG;aACnB,CAAC;QACJ,CAAC;QAED,qEAAqE;QACrE,MAAM,oBAAoB,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAE5E,8DAA8D;QAC9D,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,OAAO,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBACzE,IAAI,CAAC,WAAW;qBACb,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,EAAE;oBACjC,OAAO,EAAE,MAAM;oBACf,SAAS,EAAE,IAAI;oBACf,WAAW,EAAE,MAAM,CAAC,IAAI;iBACzB,CAAC;qBACD,KAAK,CAAC,GAAG,EAAE;oBACV,4CAA4C;gBAC9C,CAAC,CAAC,CAAC;YACP,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;QAEzD,8EAA8E;QAC9E,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE5C,kDAAkD;QAClD,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;IACrE,CAAC;IAAC,MAAM,CAAC;QACP,6CAA6C;QAC7C,OAAO;YACL,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,QAAQ;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,CAAC;YACpB,kBAAkB,EAAE,KAAK;YACzB,aAAa,EAAE;gBACb,MAAM,EAAE,KAAK;gBACb,sBAAsB,EAAE,CAAC;gBACzB,oBAAoB,EAAE,CAAC;aACxB;YACD,aAAa,EAAE,GAAG;SACnB,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,MAAM;QACf,SAAS,EAAE,QAAQ;QACnB,kBAAkB,EAAE,cAAc,CAAC,MAAM;QACzC,iBAAiB,EAAE,OAAO,CAAC,MAAM;QACjC,kBAAkB,EAAE,IAAI;QACxB,aAAa,EAAE;YACb,MAAM,EAAE,YAAY,CAAC,MAAM;YAC3B,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;YAC3D,oBAAoB,EAAE,YAAY,CAAC,oBAAoB;SACxD;QACD,aAAa,EAAE,GAAG;KACnB,CAAC;AACJ,CAAC;AAED,yCAAyC;AAEzC;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAClD,IAA4D,EAC5D,MAAc,EACd,QAAwB,EACxB,OAAyB;IAEzB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAEhE,MAAM,OAAO,GAAkB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClD,iBAAiB,CAAC,KAAK,CAAC;QACtB,GAAG,CAAC;QACJ,SAAS,EAAE,UAAU,CAAC,QAAQ,CAAC;QAC/B,OAAO,EAAE,MAAM;QACf,YAAY,EAAE,WAAW;QACzB,YAAY,EAAE,GAAG;QACjB,MAAM,EAAE,QAAQ;QAChB,aAAa,EAAE,SAAS;KACzB,CAAC,CACH,CAAC;IAEF,MAAM,oBAAoB,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAElD,KAAK,QAAQ,CAAC,CAAC,+CAA+C;AAChE,CAAC;AAED,+BAA+B;AAE/B;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAA2B,EAC3B,MAAc;IAEd,MAAM,SAAS,GAAqB;QAClC,gBAAgB;QAChB,aAAa;QACb,UAAU;QACV,MAAM;QACN,WAAW;KACZ,CAAC;IAEF,MAAM,OAAO,GAAwB,EAAE,CAAC;IAExC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC/D,IAAI,CAAC;YAAC,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;QAEvD,MAAM,OAAO,GACX,CAAC,MAAM,iBAAiB,CACtB,QAAQ,EACR,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC,IAAI,EAAE,CAAC;QAEX,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEnC,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,WAAW,CAAC,EACxC,CAAC,CACF,CAAC;QACF,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,WAAW,CAAC,EACxC,QAAQ,CACT,CAAC;QAEF,6EAA6E;QAC7E,2FAA2F;QAC3F,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,uBAA+B,CAAC;QACpC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACjD,uFAAuF;YACvF,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAChC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CACnE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,uBAAuB,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnE,CAAC;QAED,gGAAgG;QAChG,MAAM,SAAS,GAAG,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9D,IAAI,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3D,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,uBAAuB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACxH,CAAC;QAED,yEAAyE;QACzE,IAAI,aAAa,GAAG,aAAa,IAAI,uBAAuB,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAChE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+BAA+B;AAE/B;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAA2B;IAE3B,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CACjC,IAAI,CAAC,SAAS,EACd,YAAY,EACZ,OAAO,CACR,CAAC;IAEF,IAAI,CAAC;QAAC,MAAM,GAAG,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO;IAAC,CAAC;IAE9D,MAAM,QAAQ,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;SAC7E,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtB,MAAM,mBAAmB,GACvB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,sBAAsB,GAAG,IAAI,GAAG,IAAI,CAAC;IAE/D,iCAAiC;IACjC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,MAAM,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAElD,IAAI,IAAI,GAAG,mBAAmB,EAAE,CAAC;YAC/B,+CAA+C;YAC/C,MAAM,SAAS,GAAqB;gBAClC,gBAAgB;gBAChB,aAAa;gBACb,UAAU;gBACV,MAAM;gBACN,WAAW;aACZ,CAAC;YACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC;oBACH,MAAM,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACnD,CAAC;gBAAC,MAAM,CAAC;oBACP,0CAA0C;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAC3D,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC9B,MAAM,YAAY,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC9D,MAAM,kBAAkB,GACtB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,kBAAkB,GAAG,IAAI,GAAG,IAAI,CAAC;QAE3D,IAAI,YAAY,GAAG,kBAAkB,EAAE,CAAC;YACtC,iEAAiE;YACjE,MAAM,4BAA4B,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,2CAA2C;IAC7C,CAAC;AACH,CAAC;AAED,kDAAkD;AAClD,OAAO,EAAE,qBAAqB,EAAE,CAAC"}

package/dist/knowledge/memory-distill.d.ts

@@ -0,0 +1,31 @@
+import type { ILLMClient } from "../llm/llm-client.js";
+import type { IPromptGateway } from "../prompt/gateway.js";
+import type { ShortTermEntry, LessonEntry } from "../types/memory-lifecycle.js";
+/**
+ * Call LLM to extract recurring patterns from a set of short-term entries.
+ */
+export declare function extractPatterns(llmClient: ILLMClient, entries: ShortTermEntry[], gateway?: IPromptGateway): Promise<string[]>;
+/**
+ * Call LLM to convert extracted patterns into structured LessonEntry objects.
+ */
+export declare function distillLessons(llmClient: ILLMClient, patterns: string[], entries: ShortTermEntry[], gateway?: IPromptGateway): Promise<Array<{
+    type: "strategy_outcome" | "success_pattern" | "failure_pattern";
+    context: string;
+    action?: string;
+    outcome?: string;
+    lesson: string;
+    relevance_tags: string[];
+    failure_reason?: string;
+    avoidance_hint?: string;
+    applicability?: string;
+}>>;
+/**
+ * Validate compression quality.
+ * MVP check: lesson_count >= failure_count * 0.5
+ */
+export declare function validateCompressionQuality(lessons: LessonEntry[], entries: ShortTermEntry[]): {
+    passed: boolean;
+    failure_coverage_ratio: number;
+    contradictions_found: number;
+};
+//# sourceMappingURL=memory-distill.d.ts.map

package/dist/knowledge/memory-distill.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-distill.d.ts","sourceRoot":"","sources":["../../src/knowledge/memory-distill.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AA0BhF;;GAEG;AACH,wBAAsB,eAAe,CACnC,SAAS,EAAE,UAAU,EACrB,OAAO,EAAE,cAAc,EAAE,EACzB,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,MAAM,EAAE,CAAC,CAqDnB;AAED;;GAEG;AACH,wBAAsB,cAAc,CAClC,SAAS,EAAE,UAAU,EACrB,QAAQ,EAAE,MAAM,EAAE,EAClB,OAAO,EAAE,cAAc,EAAE,EACzB,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,KAAK,CAAC;IACf,IAAI,EAAE,kBAAkB,GAAG,iBAAiB,GAAG,iBAAiB,CAAC;IACjE,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB,CAAC,CAAC,CA8EF;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,OAAO,EAAE,WAAW,EAAE,EACtB,OAAO,EAAE,cAAc,EAAE,GACxB;IAAE,MAAM,EAAE,OAAO,CAAC;IAAC,sBAAsB,EAAE,MAAM,CAAC;IAAC,oBAAoB,EAAE,MAAM,CAAA;CAAE,CAyCnF"}

package/dist/knowledge/memory-distill.js

@@ -0,0 +1,170 @@
+import { z } from "zod";
+// ─── LLM response schemas ───
+const PatternExtractionResponseSchema = z.object({
+    patterns: z.array(z.string()),
+});
+const LessonDistillationResponseSchema = z.object({
+    lessons: z.array(z.object({
+        type: z.enum(["strategy_outcome", "success_pattern", "failure_pattern"]),
+        context: z.string(),
+        action: z.string().optional(),
+        outcome: z.string().optional(),
+        lesson: z.string(),
+        relevance_tags: z.array(z.string()).default([]),
+        failure_reason: z.string().optional(),
+        avoidance_hint: z.string().optional(),
+        applicability: z.string().optional(),
+    })),
+});
+// ─── LLM helpers ───
+/**
+ * Call LLM to extract recurring patterns from a set of short-term entries.
+ */
+export async function extractPatterns(llmClient, entries, gateway) {
+    const prompt = `Analyze the following experience log entries and extract recurring patterns, key insights, and lessons learned. Focus on what worked, what failed, and why.
+
+Return a JSON object with a "patterns" array of pattern strings:
+{
+  "patterns": ["pattern 1", "pattern 2", ...]
+}
+
+Entries (${entries.length} total):
+${JSON.stringify(entries.slice(0, 20).map((e) => ({
+        data_type: e.data_type,
+        loop_number: e.loop_number,
+        dimensions: e.dimensions,
+        tags: e.tags,
+        data: e.data,
+    })), null, 2)}`;
+    if (gateway) {
+        try {
+            const parsed = await gateway.execute({
+                purpose: "memory_distill_extract_patterns",
+                additionalContext: { extract_patterns_prompt: prompt },
+                responseSchema: PatternExtractionResponseSchema,
+                maxTokens: 2048,
+            });
+            return parsed.patterns;
+        }
+        catch {
+            return [];
+        }
+    }
+    else {
+        const response = await llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You are a pattern extraction engine. Analyze experience logs and identify recurring patterns, successes, and failures. Respond with JSON only.",
+            max_tokens: 2048,
+        });
+        try {
+            const parsed = llmClient.parseJSON(response.content, PatternExtractionResponseSchema);
+            return parsed.patterns;
+        }
+        catch {
+            return [];
+        }
+    }
+}
+/**
+ * Call LLM to convert extracted patterns into structured LessonEntry objects.
+ */
+export async function distillLessons(llmClient, patterns, entries, gateway) {
+    if (patterns.length === 0)
+        return [];
+    const failureEntries = entries.filter((e) => e.data["status"] === "failed" ||
+        e.data["verdict"] === "fail" ||
+        e.data["outcome"] === "failure");
+    const prompt = `Convert the following patterns into structured lessons. For each pattern, determine if it represents a strategy outcome, success pattern, or failure pattern.
+
+Patterns:
+${patterns.map((p, i) => `${i + 1}. ${p}`).join("\n")}
+
+Failure context (${failureEntries.length} failure entries found):
+${JSON.stringify(failureEntries.slice(0, 5).map((e) => e.data), null, 2)}
+
+Return a JSON object with a "lessons" array:
+{
+  "lessons": [
+    {
+      "type": "strategy_outcome" | "success_pattern" | "failure_pattern",
+      "context": "what situation this lesson applies to",
+      "action": "what action was taken (optional)",
+      "outcome": "what result occurred (optional)",
+      "lesson": "the key lesson learned",
+      "relevance_tags": ["tag1", "tag2"],
+      "failure_reason": "why it failed (for failure_pattern only)",
+      "avoidance_hint": "how to avoid next time (for failure_pattern only)",
+      "applicability": "when to apply (for success_pattern only)"
+    }
+  ]
+}`;
+    if (gateway) {
+        try {
+            const parsed = await gateway.execute({
+                purpose: "memory_distill_lessons",
+                additionalContext: { distill_lessons_prompt: prompt },
+                responseSchema: LessonDistillationResponseSchema,
+                maxTokens: 4096,
+            });
+            return parsed.lessons.map((l) => ({
+                ...l,
+                relevance_tags: l.relevance_tags ?? [],
+            }));
+        }
+        catch {
+            return [];
+        }
+    }
+    else {
+        const response = await llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You are a lesson distillation engine. Convert experience patterns into structured, actionable lessons. Respond with JSON only.",
+            max_tokens: 4096,
+        });
+        try {
+            const parsed = llmClient.parseJSON(response.content, LessonDistillationResponseSchema);
+            // Normalize: ensure relevance_tags is always a string[]
+            return parsed.lessons.map((l) => ({
+                ...l,
+                relevance_tags: l.relevance_tags ?? [],
+            }));
+        }
+        catch {
+            return [];
+        }
+    }
+}
+/**
+ * Validate compression quality.
+ * MVP check: lesson_count >= failure_count * 0.5
+ */
+export function validateCompressionQuality(lessons, entries) {
+    // Count failure entries
+    const failureCount = entries.filter((e) => e.data["status"] === "failed" ||
+        e.data["verdict"] === "fail" ||
+        e.data["outcome"] === "failure").length;
+    // MVP ratio check: lessons >= failures * 0.5
+    const lessonCount = lessons.length;
+    const failure_coverage_ratio = failureCount === 0
+        ? 1
+        : Math.min(1, lessonCount / (failureCount * 0.5));
+    const passed = failureCount === 0 || lessonCount >= failureCount * 0.5;
+    // Contradiction detection: check for lessons with opposite type covering same context
+    let contradictions_found = 0;
+    for (let i = 0; i < lessons.length; i++) {
+        for (let j = i + 1; j < lessons.length; j++) {
+            const a = lessons[i];
+            const b = lessons[j];
+            const isOppositeType = (a.type === "success_pattern" && b.type === "failure_pattern") ||
+                (a.type === "failure_pattern" && b.type === "success_pattern");
+            const sharesTag = a.relevance_tags.some((t) => b.relevance_tags.includes(t));
+            if (isOppositeType && sharesTag) {
+                contradictions_found++;
+            }
+        }
+    }
+    return {
+        passed,
+        failure_coverage_ratio,
+        contradictions_found,
+    };
+}
+//# sourceMappingURL=memory-distill.js.map

package/dist/knowledge/memory-distill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-distill.js","sourceRoot":"","sources":["../../src/knowledge/memory-distill.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAKxB,+BAA+B;AAE/B,MAAM,+BAA+B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/C,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CAC9B,CAAC,CAAC;AAEH,MAAM,gCAAgC,GAAG,CAAC,CAAC,MAAM,CAAC;IAChD,OAAO,EAAE,CAAC,CAAC,KAAK,CACd,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;QACxE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;QACnB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC7B,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;QAClB,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/C,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QACrC,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QACrC,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KACrC,CAAC,CACH;CACF,CAAC,CAAC;AAEH,sBAAsB;AAEtB;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,SAAqB,EACrB,OAAyB,EACzB,OAAwB;IAExB,MAAM,MAAM,GAAG;;;;;;;WAON,OAAO,CAAC,MAAM;EACvB,IAAI,CAAC,SAAS,CACd,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;KACb,CAAC,CAAC,EACH,IAAI,EACJ,CAAC,CACF,EAAE,CAAC;IAEF,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBACnC,OAAO,EAAE,iCAAiC;gBAC1C,iBAAiB,EAAE,EAAE,uBAAuB,EAAE,MAAM,EAAE;gBACtD,cAAc,EAAE,+BAA+B;gBAC/C,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;YACH,OAAO,MAAM,CAAC,QAAQ,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,gJAAgJ;YAClJ,UAAU,EAAE,IAAI;SACjB,CACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAChC,QAAQ,CAAC,OAAO,EAChB,+BAA+B,CAChC,CAAC;YACF,OAAO,MAAM,CAAC,QAAQ,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,SAAqB,EACrB,QAAkB,EAClB,OAAyB,EACzB,OAAwB;IAYxB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ;QAC7B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM;QAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,SAAS,CAClC,CAAC;IAEF,MAAM,MAAM,GAAG;;;EAGf,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;mBAElC,cAAc,CAAC,MAAM;EACtC,IAAI,CAAC,SAAS,CACd,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAC7C,IAAI,EACJ,CAAC,CACF;;;;;;;;;;;;;;;;;EAiBC,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBACnC,OAAO,EAAE,wBAAwB;gBACjC,iBAAiB,EAAE,EAAE,sBAAsB,EAAE,MAAM,EAAE;gBACrD,cAAc,EAAE,gCAAgC;gBAChD,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;YACH,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChC,GAAG,CAAC;gBACJ,cAAc,EAAE,CAAC,CAAC,cAAc,IAAI,EAAE;aACvC,CAAC,CAAC,CAAC;QACN,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,gIAAgI;YAClI,UAAU,EAAE,IAAI;SACjB,CACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAChC,QAAQ,CAAC,OAAO,EAChB,gCAAgC,CACjC,CAAC;YACF,wDAAwD;YACxD,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChC,GAAG,CAAC;gBACJ,cAAc,EAAE,CAAC,CAAC,cAAc,IAAI,EAAE;aACvC,CAAC,CAAC,CAAC;QACN,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAsB,EACtB,OAAyB;IAEzB,wBAAwB;IACxB,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CACjC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ;QAC7B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM;QAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,SAAS,CAClC,CAAC,MAAM,CAAC;IAET,6CAA6C;IAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC;IACnC,MAAM,sBAAsB,GAC1B,YAAY,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,MAAM,GACV,YAAY,KAAK,CAAC,IAAI,WAAW,IAAI,YAAY,GAAG,GAAG,CAAC;IAE1D,sFAAsF;IACtF,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACtB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACtB,MAAM,cAAc,GAClB,CAAC,CAAC,CAAC,IAAI,KAAK,iBAAiB,IAAI,CAAC,CAAC,IAAI,KAAK,iBAAiB,CAAC;gBAC9D,CAAC,CAAC,CAAC,IAAI,KAAK,iBAAiB,IAAI,CAAC,CAAC,IAAI,KAAK,iBAAiB,CAAC,CAAC;YACjE,MAAM,SAAS,GAAG,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5C,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAC7B,CAAC;YACF,IAAI,cAAc,IAAI,SAAS,EAAE,CAAC;gBAChC,oBAAoB,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM;QACN,sBAAsB;QACtB,oBAAoB;KACrB,CAAC;AACJ,CAAC"}

package/dist/knowledge/memory-index.d.ts

@@ -0,0 +1,11 @@
+import type { ShortTermEntry, LessonEntry, MemoryIndex, MemoryIndexEntry } from "../types/memory-lifecycle.js";
+export declare function initializeIndex(memoryDir: string, layer: "short-term" | "long-term"): Promise<void>;
+export declare function loadIndex(memoryDir: string, layer: "short-term" | "long-term"): Promise<MemoryIndex>;
+export declare function saveIndex(memoryDir: string, layer: "short-term" | "long-term", index: MemoryIndex): Promise<void>;
+export declare function updateIndex(memoryDir: string, layer: "short-term" | "long-term", entry: MemoryIndexEntry): Promise<void>;
+export declare function removeFromIndex(memoryDir: string, layer: "short-term" | "long-term", entryIds: Set<string>): Promise<void>;
+export declare function removeGoalFromIndex(memoryDir: string, layer: "short-term" | "long-term", goalId: string): Promise<void>;
+export declare function touchIndexEntry(memoryDir: string, layer: "short-term" | "long-term", indexId: string): Promise<void>;
+export declare function archiveOldestLongTermEntries(memoryDir: string): Promise<void>;
+export declare function storeLessonsLongTerm(memoryDir: string, goalId: string, lessons: LessonEntry[], sourceEntries: ShortTermEntry[]): Promise<void>;
+//# sourceMappingURL=memory-index.d.ts.map

package/dist/knowledge/memory-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-index.d.ts","sourceRoot":"","sources":["../../src/knowledge/memory-index.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACX,WAAW,EACX,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAKtC,wBAAsB,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,GAAG,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAazG;AAED,wBAAsB,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,GAAG,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAW1G;AAED,wBAAsB,SAAS,CAC7B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAAG,WAAW,EACjC,KAAK,EAAE,WAAW,GACjB,OAAO,CAAC,IAAI,CAAC,CAaf;AAED,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAAG,WAAW,EACjC,KAAK,EAAE,gBAAgB,GACtB,OAAO,CAAC,IAAI,CAAC,CAIf;AAED,wBAAsB,eAAe,CACnC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAAG,WAAW,EACjC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,GACpB,OAAO,CAAC,IAAI,CAAC,CAMf;AAED,wBAAsB,mBAAmB,CACvC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAAG,WAAW,EACjC,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CAIf;AAED,wBAAsB,eAAe,CACnC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAAG,WAAW,EACjC,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,IAAI,CAAC,CAUf;AAED,wBAAsB,4BAA4B,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAoBnF;AAID,wBAAsB,oBAAoB,CACxC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,WAAW,EAAE,EACtB,aAAa,EAAE,cAAc,EAAE,GAC9B,OAAO,CAAC,IAAI,CAAC,CAyEf"}