@framers/agentos 0.1.46 → 0.1.48

package/dist/memory/context/RollingSummaryChain.js

@@ -0,0 +1,193 @@
+/**
+ * RollingSummaryChain — Linked chain of conversation summaries.
+ *
+ * Each compaction produces a summary node. When the chain itself exceeds
+ * its token budget, older nodes are re-summarized into higher-level nodes
+ * (summary-of-summaries), forming a tree structure:
+ *
+ *   [L2: turns 1-300]
+ *     ├── [L1: turns 1-120]
+ *     │     ├── [L0: turns 1-50]
+ *     │     └── [L0: turns 51-120]
+ *     └── [L1: turns 121-300]
+ *           ├── [L0: turns 121-200]
+ *           └── [L0: turns 201-300]
+ *
+ * The chain head (highest-level summary covering all compacted turns)
+ * is always included in the prompt as "conversation so far".
+ */
+/** Approximate tokens from character count (~4 chars/token). */
+function estimateTokens(text) {
+    return Math.ceil(text.length / 4);
+}
+export class RollingSummaryChain {
+    constructor(maxBudgetTokens = 2000, llmInvoker) {
+        this.nodes = new Map();
+        this.maxBudgetTokens = maxBudgetTokens;
+        this.llmInvoker = llmInvoker;
+    }
+    // ── Write ──────────────────────────────────────────────────────────
+    /** Add new leaf nodes from a compaction. */
+    addNodes(nodes) {
+        for (const node of nodes) {
+            this.nodes.set(node.id, node);
+        }
+    }
+    /**
+     * Collapse the chain if it exceeds the token budget.
+     * Merges the oldest leaf nodes into a higher-level summary.
+     * Returns any newly created parent nodes.
+     */
+    async collapse() {
+        const created = [];
+        // Keep collapsing while over budget.
+        while (this.getTotalTokens() > this.maxBudgetTokens) {
+            const leaves = this.getActiveLeaves();
+            if (leaves.length <= 1)
+                break; // can't compress further
+            // Take the 2-4 oldest leaves to merge.
+            const toMerge = leaves.slice(0, Math.min(4, leaves.length));
+            const parent = await this.mergeNodes(toMerge);
+            if (!parent)
+                break; // LLM not available, stop
+            // Mark children as absorbed.
+            for (const child of toMerge) {
+                const node = this.nodes.get(child.id);
+                if (node)
+                    node.parentId = parent.id;
+            }
+            this.nodes.set(parent.id, parent);
+            created.push(parent);
+        }
+        return created;
+    }
+    // ── Read ───────────────────────────────────────────────────────────
+    /** Get the active chain — top-level nodes without parents, sorted by turn range. */
+    getActiveChain() {
+        return this.getActiveLeaves();
+    }
+    /** Format the chain for inclusion in a prompt. */
+    formatForPrompt() {
+        const chain = this.getActiveChain();
+        if (chain.length === 0)
+            return '';
+        const totalTurnRange = [
+            chain[0].turnRange[0],
+            chain[chain.length - 1].turnRange[1],
+        ];
+        const parts = [
+            `[Conversation history — turns ${totalTurnRange[0]}–${totalTurnRange[1]}, compressed]`,
+        ];
+        for (const node of chain) {
+            if (chain.length > 1) {
+                parts.push(`--- Turns ${node.turnRange[0]}–${node.turnRange[1]} ---`);
+            }
+            parts.push(node.summary);
+        }
+        return parts.join('\n');
+    }
+    /** Total tokens across all active (non-absorbed) nodes. */
+    getTotalTokens() {
+        return this.getActiveLeaves().reduce((sum, n) => sum + n.tokenEstimate, 0);
+    }
+    /** Get all nodes (including absorbed children, for audit/UI). */
+    getAllNodes() {
+        return Array.from(this.nodes.values()).sort((a, b) => a.turnRange[0] - b.turnRange[0]);
+    }
+    /** Get the full turn range covered by the chain. */
+    getCoveredRange() {
+        const chain = this.getActiveChain();
+        if (chain.length === 0)
+            return null;
+        return [chain[0].turnRange[0], chain[chain.length - 1].turnRange[1]];
+    }
+    get size() {
+        return this.nodes.size;
+    }
+    // ── Internal ───────────────────────────────────────────────────────
+    /** Active leaves = nodes without a parent, sorted by turn range. */
+    getActiveLeaves() {
+        return Array.from(this.nodes.values())
+            .filter((n) => !n.parentId)
+            .sort((a, b) => a.turnRange[0] - b.turnRange[0]);
+    }
+    /** Merge multiple nodes into a single higher-level summary. */
+    async mergeNodes(nodes) {
+        if (!this.llmInvoker) {
+            // No LLM — fall back to simple concatenation with truncation.
+            return this.fallbackMerge(nodes);
+        }
+        const combinedText = nodes.map((n) => n.summary).join('\n\n');
+        const turnRange = [
+            nodes[0].turnRange[0],
+            nodes[nodes.length - 1].turnRange[1],
+        ];
+        const prompt = [
+            'You are a conversation summarizer. Merge the following conversation summaries into a single, more concise summary.',
+            'Preserve all key decisions, action items, named entities, and important context.',
+            'Drop redundant details and transitional language.',
+            `Target: approximately ${Math.ceil(combinedText.length / 4 / 3)} tokens (3:1 compression of input).`,
+            '',
+            `These summaries cover turns ${turnRange[0]}–${turnRange[1]}:`,
+            '',
+            combinedText,
+            '',
+            'Produce ONLY the merged summary, no preamble:',
+        ].join('\n');
+        try {
+            const summary = await this.llmInvoker(prompt);
+            const allEntities = new Set();
+            for (const n of nodes) {
+                for (const e of n.entities)
+                    allEntities.add(e);
+            }
+            return {
+                id: `chain-${Date.now()}-L${(nodes[0].level || 0) + 1}`,
+                level: (nodes[0].level || 0) + 1,
+                turnRange,
+                summary: summary.trim(),
+                tokenEstimate: estimateTokens(summary),
+                createdAt: Date.now(),
+                childIds: nodes.map((n) => n.id),
+                entities: Array.from(allEntities),
+                compactionEntryId: nodes[0].compactionEntryId,
+            };
+        }
+        catch {
+            return this.fallbackMerge(nodes);
+        }
+    }
+    /** Non-LLM fallback: concatenate and truncate to budget. */
+    fallbackMerge(nodes) {
+        const combined = nodes.map((n) => n.summary).join(' ');
+        // Truncate to roughly half the budget.
+        const targetChars = (this.maxBudgetTokens / 2) * 4;
+        const truncated = combined.length > targetChars
+            ? combined.slice(0, targetChars) + '...'
+            : combined;
+        const allEntities = new Set();
+        for (const n of nodes) {
+            for (const e of n.entities)
+                allEntities.add(e);
+        }
+        return {
+            id: `chain-${Date.now()}-L${(nodes[0].level || 0) + 1}`,
+            level: (nodes[0].level || 0) + 1,
+            turnRange: [
+                nodes[0].turnRange[0],
+                nodes[nodes.length - 1].turnRange[1],
+            ],
+            summary: truncated,
+            tokenEstimate: estimateTokens(truncated),
+            createdAt: Date.now(),
+            childIds: nodes.map((n) => n.id),
+            entities: Array.from(allEntities),
+            compactionEntryId: nodes[0].compactionEntryId,
+        };
+    }
+    /** Reset the chain. */
+    clear() {
+        this.nodes.clear();
+    }
+}
+//# sourceMappingURL=RollingSummaryChain.js.map

package/dist/memory/context/RollingSummaryChain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RollingSummaryChain.js","sourceRoot":"","sources":["../../../src/memory/context/RollingSummaryChain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,gEAAgE;AAChE,SAAS,cAAc,CAAC,IAAY;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,OAAO,mBAAmB;IAK9B,YACE,eAAe,GAAG,IAAI,EACtB,UAAgD;QAN1C,UAAK,GAAkC,IAAI,GAAG,EAAE,CAAC;QAQvD,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,sEAAsE;IAEtE,4CAA4C;IAC5C,QAAQ,CAAC,KAAyB;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,QAAQ;QACZ,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,qCAAqC;QACrC,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACtC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAM,CAAC,yBAAyB;YAExD,uCAAuC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,0BAA0B;YAE9C,6BAA6B;YAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,IAAI;oBAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC;YACtC,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,sEAAsE;IAEtE,oFAAoF;IACpF,cAAc;QACZ,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IAED,kDAAkD;IAClD,eAAe;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,cAAc,GAAqB;YACvC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;SACrC,CAAC;QAEF,MAAM,KAAK,GAAG;YACZ,iCAAiC,cAAc,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,eAAe;SACvF,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxE,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,2DAA2D;IAC3D,cAAc;QACZ,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,EACjC,CAAC,CACF,CAAC;IACJ,CAAC;IAED,iEAAiE;IACjE,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACzC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAC1C,CAAC;IACJ,CAAC;IAED,oDAAoD;IACpD,eAAe;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,sEAAsE;IAEtE,oEAAoE;IAC5D,eAAe;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;aAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,+DAA+D;IACvD,KAAK,CAAC,UAAU,CACtB,KAAyB;QAEzB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,8DAA8D;YAC9D,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAqB;YAClC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;SACrC,CAAC;QAEF,MAAM,MAAM,GAAG;YACb,oHAAoH;YACpH,kFAAkF;YAClF,mDAAmD;YACnD,yBAAyB,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,qCAAqC;YACpG,EAAE;YACF,+BAA+B,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG;YAC9D,EAAE;YACF,YAAY;YACZ,EAAE;YACF,+CAA+C;SAChD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;YACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;oBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;YAED,OAAO;gBACL,EAAE,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;gBACvD,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC;gBAChC,SAAS;gBACT,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE;gBACvB,aAAa,EAAE,cAAc,CAAC,OAAO,CAAC;gBACtC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC;gBACjC,iBAAiB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,iBAAiB;aAC9C,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,4DAA4D;IACpD,aAAa,CAAC,KAAyB;QAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvD,uCAAuC;QACvC,MAAM,WAAW,GAAG,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GACb,QAAQ,CAAC,MAAM,GAAG,WAAW;YAC3B,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,KAAK;YACxC,CAAC,CAAC,QAAQ,CAAC;QAEf,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;gBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,OAAO;YACL,EAAE,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;YACvD,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC;YAChC,SAAS,EAAE;gBACT,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBACrB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;aACrC;YACD,OAAO,EAAE,SAAS;YAClB,aAAa,EAAE,cAAc,CAAC,SAAS,CAAC;YACxC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC;YACjC,iBAAiB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,iBAAiB;SAC9C,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACF"}

package/dist/memory/context/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Infinite Context Window — Module exports.
+ */
+export type { CompactionEntry, CompactionInput, CompactionResult, CompactionStrategy, ContextMessage, ICompactionStrategy, InfiniteContextConfig, SummaryChainNode, TransparencyLevel, } from './types.js';
+export { DEFAULT_INFINITE_CONTEXT_CONFIG } from './types.js';
+export { ContextWindowManager } from './ContextWindowManager.js';
+export type { ContextWindowManagerConfig, ContextWindowStats, } from './ContextWindowManager.js';
+export { CompactionEngine } from './CompactionEngine.js';
+export { CompactionLog } from './CompactionLog.js';
+export type { CompactionLogStats } from './CompactionLog.js';
+export { RollingSummaryChain } from './RollingSummaryChain.js';
+export { SlidingSummaryStrategy } from './strategies/SlidingSummaryStrategy.js';
+export { HierarchicalStrategy } from './strategies/HierarchicalStrategy.js';
+export { HybridStrategy } from './strategies/HybridStrategy.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/memory/context/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/memory/context/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,YAAY,EACV,eAAe,EACf,eAAe,EACf,gBAAgB,EAChB,kBAAkB,EAClB,cAAc,EACd,mBAAmB,EACnB,qBAAqB,EACrB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,+BAA+B,EAAE,MAAM,YAAY,CAAC;AAG7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACjE,YAAY,EACV,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAG/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAChF,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC"}

package/dist/memory/context/index.js

@@ -0,0 +1,14 @@
+/**
+ * Infinite Context Window — Module exports.
+ */
+export { DEFAULT_INFINITE_CONTEXT_CONFIG } from './types.js';
+// Core
+export { ContextWindowManager } from './ContextWindowManager.js';
+export { CompactionEngine } from './CompactionEngine.js';
+export { CompactionLog } from './CompactionLog.js';
+export { RollingSummaryChain } from './RollingSummaryChain.js';
+// Strategies
+export { SlidingSummaryStrategy } from './strategies/SlidingSummaryStrategy.js';
+export { HierarchicalStrategy } from './strategies/HierarchicalStrategy.js';
+export { HybridStrategy } from './strategies/HybridStrategy.js';
+//# sourceMappingURL=index.js.map

package/dist/memory/context/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/memory/context/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAcH,OAAO,EAAE,+BAA+B,EAAE,MAAM,YAAY,CAAC;AAE7D,OAAO;AACP,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAKjE,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,aAAa;AACb,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAChF,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC"}

package/dist/memory/context/strategies/HierarchicalStrategy.d.ts

@@ -0,0 +1,25 @@
+/**
+ * HierarchicalStrategy — Multi-level summary tree for very long conversations.
+ *
+ * Maintains 4 levels of compression:
+ *   L0: Raw messages (last N turns)
+ *   L1: Per-segment summaries (~50 turns each)
+ *   L2: Per-session summaries (merges L1 nodes)
+ *   L3: Overall conversation summary (single node)
+ *
+ * Each level compresses ~5-10x, giving total compression of up to 1000x
+ * for multi-day conversations.
+ */
+import type { CompactionInput, CompactionResult, ICompactionStrategy, InfiniteContextConfig } from '../types.js';
+export declare class HierarchicalStrategy implements ICompactionStrategy {
+    readonly name: "hierarchical";
+    private readonly llmInvoker;
+    constructor(llmInvoker: (prompt: string) => Promise<string>);
+    compact(input: CompactionInput, config: InfiniteContextConfig): Promise<CompactionResult>;
+    private createL0Summary;
+    private mergeLevel;
+    private extractEntitiesFromText;
+    private collectEntities;
+    private noopResult;
+}
+//# sourceMappingURL=HierarchicalStrategy.d.ts.map

package/dist/memory/context/strategies/HierarchicalStrategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HierarchicalStrategy.d.ts","sourceRoot":"","sources":["../../../../src/memory/context/strategies/HierarchicalStrategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAEV,eAAe,EACf,gBAAgB,EAEhB,mBAAmB,EACnB,qBAAqB,EAEtB,MAAM,aAAa,CAAC;AAerB,qBAAa,oBAAqB,YAAW,mBAAmB;IAC9D,QAAQ,CAAC,IAAI,EAAG,cAAc,CAAU;IACxC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAsC;gBAErD,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;IAIrD,OAAO,CACX,KAAK,EAAE,eAAe,EACtB,MAAM,EAAE,qBAAqB,GAC5B,OAAO,CAAC,gBAAgB,CAAC;YA0Gd,eAAe;YA+Cf,UAAU;IAuDxB,OAAO,CAAC,uBAAuB;IAgB/B,OAAO,CAAC,eAAe;IAQvB,OAAO,CAAC,UAAU;CAwBnB"}

package/dist/memory/context/strategies/HierarchicalStrategy.js

@@ -0,0 +1,240 @@
+/**
+ * HierarchicalStrategy — Multi-level summary tree for very long conversations.
+ *
+ * Maintains 4 levels of compression:
+ *   L0: Raw messages (last N turns)
+ *   L1: Per-segment summaries (~50 turns each)
+ *   L2: Per-session summaries (merges L1 nodes)
+ *   L3: Overall conversation summary (single node)
+ *
+ * Each level compresses ~5-10x, giving total compression of up to 1000x
+ * for multi-day conversations.
+ */
+function estimateTokens(text) {
+    return Math.ceil(text.length / 4);
+}
+function generateId(level) {
+    return `hier-L${level}-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`;
+}
+/** Maximum L1 nodes before triggering L2 merge. */
+const MAX_L1_NODES = 5;
+/** Maximum L2 nodes before triggering L3 merge. */
+const MAX_L2_NODES = 3;
+export class HierarchicalStrategy {
+    constructor(llmInvoker) {
+        this.name = 'hierarchical';
+        this.llmInvoker = llmInvoker;
+    }
+    async compact(input, config) {
+        const startTime = Date.now();
+        const { messages, summaryChain } = input;
+        // Preserve recent turns.
+        const preserveCount = Math.min(config.preserveRecentTurns * 2, messages.length - 2);
+        const splitIdx = messages.length - preserveCount;
+        if (splitIdx <= 0) {
+            return this.noopResult(messages, startTime);
+        }
+        const toCompact = messages.slice(0, splitIdx);
+        const toKeep = messages.slice(splitIdx);
+        const inputTokens = toCompact.reduce((s, m) => s + m.tokenEstimate, 0);
+        // Step 1: Create L0 summary of the compacted segment.
+        const l0Node = await this.createL0Summary(toCompact, config);
+        const allNewNodes = [l0Node];
+        // Step 2: Check if we need L1 merge (too many L0 nodes).
+        const existingL0 = summaryChain.filter((n) => n.level === 0 && !n.parentId);
+        const allL0 = [...existingL0, l0Node];
+        if (allL0.length > MAX_L1_NODES) {
+            const l1Node = await this.mergeLevel(allL0, 1, config);
+            if (l1Node) {
+                for (const child of allL0)
+                    child.parentId = l1Node.id;
+                allNewNodes.push(l1Node);
+                // Step 3: Check if we need L2 merge.
+                const existingL1 = summaryChain.filter((n) => n.level === 1 && !n.parentId);
+                const allL1 = [...existingL1, l1Node];
+                if (allL1.length > MAX_L2_NODES) {
+                    const l2Node = await this.mergeLevel(allL1, 2, config);
+                    if (l2Node) {
+                        for (const child of allL1)
+                            child.parentId = l2Node.id;
+                        allNewNodes.push(l2Node);
+                    }
+                }
+            }
+        }
+        // Build summary message for prompt injection.
+        const activeNodes = [...summaryChain, ...allNewNodes].filter((n) => !n.parentId);
+        const summaryText = activeNodes
+            .sort((a, b) => a.turnRange[0] - b.turnRange[0])
+            .map((n) => {
+            const levelTag = n.level > 0 ? ` (L${n.level} summary)` : '';
+            return `[Turns ${n.turnRange[0]}–${n.turnRange[1]}${levelTag}]\n${n.summary}`;
+        })
+            .join('\n\n');
+        const outputTokens = estimateTokens(summaryText);
+        const summaryMessage = {
+            role: 'system',
+            content: `[Hierarchical conversation history — ${inputTokens} tokens → ${outputTokens} tokens]\n${summaryText}`,
+            timestamp: Date.now(),
+            turnIndex: toCompact[0].turnIndex,
+            tokenEstimate: outputTokens + 20,
+            compacted: true,
+        };
+        const entryId = generateId(0);
+        const turnRange = [
+            toCompact[0].turnIndex,
+            toCompact[toCompact.length - 1].turnIndex,
+        ];
+        const entry = {
+            id: entryId,
+            timestamp: Date.now(),
+            turnRange,
+            strategy: 'hierarchical',
+            inputTokens,
+            outputTokens,
+            compressionRatio: outputTokens > 0
+                ? Math.round((inputTokens / outputTokens) * 10) / 10
+                : inputTokens,
+            summary: summaryText,
+            droppedContent: [],
+            preservedEntities: this.collectEntities(allNewNodes),
+            tracesCreated: [],
+            emotionalContext: input.emotionalContext,
+            durationMs: Date.now() - startTime,
+        };
+        return {
+            messages: [summaryMessage, ...toKeep],
+            newNodes: allNewNodes,
+            entry,
+            tracesToEncode: [],
+        };
+    }
+    // ── Level summaries ────────────────────────────────────────────────
+    async createL0Summary(messages, config) {
+        const text = messages.map((m) => `[${m.role}] ${m.content}`).join('\n');
+        const targetTokens = Math.max(80, Math.ceil(estimateTokens(text) / config.targetCompressionRatio));
+        const turnRange = [
+            messages[0].turnIndex,
+            messages[messages.length - 1].turnIndex,
+        ];
+        const prompt = [
+            'Summarize this conversation segment. Preserve decisions, action items, entities, technical details, and open questions.',
+            `Target: ~${targetTokens} tokens.`,
+            '',
+            `Turns ${turnRange[0]}–${turnRange[1]}:`,
+            text,
+            '',
+            'Summary:',
+        ].join('\n');
+        let summary;
+        try {
+            summary = (await this.llmInvoker(prompt)).trim();
+        }
+        catch {
+            summary = `Conversation turns ${turnRange[0]}–${turnRange[1]}: ${messages
+                .filter((m) => m.role === 'user')
+                .map((m) => m.content.slice(0, 80))
+                .join('; ')}`;
+        }
+        return {
+            id: generateId(0),
+            level: 0,
+            turnRange,
+            summary,
+            tokenEstimate: estimateTokens(summary),
+            createdAt: Date.now(),
+            childIds: [],
+            entities: this.extractEntitiesFromText(summary),
+            compactionEntryId: '',
+        };
+    }
+    async mergeLevel(nodes, targetLevel, config) {
+        const combined = nodes
+            .map((n) => `[Turns ${n.turnRange[0]}–${n.turnRange[1]}]\n${n.summary}`)
+            .join('\n\n');
+        const targetTokens = Math.max(60, Math.ceil(estimateTokens(combined) / (config.targetCompressionRatio / 2)));
+        const turnRange = [
+            nodes[0].turnRange[0],
+            nodes[nodes.length - 1].turnRange[1],
+        ];
+        const prompt = [
+            `Merge these L${targetLevel - 1} conversation summaries into a single higher-level summary.`,
+            'Preserve the most important decisions, outcomes, and ongoing threads.',
+            'Consolidate redundant information.',
+            `Target: ~${targetTokens} tokens.`,
+            '',
+            combined,
+            '',
+            'Merged summary:',
+        ].join('\n');
+        try {
+            const summary = (await this.llmInvoker(prompt)).trim();
+            const allEntities = new Set();
+            for (const n of nodes) {
+                for (const e of n.entities)
+                    allEntities.add(e);
+            }
+            return {
+                id: generateId(targetLevel),
+                level: targetLevel,
+                turnRange,
+                summary,
+                tokenEstimate: estimateTokens(summary),
+                createdAt: Date.now(),
+                childIds: nodes.map((n) => n.id),
+                entities: Array.from(allEntities),
+                compactionEntryId: '',
+            };
+        }
+        catch {
+            return null;
+        }
+    }
+    // ── Helpers ────────────────────────────────────────────────────────
+    extractEntitiesFromText(text) {
+        const entities = new Set();
+        const patterns = [
+            /[\w/.-]+\.\w{1,5}/g, // file paths
+            /https?:\/\/[^\s)]+/g, // URLs
+            /`[^`]+`/g, // code identifiers
+        ];
+        for (const p of patterns) {
+            const matches = text.match(p);
+            if (matches) {
+                for (const m of matches)
+                    entities.add(m.replace(/`/g, ''));
+            }
+        }
+        return Array.from(entities).slice(0, 30);
+    }
+    collectEntities(nodes) {
+        const all = new Set();
+        for (const n of nodes) {
+            for (const e of n.entities)
+                all.add(e);
+        }
+        return Array.from(all);
+    }
+    noopResult(messages, startTime) {
+        return {
+            messages,
+            newNodes: [],
+            entry: {
+                id: generateId(0),
+                timestamp: Date.now(),
+                turnRange: [0, 0],
+                strategy: 'hierarchical',
+                inputTokens: 0,
+                outputTokens: 0,
+                compressionRatio: 1,
+                summary: '',
+                droppedContent: [],
+                preservedEntities: [],
+                tracesCreated: [],
+                durationMs: Date.now() - startTime,
+            },
+            tracesToEncode: [],
+        };
+    }
+}
+//# sourceMappingURL=HierarchicalStrategy.js.map

package/dist/memory/context/strategies/HierarchicalStrategy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HierarchicalStrategy.js","sourceRoot":"","sources":["../../../../src/memory/context/strategies/HierarchicalStrategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAYH,SAAS,cAAc,CAAC,IAAY;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,UAAU,CAAC,KAAa;IAC/B,OAAO,SAAS,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAClF,CAAC;AAED,mDAAmD;AACnD,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,mDAAmD;AACnD,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,MAAM,OAAO,oBAAoB;IAI/B,YAAY,UAA+C;QAHlD,SAAI,GAAG,cAAuB,CAAC;QAItC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,OAAO,CACX,KAAsB,EACtB,MAA6B;QAE7B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;QAEzC,yBAAyB;QACzB,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,MAAM,CAAC,mBAAmB,GAAG,CAAC,EAC9B,QAAQ,CAAC,MAAM,GAAG,CAAC,CACpB,CAAC;QACF,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,GAAG,aAAa,CAAC;QACjD,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAEvE,sDAAsD;QACtD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAuB,CAAC,MAAM,CAAC,CAAC;QAEjD,yDAAyD;QACzD,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CACpC,CAAC;QACF,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACvD,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,KAAK;oBAAE,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC;gBACtD,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEzB,qCAAqC;gBACrC,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CACpC,CAAC;gBACF,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,CAAC;gBACtC,IAAI,KAAK,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;oBACvD,IAAI,MAAM,EAAE,CAAC;wBACX,KAAK,MAAM,KAAK,IAAI,KAAK;4BAAE,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC;wBACtD,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,WAAW,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,WAAW,CAAC,CAAC,MAAM,CAC1D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CACnB,CAAC;QACF,MAAM,WAAW,GAAG,WAAW;aAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;aAC/C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7D,OAAO,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,QAAQ,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAChF,CAAC,CAAC;aACD,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,YAAY,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;QAEjD,MAAM,cAAc,GAAmB;YACrC,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,wCAAwC,WAAW,aAAa,YAAY,aAAa,WAAW,EAAE;YAC/G,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;YACjC,aAAa,EAAE,YAAY,GAAG,EAAE;YAChC,SAAS,EAAE,IAAI;SAChB,CAAC;QAEF,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,SAAS,GAAqB;YAClC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;YACtB,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS;SAC1C,CAAC;QAEF,MAAM,KAAK,GAAoB;YAC7B,EAAE,EAAE,OAAO;YACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,SAAS;YACT,QAAQ,EAAE,cAAc;YACxB,WAAW;YACX,YAAY;YACZ,gBAAgB,EACd,YAAY,GAAG,CAAC;gBACd,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE;gBACpD,CAAC,CAAC,WAAW;YACjB,OAAO,EAAE,WAAW;YACpB,cAAc,EAAE,EAAE;YAClB,iBAAiB,EAAE,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC;YACpD,aAAa,EAAE,EAAE;YACjB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;YACxC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;QAEF,OAAO;YACL,QAAQ,EAAE,CAAC,cAAc,EAAE,GAAG,MAAM,CAAC;YACrC,QAAQ,EAAE,WAAW;YACrB,KAAK;YACL,cAAc,EAAE,EAAE;SACnB,CAAC;IACJ,CAAC;IAED,sEAAsE;IAE9D,KAAK,CAAC,eAAe,CAC3B,QAA0B,EAC1B,MAA6B;QAE7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,EAAE,EACF,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAChE,CAAC;QACF,MAAM,SAAS,GAAqB;YAClC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;YACrB,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS;SACxC,CAAC;QAEF,MAAM,MAAM,GAAG;YACb,yHAAyH;YACzH,YAAY,YAAY,UAAU;YAClC,EAAE;YACF,SAAS,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG;YACxC,IAAI;YACJ,EAAE;YACF,UAAU;SACX,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,GAAG,sBAAsB,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ;iBACtE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;iBAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;iBAClC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,CAAC;QAED,OAAO;YACL,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;YACjB,KAAK,EAAE,CAAC;YACR,SAAS;YACT,OAAO;YACP,aAAa,EAAE,cAAc,CAAC,OAAO,CAAC;YACtC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC;YAC/C,iBAAiB,EAAE,EAAE;SACtB,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,KAAyB,EACzB,WAAmB,EACnB,MAA6B;QAE7B,MAAM,QAAQ,GAAG,KAAK;aACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;aACvE,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,EAAE,EACF,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,sBAAsB,GAAG,CAAC,CAAC,CAAC,CAC1E,CAAC;QAEF,MAAM,SAAS,GAAqB;YAClC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;SACrC,CAAC;QAEF,MAAM,MAAM,GAAG;YACb,gBAAgB,WAAW,GAAG,CAAC,6DAA6D;YAC5F,uEAAuE;YACvE,oCAAoC;YACpC,YAAY,YAAY,UAAU;YAClC,EAAE;YACF,QAAQ;YACR,EAAE;YACF,iBAAiB;SAClB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACvD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;YACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;oBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;YAED,OAAO;gBACL,EAAE,EAAE,UAAU,CAAC,WAAW,CAAC;gBAC3B,KAAK,EAAE,WAAW;gBAClB,SAAS;gBACT,OAAO;gBACP,aAAa,EAAE,cAAc,CAAC,OAAO,CAAC;gBACtC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC;gBACjC,iBAAiB,EAAE,EAAE;aACtB,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,sEAAsE;IAE9D,uBAAuB,CAAC,IAAY;QAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG;YACf,oBAAoB,EAAE,aAAa;YACnC,qBAAqB,EAAE,OAAO;YAC9B,UAAU,EAAE,mBAAmB;SAChC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC3C,CAAC;IAEO,eAAe,CAAC,KAAyB;QAC/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAEO,UAAU,CAChB,QAA0B,EAC1B,SAAiB;QAEjB,OAAO;YACL,QAAQ;YACR,QAAQ,EAAE,EAAE;YACZ,KAAK,EAAE;gBACL,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;gBACjB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACjB,QAAQ,EAAE,cAAc;gBACxB,WAAW,EAAE,CAAC;gBACd,YAAY,EAAE,CAAC;gBACf,gBAAgB,EAAE,CAAC;gBACnB,OAAO,EAAE,EAAE;gBACX,cAAc,EAAE,EAAE;gBAClB,iBAAiB,EAAE,EAAE;gBACrB,aAAa,EAAE,EAAE;gBACjB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACnC;YACD,cAAc,EAAE,EAAE;SACnB,CAAC;IACJ,CAAC;CACF"}

package/dist/memory/context/strategies/HybridStrategy.d.ts

@@ -0,0 +1,26 @@
+/**
+ * HybridStrategy — Best-quality compaction using the full cognitive memory pipeline.
+ *
+ * Combines three approaches:
+ * 1. MemoryObserver — personality-biased note extraction from conversation
+ * 2. MemoryReflector — consolidation of notes into typed long-term traces
+ * 3. Rolling summary — narrative continuity via SlidingSummaryStrategy
+ *
+ * Produces both a readable summary AND long-term memory traces, giving
+ * the agent both narrative context and structured recall.
+ */
+import type { MemoryObserver } from '../../observation/MemoryObserver.js';
+import type { MemoryReflector } from '../../observation/MemoryReflector.js';
+import type { CompactionInput, CompactionResult, ICompactionStrategy, InfiniteContextConfig } from '../types.js';
+export declare class HybridStrategy implements ICompactionStrategy {
+    readonly name: "hybrid";
+    private readonly llmInvoker;
+    private readonly observer?;
+    private readonly reflector?;
+    constructor(llmInvoker: (prompt: string) => Promise<string>, observer?: MemoryObserver, reflector?: MemoryReflector);
+    compact(input: CompactionInput, config: InfiniteContextConfig): Promise<CompactionResult>;
+    private generateHybridSummary;
+    private extractEntities;
+    private noopResult;
+}
+//# sourceMappingURL=HybridStrategy.d.ts.map

package/dist/memory/context/strategies/HybridStrategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HybridStrategy.d.ts","sourceRoot":"","sources":["../../../../src/memory/context/strategies/HybridStrategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAmB,MAAM,qCAAqC,CAAC;AAC3F,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AAE5E,OAAO,KAAK,EAEV,eAAe,EACf,gBAAgB,EAEhB,mBAAmB,EACnB,qBAAqB,EAEtB,MAAM,aAAa,CAAC;AAUrB,qBAAa,cAAe,YAAW,mBAAmB;IACxD,QAAQ,CAAC,IAAI,EAAG,QAAQ,CAAU;IAClC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAsC;IACjE,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAiB;IAC3C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAkB;gBAG3C,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,EAC/C,QAAQ,CAAC,EAAE,cAAc,EACzB,SAAS,CAAC,EAAE,eAAe;IAOvB,OAAO,CACX,KAAK,EAAE,eAAe,EACtB,MAAM,EAAE,qBAAqB,GAC5B,OAAO,CAAC,gBAAgB,CAAC;YAqJd,qBAAqB;IAyEnC,OAAO,CAAC,eAAe;IA6BvB,OAAO,CAAC,UAAU;CAwBnB"}