@spinabot/brigade 0.1.2 → 1.0.1

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

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/scoring.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAqBjD;;;;;;;;;;;GAWG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAK/C;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,cAAc;IAC9B,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb,qEAAqE;IACrE,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,oDAAoD;IACpD,KAAK,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,YAAY;IAC5B,MAAM,EAAE,YAAY,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,SAAS,CAAC,EAAE,cAAc,CAAC;CAC3B;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY,EAAE,CAiB/F;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CACxB,OAAO,EAAE,SAAS,YAAY,EAAE,EAChC,KAAK,EAAE,MAAM,EACb,GAAG,GAAE,MAAmB,EACxB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;CAAO,GACpD,YAAY,EAAE,CAkDhB"}

package/dist/agents/memory/scoring.js

@@ -0,0 +1,139 @@
+/**
+ * Tideline v1 recall scoring (build Step 8) — the SHARED lexical scorer.
+ *
+ * ONE pure scorer, run identically in BOTH modes — over the fs `FactStore`'s
+ * records OR the convex hydrated cache — so recall ranking is **cross-mode
+ * parity by construction** (the 0.2 lock). We use an IN-APP BM25 rather than
+ * `node:sqlite` FTS5 deliberately: the SAME code must rank in both modes, and
+ * sqlite-fs + in-app-convex would be two different rankers, breaking
+ * by-construction parity. `node:sqlite` FTS5 stays a deferred fs-side SCALE
+ * optimization — at single-user scale a full in-app pass is microseconds.
+ *
+ * `bm25Score` = Okapi BM25 (k1, b) over tokenized content, MODULATED by a
+ * damped `effectiveScore` (`0.5 + 0.5 * effectiveScore`) so recency/importance
+ * shape the ranking without overriding a >2× relevance gap. `linearScanScore`
+ * is the OLD crude term-overlap, kept as the
+ * explicit linear-floor BASELINE. Both take records the CALLER has already
+ * filtered to active + origin-matching — origin isolation is enforced upstream
+ * (records.ts / capabilities.ts), never bypassed here.
+ */
+import { effectiveScore } from "./decay.js";
+/** Okapi BM25 term-frequency saturation + length-normalisation params. */
+const K1 = 1.2;
+const B = 0.75;
+/**
+ * Conservative English stopword set — function words that carry no recall
+ * signal but, unfiltered, make EVERY fact containing "I"/"the"/"is" match every
+ * query (over-retrieval), and make abstention impossible. Deliberately NARROW:
+ * articles, pronouns, to-be/have/do auxiliaries, prepositions, and question
+ * scaffolding only — NO content words and NO negations ("no"/"not" kept, since
+ * a bag-of-words scorer mis-handling negation is worse than keeping it).
+ */
+const STOPWORDS = new Set([
+    "a", "an", "and", "are", "as", "at", "be", "by", "did", "do", "does", "for",
+    "from", "had", "has", "have", "how", "i", "in", "is", "it", "its", "me", "my",
+    "of", "on", "or", "that", "the", "this", "to", "was", "what", "when", "where",
+    "which", "who", "will", "with", "you", "your",
+]);
+/**
+ * Lowercase Unicode word tokens (shared by docs + queries), minus stopwords.
+ * Splits on any run of non-word characters via the Unicode letter/number
+ * classes (`\p{L}\p{N}`) rather than an ASCII-only `[a-z0-9]` class, so
+ * non-Latin scripts (CJK, Cyrillic, Greek, Arabic, Hebrew, …) tokenize instead
+ * of being silently discarded — an ASCII-only delimiter class made non-Latin
+ * facts unrecallable (empty token list → no BM25 match). The stopword set stays
+ * intentionally ASCII-only (non-Latin tokens simply aren't members). Note: a
+ * space-less script (e.g. CJK) yields one whole-run token, so it matches by
+ * exact phrase rather than per-word — partial-substring matching would need a
+ * dedicated n-gram path.
+ */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^\p{L}\p{N}]+/u)
+        .filter((t) => t.length > 0 && !STOPWORDS.has(t));
+}
+/**
+ * OLD term-overlap (distinct matched query terms / query length) — the
+ * explicit linear-scan FLOOR. Records must be pre-filtered (active + origin).
+ * Ties broken by importance then recency, matching the pre-BM25 ordering.
+ */
+export function linearScanScore(records, query) {
+    const terms = [...new Set(tokenize(query))];
+    if (terms.length === 0)
+        return [];
+    const out = [];
+    for (const r of records) {
+        const hay = r.content.toLowerCase();
+        const matched = terms.filter((t) => hay.includes(t)).length;
+        if (matched === 0)
+            continue;
+        out.push({ record: r, score: matched / terms.length });
+    }
+    out.sort((a, b) => b.score - a.score ||
+        b.record.importance - a.record.importance ||
+        b.record.createdAt - a.record.createdAt);
+    return out;
+}
+/**
+ * Okapi BM25 over the records' content, MODULATED by a damped `effectiveScore`
+ * (decay + importance) — relevance dominates, recency/importance shapes ties.
+ * Records must be pre-filtered (active + origin). IDF is computed over the
+ * given set; records matching no query term are dropped. Ranked descending.
+ */
+export function bm25Score(records, query, now = Date.now(), opts = {}) {
+    const qterms = [...new Set(tokenize(query))];
+    if (qterms.length === 0 || records.length === 0)
+        return [];
+    const docs = records.map((r) => ({ record: r, tokens: tokenize(r.content) }));
+    const N = docs.length;
+    const avgLen = Math.max(1, docs.reduce((s, d) => s + d.tokens.length, 0) / N);
+    // Document frequency + idf per query term (+1 form → never negative).
+    const idf = new Map();
+    for (const t of qterms) {
+        let n = 0;
+        for (const d of docs)
+            if (d.tokens.includes(t))
+                n += 1;
+        idf.set(t, Math.log(1 + (N - n + 0.5) / (n + 0.5)));
+    }
+    const out = [];
+    for (const d of docs) {
+        const len = d.tokens.length;
+        const tf = new Map();
+        for (const tok of d.tokens)
+            if (idf.has(tok))
+                tf.set(tok, (tf.get(tok) ?? 0) + 1);
+        let bm = 0;
+        const matched = [];
+        for (const t of qterms) {
+            const f = tf.get(t) ?? 0;
+            if (f === 0)
+                continue;
+            matched.push(t);
+            const denom = f + K1 * (1 - B + (B * len) / avgLen);
+            bm += (idf.get(t) ?? 0) * ((f * (K1 + 1)) / denom);
+        }
+        if (bm <= 0)
+            continue;
+        // Relevance (BM25) dominates; effectiveScore (decay + importance) MODULATES
+        // within ±50% — every record keeps at least half its raw BM25, so the
+        // modulator can shift ranking by at most 2x (modulator ∈ [0.5, 1]) and CANNOT
+        // override a relevance gap wider than 2x. (A
+        // pure multiplier let importance override relevance and cost recall — the
+        // eval harness caught it; damping is the relevance-first fix.)
+        const effective = effectiveScore(d.record, now);
+        // `modulate: false` = pure BM25 (the plain-lexical FTS baseline, Step 3);
+        // the default folds in the damped decay/importance modulator.
+        const modulator = opts.modulate === false ? 1 : 0.5 + 0.5 * effective;
+        const score = bm * modulator;
+        const scored = { record: d.record, score };
+        if (opts.breakdown) {
+            scored.breakdown = { bm25: bm, matchedTerms: matched, effective, modulator, score };
+        }
+        out.push(scored);
+    }
+    out.sort((a, b) => b.score - a.score || b.record.createdAt - a.record.createdAt);
+    return out;
+}
+//# sourceMappingURL=scoring.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../../src/agents/memory/scoring.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAG5C,0EAA0E;AAC1E,MAAM,EAAE,GAAG,GAAG,CAAC;AACf,MAAM,CAAC,GAAG,IAAI,CAAC;AAEf;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK;IAC3E,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;IAC7E,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IAC7E,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;CAC7C,CAAC,CAAC;AAEH;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACpC,OAAO,IAAI;SACT,WAAW,EAAE;SACb,KAAK,CAAC,iBAAiB,CAAC;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAuCD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAgC,EAAE,KAAa;IAC9E,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC5D,IAAI,OAAO,KAAK,CAAC;YAAE,SAAS;QAC5B,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,GAAG,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACR,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;QACjB,CAAC,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,UAAU;QACzC,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,CACxC,CAAC;IACF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CACxB,OAAgC,EAChC,KAAa,EACb,MAAc,IAAI,CAAC,GAAG,EAAE,EACxB,OAAoD,EAAE;IAEtD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE3D,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE9E,sEAAsE;IACtE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,CAAC,IAAI,CAAC,CAAC;QACvD,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;YAAE,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClF,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;YACpD,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,EAAE,IAAI,CAAC;YAAE,SAAS;QACtB,4EAA4E;QAC5E,sEAAsE;QACtE,8EAA8E;QAC9E,6CAA6C;QAC7C,0EAA0E;QAC1E,+DAA+D;QAC/D,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAChD,0EAA0E;QAC1E,8DAA8D;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;QACtE,MAAM,KAAK,GAAG,EAAE,GAAG,SAAS,CAAC;QAC7B,MAAM,MAAM,GAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;QACzD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,CAAC,SAAS,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QACrF,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClB,CAAC;IACD,GAAG,CAAC,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;IACjF,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/agents/memory/self-improve.d.ts

@@ -0,0 +1,56 @@
+import type { MemoryEvent } from "./event-log.js";
+export type ProposalStatus = "pending" | "approved" | "rejected" | "applied" | "reverted";
+export interface ProposalDiff {
+    /** What kind of behaviour this changes. */
+    kind: "preference" | "skill" | "prompt";
+    /** The thing being changed (a memoryId, skill name, prompt key…). */
+    target: string;
+    before: string;
+    after: string;
+}
+export interface Proposal {
+    id: string;
+    rationale: string;
+    diff: ProposalDiff;
+    /** Held-out eval delta (set by `gateOnEval`); positive = improvement. */
+    evalDelta?: number;
+    status: ProposalStatus;
+    /** Captured at apply time so the change is reversible. */
+    prior?: unknown;
+}
+export interface ProposeOpts {
+    /** Down-votes on a fact before a retraction is proposed. Default 3. */
+    minDownvotes?: number;
+    /** Targets that can NEVER be proposed against (safety constraints, read-only). */
+    safetyConstraints?: ReadonlySet<string>;
+}
+/**
+ * Deterministic proposer: a fact down-voted ≥ `minDownvotes` times in the
+ * telemetry is proposed for retraction. Safety-constrained targets are skipped.
+ * Stable order (by target) — no clock/random.
+ */
+export declare function proposeFromTelemetry(events: readonly MemoryEvent[], opts?: ProposeOpts): Proposal[];
+/** Record a held-out eval delta on a proposal (the gate the human reads before
+ *  approving). Pure — returns a new proposal; never auto-approves. */
+export declare function gateOnEval(p: Proposal, evalDelta: number): Proposal;
+/** The human gate. Approve a PENDING proposal (throws otherwise). */
+export declare function approve(p: Proposal): Proposal;
+/** Reject a pending proposal. */
+export declare function reject(p: Proposal): Proposal;
+/**
+ * Apply an APPROVED proposal, reversibly. `doApply` performs the actual change
+ * and RETURNS the prior state (captured on the proposal for rollback). REFUSES
+ * to apply anything not explicitly approved — that refusal is the Lane-B
+ * guarantee, not a convention. Also refuses a safety-constrained target.
+ * Pass `appliedLedger` (a shared `Set<string>`) to enforce apply-once across
+ * proposal copies (status alone is bypassable if a caller holds a pre-apply ref).
+ * NOTE: `evalDelta` (set by `gateOnEval`) is informational — it is NOT enforced
+ * here; the human reads it and decides whether to call `approve`.
+ */
+export declare function applyProposal(p: Proposal, doApply: (diff: ProposalDiff) => unknown, opts?: {
+    safetyConstraints?: ReadonlySet<string>;
+    appliedLedger?: Set<string>;
+}): Proposal;
+/** Roll back an APPLIED proposal. `doRevert` restores the captured prior state. */
+export declare function revertProposal(p: Proposal, doRevert: (prior: unknown) => void): Proposal;
+//# sourceMappingURL=self-improve.d.ts.map

package/dist/agents/memory/self-improve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-improve.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/self-improve.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAElD,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;AAE1F,MAAM,WAAW,YAAY;IAC5B,2CAA2C;IAC3C,IAAI,EAAE,YAAY,GAAG,OAAO,GAAG,QAAQ,CAAC;IACxC,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,YAAY,CAAC;IACnB,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,cAAc,CAAC;IACvB,0DAA0D;IAC1D,KAAK,CAAC,EAAE,OAAO,CAAC;CAChB;AAED,MAAM,WAAW,WAAW;IAC3B,uEAAuE;IACvE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACxC;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,EAAE,IAAI,GAAE,WAAgB,GAAG,QAAQ,EAAE,CAkBvG;AAED;sEACsE;AACtE,wBAAgB,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,QAAQ,CAEnE;AAED,qEAAqE;AACrE,wBAAgB,OAAO,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAG7C;AAED,iCAAiC;AACjC,wBAAgB,MAAM,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAG5C;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAC5B,CAAC,EAAE,QAAQ,EACX,OAAO,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,EACxC,IAAI,GAAE;IAAE,iBAAiB,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAAC,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;CAAO,GACjF,QAAQ,CAgBV;AAED,mFAAmF;AACnF,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,GAAG,QAAQ,CAOxF"}

package/dist/agents/memory/self-improve.js

@@ -0,0 +1,98 @@
+// src/agents/memory/self-improve.ts
+//
+// Tideline Step 25 — self-improvement, Lane B (human-gated, reversible).
+//
+// Lane A (the dream) lets FACTS auto-evolve. Lane B is the BEHAVIOUR lane and is
+// deliberately NOT autonomous: telemetry (the memory feedback/event log) →
+// PROPOSE a change (the reviewer diff) → optional held-out EVAL gate → a human
+// APPROVES → REVERSIBLE apply → REVERT if it regresses. The whole point is that
+// no behaviour change ever ships without an explicit human approval, and every
+// applied change can be rolled back.
+//
+// SAFETY: a configurable read-only set (safety constraints) can never be the
+// target of a proposal — proposals against them are dropped, and apply refuses.
+//
+// The proposer + the held-out eval are SEAMS: a reflective, score-and-select LLM reviewer can
+// generate richer diffs and score them; the v1 default proposes deterministically
+// from down-vote telemetry so it runs offline.
+/**
+ * Deterministic proposer: a fact down-voted ≥ `minDownvotes` times in the
+ * telemetry is proposed for retraction. Safety-constrained targets are skipped.
+ * Stable order (by target) — no clock/random.
+ */
+export function proposeFromTelemetry(events, opts = {}) {
+    const minDown = opts.minDownvotes ?? 3;
+    const safety = opts.safetyConstraints ?? new Set();
+    const down = new Map();
+    for (const e of events) {
+        if (e.kind === "feedback" && e.signal === "down")
+            down.set(e.memoryId, (down.get(e.memoryId) ?? 0) + 1);
+    }
+    const out = [];
+    for (const [target, n] of [...down.entries()].sort((a, b) => a[0].localeCompare(b[0]))) {
+        if (n < minDown || safety.has(target))
+            continue;
+        out.push({
+            id: `prop:${target}`,
+            rationale: `fact ${target} was down-voted ${n}× — propose retracting it from behaviour`,
+            diff: { kind: "preference", target, before: "active", after: "retracted" },
+            status: "pending",
+        });
+    }
+    return out;
+}
+/** Record a held-out eval delta on a proposal (the gate the human reads before
+ *  approving). Pure — returns a new proposal; never auto-approves. */
+export function gateOnEval(p, evalDelta) {
+    return { ...p, evalDelta };
+}
+/** The human gate. Approve a PENDING proposal (throws otherwise). */
+export function approve(p) {
+    if (p.status !== "pending")
+        throw new Error(`can only approve a pending proposal (status: ${p.status})`);
+    return { ...p, status: "approved" };
+}
+/** Reject a pending proposal. */
+export function reject(p) {
+    if (p.status !== "pending")
+        throw new Error(`can only reject a pending proposal (status: ${p.status})`);
+    return { ...p, status: "rejected" };
+}
+/**
+ * Apply an APPROVED proposal, reversibly. `doApply` performs the actual change
+ * and RETURNS the prior state (captured on the proposal for rollback). REFUSES
+ * to apply anything not explicitly approved — that refusal is the Lane-B
+ * guarantee, not a convention. Also refuses a safety-constrained target.
+ * Pass `appliedLedger` (a shared `Set<string>`) to enforce apply-once across
+ * proposal copies (status alone is bypassable if a caller holds a pre-apply ref).
+ * NOTE: `evalDelta` (set by `gateOnEval`) is informational — it is NOT enforced
+ * here; the human reads it and decides whether to call `approve`.
+ */
+export function applyProposal(p, doApply, opts = {}) {
+    if (p.status !== "approved") {
+        throw new Error(`refusing to apply an un-approved behaviour change (status: ${p.status}) — Lane B is human-gated`);
+    }
+    if (opts.safetyConstraints?.has(p.diff.target)) {
+        throw new Error(`refusing to modify a safety constraint (${p.diff.target}) — read-only`);
+    }
+    // Double-apply guard by ID (status alone is bypassable — a caller can hold the
+    // pre-apply object and apply it twice, corrupting the captured prior/revert
+    // target). Pass an `appliedLedger` to enforce apply-once across copies.
+    if (opts.appliedLedger?.has(p.id)) {
+        throw new Error(`proposal ${p.id} was already applied — refusing a double-apply`);
+    }
+    const prior = doApply(p.diff);
+    opts.appliedLedger?.add(p.id);
+    return { ...p, status: "applied", prior };
+}
+/** Roll back an APPLIED proposal. `doRevert` restores the captured prior state. */
+export function revertProposal(p, doRevert) {
+    if (p.status !== "applied")
+        throw new Error(`can only revert an applied proposal (status: ${p.status})`);
+    if (p.prior === undefined) {
+        throw new Error(`proposal ${p.id} has no captured prior — cannot revert (apply must return a defined prior)`);
+    }
+    doRevert(p.prior);
+    return { ...p, status: "reverted" };
+}
+//# sourceMappingURL=self-improve.js.map

package/dist/agents/memory/self-improve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-improve.js","sourceRoot":"","sources":["../../../src/agents/memory/self-improve.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,EAAE;AACF,yEAAyE;AACzE,EAAE;AACF,iFAAiF;AACjF,2EAA2E;AAC3E,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,qCAAqC;AACrC,EAAE;AACF,6EAA6E;AAC7E,gFAAgF;AAChF,EAAE;AACF,8FAA8F;AAC9F,kFAAkF;AAClF,+CAA+C;AAiC/C;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAA8B,EAAE,OAAoB,EAAE;IAC1F,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,IAAI,IAAI,GAAG,EAAU,CAAC;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxF,IAAI,CAAC,GAAG,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QAChD,GAAG,CAAC,IAAI,CAAC;YACR,EAAE,EAAE,QAAQ,MAAM,EAAE;YACpB,SAAS,EAAE,QAAQ,MAAM,mBAAmB,CAAC,0CAA0C;YACvF,IAAI,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE;YAC1E,MAAM,EAAE,SAAS;SACjB,CAAC,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;sEACsE;AACtE,MAAM,UAAU,UAAU,CAAC,CAAW,EAAE,SAAiB;IACxD,OAAO,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC;AAC5B,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,OAAO,CAAC,CAAW;IAClC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACzG,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACrC,CAAC;AAED,iCAAiC;AACjC,MAAM,UAAU,MAAM,CAAC,CAAW;IACjC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACxG,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACrC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAC5B,CAAW,EACX,OAAwC,EACxC,OAAiF,EAAE;IAEnF,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC;IAC1F,CAAC;IACD,+EAA+E;IAC/E,4EAA4E;IAC5E,wEAAwE;IACxE,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,gDAAgD,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9B,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,cAAc,CAAC,CAAW,EAAE,QAAkC;IAC7E,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACzG,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,4EAA4E,CAAC,CAAC;IAC/G,CAAC;IACD,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAClB,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACrC,CAAC"}

package/dist/agents/memory/self-review.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Self-review loop — Brigade's continual-learning "self-learning" review pass:
+ * after a cadence of turns, a SCOPED background review distils the conversation
+ * into durable memory, non-blocking, attributed,
+ * autonomously — the LLM decides WHAT to learn under guidance; the loop runs
+ * itself.
+ *
+ * This module is the model-agnostic CORE: the cadence trigger, the review prompt
+ * (what to capture + what NOT to), and the apply-step (proposed writes → the
+ * memory store, attributed). The {@link Reviewer} seam is where the live agent
+ * loop plugs a scoped sub-agent (whitelisted to memory tools) over the transcript
+ * — a forked-reviewer pattern. Kept here so it's unit-testable
+ * without a model + a running loop. Pairs with the feedback loop
+ * (`FactStore.applyFeedback`) + the event/telemetry track (`MemoryEventLog`).
+ */
+import type { MemoryRecord, MemoryRecordOrigin, MemorySegment, NewFact } from "./records.js";
+/** Cadence trigger — fire a review every `interval` turns (default cadence ~10).
+ *  `0` disables. The caller owns the per-session counter; this is the pure rule. */
+export declare function shouldReview(turnsSinceReview: number, interval: number): boolean;
+/**
+ * The review prompt: "be ACTIVE, capture corrections/preferences/lessons; DON'T
+ * capture env-failures / negative tool claims / transient errors / one-offs" —
+ * the filters are what stop a review loop from poisoning the
+ * store with noise (and they compose with the write-gate).
+ */
+export declare const SELF_REVIEW_PROMPT: string;
+/** A fact the review proposes to persist (shape-compatible with `NewFact`). */
+export interface ReviewProposedFact {
+    content: string;
+    segment: MemorySegment;
+    importance?: number;
+    supersedes?: string[];
+}
+export interface ReviewProposal {
+    facts: ReviewProposedFact[];
+}
+/**
+ * The reviewer seam — runs the {@link SELF_REVIEW_PROMPT} over a transcript and
+ * returns proposed facts. The intended production wiring is a SCOPED sub-agent
+ * (whitelisted to memory tools, fresh session, the parent's model) — the
+ * forked-reviewer pattern. Not yet wired in server.ts (behavior-review is the
+ * active path); injected here so the loop is testable without a model.
+ */
+export type Reviewer = (prompt: string, transcript: string) => Promise<ReviewProposal>;
+/** Minimal write surface the apply-step needs (a `FactStore` satisfies it). */
+export interface ReviewWriteStore {
+    write(fact: NewFact): MemoryRecord;
+}
+export interface SelfReviewResult {
+    written: number;
+    records: MemoryRecord[];
+    /** Compact action summary to surface back (e.g. "💾 Self-improvement review: …"). */
+    summary: string;
+}
+/**
+ * Run one self-review pass: review the transcript → persist the proposed facts,
+ * ATTRIBUTED as `extraction` (distilled-from-the-turn, not the owner speaking —
+ * so the write-gate trusts them ~0.9 but they're distinguishable from direct
+ * owner statements) and scoped to `origin`. Best-effort: a reviewer error yields
+ * an empty (no-op) result rather than throwing into the turn.
+ */
+export declare function runSelfReview(args: {
+    transcript: string;
+    reviewer: Reviewer;
+    store: ReviewWriteStore;
+    origin?: MemoryRecordOrigin;
+}): Promise<SelfReviewResult>;
+//# sourceMappingURL=self-review.d.ts.map

package/dist/agents/memory/self-review.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-review.d.ts","sourceRoot":"","sources":["../../../src/agents/memory/self-review.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,kBAAkB,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAG7F;oFACoF;AACpF,wBAAgB,YAAY,CAAC,gBAAgB,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAEhF;AAED;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,QAkBnB,CAAC;AAEb,+EAA+E;AAC/E,MAAM,WAAW,kBAAkB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,aAAa,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,cAAc;IAC9B,KAAK,EAAE,kBAAkB,EAAE,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC,cAAc,CAAC,CAAC;AAEvF,+EAA+E;AAC/E,MAAM,WAAW,gBAAgB;IAChC,KAAK,CAAC,IAAI,EAAE,OAAO,GAAG,YAAY,CAAC;CACnC;AAED,MAAM,WAAW,gBAAgB;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,qFAAqF;IACrF,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;GAMG;AACH,wBAAsB,aAAa,CAAC,IAAI,EAAE;IACzC,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,CAAC;IACnB,KAAK,EAAE,gBAAgB,CAAC;IACxB,MAAM,CAAC,EAAE,kBAAkB,CAAC;CAC5B,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAuD5B"}

package/dist/agents/memory/self-review.js

@@ -0,0 +1,109 @@
+/**
+ * Self-review loop — Brigade's continual-learning "self-learning" review pass:
+ * after a cadence of turns, a SCOPED background review distils the conversation
+ * into durable memory, non-blocking, attributed,
+ * autonomously — the LLM decides WHAT to learn under guidance; the loop runs
+ * itself.
+ *
+ * This module is the model-agnostic CORE: the cadence trigger, the review prompt
+ * (what to capture + what NOT to), and the apply-step (proposed writes → the
+ * memory store, attributed). The {@link Reviewer} seam is where the live agent
+ * loop plugs a scoped sub-agent (whitelisted to memory tools) over the transcript
+ * — a forked-reviewer pattern. Kept here so it's unit-testable
+ * without a model + a running loop. Pairs with the feedback loop
+ * (`FactStore.applyFeedback`) + the event/telemetry track (`MemoryEventLog`).
+ */
+import { MEMORY_SEGMENTS } from "./records.js";
+import { confineUntrustedSegment } from "./write-gate.js";
+/** Cadence trigger — fire a review every `interval` turns (default cadence ~10).
+ *  `0` disables. The caller owns the per-session counter; this is the pure rule. */
+export function shouldReview(turnsSinceReview, interval) {
+    return interval > 0 && turnsSinceReview >= interval;
+}
+/**
+ * The review prompt: "be ACTIVE, capture corrections/preferences/lessons; DON'T
+ * capture env-failures / negative tool claims / transient errors / one-offs" —
+ * the filters are what stop a review loop from poisoning the
+ * store with noise (and they compose with the write-gate).
+ */
+export const SELF_REVIEW_PROMPT = [
+    "Review the conversation above and update long-term memory. Be ACTIVE but PRECISE —",
+    "most useful sessions yield at least one durable fact, but noise is worse than nothing.",
+    "",
+    "CAPTURE (durable, reusable across future sessions):",
+    "  • Who the user is — stable identity, role, environment, tools they use.",
+    "  • Preferences + expectations about how you should behave (style, format, verbosity),",
+    "    ESPECIALLY corrections (\"stop doing X\", \"always do Y\", \"I prefer Z\").",
+    "  • Decisions, conventions, and durable project facts.",
+    "  • Lessons: a non-obvious technique, workaround, or pitfall worth not relearning.",
+    "",
+    "DO NOT CAPTURE (noise that hardens into bad behavior):",
+    "  • Environment-dependent failures (a missing binary, an unconfigured key).",
+    "  • Negative claims about tools (\"X is broken\") — they ossify into refusals.",
+    "  • Transient errors that resolved within the session.",
+    "  • One-off task narratives with no reusable class.",
+    "",
+    "Output only the durable facts, each with its segment. If nothing qualifies, output nothing.",
+].join("\n");
+/**
+ * Run one self-review pass: review the transcript → persist the proposed facts,
+ * ATTRIBUTED as `extraction` (distilled-from-the-turn, not the owner speaking —
+ * so the write-gate trusts them ~0.9 but they're distinguishable from direct
+ * owner statements) and scoped to `origin`. Best-effort: a reviewer error yields
+ * an empty (no-op) result rather than throwing into the turn.
+ */
+export async function runSelfReview(args) {
+    let proposal;
+    try {
+        proposal = await args.reviewer(SELF_REVIEW_PROMPT, args.transcript);
+    }
+    catch {
+        return { written: 0, records: [], summary: "self-review: skipped (reviewer error)" };
+    }
+    const records = [];
+    // Best-effort: a MALFORMED reviewer return (missing / non-array `facts`) is a
+    // no-op, not a crash. The for-of would otherwise throw OUTSIDE the try above
+    // (the try only wraps the reviewer CALL) and reject into the turn.
+    const proposed = Array.isArray(proposal?.facts) ? proposal.facts : [];
+    for (const f of proposed) {
+        // Type-guard the ELEMENT too, not just the container: the reviewer return is
+        // model-influenceable, so a malformed element (`null`, `{content: 123}`) must
+        // be skipped — `f.content.trim()` runs OUTSIDE the per-write try below, so a
+        // non-string content would otherwise throw into the turn (breaks best-effort).
+        // Also reject an off-vocabulary/missing segment: filesystem mode would
+        // persist it but the non-optional convex Segment validator rejects it —
+        // skip in BOTH modes (parity) rather than write an fs-only record.
+        if (!f ||
+            typeof f.content !== "string" ||
+            !f.content.trim() ||
+            !MEMORY_SEGMENTS.includes(f.segment))
+            continue;
+        // The reviewer distils an attacker-influenceable transcript, so its writes
+        // are the write-gate's CONFINED `extraction` tier: route a protected segment
+        // to descriptive `knowledge`, and DROP any proposed supersede (an untrusted
+        // distillation may not overwrite an owner fact — it lands as a fresh evidence
+        // fact instead of being gate-rejected and silently lost).
+        const segment = confineUntrustedSegment("extraction", f.segment);
+        try {
+            records.push(args.store.write({
+                content: f.content,
+                segment,
+                sourceType: "extraction",
+                ...(f.importance !== undefined ? { importance: f.importance } : {}),
+                ...(args.origin !== undefined ? { createdBy: args.origin } : {}),
+            }));
+        }
+        catch {
+            // Best-effort: protected segments are pre-confined and supersedes dropped,
+            // so the gate no longer throws here — only an unexpected fs/embedder error.
+        }
+    }
+    return {
+        written: records.length,
+        records,
+        summary: records.length
+            ? `self-review: learned ${records.length} fact(s) — ${records.map((r) => r.segment).join(", ")}`
+            : "self-review: nothing durable to learn",
+    };
+}
+//# sourceMappingURL=self-review.js.map

package/dist/agents/memory/self-review.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-review.js","sourceRoot":"","sources":["../../../src/agents/memory/self-review.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAE1D;oFACoF;AACpF,MAAM,UAAU,YAAY,CAAC,gBAAwB,EAAE,QAAgB;IACtE,OAAO,QAAQ,GAAG,CAAC,IAAI,gBAAgB,IAAI,QAAQ,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG;IACjC,oFAAoF;IACpF,wFAAwF;IACxF,EAAE;IACF,qDAAqD;IACrD,2EAA2E;IAC3E,wFAAwF;IACxF,iFAAiF;IACjF,wDAAwD;IACxD,oFAAoF;IACpF,EAAE;IACF,wDAAwD;IACxD,6EAA6E;IAC7E,gFAAgF;IAChF,wDAAwD;IACxD,qDAAqD;IACrD,EAAE;IACF,6FAA6F;CAC7F,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAmCb;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAKnC;IACA,IAAI,QAAwB,CAAC;IAC7B,IAAI,CAAC;QACJ,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACrE,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,uCAAuC,EAAE,CAAC;IACtF,CAAC;IACD,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,8EAA8E;IAC9E,6EAA6E;IAC7E,mEAAmE;IACnE,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC1B,6EAA6E;QAC7E,8EAA8E;QAC9E,6EAA6E;QAC7E,+EAA+E;QAC/E,uEAAuE;QACvE,wEAAwE;QACxE,mEAAmE;QACnE,IACC,CAAC,CAAC;YACF,OAAO,CAAC,CAAC,OAAO,KAAK,QAAQ;YAC7B,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE;YACjB,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAwB,CAAC;YAErD,SAAS;QACV,2EAA2E;QAC3E,6EAA6E;QAC7E,4EAA4E;QAC5E,8EAA8E;QAC9E,0DAA0D;QAC1D,MAAM,OAAO,GAAG,uBAAuB,CAAC,YAAY,EAAE,CAAC,CAAC,OAAwB,CAAC,CAAC;QAClF,IAAI,CAAC;YACJ,OAAO,CAAC,IAAI,CACX,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;gBAChB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,OAAO;gBACP,UAAU,EAAE,YAAY;gBACxB,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChE,CAAC,CACF,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACR,2EAA2E;YAC3E,4EAA4E;QAC7E,CAAC;IACF,CAAC;IACD,OAAO;QACN,OAAO,EAAE,OAAO,CAAC,MAAM;QACvB,OAAO;QACP,OAAO,EAAE,OAAO,CAAC,MAAM;YACtB,CAAC,CAAC,wBAAwB,OAAO,CAAC,MAAM,cAAc,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAChG,CAAC,CAAC,uCAAuC;KAC1C,CAAC;AACH,CAAC"}