agent-working-memory 0.13.1 → 0.14.1

package/dist/core/recall-config.js

@@ -0,0 +1,110 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Effective recall configuration — self-reporting, so a measurement can PROVE
+ * which configuration produced it.
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * On 2026-08-23 a benchmark comparison reported "no effect" for a change that
+ * demonstrably worked. The cause was not AWM: two arms shared a port, teardown
+ * left the first server alive, the second arm health-checked the survivor, and
+ * both arms measured the SAME baseline process. Identical inputs, identical
+ * outputs, a confident and completely wrong conclusion.
+ *
+ * Port hygiene fixes that instance. It does not fix the class. The class is:
+ * **nothing verified that the system measured was the system configured.**
+ * The same gap bit the D11 spreading-activation re-test, where the tracer's arm
+ * label omitted `AWM_SPREAD_INHIBIT`, so two materially different arms both
+ * printed `arm=spread` and had to be told apart by diffing output by hand.
+ *
+ * The durable fix is for the running system to state its own effective recall
+ * configuration, so a harness can assert it and fail LOUDLY instead of silently
+ * measuring the wrong thing. Any new recall flag added to RECALL_FLAGS is
+ * automatically covered by every consumer — the eval tracer's arm label, the
+ * `/health` payload, and the benchmark driver's assertion.
+ *
+ * Adding a flag here is the ONLY step required to make it visible everywhere.
+ */
+/**
+ * Every environment flag that can change what `activate()` returns.
+ * Keep this list current — an unlisted flag is an invisible experiment.
+ */
+export const RECALL_FLAGS = [
+    // Second-stage reorder (phase 9b)
+    'AWM_RERANK2',
+    'AWM_RERANK2_K',
+    // Cross-encoder passage selection
+    'AWM_RERANK_WINDOW',
+    'AWM_RERANK_TRUNC',
+    'AWM_RERANK_POOL',
+    'AWM_RERANK_TAGS',
+    'AWM_RERANK_TAGS_LEN',
+    // Derived retrieval text (embedding side)
+    'AWM_RETRIEVAL_TEXT',
+    // Project-dialect alias expansion
+    'AWM_ALIASES',
+    'AWM_ALIAS_QUERY_CAP',
+    // Embedding model — changes every stored vector, so it belongs here
+    'AWM_EMBED_MODEL',
+    'AWM_EMBED_DIMS',
+    'AWM_DISABLE_RERANK_SKIP',
+    // Spreading activation (D11 — parked)
+    'AWM_SPREAD',
+    'AWM_SPREAD_INJECT',
+    'AWM_SPREAD_INHIBIT',
+    'AWM_SPREAD_ITERS',
+    'AWM_SPREAD_DAMPING',
+    'AWM_SPREAD_BUDGET',
+    'AWM_SPREAD_BOOST',
+    // Candidate pool / retrieval breadth
+    'AWM_TOPN_MULT',
+    'AWM_BROAD_EDGES',
+    'AWM_ENTITY_FETCH',
+    'AWM_ENTITY_INDEX_FETCH',
+    'AWM_QUERY_BRIDGE',
+    'AWM_AUTOTAG',
+    // Diagnostic escape hatches that alter ranking
+    'AWM_DISABLE_POOL_FILTER',
+    'AWM_DISABLE_EXPANSION_CACHE',
+    'AWM_DISABLE_SLIM_CACHE',
+    'AWM_ABSTAIN_GATE_K',
+];
+/** Only the flags actually set, in declaration order. */
+export function activeRecallConfig(env = process.env) {
+    const out = {};
+    for (const k of RECALL_FLAGS) {
+        const v = env[k];
+        if (v !== undefined && v !== '')
+            out[k] = v;
+    }
+    return out;
+}
+/**
+ * Short, stable, comparable label for the active configuration.
+ * `default` when nothing is set. Sorted so it never depends on declaration
+ * order or on how the process was launched.
+ */
+export function recallConfigFingerprint(env = process.env) {
+    const active = activeRecallConfig(env);
+    const keys = Object.keys(active).sort();
+    if (keys.length === 0)
+        return 'default';
+    return keys.map(k => `${k.replace(/^AWM_/, '').toLowerCase()}=${active[k]}`).join(',');
+}
+/**
+ * Assert the running configuration contains the expected flag values.
+ * Returns the mismatches; empty array means the system is configured as
+ * intended. Harnesses should treat a non-empty result as fatal — it means the
+ * thing being measured is not the thing that was configured.
+ */
+export function diffRecallConfig(expected, env = process.env) {
+    const active = activeRecallConfig(env);
+    const bad = [];
+    for (const [flag, want] of Object.entries(expected)) {
+        if (active[flag] !== want)
+            bad.push({ flag, expected: want, actual: active[flag] });
+    }
+    return bad;
+}
+//# sourceMappingURL=recall-config.js.map

package/dist/core/recall-config.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-config.js","sourceRoot":"","sources":["../../src/core/recall-config.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,kCAAkC;IAClC,aAAa;IACb,eAAe;IACf,kCAAkC;IAClC,mBAAmB;IACnB,kBAAkB;IAClB,iBAAiB;IACjB,iBAAiB;IACjB,qBAAqB;IACrB,0CAA0C;IAC1C,oBAAoB;IACpB,kCAAkC;IAClC,aAAa;IACb,qBAAqB;IACrB,oEAAoE;IACpE,iBAAiB;IACjB,gBAAgB;IAChB,yBAAyB;IACzB,sCAAsC;IACtC,YAAY;IACZ,mBAAmB;IACnB,oBAAoB;IACpB,kBAAkB;IAClB,oBAAoB;IACpB,mBAAmB;IACnB,kBAAkB;IAClB,qCAAqC;IACrC,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,wBAAwB;IACxB,kBAAkB;IAClB,aAAa;IACb,+CAA+C;IAC/C,yBAAyB;IACzB,6BAA6B;IAC7B,wBAAwB;IACxB,oBAAoB;CACZ,CAAC;AAIX,yDAAyD;AACzD,MAAM,UAAU,kBAAkB,CAAC,MAAyB,OAAO,CAAC,GAAG;IACrE,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,MAAyB,OAAO,CAAC,GAAG;IAC1E,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAgC,EAChC,MAAyB,OAAO,CAAC,GAAG;IAEpC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,GAAG,GAA0E,EAAE,CAAC;IACtF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpD,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/core/rerank-window.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Passage selection for cross-encoder reranking.
+ *
+ * THE PROBLEM
+ * -----------
+ * Reranking truncates each passage to a fixed prefix (historically the first
+ * 400 chars). That truncation exists for a real reason: cross-encoders pad to
+ * the longest passage in the batch, so one 5,000-char memory in a 40-item pool
+ * drags every passage to ~512 tokens and costs 3-4x. The reranker is already
+ * ~90% of warm recall latency, so "just send everything" is not available.
+ *
+ * But a PREFIX is the wrong 400 chars. Measured on the live 29.8k store:
+ *   - canonical memories median 1,965 chars, 98.7% exceed 400
+ *   - the reranker cannot see 78.8% of each canonical memory's vocabulary
+ *   - 99.9% of long canonical memories carry identifiers only past char 400
+ * And measured on tests/longmem-eval: moving the answer from char 150 to char
+ * 700 takes success@1 from 100% to 0%, with the gold's cross-encoder score
+ * collapsing 0.986 -> 0.000 while its BM25 score barely moves. The memory stays
+ * retrievable and stops being rankable.
+ *
+ * THE FIX
+ * -------
+ * Spend the same character budget on the window that actually contains the
+ * query's terms, instead of on whatever happens to be at the top of the memory.
+ * Cost is unchanged — same budget, same batch padding, same inference — so this
+ * buys ranking quality without buying latency.
+ *
+ * The concept line is always kept: it is short, it is the memory's title, and
+ * it is what a human wrote to summarise the thing.
+ */
+/**
+ * Choose the `budget`-char window of `content` densest in query terms.
+ * Returns the head of the content when nothing matches — the old behaviour,
+ * which is the right fallback: with no query signal there is no reason to
+ * prefer any other part of the memory.
+ */
+export declare function densestWindow(content: string, query: string, budget: number): string;
+/**
+ * Build the passage handed to the cross-encoder for one candidate.
+ *
+ * `mode`:
+ *  - `'prefix'` (default) — legacy behaviour, the first `budget` chars.
+ *  - `'query'`  — the `budget`-char window densest in query terms.
+ */
+export declare function buildRerankPassage(concept: string, content: string, query: string, budget: number, mode: 'prefix' | 'query', tags?: string[]): string;
+/** Whether topical tags are appended to the rerank passage. Default OFF. */
+export declare function rerankTagsEnabled(): boolean;
+/** Character budget for the appended tag text. */
+export declare function rerankTagBudget(): number;
+/**
+ * Render topical tags as plain terms for the cross-encoder.
+ * Only `topic=` / `proj=` / `project=` carry query vocabulary; date/person/
+ * ticket tags are identifiers the body usually already contains, and adding
+ * them would spend the budget without adding reachable words.
+ */
+export declare function rerankTagText(tags?: string[]): string;
+/** Character budget for a rerank passage. */
+export declare function rerankTruncation(): number;
+/** Passage selection mode. Default `prefix` preserves shipped behaviour. */
+export declare function rerankWindowMode(): 'prefix' | 'query';
+//# sourceMappingURL=rerank-window.d.ts.map

package/dist/core/rerank-window.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerank-window.d.ts","sourceRoot":"","sources":["../../src/core/rerank-window.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAaH;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAsCpF;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,QAAQ,GAAG,OAAO,EACxB,IAAI,CAAC,EAAE,MAAM,EAAE,GACd,MAAM,CAWR;AAED,4EAA4E;AAC5E,wBAAgB,iBAAiB,IAAI,OAAO,CAE3C;AAED,kDAAkD;AAClD,wBAAgB,eAAe,IAAI,MAAM,CAGxC;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYrD;AAED,6CAA6C;AAC7C,wBAAgB,gBAAgB,IAAI,MAAM,CAGzC;AAED,4EAA4E;AAC5E,wBAAgB,gBAAgB,IAAI,QAAQ,GAAG,OAAO,CAErD"}

package/dist/core/rerank-window.js

@@ -0,0 +1,153 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Passage selection for cross-encoder reranking.
+ *
+ * THE PROBLEM
+ * -----------
+ * Reranking truncates each passage to a fixed prefix (historically the first
+ * 400 chars). That truncation exists for a real reason: cross-encoders pad to
+ * the longest passage in the batch, so one 5,000-char memory in a 40-item pool
+ * drags every passage to ~512 tokens and costs 3-4x. The reranker is already
+ * ~90% of warm recall latency, so "just send everything" is not available.
+ *
+ * But a PREFIX is the wrong 400 chars. Measured on the live 29.8k store:
+ *   - canonical memories median 1,965 chars, 98.7% exceed 400
+ *   - the reranker cannot see 78.8% of each canonical memory's vocabulary
+ *   - 99.9% of long canonical memories carry identifiers only past char 400
+ * And measured on tests/longmem-eval: moving the answer from char 150 to char
+ * 700 takes success@1 from 100% to 0%, with the gold's cross-encoder score
+ * collapsing 0.986 -> 0.000 while its BM25 score barely moves. The memory stays
+ * retrievable and stops being rankable.
+ *
+ * THE FIX
+ * -------
+ * Spend the same character budget on the window that actually contains the
+ * query's terms, instead of on whatever happens to be at the top of the memory.
+ * Cost is unchanged — same budget, same batch padding, same inference — so this
+ * buys ranking quality without buying latency.
+ *
+ * The concept line is always kept: it is short, it is the memory's title, and
+ * it is what a human wrote to summarise the thing.
+ */
+/** Cheap tokenizer for locating query terms inside a passage. */
+function terms(query) {
+    const raw = query.toLowerCase().match(/[a-z0-9_][a-z0-9_.\-]{1,}/g) ?? [];
+    const STOP = new Set([
+        'the', 'and', 'for', 'with', 'that', 'this', 'from', 'what', 'where', 'when',
+        'which', 'does', 'did', 'was', 'were', 'are', 'is', 'be', 'to', 'of', 'in',
+        'on', 'at', 'by', 'it', 'as', 'do', 'how', 'why', 'a', 'an', 'or',
+    ]);
+    return Array.from(new Set(raw.filter(t => t.length >= 3 && !STOP.has(t))));
+}
+/**
+ * Choose the `budget`-char window of `content` densest in query terms.
+ * Returns the head of the content when nothing matches — the old behaviour,
+ * which is the right fallback: with no query signal there is no reason to
+ * prefer any other part of the memory.
+ */
+export function densestWindow(content, query, budget) {
+    if (content.length <= budget)
+        return content;
+    const toks = terms(query);
+    if (toks.length === 0)
+        return content.slice(0, budget);
+    const lower = content.toLowerCase();
+    const hits = [];
+    for (const t of toks) {
+        let from = 0;
+        for (;;) {
+            const i = lower.indexOf(t, from);
+            if (i < 0)
+                break;
+            hits.push(i);
+            from = i + t.length;
+        }
+    }
+    if (hits.length === 0)
+        return content.slice(0, budget);
+    hits.sort((a, b) => a - b);
+    // Slide a window anchored slightly before each hit; keep the one covering most.
+    let bestStart = 0;
+    let bestCount = -1;
+    for (let i = 0; i < hits.length; i++) {
+        const start = Math.max(0, hits[i] - Math.floor(budget / 5));
+        let count = 0;
+        for (let j = i; j < hits.length && hits[j] - start < budget; j++)
+            count++;
+        if (count > bestCount) {
+            bestCount = count;
+            bestStart = start;
+        }
+    }
+    // Snap to a word boundary so the cross-encoder is not handed a split token.
+    let start = bestStart;
+    if (start > 0) {
+        const sp = content.indexOf(' ', start);
+        if (sp >= 0 && sp - start < 40)
+            start = sp + 1;
+    }
+    const slice = content.slice(start, start + budget);
+    return (start > 0 ? '…' : '') + slice + (start + budget < content.length ? '…' : '');
+}
+/**
+ * Build the passage handed to the cross-encoder for one candidate.
+ *
+ * `mode`:
+ *  - `'prefix'` (default) — legacy behaviour, the first `budget` chars.
+ *  - `'query'`  — the `budget`-char window densest in query terms.
+ */
+export function buildRerankPassage(concept, content, query, budget, mode, tags) {
+    const body = mode === 'query'
+        ? densestWindow(content, query, budget)
+        : (content.length > budget ? content.slice(0, budget) : content);
+    // Topical tags, when enabled. The cross-encoder decides final order since
+    // phase 9b, and it cannot see tags at all — measured on the live store, 66.2%
+    // of topical tag terms never appear in the body, so that vocabulary is
+    // invisible to the stage that now decides ranking. Appended (not substituted)
+    // and length-capped so it cannot crowd out the content window.
+    const extra = rerankTagText(tags);
+    return extra ? `${concept}: ${body} ${extra}` : `${concept}: ${body}`;
+}
+/** Whether topical tags are appended to the rerank passage. Default OFF. */
+export function rerankTagsEnabled() {
+    return process.env.AWM_RERANK_TAGS === '1';
+}
+/** Character budget for the appended tag text. */
+export function rerankTagBudget() {
+    const v = Number(process.env.AWM_RERANK_TAGS_LEN ?? 80);
+    return Number.isFinite(v) && v > 0 ? v : 80;
+}
+/**
+ * Render topical tags as plain terms for the cross-encoder.
+ * Only `topic=` / `proj=` / `project=` carry query vocabulary; date/person/
+ * ticket tags are identifiers the body usually already contains, and adding
+ * them would spend the budget without adding reachable words.
+ */
+export function rerankTagText(tags) {
+    if (!rerankTagsEnabled() || !tags || tags.length === 0)
+        return '';
+    const words = new Set();
+    for (const t of tags) {
+        const m = /^(?:topic|proj|project)=(.+)$/i.exec(t);
+        if (!m)
+            continue;
+        for (const w of m[1].toLowerCase().split(/[-_\s]+/)) {
+            if (w.length > 2)
+                words.add(w);
+        }
+    }
+    if (words.size === 0)
+        return '';
+    return `[${[...words].join(' ').slice(0, rerankTagBudget())}]`;
+}
+/** Character budget for a rerank passage. */
+export function rerankTruncation() {
+    const v = Number(process.env.AWM_RERANK_TRUNC ?? 400);
+    return Number.isFinite(v) && v > 0 ? v : 400;
+}
+/** Passage selection mode. Default `prefix` preserves shipped behaviour. */
+export function rerankWindowMode() {
+    return process.env.AWM_RERANK_WINDOW === 'query' ? 'query' : 'prefix';
+}
+//# sourceMappingURL=rerank-window.js.map

package/dist/core/rerank-window.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerank-window.js","sourceRoot":"","sources":["../../src/core/rerank-window.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,iEAAiE;AACjE,SAAS,KAAK,CAAC,KAAa;IAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,4BAA4B,CAAC,IAAI,EAAE,CAAC;IAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;QACnB,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM;QAC5E,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;QAC1E,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;KAClE,CAAC,CAAC;IACH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,KAAa,EAAE,MAAc;IAC1E,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,OAAO,CAAC;IAE7C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,SAAS,CAAC;YACR,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC;gBAAE,MAAM;YACjB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QACtB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACvD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3B,gFAAgF;IAChF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,EAAE,CAAC;QAC1E,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAAC,SAAS,GAAG,KAAK,CAAC;YAAC,SAAS,GAAG,KAAK,CAAC;QAAC,CAAC;IAClE,CAAC;IAED,4EAA4E;IAC5E,IAAI,KAAK,GAAG,SAAS,CAAC;IACtB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,EAAE;YAAE,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC;IACnD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACvF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAe,EACf,OAAe,EACf,KAAa,EACb,MAAc,EACd,IAAwB,EACxB,IAAe;IAEf,MAAM,IAAI,GAAG,IAAI,KAAK,OAAO;QAC3B,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC;QACvC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACnE,0EAA0E;IAC1E,8EAA8E;IAC9E,uEAAuE;IACvE,8EAA8E;IAC9E,+DAA+D;IAC/D,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,IAAI,EAAE,CAAC;AACxE,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,eAAe,KAAK,GAAG,CAAC;AAC7C,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,eAAe;IAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,mBAAmB,IAAI,EAAE,CAAC,CAAC;IACxD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC9C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,IAAe;IAC3C,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,OAAO,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,CAAC;AACjE,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,gBAAgB;IAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,GAAG,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAC/C,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,iBAAiB,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;AACxE,CAAC"}

package/dist/core/rerank2.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Second-stage reordering — "rerank the rerank".
+ *
+ * THE PROBLEM
+ * -----------
+ * Phase 7 blends the cross-encoder's judgement with the composite score:
+ *
+ *     score = compositeWeight * composite + rerankWeight * rerankerScore
+ *
+ * with `rerankWeight` capped at 0.7, so `composite` always keeps at least 30%
+ * of the vote on final ordering. Composite carries decay, Hebbian and salience
+ * terms — useful for deciding WHICH candidates deserve consideration, but a
+ * poor judge of which one actually answers the question.
+ *
+ * Measured on LoCoMo (616 answerable probes, tests/rerank2-eval): the blend
+ * disagrees with the cross-encoder about which item deserves rank 1 on **38.6%**
+ * of queries. Where that disagreement is decidable — one of the two is the gold
+ * evidence — the **cross-encoder is right 77% of the time** (61 vs 18).
+ *
+ * THE FIX
+ * -------
+ * Re-sort only the final returned window by `rerankerScore` alone. Simulated
+ * gain: **+8.0pp success@1** (39.1% -> 47.1%), fixing 61 queries and breaking
+ * 12, with every category improving.
+ *
+ * WHY THIS IS SAFE
+ * ----------------
+ * Applied AFTER the channel-agreement gate, AFTER computeRecallConfidence, and
+ * AFTER the requireConfidence check. Those read rerankerScore maxima/margins and
+ * the score distribution. Reordering a window afterwards changes neither its
+ * membership nor any score, so **adversarial abstention is provably
+ * unaffected**. Retuning `rerankWeight` inside phase 7 would NOT have that
+ * property — it shifts `item.score`, hence which items clear `minScore`, which
+ * is exactly what cost adversarial 73.4->71.0 when the pool was last widened.
+ *
+ * Margin-guarded variants were simulated and are strictly worse: gating on a
+ * >0.15 reranker margin cuts breakage 12->1 but also cuts fixes 61->17.
+ */
+/** Minimal shape this needs — anything carrying a cross-encoder score. */
+export interface RerankScored {
+    phaseScores: {
+        rerankerScore: number;
+    };
+}
+/**
+ * Re-sort the first `k` entries of `ranked` by descending `rerankerScore`,
+ * leaving the tail untouched. Returns a new array; never mutates the input.
+ *
+ * Returns `ranked` unchanged when reordering would be unsound:
+ *  - `k <= 1`, or fewer than 2 entries to order
+ *  - any entry in the window has `rerankerScore <= 0`, which means the
+ *    cross-encoder did not score it (skipped, failed, or timed out). Sorting
+ *    on a zero would scramble an otherwise sound composite ordering — the
+ *    reranker is wrapped in try/catch and a 10s timeout upstream, so this is a
+ *    real path, not a theoretical one.
+ */
+export declare function reorderByReranker<T extends RerankScored>(ranked: T[], k: number): T[];
+/** Window size for the second stage. */
+export declare function rerank2WindowSize(): number;
+/** Whether the second stage is enabled. Default OFF pending the tracer verdict. */
+export declare function rerank2Enabled(): boolean;
+//# sourceMappingURL=rerank2.d.ts.map

package/dist/core/rerank2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerank2.d.ts","sourceRoot":"","sources":["../../src/core/rerank2.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,0EAA0E;AAC1E,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE;QAAE,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC;CACxC;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,YAAY,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAarF;AAED,wCAAwC;AACxC,wBAAgB,iBAAiB,IAAI,MAAM,CAE1C;AAED,mFAAmF;AACnF,wBAAgB,cAAc,IAAI,OAAO,CAExC"}

package/dist/core/rerank2.js

@@ -0,0 +1,75 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Second-stage reordering — "rerank the rerank".
+ *
+ * THE PROBLEM
+ * -----------
+ * Phase 7 blends the cross-encoder's judgement with the composite score:
+ *
+ *     score = compositeWeight * composite + rerankWeight * rerankerScore
+ *
+ * with `rerankWeight` capped at 0.7, so `composite` always keeps at least 30%
+ * of the vote on final ordering. Composite carries decay, Hebbian and salience
+ * terms — useful for deciding WHICH candidates deserve consideration, but a
+ * poor judge of which one actually answers the question.
+ *
+ * Measured on LoCoMo (616 answerable probes, tests/rerank2-eval): the blend
+ * disagrees with the cross-encoder about which item deserves rank 1 on **38.6%**
+ * of queries. Where that disagreement is decidable — one of the two is the gold
+ * evidence — the **cross-encoder is right 77% of the time** (61 vs 18).
+ *
+ * THE FIX
+ * -------
+ * Re-sort only the final returned window by `rerankerScore` alone. Simulated
+ * gain: **+8.0pp success@1** (39.1% -> 47.1%), fixing 61 queries and breaking
+ * 12, with every category improving.
+ *
+ * WHY THIS IS SAFE
+ * ----------------
+ * Applied AFTER the channel-agreement gate, AFTER computeRecallConfidence, and
+ * AFTER the requireConfidence check. Those read rerankerScore maxima/margins and
+ * the score distribution. Reordering a window afterwards changes neither its
+ * membership nor any score, so **adversarial abstention is provably
+ * unaffected**. Retuning `rerankWeight` inside phase 7 would NOT have that
+ * property — it shifts `item.score`, hence which items clear `minScore`, which
+ * is exactly what cost adversarial 73.4->71.0 when the pool was last widened.
+ *
+ * Margin-guarded variants were simulated and are strictly worse: gating on a
+ * >0.15 reranker margin cuts breakage 12->1 but also cuts fixes 61->17.
+ */
+/**
+ * Re-sort the first `k` entries of `ranked` by descending `rerankerScore`,
+ * leaving the tail untouched. Returns a new array; never mutates the input.
+ *
+ * Returns `ranked` unchanged when reordering would be unsound:
+ *  - `k <= 1`, or fewer than 2 entries to order
+ *  - any entry in the window has `rerankerScore <= 0`, which means the
+ *    cross-encoder did not score it (skipped, failed, or timed out). Sorting
+ *    on a zero would scramble an otherwise sound composite ordering — the
+ *    reranker is wrapped in try/catch and a 10s timeout upstream, so this is a
+ *    real path, not a theoretical one.
+ */
+export function reorderByReranker(ranked, k) {
+    if (k <= 1 || ranked.length <= 1)
+        return ranked;
+    const window = Math.min(k, ranked.length);
+    if (window <= 1)
+        return ranked;
+    const head = ranked.slice(0, window);
+    for (const r of head) {
+        if (!(r.phaseScores.rerankerScore > 0))
+            return ranked; // also catches NaN
+    }
+    const sorted = head.slice().sort((a, b) => b.phaseScores.rerankerScore - a.phaseScores.rerankerScore);
+    return sorted.concat(ranked.slice(window));
+}
+/** Window size for the second stage. */
+export function rerank2WindowSize() {
+    return Number(process.env.AWM_RERANK2_K ?? 10);
+}
+/** Whether the second stage is enabled. Default OFF pending the tracer verdict. */
+export function rerank2Enabled() {
+    return process.env.AWM_RERANK2 === '1';
+}
+//# sourceMappingURL=rerank2.js.map

package/dist/core/rerank2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerank2.js","sourceRoot":"","sources":["../../src/core/rerank2.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAOH;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAAyB,MAAW,EAAE,CAAS;IAC9E,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAEhD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAE/B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,GAAG,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC,CAAE,mBAAmB;IAC7E,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,GAAG,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACtG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,iBAAiB;IAC/B,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,GAAG,CAAC,WAAW,KAAK,GAAG,CAAC;AACzC,CAAC"}

package/dist/core/retrieval-text.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Derived retrieval text — the machine-facing view of a memory.
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * Measured on the live 11,294-engram store: 66.2% of topical tag terms never
+ * appear in the memory body, and 94.3% of tagged memories are missing at least
+ * one of their own topical terms. Tags are indexed by BM25 only — the embedding
+ * is built from `concept + content` (write-pipeline.ts) and so is the
+ * cross-encoder rerank passage (activation.ts). So that vocabulary is invisible
+ * to two of the three retrieval channels, including the one that decides final
+ * ordering since phase 9b.
+ *
+ * The consequence, observed on a real memory: "private plan memory peaked 88%,
+ * scale P1v3 -> P2v3" was NOT in the top 40 candidates for "azure app service
+ * plan capacity increase internal application". Its body contains no "azure",
+ * no "capacity", no "app service plan" — only `topic=azure` as a tag.
+ *
+ * THE SHAPE THAT MATTERS
+ * ----------------------
+ * This builds a DERIVED text used for embedding and reranking. It does NOT
+ * mutate `content`. That distinction is the whole design:
+ *
+ *   - AWM's model slots have always been ADDITIVE — the embedder, expander and
+ *     reranker score or expand, they never rewrite what was stored. Appending
+ *     tag terms into the body would break that invariant, and a normaliser that
+ *     silently edits stored memories is unrecoverable if it is wrong.
+ *   - A derived view is recomputable. If the rule turns out to be bad, re-derive
+ *     and re-embed; the source of truth was never touched.
+ *   - And it can be BACKFILLED over the existing corpus, which body-only fixes
+ *     (write-time guidance, future writes) cannot reach. 7,350 memories are
+ *     already wrong.
+ *
+ * Only `topic=` / `proj=` / `project=` are included. Date, person and ticket
+ * tags are identifiers the body usually already carries, so adding them spends
+ * budget without adding reachable words.
+ */
+/** Whether the derived retrieval text includes tag vocabulary. Default OFF. */
+export declare function retrievalTextEnabled(): boolean;
+/**
+ * Extract the topical vocabulary a future question is likely to use.
+ * Deduplicated and lowercased; order follows first appearance so the output is
+ * deterministic for a given tag list (important: a non-deterministic embedding
+ * input would make re-embedding produce different vectors for the same memory).
+ */
+export declare function topicalTerms(tags?: string[]): string[];
+/**
+ * Build the text used for EMBEDDING a memory.
+ *
+ * When disabled this returns exactly `concept + ' ' + content`, byte-identical
+ * to the historical input — so leaving the flag off cannot change a single
+ * stored vector.
+ */
+export declare function buildRetrievalText(concept: string, content: string, tags?: string[]): string;
+//# sourceMappingURL=retrieval-text.d.ts.map

package/dist/core/retrieval-text.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieval-text.d.ts","sourceRoot":"","sources":["../../src/core/retrieval-text.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,+EAA+E;AAC/E,wBAAgB,oBAAoB,IAAI,OAAO,CAE9C;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAYtD;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAS5F"}

package/dist/core/retrieval-text.js

@@ -0,0 +1,87 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Derived retrieval text — the machine-facing view of a memory.
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * Measured on the live 11,294-engram store: 66.2% of topical tag terms never
+ * appear in the memory body, and 94.3% of tagged memories are missing at least
+ * one of their own topical terms. Tags are indexed by BM25 only — the embedding
+ * is built from `concept + content` (write-pipeline.ts) and so is the
+ * cross-encoder rerank passage (activation.ts). So that vocabulary is invisible
+ * to two of the three retrieval channels, including the one that decides final
+ * ordering since phase 9b.
+ *
+ * The consequence, observed on a real memory: "private plan memory peaked 88%,
+ * scale P1v3 -> P2v3" was NOT in the top 40 candidates for "azure app service
+ * plan capacity increase internal application". Its body contains no "azure",
+ * no "capacity", no "app service plan" — only `topic=azure` as a tag.
+ *
+ * THE SHAPE THAT MATTERS
+ * ----------------------
+ * This builds a DERIVED text used for embedding and reranking. It does NOT
+ * mutate `content`. That distinction is the whole design:
+ *
+ *   - AWM's model slots have always been ADDITIVE — the embedder, expander and
+ *     reranker score or expand, they never rewrite what was stored. Appending
+ *     tag terms into the body would break that invariant, and a normaliser that
+ *     silently edits stored memories is unrecoverable if it is wrong.
+ *   - A derived view is recomputable. If the rule turns out to be bad, re-derive
+ *     and re-embed; the source of truth was never touched.
+ *   - And it can be BACKFILLED over the existing corpus, which body-only fixes
+ *     (write-time guidance, future writes) cannot reach. 7,350 memories are
+ *     already wrong.
+ *
+ * Only `topic=` / `proj=` / `project=` are included. Date, person and ticket
+ * tags are identifiers the body usually already carries, so adding them spends
+ * budget without adding reachable words.
+ */
+/** Whether the derived retrieval text includes tag vocabulary. Default OFF. */
+export function retrievalTextEnabled() {
+    return process.env.AWM_RETRIEVAL_TEXT === '1';
+}
+/**
+ * Extract the topical vocabulary a future question is likely to use.
+ * Deduplicated and lowercased; order follows first appearance so the output is
+ * deterministic for a given tag list (important: a non-deterministic embedding
+ * input would make re-embedding produce different vectors for the same memory).
+ */
+export function topicalTerms(tags) {
+    if (!tags || tags.length === 0)
+        return [];
+    const out = [];
+    const seen = new Set();
+    for (const t of tags) {
+        const m = /^(?:topic|proj|project)=(.+)$/i.exec(t);
+        if (!m)
+            continue;
+        for (const w of m[1].toLowerCase().split(/[-_\s]+/)) {
+            if (w.length > 2 && !seen.has(w)) {
+                seen.add(w);
+                out.push(w);
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Build the text used for EMBEDDING a memory.
+ *
+ * When disabled this returns exactly `concept + ' ' + content`, byte-identical
+ * to the historical input — so leaving the flag off cannot change a single
+ * stored vector.
+ */
+export function buildRetrievalText(concept, content, tags) {
+    const base = `${concept} ${content}`;
+    if (!retrievalTextEnabled())
+        return base;
+    const terms = topicalTerms(tags);
+    if (terms.length === 0)
+        return base;
+    // Appended at the END. The embedding model truncates beyond its context
+    // window, and the head of the content is what anchors the topic — putting tag
+    // terms first would displace the memory's actual subject in the vector.
+    return `${base} ${terms.join(' ')}`;
+}
+//# sourceMappingURL=retrieval-text.js.map

package/dist/core/retrieval-text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieval-text.js","sourceRoot":"","sources":["../../src/core/retrieval-text.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,+EAA+E;AAC/E,MAAM,UAAU,oBAAoB;IAClC,OAAO,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,GAAG,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAe;IAC1C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe,EAAE,OAAe,EAAE,IAAe;IAClF,MAAM,IAAI,GAAG,GAAG,OAAO,IAAI,OAAO,EAAE,CAAC;IACrC,IAAI,CAAC,oBAAoB,EAAE;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,wEAAwE;IACxE,8EAA8E;IAC9E,wEAAwE;IACxE,OAAO,GAAG,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACtC,CAAC"}