@animalabs/context-manager 0.3.0 → 0.5.0

package/dist/test/message-store-sequence.test.js

@@ -0,0 +1,157 @@
+/**
+ * Regression test for the message-store sequence-vs-index bug.
+ *
+ * Before this fix, `MessageStore.get(id).sequence` returned the message's
+ * SLOT INDEX (its position in the message-store append-log) rather than the
+ * CHRONICLE RECORD SEQUENCE at which it was appended. Those two numbers
+ * diverge whenever any non-message record is appended between messages —
+ * which the autobio strategy does heavily, with `state_update` records for
+ * summary appends, mergeQueue snapshots, counter increments, etc. The
+ * typical ratio is ~1:2 (slot index : chronicle seq).
+ *
+ * `ContextManager.branchAt(messageId)` then passed `message.sequence` to
+ * `chronicle.createBranchAt(name, from, atSequence)`, which expects the
+ * chronicle sequence. Result: forks landed at chronicle sequence equal to
+ * the slot index — silently dropping every chronicle record between the
+ * intended fork point and the actual one. For an 800-message conversation
+ * this could fork ~400 messages back instead of one turn back.
+ *
+ * The fix returns `internal.sequence` (which is correctly populated from
+ * `record.sequence` at append time). These tests pin the contract so a
+ * future refactor can't reintroduce the "use index as sequence for now"
+ * shortcut.
+ */
+import { describe, it, before, after, beforeEach } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-message-store-sequence';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function textBlock(text) {
+    return [{ type: 'text', text }];
+}
+describe('MessageStore — sequence semantics', () => {
+    before(cleanup);
+    after(cleanup);
+    beforeEach(cleanup);
+    it('returned sequence equals the chronicle record sequence (not the slot index)', async () => {
+        // Use the autobiographical strategy so its background state appends
+        // (counter, summaries, etc.) interleave with message appends — that's
+        // what makes slot-index and chronicle-sequence diverge.
+        const strategy = new AutobiographicalStrategy({ targetChunkTokens: 300 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const ids = [];
+        for (let i = 0; i < 5; i++) {
+            const id = manager.addMessage('user', textBlock(`m${i}`));
+            ids.push(id);
+        }
+        // Walk the store: each successive message must have a STRICTLY GREATER
+        // chronicle sequence than the previous, AND the sequence must not equal
+        // the slot index (which is what the old code returned). The "not equal"
+        // half is the actual regression assertion.
+        const { messages } = manager.queryMessages({});
+        assert.equal(messages.length, 5);
+        let prevSeq = -1;
+        for (let i = 0; i < messages.length; i++) {
+            const m = messages[i];
+            assert.ok(typeof m.sequence === 'number' && Number.isFinite(m.sequence), `message[${i}].sequence must be a finite number`);
+            assert.ok(m.sequence > prevSeq, `message[${i}].sequence (${m.sequence}) must be > previous (${prevSeq})`);
+            assert.notEqual(m.sequence, i, `message[${i}].sequence (${m.sequence}) must not equal its slot index (${i}) — ` +
+                'that was the bug. Chronicle sequences are dense across all record types, not just messages.');
+            prevSeq = m.sequence;
+        }
+        // Belt-and-suspenders: also confirm get() agrees with query()'s view.
+        const last = manager.getMessage(ids[ids.length - 1]);
+        assert.ok(last, 'get(lastId) must return the message');
+        assert.equal(last.sequence, messages[messages.length - 1].sequence, 'get() and query() must report the same sequence for the same message');
+        manager.close();
+    });
+    it('branchAt forks at the chronicle sequence — branch sees N messages, not slot-index-many', async () => {
+        // The end-to-end shape of the original bug. If sequence-vs-index is
+        // wrong, branchAt(messages[N-1].id) creates a fork at chronicle seq
+        // == (N-1), which lands far earlier than intended and the new branch
+        // sees only ~half the messages.
+        const strategy = new AutobiographicalStrategy({ targetChunkTokens: 300 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const ids = [];
+        for (let i = 0; i < 6; i++) {
+            const id = manager.addMessage('user', textBlock(`m${i}`));
+            ids.push(id);
+        }
+        // Fork at the 5th message (index 4). The new branch must see exactly
+        // the first 5 messages — anything fewer means the fork landed at
+        // a too-early chronicle sequence (the bug).
+        const newBranch = manager.branchAt(ids[4]);
+        await manager.switchBranch(newBranch);
+        const { messages: onBranch } = manager.queryMessages({});
+        assert.equal(onBranch.length, 5, `forked branch must see exactly 5 messages, got ${onBranch.length}. ` +
+            'A smaller count means branchAt forked at the slot index instead of the chronicle sequence.');
+        // Verify the contents AND that fork-point message has full id/sequence
+        // (not undefined). Pre-fix #2, the fork-point message was visible only
+        // in its pre-patch form on the new branch — id and sequence undefined —
+        // because MessageStore.add() does append-then-editStateItem, and
+        // forking at the original append's sequence captured the pre-patch
+        // state. Fix #2 stores the EDIT's sequence as the canonical
+        // commit-sequence, so a fork at messageId.sequence now lands at the
+        // edit record and the patched payload is inherited intact.
+        for (let i = 0; i < 5; i++) {
+            const text = onBranch[i]?.content?.[0];
+            assert.ok(text && text.type === 'text' && text.text === `m${i}`, `forked branch message[${i}] should be "m${i}", got ${JSON.stringify(text)}`);
+            assert.ok(onBranch[i].id !== undefined && onBranch[i].id !== null, `forked branch message[${i}].id must be defined (was the chained-branching bug), got ${onBranch[i].id}`);
+            assert.ok(typeof onBranch[i].sequence === 'number' && Number.isFinite(onBranch[i].sequence), `forked branch message[${i}].sequence must be a finite number, got ${onBranch[i].sequence}`);
+        }
+        // The most specific check: the fork-point message on the new branch
+        // must equal the fork-point message on main (same id).
+        assert.equal(onBranch[onBranch.length - 1].id, ids[4], 'fork-point message on the new branch must have the same id as on main');
+        manager.close();
+    });
+    it('chained branching at the fork-point message preserves full message state', async () => {
+        // The bonus chained-branching bug: pre-fix, the FORK-POINT message
+        // on a new branch had id and sequence = undefined, because the
+        // append-then-patch dance left its patched payload at a chronicle
+        // sequence one PAST the fork-point. Anyone trying to branchAt the
+        // fork-point message on a forked branch would hit
+        // `idToIndex.get(undefined)` returning nothing → "Message not found".
+        // This test catches that by chaining two forks where the second
+        // forks AT the prior fork's fork-point message.
+        const strategy = new AutobiographicalStrategy({ targetChunkTokens: 300 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const ids = [];
+        for (let i = 0; i < 6; i++) {
+            const id = manager.addMessage('user', textBlock(`m${i}`));
+            ids.push(id);
+        }
+        // Fork 1: at message index 4 (sees first 5 messages)
+        const fork1 = manager.branchAt(ids[4], 'chained-fork-1');
+        await manager.switchBranch(fork1);
+        const { messages: onFork1 } = manager.queryMessages({});
+        assert.equal(onFork1.length, 5);
+        // The fork-point message on fork1 must have full id/sequence — that's
+        // the precondition for branchAt to work from it.
+        const forkPointMsg = onFork1[onFork1.length - 1];
+        assert.ok(forkPointMsg.id !== undefined && forkPointMsg.id !== null, 'fork-point message on a forked branch must have a defined id (was the chained-branching bug)');
+        assert.ok(typeof forkPointMsg.sequence === 'number' && Number.isFinite(forkPointMsg.sequence), 'fork-point message on a forked branch must have a finite sequence');
+        // Fork 2: from fork1, AT the fork-point message of fork1.
+        // Pre-fix this throws "Message not found: undefined" because
+        // forkPointMsg.id is undefined on fork1.
+        const fork2 = manager.branchAt(forkPointMsg.id, 'chained-fork-2');
+        await manager.switchBranch(fork2);
+        const { messages: onFork2 } = manager.queryMessages({});
+        assert.equal(onFork2.length, 5, 'fork2 forked at fork1.fork-point should see the same 5 messages as fork1');
+        manager.close();
+    });
+});
+//# sourceMappingURL=message-store-sequence.test.js.map

package/dist/test/message-store-sequence.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"message-store-sequence.test.js","sourceRoot":"","sources":["../../test/message-store-sequence.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAG3E,MAAM,eAAe,GAAG,+BAA+B,CAAC;AAExD,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,eAAe,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,EAAE,CAAC,6EAA6E,EAAE,KAAK,IAAI,EAAE;QAC3F,oEAAoE;QACpE,sEAAsE;QACtE,wDAAwD;QACxD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QAED,uEAAuE;QACvE,wEAAwE;QACxE,wEAAwE;QACxE,2CAA2C;QAC3C,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEjC,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,EAAE,CACP,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAC7D,WAAW,CAAC,oCAAoC,CACjD,CAAC;YACF,MAAM,CAAC,EAAE,CACP,CAAC,CAAC,QAAQ,GAAG,OAAO,EACpB,WAAW,CAAC,eAAe,CAAC,CAAC,QAAQ,yBAAyB,OAAO,GAAG,CACzE,CAAC;YACF,MAAM,CAAC,QAAQ,CACb,CAAC,CAAC,QAAQ,EACV,CAAC,EACD,WAAW,CAAC,eAAe,CAAC,CAAC,QAAQ,oCAAoC,CAAC,MAAM;gBAC9E,6FAA6F,CAChG,CAAC;YACF,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC;QACvB,CAAC;QAED,sEAAsE;QACtE,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;QACvD,MAAM,CAAC,KAAK,CACV,IAAK,CAAC,QAAQ,EACd,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,EACtC,sEAAsE,CACvE,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wFAAwF,EAAE,KAAK,IAAI,EAAE;QACtG,oEAAoE;QACpE,oEAAoE;QACpE,qEAAqE;QACrE,gCAAgC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QAED,qEAAqE;QACrE,iEAAiE;QACjE,4CAA4C;QAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAEtC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,CAAC,KAAK,CACV,QAAQ,CAAC,MAAM,EACf,CAAC,EACD,kDAAkD,QAAQ,CAAC,MAAM,IAAI;YACnE,4FAA4F,CAC/F,CAAC;QACF,uEAAuE;QACvE,uEAAuE;QACvE,wEAAwE;QACxE,iEAAiE;QACjE,mEAAmE;QACnE,4DAA4D;QAC5D,oEAAoE;QACpE,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CACP,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EACrD,yBAAyB,CAAC,iBAAiB,CAAC,UAAU,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAC7E,CAAC;YACF,MAAM,CAAC,EAAE,CACP,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,EACvD,yBAAyB,CAAC,6DAA6D,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CACxG,CAAC;YACF,MAAM,CAAC,EAAE,CACP,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EACjF,yBAAyB,CAAC,2CAA2C,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAC5F,CAAC;QACJ,CAAC;QACD,oEAAoE;QACpE,uDAAuD;QACvD,MAAM,CAAC,KAAK,CACV,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,EAChC,GAAG,CAAC,CAAC,CAAC,EACN,uEAAuE,CACxE,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;QACxF,mEAAmE;QACnE,+DAA+D;QAC/D,kEAAkE;QAClE,kEAAkE;QAClE,kDAAkD;QAClD,sEAAsE;QACtE,gEAAgE;QAChE,gDAAgD;QAChD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QAED,qDAAqD;QACrD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACzD,MAAM,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEhC,sEAAsE;QACtE,iDAAiD;QACjD,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,EAAE,CACP,YAAY,CAAC,EAAE,KAAK,SAAS,IAAI,YAAY,CAAC,EAAE,KAAK,IAAI,EACzD,8FAA8F,CAC/F,CAAC;QACF,MAAM,CAAC,EAAE,CACP,OAAO,YAAY,CAAC,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,EACnF,mEAAmE,CACpE,CAAC;QAEF,0DAA0D;QAC1D,6DAA6D;QAC7D,yCAAyC;QACzC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QAClE,MAAM,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,KAAK,CACV,OAAO,CAAC,MAAM,EACd,CAAC,EACD,0EAA0E,CAC3E,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/non-blocking-compile.test.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Tests for `compile()`'s non-blocking contract + the uncompressed-chunk
+ * fallback that prevents silent message loss.
+ *
+ * Background: commit `3e42e98` dropped the `await readiness.pendingWork`
+ * inside `compile()` to keep turn latency low (compression can take
+ * 30+s; awaiting it per-turn was the wrong tradeoff). The side effect
+ * was that messages caught in a queued-but-not-yet-compressed chunk
+ * would vanish from rendered context in hierarchical mode — no summary
+ * existed yet for the chunk, and `selectHierarchical` only emitted raw
+ * messages from `recentStart` onward.
+ *
+ * The fix (these tests pin in place): `selectHierarchical` now emits
+ * raw messages for any uncompressed chunk that overlaps the middle
+ * region between the head and recent windows, mirroring
+ * `selectLegacy`'s "Uncompressed: emit raw" behavior. Once compression
+ * finishes and the chunk transitions to `compressed: true`, the raw
+ * emission stops (the chunk is now covered by an L1 summary), so
+ * there's no double-counting across the transition.
+ */
+export {};
+//# sourceMappingURL=non-blocking-compile.test.d.ts.map

package/dist/test/non-blocking-compile.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-blocking-compile.test.d.ts","sourceRoot":"","sources":["../../test/non-blocking-compile.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG"}

package/dist/test/non-blocking-compile.test.js

@@ -0,0 +1,114 @@
+/**
+ * Tests for `compile()`'s non-blocking contract + the uncompressed-chunk
+ * fallback that prevents silent message loss.
+ *
+ * Background: commit `3e42e98` dropped the `await readiness.pendingWork`
+ * inside `compile()` to keep turn latency low (compression can take
+ * 30+s; awaiting it per-turn was the wrong tradeoff). The side effect
+ * was that messages caught in a queued-but-not-yet-compressed chunk
+ * would vanish from rendered context in hierarchical mode — no summary
+ * existed yet for the chunk, and `selectHierarchical` only emitted raw
+ * messages from `recentStart` onward.
+ *
+ * The fix (these tests pin in place): `selectHierarchical` now emits
+ * raw messages for any uncompressed chunk that overlaps the middle
+ * region between the head and recent windows, mirroring
+ * `selectLegacy`'s "Uncompressed: emit raw" behavior. Once compression
+ * finishes and the chunk transitions to `compressed: true`, the raw
+ * emission stops (the chunk is now covered by an L1 summary), so
+ * there's no double-counting across the transition.
+ */
+import { describe, it, before, after, beforeEach } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-non-blocking-compile';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function textBlock(text) {
+    return [{ type: 'text', text }];
+}
+function compiledHas(compiled, fragment) {
+    for (const m of compiled.messages) {
+        for (const block of m.content) {
+            if (block.type === 'text' && block.text.includes(fragment))
+                return true;
+        }
+    }
+    return false;
+}
+describe('AutobiographicalStrategy — non-blocking compile + uncompressed-chunk fallback', () => {
+    before(cleanup);
+    after(cleanup);
+    beforeEach(cleanup);
+    it('emits raw messages for uncompressed chunks in the middle region (no silent drop)', async () => {
+        // Configure for a small middle region:
+        //  - No head window (so all messages compete for visibility via the
+        //    summary path and the recent window).
+        //  - Small recentWindowTokens so older messages fall out of recent.
+        //  - Small targetChunkTokens so a single old message ends up in
+        //    its own chunk.
+        //  - Hierarchical mode so `selectHierarchical` is the codepath
+        //    under test (selectLegacy already had this fallback).
+        const strategy = new AutobiographicalStrategy({
+            headWindowTokens: 0,
+            recentWindowTokens: 12,
+            targetChunkTokens: 4,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        // Three "old" messages whose chunks will be queued but un-ticked,
+        // plus a "latest" big enough to dominate the small recent window.
+        manager.addMessage('user', textBlock('ANCIENT_MARKER_1'));
+        manager.addMessage('user', textBlock('ANCIENT_MARKER_2'));
+        manager.addMessage('user', textBlock('ANCIENT_MARKER_3'));
+        manager.addMessage('user', textBlock('LATEST ' + 'X'.repeat(80)));
+        // Critically: we do NOT call manager.tick(). The chunks for the
+        // ancient messages exist in the strategy's compression queue but
+        // never run through executeMerge/compressChunk, so they stay
+        // `chunk.compressed === false`. This is the exact state where the
+        // bug used to silently drop messages.
+        const compiled = await manager.compile({
+            maxTokens: 100_000,
+            reserveForResponse: 0,
+        });
+        assert.ok(compiledHas(compiled, 'ANCIENT_MARKER_1'), 'ANCIENT_MARKER_1 must appear in compiled output (uncompressed-chunk fallback)');
+        assert.ok(compiledHas(compiled, 'ANCIENT_MARKER_2'), 'ANCIENT_MARKER_2 must appear in compiled output');
+        assert.ok(compiledHas(compiled, 'ANCIENT_MARKER_3'), 'ANCIENT_MARKER_3 must appear in compiled output');
+        // The recent message must of course still be there.
+        assert.ok(compiledHas(compiled, 'LATEST'), 'LATEST message must appear in compiled output');
+        manager.close();
+    });
+    it('compile() returns promptly without awaiting pending compression', async () => {
+        // Sanity check on the freshness contract change: compile() must
+        // not block on `pendingCompression`. We can't easily inject a slow
+        // mock LLM here, but we *can* assert that compile() completes
+        // before any tick would have time to finish.
+        const strategy = new AutobiographicalStrategy({
+            headWindowTokens: 0,
+            recentWindowTokens: 12,
+            targetChunkTokens: 4,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        manager.addMessage('user', textBlock('older'));
+        manager.addMessage('user', textBlock('latest ' + 'Y'.repeat(80)));
+        const t0 = Date.now();
+        await manager.compile({ maxTokens: 100_000, reserveForResponse: 0 });
+        const elapsed = Date.now() - t0;
+        // No LLM, no real awaiting — compile should be effectively instant.
+        // 500ms is wildly generous; the actual time is sub-10ms in practice.
+        assert.ok(elapsed < 500, `compile() should return promptly; took ${elapsed}ms`);
+        manager.close();
+    });
+});
+//# sourceMappingURL=non-blocking-compile.test.js.map

package/dist/test/non-blocking-compile.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-blocking-compile.test.js","sourceRoot":"","sources":["../../test/non-blocking-compile.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAG3E,MAAM,eAAe,GAAG,6BAA6B,CAAC;AAEtD,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,eAAe,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,WAAW,CAClB,QAAkE,EAClE,QAAgB;IAEhB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC1E,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,+EAA+E,EAAE,GAAG,EAAE;IAC7F,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,EAAE,CAAC,kFAAkF,EAAE,KAAK,IAAI,EAAE;QAChG,uCAAuC;QACvC,oEAAoE;QACpE,0CAA0C;QAC1C,oEAAoE;QACpE,gEAAgE;QAChE,oBAAoB;QACpB,+DAA+D;QAC/D,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,EAAE;YACtB,iBAAiB,EAAE,CAAC;YACpB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,kEAAkE;QAClE,kEAAkE;QAClE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,kBAAkB,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,kBAAkB,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,kBAAkB,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAElE,gEAAgE;QAChE,iEAAiE;QACjE,6DAA6D;QAC7D,kEAAkE;QAClE,sCAAsC;QACtC,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;YACrC,SAAS,EAAE,OAAO;YAClB,kBAAkB,EAAE,CAAC;SACtB,CAAC,CAAC;QAEH,MAAM,CAAC,EAAE,CACP,WAAW,CAAC,QAAQ,EAAE,kBAAkB,CAAC,EACzC,+EAA+E,CAChF,CAAC;QACF,MAAM,CAAC,EAAE,CACP,WAAW,CAAC,QAAQ,EAAE,kBAAkB,CAAC,EACzC,iDAAiD,CAClD,CAAC;QACF,MAAM,CAAC,EAAE,CACP,WAAW,CAAC,QAAQ,EAAE,kBAAkB,CAAC,EACzC,iDAAiD,CAClD,CAAC;QACF,oDAAoD;QACpD,MAAM,CAAC,EAAE,CACP,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAC/B,+CAA+C,CAChD,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iEAAiE,EAAE,KAAK,IAAI,EAAE;QAC/E,gEAAgE;QAChE,mEAAmE;QACnE,8DAA8D;QAC9D,6CAA6C;QAC7C,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,EAAE;YACtB,iBAAiB,EAAE,CAAC;YACpB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/C,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAElE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAEhC,oEAAoE;QACpE,qEAAqE;QACrE,MAAM,CAAC,EAAE,CACP,OAAO,GAAG,GAAG,EACb,0CAA0C,OAAO,IAAI,CACtD,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/pins.test.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Tests for pins / documents / protected ranges (audit gap #3).
+ *
+ * Pinned messages are excluded from compression and render raw at their
+ * original chronological position. Marks survive process restart and follow
+ * Chronicle branches (state is persisted as a snapshot under
+ * `${ns}/autobio:pins`).
+ */
+export {};
+//# sourceMappingURL=pins.test.d.ts.map

package/dist/test/pins.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pins.test.d.ts","sourceRoot":"","sources":["../../test/pins.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/test/pins.test.js

@@ -0,0 +1,164 @@
+/**
+ * Tests for pins / documents / protected ranges (audit gap #3).
+ *
+ * Pinned messages are excluded from compression and render raw at their
+ * original chronological position. Marks survive process restart and follow
+ * Chronicle branches (state is persisted as a snapshot under
+ * `${ns}/autobio:pins`).
+ */
+import { describe, it, before, after, beforeEach } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-pins';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function textBlock(text) {
+    return [{ type: 'text', text }];
+}
+class TestableStrategy extends AutobiographicalStrategy {
+    seedL1Against(content, firstMsgId, lastMsgId) {
+        const entry = {
+            id: `L1-${this.nextSummaryIdCounter()}`,
+            level: 1,
+            content,
+            tokens: Math.ceil(content.length / 4),
+            sourceLevel: 0,
+            sourceIds: [firstMsgId, lastMsgId],
+            sourceRange: { first: firstMsgId, last: lastMsgId },
+            created: Date.now(),
+        };
+        this.pushSummary(entry);
+        return entry;
+    }
+    // Expose the protected getter for assertions
+    exposeCompressibleIds(store) {
+        return this.getCompressibleMessages(store).map((m) => m.id);
+    }
+}
+describe('AutobiographicalStrategy — pins / documents (gap #3)', () => {
+    before(cleanup);
+    after(cleanup);
+    beforeEach(cleanup);
+    it('pinned messages are excluded from the compressible set', async () => {
+        const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const m1 = manager.addMessage('user', textBlock('one'));
+        const m2 = manager.addMessage('user', textBlock('two'));
+        const m3 = manager.addMessage('user', textBlock('three'));
+        manager.addMessage('user', textBlock('latest ' + 'X'.repeat(50)));
+        // Without any pins, all old messages are compressible.
+        const beforePin = strategy.exposeCompressibleIds(manager.messageStore.createView());
+        assert.ok(beforePin.includes(m2), 'm2 should be compressible before pin');
+        manager.pinRange(m2, m2);
+        const afterPin = strategy.exposeCompressibleIds(manager.messageStore.createView());
+        assert.ok(!afterPin.includes(m2), 'm2 must NOT be compressible after pin');
+        assert.ok(afterPin.includes(m1), 'm1 still compressible');
+        assert.ok(afterPin.includes(m3), 'm3 still compressible');
+        manager.close();
+    });
+    it('renders pinned messages raw at their chronological position', async () => {
+        const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const m1 = manager.addMessage('user', textBlock('alpha'));
+        const m2 = manager.addMessage('user', textBlock('PINNED-DOCUMENT-CONTENT'));
+        const m3 = manager.addMessage('user', textBlock('gamma'));
+        manager.addMessage('user', textBlock('latest ' + 'X'.repeat(50)));
+        // Seed summaries that cover m1 and m3 (NOT m2 — m2 is pinned).
+        strategy.seedL1Against('summary about alpha', m1, m1);
+        strategy.seedL1Against('summary about gamma', m3, m3);
+        manager.markDocument(m2, { name: 'big-doc' });
+        const compiled = await manager.compile({ maxTokens: 100_000, reserveForResponse: 0 });
+        const allTexts = compiled.messages.map(m => m.content.filter(c => c.type === 'text').map(c => c.text).join('|'));
+        // The pinned message's full content should be rendered raw, not via a summary.
+        const pinIdx = allTexts.findIndex(t => t.includes('PINNED-DOCUMENT-CONTENT'));
+        assert.ok(pinIdx >= 0, 'pinned message text should be visible verbatim in output');
+        // The two summaries should also be present.
+        const alphaIdx = allTexts.findIndex(t => t.includes('summary about alpha'));
+        const gammaIdx = allTexts.findIndex(t => t.includes('summary about gamma'));
+        assert.ok(alphaIdx >= 0, 'alpha summary should appear');
+        assert.ok(gammaIdx >= 0, 'gamma summary should appear');
+        // Chronological order: alpha summary < pinned m2 < gamma summary
+        assert.ok(alphaIdx < pinIdx, `alpha summary should come before pinned m2 (alpha=${alphaIdx} pin=${pinIdx})`);
+        assert.ok(pinIdx < gammaIdx, `pinned m2 should come before gamma summary (pin=${pinIdx} gamma=${gammaIdx})`);
+        manager.close();
+    });
+    it('persists pins across close/reopen', async () => {
+        let pinId;
+        {
+            const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+            const manager = await ContextManager.open({
+                path: TEST_STORE_PATH,
+                strategy,
+            });
+            const m1 = manager.addMessage('user', textBlock('survive me'));
+            manager.addMessage('user', textBlock('latest'));
+            pinId = manager.pinRange(m1, m1, { name: 'first-test-pin' });
+            assert.equal(manager.listPins().length, 1);
+            manager.sync();
+            manager.close();
+        }
+        {
+            const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+            const manager = await ContextManager.open({
+                path: TEST_STORE_PATH,
+                strategy,
+            });
+            const pins = manager.listPins();
+            assert.equal(pins.length, 1, 'pin should reload from chronicle');
+            assert.equal(pins[0].id, pinId);
+            assert.equal(pins[0].name, 'first-test-pin');
+            manager.close();
+        }
+    });
+    it('unpin removes the protection and persists', async () => {
+        const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const m1 = manager.addMessage('user', textBlock('toggle me'));
+        manager.addMessage('user', textBlock('latest'));
+        const pinId = manager.pinRange(m1, m1);
+        assert.equal(manager.listPins().length, 1);
+        const removed = manager.unpin(pinId);
+        assert.equal(removed, true);
+        assert.equal(manager.listPins().length, 0);
+        // Re-unpinning is a no-op (returns false)
+        assert.equal(manager.unpin(pinId), false);
+        manager.close();
+    });
+    it('multiple pins isolate per Chronicle branch (via fork)', async () => {
+        const strategy = new TestableStrategy({ headWindowTokens: 0, recentWindowTokens: 5 });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        const m1 = manager.addMessage('user', textBlock('shared'));
+        manager.addMessage('user', textBlock('latest'));
+        const sharedPin = manager.pinRange(m1, m1, { name: 'shared' });
+        const mainBranch = manager.currentBranch().name;
+        await manager.fork('experimental');
+        // Adding a pin only on the experimental branch
+        const m2 = manager.addMessage('user', textBlock('only on fork'));
+        manager.addMessage('user', textBlock('latest 2'));
+        const forkPin = manager.pinRange(m2, m2, { name: 'fork-only' });
+        assert.equal(manager.listPins().length, 2, 'fork should have shared + fork-only pin');
+        await manager.switchBranch(mainBranch);
+        const mainPins = manager.listPins();
+        assert.equal(mainPins.length, 1, 'main should only have the shared pin');
+        assert.equal(mainPins[0].id, sharedPin);
+        assert.ok(!mainPins.some(p => p.id === forkPin), 'main must NOT see the fork-only pin');
+        manager.close();
+    });
+});
+//# sourceMappingURL=pins.test.js.map

package/dist/test/pins.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pins.test.js","sourceRoot":"","sources":["../../test/pins.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAI3E,MAAM,eAAe,GAAG,aAAa,CAAC;AAEtC,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,eAAe,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,gBAAiB,SAAQ,wBAAwB;IACrD,aAAa,CAAC,OAAe,EAAE,UAAkB,EAAE,SAAiB;QAClE,MAAM,KAAK,GAAiB;YAC1B,EAAE,EAAE,MAAM,IAAI,CAAC,oBAAoB,EAAE,EAAE;YACvC,KAAK,EAAE,CAAC;YACR,OAAO;YACP,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACrC,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC;YAClC,WAAW,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE;YACnD,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6CAA6C;IAC7C,qBAAqB,CAAC,KAAU;QAC9B,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;CACF;AAED,QAAQ,CAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,EAAE,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;QACtE,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACxD,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACxD,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAElE,uDAAuD;QACvD,MAAM,SAAS,GAAG,QAAQ,CAAC,qBAAqB,CAAE,OAAe,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC;QAC7F,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,sCAAsC,CAAC,CAAC;QAE1E,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,qBAAqB,CAAE,OAAe,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC;QAC5F,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,uCAAuC,CAAC,CAAC;QAC3E,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,uBAAuB,CAAC,CAAC;QAC1D,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,uBAAuB,CAAC,CAAC;QAE1D,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC3E,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1D,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC;QAC5E,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAElE,+DAA+D;QAC/D,QAAQ,CAAC,aAAa,CAAC,qBAAqB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtD,QAAQ,CAAC,aAAa,CAAC,qBAAqB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAEtD,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAE9C,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QAEtF,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CACzC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAC7E,CAAC;QAEF,+EAA+E;QAC/E,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,yBAAyB,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,EAAE,0DAA0D,CAAC,CAAC;QAEnF,4CAA4C;QAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC5E,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,EAAE,CAAC,QAAQ,IAAI,CAAC,EAAE,6BAA6B,CAAC,CAAC;QACxD,MAAM,CAAC,EAAE,CAAC,QAAQ,IAAI,CAAC,EAAE,6BAA6B,CAAC,CAAC;QAExD,iEAAiE;QACjE,MAAM,CAAC,EAAE,CAAC,QAAQ,GAAG,MAAM,EAAE,qDAAqD,QAAQ,QAAQ,MAAM,GAAG,CAAC,CAAC;QAC7G,MAAM,CAAC,EAAE,CAAC,MAAM,GAAG,QAAQ,EAAE,mDAAmD,MAAM,UAAU,QAAQ,GAAG,CAAC,CAAC;QAE7G,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;QACjD,IAAI,KAAa,CAAC;QAClB,CAAC;YACC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;YACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;gBACxC,IAAI,EAAE,eAAe;gBACrB,QAAQ;aACT,CAAC,CAAC;YACH,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC;YAC/D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;YAEhD,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC;YAC7D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC3C,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,CAAC;YACC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;YACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;gBACxC,IAAI,EAAE,eAAe;gBACrB,QAAQ;aACT,CAAC,CAAC;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;YACjE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;YAC7C,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QACzD,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QAEhD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAE3C,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAE3C,0CAA0C;QAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;QAE1C,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAE/D,MAAM,UAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC;QAEhD,MAAM,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACnC,+CAA+C;QAC/C,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC;QACjE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;QAEhE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,yCAAyC,CAAC,CAAC;QAEtF,MAAM,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,sCAAsC,CAAC,CAAC;QACzE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACxC,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,qCAAqC,CAAC,CAAC;QAExF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/recall-positioning.test.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Tests for per-region recall pair emission (audit gap #2).
+ *
+ * Pre-fix, AutobiographicalStrategy concatenated ALL selected summaries with
+ * `\n\n---\n\n` separators into ONE Q/A pair placed between the head window
+ * and the recent window. Per the spec audit, this is the structural
+ * equivalent of Lena's dual-recall corruption pattern from Hermes: the agent
+ * sees memories as a wall of summaries from another speaker, with no
+ * positional or temporal coherence per individual summary.
+ *
+ * Post-fix, each selected summary emits as its own Q/A recall pair, sorted
+ * chronologically by source-range position. The legacy combined-pair shape
+ * is still available via `positionedRecallPairs: false`.
+ */
+export {};
+//# sourceMappingURL=recall-positioning.test.d.ts.map

package/dist/test/recall-positioning.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-positioning.test.d.ts","sourceRoot":"","sources":["../../test/recall-positioning.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG"}