@spinabot/brigade 0.1.2 → 1.0.1

package/dist/agents/memory/eval/capabilities.js

@@ -0,0 +1,210 @@
+/**
+ * RecallCapability adapters over a `FactStore` — the bridge that lets the
+ * harness score real backends + the baselines (Tideline build Step 3 + 8).
+ *
+ * Every adapter returns the harness's minimal `{ id, score }[]` shape and
+ * never reinforces decay — an EVAL run must not mutate the thing it measures.
+ * The invariant holds two ways: the store-backed lanes pass `markAccessed: false`
+ * to `search`/`searchHybrid`, and the `list()`-based lanes (linearScan/fts/oracle)
+ * read through `store.list()`, which never touches `accessCount`.
+ *
+ * `limit` contract (uniform across all lanes): a `limit > 0` caps the result
+ * set; any non-positive or absent `limit` falls back to the lane's default. The
+ * store-backed lanes inherit the store's default of 8; the `list()`-based lanes
+ * have no fixed cap, so their default is "return all matching candidates".
+ */
+import { effectiveScore } from "../decay.js";
+import { cosine } from "../embedder.js";
+import { recallWithGraph } from "../graph-recall.js";
+import { bm25Score, linearScanScore } from "../scoring.js";
+/**
+ * **Linear-scan floor** — the OLD crude term-overlap (`linearScanScore`),
+ * applied directly over the store's active + origin-matching records. This is the
+ * baseline the SERVED recall path (the trust-weighted hybrid) must beat — gold-hard
+ * asserts exactly that. NOTE: the intermediate BM25×effectiveScore lane (no trust)
+ * is NOT guaranteed to beat it — on an adversarial poison set the crude overlap can
+ * edge out decay/importance modulation, which is precisely why TRUST (the hybrid) is
+ * what `recall()` serves, not bare BM25×eff. Deliberately decoupled from
+ * `FactStore.search` (now BM25) so it stays a fixed floor.
+ */
+export function linearScanCapability(store, origin) {
+    return {
+        async search(query, opts) {
+            const now = Date.now();
+            // active-only + bi-temporal valid-time gate (matches FactStore.search):
+            // a fact whose `validTo` has passed is excluded from recall.
+            const candidates = store
+                .list(origin !== undefined ? { origin } : {})
+                .filter((r) => r.validTo === undefined || r.validTo > now);
+            const ranked = linearScanScore(candidates, query);
+            // limit contract matches the store: a positive limit caps, otherwise
+            // fall back to the lane default (here: all candidates).
+            const limited = opts?.limit && opts.limit > 0 ? ranked.slice(0, opts.limit) : ranked;
+            return limited.map((s) => ({ id: s.record.memoryId, score: s.score }));
+        },
+    };
+}
+/**
+ * The DEFAULT v1 recall — `FactStore.search` (now Okapi BM25 × `effectiveScore`,
+ * origin-filtered). This is Tideline's actual lexical retriever, and (because
+ * `FactStore` reads the fs file or the convex hydrated cache through the same
+ * code) it is the SAME ranking in both modes — the cross-mode parity subject.
+ */
+export function defaultRecallCapability(store, origin) {
+    return {
+        async search(query, opts) {
+            const hits = store.search(query, {
+                markAccessed: false,
+                ...(opts?.limit !== undefined ? { limit: opts.limit } : {}),
+                ...(origin !== undefined ? { origin } : {}),
+            });
+            return hits.map((h) => ({ id: h.memoryId, score: h.score }));
+        },
+    };
+}
+/**
+ * **Plain-lexical FTS baseline** (Step 3, baseline iii) — Okapi BM25 with NO
+ * decay/importance modulation (`modulate: false`), reproducing how a vanilla
+ * full-text-search engine ranks (the lexical approach the reference memory
+ * systems use). The vector half of the classic "FTS ⊕ vec" hybrid is the v2
+ * lane (no embedder in v1, per the 0.2 lock), so this baseline is the lexical
+ * lane only. Isolates what Tideline's `effectiveScore` modulation buys over
+ * plain FTS. Origin-filtered for a fair comparison.
+ */
+export function ftsBaselineCapability(store, origin) {
+    return {
+        async search(query, opts) {
+            const now = Date.now();
+            // active-only + bi-temporal valid-time gate (matches FactStore.search);
+            // the same `now` drives both the gate and bm25Score so they agree.
+            const candidates = store
+                .list(origin !== undefined ? { origin } : {})
+                .filter((r) => r.validTo === undefined || r.validTo > now);
+            const ranked = bm25Score(candidates, query, now, { modulate: false });
+            // limit contract matches the store: a positive limit caps, otherwise
+            // fall back to the lane default (here: all candidates).
+            const limited = opts?.limit && opts.limit > 0 ? ranked.slice(0, opts.limit) : ranked;
+            return limited.map((s) => ({ id: s.record.memoryId, score: s.score }));
+        },
+    };
+}
+/**
+ * **Multi-signal hybrid** (Tideline v2) — `FactStore.searchHybrid`: BM25-primary
+ * with an HRR-cosine recovery lane, × trust × decay, MMR-diversified (model-free).
+ * This is what `recall()` serves in production.
+ * Measured here to confirm the mix doesn't REGRESS recall vs pure BM25 (its real
+ * wins — trust down-weighting, diversity, robustness — show on messy real data,
+ * not a clean synthetic gold).
+ */
+export function hybridRecallCapability(store, origin) {
+    return {
+        async search(query, opts) {
+            const hits = store.searchHybrid(query, {
+                markAccessed: false,
+                ...(opts?.limit !== undefined ? { limit: opts.limit } : {}),
+                ...(origin !== undefined ? { origin } : {}),
+            });
+            return hits.map((h) => ({ id: h.memoryId, score: h.score }));
+        },
+    };
+}
+/**
+ * **Weighted-sum fusion baseline** (Step 1, the "competitor reproduced" baseline) —
+ * reproduces the recall FORMULA used by a mature FTS+vector memory engine: a
+ * WEIGHTED-SUM fuse of normalised vector-cosine (0.7) + normalised BM25 (0.3),
+ * × temporal decay. The EMBEDDER IS HELD CONSTANT (Brigade's HRR) so this
+ * isolates the FUSION ALGORITHM — the classic weighted-sum vs BM25-primary-with-
+ * recovery (Tideline's `searchHybrid`). It is deliberately NOT a full
+ * reproduction: that engine's LEARNED embedder is the separate "learned-embedder"
+ * upgrade. With a weak model-free vector the 0.7 vec weight is a handicap —
+ * which is exactly the trap Tideline avoids by keeping BM25 PRIMARY and using
+ * the vector only as an append-below recovery lane. So this baseline answers
+ * "is our fusion better than the standard weighted-sum, at equal embedder?"
+ * honestly; the embedder gap is measured separately when a learned model lands.
+ */
+export function weightedSumFusionBaseline(store, embedder, origin) {
+    return {
+        async search(query, opts) {
+            const now = Date.now();
+            const candidates = store
+                .list(origin !== undefined ? { origin } : {})
+                .filter((r) => r.validTo === undefined || r.validTo > now);
+            if (candidates.length === 0)
+                return [];
+            // Plain BM25 (no Tideline modulation) → normalise to [0,1].
+            const lex = bm25Score(candidates, query, now, { modulate: false });
+            const lexById = new Map(lex.map((s) => [s.record.memoryId, s.score]));
+            const lexMax = Math.max(1e-9, ...lex.map((s) => s.score));
+            const qv = embedder.embed([query])[0] ?? [];
+            const fused = candidates
+                .map((r) => {
+                const lexN = (lexById.get(r.memoryId) ?? 0) / lexMax;
+                const sim = r.embedding && r.embedding.length === qv.length ? Math.max(0, cosine(qv, r.embedding)) : 0;
+                // Classic weighted-sum (0.7 vec / 0.3 text), faded by temporal decay.
+                return { record: r, score: (0.7 * sim + 0.3 * lexN) * effectiveScore(r, now) };
+            })
+                .filter((x) => x.score > 0)
+                .sort((a, b) => b.score - a.score || b.record.createdAt - a.record.createdAt);
+            const limited = opts?.limit && opts.limit > 0 ? fused.slice(0, opts.limit) : fused;
+            return limited.map((x) => ({ id: x.record.memoryId, score: x.score }));
+        },
+    };
+}
+/**
+ * **Graph-augmented recall** (Step 20) — the gated spreading-activation walk
+ * over the store's active + origin-filtered records. `forceWalk` is ON for the
+ * eval lane so the multi-hop benefit is measurable on a multi-hop gold set (the
+ * route-gate's "single-fact flat" behaviour is asserted separately in
+ * graph-recall.test.ts). Lets the harness show "multi-hop category ↑ vs hybrid".
+ */
+export function graphRecallCapability(store, origin) {
+    return {
+        async search(query, opts) {
+            // `store.list` is gated by lifecycle/segment/origin only; the bi-temporal
+            // valid-time gate (validTo > now) is applied INSIDE recallWithGraph, so
+            // this lane and oracleCapability score the SAME candidate set (expired
+            // future-dated facts excluded from both) — the multi-hop comparison stays
+            // apples-to-apples.
+            const active = store.list(origin !== undefined ? { origin } : {});
+            const hits = recallWithGraph(active, query, {
+                forceWalk: true,
+                ...(opts?.limit !== undefined ? { limit: opts.limit } : {}),
+            });
+            return hits.map((h) => ({ id: h.record.memoryId, score: h.score }));
+        },
+    };
+}
+/**
+ * **Full-context dump** (the "no-retrieval" baseline) — returns ALL active
+ * (origin-filtered) facts, IGNORING the query, in most-recent-first order
+ * (`store.list()` sorts by `createdAt` descending — no relevance ranking, that's
+ * the point). Models "just stuff everything into the prompt".
+ *
+ * Reading its recall@k HONESTLY: at k ≥ corpus it includes everything → recall =
+ * 1.0 (it never LOSES a fact — see the k≥corpus test). Below that, a context
+ * BUDGET forces a choice of which k facts to include; un-ranked, it takes the
+ * most-recently-written k facts, so a low recall@k is a TRUNCATION artifact, NOT a recall
+ * deficiency — the gap to the index is exactly "ranking fills a bounded budget
+ * with RELEVANT facts; dumping can't". Its genuine, non-tautological cost vs the
+ * index is ABSTENTION: it returns facts even on a no-answer query (a
+ * hallucination feed), where the index stays silent. So it is compared on
+ * abstention + budget-bounded recall — never headlined as a recall rival the
+ * index "beats".
+ */
+export function oracleCapability(store, origin) {
+    return {
+        async search(_query, opts) {
+            const now = Date.now();
+            // active-only + bi-temporal valid-time gate (matches FactStore.search):
+            // a fact whose `validTo` has passed is excluded from recall.
+            const all = store
+                .list(origin !== undefined ? { origin } : {})
+                .filter((r) => r.validTo === undefined || r.validTo > now);
+            // limit contract matches the store: a positive limit caps, otherwise
+            // fall back to the lane default (here: all candidates).
+            const limited = opts?.limit && opts.limit > 0 ? all.slice(0, opts.limit) : all;
+            return limited.map((r, i) => ({ id: r.memoryId, score: 1 - i * 1e-6 }));
+        },
+    };
+}
+//# sourceMappingURL=capabilities.js.map

package/dist/agents/memory/eval/capabilities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"capabilities.js","sourceRoot":"","sources":["../../../../src/agents/memory/eval/capabilities.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAiB,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAG3D;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAgB,EAAE,MAA2B;IACjF,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,wEAAwE;YACxE,6DAA6D;YAC7D,MAAM,UAAU,GAAG,KAAK;iBACtB,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YAC5D,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAClD,qEAAqE;YACrE,wDAAwD;YACxD,MAAM,OAAO,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACrF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxE,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAgB,EAAE,MAA2B;IACpF,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE;gBAChC,YAAY,EAAE,KAAK;gBACnB,GAAG,CAAC,IAAI,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3D,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAgB,EAAE,MAA2B;IAClF,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,wEAAwE;YACxE,mEAAmE;YACnE,MAAM,UAAU,GAAG,KAAK;iBACtB,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YAC5D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YACtE,qEAAqE;YACrE,wDAAwD;YACxD,MAAM,OAAO,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACrF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxE,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAgB,EAAE,MAA2B;IACnF,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE;gBACtC,YAAY,EAAE,KAAK;gBACnB,GAAG,CAAC,IAAI,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3D,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,yBAAyB,CACxC,KAAgB,EAChB,QAAkB,EAClB,MAA2B;IAE3B,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,KAAK;iBACtB,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YAC5D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YACvC,4DAA4D;YAC5D,MAAM,GAAG,GAAG,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,GAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5D,MAAM,KAAK,GAAG,UAAU;iBACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACV,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBACrD,MAAM,GAAG,GACR,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5F,sEAAsE;gBACtE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YAChF,CAAC,CAAC;iBACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;iBAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC/E,MAAM,OAAO,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACnF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxE,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAgB,EAAE,MAA2B;IAClF,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI;YACvB,0EAA0E;YAC1E,wEAAwE;YACxE,uEAAuE;YACvE,0EAA0E;YAC1E,oBAAoB;YACpB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE;gBAC3C,SAAS,EAAE,IAAI;gBACf,GAAG,CAAC,IAAI,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3D,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC;KACD,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAgB,EAAE,MAA2B;IAC7E,OAAO;QACN,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI;YACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,wEAAwE;YACxE,6DAA6D;YAC7D,MAAM,GAAG,GAAG,KAAK;iBACf,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YAC5D,qEAAqE;YACrE,wDAAwD;YACxD,MAAM,OAAO,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YAC/E,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;KACD,CAAC;AACH,CAAC"}

package/dist/agents/memory/eval/gold-export.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Real-data gold EXPORT (build Step 2 — the privacy-safe local path).
+ *
+ * Turns the operator's REAL on-disk facts into a {@link GoldSpec} SCAFFOLD they
+ * review + approve LOCALLY, then feed back through `loadGoldSpec` → `seedGold` →
+ * `runRecallEval`. This is the "export → generate → human-approve" pipeline,
+ * minus the leak: the output holds real personal facts, so it is written to a
+ * `.local.json` file that `.gitignore` keeps OUT of the (public) repo — it is
+ * NEVER committed or pushed. The committed CI gold stays synthetic.
+ *
+ * Pipeline (run on the machine that HAS the facts):
+ *   const store = new FactStore(workspaceDir);            // fs OR convex (cache)
+ *   writeLocalGoldSpec(p, exportGoldScaffold(store));     // → gold.local.json
+ *   // …operator edits gold.local.json: rewrite each trivial query into a real
+ *   //   paraphrase, set the taxonomy category, drop noise, mark abstentions…
+ *   const cases = seedGold(new FactStore(tmp), loadGoldSpec(p));
+ *   const result = await runRecallEval(defaultRecallCapability(store2), cases);
+ *
+ * The auto-generated queries are TRIVIAL by construction (terms lifted straight
+ * from the fact), so an un-approved scaffold over-scores — the human-approval
+ * rewrite is what makes it a real measurement (v2's LlmAdapter can automate the
+ * paraphrase). Nothing here runs in CI; it's an on-demand local tool.
+ */
+import { FactStore } from "../records.js";
+import { type GoldSpec } from "./gold.js";
+/**
+ * Build a gold-set scaffold from a store's ACTIVE facts. Facts are keyed by
+ * their real `memoryId` (already stable); each fact gets ONE candidate case
+ * whose query is its salient content terms — a placeholder for the operator to
+ * rewrite into a realistic query during approval.
+ */
+export declare function exportGoldScaffold(store: FactStore, opts?: {
+    maxCases?: number;
+}): GoldSpec;
+/**
+ * Persist a gold spec to a LOCAL file. The caller MUST use a path matched by
+ * `.gitignore` (any `*.local.json` — the suffix is gitignored repo-wide) so real
+ * facts never reach the public repo — enforced by {@link assertLocalGoldPath}.
+ */
+export declare function writeLocalGoldSpec(filePath: string, spec: GoldSpec): void;
+/** Guard: a real-data gold file MUST be a `.local.json` (the gitignored pattern),
+ *  so exporting real personal facts can't accidentally target a committed path. */
+export declare function assertLocalGoldPath(filePath: string): void;
+//# sourceMappingURL=gold-export.d.ts.map

package/dist/agents/memory/eval/gold-export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gold-export.d.ts","sourceRoot":"","sources":["../../../../src/agents/memory/eval/gold-export.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAKH,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE1C,OAAO,EAAyD,KAAK,QAAQ,EAAE,MAAM,WAAW,CAAC;AAEjG;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,QAAQ,CAiC/F;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAIzE;AAED;mFACmF;AACnF,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAM1D"}

package/dist/agents/memory/eval/gold-export.js

@@ -0,0 +1,85 @@
+/**
+ * Real-data gold EXPORT (build Step 2 — the privacy-safe local path).
+ *
+ * Turns the operator's REAL on-disk facts into a {@link GoldSpec} SCAFFOLD they
+ * review + approve LOCALLY, then feed back through `loadGoldSpec` → `seedGold` →
+ * `runRecallEval`. This is the "export → generate → human-approve" pipeline,
+ * minus the leak: the output holds real personal facts, so it is written to a
+ * `.local.json` file that `.gitignore` keeps OUT of the (public) repo — it is
+ * NEVER committed or pushed. The committed CI gold stays synthetic.
+ *
+ * Pipeline (run on the machine that HAS the facts):
+ *   const store = new FactStore(workspaceDir);            // fs OR convex (cache)
+ *   writeLocalGoldSpec(p, exportGoldScaffold(store));     // → gold.local.json
+ *   // …operator edits gold.local.json: rewrite each trivial query into a real
+ *   //   paraphrase, set the taxonomy category, drop noise, mark abstentions…
+ *   const cases = seedGold(new FactStore(tmp), loadGoldSpec(p));
+ *   const result = await runRecallEval(defaultRecallCapability(store2), cases);
+ *
+ * The auto-generated queries are TRIVIAL by construction (terms lifted straight
+ * from the fact), so an un-approved scaffold over-scores — the human-approval
+ * rewrite is what makes it a real measurement (v2's LlmAdapter can automate the
+ * paraphrase). Nothing here runs in CI; it's an on-demand local tool.
+ */
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { tokenize } from "../scoring.js";
+import { GOLD_REVIEW_PLACEHOLDER } from "./gold.js";
+/**
+ * Build a gold-set scaffold from a store's ACTIVE facts. Facts are keyed by
+ * their real `memoryId` (already stable); each fact gets ONE candidate case
+ * whose query is its salient content terms — a placeholder for the operator to
+ * rewrite into a realistic query during approval.
+ */
+export function exportGoldScaffold(store, opts = {}) {
+    const records = store.list(); // active, most-recent-first
+    const facts = records.map((r) => ({
+        key: r.memoryId,
+        content: r.content,
+        segment: r.segment,
+        importance: r.importance,
+        ...(r.createdBy !== undefined ? { createdBy: r.createdBy } : {}),
+        // Carry sourceType through — without it an untrusted real fact (tool_output /
+        // retrieved_document / extraction / …) would scaffold as a TRUSTED one
+        // (undefined ⇒ trusted at the write-gate), silently mislabeling the poison
+        // lane the operator is trying to capture.
+        ...(r.sourceType !== undefined ? { sourceType: r.sourceType } : {}),
+    }));
+    const limit = opts.maxCases !== undefined && opts.maxCases >= 0 ? opts.maxCases : records.length;
+    const cases = records.slice(0, limit).map((r, i) => {
+        const terms = [...new Set(tokenize(r.content))].slice(0, 6).join(" ");
+        return {
+            id: `cand-${i}`,
+            // ⚠ TRIVIAL placeholder — rewrite into a realistic paraphrase on approval.
+            // If auto-extraction yields no terms (content was all stopwords/punctuation),
+            // emit a visible placeholder so the operator can't miss the empty query on
+            // review — and `loadGoldSpec` HARD-REJECTS any spec that still carries it.
+            query: terms.length > 0 ? terms : GOLD_REVIEW_PLACEHOLDER,
+            relevantKeys: [r.memoryId],
+            // A reasonable default bucket (the fact's segment); refine to a GOLD_CATEGORIES
+            // taxonomy label (single-session/temporal/abstention/…) during approval.
+            category: r.segment,
+        };
+    });
+    // approved:false ⇒ `loadGoldSpec` refuses to score this until the operator
+    // reviews the trivial auto-queries and flips it to true (anti-inflation gate).
+    return { approved: false, facts, cases };
+}
+/**
+ * Persist a gold spec to a LOCAL file. The caller MUST use a path matched by
+ * `.gitignore` (any `*.local.json` — the suffix is gitignored repo-wide) so real
+ * facts never reach the public repo — enforced by {@link assertLocalGoldPath}.
+ */
+export function writeLocalGoldSpec(filePath, spec) {
+    assertLocalGoldPath(filePath);
+    fs.mkdirSync(path.dirname(filePath), { recursive: true });
+    fs.writeFileSync(filePath, JSON.stringify(spec, null, 2), "utf8");
+}
+/** Guard: a real-data gold file MUST be a `.local.json` (the gitignored pattern),
+ *  so exporting real personal facts can't accidentally target a committed path. */
+export function assertLocalGoldPath(filePath) {
+    if (!filePath.endsWith(".local.json")) {
+        throw new Error(`real-data gold must be written to a *.local.json file (gitignored, never pushed); got: ${filePath}`);
+    }
+}
+//# sourceMappingURL=gold-export.js.map

package/dist/agents/memory/eval/gold-export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gold-export.js","sourceRoot":"","sources":["../../../../src/agents/memory/eval/gold-export.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAGlC,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,uBAAuB,EAA+C,MAAM,WAAW,CAAC;AAEjG;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAgB,EAAE,OAA8B,EAAE;IACpF,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,4BAA4B;IAC1D,MAAM,KAAK,GAAe,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7C,GAAG,EAAE,CAAC,CAAC,QAAQ;QACf,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,GAAG,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,8EAA8E;QAC9E,uEAAuE;QACvE,2EAA2E;QAC3E,0CAA0C;QAC1C,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACnE,CAAC,CAAC,CAAC;IACJ,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACjG,MAAM,KAAK,GAAe,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtE,OAAO;YACN,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,2EAA2E;YAC3E,8EAA8E;YAC9E,2EAA2E;YAC3E,2EAA2E;YAC3E,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,uBAAuB;YACzD,YAAY,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC1B,gFAAgF;YAChF,yEAAyE;YACzE,QAAQ,EAAE,CAAC,CAAC,OAAO;SACnB,CAAC;IACH,CAAC,CAAC,CAAC;IACH,2EAA2E;IAC3E,+EAA+E;IAC/E,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB,EAAE,IAAc;IAClE,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAC9B,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACnE,CAAC;AAED;mFACmF;AACnF,MAAM,UAAU,mBAAmB,CAAC,QAAgB;IACnD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CACd,0FAA0F,QAAQ,EAAE,CACpG,CAAC;IACH,CAAC;AACF,CAAC"}

package/dist/agents/memory/eval/gold-hard.d.ts

@@ -0,0 +1,35 @@
+/**
+ * HARD discriminating gold set (Tideline build Step 3, the "show the wins" tier).
+ *
+ * The synthetic gold (gold-synthetic.ts) is CLEAN: every query has one obvious
+ * answer and no competition, so floor / FTS / BM25 / hybrid all tie at 100% — it
+ * proves correctness + abstention, not where Tideline's modulation wins. THIS set
+ * adds the competition that separates the lanes, across the model-free win
+ * surfaces (vectors are the deferred v2 lane, so paraphrase recovery is out of
+ * scope here):
+ *
+ *   • POISON (trust)       — a TRUSTED owner fact vs an UNTRUSTED tool/retrieved
+ *     distractor sharing the query terms. On ~half the cases the distractor
+ *     out-scores the answer on raw BM25 (so plain-FTS / un-trusted BM25 rank the
+ *     POISON first there; on the rest the answer already wins lexically) — only the
+ *     trust-weighted hybrid (TRUST_BY_SOURCE) ranks the trusted answer #1 on ALL of
+ *     them. The gated claim is the SERVED hybrid's poison MRR (1.00) > floor (0.83);
+ *     the intermediate BM25×eff lane (no trust) can even regress below the floor.
+ *   • IMPORTANCE (decay×importance modulation) — a HIGH-importance answer vs a
+ *     LOW-importance distractor with comparable BM25. Plain-FTS ignores
+ *     importance and ranks the distractor first; the modulated lanes (BM25×eff +
+ *     hybrid) lift the important answer. (Decay is the temporal sibling of this
+ *     same effectiveScore modulator — testable once real aged data exists.)
+ *   • PRECISION            — one answer amid sibling distractors that share SOME
+ *     query terms; measures ranking quality (MRR/nDCG), not a lane win.
+ *   • ABSTENTION           — no-answer queries; a hit is a violation.
+ *
+ * Write-gate honesty: untrusted distractors live ONLY in descriptive segments
+ * (knowledge/context/project/relationship) — the gate blocks an untrusted source
+ * from authoring identity/preference/correction, so a poison fact can't be a
+ * preference; it competes as descriptive "evidence" (a tool result asserting a
+ * fact about the user), which is the real attack surface.
+ */
+import type { GoldSpec } from "./gold.js";
+export declare const HARD_GOLD: GoldSpec;
+//# sourceMappingURL=gold-hard.d.ts.map

package/dist/agents/memory/eval/gold-hard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gold-hard.d.ts","sourceRoot":"","sources":["../../../../src/agents/memory/eval/gold-hard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE1C,eAAO,MAAM,SAAS,EAAE,QAgGvB,CAAC"}

package/dist/agents/memory/eval/gold-hard.js

@@ -0,0 +1,113 @@
+/**
+ * HARD discriminating gold set (Tideline build Step 3, the "show the wins" tier).
+ *
+ * The synthetic gold (gold-synthetic.ts) is CLEAN: every query has one obvious
+ * answer and no competition, so floor / FTS / BM25 / hybrid all tie at 100% — it
+ * proves correctness + abstention, not where Tideline's modulation wins. THIS set
+ * adds the competition that separates the lanes, across the model-free win
+ * surfaces (vectors are the deferred v2 lane, so paraphrase recovery is out of
+ * scope here):
+ *
+ *   • POISON (trust)       — a TRUSTED owner fact vs an UNTRUSTED tool/retrieved
+ *     distractor sharing the query terms. On ~half the cases the distractor
+ *     out-scores the answer on raw BM25 (so plain-FTS / un-trusted BM25 rank the
+ *     POISON first there; on the rest the answer already wins lexically) — only the
+ *     trust-weighted hybrid (TRUST_BY_SOURCE) ranks the trusted answer #1 on ALL of
+ *     them. The gated claim is the SERVED hybrid's poison MRR (1.00) > floor (0.83);
+ *     the intermediate BM25×eff lane (no trust) can even regress below the floor.
+ *   • IMPORTANCE (decay×importance modulation) — a HIGH-importance answer vs a
+ *     LOW-importance distractor with comparable BM25. Plain-FTS ignores
+ *     importance and ranks the distractor first; the modulated lanes (BM25×eff +
+ *     hybrid) lift the important answer. (Decay is the temporal sibling of this
+ *     same effectiveScore modulator — testable once real aged data exists.)
+ *   • PRECISION            — one answer amid sibling distractors that share SOME
+ *     query terms; measures ranking quality (MRR/nDCG), not a lane win.
+ *   • ABSTENTION           — no-answer queries; a hit is a violation.
+ *
+ * Write-gate honesty: untrusted distractors live ONLY in descriptive segments
+ * (knowledge/context/project/relationship) — the gate blocks an untrusted source
+ * from authoring identity/preference/correction, so a poison fact can't be a
+ * preference; it competes as descriptive "evidence" (a tool result asserting a
+ * fact about the user), which is the real attack surface.
+ */
+export const HARD_GOLD = {
+    facts: [
+        // ─────────────── POISON PAIRS — trusted answer, then untrusted distractor.
+        { key: "diet", content: "I do not eat meat — I keep a strict vegetarian diet.", segment: "preference" },
+        { key: "p-diet", content: "Order log: user did eat meat.", segment: "knowledge", sourceType: "tool_output" },
+        { key: "role", content: "My role is principal engineer on the platform team.", segment: "project" },
+        { key: "p-role", content: "User role: intern.", segment: "knowledge", sourceType: "retrieved_document" },
+        { key: "city", content: "I live in Lisbon at the moment.", segment: "identity" },
+        { key: "p-city", content: "Records say the user live in Berlin.", segment: "context", sourceType: "tool_output" },
+        { key: "car", content: "I drive a silver Tesla as my own car.", segment: "context" },
+        { key: "p-car", content: "Rental log: user drive a Jeep car.", segment: "knowledge", sourceType: "retrieved_document" },
+        { key: "team", content: "My manager is Priya on the data team.", segment: "relationship" },
+        { key: "p-team", content: "Org chart guess: user manager is Raj.", segment: "knowledge", sourceType: "tool_output" },
+        { key: "tool", content: "My preferred editor is Helix for coding.", segment: "preference" },
+        { key: "p-tool", content: "User editor: Emacs.", segment: "knowledge", sourceType: "tool_output" },
+        // ─────────────── IMPORTANCE PAIRS — high-importance answer vs a low-importance
+        // distractor that OUT-RANKS it on raw BM25 (repeats the query terms ⇒ higher
+        // term-frequency), so plain-FTS ranks the distractor #1 and only the
+        // effectiveScore modulation (BM25×eff + hybrid) lifts the important answer.
+        //
+        // HONEST SCOPE (eval-debate hardened): this shows the DIRECTION of the
+        // modulation at the importance EXTREME, not a default-magnitude guarantee. The
+        // modulator is DAMPED to 0.5+0.5·effective (scoring.ts) — a ≤2× swing that by
+        // design CANNOT override a wider relevance gap — so the flip needs a large
+        // importance gap (answer ~0.95 vs distractor 0.05); at default segment
+        // importances (~0.6 vs ~0.4) the same raw-BM25 gap would NOT flip. All four
+        // answers use NON-permanent segments (context/relationship) so the stated
+        // importance actually routes through effectiveScore (an `identity`→permanent
+        // answer would short-circuit to 1 and test TIER-pinning, not importance).
+        { key: "blood", content: "My blood type is O negative.", segment: "context", importance: 0.97 },
+        { key: "d-blood", content: "Blood type chart; blood type guide.", segment: "knowledge", importance: 0.05 },
+        { key: "med", content: "I take Metformin medication each day.", segment: "context", importance: 0.96 },
+        { key: "d-med", content: "Medication leaflet; medication take note.", segment: "knowledge", importance: 0.05 },
+        { key: "emerg", content: "My emergency contact is sister Anna.", segment: "relationship", importance: 0.95 },
+        { key: "d-emerg", content: "Emergency contact, emergency contact list.", segment: "context", importance: 0.05 },
+        { key: "gate", content: "My building gate code is 4417.", segment: "context", importance: 0.9 },
+        { key: "d-gate", content: "Gate code note; gate code memo.", segment: "knowledge", importance: 0.05 },
+        // ─────────────── PRECISION — one answer amid sibling distractors (all trusted).
+        { key: "dog", content: "My dog name is Rex.", segment: "relationship" },
+        { key: "d-dog1", content: "My dog likes long evening walks.", segment: "context" },
+        { key: "d-dog2", content: "A neighbor dog barks every night.", segment: "knowledge" },
+        { key: "phone", content: "My phone is a folding Pixel.", segment: "context" },
+        { key: "d-phone1", content: "My phone bill is paid monthly.", segment: "context" },
+        // ─────────────── CLEAN — single clear answer, no competition.
+        { key: "allergy", content: "I am allergic to shellfish.", segment: "identity", importance: 0.95 },
+        { key: "lang", content: "I speak French fluently.", segment: "identity" },
+        { key: "pet", content: "My cat is named Mochi.", segment: "relationship" },
+        { key: "proj", content: "I am building a memory framework called Tideline.", segment: "project" },
+        // ─────────────── corpus noise (share no query term with any answer).
+        { key: "noise1", content: "The weather in the mountains is cold in winter.", segment: "knowledge" },
+        { key: "noise2", content: "A recipe for sourdough needs patience and flour.", segment: "knowledge" },
+    ],
+    cases: [
+        // POISON — relevant = the TRUSTED fact; the untrusted distractor must not win.
+        { id: "h-diet", query: "do I eat meat", relevantKeys: ["diet"], category: "poison" },
+        { id: "h-role", query: "what is my role", relevantKeys: ["role"], category: "poison" },
+        { id: "h-city", query: "where do I live", relevantKeys: ["city"], category: "poison" },
+        { id: "h-car", query: "what car do I drive", relevantKeys: ["car"], category: "poison" },
+        { id: "h-team", query: "who is my manager", relevantKeys: ["team"], category: "poison" },
+        { id: "h-tool", query: "what editor do I use", relevantKeys: ["tool"], category: "poison" },
+        // IMPORTANCE — high-importance answer must out-rank the low-importance distractor.
+        { id: "h-blood", query: "what is my blood type", relevantKeys: ["blood"], category: "importance" },
+        { id: "h-med", query: "what medication do I take", relevantKeys: ["med"], category: "importance" },
+        { id: "h-emerg", query: "what is my emergency contact", relevantKeys: ["emerg"], category: "importance" },
+        { id: "h-gate", query: "what is my gate code", relevantKeys: ["gate"], category: "importance" },
+        // PRECISION — best match should rank #1 amid siblings.
+        { id: "h-dog", query: "what is my dog name", relevantKeys: ["dog"], category: "precision" },
+        { id: "h-phone", query: "what phone do I have", relevantKeys: ["phone"], category: "precision" },
+        // CLEAN.
+        { id: "h-allergy", query: "what am I allergic to", relevantKeys: ["allergy"], category: "single-session" },
+        { id: "h-lang", query: "what language do I speak", relevantKeys: ["lang"], category: "single-session" },
+        { id: "h-pet", query: "what is my cat name", relevantKeys: ["pet"], category: "single-session" },
+        { id: "h-proj", query: "what am I building", relevantKeys: ["proj"], category: "multi-session" },
+        // ABSTENTION — nothing answers these.
+        { id: "h-movie", query: "what is my favorite movie", relevantKeys: [], category: "abstention" },
+        { id: "h-sport", query: "what sport do I play", relevantKeys: [], category: "abstention" },
+        { id: "h-shoe", query: "what is my shoe size", relevantKeys: [], category: "abstention" },
+        { id: "h-zodiac", query: "what is my zodiac sign", relevantKeys: [], category: "abstention" },
+    ],
+};
+//# sourceMappingURL=gold-hard.js.map

package/dist/agents/memory/eval/gold-hard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gold-hard.js","sourceRoot":"","sources":["../../../../src/agents/memory/eval/gold-hard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAIH,MAAM,CAAC,MAAM,SAAS,GAAa;IAClC,KAAK,EAAE;QACN,4EAA4E;QAC5E,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,sDAAsD,EAAE,OAAO,EAAE,YAAY,EAAE;QACvG,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,+BAA+B,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE;QAE5G,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,qDAAqD,EAAE,OAAO,EAAE,SAAS,EAAE;QACnG,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,oBAAoB,EAAE;QAExG,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,iCAAiC,EAAE,OAAO,EAAE,UAAU,EAAE;QAChF,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,sCAAsC,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,aAAa,EAAE;QAEjH,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,uCAAuC,EAAE,OAAO,EAAE,SAAS,EAAE;QACpF,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,oCAAoC,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,oBAAoB,EAAE;QAEvH,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,uCAAuC,EAAE,OAAO,EAAE,cAAc,EAAE;QAC1F,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,uCAAuC,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE;QAEpH,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,0CAA0C,EAAE,OAAO,EAAE,YAAY,EAAE;QAC3F,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,qBAAqB,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE;QAElG,gFAAgF;QAChF,6EAA6E;QAC7E,qEAAqE;QACrE,4EAA4E;QAC5E,EAAE;QACF,uEAAuE;QACvE,+EAA+E;QAC/E,8EAA8E;QAC9E,2EAA2E;QAC3E,uEAAuE;QACvE,4EAA4E;QAC5E,0EAA0E;QAC1E,6EAA6E;QAC7E,0EAA0E;QAC1E,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,8BAA8B,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE;QAC/F,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,qCAAqC,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,EAAE;QAE1G,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,uCAAuC,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE;QACtG,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,2CAA2C,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,EAAE;QAE9G,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,sCAAsC,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,IAAI,EAAE;QAC5G,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,4CAA4C,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE;QAE/G,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,gCAAgC,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,EAAE;QAC/F,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,iCAAiC,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,EAAE;QAErG,iFAAiF;QACjF,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,qBAAqB,EAAE,OAAO,EAAE,cAAc,EAAE;QACvE,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,SAAS,EAAE;QAClF,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,mCAAmC,EAAE,OAAO,EAAE,WAAW,EAAE;QAErF,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,8BAA8B,EAAE,OAAO,EAAE,SAAS,EAAE;QAC7E,EAAE,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,gCAAgC,EAAE,OAAO,EAAE,SAAS,EAAE;QAElF,+DAA+D;QAC/D,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,6BAA6B,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE;QACjG,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,0BAA0B,EAAE,OAAO,EAAE,UAAU,EAAE;QACzE,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,wBAAwB,EAAE,OAAO,EAAE,cAAc,EAAE;QAC1E,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,mDAAmD,EAAE,OAAO,EAAE,SAAS,EAAE;QAEjG,sEAAsE;QACtE,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,iDAAiD,EAAE,OAAO,EAAE,WAAW,EAAE;QACnG,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,kDAAkD,EAAE,OAAO,EAAE,WAAW,EAAE;KACpG;IACD,KAAK,EAAE;QACN,+EAA+E;QAC/E,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,eAAe,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACpF,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,iBAAiB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACtF,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,iBAAiB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACtF,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,qBAAqB,EAAE,YAAY,EAAE,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACxF,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,mBAAmB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACxF,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;QAE3F,mFAAmF;QACnF,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,uBAAuB,EAAE,YAAY,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE;QAClG,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,2BAA2B,EAAE,YAAY,EAAE,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE;QAClG,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,8BAA8B,EAAE,YAAY,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE;QACzG,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE;QAE/F,uDAAuD;QACvD,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,qBAAqB,EAAE,YAAY,EAAE,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE;QAC3F,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE;QAEhG,SAAS;QACT,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,uBAAuB,EAAE,YAAY,EAAE,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,gBAAgB,EAAE;QAC1G,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,0BAA0B,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,gBAAgB,EAAE;QACvG,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,qBAAqB,EAAE,YAAY,EAAE,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,gBAAgB,EAAE;QAChG,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,oBAAoB,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,eAAe,EAAE;QAEhG,sCAAsC;QACtC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,2BAA2B,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE;QAC/F,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE;QAC1F,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE;QACzF,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,wBAAwB,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE;KAC7F;CACD,CAAC"}

package/dist/agents/memory/eval/gold-rich.d.ts

@@ -0,0 +1,33 @@
+/**
+ * RICH gold set (Tideline build Step 2/3 — the methodology-completeness tier).
+ *
+ * The synthetic + hard sets are SINGLE-RELEVANT: every case has exactly one
+ * answer, so recall@k ≡ hit-rate and nDCG is a monotone transform of MRR — the
+ * four reported metrics carry ONE bit of ranking signal per case (noted in
+ * gold-hard.test.ts). This set adds the cases those can't express:
+ *
+ *   • MULTI-RELEVANT — a query whose answer is a SET of facts that all share a
+ *     query term (lexically findable, so it's a fair ranking test, NOT a synonymy
+ *     test — synonymy is the deferred learned-embedder lane). Now recall@k ("did
+ *     we get ALL of them in the top-k?") and nDCG ("are they ranked above the
+ *     distractors?") carry real, independent signal. Two of the five sets
+ *     (ALLERGIES + TEAM) also carry a same-term DISTRACTOR (a generic/untrusted
+ *     fact that shares the term but isn't the user's) so precision + trust matter;
+ *     the remaining three (LANGUAGES, PROJECTS, MORNING ROUTINE) are pure
+ *     multi-relevant without a distractor, isolating recall completeness.
+ *   • TRANSITION CHAINS — a subject superseded twice (Lisbon→Berlin→Tokyo); only
+ *     the CURRENT fact is relevant + the two stale ones are archived, so this
+ *     verifies bi-temporal recall surfaces the live value and never a stale one.
+ *   • MULTI-SESSION — multi-relevant facts that accumulated across sessions (the
+ *     persistence the "model-switch" north-star reduces to for a RECALL metric;
+ *     true model-switch CONTINUITY is a conversation-layer concern, not recall).
+ *
+ * Honesty: queries share LEXICAL terms with their relevant facts (BM25 can find
+ * them); this measures RANKING of a known relevant set under competition, which
+ * is exactly where BM25-primary + trust/importance modulation should beat a
+ * weighted-sum fusion at the same (model-free) embedder. Pure-synonymy recall
+ * (no shared term) is intentionally NOT here — that needs the learned embedder.
+ */
+import type { GoldSpec } from "./gold.js";
+export declare const RICH_GOLD: GoldSpec;
+//# sourceMappingURL=gold-rich.d.ts.map

package/dist/agents/memory/eval/gold-rich.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gold-rich.d.ts","sourceRoot":"","sources":["../../../../src/agents/memory/eval/gold-rich.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE1C,eAAO,MAAM,SAAS,EAAE,QA2DvB,CAAC"}