pulseed 0.2.0 → 0.4.0

package/dist/platform/knowledge/knowledge-manager-lint.d.ts

@@ -0,0 +1,9 @@
+import type { KnowledgeManager } from "./knowledge-manager.js";
+import { type LintResult } from "./types/agent-memory.js";
+export declare function lintAgentMemory(opts: {
+    km: KnowledgeManager;
+    llmCall: (prompt: string) => Promise<string>;
+    autoRepair?: boolean;
+    categories?: string[];
+}): Promise<LintResult>;
+//# sourceMappingURL=knowledge-manager-lint.d.ts.map

package/dist/platform/knowledge/knowledge-manager-lint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-manager-lint.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-lint.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAGL,KAAK,UAAU,EAEhB,MAAM,yBAAyB,CAAC;AA+BjC,wBAAsB,eAAe,CAAC,IAAI,EAAE;IAC1C,EAAE,EAAE,gBAAgB,CAAC;IACrB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB,GAAG,OAAO,CAAC,UAAU,CAAC,CAyGtB"}

package/dist/platform/knowledge/knowledge-manager-lint.js

@@ -0,0 +1,123 @@
+import { LintResponseSchema, } from "./types/agent-memory.js";
+const LINT_SYSTEM_PROMPT = `You are a memory quality auditor. Analyze the provided compiled memory entries and identify:
+1. CONTRADICTIONS: entries that conflict with each other (e.g., different values for the same preference/fact)
+2. STALENESS: entries that appear outdated based on timestamps or content suggesting superseded information
+3. REDUNDANCY: entries with significantly overlapping content that should be merged
+
+Return a JSON object with a "findings" array. Each finding has:
+- type: "contradiction" | "staleness" | "redundancy"
+- entry_ids: array of entry IDs involved
+- description: brief explanation of the issue
+- confidence: 0-1 confidence score
+- suggested_action: "flag_review" | "auto_resolve_newest" | "mark_stale" | "merge"
+
+If no issues found, return {"findings": []}.
+Return ONLY valid JSON, no markdown fences.`;
+function buildUserPrompt(entries) {
+    const formatted = entries.map((e) => ({
+        id: e.id,
+        key: e.key,
+        value: e.value,
+        summary: e.summary,
+        tags: e.tags,
+        category: e.category,
+        memory_type: e.memory_type,
+        updated_at: e.updated_at,
+    }));
+    return `Analyze these ${entries.length} compiled memory entries for contradictions, staleness, and redundancy:\n\n${JSON.stringify(formatted, null, 2)}`;
+}
+export async function lintAgentMemory(opts) {
+    const { km, llmCall, autoRepair = false, categories } = opts;
+    // 1. Load compiled entries (listAgentMemory has no status filter — filter manually)
+    const allEntries = await km.listAgentMemory({ limit: 10000, include_archived: false });
+    let entries = allEntries.filter((e) => e.status === "compiled");
+    if (categories && categories.length > 0) {
+        entries = entries.filter((e) => e.category && categories.includes(e.category));
+    }
+    if (entries.length < 2) {
+        return { findings: [], repairs_applied: 0, entries_flagged: 0 };
+    }
+    // NOTE: Chunking processes entries independently per window. Contradictions/redundancies
+    // across chunk boundaries will not be detected. For most use cases compiled entries
+    // are well under 30, so this limit rarely applies.
+    // 2. Chunk if needed (max 30 per call)
+    const CHUNK_SIZE = 30;
+    const allFindings = [];
+    for (let i = 0; i < entries.length; i += CHUNK_SIZE) {
+        const chunk = entries.slice(i, i + CHUNK_SIZE);
+        const userPrompt = buildUserPrompt(chunk);
+        const raw = await llmCall(LINT_SYSTEM_PROMPT + "\n\n" + userPrompt);
+        // Sanitize: strip markdown fences
+        const cleaned = raw
+            .replace(/```(?:json)?\s*/g, "")
+            .replace(/```\s*/g, "")
+            .trim();
+        try {
+            const parsed = LintResponseSchema.parse(JSON.parse(cleaned));
+            allFindings.push(...parsed.findings);
+        }
+        catch (err) {
+            // Log but don't fail — partial results are acceptable
+            console.warn("Failed to parse lint LLM response:", err);
+        }
+    }
+    // 3. Apply repairs if autoRepair is enabled
+    let repairsApplied = 0;
+    for (const finding of allFindings) {
+        if (!autoRepair) {
+            continue;
+        }
+        switch (finding.type) {
+            case "contradiction": {
+                // Keep the most recently updated entry, archive others
+                const involved = entries.filter((e) => finding.entry_ids.includes(e.id));
+                if (involved.length < 2)
+                    break;
+                involved.sort((a, b) => new Date(b.updated_at).getTime() - new Date(a.updated_at).getTime());
+                const toArchive = involved.slice(1);
+                const archiveIds = toArchive.map((e) => e.id);
+                const archived = await km.archiveAgentMemory(archiveIds);
+                repairsApplied += archived;
+                break;
+            }
+            case "staleness": {
+                // Mark stale entries as raw so they re-enter consolidation pipeline:
+                // delete existing entry + re-save with "needs-reverification" tag (new entries default to "raw")
+                for (const id of finding.entry_ids) {
+                    const entry = entries.find((e) => e.id === id);
+                    if (entry) {
+                        await km.deleteAgentMemory(entry.key);
+                        await km.saveAgentMemory({
+                            key: entry.key,
+                            value: entry.value,
+                            tags: [...entry.tags, "needs-reverification"],
+                            category: entry.category,
+                            memory_type: entry.memory_type,
+                        });
+                        repairsApplied++;
+                    }
+                }
+                break;
+            }
+            case "redundancy": {
+                // Keep the first (richest by value length), archive others
+                const involved = entries.filter((e) => finding.entry_ids.includes(e.id));
+                if (involved.length < 2)
+                    break;
+                involved.sort((a, b) => b.value.length - a.value.length);
+                const toArchive = involved.slice(1);
+                const archiveIds = toArchive.map((e) => e.id);
+                const archived = await km.archiveAgentMemory(archiveIds);
+                repairsApplied += archived;
+                break;
+            }
+        }
+    }
+    const flaggedIds = new Set(autoRepair ? [] : allFindings.flatMap((f) => f.entry_ids));
+    return {
+        findings: allFindings,
+        repairs_applied: repairsApplied,
+        entries_flagged: flaggedIds.size,
+    };
+}
+//# sourceMappingURL=knowledge-manager-lint.js.map

package/dist/platform/knowledge/knowledge-manager-lint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-manager-lint.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-lint.ts"],"names":[],"mappings":"AAEA,OAAO,EAEL,kBAAkB,GAGnB,MAAM,yBAAyB,CAAC;AAEjC,MAAM,kBAAkB,GAAG;;;;;;;;;;;;;4CAaiB,CAAC;AAE7C,SAAS,eAAe,CAAC,OAA2B;IAClD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpC,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,UAAU,EAAE,CAAC,CAAC,UAAU;KACzB,CAAC,CAAC,CAAC;IACJ,OAAO,iBAAiB,OAAO,CAAC,MAAM,8EAA8E,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;AAC3J,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAKrC;IACC,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,GAAG,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;IAE7D,oFAAoF;IACpF,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,eAAe,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;IACvF,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;IAEhE,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IAClE,CAAC;IAED,yFAAyF;IACzF,oFAAoF;IACpF,mDAAmD;IACnD,uCAAuC;IACvC,MAAM,UAAU,GAAG,EAAE,CAAC;IACtB,MAAM,WAAW,GAAwC,EAAE,CAAC;IAE5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,kBAAkB,GAAG,MAAM,GAAG,UAAU,CAAC,CAAC;QAEpE,kCAAkC;QAClC,MAAM,OAAO,GAAG,GAAG;aAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;aAC/B,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,IAAI,EAAE,CAAC;QAEV,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7D,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,sDAAsD;YACtD,OAAO,CAAC,IAAI,CAAC,oCAAoC,EAAE,GAAG,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,SAAS;QACX,CAAC;QAED,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACrB,KAAK,eAAe,CAAC,CAAC,CAAC;gBACrB,uDAAuD;gBACvD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM;gBAC/B,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CACtE,CAAC;gBACF,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBACzD,cAAc,IAAI,QAAQ,CAAC;gBAC3B,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,CAAC,CAAC;gBACjB,qEAAqE;gBACrE,iGAAiG;gBACjG,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/C,IAAI,KAAK,EAAE,CAAC;wBACV,MAAM,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;wBACtC,MAAM,EAAE,CAAC,eAAe,CAAC;4BACvB,GAAG,EAAE,KAAK,CAAC,GAAG;4BACd,KAAK,EAAE,KAAK,CAAC,KAAK;4BAClB,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,sBAAsB,CAAC;4BAC7C,QAAQ,EAAE,KAAK,CAAC,QAAQ;4BACxB,WAAW,EAAE,KAAK,CAAC,WAAW;yBAC/B,CAAC,CAAC;wBACH,cAAc,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;gBACD,MAAM;YACR,CAAC;YACD,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClB,2DAA2D;gBAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM;gBAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACzD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBACzD,cAAc,IAAI,QAAQ,CAAC;gBAC3B,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEtF,OAAO;QACL,QAAQ,EAAE,WAAW;QACrB,eAAe,EAAE,cAAc;QAC/B,eAAe,EAAE,UAAU,CAAC,IAAI;KACjC,CAAC;AACJ,CAAC"}

package/dist/platform/knowledge/knowledge-manager.d.ts

@@ -9,6 +9,7 @@ import { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowl
 import { classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue } from "./knowledge-revalidation.js";
 import type { ToolExecutor } from "../../tools/executor.js";
 import type { ToolCallContext } from "../../tools/types.js";
+import type { AgentMemoryEntry, AgentMemoryType } from "./types/agent-memory.js";
 export { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowledge, classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue, };
 export { detectKnowledgeGap, generateAcquisitionTask, checkContradiction } from "./knowledge-manager-query.js";
 /**
@@ -118,6 +119,89 @@ export declare class KnowledgeManager {
      * Returns the count of purged records.
      */
     purgeOldDecisions(): Promise<number>;
+    /**
+     * Upsert an agent memory entry by key.
+     * If a matching key exists, update value/tags/category/memory_type/updated_at.
+     * If not, create a new entry with a UUID id and timestamps.
+     */
+    saveAgentMemory(entry: {
+        key: string;
+        value: string;
+        tags?: string[];
+        category?: string;
+        memory_type?: AgentMemoryType;
+    }): Promise<AgentMemoryEntry>;
+    /**
+     * Search agent memory entries by keyword or exact key match.
+     * exact=true: filter where entry.key === query.
+     * exact=false (default): case-insensitive substring match on key + value + tags.
+     * Optionally filter by category and/or memory_type.
+     * Excludes archived entries unless include_archived=true.
+     * Tiered sort: compiled entries first, then raw, both by updated_at desc.
+     */
+    recallAgentMemory(query: string, opts?: {
+        exact?: boolean;
+        category?: string;
+        memory_type?: AgentMemoryType;
+        limit?: number;
+        include_archived?: boolean;
+        semantic?: boolean;
+    }): Promise<AgentMemoryEntry[]>;
+    /**
+     * List all agent memory entries, optionally filtered by category and/or memory_type.
+     * Sorted by updated_at desc.
+     */
+    listAgentMemory(opts?: {
+        category?: string;
+        memory_type?: AgentMemoryType;
+        limit?: number;
+        include_archived?: boolean;
+    }): Promise<AgentMemoryEntry[]>;
+    /**
+     * Delete an agent memory entry by key.
+     * Returns true if the entry was found and removed, false otherwise.
+     */
+    deleteAgentMemory(key: string): Promise<boolean>;
+    /**
+     * Consolidate raw agent memory entries into compiled entries via LLM.
+     * Groups entries by category+memory_type; groups with 2+ entries are consolidated.
+     * Source entries are archived after consolidation.
+     */
+    consolidateAgentMemory(opts: {
+        category?: string;
+        memory_type?: AgentMemoryType;
+        max_entries?: number;
+        llmCall: (prompt: string) => Promise<string>;
+    }): Promise<{
+        compiled: AgentMemoryEntry[];
+        archived: number;
+    }>;
+    /**
+     * Archive agent memory entries by IDs.
+     * Returns the count of entries actually archived (skips already-archived).
+     */
+    archiveAgentMemory(ids: string[]): Promise<number>;
+    /**
+     * Return counts of agent memory entries grouped by status.
+     */
+    getAgentMemoryStats(): Promise<{
+        raw: number;
+        compiled: number;
+        archived: number;
+        total: number;
+    }>;
+    /**
+     * Automatically consolidate agent memory if raw entry count exceeds threshold.
+     * Non-fatal: errors are caught and logged; the loop continues regardless.
+     */
+    autoConsolidate(opts?: {
+        rawThreshold?: number;
+    }): Promise<{
+        consolidated: boolean;
+        compiled?: number;
+        archived?: number;
+    }>;
+    private _loadAgentMemoryStore;
     private _loadDomainKnowledge;
     /**
      * Acquire knowledge by planning and executing tool calls, then synthesizing results via LLM.

package/dist/platform/knowledge/knowledge-manager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"knowledge-manager.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAE9D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AASrD,OAAO,KAAK,EACV,cAAc,EAEd,kBAAkB,EAClB,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACf,MAAM,+BAA+B,CAAC;AACvC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EAGrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,EACvB,MAAM,6BAA6B,CAAC;AAarC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAI5D,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,GACvB,CAAC;AAGF,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAO/G;;;;;;;GAOG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAa;IACvC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAc;IAC3C,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAmB;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAiB;gBAGxC,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,UAAU,EACrB,WAAW,CAAC,EAAE,WAAW,EACzB,eAAe,CAAC,EAAE,gBAAgB,EAClC,OAAO,CAAC,EAAE,cAAc;IAWpB,kBAAkB,CAAC,OAAO,EAAE;QAChC,YAAY,EAAE,OAAO,EAAE,CAAC;QACxB,UAAU,EAAE,OAAO,EAAE,GAAG,IAAI,GAAG,SAAS,CAAC;QACzC,UAAU,EAAE,MAAM,CAAC;KACpB,GAAG,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAShC,uBAAuB,CAC3B,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC;IAUhB;;OAEG;IACG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCzE;;;;OAIG;IACG,aAAa,CACjB,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAE,MAAM,EAAE,GACd,OAAO,CAAC,cAAc,EAAE,CAAC;IAetB,kBAAkB,CACtB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,cAAc,GACvB,OAAO,CAAC,mBAAmB,CAAC;IAU/B;;OAEG;IACG,oBAAoB,CACxB,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,cAAc,EAAE,CAAC;IAM5B;;;OAGG;IACG,eAAe,CACnB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,cAAc,EAAE,CAAC;IAU5B;;;;OAIG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,cAAc,EAAE,CAAC;IAU5B;;;;OAIG;IACG,yBAAyB,CAC7B,KAAK,EAAE,cAAc,EACrB,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,oBAAoB,CAAC;IAsDhC;;;OAGG;IACG,oBAAoB,CACxB,IAAI,EAAE,MAAM,EAAE,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAMlC;;;OAGG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC;QAAE,KAAK,EAAE,oBAAoB,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAUjE;;;OAGG;IACG,uBAAuB,CAC3B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,cAAc,EAAE,GACxB,OAAO,CAAC,eAAe,CAAC;IAQ3B;;OAEG;IACG,eAAe,IAAI,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAIxD;;;OAGG;IACG,yBAAyB,CAAC,YAAY,EAAE,oBAAoB,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAMtF;;;;OAIG;IACG,cAAc,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAO3D;;;OAGG;IACG,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;IAO3E;;;OAGG;IACG,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IAQrF;;;;OAIG;IACG,qBAAqB,CACzB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,SAAS,GAAG,SAAS,GAC7B,OAAO,CAAC,IAAI,CAAC;IAQhB;;;OAGG;IACG,iBAAiB,IAAI,OAAO,CAAC,MAAM,CAAC;YAS5B,oBAAoB;IAOlC;;;OAGG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,YAAY,EAC1B,OAAO,EAAE,eAAe,GACvB,OAAO,CAAC,cAAc,EAAE,CAAC;CAqD7B"}
+{"version":3,"file":"knowledge-manager.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAE9D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AASrD,OAAO,KAAK,EACV,cAAc,EAEd,kBAAkB,EAClB,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACf,MAAM,+BAA+B,CAAC;AACvC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE9D,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EAGrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,EACvB,MAAM,6BAA6B,CAAC;AAarC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAK5D,OAAO,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAIjF,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,GACvB,CAAC;AAGF,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAS/G;;;;;;;GAOG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAa;IACvC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAc;IAC3C,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAmB;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAiB;gBAGxC,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,UAAU,EACrB,WAAW,CAAC,EAAE,WAAW,EACzB,eAAe,CAAC,EAAE,gBAAgB,EAClC,OAAO,CAAC,EAAE,cAAc;IAWpB,kBAAkB,CAAC,OAAO,EAAE;QAChC,YAAY,EAAE,OAAO,EAAE,CAAC;QACxB,UAAU,EAAE,OAAO,EAAE,GAAG,IAAI,GAAG,SAAS,CAAC;QACzC,UAAU,EAAE,MAAM,CAAC;KACpB,GAAG,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAShC,uBAAuB,CAC3B,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC;IAUhB;;OAEG;IACG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCzE;;;;OAIG;IACG,aAAa,CACjB,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAE,MAAM,EAAE,GACd,OAAO,CAAC,cAAc,EAAE,CAAC;IAetB,kBAAkB,CACtB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,cAAc,GACvB,OAAO,CAAC,mBAAmB,CAAC;IAU/B;;OAEG;IACG,oBAAoB,CACxB,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,cAAc,EAAE,CAAC;IAM5B;;;OAGG;IACG,eAAe,CACnB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,cAAc,EAAE,CAAC;IAU5B;;;;OAIG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,cAAc,EAAE,CAAC;IAU5B;;;;OAIG;IACG,yBAAyB,CAC7B,KAAK,EAAE,cAAc,EACrB,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,oBAAoB,CAAC;IAsDhC;;;OAGG;IACG,oBAAoB,CACxB,IAAI,EAAE,MAAM,EAAE,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAMlC;;;OAGG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,MAAU,GACf,OAAO,CAAC;QAAE,KAAK,EAAE,oBAAoB,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAUjE;;;OAGG;IACG,uBAAuB,CAC3B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,cAAc,EAAE,GACxB,OAAO,CAAC,eAAe,CAAC;IAQ3B;;OAEG;IACG,eAAe,IAAI,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAIxD;;;OAGG;IACG,yBAAyB,CAAC,YAAY,EAAE,oBAAoB,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAMtF;;;;OAIG;IACG,cAAc,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAO3D;;;OAGG;IACG,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;IAO3E;;;OAGG;IACG,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IAQrF;;;;OAIG;IACG,qBAAqB,CACzB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,SAAS,GAAG,SAAS,GAC7B,OAAO,CAAC,IAAI,CAAC;IAQhB;;;OAGG;IACG,iBAAiB,IAAI,OAAO,CAAC,MAAM,CAAC;IAS1C;;;;OAIG;IACG,eAAe,CAAC,KAAK,EAAE;QAC3B,GAAG,EAAE,MAAM,CAAC;QACZ,KAAK,EAAE,MAAM,CAAC;QACd,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,eAAe,CAAC;KAC/B,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAqC7B;;;;;;;OAOG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;QACL,KAAK,CAAC,EAAE,OAAO,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,eAAe,CAAC;QAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAC3B,QAAQ,CAAC,EAAE,OAAO,CAAC;KACpB,GACA,OAAO,CAAC,gBAAgB,EAAE,CAAC;IA+C9B;;;OAGG;IACG,eAAe,CAAC,IAAI,CAAC,EAAE;QAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,eAAe,CAAC;QAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,gBAAgB,CAAC,EAAE,OAAO,CAAC;KAC5B,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAmB/B;;;OAGG;IACG,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAYtD;;;;OAIG;IACG,sBAAsB,CAAC,IAAI,EAAE;QACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,eAAe,CAAC;QAC9B,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;KAC9C,GAAG,OAAO,CAAC;QAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IAqH/D;;;OAGG;IACG,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAqBxD;;OAEG;IACG,mBAAmB,IAAI,OAAO,CAAC;QACnC,GAAG,EAAE,MAAM,CAAC;QACZ,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;IAaF;;;OAGG;IACG,eAAe,CAAC,IAAI,CAAC,EAAE;QAAE,YAAY,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,YAAY,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;YAoBnH,qBAAqB;YAMrB,oBAAoB;IAOlC;;;OAGG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,YAAY,EAC1B,OAAO,EAAE,eAAe,GACvB,OAAO,CAAC,cAAc,EAAE,CAAC;CAqD7B"}

package/dist/platform/knowledge/knowledge-manager.js

@@ -1,13 +1,17 @@
+import { z } from "zod";
 import { KnowledgeEntrySchema, DomainKnowledgeSchema, SharedKnowledgeEntrySchema, } from "../../base/types/knowledge.js";
+import { cosineSimilarity } from "./embedding-client.js";
 import { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowledge, loadSharedEntries, loadDomainKnowledge, } from "./knowledge-search.js";
 import { classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue, } from "./knowledge-revalidation.js";
 import { recordDecision, enrichDecisionRecord, queryDecisions, updateDecisionOutcome, purgeOldDecisions, } from "./knowledge-decisions.js";
 import { detectKnowledgeGap as _detectKnowledgeGap, generateAcquisitionTask as _generateAcquisitionTask, checkContradiction as _checkContradiction, } from "./knowledge-manager-query.js";
+import { AgentMemoryEntrySchema, AgentMemoryStoreSchema, } from "./types/agent-memory.js";
 // Re-export for backward compatibility
 export { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowledge, classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue, };
 // Re-export standalone LLM query functions
 export { detectKnowledgeGap, generateAcquisitionTask, checkContradiction } from "./knowledge-manager-query.js";
 // ─── KnowledgeManager ───
+const AGENT_MEMORY_PATH = "memory/agent-memory/entries.json";
 /** Key used to store all SharedKnowledgeEntries as a flat array. */
 const SHARED_KB_PATH = "memory/shared-knowledge/entries.json";
 /**
@@ -236,7 +240,305 @@ export class KnowledgeManager {
             llmClient: this.llmClient,
         });
     }
+    // ─── Agent Memory ───
+    /**
+     * Upsert an agent memory entry by key.
+     * If a matching key exists, update value/tags/category/memory_type/updated_at.
+     * If not, create a new entry with a UUID id and timestamps.
+     */
+    async saveAgentMemory(entry) {
+        const store = await this._loadAgentMemoryStore();
+        const now = new Date().toISOString();
+        const existing = store.entries.findIndex((e) => e.key === entry.key);
+        let saved;
+        if (existing >= 0) {
+            const prev = store.entries[existing];
+            saved = AgentMemoryEntrySchema.parse({
+                ...prev,
+                value: entry.value,
+                tags: entry.tags ?? prev.tags,
+                category: entry.category ?? prev.category,
+                memory_type: entry.memory_type ?? prev.memory_type,
+                // When updating, explicitly preserve status
+                status: prev.status,
+                updated_at: now,
+            });
+            store.entries[existing] = saved;
+        }
+        else {
+            saved = AgentMemoryEntrySchema.parse({
+                id: crypto.randomUUID(),
+                key: entry.key,
+                value: entry.value,
+                tags: entry.tags ?? [],
+                category: entry.category,
+                memory_type: entry.memory_type ?? "fact",
+                created_at: now,
+                updated_at: now,
+            });
+            store.entries.push(saved);
+        }
+        await this.stateManager.writeRaw(AGENT_MEMORY_PATH, store);
+        return saved;
+    }
+    /**
+     * Search agent memory entries by keyword or exact key match.
+     * exact=true: filter where entry.key === query.
+     * exact=false (default): case-insensitive substring match on key + value + tags.
+     * Optionally filter by category and/or memory_type.
+     * Excludes archived entries unless include_archived=true.
+     * Tiered sort: compiled entries first, then raw, both by updated_at desc.
+     */
+    async recallAgentMemory(query, opts) {
+        const store = await this._loadAgentMemoryStore();
+        const { exact = false, category, memory_type, limit = 10, include_archived = false, semantic = false } = opts ?? {};
+        // Pre-filter by category, memory_type, and archived status (applies to both modes)
+        const candidates = store.entries.filter((e) => {
+            if (!include_archived && e.status === "archived")
+                return false;
+            const matchesCategory = category ? e.category === category : true;
+            const matchesType = memory_type ? e.memory_type === memory_type : true;
+            return matchesCategory && matchesType;
+        });
+        // Semantic search mode: use embedding similarity
+        if (semantic && this.embeddingClient) {
+            const texts = candidates.map((e) => {
+                const base = `${e.key}: ${e.value}`;
+                return e.summary ? `${base} (${e.summary})` : base;
+            });
+            const queryVec = await this.embeddingClient.embed(query);
+            const candidateVecs = await this.embeddingClient.batchEmbed(texts);
+            const scored = candidates
+                .map((e, i) => ({ entry: e, score: cosineSimilarity(queryVec, candidateVecs[i]) }))
+                .filter((s) => s.score >= 0.3);
+            scored.sort((a, b) => b.score - a.score);
+            return scored.slice(0, limit).map((s) => s.entry);
+        }
+        // Keyword search mode (default)
+        const lower = query.toLowerCase();
+        let results = candidates.filter((e) => {
+            return exact
+                ? e.key === query
+                : e.key.toLowerCase().includes(lower) ||
+                    e.value.toLowerCase().includes(lower) ||
+                    e.tags.some((t) => t.toLowerCase().includes(lower));
+        });
+        // Tiered sort: compiled entries first, then raw, both sorted by updated_at desc
+        results.sort((a, b) => {
+            const aIsCompiled = a.status === "compiled" ? 0 : 1;
+            const bIsCompiled = b.status === "compiled" ? 0 : 1;
+            if (aIsCompiled !== bIsCompiled)
+                return aIsCompiled - bIsCompiled;
+            return new Date(b.updated_at).getTime() - new Date(a.updated_at).getTime();
+        });
+        return results.slice(0, limit);
+    }
+    /**
+     * List all agent memory entries, optionally filtered by category and/or memory_type.
+     * Sorted by updated_at desc.
+     */
+    async listAgentMemory(opts) {
+        const store = await this._loadAgentMemoryStore();
+        const { category, memory_type, limit = 10, include_archived = false } = opts ?? {};
+        let results = store.entries.filter((e) => {
+            // Exclude archived entries unless explicitly requested
+            if (!include_archived && e.status === "archived")
+                return false;
+            const matchesCategory = category ? e.category === category : true;
+            const matchesType = memory_type ? e.memory_type === memory_type : true;
+            return matchesCategory && matchesType;
+        });
+        results.sort((a, b) => new Date(b.updated_at).getTime() - new Date(a.updated_at).getTime());
+        return results.slice(0, limit);
+    }
+    /**
+     * Delete an agent memory entry by key.
+     * Returns true if the entry was found and removed, false otherwise.
+     */
+    async deleteAgentMemory(key) {
+        const store = await this._loadAgentMemoryStore();
+        const idx = store.entries.findIndex((e) => e.key === key);
+        if (idx < 0)
+            return false;
+        store.entries.splice(idx, 1);
+        await this.stateManager.writeRaw(AGENT_MEMORY_PATH, store);
+        return true;
+    }
+    // ─── consolidateAgentMemory ───
+    /**
+     * Consolidate raw agent memory entries into compiled entries via LLM.
+     * Groups entries by category+memory_type; groups with 2+ entries are consolidated.
+     * Source entries are archived after consolidation.
+     */
+    async consolidateAgentMemory(opts) {
+        const store = await this._loadAgentMemoryStore();
+        const now = new Date().toISOString();
+        const maxEntries = opts.max_entries ?? 50;
+        // Filter raw entries
+        let rawEntries = store.entries.filter((e) => e.status === "raw");
+        if (opts.category)
+            rawEntries = rawEntries.filter((e) => e.category === opts.category);
+        if (opts.memory_type)
+            rawEntries = rawEntries.filter((e) => e.memory_type === opts.memory_type);
+        // Limit number of raw entries processed per consolidation call
+        rawEntries = rawEntries.slice(0, maxEntries);
+        // Group by category+memory_type
+        const groups = new Map();
+        for (const entry of rawEntries) {
+            const groupKey = `${entry.category ?? "_"}::${entry.memory_type}`;
+            const group = groups.get(groupKey) ?? [];
+            group.push(entry);
+            groups.set(groupKey, group);
+        }
+        const compiledSchema = z.object({
+            key: z.string(),
+            value: z.string(),
+            summary: z.string(),
+            tags: z.array(z.string()),
+        });
+        const compiled = [];
+        const archivedIds = new Set();
+        for (const [, group] of groups) {
+            if (group.length < 2)
+                continue;
+            const entryLines = group
+                .map((e) => `- [${e.key}]: ${e.value} (tags: ${e.tags.join(", ")})`)
+                .join("\n");
+            const prompt = [
+                "Consolidate the following memory entries into a single entry.",
+                "Return ONLY a JSON object with these fields:",
+                "- key: a descriptive key for the consolidated memory",
+                "- value: the consolidated content (comprehensive but concise)",
+                "- summary: a one-line summary (under 100 chars)",
+                "- tags: relevant tags as string array",
+                "",
+                "Entries to consolidate:",
+                entryLines,
+            ].join("\n");
+            let llmRaw;
+            try {
+                llmRaw = await opts.llmCall(prompt);
+            }
+            catch (err) {
+                console.warn("[KnowledgeManager] consolidateAgentMemory: llmCall failed, skipping group", err);
+                continue;
+            }
+            // Strip markdown fences and find first JSON object
+            let cleaned = llmRaw.trim();
+            const jsonMatch = cleaned.match(/\{[\s\S]*\}/);
+            if (!jsonMatch) {
+                console.warn("[KnowledgeManager] consolidateAgentMemory: no JSON object found in LLM response, skipping group");
+                continue;
+            }
+            cleaned = jsonMatch[0];
+            let parsedResult;
+            try {
+                parsedResult = compiledSchema.parse(JSON.parse(cleaned));
+            }
+            catch (err) {
+                console.warn("[KnowledgeManager] consolidateAgentMemory: failed to parse LLM response, skipping group", err);
+                continue;
+            }
+            const firstEntry = group[0];
+            const newEntry = AgentMemoryEntrySchema.parse({
+                id: crypto.randomUUID(),
+                key: parsedResult.key,
+                value: parsedResult.value,
+                summary: parsedResult.summary,
+                tags: parsedResult.tags,
+                category: firstEntry.category,
+                memory_type: firstEntry.memory_type,
+                status: "compiled",
+                compiled_from: group.map((e) => e.id),
+                created_at: now,
+                updated_at: now,
+            });
+            compiled.push(newEntry);
+            store.entries.push(newEntry);
+            for (const src of group) {
+                archivedIds.add(src.id);
+            }
+        }
+        // Archive source entries
+        for (const entry of store.entries) {
+            if (archivedIds.has(entry.id)) {
+                entry.status = "archived";
+                entry.updated_at = now;
+            }
+        }
+        if (compiled.length > 0) {
+            store.last_consolidated_at = now;
+            await this.stateManager.writeRaw(AGENT_MEMORY_PATH, store);
+        }
+        return { compiled, archived: archivedIds.size };
+    }
+    // ─── archiveAgentMemory ───
+    /**
+     * Archive agent memory entries by IDs.
+     * Returns the count of entries actually archived (skips already-archived).
+     */
+    async archiveAgentMemory(ids) {
+        const store = await this._loadAgentMemoryStore();
+        const now = new Date().toISOString();
+        let count = 0;
+        for (const entry of store.entries) {
+            if (ids.includes(entry.id) && entry.status !== "archived") {
+                entry.status = "archived";
+                entry.updated_at = now;
+                count++;
+            }
+        }
+        if (count > 0) {
+            await this.stateManager.writeRaw(AGENT_MEMORY_PATH, store);
+        }
+        return count;
+    }
+    // ─── getAgentMemoryStats ───
+    /**
+     * Return counts of agent memory entries grouped by status.
+     */
+    async getAgentMemoryStats() {
+        const store = await this._loadAgentMemoryStore();
+        const stats = { raw: 0, compiled: 0, archived: 0, total: store.entries.length };
+        for (const e of store.entries) {
+            if (e.status === "raw")
+                stats.raw++;
+            else if (e.status === "compiled")
+                stats.compiled++;
+            else if (e.status === "archived")
+                stats.archived++;
+        }
+        return stats;
+    }
+    // ─── autoConsolidate ───
+    /**
+     * Automatically consolidate agent memory if raw entry count exceeds threshold.
+     * Non-fatal: errors are caught and logged; the loop continues regardless.
+     */
+    async autoConsolidate(opts) {
+        try {
+            const stats = await this.getAgentMemoryStats();
+            if (stats.raw < (opts?.rawThreshold ?? 20)) {
+                return { consolidated: false };
+            }
+            const llmCall = (prompt) => this.llmClient.sendMessage([{ role: "user", content: prompt }]).then((r) => r.content);
+            const result = await this.consolidateAgentMemory({ llmCall });
+            return { consolidated: true, compiled: result.compiled.length, archived: result.archived };
+        }
+        catch (err) {
+            // Consolidation failure must never crash the loop
+            const msg = err instanceof Error ? err.message : String(err);
+            console.warn("KnowledgeManager.autoConsolidate: failed (non-fatal)", msg);
+            return { consolidated: false };
+        }
+    }
     // ─── Private Helpers ───
+    async _loadAgentMemoryStore() {
+        const raw = await this.stateManager.readRaw(AGENT_MEMORY_PATH);
+        if (!raw)
+            return AgentMemoryStoreSchema.parse({ entries: [], last_consolidated_at: null });
+        return AgentMemoryStoreSchema.parse(raw);
+    }
     async _loadDomainKnowledge(goalId) {
         return loadDomainKnowledge(this.stateManager, goalId);
     }