pulseed 0.4.17 → 0.4.19

package/dist/platform/knowledge/memory/memory-stats.js

@@ -0,0 +1,162 @@
+import * as path from "node:path";
+import { StatisticalSummarySchema } from "../../../base/types/memory-lifecycle.js";
+import { atomicWriteAsync, readJsonFileAsync } from "./memory-persistence.js";
+// ─── Statistics ───
+export async function updateStatistics(memoryDir, goalId, entries) {
+    const statsPath = path.join(memoryDir, "long-term", "statistics", `${goalId}.json`);
+    const now = new Date().toISOString();
+    // Load existing or create fresh
+    const existing = await readJsonFileAsync(statsPath, StatisticalSummarySchema);
+    // Compute task statistics from task entries
+    const taskEntries = entries.filter((e) => e.data_type === "task");
+    const taskCategoryMap = new Map();
+    for (const entry of taskEntries) {
+        const category = typeof entry.data["task_category"] === "string"
+            ? entry.data["task_category"]
+            : "unknown";
+        const status = typeof entry.data["status"] === "string" ? entry.data["status"] : "";
+        const durationHours = typeof entry.data["duration_hours"] === "number"
+            ? entry.data["duration_hours"]
+            : 0;
+        const current = taskCategoryMap.get(category) ?? {
+            total: 0,
+            success: 0,
+            durations: [],
+        };
+        current.total++;
+        if (status === "completed")
+            current.success++;
+        if (durationHours > 0)
+            current.durations.push(durationHours);
+        taskCategoryMap.set(category, current);
+    }
+    const taskStats = Array.from(taskCategoryMap.entries()).map(([category, stats]) => ({
+        task_category: category,
+        goal_id: goalId,
+        stats: {
+            total_count: stats.total,
+            success_rate: stats.total > 0 ? stats.success / stats.total : 0,
+            avg_duration_hours: stats.durations.length > 0
+                ? stats.durations.reduce((a, b) => a + b, 0) /
+                    stats.durations.length
+                : 0,
+            common_failure_reason: undefined,
+        },
+        period: computePeriod(entries),
+        updated_at: now,
+    }));
+    // Compute dimension statistics from observation entries
+    const observationEntries = entries.filter((e) => e.data_type === "observation");
+    const dimMap = new Map();
+    for (const entry of observationEntries) {
+        for (const dim of entry.dimensions) {
+            const value = typeof entry.data["value"] === "number" ? entry.data["value"] : null;
+            if (value !== null) {
+                const arr = dimMap.get(dim) ?? [];
+                arr.push(value);
+                dimMap.set(dim, arr);
+            }
+        }
+    }
+    const dimensionStats = Array.from(dimMap.entries())
+        .filter(([, values]) => values.length > 0)
+        .map(([dim, values]) => {
+        const avg = values.reduce((a, b) => a + b, 0) / values.length;
+        const variance = values.reduce((sum, v) => sum + Math.pow(v - avg, 2), 0) /
+            values.length;
+        const stdDev = Math.sqrt(variance);
+        const trend = computeTrend(values);
+        return {
+            dimension_name: dim,
+            goal_id: goalId,
+            stats: {
+                avg_value: avg,
+                std_deviation: stdDev,
+                trend,
+                anomaly_frequency: 0,
+                observation_count: values.length,
+            },
+            period: computePeriod(entries),
+            updated_at: now,
+        };
+    });
+    // Overall stats
+    const totalLoops = entries.length > 0
+        ? (entries[entries.length - 1]?.loop_number ?? 0) -
+            (entries[0]?.loop_number ?? 0) +
+            1
+        : 0;
+    const totalTasks = taskEntries.length;
+    const successfulTasks = taskEntries.filter((e) => e.data["status"] === "completed").length;
+    const overallSuccessRate = totalTasks > 0 ? successfulTasks / totalTasks : 0;
+    // Merge with existing stats
+    const mergedTaskStats = mergeTaskStats(existing?.task_stats ?? [], taskStats);
+    const mergedDimStats = mergeDimStats(existing?.dimension_stats ?? [], dimensionStats);
+    const summary = StatisticalSummarySchema.parse({
+        goal_id: goalId,
+        task_stats: mergedTaskStats,
+        dimension_stats: mergedDimStats,
+        overall: {
+            total_loops: (existing?.overall.total_loops ?? 0) + totalLoops,
+            total_tasks: (existing?.overall.total_tasks ?? 0) + totalTasks,
+            overall_success_rate: overallSuccessRate,
+            active_period: computePeriod(entries),
+        },
+        updated_at: now,
+    });
+    await atomicWriteAsync(statsPath, summary);
+}
+export function mergeTaskStats(existing, incoming) {
+    const map = new Map(existing.map((s) => [s.task_category, s]));
+    for (const inc of incoming) {
+        const prev = map.get(inc.task_category);
+        if (!prev) {
+            map.set(inc.task_category, inc);
+            continue;
+        }
+        const totalCount = prev.stats.total_count + inc.stats.total_count;
+        const prevSuccess = prev.stats.success_rate * prev.stats.total_count;
+        const incSuccess = inc.stats.success_rate * inc.stats.total_count;
+        map.set(inc.task_category, {
+            ...inc,
+            stats: {
+                total_count: totalCount,
+                success_rate: totalCount > 0 ? (prevSuccess + incSuccess) / totalCount : 0,
+                avg_duration_hours: (prev.stats.avg_duration_hours + inc.stats.avg_duration_hours) / 2,
+                common_failure_reason: inc.stats.common_failure_reason,
+            },
+        });
+    }
+    return Array.from(map.values());
+}
+export function mergeDimStats(existing, incoming) {
+    const map = new Map(existing.map((s) => [s.dimension_name, s]));
+    for (const inc of incoming) {
+        map.set(inc.dimension_name, inc); // Replace with latest computation
+    }
+    return Array.from(map.values());
+}
+export function computeTrend(values) {
+    if (values.length < 2)
+        return "stable";
+    const first = values.slice(0, Math.floor(values.length / 2));
+    const second = values.slice(Math.floor(values.length / 2));
+    const avgFirst = first.reduce((a, b) => a + b, 0) / first.length;
+    const avgSecond = second.reduce((a, b) => a + b, 0) / second.length;
+    const delta = avgSecond - avgFirst;
+    const threshold = Math.abs(avgFirst) * 0.05; // 5% change threshold
+    if (delta > threshold)
+        return "rising";
+    if (delta < -threshold)
+        return "falling";
+    return "stable";
+}
+export function computePeriod(entries) {
+    if (entries.length === 0)
+        return "unknown";
+    const timestamps = entries.map((e) => e.timestamp).sort();
+    const first = timestamps[0]?.slice(0, 10) ?? "unknown";
+    const last = timestamps[timestamps.length - 1]?.slice(0, 10) ?? "unknown";
+    return first === last ? first : `${first} to ${last}`;
+}
+//# sourceMappingURL=memory-stats.js.map

package/dist/platform/knowledge/memory/memory-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-stats.js","sourceRoot":"","sources":["../../../../src/platform/knowledge/memory/memory-stats.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,wBAAwB,EAAE,MAAM,yCAAyC,CAAC;AAKnF,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAE9E,qBAAqB;AAErB,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,SAAiB,EACjB,MAAc,EACd,OAAyB;IAEzB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CACzB,SAAS,EACT,WAAW,EACX,YAAY,EACZ,GAAG,MAAM,OAAO,CACjB,CAAC;IACF,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,gCAAgC;IAChC,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,SAAS,EACT,wBAAwB,CACzB,CAAC;IAEF,4CAA4C;IAC5C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,IAAI,GAAG,EAG5B,CAAC;IAEJ,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,MAAM,QAAQ,GACZ,OAAO,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,QAAQ;YAC7C,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC;YAC7B,CAAC,CAAC,SAAS,CAAC;QAChB,MAAM,MAAM,GACV,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,MAAM,aAAa,GACjB,OAAO,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,QAAQ;YAC9C,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC;YAC9B,CAAC,CAAC,CAAC,CAAC;QAER,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;YAC/C,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,EAAE;SACd,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,IAAI,MAAM,KAAK,WAAW;YAAE,OAAO,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAI,aAAa,GAAG,CAAC;YAAE,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7D,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CACzD,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACtB,aAAa,EAAE,QAAQ;QACvB,OAAO,EAAE,MAAM;QACf,KAAK,EAAE;YACL,WAAW,EAAE,KAAK,CAAC,KAAK;YACxB,YAAY,EACV,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,kBAAkB,EAChB,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;gBACxB,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC1C,KAAK,CAAC,SAAS,CAAC,MAAM;gBACxB,CAAC,CAAC,CAAC;YACP,qBAAqB,EAAE,SAAS;SACjC;QACD,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC;QAC9B,UAAU,EAAE,GAAG;KAChB,CAAC,CACH,CAAC;IAEF,wDAAwD;IACxD,MAAM,kBAAkB,GAAG,OAAO,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,aAAa,CACrC,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,KAAK,IAAI,kBAAkB,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACnC,MAAM,KAAK,GACT,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACvE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAClC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SAChD,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9D,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC;QAChB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO;YACL,cAAc,EAAE,GAAG;YACnB,OAAO,EAAE,MAAM;YACf,KAAK,EAAE;gBACL,SAAS,EAAE,GAAG;gBACd,aAAa,EAAE,MAAM;gBACrB,KAAK;gBACL,iBAAiB,EAAE,CAAC;gBACpB,iBAAiB,EAAE,MAAM,CAAC,MAAM;aACjC;YACD,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC;YAC9B,UAAU,EAAE,GAAG;SAChB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEL,gBAAgB;IAChB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;QACnC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,WAAW,IAAI,CAAC,CAAC;YAC/C,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,IAAI,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CAAC,CAAC,CAAC;IACN,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC;IACtC,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,WAAW,CACxC,CAAC,MAAM,CAAC;IACT,MAAM,kBAAkB,GACtB,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,4BAA4B;IAC5B,MAAM,eAAe,GAAG,cAAc,CACpC,QAAQ,EAAE,UAAU,IAAI,EAAE,EAC1B,SAAS,CACV,CAAC;IACF,MAAM,cAAc,GAAG,aAAa,CAClC,QAAQ,EAAE,eAAe,IAAI,EAAE,EAC/B,cAAc,CACf,CAAC;IAEF,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,CAAC;QAC7C,OAAO,EAAE,MAAM;QACf,UAAU,EAAE,eAAe;QAC3B,eAAe,EAAE,cAAc;QAC/B,OAAO,EAAE;YACP,WAAW,EACT,CAAC,QAAQ,EAAE,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,UAAU;YACnD,WAAW,EACT,CAAC,QAAQ,EAAE,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,UAAU;YACnD,oBAAoB,EAAE,kBAAkB;YACxC,aAAa,EAAE,aAAa,CAAC,OAAO,CAAC;SACtC;QACD,UAAU,EAAE,GAAG;KAChB,CAAC,CAAC;IAEH,MAAM,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,QAA0C,EAC1C,QAA0C;IAE1C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAChC,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;QACrE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC;QAClE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,EAAE;YACzB,GAAG,GAAG;YACN,KAAK,EAAE;gBACL,WAAW,EAAE,UAAU;gBACvB,YAAY,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC1E,kBAAkB,EAChB,CAAC,IAAI,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC;gBACpE,qBAAqB,EAAE,GAAG,CAAC,KAAK,CAAC,qBAAqB;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,QAA+C,EAC/C,QAA+C;IAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,kCAAkC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,MAAgB;IAEhB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACjE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACpE,MAAM,KAAK,GAAG,SAAS,GAAG,QAAQ,CAAC;IACnC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC,sBAAsB;IACnE,IAAI,KAAK,GAAG,SAAS;QAAE,OAAO,QAAQ,CAAC;IACvC,IAAI,KAAK,GAAG,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,OAAyB;IACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1D,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC;IACvD,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC;IAC1E,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,OAAO,IAAI,EAAE,CAAC;AACxD,CAAC"}

package/dist/platform/knowledge/memory/memory-tier.d.ts

@@ -0,0 +1,65 @@
+import type { ShortTermEntry, MemoryIndexEntry, MemoryTier, TierBudget } from "../../../base/types/memory-lifecycle.js";
+/**
+ * Classify a memory entry into a tier based on its goal membership and recency.
+ *
+ * - core:     active goal + core data type + recent (last 5 loops / 5 hours)
+ * - recall:   active goal (other data types, or older)
+ * - archival: completed goal OR not in any tracked goal
+ *
+ * Optional promotion/demotion params:
+ * - satisfiedDimensions: if all entry dimensions are satisfied, demote core→recall
+ * - highDissatisfactionDimensions: if any entry dimension is highly dissatisfied, promote recall→core
+ */
+export declare function classifyTier(entry: ShortTermEntry | MemoryIndexEntry, activeGoalIds: string[], completedGoalIds: string[], satisfiedDimensions?: string[], highDissatisfactionDimensions?: string[]): MemoryTier;
+/**
+ * Sort entries: core first, then recall, then archival.
+ * Within the same tier, preserve original order (stable).
+ */
+export declare function sortByTier(entries: MemoryIndexEntry[]): MemoryIndexEntry[];
+/**
+ * Compute tier budget based on max dissatisfaction score.
+ * Higher dissatisfaction → more budget for core tier.
+ */
+export declare function computeDynamicBudget(maxDissatisfaction: number): TierBudget;
+/**
+ * Apply per-tier count limits from a TierBudget.
+ *
+ * TierBudget values are fractions [0, 1] of the total entry count.
+ * Converts fractions to absolute counts based on entries.length.
+ * At minimum, each tier gets Math.ceil(fraction * total) slots.
+ *
+ * Core entries are guaranteed first (up to their count limit),
+ * then recall, then archival.
+ * Entries are expected to already be sorted (sortByTier).
+ */
+export declare function filterByTierBudget(entries: MemoryIndexEntry[], budget: TierBudget): MemoryIndexEntry[];
+/**
+ * Dissatisfaction drive: delay compression up to 2x for high-dissatisfaction dimensions.
+ * For each dimension, if dissatisfaction > 0.7, delay_factor = 1 + dissatisfaction (max 2.0).
+ * Returns map of dimension -> delay_factor.
+ */
+export declare function getCompressionDelay(driveScores: Array<{
+    dimension: string;
+    dissatisfaction: number;
+}>): Map<string, number>;
+/**
+ * Deadline drive: boost Working Memory priority up to 30%.
+ * For each dimension, bonus = min(deadline * 0.3, 0.3).
+ * Returns map of dimension -> bonus_factor.
+ */
+export declare function getDeadlineBonus(driveScores: Array<{
+    dimension: string;
+    deadline: number;
+}>): Map<string, number>;
+/**
+ * Use an LLM to classify entry tiers based on active goal context.
+ * Falls back to rule-based classifyTier on any error.
+ */
+export declare function llmClassifyTier(entries: MemoryIndexEntry[], activeGoalContext: {
+    goalId: string;
+    dimensions: string[];
+    gap?: number;
+}, llmClient: {
+    generateStructured: (...args: any[]) => Promise<any>;
+}): Promise<Map<string, MemoryTier>>;
+//# sourceMappingURL=memory-tier.d.ts.map

package/dist/platform/knowledge/memory/memory-tier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-tier.d.ts","sourceRoot":"","sources":["../../../../src/platform/knowledge/memory/memory-tier.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,cAAc,EACd,gBAAgB,EAChB,UAAU,EACV,UAAU,EACX,MAAM,yCAAyC,CAAC;AAuBjD;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,cAAc,GAAG,gBAAgB,EACxC,aAAa,EAAE,MAAM,EAAE,EACvB,gBAAgB,EAAE,MAAM,EAAE,EAC1B,mBAAmB,CAAC,EAAE,MAAM,EAAE,EAC9B,6BAA6B,CAAC,EAAE,MAAM,EAAE,GACvC,UAAU,CAsCZ;AA8CD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,gBAAgB,EAAE,CAU1E;AAID;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,kBAAkB,EAAE,MAAM,GAAG,UAAU,CAI3E;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,gBAAgB,EAAE,EAC3B,MAAM,EAAE,UAAU,GACjB,gBAAgB,EAAE,CA4BpB;AAID;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,KAAK,CAAC;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,CAAC,GACjE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAWrB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,KAAK,CAAC;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,GAC1D,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAMrB;AAaD;;;GAGG;AACH,wBAAsB,eAAe,CACnC,OAAO,EAAE,gBAAgB,EAAE,EAC3B,iBAAiB,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,EACzE,SAAS,EAAE;IAAE,kBAAkB,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;CAAE,GAClE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CA0ClC"}

package/dist/platform/knowledge/memory/memory-tier.js

@@ -0,0 +1,243 @@
+import { z } from "zod";
+// ─── Constants ───
+/** How many hours ago counts as "recent" for MemoryIndexEntry (no loop_number). */
+const RECENT_HOURS = 5;
+/** How many loops ago counts as "recent" for ShortTermEntry core classification. */
+const RECENT_LOOPS = 5;
+/** Core-eligible data types for ShortTermEntry. */
+const CORE_DATA_TYPES = new Set(["observation", "strategy"]);
+// ─── Type guard ───
+function isShortTermEntry(entry) {
+    return "loop_number" in entry && "data_type" in entry;
+}
+// ─── classifyTier ───
+/**
+ * Classify a memory entry into a tier based on its goal membership and recency.
+ *
+ * - core:     active goal + core data type + recent (last 5 loops / 5 hours)
+ * - recall:   active goal (other data types, or older)
+ * - archival: completed goal OR not in any tracked goal
+ *
+ * Optional promotion/demotion params:
+ * - satisfiedDimensions: if all entry dimensions are satisfied, demote core→recall
+ * - highDissatisfactionDimensions: if any entry dimension is highly dissatisfied, promote recall→core
+ */
+export function classifyTier(entry, activeGoalIds, completedGoalIds, satisfiedDimensions, highDissatisfactionDimensions) {
+    const activeSet = new Set(activeGoalIds);
+    const completedSet = new Set(completedGoalIds);
+    // Archival: goal is completed or unknown
+    if (!activeSet.has(entry.goal_id)) {
+        // Could be completed or simply unknown — both are archival
+        return "archival";
+    }
+    // entry.goal_id is in activeGoalIds → at least recall
+    let tier;
+    if (isShortTermEntry(entry)) {
+        tier = classifyShortTermTier(entry, completedSet);
+    }
+    else {
+        tier = classifyIndexEntryTier(entry);
+    }
+    // Sub-stage 2.1: core→recall demotion when all dimensions are satisfied
+    if (tier === "core" && satisfiedDimensions && satisfiedDimensions.length > 0) {
+        const entryDims = entry.dimensions;
+        if (entryDims.length > 0 &&
+            entryDims.every((d) => satisfiedDimensions.includes(d))) {
+            tier = "recall";
+        }
+    }
+    // Sub-stage 2.2: recall→core promotion when any dimension has high dissatisfaction
+    if (tier === "recall" && highDissatisfactionDimensions && highDissatisfactionDimensions.length > 0) {
+        const entryDims = entry.dimensions;
+        if (entryDims.some((d) => highDissatisfactionDimensions.includes(d))) {
+            tier = "core";
+        }
+    }
+    return tier;
+}
+function classifyShortTermTier(entry, _completedSet) {
+    // Core requires: core data type + recent loop
+    const isCoreType = CORE_DATA_TYPES.has(entry.data_type);
+    if (!isCoreType)
+        return "recall";
+    // Check recency: loop_number (0-indexed, higher = more recent)
+    // We don't know the current loop number, so we use a heuristic:
+    // tags may include "recent"; otherwise we treat any loop_number > 0 check
+    // by seeing if the entry has the "recent" tag, or we fall back to timestamp.
+    // The spec says "from last 5 loops (compare loop_number if ShortTermEntry)".
+    // Without knowing max loop, use timestamp as proxy: if within 5 * avg_loop_time.
+    // Simpler: if tags include "recent" OR timestamp is within RECENT_HOURS hours.
+    if (entry.tags.includes("recent"))
+        return "core";
+    const ageMs = Date.now() - new Date(entry.timestamp).getTime();
+    const ageHours = ageMs / (1000 * 60 * 60);
+    if (ageHours <= RECENT_HOURS)
+        return "core";
+    return "recall";
+}
+function classifyIndexEntryTier(entry) {
+    // MemoryIndexEntry: no loop_number. Use last_accessed recency.
+    // Core: has "recent" tag OR last_accessed within RECENT_HOURS
+    if (entry.tags.includes("recent"))
+        return "core";
+    const ageMs = Date.now() - new Date(entry.last_accessed).getTime();
+    const ageHours = ageMs / (1000 * 60 * 60);
+    if (ageHours <= RECENT_HOURS)
+        return "core";
+    return "recall";
+}
+// ─── sortByTier ───
+const TIER_ORDER = {
+    core: 0,
+    recall: 1,
+    archival: 2,
+};
+/**
+ * Sort entries: core first, then recall, then archival.
+ * Within the same tier, preserve original order (stable).
+ */
+export function sortByTier(entries) {
+    // Stable sort: annotate with original index to preserve order within tier
+    return entries
+        .map((e, idx) => ({ e, idx }))
+        .sort((a, b) => {
+        const tierDiff = TIER_ORDER[a.e.memory_tier] - TIER_ORDER[b.e.memory_tier];
+        if (tierDiff !== 0)
+            return tierDiff;
+        return a.idx - b.idx;
+    })
+        .map(({ e }) => e);
+}
+// ─── computeDynamicBudget ───
+/**
+ * Compute tier budget based on max dissatisfaction score.
+ * Higher dissatisfaction → more budget for core tier.
+ */
+export function computeDynamicBudget(maxDissatisfaction) {
+    if (maxDissatisfaction > 0.7)
+        return { core: 0.70, recall: 0.25, archival: 0.05 };
+    if (maxDissatisfaction > 0.4)
+        return { core: 0.60, recall: 0.30, archival: 0.10 };
+    return { core: 0.50, recall: 0.35, archival: 0.15 };
+}
+// ─── filterByTierBudget ───
+/**
+ * Apply per-tier count limits from a TierBudget.
+ *
+ * TierBudget values are fractions [0, 1] of the total entry count.
+ * Converts fractions to absolute counts based on entries.length.
+ * At minimum, each tier gets Math.ceil(fraction * total) slots.
+ *
+ * Core entries are guaranteed first (up to their count limit),
+ * then recall, then archival.
+ * Entries are expected to already be sorted (sortByTier).
+ */
+export function filterByTierBudget(entries, budget) {
+    const total = entries.length;
+    if (total === 0)
+        return [];
+    // Convert fractions to counts
+    const coreMax = Math.round(budget.core * total);
+    const recallMax = Math.round(budget.recall * total);
+    const archivalMax = Math.round(budget.archival * total);
+    const result = [];
+    let coreCount = 0;
+    let recallCount = 0;
+    let archivalCount = 0;
+    for (const entry of entries) {
+        if (entry.memory_tier === "core" && coreCount < coreMax) {
+            result.push(entry);
+            coreCount++;
+        }
+        else if (entry.memory_tier === "recall" && recallCount < recallMax) {
+            result.push(entry);
+            recallCount++;
+        }
+        else if (entry.memory_tier === "archival" && archivalCount < archivalMax) {
+            result.push(entry);
+            archivalCount++;
+        }
+    }
+    return result;
+}
+// ─── Drive helpers (used by selection + compression) ───
+/**
+ * Dissatisfaction drive: delay compression up to 2x for high-dissatisfaction dimensions.
+ * For each dimension, if dissatisfaction > 0.7, delay_factor = 1 + dissatisfaction (max 2.0).
+ * Returns map of dimension -> delay_factor.
+ */
+export function getCompressionDelay(driveScores) {
+    const result = new Map();
+    for (const { dimension, dissatisfaction } of driveScores) {
+        if (dissatisfaction > 0.7) {
+            const delayFactor = Math.min(2.0, 1 + dissatisfaction);
+            result.set(dimension, delayFactor);
+        }
+        else {
+            result.set(dimension, 1.0);
+        }
+    }
+    return result;
+}
+/**
+ * Deadline drive: boost Working Memory priority up to 30%.
+ * For each dimension, bonus = min(deadline * 0.3, 0.3).
+ * Returns map of dimension -> bonus_factor.
+ */
+export function getDeadlineBonus(driveScores) {
+    const result = new Map();
+    for (const { dimension, deadline } of driveScores) {
+        result.set(dimension, Math.min(deadline * 0.3, 0.3));
+    }
+    return result;
+}
+// ─── llmClassifyTier ───
+const LLMTierResponseSchema = z.object({
+    classifications: z.array(z.object({
+        entry_id: z.string(),
+        tier: z.string(), // will be sanitized
+    })),
+});
+/**
+ * Use an LLM to classify entry tiers based on active goal context.
+ * Falls back to rule-based classifyTier on any error.
+ */
+export async function llmClassifyTier(entries, activeGoalContext, llmClient) {
+    if (entries.length === 0)
+        return new Map();
+    const validTiers = ["core", "recall", "archival"];
+    const prompt = `You are classifying memory entries for an AI agent into tiers.
+
+Active goal: ${activeGoalContext.goalId}
+Goal dimensions: ${activeGoalContext.dimensions.join(", ")}
+${activeGoalContext.gap !== undefined ? `Current gap: ${activeGoalContext.gap}` : ""}
+
+Entries to classify:
+${entries.map((e) => `- id: ${e.entry_id}, dimensions: [${e.dimensions.join(", ")}], tags: [${e.tags.join(", ")}], last_accessed: ${e.last_accessed}`).join("\n")}
+
+Classify each entry into one of: core (actively needed now), recall (may be needed soon), archival (background reference).
+
+Respond with JSON: {"classifications": [{"entry_id": "<id>", "tier": "core|recall|archival"}, ...]}`;
+    try {
+        const raw = await llmClient.generateStructured(prompt);
+        const parsed = LLMTierResponseSchema.parse(raw);
+        const result = new Map();
+        for (const item of parsed.classifications) {
+            const tier = validTiers.includes(item.tier)
+                ? item.tier
+                : "archival"; // sanitize out-of-enum values
+            result.set(item.entry_id, tier);
+        }
+        return result;
+    }
+    catch (err) {
+        console.error("[llmClassifyTier] error, falling back to rule-based:", err);
+        // Fallback: rule-based classification using active goal
+        const result = new Map();
+        for (const entry of entries) {
+            result.set(entry.entry_id, classifyTier(entry, [activeGoalContext.goalId], []));
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=memory-tier.js.map

package/dist/platform/knowledge/memory/memory-tier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-tier.js","sourceRoot":"","sources":["../../../../src/platform/knowledge/memory/memory-tier.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAQxB,oBAAoB;AAEpB,mFAAmF;AACnF,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,oFAAoF;AACpF,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,mDAAmD;AACnD,MAAM,eAAe,GAAwB,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC;AAElF,qBAAqB;AAErB,SAAS,gBAAgB,CACvB,KAAwC;IAExC,OAAO,aAAa,IAAI,KAAK,IAAI,WAAW,IAAI,KAAK,CAAC;AACxD,CAAC;AAED,uBAAuB;AAEvB;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAwC,EACxC,aAAuB,EACvB,gBAA0B,EAC1B,mBAA8B,EAC9B,6BAAwC;IAExC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;IACzC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAE/C,yCAAyC;IACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAClC,2DAA2D;QAC3D,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,sDAAsD;IACtD,IAAI,IAAgB,CAAC;IACrB,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,IAAI,GAAG,qBAAqB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACpD,CAAC;SAAM,CAAC;QACN,IAAI,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,wEAAwE;IACxE,IAAI,IAAI,KAAK,MAAM,IAAI,mBAAmB,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7E,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC;QACnC,IACE,SAAS,CAAC,MAAM,GAAG,CAAC;YACpB,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EACvD,CAAC;YACD,IAAI,GAAG,QAAQ,CAAC;QAClB,CAAC;IACH,CAAC;IAED,mFAAmF;IACnF,IAAI,IAAI,KAAK,QAAQ,IAAI,6BAA6B,IAAI,6BAA6B,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnG,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC;QACnC,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACrE,IAAI,GAAG,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAAqB,EACrB,aAA0B;IAE1B,8CAA8C;IAC9C,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACxD,IAAI,CAAC,UAAU;QAAE,OAAO,QAAQ,CAAC;IAEjC,+DAA+D;IAC/D,gEAAgE;IAChE,0EAA0E;IAC1E,6EAA6E;IAC7E,6EAA6E;IAC7E,iFAAiF;IACjF,+EAA+E;IAC/E,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IAEjD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/D,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1C,IAAI,QAAQ,IAAI,YAAY;QAAE,OAAO,MAAM,CAAC;IAE5C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAuB;IACrD,+DAA+D;IAC/D,8DAA8D;IAC9D,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IAEjD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE,CAAC;IACnE,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1C,IAAI,QAAQ,IAAI,YAAY;QAAE,OAAO,MAAM,CAAC;IAE5C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,qBAAqB;AAErB,MAAM,UAAU,GAA+B;IAC7C,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,OAA2B;IACpD,0EAA0E;IAC1E,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;SAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QAC3E,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACpC,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IACvB,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,+BAA+B;AAE/B;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,kBAA0B;IAC7D,IAAI,kBAAkB,GAAG,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAClF,IAAI,kBAAkB,GAAG,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAClF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AACtD,CAAC;AAED,6BAA6B;AAE7B;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAA2B,EAC3B,MAAkB;IAElB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAC7B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE3B,8BAA8B;IAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IACpD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;IAExD,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;YACxD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,IAAI,KAAK,CAAC,WAAW,KAAK,QAAQ,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;YACrE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,WAAW,EAAE,CAAC;QAChB,CAAC;aAAM,IAAI,KAAK,CAAC,WAAW,KAAK,UAAU,IAAI,aAAa,GAAG,WAAW,EAAE,CAAC;YAC3E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,aAAa,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,0DAA0D;AAE1D;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,WAAkE;IAElE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,WAAW,EAAE,CAAC;QACzD,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC;YACvD,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAC9B,WAA2D;IAE3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,WAAW,EAAE,CAAC;QAClD,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,0BAA0B;AAE1B,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IACrC,eAAe,EAAE,CAAC,CAAC,KAAK,CACtB,CAAC,CAAC,MAAM,CAAC;QACP,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;QACpB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,oBAAoB;KACvC,CAAC,CACH;CACF,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,OAA2B,EAC3B,iBAAyE,EACzE,SAAmE;IAEnE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAE3C,MAAM,UAAU,GAAiB,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAEhE,MAAM,MAAM,GAAG;;eAEF,iBAAiB,CAAC,MAAM;mBACpB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;EACxD,iBAAiB,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,gBAAgB,iBAAiB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE;;;EAGlF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,kBAAkB,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;;;oGAI7D,CAAC;IAEnG,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,SAAS,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEhD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAkB,CAAC;gBACvD,CAAC,CAAE,IAAI,CAAC,IAAmB;gBAC3B,CAAC,CAAC,UAAU,CAAC,CAAC,8BAA8B;YAC9C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,KAAK,CAAC,sDAAsD,EAAE,GAAG,CAAC,CAAC;QAC3E,wDAAwD;QACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,CACR,KAAK,CAAC,QAAQ,EACd,YAAY,CAAC,KAAK,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CACpD,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/platform/knowledge/transfer/knowledge-transfer-apply.d.ts

@@ -0,0 +1,48 @@
+import type { ILLMClient } from "../../../base/llm/llm-client.js";
+import type { IPromptGateway } from "../../../prompt/gateway.js";
+import type { LearningPipeline } from "../learning/learning-pipeline.js";
+import type { EthicsGate } from "../../traits/ethics-gate.js";
+import type { StateManager } from "../../../base/state/state-manager.js";
+import type { TransferCandidate, TransferResult } from "../../../base/types/cross-portfolio.js";
+import type { TransferTrustManager } from "./transfer-trust.js";
+import type { TransferContext } from "./knowledge-transfer-types.js";
+import type { DetectDeps } from "./knowledge-transfer-detect.js";
+import type { PatternEffectivenessTracker } from "./knowledge-transfer-types.js";
+export interface ApplyDeps {
+    llmClient: ILLMClient;
+    learningPipeline: LearningPipeline;
+    ethicsGate: EthicsGate;
+    stateManager: StateManager;
+    transferTrust: TransferTrustManager;
+    gateway?: IPromptGateway;
+}
+/**
+ * Apply a transfer candidate to the target goal.
+ *
+ * Phase 1: Should only be called after explicit user approval.
+ *
+ * Steps:
+ * 1. Look up candidate
+ * 2. Ethics gate check
+ * 3. LLM adaptation of source pattern to target context
+ * 4. Record and return TransferResult
+ */
+export declare function applyTransfer(candidateId: string, targetGoalId: string, deps: ApplyDeps, candidates: Map<string, TransferCandidate>, results: Map<string, TransferResult>, applyContexts: Map<string, TransferContext>): Promise<TransferResult>;
+/**
+ * Phase 2: Automatically apply high-confidence transfer candidates.
+ *
+ * Candidates with confidence >= 0.85 AND trust_score >= 0.7 are applied
+ * automatically (after ethics-gate check). Others remain as proposals.
+ */
+export declare function autoApplyHighConfidenceTransfers(goalId: string, deps: ApplyDeps, detectDeps: DetectDeps, candidates: Map<string, TransferCandidate>, results: Map<string, TransferResult>, applyContexts: Map<string, TransferContext>, patternTrackers: Map<string, PatternEffectivenessTracker>): Promise<TransferCandidate[]>;
+/**
+ * Phase 2: Realtime detection of transfer candidates for task generation.
+ *
+ * Returns high-score candidates and their adapted_content as contextSnippets
+ * for injection into task generation context.
+ */
+export declare function detectCandidatesRealtime(goalId: string, detectDeps: DetectDeps, candidates: Map<string, TransferCandidate>, patternTrackers: Map<string, PatternEffectivenessTracker>): Promise<{
+    candidates: TransferCandidate[];
+    contextSnippets: string[];
+}>;
+//# sourceMappingURL=knowledge-transfer-apply.d.ts.map

package/dist/platform/knowledge/transfer/knowledge-transfer-apply.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-transfer-apply.d.ts","sourceRoot":"","sources":["../../../../src/platform/knowledge/transfer/knowledge-transfer-apply.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAElE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sCAAsC,CAAC;AAEzE,OAAO,KAAK,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,wCAAwC,CAAC;AAChG,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAKhE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGrE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AACjE,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAQjF,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,UAAU,CAAC;IACtB,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,UAAU,EAAE,UAAU,CAAC;IACvB,YAAY,EAAE,YAAY,CAAC;IAC3B,aAAa,EAAE,oBAAoB,CAAC;IACpC,OAAO,CAAC,EAAE,cAAc,CAAC;CAC1B;AAID;;;;;;;;;;GAUG;AACH,wBAAsB,aAAa,CACjC,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,IAAI,EAAE,SAAS,EACf,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAC1C,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,EACpC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,GAC1C,OAAO,CAAC,cAAc,CAAC,CAmHzB;AAID;;;;;GAKG;AACH,wBAAsB,gCAAgC,CACpD,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,SAAS,EACf,UAAU,EAAE,UAAU,EACtB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAC1C,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,EACpC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,EAC3C,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,2BAA2B,CAAC,GACxD,OAAO,CAAC,iBAAiB,EAAE,CAAC,CA0F9B;AAID;;;;;GAKG;AACH,wBAAsB,wBAAwB,CAC5C,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,UAAU,EACtB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAC1C,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,2BAA2B,CAAC,GACxD,OAAO,CAAC;IAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAAC,eAAe,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CAkBzE"}