agent-working-memory 0.13.0 → 0.14.0

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"}

package/dist/core/temporal-query.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Temporal expressions in a recall query.
+ *
+ * THE PROBLEM
+ * -----------
+ * Nothing in the pipeline parsed dates out of query text, and `ActivationQuery`
+ * had no date parameter. So "azure app plan from last Thursday or Friday" spent
+ * "last", "Thursday" and "Friday" as ordinary BM25 tokens — diluting the subject
+ * terms and matching `date=` tags right across the corpus.
+ *
+ * Measured on the real store (101 probes, tests/realstore-eval):
+ *   subject only ............ 59.4% success@1   <- control
+ *   + "from last Friday" .... 56.4%  (-3.0pp)
+ *   + "on 2026-05-01" ....... 51.5%  (-7.9pp)
+ *   ORACLE, week-filtered ... 96.0%  (+36.6pp)
+ *
+ * So the most selective thing the user said was a PENALTY, and a working
+ * temporal filter is worth more than anything else measured on this store.
+ *
+ * DESIGN NOTES
+ * ------------
+ * - `asOf` is required for relative phrases. Using the wall clock would make a
+ *   fixture non-reproducible: "last week" would silently mean something new on
+ *   every run. Callers pass the query time explicitly.
+ * - Matching is deliberately CONSERVATIVE. A greedy matcher that fired on
+ *   ordinary words would reshape every recall in the store, so each pattern is
+ *   anchored on an unambiguous cue ("last", "yesterday", an ISO date, a month
+ *   name). When nothing matches, this returns `null` and callers must treat
+ *   that as a strict no-op.
+ * - The window is a PREFERENCE for callers, never a filter. People misremember
+ *   dates — "last Thursday or Friday" is itself an admission of uncertainty —
+ *   so a memory outside the window must stay reachable on subject strength.
+ */
+export interface TemporalMatch {
+    /** Inclusive window start (UTC ms). */
+    from: number;
+    /** Exclusive window end (UTC ms). */
+    to: number;
+    /** The literal phrases matched, for logging and for stripping. */
+    matched: string[];
+    /** The query with temporal phrases removed, for the lexical channel. */
+    stripped: string;
+    /** How the window was derived — useful when explaining a recall. */
+    kind: 'relative-day' | 'relative-week' | 'relative-month' | 'recent' | 'absolute-date' | 'absolute-month';
+}
+/**
+ * Parse a temporal expression out of `query`, anchored at `asOf`.
+ * Returns `null` when nothing matches — callers MUST treat that as a no-op.
+ *
+ * Windows are padded generously rather than tightly: the goal is to prefer a
+ * neighbourhood, not to pin an exact day the user probably misremembers.
+ */
+export declare function parseTemporal(query: string, asOf: Date | number): TemporalMatch | null;
+/** Whether temporal handling is enabled. Default OFF. */
+export declare function temporalEnabled(): boolean;
+/**
+ * Boost applied to a candidate whose creation time falls inside the window.
+ * A PREFERENCE, not a filter — see the design note above.
+ */
+export declare function temporalBoost(): number;
+//# sourceMappingURL=temporal-query.d.ts.map

package/dist/core/temporal-query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-query.d.ts","sourceRoot":"","sources":["../../src/core/temporal-query.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAEH,MAAM,WAAW,aAAa;IAC5B,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,qCAAqC;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,kEAAkE;IAClE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,wEAAwE;IACxE,QAAQ,EAAE,MAAM,CAAC;IACjB,oEAAoE;IACpE,IAAI,EAAE,cAAc,GAAG,eAAe,GAAG,gBAAgB,GAAG,QAAQ,GAAG,eAAe,GAAG,gBAAgB,CAAC;CAC3G;AASD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,aAAa,GAAG,IAAI,CAmGtF;AAkBD,yDAAyD;AACzD,wBAAgB,eAAe,IAAI,OAAO,CAEzC;AAED;;;GAGG;AACH,wBAAgB,aAAa,IAAI,MAAM,CAGtC"}

package/dist/core/temporal-query.js

@@ -0,0 +1,168 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Temporal expressions in a recall query.
+ *
+ * THE PROBLEM
+ * -----------
+ * Nothing in the pipeline parsed dates out of query text, and `ActivationQuery`
+ * had no date parameter. So "azure app plan from last Thursday or Friday" spent
+ * "last", "Thursday" and "Friday" as ordinary BM25 tokens — diluting the subject
+ * terms and matching `date=` tags right across the corpus.
+ *
+ * Measured on the real store (101 probes, tests/realstore-eval):
+ *   subject only ............ 59.4% success@1   <- control
+ *   + "from last Friday" .... 56.4%  (-3.0pp)
+ *   + "on 2026-05-01" ....... 51.5%  (-7.9pp)
+ *   ORACLE, week-filtered ... 96.0%  (+36.6pp)
+ *
+ * So the most selective thing the user said was a PENALTY, and a working
+ * temporal filter is worth more than anything else measured on this store.
+ *
+ * DESIGN NOTES
+ * ------------
+ * - `asOf` is required for relative phrases. Using the wall clock would make a
+ *   fixture non-reproducible: "last week" would silently mean something new on
+ *   every run. Callers pass the query time explicitly.
+ * - Matching is deliberately CONSERVATIVE. A greedy matcher that fired on
+ *   ordinary words would reshape every recall in the store, so each pattern is
+ *   anchored on an unambiguous cue ("last", "yesterday", an ISO date, a month
+ *   name). When nothing matches, this returns `null` and callers must treat
+ *   that as a strict no-op.
+ * - The window is a PREFERENCE for callers, never a filter. People misremember
+ *   dates — "last Thursday or Friday" is itself an admission of uncertainty —
+ *   so a memory outside the window must stay reachable on subject strength.
+ */
+const DAY = 86400000;
+const WEEKDAYS = ['sunday', 'monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday'];
+const MONTHS = ['january', 'february', 'march', 'april', 'may', 'june',
+    'july', 'august', 'september', 'october', 'november', 'december'];
+const utcDay = (ms) => Math.floor(ms / DAY) * DAY;
+/**
+ * Parse a temporal expression out of `query`, anchored at `asOf`.
+ * Returns `null` when nothing matches — callers MUST treat that as a no-op.
+ *
+ * Windows are padded generously rather than tightly: the goal is to prefer a
+ * neighbourhood, not to pin an exact day the user probably misremembers.
+ */
+export function parseTemporal(query, asOf) {
+    const anchorMs = typeof asOf === 'number' ? asOf : asOf.getTime();
+    if (!Number.isFinite(anchorMs))
+        return null;
+    const q = query.toLowerCase();
+    const today = utcDay(anchorMs);
+    const matched = [];
+    const build = (from, to, kind) => ({
+        from, to, matched,
+        stripped: stripPhrases(query, matched),
+        kind,
+    });
+    // ── absolute ISO date — ONLY with an explicit temporal cue ──
+    // A BARE date must not trigger this. Memories routinely carry a date as part
+    // of their SUBJECT ("Hive close-out 2026-04-24 PASS", "FIXED 2026-08-21 event
+    // River Glen"), where the date IS the fact, not a "when" filter. Treating
+    // those as temporal strips a strongly discriminative term and makes recall
+    // worse: measured, a bare-date rule fired on 98 of 1,316 (7.4%) real
+    // identifier queries and cost success@1 75.8% -> 75.0%. Same reason the month
+    // rule below requires an "in"/"during" cue.
+    const iso = q.match(/\b(on|from|since|before|after|around|during|dated)\s+(\d{4})-(\d{2})-(\d{2})\b/);
+    if (iso) {
+        matched.push(iso[0]);
+        const d = Date.UTC(+iso[2], +iso[3] - 1, +iso[4]);
+        // +/- 3 days: a remembered date is often a day or two off.
+        return build(d - 3 * DAY, d + 4 * DAY, 'absolute-date');
+    }
+    // ── "yesterday" / "today" ──
+    if (/\byesterday\b/.test(q)) {
+        matched.push('yesterday');
+        return build(today - DAY, today, 'relative-day');
+    }
+    if (/\btoday\b/.test(q)) {
+        matched.push('today');
+        return build(today, today + DAY, 'relative-day');
+    }
+    // ── "last <weekday>" / "on <weekday>" ──
+    const wd = q.match(/\b(?:last|this|on)\s+(sunday|monday|tuesday|wednesday|thursday|friday|saturday)\b/);
+    if (wd) {
+        matched.push(wd[0]);
+        // A second weekday ("Thursday or Friday") widens rather than confuses.
+        const second = q.match(/\bor\s+(sunday|monday|tuesday|wednesday|thursday|friday|saturday)\b/);
+        if (second)
+            matched.push(second[0]);
+        const targets = [WEEKDAYS.indexOf(wd[1])];
+        if (second)
+            targets.push(WEEKDAYS.indexOf(second[1]));
+        const anchorDow = new Date(today).getUTCDay();
+        const days = targets.map(t => {
+            let back = (anchorDow - t + 7) % 7;
+            if (back === 0)
+                back = 7; // "last Friday" on a Friday means the previous one
+            return today - back * DAY;
+        });
+        // +/- 1 day of slack around the named day(s).
+        return build(Math.min(...days) - DAY, Math.max(...days) + 2 * DAY, 'relative-day');
+    }
+    // ── "last week" / "this week" / "past week" ──
+    if (/\b(?:last|this|past)\s+week\b/.test(q)) {
+        matched.push(q.match(/\b(?:last|this|past)\s+week\b/)[0]);
+        return build(today - 14 * DAY, today + DAY, 'relative-week');
+    }
+    // ── "last month" / "this month" / "past month" ──
+    if (/\b(?:last|this|past)\s+month\b/.test(q)) {
+        matched.push(q.match(/\b(?:last|this|past)\s+month\b/)[0]);
+        return build(today - 45 * DAY, today + DAY, 'relative-month');
+    }
+    // ── "last N days/weeks/months" ──
+    const lastN = q.match(/\b(?:last|past)\s+(\d{1,3})\s+(day|week|month)s?\b/);
+    if (lastN) {
+        matched.push(lastN[0]);
+        const n = +lastN[1];
+        const mult = lastN[2] === 'day' ? DAY : lastN[2] === 'week' ? 7 * DAY : 30 * DAY;
+        return build(today - n * mult, today + DAY, 'relative-week');
+    }
+    // ── "recently" / "recent" / "the other day" / "a few days ago" ──
+    if (/\b(?:recently|the other day|a few days ago|just now)\b/.test(q)) {
+        matched.push(q.match(/\b(?:recently|the other day|a few days ago|just now)\b/)[0]);
+        return build(today - 14 * DAY, today + DAY, 'recent');
+    }
+    // ── "in <Month> [Year]" — requires the "in"/"during" cue so a project named
+    //    "May" or a sentence containing "march" cannot trigger it accidentally.
+    const mon = q.match(/\b(?:in|during|back in)\s+(january|february|march|april|may|june|july|august|september|october|november|december)\b(?:\s+(\d{4}))?/);
+    if (mon) {
+        matched.push(mon[0]);
+        const mIdx = MONTHS.indexOf(mon[1]);
+        const anchorYear = new Date(today).getUTCFullYear();
+        const year = mon[2] ? +mon[2] : anchorYear;
+        const from = Date.UTC(year, mIdx, 1);
+        const to = Date.UTC(mIdx === 11 ? year + 1 : year, (mIdx + 1) % 12, 1);
+        return build(from, to, 'absolute-month');
+    }
+    return null;
+}
+/** Remove matched temporal phrases (and now-dangling connectives) from a query. */
+function stripPhrases(query, phrases) {
+    let out = query;
+    // Longest first, so "on 2026-05-01" is removed before the bare date.
+    for (const p of [...phrases].sort((a, b) => b.length - a.length)) {
+        out = out.replace(new RegExp(escapeRe(p), 'gi'), ' ');
+    }
+    return out
+        .replace(/\b(?:from|on|in|during|back in|since)\s*$/i, ' ')
+        .replace(/\s+(?:from|on|in|during)\s+(?=\s|$)/gi, ' ')
+        .replace(/\s{2,}/g, ' ')
+        .trim();
+}
+const escapeRe = (s) => s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+/** Whether temporal handling is enabled. Default OFF. */
+export function temporalEnabled() {
+    return process.env.AWM_TEMPORAL === '1';
+}
+/**
+ * Boost applied to a candidate whose creation time falls inside the window.
+ * A PREFERENCE, not a filter — see the design note above.
+ */
+export function temporalBoost() {
+    const v = Number(process.env.AWM_TEMPORAL_BOOST ?? 0.35);
+    return Number.isFinite(v) && v >= 0 ? v : 0.35;
+}
+//# sourceMappingURL=temporal-query.js.map

package/dist/core/temporal-query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-query.js","sourceRoot":"","sources":["../../src/core/temporal-query.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAeH,MAAM,GAAG,GAAG,QAAQ,CAAC;AACrB,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AAChG,MAAM,MAAM,GAAG,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM;IACpE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAEpE,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AAE1D;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,IAAmB;IAC9D,MAAM,QAAQ,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAClE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,IAA2B,EAAiB,EAAE,CAAC,CAAC;QACvF,IAAI,EAAE,EAAE,EAAE,OAAO;QACjB,QAAQ,EAAE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC;QACtC,IAAI;KACL,CAAC,CAAC;IAEH,+DAA+D;IAC/D,6EAA6E;IAC7E,8EAA8E;IAC9E,0EAA0E;IAC1E,2EAA2E;IAC3E,qEAAqE;IACrE,8EAA8E;IAC9E,4CAA4C;IAC5C,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,gFAAgF,CAAC,CAAC;IACtG,IAAI,GAAG,EAAE,CAAC;QACR,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,2DAA2D;QAC3D,OAAO,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,eAAe,CAAC,CAAC;IAC1D,CAAC;IAED,8BAA8B;IAC9B,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,cAAc,CAAC,CAAC;IACnD,CAAC;IAED,0CAA0C;IAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,mFAAmF,CAAC,CAAC;IACxG,IAAI,EAAE,EAAE,CAAC;QACP,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,uEAAuE;QACvE,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,qEAAqE,CAAC,CAAC;QAC9F,IAAI,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC3B,IAAI,IAAI,GAAG,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,IAAI,KAAK,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC,CAAiB,mDAAmD;YAC7F,OAAO,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,8CAA8C;QAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,cAAc,CAAC,CAAC;IACrF,CAAC;IAED,gDAAgD;IAChD,IAAI,+BAA+B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAE,CAAC,CAAC,KAAK,CAAC,+BAA+B,CAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,OAAO,KAAK,CAAC,KAAK,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,eAAe,CAAC,CAAC;IAC/D,CAAC;IAED,mDAAmD;IACnD,IAAI,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAE,CAAC,CAAC,KAAK,CAAC,gCAAgC,CAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,OAAO,KAAK,CAAC,KAAK,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,gBAAgB,CAAC,CAAC;IAChE,CAAC;IAED,mCAAmC;IACnC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,oDAAoD,CAAC,CAAC;IAC5E,IAAI,KAAK,EAAE,CAAC;QACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC;QACjF,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG,GAAG,EAAE,eAAe,CAAC,CAAC;IAC/D,CAAC;IAED,mEAAmE;IACnE,IAAI,wDAAwD,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACrE,OAAO,CAAC,IAAI,CAAE,CAAC,CAAC,KAAK,CAAC,wDAAwD,CAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;QACzG,OAAO,KAAK,CAAC,KAAK,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,QAAQ,CAAC,CAAC;IACxD,CAAC;IAED,6EAA6E;IAC7E,4EAA4E;IAC5E,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,oIAAoI,CAAC,CAAC;IAC1J,IAAI,GAAG,EAAE,CAAC;QACR,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,cAAc,EAAE,CAAC;QACpD,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACvE,OAAO,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,gBAAgB,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,KAAa,EAAE,OAAiB;IACpD,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,qEAAqE;IACrE,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACjE,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,GAAG;SACP,OAAO,CAAC,4CAA4C,EAAE,GAAG,CAAC;SAC1D,OAAO,CAAC,uCAAuC,EAAE,GAAG,CAAC;SACrD,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC;SACvB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAEzE,yDAAyD;AACzD,MAAM,UAAU,eAAe;IAC7B,OAAO,OAAO,CAAC,GAAG,CAAC,YAAY,KAAK,GAAG,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,IAAI,IAAI,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,CAAC"}

package/dist/core/token-budget.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Token budgeting for memory_recall (0.13.3).
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * `limit: N` is a COUNT, which is token-blind: a 5-result recall can cost 400
+ * tokens or 4,000 depending on how long the memories happen to be. AWM's own
+ * benchmark shows the problem — in real sessions AWM retrieval averaged 4,514
+ * tokens per call against 2,106 for plain file retrieval. AWM wins 9.8:1 in
+ * AGGREGATE (it needs far fewer calls) but loses 2.1:1 PER CALL. Per-call cost
+ * is the exposed flank, and a caller had no way to bound it.
+ *
+ * `max_tokens` lets the caller say "I have 800 tokens of context to spare"
+ * instead of guessing at a result count.
+ *
+ * PACKING STRATEGY
+ * ----------------
+ * This is a 0/1 knapsack (maximise score within a token budget), so we use the
+ * standard greedy density heuristic — order by score-per-token — with one
+ * deliberate exception: the top-scored result is always admitted first if it
+ * fits at all. Density packing alone can drop the single most relevant memory
+ * purely for being long, which is exactly the answer the caller wanted.
+ *
+ * Selection is by density; OUTPUT is restored to score order, because a reader
+ * scanning results expects the best one first.
+ *
+ * ESTIMATOR
+ * ---------
+ * Deliberately dependency-free: no tokenizer, no model load, no async. It
+ * takes max(words x 1.3, chars / 4) — the two standard English/code
+ * approximations — and takes the larger so the estimate errs toward
+ * OVER-counting. Over-counting keeps us inside the budget; under-counting
+ * would silently blow it, which is the failure that matters.
+ */
+import type { ActivationResult } from '../types/engram.js';
+/** Rough token count. Over-estimates by design — see the note above. */
+export declare function estimateTokens(text: string): number;
+export interface PackedRecall {
+    /** Formatted lines that fit the budget, in score order. */
+    lines: string[];
+    /** How many results were kept. */
+    kept: number;
+    /** How many results were available before budgeting. */
+    total: number;
+    /** Estimated tokens of the kept lines. */
+    tokens: number;
+    /** Estimated tokens of everything dropped (0 when nothing was dropped). */
+    withheldTokens: number;
+}
+/**
+ * Select and format results to fit `maxTokens`.
+ *
+ * When `maxTokens` is undefined the behaviour is unchanged from pre-0.13.3 —
+ * everything is returned — but the accounting fields are still populated, so
+ * callers get per-call token visibility without opting into budgeting.
+ */
+export declare function packRecallByBudget(results: ActivationResult[], format: (r: ActivationResult, index: number) => string, maxTokens?: number, 
+/**
+ * Tokens the caller will spend on the SAME reply outside the result lines —
+ * the accounting footer, and any peer-decisions suffix. Reserved up front so
+ * the budget bounds the whole reply rather than just the part this function
+ * happens to build.
+ *
+ * Found by the end-to-end eval, not by the unit tests: budgets of 600/250/80
+ * came back as 601/256/95 because the footer spent tokens it never counted.
+ */
+reservedTokens?: number): PackedRecall;
+/**
+ * One-line accounting footer. Costs ~15-25 tokens to report, which is a good
+ * trade against a recall that can run to thousands — and it is what makes the
+ * per-call cost visible to both the human and the harness. Without this,
+ * AWM's token behaviour is only observable in an offline benchmark.
+ */
+export declare function formatTokenFooter(p: PackedRecall, maxTokens?: number): string;
+//# sourceMappingURL=token-budget.d.ts.map

package/dist/core/token-budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-budget.d.ts","sourceRoot":"","sources":["../../src/core/token-budget.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,wEAAwE;AACxE,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAKnD;AAED,MAAM,WAAW,YAAY;IAC3B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,kCAAkC;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,wDAAwD;IACxD,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,MAAM,EAAE,MAAM,CAAC;IACf,2EAA2E;IAC3E,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,gBAAgB,EAAE,EAC3B,MAAM,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,KAAK,MAAM,EACtD,SAAS,CAAC,EAAE,MAAM;AAClB;;;;;;;;GAQG;AACH,cAAc,SAAI,GACjB,YAAY,CA+Dd;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAO7E"}

package/dist/core/token-budget.js

@@ -0,0 +1,136 @@
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Token budgeting for memory_recall (0.13.3).
+ *
+ * WHY THIS EXISTS
+ * ---------------
+ * `limit: N` is a COUNT, which is token-blind: a 5-result recall can cost 400
+ * tokens or 4,000 depending on how long the memories happen to be. AWM's own
+ * benchmark shows the problem — in real sessions AWM retrieval averaged 4,514
+ * tokens per call against 2,106 for plain file retrieval. AWM wins 9.8:1 in
+ * AGGREGATE (it needs far fewer calls) but loses 2.1:1 PER CALL. Per-call cost
+ * is the exposed flank, and a caller had no way to bound it.
+ *
+ * `max_tokens` lets the caller say "I have 800 tokens of context to spare"
+ * instead of guessing at a result count.
+ *
+ * PACKING STRATEGY
+ * ----------------
+ * This is a 0/1 knapsack (maximise score within a token budget), so we use the
+ * standard greedy density heuristic — order by score-per-token — with one
+ * deliberate exception: the top-scored result is always admitted first if it
+ * fits at all. Density packing alone can drop the single most relevant memory
+ * purely for being long, which is exactly the answer the caller wanted.
+ *
+ * Selection is by density; OUTPUT is restored to score order, because a reader
+ * scanning results expects the best one first.
+ *
+ * ESTIMATOR
+ * ---------
+ * Deliberately dependency-free: no tokenizer, no model load, no async. It
+ * takes max(words x 1.3, chars / 4) — the two standard English/code
+ * approximations — and takes the larger so the estimate errs toward
+ * OVER-counting. Over-counting keeps us inside the budget; under-counting
+ * would silently blow it, which is the failure that matters.
+ */
+/** Rough token count. Over-estimates by design — see the note above. */
+export function estimateTokens(text) {
+    if (!text)
+        return 0;
+    const chars = text.length;
+    const words = text.split(/\s+/).filter(Boolean).length;
+    return Math.max(Math.ceil(words * 1.3), Math.ceil(chars / 4));
+}
+/**
+ * Select and format results to fit `maxTokens`.
+ *
+ * When `maxTokens` is undefined the behaviour is unchanged from pre-0.13.3 —
+ * everything is returned — but the accounting fields are still populated, so
+ * callers get per-call token visibility without opting into budgeting.
+ */
+export function packRecallByBudget(results, format, maxTokens, 
+/**
+ * Tokens the caller will spend on the SAME reply outside the result lines —
+ * the accounting footer, and any peer-decisions suffix. Reserved up front so
+ * the budget bounds the whole reply rather than just the part this function
+ * happens to build.
+ *
+ * Found by the end-to-end eval, not by the unit tests: budgets of 600/250/80
+ * came back as 601/256/95 because the footer spent tokens it never counted.
+ */
+reservedTokens = 0) {
+    const total = results.length;
+    if (total === 0)
+        return { lines: [], kept: 0, total: 0, tokens: 0, withheldTokens: 0 };
+    const effectiveBudget = maxTokens === undefined ? undefined
+        : Math.max(0, maxTokens - reservedTokens);
+    // Format once against the ORIGINAL index so displayed numbering matches the
+    // caller's mental model of "result 1 is the best match".
+    const measured = results.map((r, i) => {
+        const line = format(r, i);
+        return { line, tokens: estimateTokens(line), score: r.score, order: i };
+    });
+    const allTokens = measured.reduce((n, m) => n + m.tokens, 0);
+    // NOTE the asymmetry, which a unit test caught: `maxTokens` being absent or
+    // nonsense (<= 0) means "no budget — return everything", but an
+    // *effectiveBudget* of 0 means the reserve ate the entire budget, which must
+    // admit NOTHING. Collapsing those two cases returned the full result set on
+    // the tightest budgets — the exact opposite of what was asked for.
+    const unbudgeted = maxTokens === undefined || maxTokens <= 0;
+    if (unbudgeted || allTokens <= effectiveBudget) {
+        return {
+            lines: measured.map(m => m.line),
+            kept: total,
+            total,
+            tokens: allTokens,
+            withheldTokens: 0,
+        };
+    }
+    const chosen = [];
+    let spent = 0;
+    // 1. Top-scored result gets first refusal, so a long best-match is never
+    //    dropped in favour of several short weak ones.
+    const top = measured[0];
+    if (top.tokens <= effectiveBudget) {
+        chosen.push(top);
+        spent += top.tokens;
+    }
+    // 2. Everything else by value density (score per token), greedily.
+    const rest = measured
+        .filter(m => m !== top)
+        .sort((a, b) => (b.score / Math.max(b.tokens, 1)) - (a.score / Math.max(a.tokens, 1)));
+    for (const m of rest) {
+        if (spent + m.tokens > effectiveBudget)
+            continue; // skip, don't stop: a later
+        chosen.push(m); // shorter result may still fit
+        spent += m.tokens;
+    }
+    // 3. Restore score order for display.
+    chosen.sort((a, b) => a.order - b.order);
+    return {
+        lines: chosen.map(m => m.line),
+        kept: chosen.length,
+        total,
+        tokens: spent,
+        withheldTokens: allTokens - spent,
+    };
+}
+/**
+ * One-line accounting footer. Costs ~15-25 tokens to report, which is a good
+ * trade against a recall that can run to thousands — and it is what makes the
+ * per-call cost visible to both the human and the harness. Without this,
+ * AWM's token behaviour is only observable in an offline benchmark.
+ */
+export function formatTokenFooter(p, maxTokens) {
+    if (p.total === 0)
+        return '';
+    const parts = [`~${p.tokens} tok`];
+    parts.push(p.kept === p.total ? `${p.total} results` : `${p.kept}/${p.total} results`);
+    if (maxTokens !== undefined && maxTokens > 0)
+        parts.push(`budget ${maxTokens}`);
+    if (p.withheldTokens > 0)
+        parts.push(`~${p.withheldTokens} tok withheld`);
+    return `\n\n[awm: ${parts.join(' · ')}]`;
+}
+//# sourceMappingURL=token-budget.js.map

package/dist/core/token-budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-budget.js","sourceRoot":"","sources":["../../src/core/token-budget.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,wEAAwE;AACxE,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAeD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAA2B,EAC3B,MAAsD,EACtD,SAAkB;AAClB;;;;;;;;GAQG;AACH,cAAc,GAAG,CAAC;IAElB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAC7B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;IACvF,MAAM,eAAe,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS;QACzD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,cAAc,CAAC,CAAC;IAE5C,4EAA4E;IAC5E,yDAAyD;IACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE7D,4EAA4E;IAC5E,gEAAgE;IAChE,6EAA6E;IAC7E,4EAA4E;IAC5E,mEAAmE;IACnE,MAAM,UAAU,GAAG,SAAS,KAAK,SAAS,IAAI,SAAS,IAAI,CAAC,CAAC;IAC7D,IAAI,UAAU,IAAI,SAAS,IAAI,eAAgB,EAAE,CAAC;QAChD,OAAO;YACL,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAChC,IAAI,EAAE,KAAK;YACX,KAAK;YACL,MAAM,EAAE,SAAS;YACjB,cAAc,EAAE,CAAC;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,yEAAyE;IACzE,mDAAmD;IACnD,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,GAAG,CAAC,MAAM,IAAI,eAAgB,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;IACtB,CAAC;IAED,mEAAmE;IACnE,MAAM,IAAI,GAAG,QAAQ;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,eAAgB;YAAE,SAAS,CAAG,4BAA4B;QACjF,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAgC,+BAA+B;QAC9E,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,sCAAsC;IACtC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9B,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,KAAK;QACL,MAAM,EAAE,KAAK;QACb,cAAc,EAAE,SAAS,GAAG,KAAK;KAClC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAe,EAAE,SAAkB;IACnE,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC;IACvF,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,SAAS,EAAE,CAAC,CAAC;IAChF,IAAI,CAAC,CAAC,cAAc,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc,eAAe,CAAC,CAAC;IAC1E,OAAO,aAAa,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AAC3C,CAAC"}

package/dist/core/whoami.d.ts

@@ -12,6 +12,17 @@ export interface WhoamiInfo {
         http: number | null;
         hookSidecar: number | null;
     };
+    /**
+     * Effective recall configuration. `whoami` is the "what am I actually
+     * running" tool, and the version alone does not answer that: a build can be
+     * current while the recall flags that change its behaviour are unset, or set
+     * to something unintended. GET /health already reports this, but HTTP is off
+     * by default, so an MCP-only session had no way to see it.
+     */
+    recall: {
+        fingerprint: string;
+        flags: Record<string, string>;
+    };
     siblingAgents: string[];
 }
 /** Store subset whoami needs — every backend implements listAgentIds. */

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

@@ -1 +1 @@
-{"version":3,"file":"whoami.d.ts","sourceRoot":"","sources":["../../src/core/whoami.ts"],"names":[],"mappings":"AAqBA,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,KAAK,GAAG,MAAM,CAAC;IACxB,IAAI,EAAE,YAAY,GAAG,MAAM,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IAC3D,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,YAAY,IAAI,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CAC9C;AASD,wBAAsB,WAAW,CAC/B,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,KAAK,GAAG,MAAM,GACtB,OAAO,CAAC,UAAU,CAAC,CAyBrB;AAED,0DAA0D;AAC1D,wBAAgB,YAAY,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAYlD"}
+{"version":3,"file":"whoami.d.ts","sourceRoot":"","sources":["../../src/core/whoami.ts"],"names":[],"mappings":"AAuBA,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,KAAK,GAAG,MAAM,CAAC;IACxB,IAAI,EAAE,YAAY,GAAG,MAAM,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IAC3D;;;;;;OAMG;IACH,MAAM,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,CAAC;IAC/D,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,YAAY,IAAI,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CAC9C;AASD,wBAAsB,WAAW,CAC/B,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,KAAK,GAAG,MAAM,GACtB,OAAO,CAAC,UAAU,CAAC,CA0BrB;AAED,0DAA0D;AAC1D,wBAAgB,YAAY,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAmBlD"}