pulseed 0.0.1 → 0.1.0

package/dist/knowledge/memory-lifecycle.js

@@ -0,0 +1,402 @@
+import * as fsp from "node:fs/promises";
+import * as path from "node:path";
+import { z } from "zod";
+import { ShortTermEntrySchema, LessonEntrySchema, RetentionConfigSchema, StatisticalSummarySchema, } from "../types/memory-lifecycle.js";
+export { DriveScoreAdapter } from "./drive-score-adapter.js";
+import { atomicWriteAsync, readJsonFileAsync, getDataFile, generateId, } from "./memory-persistence.js";
+import { initializeIndex, updateIndex, removeGoalFromIndex, } from "./memory-index.js";
+import { compressToLongTerm as _compressToLongTerm, compressAllRemainingToLongTerm as _compressAllRemainingToLongTerm, applyRetentionPolicy as _applyRetentionPolicy, runGarbageCollection as _runGarbageCollection, compressionDelay as _compressionDelay, } from "./memory-compression.js";
+import { selectForWorkingMemory as _selectForWorkingMemory, selectForWorkingMemorySemantic as _selectForWorkingMemorySemantic, searchCrossGoalLessons as _searchCrossGoalLessons, relevanceScore as _relevanceScore, getCompressionDelay as _getCompressionDelay, getDeadlineBonus as _getDeadlineBonus, } from "./memory-selection.js";
+// ─── MemoryLifecycleManager ───
+// NOTE: This file is ~666 lines. Most methods are thin wrappers delegating to
+// memory-compression.ts, memory-selection.ts, and memory-phases.ts.
+// Further size reduction requires splitting the re-export section into a
+// dedicated barrel file — deferred to avoid circular dependency risk.
+/**
+ * MemoryLifecycleManager handles the 3-tier memory model:
+ *   - Working Memory: view/selection from Short-term + Long-term (1 session lifetime)
+ *   - Short-term Memory: raw data, configurable retention (default: 100 loops)
+ *   - Long-term Memory: compressed lessons + statistics (permanent)
+ *
+ * Directory layout:
+ *   <base>/memory/short-term/goals/<goal_id>/{experience-log,observations,strategies,tasks}.json
+ *   <base>/memory/short-term/index.json
+ *   <base>/memory/long-term/lessons/by-goal/<goal_id>.json
+ *   <base>/memory/long-term/lessons/by-dimension/<dim>.json
+ *   <base>/memory/long-term/lessons/global.json
+ *   <base>/memory/long-term/statistics/<goal_id>.json
+ *   <base>/memory/long-term/index.json
+ *   <base>/memory/archive/<goal_id>/{lessons,statistics}.json
+ */
+export class MemoryLifecycleManager {
+    baseDir;
+    memoryDir;
+    llmClient;
+    config;
+    embeddingClient;
+    vectorIndex;
+    driveScorer;
+    // Phase 2: internal map for early compression candidates
+    earlyCompressionCandidates = new Map();
+    constructor(baseDir, llmClient, config, embeddingClient, vectorIndex, driveScorer) {
+        this.baseDir = baseDir;
+        this.memoryDir = path.join(baseDir, "memory");
+        this.llmClient = llmClient;
+        this.config = RetentionConfigSchema.parse(config ?? {});
+        this.embeddingClient = embeddingClient;
+        this.vectorIndex = vectorIndex;
+        this.driveScorer = driveScorer;
+    }
+    // ─── Private: build deps objects ───
+    get compressionDeps() {
+        return {
+            memoryDir: this.memoryDir,
+            llmClient: this.llmClient,
+            config: this.config,
+            vectorIndex: this.vectorIndex,
+            driveScorer: this.driveScorer,
+            earlyCompressionCandidates: this.earlyCompressionCandidates,
+        };
+    }
+    get selectionDeps() {
+        return {
+            memoryDir: this.memoryDir,
+            vectorIndex: this.vectorIndex,
+            driveScorer: this.driveScorer,
+        };
+    }
+    // ─── Directory Initialization ───
+    /** Create directory structure for memory storage */
+    async initializeDirectories() {
+        const dirs = [
+            path.join(this.memoryDir, "short-term", "goals"),
+            path.join(this.memoryDir, "long-term", "lessons", "by-goal"),
+            path.join(this.memoryDir, "long-term", "lessons", "by-dimension"),
+            path.join(this.memoryDir, "long-term", "statistics"),
+            path.join(this.memoryDir, "archive"),
+        ];
+        for (const dir of dirs) {
+            await fsp.mkdir(dir, { recursive: true });
+        }
+        // Initialize index files if they don't exist
+        await initializeIndex(this.memoryDir, "short-term");
+        await initializeIndex(this.memoryDir, "long-term");
+        // Initialize global lessons file
+        const globalPath = path.join(this.memoryDir, "long-term", "lessons", "global.json");
+        try {
+            await fsp.access(globalPath);
+        }
+        catch {
+            await atomicWriteAsync(globalPath, []);
+        }
+    }
+    // ─── Short-term Memory ───
+    /**
+     * Record an entry to short-term memory.
+     * Appends to the appropriate data file and updates the short-term index.
+     */
+    async recordToShortTerm(goalId, dataType, data, options) {
+        // Ensure goal directory exists
+        const goalDir = path.join(this.memoryDir, "short-term", "goals", goalId);
+        await fsp.mkdir(goalDir, { recursive: true });
+        const now = new Date().toISOString();
+        const entry = ShortTermEntrySchema.parse({
+            id: generateId("st"),
+            goal_id: goalId,
+            data_type: dataType,
+            loop_number: options?.loopNumber ?? 0,
+            timestamp: now,
+            dimensions: options?.dimensions ?? [],
+            tags: options?.tags ?? [],
+            data,
+        });
+        // Append to appropriate file
+        const dataFile = getDataFile(this.memoryDir, goalId, dataType);
+        const existing = await readJsonFileAsync(dataFile, z.array(ShortTermEntrySchema));
+        const entries = existing ?? [];
+        entries.push(entry);
+        await atomicWriteAsync(dataFile, entries);
+        // Update short-term index
+        await updateIndex(this.memoryDir, "short-term", {
+            id: generateId("idx"),
+            goal_id: goalId,
+            dimensions: entry.dimensions,
+            tags: entry.tags,
+            timestamp: entry.timestamp,
+            data_file: path.relative(path.join(this.memoryDir, "short-term"), dataFile),
+            entry_id: entry.id,
+            last_accessed: now,
+            access_count: 0,
+            embedding_id: null,
+            memory_tier: entry.memory_tier,
+        });
+        // Phase 2: fire-and-forget embedding indexing
+        if (this.vectorIndex) {
+            const textToEmbed = `${dataType}: ${JSON.stringify(data).slice(0, 500)}`;
+            this.vectorIndex
+                .add(entry.id, textToEmbed, { goal_id: goalId, data_type: dataType })
+                .then(() => {
+                entry.embedding_id = entry.id;
+            })
+                .catch(() => {
+                // Non-fatal: embedding failures are ignored
+            });
+        }
+        return entry;
+    }
+    // ─── Long-term Compression ───
+    /**
+     * Compress short-term entries to long-term using LLM-based pattern extraction.
+     * Never deletes short-term data if LLM compression fails.
+     */
+    async compressToLongTerm(goalId, dataType) {
+        return _compressToLongTerm(this.compressionDeps, goalId, dataType);
+    }
+    // ─── Working Memory Selection ───
+    /**
+     * Select relevant entries for working memory.
+     * Phase 1: tag exact-match + recency sort.
+     * Phase 2 (5.2b): semantic search fallback via VectorIndex if tag results are insufficient.
+     * Phase 2 (5.2c): includes cross-goal lessons (up to 25% of budget).
+     */
+    async selectForWorkingMemory(goalId, dimensions, tags, maxEntries = 10) {
+        return _selectForWorkingMemory(this.selectionDeps, goalId, dimensions, tags, { maxEntries });
+    }
+    /**
+     * Tier-aware variant of selectForWorkingMemory.
+     * Passes satisfiedDimensions, highDissatisfactionDimensions, and maxDissatisfaction
+     * to enable core↔recall promotion/demotion and dynamic budget allocation.
+     */
+    async selectForWorkingMemoryTierAware(goalId, dimensions, tags, maxEntries, activeGoalIds, completedGoalIds, satisfiedDimensions, highDissatisfactionDimensions, maxDissatisfaction) {
+        return _selectForWorkingMemory(this.selectionDeps, goalId, dimensions, tags, {
+            maxEntries,
+            activeGoalIds,
+            completedGoalIds,
+            satisfiedDimensions,
+            highDissatisfactionDimensions,
+            maxDissatisfaction,
+        });
+    }
+    // ─── Phase 2: Drive-based Memory Management ───
+    /**
+     * 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.
+     */
+    getCompressionDelay(driveScores) {
+        return _getCompressionDelay(driveScores);
+    }
+    /**
+     * 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.
+     */
+    getDeadlineBonus(driveScores) {
+        return _getDeadlineBonus(driveScores);
+    }
+    /**
+     * SatisficingJudge hook: mark satisfied dimensions for early compression.
+     * Records these dimensions as candidates for early compression.
+     */
+    markForEarlyCompression(goalId, satisfiedDimensions) {
+        if (!this.earlyCompressionCandidates.has(goalId)) {
+            this.earlyCompressionCandidates.set(goalId, new Set());
+        }
+        const candidates = this.earlyCompressionCandidates.get(goalId) ?? new Set();
+        for (const dim of satisfiedDimensions) {
+            candidates.add(dim);
+        }
+    }
+    /**
+     * Return the set of dimensions marked for early compression for a goal.
+     */
+    getEarlyCompressionCandidates(goalId) {
+        return this.earlyCompressionCandidates.get(goalId) ?? new Set();
+    }
+    // ─── Phase 2 (5.2a): Drive-scorer-aware helpers ───
+    /**
+     * Compute a relevance score for a short-term entry given a context.
+     *
+     * Score = tag_match_ratio * drive_weight * freshness_factor
+     *   - tag_match_ratio  = matching tags / total unique tags (0 if no tags)
+     *   - drive_weight     = DriveScorer dissatisfaction score for first matching
+     *                        dimension (1.0 if no DriveScorer or no dimensions)
+     *   - freshness_factor = Math.exp(-daysSinceCreation / 30)
+     */
+    relevanceScore(entry, context) {
+        return _relevanceScore(this.selectionDeps, entry, context);
+    }
+    /**
+     * 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).
+     */
+    compressionDelay(goalId, dimension) {
+        return _compressionDelay(this.compressionDeps, goalId, dimension);
+    }
+    /**
+     * Hook called when the SatisficingJudge determines a dimension is satisfied.
+     * Marks the dimension for early compression if satisfied, clears the mark if not.
+     */
+    onSatisficingJudgment(goalId, dimension, isSatisfied) {
+        if (isSatisfied) {
+            // Mark dimension for early compression
+            if (!this.earlyCompressionCandidates.has(goalId)) {
+                this.earlyCompressionCandidates.set(goalId, new Set());
+            }
+            (this.earlyCompressionCandidates.get(goalId) ?? new Set()).add(dimension);
+        }
+        else {
+            // Remove from early compression candidates if previously marked
+            const candidates = this.earlyCompressionCandidates.get(goalId);
+            if (candidates) {
+                candidates.delete(dimension);
+            }
+        }
+    }
+    // ─── Phase 2 (5.2c): Cross-Goal Lesson Search ───
+    /**
+     * Search long-term lessons across ALL goals using semantic search.
+     * Falls back to tag-based global search if VectorIndex is unavailable.
+     *
+     * @param query  - natural language search query
+     * @param topK   - maximum number of lessons to return (default 5)
+     */
+    async searchCrossGoalLessons(query, topK = 5) {
+        return _searchCrossGoalLessons(this.selectionDeps, query, topK);
+    }
+    // ─── Phase 2: Semantic Working Memory Selection ───
+    /**
+     * Semantic variant of selectForWorkingMemory.
+     * Uses VectorIndex.search() to find semantically relevant entries.
+     * Applies deadline bonus to relevance scores.
+     * Falls back to existing sync method if no vectorIndex available.
+     */
+    async selectForWorkingMemorySemantic(goalId, query, dimensions, tags, maxEntries = 10, driveScores) {
+        return _selectForWorkingMemorySemantic(this.selectionDeps, goalId, query, dimensions, tags, maxEntries, driveScores);
+    }
+    // ─── Retention Policy ───
+    /**
+     * Apply retention policy — check each data type and trigger compression if needed.
+     * Phase 2 (5.2a): uses compressionDelay() per dimension for drive-based retention.
+     */
+    async applyRetentionPolicy(goalId) {
+        return _applyRetentionPolicy(this.compressionDeps, goalId);
+    }
+    // ─── Goal Close ───
+    /**
+     * Handle goal completion or cancellation.
+     * Compresses all remaining short-term data, then archives.
+     */
+    async onGoalClose(goalId, reason) {
+        const dataTypes = [
+            "experience_log",
+            "observation",
+            "strategy",
+            "task",
+            "knowledge",
+        ];
+        // Step 1: Compress all remaining short-term data (best-effort)
+        for (const dataType of dataTypes) {
+            const dataFile = getDataFile(this.memoryDir, goalId, dataType);
+            try {
+                await fsp.access(dataFile);
+            }
+            catch {
+                continue;
+            }
+            const entries = (await readJsonFileAsync(dataFile, z.array(ShortTermEntrySchema))) ?? [];
+            if (entries.length === 0)
+                continue;
+            try {
+                // Force-compress all remaining entries regardless of loop count
+                await _compressAllRemainingToLongTerm(this.compressionDeps, goalId, dataType, entries);
+            }
+            catch {
+                // Failure is acceptable on close — proceed to archive anyway
+            }
+        }
+        // Step 2: Archive short-term data directory
+        const goalShortTermDir = path.join(this.memoryDir, "short-term", "goals", goalId);
+        const archiveGoalDir = path.join(this.memoryDir, "archive", goalId);
+        try {
+            await fsp.access(goalShortTermDir);
+            await fsp.mkdir(archiveGoalDir, { recursive: true });
+            // Archive all files from the short-term goal directory
+            const files = await fsp.readdir(goalShortTermDir);
+            for (const file of files) {
+                const srcPath = path.join(goalShortTermDir, file);
+                const destPath = path.join(archiveGoalDir, file);
+                await fsp.copyFile(srcPath, destPath);
+            }
+            // Remove from short-term
+            await fsp.rm(goalShortTermDir, { recursive: true, force: true });
+            // Remove goal's entries from short-term index
+            await removeGoalFromIndex(this.memoryDir, "short-term", goalId);
+        }
+        catch {
+            // goalShortTermDir doesn't exist, nothing to archive
+        }
+        // Step 3: Archive long-term data (lessons + statistics) for this goal
+        const byGoalLessonsPath = path.join(this.memoryDir, "long-term", "lessons", "by-goal", `${goalId}.json`);
+        const statisticsPath = path.join(this.memoryDir, "long-term", "statistics", `${goalId}.json`);
+        try {
+            await fsp.access(byGoalLessonsPath);
+            await fsp.mkdir(archiveGoalDir, { recursive: true });
+            const archiveLessonsPath = path.join(archiveGoalDir, "lessons.json");
+            const existingArchive = (await readJsonFileAsync(archiveLessonsPath, z.array(LessonEntrySchema))) ?? [];
+            const goalLessons = (await readJsonFileAsync(byGoalLessonsPath, z.array(LessonEntrySchema))) ?? [];
+            await atomicWriteAsync(archiveLessonsPath, [
+                ...existingArchive,
+                ...goalLessons,
+            ]);
+        }
+        catch {
+            // byGoalLessonsPath doesn't exist, skip
+        }
+        try {
+            await fsp.access(statisticsPath);
+            await fsp.mkdir(archiveGoalDir, { recursive: true });
+            const archiveStatsPath = path.join(archiveGoalDir, "statistics.json");
+            const stats = await readJsonFileAsync(statisticsPath, StatisticalSummarySchema);
+            if (stats) {
+                await atomicWriteAsync(archiveStatsPath, stats);
+            }
+        }
+        catch {
+            // statisticsPath doesn't exist, skip
+        }
+        // Step 4: Mark all goal lessons as archived in long-term
+        try {
+            await fsp.access(byGoalLessonsPath);
+            const lessons = (await readJsonFileAsync(byGoalLessonsPath, z.array(LessonEntrySchema))) ?? [];
+            const archived = lessons.map((l) => LessonEntrySchema.parse({ ...l, status: "archived" }));
+            await atomicWriteAsync(byGoalLessonsPath, archived);
+        }
+        catch {
+            // byGoalLessonsPath doesn't exist, skip
+        }
+        void reason; // used for potential future audit logging
+    }
+    // ─── Statistics ───
+    /**
+     * Read and return the statistical summary for a goal.
+     */
+    async getStatistics(goalId) {
+        const statsPath = path.join(this.memoryDir, "long-term", "statistics", `${goalId}.json`);
+        return readJsonFileAsync(statsPath, StatisticalSummarySchema);
+    }
+    // ─── Garbage Collection ───
+    /**
+     * Run garbage collection to enforce size limits.
+     * Short-term: 10MB per goal (default). Long-term: 100MB total (default).
+     */
+    async runGarbageCollection() {
+        return _runGarbageCollection(this.compressionDeps);
+    }
+}
+//# sourceMappingURL=memory-lifecycle.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-lifecycle.js","sourceRoot":"","sources":["../../src/knowledge/memory-lifecycle.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;AAIxB,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,EACrB,wBAAwB,GACzB,MAAM,8BAA8B,CAAC;AAYtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,WAAW,EACX,UAAU,GAEX,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,eAAe,EAGf,WAAW,EAEX,mBAAmB,GAIpB,MAAM,mBAAmB,CAAC;AAI3B,OAAO,EACL,kBAAkB,IAAI,mBAAmB,EACzC,8BAA8B,IAAI,+BAA+B,EACjE,oBAAoB,IAAI,qBAAqB,EAC7C,oBAAoB,IAAI,qBAAqB,EAC7C,gBAAgB,IAAI,iBAAiB,GAEtC,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,sBAAsB,IAAI,uBAAuB,EACjD,8BAA8B,IAAI,+BAA+B,EACjE,sBAAsB,IAAI,uBAAuB,EACjD,cAAc,IAAI,eAAe,EACjC,mBAAmB,IAAI,oBAAoB,EAC3C,gBAAgB,IAAI,iBAAiB,GAEtC,MAAM,uBAAuB,CAAC;AAE/B,iCAAiC;AACjC,8EAA8E;AAC9E,oEAAoE;AACpE,yEAAyE;AACzE,sEAAsE;AAEtE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,sBAAsB;IAChB,OAAO,CAAS;IAChB,SAAS,CAAS;IAClB,SAAS,CAAa;IACtB,MAAM,CAAkB;IACxB,eAAe,CAAoB;IACnC,WAAW,CAAe;IAC1B,WAAW,CAAgB;IAE5C,yDAAyD;IACxC,0BAA0B,GAA6B,IAAI,GAAG,EAAE,CAAC;IAElF,YACE,OAAe,EACf,SAAqB,EACrB,MAAiC,EACjC,eAAkC,EAClC,WAAyB,EACzB,WAA0B;QAE1B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,sCAAsC;IAEtC,IAAY,eAAe;QACzB,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,0BAA0B,EAAE,IAAI,CAAC,0BAA0B;SAC5D,CAAC;IACJ,CAAC;IAED,IAAY,aAAa;QACvB,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,WAAW,EAAE,IAAI,CAAC,WAAW;SAC9B,CAAC;IACJ,CAAC;IAED,mCAAmC;IAEnC,oDAAoD;IACpD,KAAK,CAAC,qBAAqB;QACzB,MAAM,IAAI,GAAG;YACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAC;YAC5D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,CAAC;YACjE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,YAAY,CAAC;YACpD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC;SACrC,CAAC;QACF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5C,CAAC;QACD,6CAA6C;QAC7C,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QACpD,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACnD,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAC1B,IAAI,CAAC,SAAS,EACd,WAAW,EACX,SAAS,EACT,aAAa,CACd,CAAC;QACF,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,gBAAgB,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,4BAA4B;IAE5B;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CACrB,MAAc,EACd,QAAwB,EACxB,IAA6B,EAC7B,OAIC;QAED,+BAA+B;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CACvB,IAAI,CAAC,SAAS,EACd,YAAY,EACZ,OAAO,EACP,MAAM,CACP,CAAC;QACF,MAAM,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE9C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,oBAAoB,CAAC,KAAK,CAAC;YACvC,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC;YACpB,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,QAAQ;YACnB,WAAW,EAAE,OAAO,EAAE,UAAU,IAAI,CAAC;YACrC,SAAS,EAAE,GAAG;YACd,UAAU,EAAE,OAAO,EAAE,UAAU,IAAI,EAAE;YACrC,IAAI,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE;YACzB,IAAI;SACL,CAAC,CAAC;QAEH,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC/D,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,QAAQ,EACR,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC;QACF,MAAM,OAAO,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,MAAM,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAE1C,0BAA0B;QAC1B,MAAM,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE;YAC9C,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC;YACrB,OAAO,EAAE,MAAM;YACf,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,IAAI,CAAC,QAAQ,CACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,EACvC,QAAQ,CACT;YACD,QAAQ,EAAE,KAAK,CAAC,EAAE;YAClB,aAAa,EAAE,GAAG;YAClB,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,IAAI;YAClB,WAAW,EAAE,KAAK,CAAC,WAAW;SAC/B,CAAC,CAAC;QAEH,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,MAAM,WAAW,GAAG,GAAG,QAAQ,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YACzE,IAAI,CAAC,WAAW;iBACb,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,WAAW,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;iBACpE,IAAI,CAAC,GAAG,EAAE;gBACT,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,EAAE,CAAC;YAChC,CAAC,CAAC;iBACD,KAAK,CAAC,GAAG,EAAE;gBACV,4CAA4C;YAC9C,CAAC,CAAC,CAAC;QACP,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gCAAgC;IAEhC;;;OAGG;IACH,KAAK,CAAC,kBAAkB,CACtB,MAAc,EACd,QAAwB;QAExB,OAAO,mBAAmB,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IACrE,CAAC;IAED,mCAAmC;IAEnC;;;;;OAKG;IACH,KAAK,CAAC,sBAAsB,CAC1B,MAAc,EACd,UAAoB,EACpB,IAAc,EACd,aAAqB,EAAE;QAEvB,OAAO,uBAAuB,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAC/F,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,+BAA+B,CACnC,MAAc,EACd,UAAoB,EACpB,IAAc,EACd,UAAkB,EAClB,aAAuB,EACvB,gBAA0B,EAC1B,mBAA6B,EAC7B,6BAAuC,EACvC,kBAA0B;QAE1B,OAAO,uBAAuB,CAC5B,IAAI,CAAC,aAAa,EAClB,MAAM,EACN,UAAU,EACV,IAAI,EACJ;YACE,UAAU;YACV,aAAa;YACb,gBAAgB;YAChB,mBAAmB;YACnB,6BAA6B;YAC7B,kBAAkB;SACnB,CACF,CAAC;IACJ,CAAC;IAED,iDAAiD;IAEjD;;;;OAIG;IACH,mBAAmB,CACjB,WAAkE;QAElE,OAAO,oBAAoB,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CACd,WAA2D;QAE3D,OAAO,iBAAiB,CAAC,WAAW,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,uBAAuB,CAAC,MAAc,EAAE,mBAA6B;QACnE,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACpF,KAAK,MAAM,GAAG,IAAI,mBAAmB,EAAE,CAAC;YACtC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,6BAA6B,CAAC,MAAc;QAC1C,OAAO,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAClE,CAAC;IAED,qDAAqD;IAErD;;;;;;;;OAQG;IACH,cAAc,CACZ,KAAqB,EACrB,OAAiE;QAEjE,OAAO,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;OAQG;IACH,gBAAgB,CAAC,MAAc,EAAE,SAAiB;QAChD,OAAO,iBAAiB,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACpE,CAAC;IAED;;;OAGG;IACH,qBAAqB,CACnB,MAAc,EACd,SAAiB,EACjB,WAAoB;QAEpB,IAAI,WAAW,EAAE,CAAC;YAChB,uCAAuC;YACvC,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACzD,CAAC;YACD,CAAC,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpF,CAAC;aAAM,CAAC;YACN,gEAAgE;YAChE,MAAM,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/D,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IAEnD;;;;;;OAMG;IACH,KAAK,CAAC,sBAAsB,CAAC,KAAa,EAAE,IAAI,GAAG,CAAC;QAClD,OAAO,uBAAuB,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAClE,CAAC;IAED,qDAAqD;IAErD;;;;;OAKG;IACH,KAAK,CAAC,8BAA8B,CAClC,MAAc,EACd,KAAa,EACb,UAAoB,EACpB,IAAc,EACd,aAAqB,EAAE,EACvB,WAAqF;QAErF,OAAO,+BAA+B,CACpC,IAAI,CAAC,aAAa,EAClB,MAAM,EACN,KAAK,EACL,UAAU,EACV,IAAI,EACJ,UAAU,EACV,WAAW,CACZ,CAAC;IACJ,CAAC;IAED,2BAA2B;IAE3B;;;OAGG;IACH,KAAK,CAAC,oBAAoB,CAAC,MAAc;QACvC,OAAO,qBAAqB,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IAED,qBAAqB;IAErB;;;OAGG;IACH,KAAK,CAAC,WAAW,CACf,MAAc,EACd,MAAiC;QAEjC,MAAM,SAAS,GAAqB;YAClC,gBAAgB;YAChB,aAAa;YACb,UAAU;YACV,MAAM;YACN,WAAW;SACZ,CAAC;QAEF,+DAA+D;QAC/D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC/D,IAAI,CAAC;gBAAC,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,SAAS;YAAC,CAAC;YAEvD,MAAM,OAAO,GACX,CAAC,MAAM,iBAAiB,CACtB,QAAQ,EACR,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC,IAAI,EAAE,CAAC;YACX,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnC,IAAI,CAAC;gBACH,gEAAgE;gBAChE,MAAM,+BAA+B,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YACzF,CAAC;YAAC,MAAM,CAAC;gBACP,6DAA6D;YAC/D,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAChC,IAAI,CAAC,SAAS,EACd,YAAY,EACZ,OAAO,EACP,MAAM,CACP,CAAC;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAEpE,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;YACnC,MAAM,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAErD,uDAAuD;YACvD,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;YAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;gBACjD,MAAM,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YACxC,CAAC;YAED,yBAAyB;YACzB,MAAM,GAAG,CAAC,EAAE,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YAEjE,8CAA8C;YAC9C,MAAM,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACP,qDAAqD;QACvD,CAAC;QAED,sEAAsE;QACtE,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CACjC,IAAI,CAAC,SAAS,EACd,WAAW,EACX,SAAS,EACT,SAAS,EACT,GAAG,MAAM,OAAO,CACjB,CAAC;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAC9B,IAAI,CAAC,SAAS,EACd,WAAW,EACX,YAAY,EACZ,GAAG,MAAM,OAAO,CACjB,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACpC,MAAM,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;YACrE,MAAM,eAAe,GACnB,CAAC,MAAM,iBAAiB,CACtB,kBAAkB,EAClB,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAC3B,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,WAAW,GACf,CAAC,MAAM,iBAAiB,CACtB,iBAAiB,EACjB,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAC3B,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,gBAAgB,CAAC,kBAAkB,EAAE;gBACzC,GAAG,eAAe;gBAClB,GAAG,WAAW;aACf,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;QAC1C,CAAC;QAED,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;YACjC,MAAM,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACrD,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;YACtE,MAAM,KAAK,GAAG,MAAM,iBAAiB,CACnC,cAAc,EACd,wBAAwB,CACzB,CAAC;YACF,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,gBAAgB,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,qCAAqC;QACvC,CAAC;QAED,yDAAyD;QACzD,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACpC,MAAM,OAAO,GACX,CAAC,MAAM,iBAAiB,CACtB,iBAAiB,EACjB,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAC3B,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACjC,iBAAiB,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CACtD,CAAC;YACF,MAAM,gBAAgB,CAAC,iBAAiB,EAAE,QAAQ,CAAC,CAAC;QACtD,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;QAC1C,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,0CAA0C;IACzD,CAAC;IAED,qBAAqB;IAErB;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,MAAc;QAChC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CACzB,IAAI,CAAC,SAAS,EACd,WAAW,EACX,YAAY,EACZ,GAAG,MAAM,OAAO,CACjB,CAAC;QACF,OAAO,iBAAiB,CACtB,SAAS,EACT,wBAAwB,CACzB,CAAC;IACJ,CAAC;IAED,6BAA6B;IAE7B;;;OAGG;IACH,KAAK,CAAC,oBAAoB;QACxB,OAAO,qBAAqB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACrD,CAAC;CACF"}

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

@@ -0,0 +1,30 @@
+import { z } from "zod";
+import type { MemoryDataType, RetentionConfig } from "../types/memory-lifecycle.js";
+/**
+ * Map MemoryDataType to the corresponding short-term JSON file path.
+ */
+export declare function getDataFile(memoryDir: string, goalId: string, dataType: MemoryDataType): string;
+/**
+ * Generate a short unique ID with the given prefix.
+ */
+export declare function generateId(prefix: string): string;
+/**
+ * Write data to a file atomically (async version).
+ */
+export declare function atomicWriteAsync(filePath: string, data: unknown): Promise<void>;
+/**
+ * Read and parse a JSON file using the provided Zod schema (async version).
+ * Returns null if the file doesn't exist or parsing fails.
+ */
+export declare function readJsonFileAsync<T>(filePath: string, schema: z.ZodTypeAny): Promise<T | null>;
+/**
+ * Compute total size of a directory recursively in bytes (async version).
+ */
+export declare function getDirectorySizeAsync(dirPath: string): Promise<number>;
+/**
+ * Get the retention loop limit for a goal, considering goal_type_overrides.
+ * Since goalId does not encode goal type in MVP, use default unless caller
+ * configures an override keyed by goalId prefix.
+ */
+export declare function getRetentionLimit(config: RetentionConfig, goalId: string): number;
+//# sourceMappingURL=memory-persistence.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-persistence.d.ts","sourceRoot":"","sources":["../../src/knowledge/memory-persistence.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAIpF;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,GAAG,MAAM,CAe/F;AAID;;GAEG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEjD;AAID;;GAEG;AACH,wBAAsB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAqBrF;AAED;;;GAGG;AACH,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAapG;AAED;;GAEG;AACH,wBAAsB,qBAAqB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAqB5E;AAID;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAQjF"}

package/dist/knowledge/memory-persistence.js

@@ -0,0 +1,120 @@
+import { randomUUID } from "node:crypto";
+import * as fsp from "node:fs/promises";
+import * as path from "node:path";
+// ─── Data file path resolution ───
+/**
+ * Map MemoryDataType to the corresponding short-term JSON file path.
+ */
+export function getDataFile(memoryDir, goalId, dataType) {
+    const fileNames = {
+        experience_log: "experience-log.json",
+        observation: "observations.json",
+        strategy: "strategies.json",
+        task: "tasks.json",
+        knowledge: "knowledge.json",
+    };
+    return path.join(memoryDir, "short-term", "goals", goalId, fileNames[dataType]);
+}
+// ─── ID generation ───
+/**
+ * Generate a short unique ID with the given prefix.
+ */
+export function generateId(prefix) {
+    return `${prefix}_${randomUUID().replace(/-/g, "").slice(0, 12)}`;
+}
+// ─── Async versions of file utilities ───
+/**
+ * Write data to a file atomically (async version).
+ */
+export async function atomicWriteAsync(filePath, data) {
+    const dir = path.dirname(filePath);
+    try {
+        await fsp.mkdir(dir, { recursive: true });
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return;
+        throw err;
+    }
+    const tmpPath = filePath + ".tmp";
+    try {
+        await fsp.writeFile(tmpPath, JSON.stringify(data, null, 2), "utf-8");
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return;
+        throw err;
+    }
+    try {
+        await fsp.rename(tmpPath, filePath);
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return;
+        throw err;
+    }
+}
+/**
+ * Read and parse a JSON file using the provided Zod schema (async version).
+ * Returns null if the file doesn't exist or parsing fails.
+ */
+export async function readJsonFileAsync(filePath, schema) {
+    try {
+        await fsp.access(filePath);
+    }
+    catch {
+        return null;
+    }
+    try {
+        const content = await fsp.readFile(filePath, "utf-8");
+        const raw = JSON.parse(content);
+        return schema.parse(raw);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Compute total size of a directory recursively in bytes (async version).
+ */
+export async function getDirectorySizeAsync(dirPath) {
+    try {
+        await fsp.access(dirPath);
+    }
+    catch {
+        return 0;
+    }
+    let total = 0;
+    const entries = await fsp.readdir(dirPath, { withFileTypes: true });
+    for (const entry of entries) {
+        const entryPath = path.join(dirPath, entry.name);
+        if (entry.isDirectory()) {
+            total += await getDirectorySizeAsync(entryPath);
+        }
+        else {
+            try {
+                total += (await fsp.stat(entryPath)).size;
+            }
+            catch {
+                // Ignore stat errors
+            }
+        }
+    }
+    return total;
+}
+// ─── Retention limit ───
+/**
+ * Get the retention loop limit for a goal, considering goal_type_overrides.
+ * Since goalId does not encode goal type in MVP, use default unless caller
+ * configures an override keyed by goalId prefix.
+ */
+export function getRetentionLimit(config, goalId) {
+    // Check if any override key is a prefix of goalId
+    for (const [key, limit] of Object.entries(config.goal_type_overrides)) {
+        if (goalId.startsWith(key) || goalId.includes(key)) {
+            return limit;
+        }
+    }
+    return config.default_retention_loops;
+}
+//# sourceMappingURL=memory-persistence.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-persistence.js","sourceRoot":"","sources":["../../src/knowledge/memory-persistence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,GAAG,MAAM,kBAAkB,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAIlC,oCAAoC;AAEpC;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,MAAc,EAAE,QAAwB;IACrF,MAAM,SAAS,GAAmC;QAChD,cAAc,EAAE,qBAAqB;QACrC,WAAW,EAAE,mBAAmB;QAChC,QAAQ,EAAE,iBAAiB;QAC3B,IAAI,EAAE,YAAY;QAClB,SAAS,EAAE,gBAAgB;KAC5B,CAAC;IACF,OAAO,IAAI,CAAC,IAAI,CACd,SAAS,EACT,YAAY,EACZ,OAAO,EACP,MAAM,EACN,SAAS,CAAC,QAAQ,CAAC,CACpB,CAAC;AACJ,CAAC;AAED,wBAAwB;AAExB;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,MAAc;IACvC,OAAO,GAAG,MAAM,IAAI,UAAU,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACpE,CAAC;AAED,2CAA2C;AAE3C;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,QAAgB,EAAE,IAAa;IACpE,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5C,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACtB,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAC7D,MAAM,GAAG,CAAC;IACZ,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACtB,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAC7D,MAAM,GAAG,CAAC;IACZ,CAAC;IACD,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACtB,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAC7D,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAI,QAAgB,EAAE,MAAoB;IAC/E,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;QAC3C,OAAO,MAAM,CAAC,KAAK,CAAC,GAAG,CAAM,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,OAAe;IACzD,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IACpE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,KAAK,IAAI,MAAM,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAClD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC;gBACH,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5C,CAAC;YAAC,MAAM,CAAC;gBACP,qBAAqB;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0BAA0B;AAE1B;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAuB,EAAE,MAAc;IACvE,kDAAkD;IAClD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACtE,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC,uBAAuB,CAAC;AACxC,CAAC"}

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

@@ -0,0 +1,14 @@
+/**
+ * memory-phases.ts — backward-compatibility re-export barrel.
+ *
+ * All implementations have been extracted into focused modules:
+ *   - memory-index.ts   — index management + lesson storage
+ *   - memory-stats.ts   — statistics computation
+ *   - memory-query.ts   — lesson query / retrieval
+ *   - memory-distill.ts — LLM pattern extraction + distillation
+ */
+export { initializeIndex, loadIndex, saveIndex, updateIndex, removeFromIndex, removeGoalFromIndex, touchIndexEntry, archiveOldestLongTermEntries, storeLessonsLongTerm, } from "./memory-index.js";
+export { updateStatistics, mergeTaskStats, mergeDimStats, computeTrend, computePeriod, } from "./memory-stats.js";
+export { queryLessons, queryCrossGoalLessons, } from "./memory-query.js";
+export { extractPatterns, distillLessons, validateCompressionQuality, } from "./memory-distill.js";
+//# sourceMappingURL=memory-phases.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-phases.d.ts","sourceRoot":"","sources":["../../src/knowledge/memory-phases.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,eAAe,EACf,SAAS,EACT,SAAS,EACT,WAAW,EACX,eAAe,EACf,mBAAmB,EACnB,eAAe,EACf,4BAA4B,EAC5B,oBAAoB,GACrB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,aAAa,GACd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,YAAY,EACZ,qBAAqB,GACtB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,eAAe,EACf,cAAc,EACd,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC"}

package/dist/knowledge/memory-phases.js

@@ -0,0 +1,14 @@
+/**
+ * memory-phases.ts — backward-compatibility re-export barrel.
+ *
+ * All implementations have been extracted into focused modules:
+ *   - memory-index.ts   — index management + lesson storage
+ *   - memory-stats.ts   — statistics computation
+ *   - memory-query.ts   — lesson query / retrieval
+ *   - memory-distill.ts — LLM pattern extraction + distillation
+ */
+export { initializeIndex, loadIndex, saveIndex, updateIndex, removeFromIndex, removeGoalFromIndex, touchIndexEntry, archiveOldestLongTermEntries, storeLessonsLongTerm, } from "./memory-index.js";
+export { updateStatistics, mergeTaskStats, mergeDimStats, computeTrend, computePeriod, } from "./memory-stats.js";
+export { queryLessons, queryCrossGoalLessons, } from "./memory-query.js";
+export { extractPatterns, distillLessons, validateCompressionQuality, } from "./memory-distill.js";
+//# sourceMappingURL=memory-phases.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-phases.js","sourceRoot":"","sources":["../../src/knowledge/memory-phases.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,eAAe,EACf,SAAS,EACT,SAAS,EACT,WAAW,EACX,eAAe,EACf,mBAAmB,EACnB,eAAe,EACf,4BAA4B,EAC5B,oBAAoB,GACrB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,aAAa,GACd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,YAAY,EACZ,qBAAqB,GACtB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,eAAe,EACf,cAAc,EACd,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC"}

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

@@ -0,0 +1,4 @@
+import type { LessonEntry } from "../types/memory-lifecycle.js";
+export declare function queryLessons(memoryDir: string, tags: string[], dimensions: string[], maxCount: number): Promise<LessonEntry[]>;
+export declare function queryCrossGoalLessons(memoryDir: string, tags: string[], dimensions: string[], excludeGoalId: string, maxCount: number): Promise<LessonEntry[]>;
+//# sourceMappingURL=memory-query.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-query.d.ts","sourceRoot":"","sources":["../../src/knowledge/memory-query.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAKhE,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EAAE,EACd,UAAU,EAAE,MAAM,EAAE,EACpB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,WAAW,EAAE,CAAC,CAyDxB;AAED,wBAAsB,qBAAqB,CACzC,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EAAE,EACd,UAAU,EAAE,MAAM,EAAE,EACpB,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,WAAW,EAAE,CAAC,CAsCxB"}