@animalabs/context-manager 0.5.5 → 0.5.10

package/dist/test/adaptive/kv-control.test.js

@@ -70,19 +70,25 @@ test('W is the only hard wall: escalates instead of exceeding it', () => {
     });
     assert.ok(r.escalations > 0, 'unfoldable content over W must escalate, not silently overflow');
 });
-test('reach cap is the cost↔continuity knob: tighter reach = gentler + less recompute', () => {
+test('trust region P never distorts the outcome — only the payment schedule (§13)', () => {
+    // Rev 5.0 retires the old premise (tighter reach → gentler): the old
+    // controller achieved gentleness by folding the WRONG (recent) content —
+    // the mechanism behind the 2026-07-12 inversion incident. Under the
+    // single-path solve, P bounds per-turn perturbation when the relevance-
+    // correct repair can be amortized (suffix adoption), and is overridden when
+    // it can't — so WHAT the profile converges to is P-invariant.
     const inputs = session();
-    // Small reach bounds per-turn divergence (gentle KV) but compresses less
-    // efficiently; large reach reaches deep. The robust signals are average
-    // per-turn perturbation (RMS) and total recompute. (Worst-case maxPert and
-    // fold *frequency* are noisy — a too-tight reach can trip an emergency deep
-    // fold to stay under W.)
     const shallow = replayControlled(inputs, { ...BASE, reachTokens: 8_000 });
     const deep = replayControlled(inputs, { ...BASE, reachTokens: 60_000 });
-    assert.equal(shallow.escalations, 0, 'tight reach stays feasible here');
-    assert.equal(deep.escalations, 0, 'wide reach stays feasible here');
-    assert.ok(shallow.rmsPerturbation < deep.rmsPerturbation, `tighter reach → lower average per-turn perturbation (${shallow.rmsPerturbation.toFixed(0)} < ${deep.rmsPerturbation.toFixed(0)})`);
-    assert.ok(shallow.totalRecomputed <= deep.totalRecomputed, `tighter reach → no more total recompute (${shallow.totalRecomputed} ≤ ${deep.totalRecomputed})`);
+    assert.equal(shallow.escalations, 0, 'tight P stays feasible');
+    assert.equal(deep.escalations, 0, 'wide P stays feasible');
+    const lastS = shallow.steps[shallow.steps.length - 1];
+    const lastD = deep.steps[deep.steps.length - 1];
+    assert.equal(lastS.renderedTokens, lastD.renderedTokens, 'same final render size');
+    assert.equal(lastS.deepestLevel, lastD.deepestLevel, 'same final fold depth');
+    // The relevance-correct shed folds at the prefix start, which cannot be
+    // amortized below the invalidation floor — so a tight P pays the same bill.
+    assert.equal(shallow.totalRecomputed, deep.totalRecomputed, 'P does not change what gets folded at these settings');
 });
 test('bidirectional: under budget with a folded F_prev, un-folds to use headroom', () => {
     const inputs = session(); // 72 chunks × 1000 = 72k raw
@@ -122,7 +128,7 @@ test('foldDepthCap is monotone non-decreasing in age and capped', () => {
     let prev = -1;
     for (let age = 0; age <= 5000; age += 50) {
         const cap = foldDepthCap(mk(0), age, new Set(), 10, 6);
-        assert.ok(cap >= 0 && cap <= 3, 'cap in [0,3]');
+        assert.ok(cap >= 0 && cap <= 8, 'cap in [0, MAX_FOLD_LEVEL]');
         assert.ok(cap >= prev, 'non-decreasing in age');
         prev = cap;
     }

package/dist/test/adaptive/kv-control.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"kv-control.test.js","sourceRoot":"","sources":["../../../test/adaptive/kv-control.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACjE,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,YAAY,GAEb,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,uBAAuB,EAAsB,MAAM,cAAc,CAAC;AAI3E,SAAS,QAAQ,CAAC,EAAiB;IACjC,OAAO;QACL,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;QACjF,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,SAAS,OAAO;IACd,OAAO,QAAQ,CAAC,uBAAuB,CAAC;QACtC,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG;KAC/E,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,IAAI,GAAmB;IAC3B,YAAY,EAAE,MAAM;IACpB,YAAY,EAAE,MAAM;IACpB,oBAAoB,EAAE,KAAK;IAC3B,cAAc,EAAE,CAAC;IACjB,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,EAAE;CAChB,CAAC;AAEF,IAAI,CAAC,qEAAqE,EAAE,GAAG,EAAE;IAC/E,kDAAkD;IAClD,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACtH,MAAM,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC;IAClI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAC1D,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IACpE,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;IAC/C,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACvH,iEAAiE;IACjE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;IAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,EAAE,8BAA8B,CAAC,CAAC;IAE5D,4EAA4E;IAC5E,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACvF,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,uBAAuB,CAAC,CAAC;IACtF,oDAAoD;IACpD,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACvF,KAAK,IAAI,CAAC;AACZ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;IACtE,yEAAyE;IACzE,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACvH,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM;QAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,mBAAmB;IAC/D,MAAM,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;QACvC,GAAG,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,oBAAoB,EAAE,KAAK;KACxG,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,EAAE,gEAAgE,CAAC,CAAC;AACjG,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,iFAAiF,EAAE,GAAG,EAAE;IAC3F,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC;IACzB,yEAAyE;IACzE,wEAAwE;IACxE,2EAA2E;IAC3E,4EAA4E;IAC5E,yBAAyB;IACzB,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;IAC1E,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;IAExE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,iCAAiC,CAAC,CAAC;IACxE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,gCAAgC,CAAC,CAAC;IACpE,MAAM,CAAC,EAAE,CACP,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,EAC9C,wDAAwD,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CACnI,CAAC;IACF,MAAM,CAAC,EAAE,CACP,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC,eAAe,EAC/C,4CAA4C,OAAO,CAAC,eAAe,MAAM,IAAI,CAAC,eAAe,GAAG,CACjG,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4EAA4E,EAAE,GAAG,EAAE;IACtF,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC,CAAC,6BAA6B;IACvD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,oDAAoD;IACpD,MAAM,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAClD,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM;QAClF,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC;IAEtE,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QACpD,QAAQ,EAAE,MAAM,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAChG,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAC5E,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,kBAAkB,QAAQ,CAAC,MAAM,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACnG,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,IAAI,MAAM,EAAE,wBAAwB,QAAQ,CAAC,MAAM,UAAU,CAAC,CAAC;IAExF,+EAA+E;IAC/E,MAAM,KAAK,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QACjD,QAAQ,EAAE,QAAQ,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClG,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,2BAA2B,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;IACvC,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC;IACzB,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;IACrE,MAAM,EAAE,GAAG,CAAC,GAAW,EAAe,EAAE,CAAC,CAAC;QACxC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,iBAAiB,EAAE,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;KACxG,CAAC,CAAC;IACH,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,cAAc,CAAC,CAAC;QAChD,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAChD,IAAI,GAAG,GAAG,CAAC;IACb,CAAC;AACH,CAAC,CAAC,CAAC"}
+{"version":3,"file":"kv-control.test.js","sourceRoot":"","sources":["../../../test/adaptive/kv-control.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACjE,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,YAAY,GAEb,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,uBAAuB,EAAsB,MAAM,cAAc,CAAC;AAI3E,SAAS,QAAQ,CAAC,EAAiB;IACjC,OAAO;QACL,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;QACjF,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,SAAS,OAAO;IACd,OAAO,QAAQ,CAAC,uBAAuB,CAAC;QACtC,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG;KAC/E,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,IAAI,GAAmB;IAC3B,YAAY,EAAE,MAAM;IACpB,YAAY,EAAE,MAAM;IACpB,oBAAoB,EAAE,KAAK;IAC3B,cAAc,EAAE,CAAC;IACjB,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,EAAE;CAChB,CAAC;AAEF,IAAI,CAAC,qEAAqE,EAAE,GAAG,EAAE;IAC/E,kDAAkD;IAClD,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACtH,MAAM,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC;IAClI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAC1D,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IACpE,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;IAC/C,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACvH,iEAAiE;IACjE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;IAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,EAAE,8BAA8B,CAAC,CAAC;IAE5D,4EAA4E;IAC5E,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACvF,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,uBAAuB,CAAC,CAAC;IACtF,oDAAoD;IACpD,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACvF,KAAK,IAAI,CAAC;AACZ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;IACtE,yEAAyE;IACzE,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;IACvH,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM;QAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,mBAAmB;IAC/D,MAAM,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;QACvC,GAAG,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,oBAAoB,EAAE,KAAK;KACxG,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,EAAE,gEAAgE,CAAC,CAAC;AACjG,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;IACvF,qEAAqE;IACrE,yEAAyE;IACzE,oEAAoE;IACpE,wEAAwE;IACxE,4EAA4E;IAC5E,8DAA8D;IAC9D,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;IAC1E,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;IAExE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,wBAAwB,CAAC,CAAC;IAC/D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,uBAAuB,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,wBAAwB,CAAC,CAAC;IACnF,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE,uBAAuB,CAAC,CAAC;IAC9E,wEAAwE;IACxE,4EAA4E;IAC5E,MAAM,CAAC,KAAK,CACV,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,eAAe,EAC7C,sDAAsD,CACvD,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4EAA4E,EAAE,GAAG,EAAE;IACtF,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC,CAAC,6BAA6B;IACvD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,oDAAoD;IACpD,MAAM,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAClD,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM;QAClF,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC;IAEtE,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QACpD,QAAQ,EAAE,MAAM,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAChG,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAC5E,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,kBAAkB,QAAQ,CAAC,MAAM,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACnG,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,IAAI,MAAM,EAAE,wBAAwB,QAAQ,CAAC,MAAM,UAAU,CAAC,CAAC;IAExF,+EAA+E;IAC/E,MAAM,KAAK,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QACjD,QAAQ,EAAE,QAAQ,CAAC,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClG,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;KACjE,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,2BAA2B,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;IACvC,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC;IACzB,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;IACrE,MAAM,EAAE,GAAG,CAAC,GAAW,EAAe,EAAE,CAAC,CAAC;QACxC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,iBAAiB,EAAE,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;KACxG,CAAC,CAAC;IACH,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,4BAA4B,CAAC,CAAC;QAC9D,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAChD,IAAI,GAAG,GAAG,CAAC;IACb,CAAC;AACH,CAAC,CAAC,CAAC"}

package/dist/test/adaptive/single-path-solve.test.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Rev 5.0 single-path solve (design §13) — regression tests.
+ *
+ * Load-bearing properties:
+ *  - a bootstrap solve (no carried frontier) produces an age-monotone
+ *    resolution gradient — the 2026-07-12 mythos inversion (old fine / recent
+ *    deep) is unconstructible from scratch;
+ *  - an INVERTED carried profile sitting comfortably in the dead band is
+ *    detected as a quality gap and self-heals (override 'quality-gap') instead
+ *    of fossilizing;
+ *  - low-salience chunks fold before equally-aged high-salience ones;
+ *  - when the trust region P binds, the solver adopts the ideal's newest
+ *    changes only (suffix adoption) with perturbation ≤ P and no override.
+ */
+export {};
+//# sourceMappingURL=single-path-solve.test.d.ts.map

package/dist/test/adaptive/single-path-solve.test.d.ts.map

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

package/dist/test/adaptive/single-path-solve.test.js

@@ -0,0 +1,204 @@
+/**
+ * Rev 5.0 single-path solve (design §13) — regression tests.
+ *
+ * Load-bearing properties:
+ *  - a bootstrap solve (no carried frontier) produces an age-monotone
+ *    resolution gradient — the 2026-07-12 mythos inversion (old fine / recent
+ *    deep) is unconstructible from scratch;
+ *  - an INVERTED carried profile sitting comfortably in the dead band is
+ *    detected as a quality gap and self-heals (override 'quality-gap') instead
+ *    of fossilizing;
+ *  - low-salience chunks fold before equally-aged high-salience ones;
+ *  - when the trust region P binds, the solver adopts the ideal's newest
+ *    changes only (suffix adoption) with perturbation ≤ P and no override.
+ */
+import { test } from 'node:test';
+import assert from 'node:assert/strict';
+import { SummaryTree } from '../../src/adaptive/summary-tree.js';
+import { planControlledFrontier } from '../../src/adaptive/kv-control.js';
+import { buildChronicleWithChain } from './harness.js';
+function inputsOf(ch) {
+    return {
+        chunks: ch.chunks, summaries: ch.summaries, recallPairTokens: ch.recallPairTokens,
+        headTokens: 0, tailTokens: 0, headChunkIds: new Set(), tailChunkIds: new Set(),
+    };
+}
+/** 90 chunks × 1000t, base-6 chain (15 L1s, 2 L2s over c-0000..0071). */
+function session() {
+    const ch = buildChronicleWithChain({
+        chunkCount: 90, tokensPerChunk: 1000, mergeThreshold: 6, recallPairTokens: 200,
+    });
+    const inputs = inputsOf(ch);
+    return { ch, inputs, tree: new SummaryTree(inputs) };
+}
+/** Newest `n` chunk ids (the flat zone / attended tail). */
+function tailZone(inputs, n) {
+    const ordered = [...inputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    return new Set(ordered.slice(-n).map((c) => c.id));
+}
+/** Assert resolution levels are non-increasing with recency (older ≥ newer). */
+function assertAgeMonotone(resolutions, inputs, skip) {
+    const ordered = [...inputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    let prevLevel = Number.POSITIVE_INFINITY;
+    for (const c of ordered) {
+        if (skip.has(c.id))
+            continue;
+        const lvl = resolutions.get(c.id) ?? 0;
+        assert.ok(lvl <= prevLevel, `age-monotone violated at ${c.id}: L${lvl} deeper than older neighbor's L${prevLevel}`);
+        prevLevel = lvl;
+    }
+}
+test('bootstrap solve is age-monotone — the inversion is unconstructible from scratch', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 12);
+    const plan = planControlledFrontier(inputs, tree, {
+        previous: new Map(),
+        foldAtTokens: 30_000, expandAtTokens: 24_000, targetTokens: 24_000,
+        windowTokens: 60_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    assert.equal(plan.override, 'bootstrap', 'empty F_prev → bootstrap override');
+    assert.ok(plan.tokens <= 30_000, `fits the operating band (${plan.tokens})`);
+    assertAgeMonotone(plan.resolutions, inputs, rawZone);
+    // The gradient actually folds something (this fixture is 90k raw vs 24k target).
+    const deepest = Math.max(...[...plan.resolutions.values()]);
+    assert.ok(deepest >= 1, 'bootstrap under pressure folds');
+});
+test('inverted carried profile in the dead band self-heals (quality-gap override)', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 18); // c-0072..0089 attended
+    // The mythos shape: NEWER middle (c-0036..0071, the second L2 group) crushed
+    // to L2 while the OLDEST middle (c-0000..0035) sits raw. Group-consistent by
+    // construction. Renders ≈ 36k(old raw) + 200(L2 recall) + 18k(tail) ≈ 54k.
+    const inverted = new Map();
+    for (const c of inputs.chunks) {
+        const seq = c.sequence;
+        inverted.set(c.id, seq >= 36 && seq <= 71 ? 2 : 0);
+    }
+    // Band chosen so the inverted profile is comfortably feasible and in-band:
+    // the OLD solver would hold it forever (dead band → zero perturbation).
+    const band = {
+        foldAtTokens: 55_000, expandAtTokens: 20_000, targetTokens: 40_000,
+        windowTokens: 60_000, rawZone, now: 89, mergeThreshold: 6,
+    };
+    // Default trust region (= W): the misallocation is detected THROUGH the dead
+    // band and repaired within P — no override needed, real perturbation paid.
+    const plan = planControlledFrontier(inputs, tree, { previous: inverted, ...band });
+    assert.equal(plan.override, undefined, 'repair fits the default trust region');
+    assertAgeMonotone(plan.resolutions, inputs, rawZone);
+    assert.ok(plan.perturbation > 0, 'self-heal pays a real (reported) perturbation');
+    assert.ok(plan.tokens <= 55_000, 'result stays inside the band');
+    // Tiny trust region: no useful suffix fits under P, and holding the inverted
+    // profile is certifiably bad → the quality-gap override fires and the ideal
+    // is adopted anyway. This is the anti-fossilization property.
+    const tiny = planControlledFrontier(inputs, tree, {
+        previous: inverted, ...band, reachTokens: 1_000,
+    });
+    assert.equal(tiny.override, 'quality-gap', 'P priced out by the quality gap');
+    assertAgeMonotone(tiny.resolutions, inputs, rawZone);
+});
+test('a WELL-allocated in-band profile still holds (dead band preserved)', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 18);
+    // First get a sane profile from the solver itself…
+    const first = planControlledFrontier(inputs, tree, {
+        previous: new Map(),
+        foldAtTokens: 55_000, expandAtTokens: 20_000, targetTokens: 40_000,
+        windowTokens: 60_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    // …then feed it back: nothing should move, zero perturbation.
+    const second = planControlledFrontier(inputs, tree, {
+        previous: first.resolutions,
+        foldAtTokens: 55_000, expandAtTokens: 20_000, targetTokens: 40_000,
+        windowTokens: 60_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    assert.equal(second.perturbation, 0, 'quiet turn: zero perturbation');
+    assert.ok(!second.folded && !second.expanded, 'quiet turn: no movement');
+    assert.equal(second.override, undefined, 'no override on a quiet turn');
+});
+test('low-salience chunks fold before equally-aged high-salience ones', () => {
+    const { ch, inputs, tree } = session();
+    // Mark ONE L1 group (c-0060..0065 — among the youngest with L1 coverage)
+    // as fold-cheap; everything else default salience.
+    for (const c of ch.chunks) {
+        if (c.sequence >= 60 && c.sequence <= 65)
+            c.salience = 0.1;
+    }
+    const rawZone = tailZone(inputs, 12);
+    // Target trims just a little: only the cheapest information should fold.
+    const plan = planControlledFrontier(inputs, tree, {
+        previous: new Map(),
+        foldAtTokens: 85_000, expandAtTokens: 84_500, targetTokens: 84_500,
+        windowTokens: 200_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    const lowSalLevel = plan.resolutions.get('c-0060') ?? 0;
+    const oldHighSalLevel = plan.resolutions.get('c-0000') ?? 0;
+    assert.ok(lowSalLevel >= 1, `fold-cheap group folded first (got L${lowSalLevel})`);
+    assert.equal(oldHighSalLevel, 0, 'older but salient content stays raw');
+});
+test('trust region binds → suffix adoption: newest changes only, perturbation ≤ P', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 12);
+    // Carried = everything raw (a real F_prev: non-empty, all zeros), over foldAt.
+    const carried = new Map(inputs.chunks.map((c) => [c.id, 0]));
+    // P above the physical floor but below the full repair (≈26.2k here). Note
+    // the floor is HIGH relative to the repair: rev-5.0 folds oldest-first, so
+    // the ideal's changes cluster at the OLD end and even the newest-changes
+    // suffix invalidates most of the render — the trust region's amortization
+    // value on shed turns is structurally thin (it matters most for tail-near
+    // rebalances). The pack phase's approach-target acceptance (2026-07-12)
+    // raised the floor further by keeping the newest group raw in the ideal.
+    const P = 26_000;
+    const plan = planControlledFrontier(inputs, tree, {
+        previous: carried,
+        foldAtTokens: 30_000, expandAtTokens: 24_000, targetTokens: 24_000,
+        windowTokens: 200_000, reachTokens: P, rawZone, now: 89, mergeThreshold: 6,
+    });
+    assert.equal(plan.override, undefined, 'trust region honored — no override');
+    assert.ok(plan.perturbation <= P, `perturbation ${plan.perturbation} ≤ P ${P}`);
+    assert.ok(plan.folded, 'made progress toward the ideal');
+    assert.ok(plan.tokens < 90_000, 'render shrank');
+    // Receding horizon: iterating converges (overrides allowed when the
+    // remaining old-end changes can't fit any suffix under P).
+    let prev = plan.resolutions;
+    let tokens = plan.tokens;
+    for (let i = 0; i < 40 && tokens > 30_000; i++) {
+        const next = planControlledFrontier(inputs, tree, {
+            previous: prev,
+            foldAtTokens: 30_000, expandAtTokens: 24_000, targetTokens: 24_000,
+            windowTokens: 200_000, reachTokens: P, rawZone, now: 89, mergeThreshold: 6,
+        });
+        assert.ok(next.override !== undefined || next.perturbation <= P, `iteration ${i}: perturbation ${next.perturbation} ≤ P unless overridden`);
+        prev = next.resolutions;
+        tokens = next.tokens;
+    }
+    assert.ok(tokens <= 30_000, `converged into the band over turns (${tokens})`);
+});
+test('P below the physical floor cannot stall: no-progress partial is overridden', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 12);
+    const carried = new Map(inputs.chunks.map((c) => [c.id, 0]));
+    // P far below the smallest meaningful fold's invalidation (~19k): the only
+    // suffix within P is "adopt nothing", which must NOT be accepted while a
+    // shed is required — the solver overrides instead of stalling over budget.
+    const plan = planControlledFrontier(inputs, tree, {
+        previous: carried,
+        foldAtTokens: 30_000, expandAtTokens: 24_000, targetTokens: 24_000,
+        windowTokens: 200_000, reachTokens: 2_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    assert.ok(plan.override !== undefined, 'no-progress plan is overridden');
+    assert.ok(plan.tokens <= 30_000, `sheds to the band anyway (${plan.tokens})`);
+});
+test('infeasible within P → override, feasibility beats the trust region', () => {
+    const { inputs, tree } = session();
+    const rawZone = tailZone(inputs, 6);
+    const carried = new Map(inputs.chunks.map((c) => [c.id, 0]));
+    // W below the raw size: something MUST fold beyond what a tiny P allows.
+    const plan = planControlledFrontier(inputs, tree, {
+        previous: carried,
+        foldAtTokens: 40_000, expandAtTokens: 30_000, targetTokens: 30_000,
+        windowTokens: 50_000, reachTokens: 1_000, rawZone, now: 89, mergeThreshold: 6,
+    });
+    assert.ok(plan.override === 'infeasible' || plan.override === 'quality-gap', `P priced out (got ${plan.override ?? 'none'})`);
+    assert.ok(plan.tokens <= 50_000, 'fits under W');
+});
+//# sourceMappingURL=single-path-solve.test.js.map

package/dist/test/adaptive/single-path-solve.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"single-path-solve.test.js","sourceRoot":"","sources":["../../../test/adaptive/single-path-solve.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACjE,OAAO,EAAE,sBAAsB,EAAE,MAAM,kCAAkC,CAAC;AAC1E,OAAO,EAAE,uBAAuB,EAAsB,MAAM,cAAc,CAAC;AAI3E,SAAS,QAAQ,CAAC,EAAiB;IACjC,OAAO;QACL,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;QACjF,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,yEAAyE;AACzE,SAAS,OAAO;IACd,MAAM,EAAE,GAAG,uBAAuB,CAAC;QACjC,UAAU,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG;KAC/E,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC5B,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,4DAA4D;AAC5D,SAAS,QAAQ,CAAC,MAAoB,EAAE,CAAS;IAC/C,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3E,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,gFAAgF;AAChF,SAAS,iBAAiB,CACxB,WAAyC,EACzC,MAAoB,EACpB,IAA0B;IAE1B,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3E,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7B,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,EAAE,CACP,GAAG,IAAI,SAAS,EAChB,4BAA4B,CAAC,CAAC,EAAE,MAAM,GAAG,kCAAkC,SAAS,EAAE,CACvF,CAAC;QACF,SAAS,GAAG,GAAG,CAAC;IAClB,CAAC;AACH,CAAC;AAED,IAAI,CAAC,iFAAiF,EAAE,GAAG,EAAE;IAC3F,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC1D,CAAC,CAAC;IACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,mCAAmC,CAAC,CAAC;IAC9E,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,4BAA4B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7E,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACrD,iFAAiF;IACjF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,CAAC,EAAE,CAAC,OAAO,IAAI,CAAC,EAAE,gCAAgC,CAAC,CAAC;AAC5D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;IACvF,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,wBAAwB;IAC9D,6EAA6E;IAC7E,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,2EAA2E;IAC3E,wEAAwE;IACxE,MAAM,IAAI,GAAG;QACX,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KACjD,CAAC;IAEX,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IACnF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAC/E,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACrD,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,+CAA+C,CAAC,CAAC;IAClF,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,8BAA8B,CAAC,CAAC;IAEjE,6EAA6E;IAC7E,4EAA4E;IAC5E,8DAA8D;IAC9D,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,KAAK;KAChD,CAAC,CAAC;IACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,iCAAiC,CAAC,CAAC;IAC9E,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AACvD,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;IAC9E,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,mDAAmD;IACnD,MAAM,KAAK,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QACjD,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC1D,CAAC,CAAC;IACH,8DAA8D;IAC9D,MAAM,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAClD,QAAQ,EAAE,KAAK,CAAC,WAAW;QAC3B,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC1D,CAAC,CAAC;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,+BAA+B,CAAC,CAAC;IACtE,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,yBAAyB,CAAC,CAAC;IACzE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,EAAE,6BAA6B,CAAC,CAAC;AAC1E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,iEAAiE,EAAE,GAAG,EAAE;IAC3E,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACvC,yEAAyE;IACzE,mDAAmD;IACnD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,QAAQ,IAAI,EAAE,IAAI,CAAC,CAAC,QAAQ,IAAI,EAAE;YAAE,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC7D,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,yEAAyE;IACzE,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC3D,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACxD,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5D,MAAM,CAAC,EAAE,CAAC,WAAW,IAAI,CAAC,EAAE,uCAAuC,WAAW,GAAG,CAAC,CAAC;IACnF,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC,EAAE,qCAAqC,CAAC,CAAC;AAC1E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;IACvF,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAkB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,2EAA2E;IAC3E,2EAA2E;IAC3E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,MAAM,CAAC,GAAG,MAAM,CAAC;IACjB,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC3E,CAAC,CAAC;IACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,oCAAoC,CAAC,CAAC;IAC7E,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,EAAE,gBAAgB,IAAI,CAAC,YAAY,QAAQ,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,gCAAgC,CAAC,CAAC;IACzD,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,EAAE,eAAe,CAAC,CAAC;IACjD,oEAAoE;IACpE,2DAA2D;IAC3D,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;IAC5B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;YAChD,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;YAClE,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;SAC3E,CAAC,CAAC;QACH,MAAM,CAAC,EAAE,CACP,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,IAAI,CAAC,EACrD,aAAa,CAAC,kBAAkB,IAAI,CAAC,YAAY,wBAAwB,CAC1E,CAAC;QACF,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QACxB,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IACD,MAAM,CAAC,EAAE,CAAC,MAAM,IAAI,MAAM,EAAE,uCAAuC,MAAM,GAAG,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4EAA4E,EAAE,GAAG,EAAE;IACtF,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAkB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,2EAA2E;IAC3E,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC/E,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,gCAAgC,CAAC,CAAC;IACzE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,6BAA6B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;IAC9E,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAkB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,yEAAyE;IACzE,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;QAChD,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;QAClE,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;KAC9E,CAAC,CAAC;IACH,MAAM,CAAC,EAAE,CACP,IAAI,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,QAAQ,KAAK,aAAa,EACjE,qBAAqB,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG,CAChD,CAAC;IACF,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,cAAc,CAAC,CAAC;AACnD,CAAC,CAAC,CAAC"}

package/dist/test/anti-redundancy-budget.test.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Bug 6.9: anti-redundancy × budget-cap = silent memory holes.
+ *
+ * `getAntiRedundantSummaries` excludes an L2 when ALL of its source L1s are
+ * in the CANDIDATE shown-set — computed BEFORE budget selection. When the
+ * budget cap (e.g. KnowledgeStrategy's research L1 cap) then drops some of
+ * those L1s, their parent L2 was already excluded, so the covered history
+ * appears at NEITHER level — unrecoverable until a later merge changes the
+ * shown-set. Long research-heavy runs lose their oldest research memories
+ * entirely and the agent re-researches (a token-burning feedback loop).
+ *
+ * Fix: a post-selection coverage-repair pass in selectHierarchical
+ * re-includes an excluded L2/L3 whose children did not all survive budget
+ * selection.
+ */
+export {};
+//# sourceMappingURL=anti-redundancy-budget.test.d.ts.map

package/dist/test/anti-redundancy-budget.test.d.ts.map

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

package/dist/test/anti-redundancy-budget.test.js

@@ -0,0 +1,197 @@
+/**
+ * Bug 6.9: anti-redundancy × budget-cap = silent memory holes.
+ *
+ * `getAntiRedundantSummaries` excludes an L2 when ALL of its source L1s are
+ * in the CANDIDATE shown-set — computed BEFORE budget selection. When the
+ * budget cap (e.g. KnowledgeStrategy's research L1 cap) then drops some of
+ * those L1s, their parent L2 was already excluded, so the covered history
+ * appears at NEITHER level — unrecoverable until a later merge changes the
+ * shown-set. Long research-heavy runs lose their oldest research memories
+ * entirely and the agent re-researches (a token-burning feedback loop).
+ *
+ * Fix: a post-selection coverage-repair pass in selectHierarchical
+ * re-includes an excluded L2/L3 whose children did not all survive budget
+ * selection.
+ */
+import { describe, it, before, after } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, KnowledgeStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-anti-redundancy-budget';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+describe('Anti-redundancy vs budget cap (memory-hole repair)', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    it('re-includes an excluded L2 when the budget drops its L1 children', async () => {
+        cleanup();
+        const strategy = new KnowledgeStrategy({
+            targetChunkTokens: 20, // research max = 40 → one tool pair per chunk
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            autoTickOnNewMessage: false,
+            // Tight L1 budget: research cap = 0.3 * 1000 = 300 tokens → only 3 of
+            // the 10 research L1s (100 tokens each) survive selection.
+            l1BudgetTokens: 1000,
+            l2BudgetTokens: 0,
+            l3BudgetTokens: 0,
+            researchL1BudgetCap: 0.3,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        // 10 research tool pairs → 10 chunks of [tool_use, tool_result].
+        for (let k = 0; k < 10; k++) {
+            manager.addMessage('Claude', [
+                { type: 'tool_use', id: `tu-${k}`, name: 'mcpl:search', input: { q: 'x'.repeat(120) } },
+            ]);
+            manager.addMessage('User', [
+                { type: 'tool_result', toolUseId: `tu-${k}`, content: 'r'.repeat(120) },
+            ]);
+        }
+        const s = strategy;
+        const internals = manager;
+        s.rebuildChunks(internals.messageStore);
+        assert.ok(s.chunks.length >= 6, `need several chunks to exercise the cap, got ${s.chunks.length}`);
+        // Inject one research L1 per chunk (sourceIds exactly matching the chunk
+        // key, so rebuildChunks re-links them as compressed and the raw fallback
+        // does NOT re-emit these messages), plus one L2 covering ALL the L1s.
+        // The L1s are unmerged — the candidate shown-set contains all of them, so
+        // pre-fix anti-redundancy excludes the L2 outright.
+        const l1Ids = [];
+        const allMsgIds = [];
+        s.chunks.forEach((chunk, i) => {
+            const msgIds = chunk.messages.map(m => m.id);
+            allMsgIds.push(...msgIds);
+            const id = `L1-${i}`;
+            l1Ids.push(id);
+            s.summaries.push({
+                id,
+                level: 1,
+                content: `[[R${i}]] research memory ${i}`,
+                tokens: 100,
+                sourceLevel: 0,
+                sourceIds: msgIds,
+                sourceRange: { first: msgIds[0], last: msgIds[msgIds.length - 1] },
+                created: Date.now(),
+                phaseType: 'research',
+            });
+        });
+        s.summaries.push({
+            id: 'L2-0',
+            level: 2,
+            content: '[[L2COVER]] consolidated research memory',
+            tokens: 150,
+            sourceLevel: 1,
+            sourceIds: l1Ids,
+            sourceRange: { first: allMsgIds[0], last: allMsgIds[allMsgIds.length - 1] },
+            created: Date.now(),
+        });
+        // Render with a generous overall budget — the hole is created by the
+        // research cap, not by overall exhaustion.
+        const entries = strategy.select(internals.messageStore.createView(), internals.contextLog.createView(), { maxTokens: 50000, reserveForResponse: 0 });
+        const renderedText = entries
+            .map(e => e.content.filter(b => b.type === 'text').map(b => b.text).join('\n'))
+            .join('\n');
+        const rawMsgIds = new Set(entries.map(e => e.sourceMessageId).filter(Boolean));
+        // Which L1s made it?
+        const shownL1Indexes = new Set();
+        for (let i = 0; i < l1Ids.length; i++) {
+            if (renderedText.includes(`[[R${i}]]`))
+                shownL1Indexes.add(i);
+        }
+        assert.ok(shownL1Indexes.size < l1Ids.length, 'test setup: the research cap should drop at least one L1 (else nothing to repair)');
+        // The core assertion: every source message is represented at SOME level —
+        // raw, via its L1, or via the L2 that covers everything.
+        const l2Shown = renderedText.includes('[[L2COVER]]');
+        s.chunks.forEach((chunk, i) => {
+            for (const m of chunk.messages) {
+                const represented = rawMsgIds.has(m.id) || shownL1Indexes.has(i) || l2Shown;
+                assert.ok(represented, `message ${m.id} (chunk ${i}) is represented at no level — silent memory hole`);
+            }
+        });
+        // And specifically: since the cap dropped some L1s, the parent L2 must
+        // have been re-included.
+        assert.ok(l2Shown, 'excluded L2 must be re-included when its children are budget-dropped');
+        await manager.close();
+    });
+    it('bounds coverage repairs by a per-level allowance and warns on a corrupted store', async () => {
+        cleanup();
+        const strategy = new KnowledgeStrategy({
+            targetChunkTokens: 20,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            autoTickOnNewMessage: false,
+            l1BudgetTokens: 1000,
+            l2BudgetTokens: 0, // zero level budget → repair falls back to the floor
+            l3BudgetTokens: 0,
+            researchL1BudgetCap: 0.3, // drops most L1s → every covering L2 is a repair candidate
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        for (let k = 0; k < 10; k++) {
+            manager.addMessage('Claude', [
+                { type: 'tool_use', id: `tu-${k}`, name: 'mcpl:search', input: { q: 'x'.repeat(120) } },
+            ]);
+            manager.addMessage('User', [
+                { type: 'tool_result', toolUseId: `tu-${k}`, content: 'r'.repeat(120) },
+            ]);
+        }
+        const s = strategy;
+        const internals = manager;
+        s.rebuildChunks(internals.messageStore);
+        const l1Ids = [];
+        const allMsgIds = [];
+        s.chunks.forEach((chunk, i) => {
+            const msgIds = chunk.messages.map(m => m.id);
+            allMsgIds.push(...msgIds);
+            const id = `L1-${i}`;
+            l1Ids.push(id);
+            s.summaries.push({
+                id, level: 1, content: `[[R${i}]] research memory ${i}`, tokens: 100,
+                sourceLevel: 0, sourceIds: msgIds,
+                sourceRange: { first: msgIds[0], last: msgIds[msgIds.length - 1] },
+                created: Date.now(), phaseType: 'research',
+            });
+        });
+        // Simulate a store damaged mid-merge: MANY excluded L2s, each covering all
+        // L1s (so each is individually a repair candidate once the cap drops L1s).
+        const L2_COUNT = 6;
+        for (let j = 0; j < L2_COUNT; j++) {
+            s.summaries.push({
+                id: `L2-${j}`, level: 2, content: `[[L2-${j}]] consolidated research ${j}`, tokens: 150,
+                sourceLevel: 1, sourceIds: l1Ids,
+                sourceRange: { first: allMsgIds[0], last: allMsgIds[allMsgIds.length - 1] },
+                created: Date.now(),
+            });
+        }
+        const warnings = [];
+        const origWarn = console.warn;
+        console.warn = (...args) => { warnings.push(args.join(' ')); };
+        let entries;
+        try {
+            // Small overall budget → floor allowance (0.05 * maxTokens) is small, so
+            // only a couple of the six covering L2s can be re-included.
+            entries = strategy.select(internals.messageStore.createView(), internals.contextLog.createView(), { maxTokens: 8000, reserveForResponse: 0 });
+        }
+        finally {
+            console.warn = origWarn;
+        }
+        const renderedText = entries
+            .map(e => e.content.filter(b => b.type === 'text').map(b => b.text).join('\n'))
+            .join('\n');
+        const l2ShownCount = Array.from({ length: L2_COUNT }, (_, j) => j)
+            .filter(j => renderedText.includes(`[[L2-${j}]]`)).length;
+        assert.ok(l2ShownCount >= 1, 'at least one covering L2 should still be repaired');
+        assert.ok(l2ShownCount < L2_COUNT, `repair allowance must cap re-inclusion, but all ${L2_COUNT} L2s rendered`);
+        assert.ok(warnings.some(w => w.includes('coverage-repair allowance exceeded')), 'a corrupted store exceeding the repair allowance must warn');
+        await manager.close();
+    });
+});
+//# sourceMappingURL=anti-redundancy-budget.test.js.map

package/dist/test/anti-redundancy-budget.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-redundancy-budget.test.js","sourceRoot":"","sources":["../../test/anti-redundancy-budget.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAIpE,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,QAAQ,CAAC,oDAAoD,EAAE,GAAG,EAAE;IAClE,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvB,EAAE,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;QAChF,OAAO,EAAE,CAAC;QACV,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC;YACrC,iBAAiB,EAAE,EAAE,EAAE,8CAA8C;YACrE,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,oBAAoB,EAAE,KAAK;YAC3B,sEAAsE;YACtE,2DAA2D;YAC3D,cAAc,EAAE,IAAI;YACpB,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,CAAC;YACjB,mBAAmB,EAAE,GAAG;SACzB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,iEAAiE;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE;gBAC3B,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;aACtE,CAAC,CAAC;YACrB,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE;gBACzB,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;aACtD,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,CAAC,GAAG,QAIT,CAAC;QACF,MAAM,SAAS,GAAG,OAGjB,CAAC;QACF,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAExC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,gDAAgD,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAEnG,yEAAyE;QACzE,yEAAyE;QACzE,sEAAsE;QACtE,0EAA0E;QAC1E,oDAAoD;QACpD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBACf,EAAE;gBACF,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,MAAM,CAAC,sBAAsB,CAAC,EAAE;gBACzC,MAAM,EAAE,GAAG;gBACX,WAAW,EAAE,CAAC;gBACd,SAAS,EAAE,MAAM;gBACjB,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;gBAClE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;gBACnB,SAAS,EAAE,UAAU;aACtB,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM;YACV,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,0CAA0C;YACnD,MAAM,EAAE,GAAG;YACX,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,KAAK;YAChB,WAAW,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;YAC3E,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC,CAAC;QAEH,qEAAqE;QACrE,2CAA2C;QAC3C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAC7B,SAAS,CAAC,YAAY,CAAC,UAAU,EAAW,EAC5C,SAAS,CAAC,UAAU,CAAC,UAAU,EAAW,EAC1C,EAAE,SAAS,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAC1B,CAAC;QAEpB,MAAM,YAAY,GAAG,OAAO;aACzB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAsB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACpG,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAE/E,qBAAqB;QACrB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,MAAM,CAAC,EAAE,CACP,cAAc,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAClC,mFAAmF,CACpF,CAAC;QAEF,0EAA0E;QAC1E,yDAAyD;QACzD,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QACrD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,WAAW,GACf,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAW,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC;gBACnE,MAAM,CAAC,EAAE,CACP,WAAW,EACX,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,mDAAmD,CAC/E,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,uEAAuE;QACvE,yBAAyB;QACzB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,sEAAsE,CAAC,CAAC;QAE3F,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iFAAiF,EAAE,KAAK,IAAI,EAAE;QAC/F,OAAO,EAAE,CAAC;QACV,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC;YACrC,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,oBAAoB,EAAE,KAAK;YAC3B,cAAc,EAAE,IAAI;YACpB,cAAc,EAAE,CAAC,EAAE,qDAAqD;YACxE,cAAc,EAAE,CAAC;YACjB,mBAAmB,EAAE,GAAG,EAAE,2DAA2D;SACtF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE;gBAC3B,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;aACtE,CAAC,CAAC;YACrB,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE;gBACzB,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;aACtD,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,CAAC,GAAG,QAIT,CAAC;QACF,MAAM,SAAS,GAAG,OAGjB,CAAC;QACF,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAExC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,sBAAsB,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG;gBACpE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM;gBACjC,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;gBAClE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,UAAU;aAC3C,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,2EAA2E;QAC3E,2EAA2E;QAC3E,MAAM,QAAQ,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,4BAA4B,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG;gBACvF,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK;gBAChC,WAAW,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;gBAC3E,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;aACpB,CAAC,CAAC;QACL,CAAC;QAED,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;QAC9B,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,IAAe,EAAE,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,IAAI,OAAuB,CAAC;QAC5B,IAAI,CAAC;YACH,yEAAyE;YACzE,4DAA4D;YAC5D,OAAO,GAAG,QAAQ,CAAC,MAAM,CACvB,SAAS,CAAC,YAAY,CAAC,UAAU,EAAW,EAC5C,SAAS,CAAC,UAAU,CAAC,UAAU,EAAW,EAC1C,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,EAAE,CACzB,CAAC;QACtB,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC1B,CAAC;QAED,MAAM,YAAY,GAAG,OAAO;aACzB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAsB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACpG,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aAC/D,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;QAE5D,MAAM,CAAC,EAAE,CAAC,YAAY,IAAI,CAAC,EAAE,mDAAmD,CAAC,CAAC;QAClF,MAAM,CAAC,EAAE,CAAC,YAAY,GAAG,QAAQ,EAAE,mDAAmD,QAAQ,eAAe,CAAC,CAAC;QAC/G,MAAM,CAAC,EAAE,CACP,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,oCAAoC,CAAC,CAAC,EACpE,4DAA4D,CAC7D,CAAC;QAEF,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/chunk-persistence.test.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Regression tests for chunk-boundary persistence + close-then-compress.
+ *
+ * Background (Mythos duplication incident, 2026-07; fleet audit):
+ *   1. Chunk boundaries were recomputed from a running token sum on every
+ *      rebuild; "already compressed" was recovered only by EXACT
+ *      message-ID-set match against persisted L1 sourceIds. Any boundary
+ *      shift (config change, restart, message mutation, chain break)
+ *      re-keyed the tail → mass duplicate L1s over already-lived ground.
+ *   2. The trailing PARTIAL chunk (>=4 messages, under targetChunkTokens)
+ *      was compressed eagerly on every rebuild while it grew → families of
+ *      prefix-generation L1s (same start, growing span), all retained, all
+ *      merged upward into the same L2 (content multiplication).
+ *
+ * New contract pinned here:
+ *   - A chunk is compressed only after it CLOSES (running sum reaches
+ *     targetChunkTokens); the trailing partial chunk is never compressed.
+ *   - Closing a chunk persists a ChunkRecord to the `autobio:chunks`
+ *     chronicle state slot; persisted records OWN the past — rebuilds and
+ *     restarts never re-chunk covered ground, regardless of config drift.
+ *   - L1 production refuses to overlap an existing L1 (strict guard).
+ *   - If most records resolve to zero live messages (chain-break
+ *     signature), compression fails CLOSED (no re-chunking of history).
+ *   - Stores from before this change migrate lazily: records are
+ *     synthesized from existing L1 sourceIds, longest generation per
+ *     prefix family.
+ */
+export {};
+//# sourceMappingURL=chunk-persistence.test.d.ts.map

package/dist/test/chunk-persistence.test.d.ts.map

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