@spinabot/brigade 0.1.1 → 1.0.0

package/dist/agents/memory/graph.d.ts

@@ -0,0 +1,92 @@
+import { type Embedder } from "./embedder.js";
+import { type MemoryLink, type MemoryLinkKind } from "./links.js";
+import type { MemoryRecord } from "./records.js";
+/** Temporal-evolution edge kinds — a supersede/correction chain (a belief being
+ *  REPLACED over time). The walk and the dream follow these to trace how a belief
+ *  changed. NOTE: the typed taxonomy's `precedes`/`follows` are SEQUENCE relations
+ *  between two DISTINCT facts (e.g. event ordering), not belief-replacement chains, so
+ *  they are intentionally NOT here — a supersede chain and a sequence link have
+ *  different walk semantics. */
+export declare const TRANSITION_KINDS: readonly MemoryLinkKind[];
+export interface MemoryGraph {
+    readonly byId: Map<string, MemoryRecord>;
+    /** memoryId → outbound edges (explicit links[] ∪ mirrored supersedes[]). */
+    readonly out: Map<string, MemoryLink[]>;
+    /** memoryId → inbound edges (the backlinks). */
+    readonly in: Map<string, Array<{
+        from: string;
+        kind: MemoryLinkKind;
+    }>>;
+}
+/** Build the adjacency once over an (origin-filtered) record set. Edges that
+ *  point outside the set are dropped — the graph is closed over `records`. */
+export declare function buildGraph(records: readonly MemoryRecord[]): MemoryGraph;
+export interface NeighborOpts {
+    /** Restrict to these edge kinds (default: all). */
+    kinds?: readonly MemoryLinkKind[];
+    /** "out" = this fact's links, "in" = backlinks, "both" (default). */
+    direction?: "out" | "in" | "both";
+}
+/** 1-hop neighbour ids (deduped), optionally filtered by edge kind / direction. */
+export declare function neighbors(g: MemoryGraph, id: string, opts?: NeighborOpts): string[];
+export interface SpreadOpts {
+    /** Max hops from the seeds (default 2 — the step-20 cap). */
+    maxHops?: number;
+    /** Max neighbours expanded per node (degree cap, default 10). */
+    fanOut?: number;
+    /** Restrict traversal to these edge kinds. */
+    kinds?: readonly MemoryLinkKind[];
+}
+/** Bounded breadth-first spread from `seedIds` → Map<id, minHops> (seeds = hop 0).
+ *  The substrate the step-20 recall walk activates over; capped by maxHops AND a
+ *  per-node fan-out so a hub node can't explode the frontier. */
+export declare function spread(g: MemoryGraph, seedIds: readonly string[], opts?: SpreadOpts): Map<string, number>;
+export interface ResolvedEntity {
+    /** Canonical surface form (e.g. "Bangalore", "Project Atlas"). */
+    name: string;
+    /** memoryIds of the facts that mention it (distinct). */
+    mentions: string[];
+}
+/** Model-free entity resolution: recurring proper-noun spans mentioned in
+ *  ≥ `minMentions` DISTINCT facts. Heuristic (no NER model); the frequency
+ *  threshold + stopword list keep "User"/"I"/sentence-starts out. Case-folded
+ *  for clustering, surfaced in its most common original casing.
+ *
+ *  STATUS (Step 19): the companion to the now-wired synonymy `relates` links (see
+ *  {@link synonymyEdges} + `FactStore.linkRelated`, persisted by the dream pass).
+ *  This RESOLVER primitive is complete + tested; the entity-NOTE PROMOTION pass
+ *  that consumes it (mint a hub note per resolved entity + `relates`-link its
+ *  mentions) is the remaining unwired half — kept ready + tested, not dead code. */
+export declare function resolveEntities(records: readonly MemoryRecord[], opts?: {
+    minMentions?: number;
+}): ResolvedEntity[];
+export interface SynonymyEdge {
+    from: string;
+    to: string;
+    sim: number;
+}
+/** Synonymy/relatedness pairs over the embedding space: every DISTINCT pair of
+ *  facts with cosine ≥ `threshold` (default 0.8). Uses each record's stored
+ *  `embedding` when present, else embeds its content via the default embedder.
+ *  Returns undirected pairs (from < to by id). The dream uses these BOTH as a
+ *  consolidation signal (merging near-duplicates above the merge bar) AND — for
+ *  related-but-not-merged pairs at/above the relatedness threshold — PERSISTS them as
+ *  `relates` links via `FactStore.linkRelated` (Step 19), so the graph-recall walk
+ *  can traverse them. Persistence is per-origin (the dream buckets by origin first).
+ *
+ *  O(n²) GUARD: the comparison is strict all-pairs, so it explodes as a store
+ *  grows. The nightly consolidation caller (dream.ts) buckets the WHOLE active
+ *  store by origin and passes each whole bucket here — origin-filtering scopes
+ *  the set but does NOT size-bound it (the owner bucket grows without limit). So
+ *  when `records.length` exceeds `maxRecords` (default 500) we restrict the
+ *  pairwise scan to the `maxRecords` most-recently-active facts (by
+ *  `lastAccessedAt`, then `createdAt`, then id — deterministic, no clock/random),
+ *  bounding both the embed work and the O(n²) loop. Pass `maxRecords` to widen/
+ *  narrow it; the high consolidate threshold means it caps the comparison COUNT,
+ *  not the (tiny) output. */
+export declare function synonymyEdges(records: readonly MemoryRecord[], opts?: {
+    threshold?: number;
+    embedder?: Embedder;
+    maxRecords?: number;
+}): SynonymyEdge[];
+//# sourceMappingURL=graph.d.ts.map

package/dist/agents/memory/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/graph.ts"],"names":[],"mappings":"AAkBA,OAAO,EAA8B,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC1E,OAAO,EAAa,KAAK,UAAU,EAAE,KAAK,cAAc,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD;;;;;gCAKgC;AAChC,eAAO,MAAM,gBAAgB,EAAE,SAAS,cAAc,EAA6C,CAAC;AAEpG,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACzC,4EAA4E;IAC5E,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;IACxC,gDAAgD;IAChD,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC,CAAC;CACxE;AAED;8EAC8E;AAC9E,wBAAgB,UAAU,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,GAAG,WAAW,CAexE;AAED,MAAM,WAAW,YAAY;IAC5B,mDAAmD;IACnD,KAAK,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAClC,qEAAqE;IACrE,SAAS,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;CAClC;AAED,mFAAmF;AACnF,wBAAgB,SAAS,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAE,YAAiB,GAAG,MAAM,EAAE,CAYvF;AAED,MAAM,WAAW,UAAU;IAC1B,6DAA6D;IAC7D,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,iEAAiE;IACjE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,8CAA8C;IAC9C,KAAK,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;CAClC;AAED;;iEAEiE;AACjE,wBAAgB,MAAM,CACrB,CAAC,EAAE,WAAW,EACd,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,IAAI,GAAE,UAAe,GACnB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAyBrB;AAID,MAAM,WAAW,cAAc;IAC9B,kEAAkE;IAClE,IAAI,EAAE,MAAM,CAAC;IACb,yDAAyD;IACzD,QAAQ,EAAE,MAAM,EAAE,CAAC;CACnB;AA+CD;;;;;;;;;oFASoF;AACpF,wBAAgB,eAAe,CAC9B,OAAO,EAAE,SAAS,YAAY,EAAE,EAChC,IAAI,GAAE;IAAE,WAAW,CAAC,EAAE,MAAM,CAAA;CAAO,GACjC,cAAc,EAAE,CAiClB;AAID,MAAM,WAAW,YAAY;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;CACZ;AAED;;;;;;;;;;;;;;;;;;6BAkB6B;AAC7B,wBAAgB,aAAa,CAC5B,OAAO,EAAE,SAAS,YAAY,EAAE,EAChC,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACzE,YAAY,EAAE,CA6DhB"}

package/dist/agents/memory/graph.js

@@ -0,0 +1,266 @@
+// src/agents/memory/graph.ts
+//
+// Tideline Step 19 — the queryable memory graph + entity resolution.
+//
+// Turns a flat record set (links.ts substrate) into an adjacency structure you
+// can traverse (forward edges + backlinks), plus the two derivation passes the
+// graph-walk (step 20) and the dream (step 22) consume:
+//   • ENTITY RESOLUTION — recurring proper-noun spans → entity descriptors
+//     (model-free heuristic; a learned NER drops into the same shape later).
+//   • SYNONYMY edges — cosine ≥ threshold over the existing HRR embeddings.
+//
+// ORIGIN SAFETY: the graph is origin-AGNOSTIC because it never crosses origins —
+// the CALLER passes an already origin-filtered record set, and the graph only
+// ever references ids inside that set (dangling edges to facts outside the set
+// are dropped). So a per-origin recall builds a per-origin graph; nothing leaks.
+//
+// All sync, zero-dep, air-gapped (same discipline as the rest of Tideline).
+import { cosine, getDefaultEmbedder } from "./embedder.js";
+import { linksFrom } from "./links.js";
+/** Temporal-evolution edge kinds — a supersede/correction chain (a belief being
+ *  REPLACED over time). The walk and the dream follow these to trace how a belief
+ *  changed. NOTE: the typed taxonomy's `precedes`/`follows` are SEQUENCE relations
+ *  between two DISTINCT facts (e.g. event ordering), not belief-replacement chains, so
+ *  they are intentionally NOT here — a supersede chain and a sequence link have
+ *  different walk semantics. */
+export const TRANSITION_KINDS = ["supersedes", "transition", "corrects"];
+/** Build the adjacency once over an (origin-filtered) record set. Edges that
+ *  point outside the set are dropped — the graph is closed over `records`. */
+export function buildGraph(records) {
+    const byId = new Map();
+    for (const r of records)
+        byId.set(r.memoryId, r);
+    const out = new Map();
+    const inMap = new Map();
+    for (const r of records) {
+        const edges = linksFrom(r).filter((l) => byId.has(l.target) && l.target !== r.memoryId);
+        out.set(r.memoryId, edges);
+        for (const e of edges) {
+            const arr = inMap.get(e.target) ?? [];
+            arr.push({ from: r.memoryId, kind: e.kind });
+            inMap.set(e.target, arr);
+        }
+    }
+    return { byId, out, in: inMap };
+}
+/** 1-hop neighbour ids (deduped), optionally filtered by edge kind / direction. */
+export function neighbors(g, id, opts = {}) {
+    const dir = opts.direction ?? "both";
+    const kindOk = (k) => !opts.kinds || opts.kinds.includes(k);
+    const ids = new Set();
+    if (dir === "out" || dir === "both") {
+        for (const e of g.out.get(id) ?? [])
+            if (kindOk(e.kind))
+                ids.add(e.target);
+    }
+    if (dir === "in" || dir === "both") {
+        for (const e of g.in.get(id) ?? [])
+            if (kindOk(e.kind))
+                ids.add(e.from);
+    }
+    ids.delete(id);
+    return [...ids];
+}
+/** Bounded breadth-first spread from `seedIds` → Map<id, minHops> (seeds = hop 0).
+ *  The substrate the step-20 recall walk activates over; capped by maxHops AND a
+ *  per-node fan-out so a hub node can't explode the frontier. */
+export function spread(g, seedIds, opts = {}) {
+    const maxHops = opts.maxHops ?? 2;
+    const fanOut = opts.fanOut ?? 10;
+    const hops = new Map();
+    let frontier = [];
+    for (const s of seedIds) {
+        if (g.byId.has(s) && !hops.has(s)) {
+            hops.set(s, 0);
+            frontier.push(s);
+        }
+    }
+    for (let h = 1; h <= maxHops && frontier.length > 0; h++) {
+        const next = [];
+        for (const id of frontier) {
+            const nbrs = neighbors(g, id, opts.kinds ? { kinds: opts.kinds } : {}).slice(0, fanOut);
+            for (const n of nbrs) {
+                if (!hops.has(n)) {
+                    hops.set(n, h);
+                    next.push(n);
+                }
+            }
+        }
+        frontier = next;
+    }
+    return hops;
+}
+// Capitalised tokens that are almost never the entity we care about in a memory
+// fact ("User likes X", "I moved to Y"). Frequency alone wouldn't filter these —
+// they recur constantly — so they're excluded explicitly. Lower-cased compare.
+const ENTITY_STOPWORDS = new Set([
+    "the", "a", "an", "i", "i'm", "im", "my", "me", "you", "your", "we", "our",
+    "he", "she", "they", "it", "this", "that", "these", "those", "user", "owner",
+    "and", "or", "but", "so", "then", "when", "where", "why", "how", "what",
+    "his", "her", "their", "its", "is", "are", "was", "were", "to", "of", "in",
+    "on", "at", "for", "with", "by", "as", "if",
+]);
+/** A proper-noun span = a run of Capitalised words (each starts upper, rest not
+ *  all-caps acronym-only handled too). Strips trailing punctuation. */
+function extractSpans(content) {
+    const spans = [];
+    // Split on whitespace; build runs of capitalised tokens.
+    const tokens = content.split(/\s+/);
+    let run = [];
+    const flush = () => {
+        if (run.length > 0) {
+            const span = run.join(" ").replace(/[.,;:!?'")\]]+$/, "").replace(/^[("[]+/, "");
+            if (span.length > 1)
+                spans.push(span);
+            run = [];
+        }
+    };
+    for (const raw of tokens) {
+        // Strip surrounding punctuation AND a trailing possessive ('s / ’s) so
+        // "Sarah's" clusters with "Sarah" instead of forming a second entity.
+        const t = raw
+            .replace(/^[("[]+/, "")
+            .replace(/[.,;:!?'")\]]+$/, "")
+            .replace(/['’]s$/i, "")
+            .replace(/['’]$/, "");
+        const isCapitalised = /^[A-Z][A-Za-z0-9'-]*$/.test(t);
+        const isStop = ENTITY_STOPWORDS.has(t.toLowerCase());
+        if (isCapitalised && !isStop) {
+            run.push(t);
+        }
+        else {
+            flush();
+        }
+    }
+    flush();
+    return spans;
+}
+/** Model-free entity resolution: recurring proper-noun spans mentioned in
+ *  ≥ `minMentions` DISTINCT facts. Heuristic (no NER model); the frequency
+ *  threshold + stopword list keep "User"/"I"/sentence-starts out. Case-folded
+ *  for clustering, surfaced in its most common original casing.
+ *
+ *  STATUS (Step 19): the companion to the now-wired synonymy `relates` links (see
+ *  {@link synonymyEdges} + `FactStore.linkRelated`, persisted by the dream pass).
+ *  This RESOLVER primitive is complete + tested; the entity-NOTE PROMOTION pass
+ *  that consumes it (mint a hub note per resolved entity + `relates`-link its
+ *  mentions) is the remaining unwired half — kept ready + tested, not dead code. */
+export function resolveEntities(records, opts = {}) {
+    const minMentions = opts.minMentions ?? 2;
+    // key = lowercased span → { mentions:Set<memoryId>, forms:Map<surface,count> }
+    const acc = new Map();
+    for (const r of records) {
+        const seen = new Set(); // a fact mentioning an entity twice counts once
+        for (const span of extractSpans(r.content)) {
+            const key = span.toLowerCase();
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            const entry = acc.get(key) ?? { mentions: new Set(), forms: new Map() };
+            entry.mentions.add(r.memoryId);
+            entry.forms.set(span, (entry.forms.get(span) ?? 0) + 1);
+            acc.set(key, entry);
+        }
+    }
+    const out = [];
+    for (const entry of acc.values()) {
+        if (entry.mentions.size < minMentions)
+            continue;
+        // canonical = most common original casing
+        let name = "";
+        let best = -1;
+        for (const [form, n] of entry.forms) {
+            if (n > best) {
+                best = n;
+                name = form;
+            }
+        }
+        out.push({ name, mentions: [...entry.mentions] });
+    }
+    // Most-mentioned first (stable, deterministic — no Math.random/Date).
+    out.sort((a, b) => b.mentions.length - a.mentions.length || a.name.localeCompare(b.name));
+    return out;
+}
+/** Synonymy/relatedness pairs over the embedding space: every DISTINCT pair of
+ *  facts with cosine ≥ `threshold` (default 0.8). Uses each record's stored
+ *  `embedding` when present, else embeds its content via the default embedder.
+ *  Returns undirected pairs (from < to by id). The dream uses these BOTH as a
+ *  consolidation signal (merging near-duplicates above the merge bar) AND — for
+ *  related-but-not-merged pairs at/above the relatedness threshold — PERSISTS them as
+ *  `relates` links via `FactStore.linkRelated` (Step 19), so the graph-recall walk
+ *  can traverse them. Persistence is per-origin (the dream buckets by origin first).
+ *
+ *  O(n²) GUARD: the comparison is strict all-pairs, so it explodes as a store
+ *  grows. The nightly consolidation caller (dream.ts) buckets the WHOLE active
+ *  store by origin and passes each whole bucket here — origin-filtering scopes
+ *  the set but does NOT size-bound it (the owner bucket grows without limit). So
+ *  when `records.length` exceeds `maxRecords` (default 500) we restrict the
+ *  pairwise scan to the `maxRecords` most-recently-active facts (by
+ *  `lastAccessedAt`, then `createdAt`, then id — deterministic, no clock/random),
+ *  bounding both the embed work and the O(n²) loop. Pass `maxRecords` to widen/
+ *  narrow it; the high consolidate threshold means it caps the comparison COUNT,
+ *  not the (tiny) output. */
+export function synonymyEdges(records, opts = {}) {
+    const threshold = opts.threshold ?? 0.8;
+    const embedder = opts.embedder ?? getDefaultEmbedder();
+    const maxRecords = opts.maxRecords ?? 500;
+    // Above the cap, scan only the most-recently-active slice — newest beliefs are
+    // the consolidation-relevant ones, and this bounds the all-pairs cost on a
+    // store that grows unattended on the curator daemon. Copy before sorting so
+    // the caller's array is never mutated; ties break deterministically by id.
+    if (records.length > maxRecords) {
+        records = [...records]
+            .sort((a, b) => b.lastAccessedAt - a.lastAccessedAt ||
+            b.createdAt - a.createdAt ||
+            a.memoryId.localeCompare(b.memoryId))
+            .slice(0, maxRecords);
+    }
+    // Resolve a vector per record (stored embedding wins; else embed on the fly).
+    const needEmbed = records.filter((r) => !r.embedding || r.embedding.length === 0);
+    let fresh = [];
+    if (needEmbed.length > 0) {
+        const v = embedder.embed(needEmbed.map((r) => r.content));
+        // HRR/hash embedders are sync; the learned-model seam is async. Synonymy
+        // is a derivation pass (dream/consolidation), never the hot recall path,
+        // so a Promise here means "no precomputed vectors" → skip on-the-fly embed
+        // for the async case rather than block (those records just don't synonymy-
+        // link this pass; they will once their embedding is persisted on write).
+        if (!(v instanceof Promise))
+            fresh = v;
+    }
+    let fi = 0;
+    const vec = new Map();
+    for (const r of records) {
+        if (r.embedding && r.embedding.length > 0) {
+            vec.set(r.memoryId, r.embedding);
+        }
+        else {
+            const f = fresh[fi];
+            if (f) {
+                vec.set(r.memoryId, f);
+                fi++;
+            }
+        }
+    }
+    const out = [];
+    for (let i = 0; i < records.length; i++) {
+        const a = records[i];
+        const va = vec.get(a.memoryId);
+        if (!va)
+            continue;
+        for (let j = i + 1; j < records.length; j++) {
+            const b = records[j];
+            const vb = vec.get(b.memoryId);
+            if (!vb)
+                continue;
+            const sim = cosine(va, vb);
+            if (sim >= threshold) {
+                const [from, to] = a.memoryId < b.memoryId ? [a.memoryId, b.memoryId] : [b.memoryId, a.memoryId];
+                out.push({ from, to, sim });
+            }
+        }
+    }
+    out.sort((a, b) => b.sim - a.sim);
+    return out;
+}
+//# sourceMappingURL=graph.js.map

package/dist/agents/memory/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/agents/memory/graph.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,EAAE;AACF,qEAAqE;AACrE,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,wDAAwD;AACxD,2EAA2E;AAC3E,6EAA6E;AAC7E,4EAA4E;AAC5E,EAAE;AACF,iFAAiF;AACjF,8EAA8E;AAC9E,+EAA+E;AAC/E,iFAAiF;AACjF,EAAE;AACF,4EAA4E;AAE5E,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAiB,MAAM,eAAe,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAwC,MAAM,YAAY,CAAC;AAG7E;;;;;gCAKgC;AAChC,MAAM,CAAC,MAAM,gBAAgB,GAA8B,CAAC,YAAY,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;AAUpG;8EAC8E;AAC9E,MAAM,UAAU,UAAU,CAAC,OAAgC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyD,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;QACxF,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACtC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AASD,mFAAmF;AACnF,MAAM,UAAU,SAAS,CAAC,CAAc,EAAE,EAAU,EAAE,OAAqB,EAAE;IAC5E,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,CAAC,CAAiB,EAAW,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzE,CAAC;IACD,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACf,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AACjB,CAAC;AAWD;;iEAEiE;AACjE,MAAM,UAAU,MAAM,CACrB,CAAc,EACd,OAA0B,EAC1B,OAAmB,EAAE;IAErB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,IAAI,QAAQ,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACf,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACF,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACxF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC;YACF,CAAC;QACF,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAWD,gFAAgF;AAChF,iFAAiF;AACjF,+EAA+E;AAC/E,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAChC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;IAC1E,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAC5E,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACvE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IAC1E,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;CAC3C,CAAC,CAAC;AAEH;uEACuE;AACvE,SAAS,YAAY,CAAC,OAAe;IACpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,yDAAyD;IACzD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,GAAa,EAAE,CAAC;IACvB,MAAM,KAAK,GAAG,GAAS,EAAE;QACxB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YACjF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,GAAG,GAAG,EAAE,CAAC;QACV,CAAC;IACF,CAAC,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC1B,uEAAuE;QACvE,sEAAsE;QACtE,MAAM,CAAC,GAAG,GAAG;aACX,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC;aAC9B,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACvB,MAAM,aAAa,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACrD,IAAI,aAAa,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,CAAC;aAAM,CAAC;YACP,KAAK,EAAE,CAAC;QACT,CAAC;IACF,CAAC;IACD,KAAK,EAAE,CAAC;IACR,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;;;oFASoF;AACpF,MAAM,UAAU,eAAe,CAC9B,OAAgC,EAChC,OAAiC,EAAE;IAEnC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;IAC1C,+EAA+E;IAC/E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAiE,CAAC;IACrF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,gDAAgD;QAChF,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAU,EAAE,KAAK,EAAE,IAAI,GAAG,EAAkB,EAAE,CAAC;YAChG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC/B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IACD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,WAAW;YAAE,SAAS;QAChD,0CAA0C;QAC1C,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBACd,IAAI,GAAG,CAAC,CAAC;gBACT,IAAI,GAAG,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,sEAAsE;IACtE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1F,OAAO,GAAG,CAAC;AACZ,CAAC;AAUD;;;;;;;;;;;;;;;;;;6BAkB6B;AAC7B,MAAM,UAAU,aAAa,CAC5B,OAAgC,EAChC,OAAyE,EAAE;IAE3E,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,EAAE,CAAC;IACvD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAC1C,+EAA+E;IAC/E,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,IAAI,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;QACjC,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC;aACpB,IAAI,CACJ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACR,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc;YACnC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;YACzB,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CACrC;aACA,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACxB,CAAC;IACD,8EAA8E;IAC9E,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAClF,IAAI,KAAK,GAAe,EAAE,CAAC;IAC3B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1D,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,2EAA2E;QAC3E,yEAAyE;QACzE,IAAI,CAAC,CAAC,CAAC,YAAY,OAAO,CAAC;YAAE,KAAK,GAAG,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,GAAG,IAAI,GAAG,EAA6B,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACP,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBACvB,EAAE,EAAE,CAAC;YACN,CAAC;QACF,CAAC;IACF,CAAC;IACD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACtB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC/B,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACtB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC/B,IAAI,CAAC,EAAE;gBAAE,SAAS;YAClB,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3B,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACjG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC;QACF,CAAC;IACF,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/agents/memory/host-ports.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Memory host seams — the ONE swappable module.
+ *
+ * The Tideline core (`records.ts` / `FactStore`) needs four things it does not own:
+ *   1. a subsystem LOGGER,
+ *   2. the Convex write-through CACHE (convex storage mode only),
+ *   3. the runtime storage-MODE probe (filesystem vs convex),
+ *   4. a write-time content THREAT-SCAN (+ its error).
+ *
+ * Rather than have the core reach into Brigade's `../../` subsystems directly (which
+ * is what made it un-extractable), the core imports ALL of them from HERE. This file
+ * is Brigade's binding: it just forwards to the real host modules — PURE INDIRECTION,
+ * identical behavior, no wiring, no test changes.
+ *
+ * The decoupling: a standalone `brigade-tideline` publish swaps THIS one file for an
+ * fs-only variant (no-op logger, no Convex cache, runtime-mode = filesystem so the
+ * convex branches never fire, a vendored pure threat-scan). Every other memory module
+ * is already host-import-free, so the core reaches outside its own directory ONLY
+ * through this seam — making the standalone build a single-file swap, not a refactor.
+ * See `src/tideline/host-ports.standalone.ts` for the fs-only implementation + the
+ * package README's "packaging status" for the build swap.
+ */
+export { createSubsystemLogger } from "../../logging/subsystem-logger.js";
+export { tryGetRuntimeContext } from "../../storage/runtime-context.js";
+export { getCachedFacts, primeFactsCache, workspaceIdFromDir, writeThroughFactsCache } from "../../storage/facts-cache.js";
+export { MemoryThreatError, scanForThreats } from "../../security/injection-patterns.js";
+//# sourceMappingURL=host-ports.d.ts.map

package/dist/agents/memory/host-ports.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"host-ports.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/host-ports.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAGH,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAE1E,OAAO,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AAExE,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AAE3H,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC"}

package/dist/agents/memory/host-ports.js

@@ -0,0 +1,31 @@
+/**
+ * Memory host seams — the ONE swappable module.
+ *
+ * The Tideline core (`records.ts` / `FactStore`) needs four things it does not own:
+ *   1. a subsystem LOGGER,
+ *   2. the Convex write-through CACHE (convex storage mode only),
+ *   3. the runtime storage-MODE probe (filesystem vs convex),
+ *   4. a write-time content THREAT-SCAN (+ its error).
+ *
+ * Rather than have the core reach into Brigade's `../../` subsystems directly (which
+ * is what made it un-extractable), the core imports ALL of them from HERE. This file
+ * is Brigade's binding: it just forwards to the real host modules — PURE INDIRECTION,
+ * identical behavior, no wiring, no test changes.
+ *
+ * The decoupling: a standalone `brigade-tideline` publish swaps THIS one file for an
+ * fs-only variant (no-op logger, no Convex cache, runtime-mode = filesystem so the
+ * convex branches never fire, a vendored pure threat-scan). Every other memory module
+ * is already host-import-free, so the core reaches outside its own directory ONLY
+ * through this seam — making the standalone build a single-file swap, not a refactor.
+ * See `src/tideline/host-ports.standalone.ts` for the fs-only implementation + the
+ * package README's "packaging status" for the build swap.
+ */
+// 1. logger
+export { createSubsystemLogger } from "../../logging/subsystem-logger.js";
+// 2. + 3. runtime storage-mode probe (carries the convex store for write-through)
+export { tryGetRuntimeContext } from "../../storage/runtime-context.js";
+// 3. convex write-through cache (all sync; only exercised in convex mode)
+export { getCachedFacts, primeFactsCache, workspaceIdFromDir, writeThroughFactsCache } from "../../storage/facts-cache.js";
+// 4. write-time content threat-scan + its error
+export { MemoryThreatError, scanForThreats } from "../../security/injection-patterns.js";
+//# sourceMappingURL=host-ports.js.map

package/dist/agents/memory/host-ports.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"host-ports.js","sourceRoot":"","sources":["../../../src/agents/memory/host-ports.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,YAAY;AACZ,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,kFAAkF;AAClF,OAAO,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AACxE,0EAA0E;AAC1E,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AAC3H,gDAAgD;AAChD,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC"}

package/dist/agents/memory/hybrid.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Multi-signal recall fusion (Tideline v2) — the best MODEL-FREE recall we can
+ * do. Learned embeddings are NOT mandatory here: the (zero-dep, air-gap) HRR
+ * vector is just ONE signal, not the star. Robust recall comes from COMBINING a
+ * lexical workhorse with a fuzzy recovery lane:
+ *
+ *   WORKHORSE: BM25 × trust × decay (the v1 scorer) — exact lexical relevance,
+ *   down-weighted by provenance/confidence, faded by Ebbinghaus decay. Its hits
+ *   keep BM25's order, so fusion does NO HARM where lexical is already right.
+ *   RECOVERY: ONE vector-cosine lane over the {@link Embedder} seam, used ONLY to
+ *   surface facts BM25 MISSED entirely (appended BELOW every lexical hit, never
+ *   reordering them). With the bundled zero-dep HRR embedder (a bag-of-words
+ *   model) this lane is deliberately conservative — the `minSim` floor rejects
+ *   function-word noise, so model-free it rarely adds over BM25. Drop a LEARNED
+ *   embedder into the seam and the SAME lane does true synonymy recovery; that's
+ *   where it earns its keep. (A token-set Jaccard lane was removed: any shared
+ *   token already forces a BM25 hit, so it could never surface a miss — dead code.)
+ *   MODULATION (relevance × trust × decay): × trust(provenance × confidence) ×
+ *     effectiveScore(decay + importance) — applied to BOTH lanes.
+ *   DIVERSITY: MMR rerank — opt-in (λ<1) for context-block assembly;
+ *     OFF by default (λ=1) so single-fact recall isn't diversified.
+ *
+ * Origin isolation is the caller's job (pass active + origin-filtered candidates),
+ * same contract as `bm25Score`.
+ */
+import { type Embedder } from "./embedder.js";
+import type { MemoryRecord } from "./records.js";
+export interface HybridScored {
+    record: MemoryRecord;
+    /** Final fused + modulated score (higher = better). */
+    score: number;
+    lexRank?: number;
+    vecRank?: number;
+}
+export declare function recallHybrid(candidates: readonly MemoryRecord[], query: string, embedder: Embedder, now?: number, opts?: {
+    limit?: number;
+    minSim?: number;
+    mmrLambda?: number;
+}): HybridScored[];
+/** Async variant for a model-backed embedder: pre-embed the query once. */
+export declare function recallHybridAsync(candidates: readonly MemoryRecord[], query: string, embedder: Embedder, now?: number, opts?: {
+    limit?: number;
+    minSim?: number;
+    mmrLambda?: number;
+}): Promise<HybridScored[]>;
+//# sourceMappingURL=hybrid.d.ts.map

package/dist/agents/memory/hybrid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/hybrid.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,EAAU,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,YAAY,EAAoB,MAAM,cAAc,CAAC;AAwCnE,MAAM,WAAW,YAAY;IAC5B,MAAM,EAAE,YAAY,CAAC;IACrB,uDAAuD;IACvD,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,YAAY,CAC3B,UAAU,EAAE,SAAS,YAAY,EAAE,EACnC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,QAAQ,EAClB,GAAG,GAAE,MAAmB,EACxB,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAChE,YAAY,EAAE,CA8DhB;AA8CD,2EAA2E;AAC3E,wBAAsB,iBAAiB,CACtC,UAAU,EAAE,SAAS,YAAY,EAAE,EACnC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,QAAQ,EAClB,GAAG,GAAE,MAAmB,EACxB,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAChE,OAAO,CAAC,YAAY,EAAE,CAAC,CAazB"}