@seanhogg/builderforce-memory-engine 2026.9.33 → 2026.10.1

package/dist/ml/tasks/experience.d.ts

@@ -0,0 +1,90 @@
+/**
+ * ml/tasks/experience.ts — `experience.quality` and `experience.dedupe`, and the
+ * opt-in curation step that applies them in front of the ONE adaptation recipe
+ * (`evermind/adapt.ts`), so the private model learns from good, varied examples
+ * instead of every transcript. Curation only drops documents; it never rewrites one.
+ */
+import { type ExperienceDocument } from "../../experience/corpus.js";
+import type { Episode, Run, Skill } from "../../experience/types.js";
+import { type TextEmbedder } from "../features.js";
+import { type MlRunContext } from "../run.js";
+import type { MlTrainExample } from "../train.js";
+import type { MlPrediction, MlPredictor, MlTask } from "../types.js";
+/** One learnable procedure plus the outcome fields that say how well it went. */
+export interface ExperienceQualityInput {
+    doc: ExperienceDocument;
+    /** Steps in the procedure. */
+    steps: number;
+    /** Runs of the skill (0 for an uncompiled demonstration). */
+    runs: number;
+    succeeded: number;
+    failed: number;
+}
+export interface ExperienceQuality {
+    label: "low" | "high";
+    /** P(high). */
+    pHigh: number;
+}
+export declare const EXPERIENCE_QUALITY_TASK: MlTask<ExperienceQualityInput, ExperienceQuality>;
+/** Quality inputs for every learnable document, with run outcomes joined by skill id. */
+export declare function experienceQualityInputs(episodes: Episode[], skills: Skill[], runs?: readonly Run[]): ExperienceQualityInput[];
+/** The training label of a quality input: 1 (high) when most finished runs succeeded, 0 when not, null with no runs. */
+export declare function experienceQualityLabel(i: ExperienceQualityInput): number | null;
+/** Labelled examples for `experience.quality` — only the inputs that have run outcomes. */
+export declare function experienceQualityExamples(inputs: readonly ExperienceQualityInput[]): MlTrainExample<ExperienceQualityInput>[];
+export interface ExperienceDuplicate {
+    /** Index (in keep order) of the nearest already-kept document, or -1 when none. */
+    nearest: number;
+    similarity: number;
+    duplicate: boolean;
+}
+/** Cosine similarity at or above which two procedures count as one. */
+export declare const DEFAULT_DEDUPE_THRESHOLD = 0.97;
+export declare const EXPERIENCE_DEDUPE_TASK: MlTask<ExperienceDocument, ExperienceDuplicate>;
+/**
+ * The `experience.dedupe` predictor: a cosine nearest-neighbour index of the
+ * documents kept so far. `scores = [nearestIndex, similarity, duplicate ? 1 : 0]`.
+ */
+export declare class DedupeIndex implements MlPredictor {
+    readonly threshold: number;
+    private readonly _knn;
+    constructor(threshold?: number);
+    get size(): number;
+    add(x: Float32Array): void;
+    predict(x: Float32Array): MlPrediction;
+}
+export interface CurationOptions {
+    /** Embeds each document once (the person's CPU Evermind: `EvermindTextEmbedder`). */
+    embedder: TextEmbedder;
+    /** Cosine similarity at or above which a document duplicates a kept one. Default {@link DEFAULT_DEDUPE_THRESHOLD}. */
+    dedupeThreshold?: number;
+    /**
+     * Quality filter through the runner. A document whose P(high) is below `minPHigh`
+     * (default 0.5) is dropped; one the runner cannot score (no trained engine) is kept.
+     */
+    quality?: {
+        ctx: MlRunContext;
+        input: (doc: ExperienceDocument) => ExperienceQualityInput;
+        minPHigh?: number;
+    };
+    /** Document ids to leave out (e.g. those whose runs `run.anomaly` flagged). */
+    exclude?: ReadonlySet<string>;
+}
+export interface CurationResult {
+    kept: ExperienceDocument[];
+    dropped: {
+        id: string;
+        reason: "duplicate" | "low-quality" | "excluded";
+        of?: string;
+        score?: number;
+    }[];
+}
+/**
+ * Curate documents before they are packed into adaptation passes: drop excluded
+ * ones, low-quality ones (when a quality filter is given), then near-duplicates of
+ * an earlier kept one. Order is preserved, and the FIRST copy wins — compiled
+ * skills come before raw demonstrations in `experienceDocuments`, so the reviewed
+ * version is the one kept.
+ */
+export declare function curateExperience(docs: readonly ExperienceDocument[], opts: CurationOptions): Promise<CurationResult>;
+//# sourceMappingURL=experience.d.ts.map

package/dist/ml/tasks/experience.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"experience.d.ts","sourceRoot":"","sources":["../../../src/ml/tasks/experience.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAuB,KAAK,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAC1F,OAAO,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAErE,OAAO,EAAwB,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACzE,OAAO,EAAuC,KAAK,YAAY,EAAE,MAAM,WAAW,CAAC;AACnF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAIrE,iFAAiF;AACjF,MAAM,WAAW,sBAAsB;IACrC,GAAG,EAAE,kBAAkB,CAAC;IACxB,8BAA8B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC;IACtB,eAAe;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,sBAAsB,EAAE,iBAAiB,CAkBrF,CAAC;AAEF,yFAAyF;AACzF,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,GAAE,SAAS,GAAG,EAAO,GAAG,sBAAsB,EAAE,CAgBjI;AAED,wHAAwH;AACxH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,sBAAsB,GAAG,MAAM,GAAG,IAAI,CAG/E;AAED,2FAA2F;AAC3F,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,SAAS,sBAAsB,EAAE,GAAG,cAAc,CAAC,sBAAsB,CAAC,EAAE,CAK7H;AAID,MAAM,WAAW,mBAAmB;IAClC,mFAAmF;IACnF,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,uEAAuE;AACvE,eAAO,MAAM,wBAAwB,OAAO,CAAC;AAE7C,eAAO,MAAM,sBAAsB,EAAE,MAAM,CAAC,kBAAkB,EAAE,mBAAmB,CASlF,CAAC;AAEF;;;GAGG;AACH,qBAAa,WAAY,YAAW,WAAW;IAGjC,QAAQ,CAAC,SAAS,EAAE,MAAM;IAFtC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgC;gBAEhC,SAAS,GAAE,MAAiC;IAEjE,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,IAAI;IAI1B,OAAO,CAAC,CAAC,EAAE,YAAY,GAAG,YAAY;CAMvC;AAID,MAAM,WAAW,eAAe;IAC9B,qFAAqF;IACrF,QAAQ,EAAE,YAAY,CAAC;IACvB,sHAAsH;IACtH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,OAAO,CAAC,EAAE;QACR,GAAG,EAAE,YAAY,CAAC;QAClB,KAAK,EAAE,CAAC,GAAG,EAAE,kBAAkB,KAAK,sBAAsB,CAAC;QAC3D,QAAQ,CAAC,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,+EAA+E;IAC/E,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,kBAAkB,EAAE,CAAC;IAC3B,OAAO,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,WAAW,GAAG,aAAa,GAAG,UAAU,CAAC;QAAC,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC1G;AAgBD;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,SAAS,kBAAkB,EAAE,EAAE,IAAI,EAAE,eAAe,GAAG,OAAO,CAAC,cAAc,CAAC,CAiC1H"}

package/dist/ml/tasks/experience.js

@@ -0,0 +1,156 @@
+/**
+ * ml/tasks/experience.ts — `experience.quality` and `experience.dedupe`, and the
+ * opt-in curation step that applies them in front of the ONE adaptation recipe
+ * (`evermind/adapt.ts`), so the private model learns from good, varied examples
+ * instead of every transcript. Curation only drops documents; it never rewrites one.
+ */
+import { experienceDocuments } from "../../experience/corpus.js";
+import { KnnModel } from "../classical/knn.js";
+import { clampRatio, logScale } from "../features.js";
+import { MlEngineUnavailableError, runMlTask } from "../run.js";
+export const EXPERIENCE_QUALITY_TASK = {
+    kind: "classify",
+    id: "experience.quality",
+    description: "Is this procedure worth learning from (does it run, and run well)?",
+    features: {
+        text: (i) => i.doc.text,
+        numeric: (i) => [logScale(i.steps, 50), logScale(i.runs, 20), clampRatio(i.succeeded, i.runs, 1), clampRatio(i.failed, i.runs, 1)],
+        numericNames: ["steps", "runs", "successRate", "failureRate"],
+    },
+    engines: [
+        { tier: "local", engine: "classical", algorithm: "knn" },
+        { tier: "local", engine: "classical", algorithm: "logistic" },
+    ],
+    train: { minSamples: 4 },
+    output: {
+        labels: ["low", "high"],
+        decode: (p) => ({ label: (p.scores[1] ?? 0) >= 0.5 ? "high" : "low", pHigh: p.scores[1] ?? 0 }),
+    },
+};
+/** Quality inputs for every learnable document, with run outcomes joined by skill id. */
+export function experienceQualityInputs(episodes, skills, runs = []) {
+    const steps = new Map([...skills.map((s) => [s.id, s.steps.length]), ...episodes.map((e) => [e.id, e.steps.length])]);
+    const byItem = new Map();
+    for (const r of runs) {
+        if (r.status === "running")
+            continue;
+        const t = byItem.get(r.skillId) ?? { runs: 0, succeeded: 0, failed: 0 };
+        t.runs++;
+        if (r.status === "succeeded")
+            t.succeeded++;
+        if (r.status === "failed")
+            t.failed++;
+        byItem.set(r.skillId, t);
+    }
+    return experienceDocuments(episodes, skills).map((doc) => ({
+        doc,
+        steps: steps.get(doc.id) ?? 0,
+        ...(byItem.get(doc.id) ?? { runs: 0, succeeded: 0, failed: 0 }),
+    }));
+}
+/** The training label of a quality input: 1 (high) when most finished runs succeeded, 0 when not, null with no runs. */
+export function experienceQualityLabel(i) {
+    if (i.runs === 0)
+        return null;
+    return i.succeeded / i.runs >= 0.5 ? 1 : 0;
+}
+/** Labelled examples for `experience.quality` — only the inputs that have run outcomes. */
+export function experienceQualityExamples(inputs) {
+    return inputs.flatMap((input) => {
+        const label = experienceQualityLabel(input);
+        return label == null ? [] : [{ input, label }];
+    });
+}
+/** Cosine similarity at or above which two procedures count as one. */
+export const DEFAULT_DEDUPE_THRESHOLD = 0.97;
+export const EXPERIENCE_DEDUPE_TASK = {
+    kind: "cluster",
+    id: "experience.dedupe",
+    description: "Is this procedure a near-copy of one already kept?",
+    features: { text: (d) => d.text },
+    engines: [{ tier: "local", engine: "classical", algorithm: "knn" }],
+    output: {
+        decode: (p) => ({ nearest: p.scores[0] ?? -1, similarity: p.scores[1] ?? 0, duplicate: (p.scores[2] ?? 0) === 1 }),
+    },
+};
+/**
+ * The `experience.dedupe` predictor: a cosine nearest-neighbour index of the
+ * documents kept so far. `scores = [nearestIndex, similarity, duplicate ? 1 : 0]`.
+ */
+export class DedupeIndex {
+    threshold;
+    _knn = new KnnModel(1, "cosine", 2);
+    constructor(threshold = DEFAULT_DEDUPE_THRESHOLD) {
+        this.threshold = threshold;
+    }
+    get size() {
+        return this._knn.size;
+    }
+    add(x) {
+        this._knn.add(x);
+    }
+    predict(x) {
+        const n = this._knn.nearest(x);
+        if (!n)
+            return { scores: [-1, 0, 0], confidence: 1 };
+        const dup = n.similarity >= this.threshold;
+        return { scores: [n.index, n.similarity, dup ? 1 : 0], confidence: Math.abs(n.similarity) };
+    }
+}
+/** Memoise an embedder for one call, so curation embeds each text once. */
+function memoEmbedder(e) {
+    const cache = new Map();
+    return {
+        dimensions: e.dimensions,
+        fingerprint: e.fingerprint,
+        async embed(text) {
+            let v = cache.get(text);
+            if (!v)
+                cache.set(text, (v = await e.embed(text)));
+            return v;
+        },
+    };
+}
+/**
+ * Curate documents before they are packed into adaptation passes: drop excluded
+ * ones, low-quality ones (when a quality filter is given), then near-duplicates of
+ * an earlier kept one. Order is preserved, and the FIRST copy wins — compiled
+ * skills come before raw demonstrations in `experienceDocuments`, so the reviewed
+ * version is the one kept.
+ */
+export async function curateExperience(docs, opts) {
+    const embedder = memoEmbedder(opts.embedder);
+    const index = new DedupeIndex(opts.dedupeThreshold ?? DEFAULT_DEDUPE_THRESHOLD);
+    const kept = [];
+    const dropped = [];
+    const qctx = opts.quality ? { ...opts.quality.ctx, embedder } : null;
+    for (const doc of docs) {
+        if (opts.exclude?.has(doc.id)) {
+            dropped.push({ id: doc.id, reason: "excluded" });
+            continue;
+        }
+        if (opts.quality && qctx) {
+            try {
+                const r = await runMlTask(EXPERIENCE_QUALITY_TASK.id, opts.quality.input(doc), qctx);
+                if (r.output.pHigh < (opts.quality.minPHigh ?? 0.5)) {
+                    dropped.push({ id: doc.id, reason: "low-quality", score: r.output.pHigh });
+                    continue;
+                }
+            }
+            catch (error) {
+                if (!(error instanceof MlEngineUnavailableError))
+                    throw error;
+            }
+        }
+        const x = await embedder.embed(EXPERIENCE_DEDUPE_TASK.features.text(doc));
+        const d = EXPERIENCE_DEDUPE_TASK.output.decode(index.predict(x));
+        if (d.duplicate) {
+            dropped.push({ id: doc.id, reason: "duplicate", of: kept[d.nearest].id, score: d.similarity });
+            continue;
+        }
+        index.add(x);
+        kept.push(doc);
+    }
+    return { kept, dropped };
+}
+//# sourceMappingURL=experience.js.map

package/dist/ml/tasks/experience.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"experience.js","sourceRoot":"","sources":["../../../src/ml/tasks/experience.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,mBAAmB,EAA2B,MAAM,4BAA4B,CAAC;AAE1F,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAqB,MAAM,gBAAgB,CAAC;AACzE,OAAO,EAAE,wBAAwB,EAAE,SAAS,EAAqB,MAAM,WAAW,CAAC;AAuBnF,MAAM,CAAC,MAAM,uBAAuB,GAAsD;IACxF,IAAI,EAAE,UAAU;IAChB,EAAE,EAAE,oBAAoB;IACxB,WAAW,EAAE,oEAAoE;IACjF,QAAQ,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI;QACvB,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClI,YAAY,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC;KAC9D;IACD,OAAO,EAAE;QACP,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE;QACxD,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE;KAC9D;IACD,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE;IACxB,MAAM,EAAE;QACN,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,MAAM,EAAE,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;KAC9G;CACF,CAAC;AAEF,yFAAyF;AACzF,MAAM,UAAU,uBAAuB,CAAC,QAAmB,EAAE,MAAe,EAAE,OAAuB,EAAE;IACrG,MAAM,KAAK,GAAG,IAAI,GAAG,CAAiB,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAU,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAU,CAAC,CAAC,CAAC,CAAC;IACxJ,MAAM,MAAM,GAAG,IAAI,GAAG,EAA+D,CAAC;IACtF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QACrC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACxE,CAAC,CAAC,IAAI,EAAE,CAAC;QACT,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,CAAC,CAAC,SAAS,EAAE,CAAC;QAC5C,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACzD,GAAG;QACH,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;KAChE,CAAC,CAAC,CAAC;AACN,CAAC;AAED,wHAAwH;AACxH,MAAM,UAAU,sBAAsB,CAAC,CAAyB;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,yBAAyB,CAAC,MAAyC;IACjF,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAC5C,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC;AAWD,uEAAuE;AACvE,MAAM,CAAC,MAAM,wBAAwB,GAAG,IAAI,CAAC;AAE7C,MAAM,CAAC,MAAM,sBAAsB,GAAoD;IACrF,IAAI,EAAE,SAAS;IACf,EAAE,EAAE,mBAAmB;IACvB,WAAW,EAAE,oDAAoD;IACjE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;IACjC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACnE,MAAM,EAAE;QACN,MAAM,EAAE,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;KACjI;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,WAAW;IAGD;IAFJ,IAAI,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAErD,YAAqB,YAAoB,wBAAwB;QAA5C,cAAS,GAAT,SAAS,CAAmC;IAAG,CAAC;IAErE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,GAAG,CAAC,CAAe;QACjB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,CAAe;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QACrD,MAAM,GAAG,GAAG,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;IAC9F,CAAC;CACF;AA2BD,2EAA2E;AAC3E,SAAS,YAAY,CAAC,CAAe;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC9C,OAAO;QACL,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,KAAK,CAAC,KAAK,CAAC,IAAY;YACtB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxB,IAAI,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,CAAC,CAAC;QACX,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAAmC,EAAE,IAAqB;IAC/F,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC,CAAC;IAChF,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,MAAM,OAAO,GAA8B,EAAE,CAAC;IAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAErE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;YACjD,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,CAAC,GAAG,MAAM,SAAS,CAAoB,uBAAuB,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;gBACxG,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC;oBACpD,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC3E,SAAS;gBACX,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,CAAC,KAAK,YAAY,wBAAwB,CAAC;oBAAE,MAAM,KAAK,CAAC;YAChE,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,sBAAsB,CAAC,QAAQ,CAAC,IAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YAChG,SAAS;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC"}

package/dist/ml/tasks/index.d.ts

@@ -0,0 +1,10 @@
+import { MlTaskRegistry } from "../registry.js";
+import type { MlTask } from "../types.js";
+/** The built-in rows, in catalog order. */
+export declare const BUILTIN_ML_TASKS: readonly MlTask<any, any>[];
+/** A registry holding every built-in row (add host rows with `register`). */
+export declare function createMlRegistry(): MlTaskRegistry;
+export * from "./experience.js";
+export * from "./run_anomaly.js";
+export * from "./local_success.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/ml/tasks/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/ml/tasks/index.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAK1C,2CAA2C;AAC3C,eAAO,MAAM,gBAAgB,EAAE,SAAS,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAMvD,CAAC;AAEF,6EAA6E;AAC7E,wBAAgB,gBAAgB,IAAI,cAAc,CAIjD;AAED,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,oBAAoB,CAAC"}

package/dist/ml/tasks/index.js

@@ -0,0 +1,28 @@
+/**
+ * ml/tasks — the built-in catalog rows (docs/ml-task-catalog.md §4), in order.
+ * `limbic.affect` is defined by limbic/ itself; this only lists it.
+ */
+import { LIMBIC_AFFECT_TASK } from "../../limbic/limbic_task.js";
+import { MlTaskRegistry } from "../registry.js";
+import { EXPERIENCE_DEDUPE_TASK, EXPERIENCE_QUALITY_TASK } from "./experience.js";
+import { LOCAL_SUCCESS_TASK } from "./local_success.js";
+import { RUN_ANOMALY_TASK } from "./run_anomaly.js";
+/** The built-in rows, in catalog order. */
+export const BUILTIN_ML_TASKS = [
+    LIMBIC_AFFECT_TASK,
+    EXPERIENCE_QUALITY_TASK,
+    EXPERIENCE_DEDUPE_TASK,
+    RUN_ANOMALY_TASK,
+    LOCAL_SUCCESS_TASK,
+];
+/** A registry holding every built-in row (add host rows with `register`). */
+export function createMlRegistry() {
+    const r = new MlTaskRegistry();
+    for (const t of BUILTIN_ML_TASKS)
+        r.register(t);
+    return r;
+}
+export * from "./experience.js";
+export * from "./run_anomaly.js";
+export * from "./local_success.js";
+//# sourceMappingURL=index.js.map

package/dist/ml/tasks/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/ml/tasks/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,OAAO,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAClF,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAEpD,2CAA2C;AAC3C,MAAM,CAAC,MAAM,gBAAgB,GAAgC;IAC3D,kBAAkB;IAClB,uBAAuB;IACvB,sBAAsB;IACtB,gBAAgB;IAChB,kBAAkB;CACnB,CAAC;AAEF,6EAA6E;AAC7E,MAAM,UAAU,gBAAgB;IAC9B,MAAM,CAAC,GAAG,IAAI,cAAc,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,gBAAgB;QAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,oBAAoB,CAAC"}

package/dist/ml/tasks/local_success.d.ts

@@ -0,0 +1,55 @@
+import type { MlTrainExample } from "../train.js";
+import type { MlTask } from "../types.js";
+/** What the router knows about a turn before it runs, plus the local model's served context. */
+export interface LocalTurnFeatures {
+    promptTokens: number;
+    /** Tokens of context (history, files, memory) the turn carries. */
+    contextTokens: number;
+    /** The local model's served context window, in tokens. */
+    servedContextTokens: number;
+    /** Tools advertised to the turn. */
+    tools: number;
+    /** Position of the turn in its conversation (0 = first). */
+    turnIndex: number;
+    attachments?: number;
+    /** Recent local success rate for this person/workload in [0, 1], when known. */
+    priorLocalSuccessRate?: number;
+    /** The turn is mostly code (edits, diffs, stack traces). */
+    codeHeavy?: boolean;
+}
+export declare const LOCAL_SUCCESS_FEATURES: readonly ["promptTokens", "contextTokens", "contextFill", "overflows", "tools", "turnIndex", "attachments", "priorLocalSuccessRate", "codeHeavy"];
+/** Fixed scales — the same on every machine, so the weights federate. */
+export declare function localSuccessFeatures(t: LocalTurnFeatures): number[];
+export interface LocalSuccess {
+    succeeds: boolean;
+    /** P(the local model succeeds). */
+    probability: number;
+}
+export declare const LOCAL_SUCCESS_TASK: MlTask<LocalTurnFeatures, LocalSuccess>;
+export type TurnResult = "succeeded" | "failed";
+/** How one routed turn actually went. */
+export interface LocalSuccessOutcome {
+    turn: LocalTurnFeatures;
+    /** The local model's result, when it ran. */
+    local?: TurnResult;
+    /** The cloud's result, when it ran. */
+    cloud?: TurnResult;
+    /** The local model ran first and the turn was handed to the cloud. */
+    fellBack?: boolean;
+}
+/** Weight of a cloud failure on a turn the local model never tried — weak evidence the turn was hard. */
+export declare const CLOUD_ONLY_FAILURE_WEIGHT = 0.5;
+/**
+ * The training label of one outcome, or null when it says nothing about the local model.
+ *  - local ran: its result (1 succeeded / 0 failed);
+ *  - fell back to the cloud: 0 — the local model could not finish it;
+ *  - cloud only, and the cloud failed: 0 at {@link CLOUD_ONLY_FAILURE_WEIGHT};
+ *  - cloud only, and the cloud succeeded: no evidence about local → null.
+ */
+export declare function localSuccessLabel(o: LocalSuccessOutcome): {
+    label: 0 | 1;
+    weight: number;
+} | null;
+/** Labelled examples from routed outcomes (local AND cloud), oldest first. */
+export declare function localSuccessExamples(outcomes: readonly LocalSuccessOutcome[]): MlTrainExample<LocalTurnFeatures>[];
+//# sourceMappingURL=local_success.d.ts.map

package/dist/ml/tasks/local_success.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local_success.d.ts","sourceRoot":"","sources":["../../../src/ml/tasks/local_success.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,KAAK,EAAgB,MAAM,EAAE,MAAM,aAAa,CAAC;AAExD,gGAAgG;AAChG,MAAM,WAAW,iBAAiB;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,mEAAmE;IACnE,aAAa,EAAE,MAAM,CAAC;IACtB,0DAA0D;IAC1D,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gFAAgF;IAChF,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,4DAA4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED,eAAO,MAAM,sBAAsB,mJAUzB,CAAC;AAEX,yEAAyE;AACzE,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,iBAAiB,GAAG,MAAM,EAAE,CAanE;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,OAAO,CAAC;IAClB,mCAAmC;IACnC,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,kBAAkB,EAAE,MAAM,CAAC,iBAAiB,EAAE,YAAY,CActE,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG,WAAW,GAAG,QAAQ,CAAC;AAEhD,yCAAyC;AACzC,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,iBAAiB,CAAC;IACxB,6CAA6C;IAC7C,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,uCAAuC;IACvC,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,sEAAsE;IACtE,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,yGAAyG;AACzG,eAAO,MAAM,yBAAyB,MAAM,CAAC;AAE7C;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,mBAAmB,GAAG;IAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAKjG;AAED,8EAA8E;AAC9E,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,GAAG,cAAc,CAAC,iBAAiB,CAAC,EAAE,CAKlH"}

package/dist/ml/tasks/local_success.js

@@ -0,0 +1,77 @@
+/**
+ * ml/tasks/local_success.ts — `run.local-success`: will this turn succeed on the
+ * local model? Exported for the Hybrid router (Builderforce.ai), which keeps a turn
+ * local when it can and sends it to the cloud when it can't.
+ *
+ * It LEARNS FROM THE CLOUD (docs/ml-task-catalog.md §6): in Hybrid, a turn that
+ * fell back to — or was also served by — the cloud is a training label for the
+ * local predictor, alongside local outcomes. See {@link localSuccessLabel}.
+ */
+import { clampRatio, logScale } from "../features.js";
+export const LOCAL_SUCCESS_FEATURES = [
+    "promptTokens",
+    "contextTokens",
+    "contextFill",
+    "overflows",
+    "tools",
+    "turnIndex",
+    "attachments",
+    "priorLocalSuccessRate",
+    "codeHeavy",
+];
+/** Fixed scales — the same on every machine, so the weights federate. */
+export function localSuccessFeatures(t) {
+    const fill = clampRatio(t.promptTokens + t.contextTokens, t.servedContextTokens, 4);
+    return [
+        logScale(t.promptTokens, 100_000),
+        logScale(t.contextTokens, 100_000),
+        fill,
+        fill > 1 ? 1 : 0,
+        logScale(t.tools, 64),
+        logScale(t.turnIndex, 100),
+        logScale(t.attachments ?? 0, 16),
+        Math.max(0, Math.min(1, t.priorLocalSuccessRate ?? 0.5)),
+        t.codeHeavy ? 1 : 0,
+    ];
+}
+export const LOCAL_SUCCESS_TASK = {
+    kind: "classify",
+    id: "run.local-success",
+    description: "Will this turn succeed on the local model?",
+    features: { numeric: localSuccessFeatures, numericNames: LOCAL_SUCCESS_FEATURES },
+    engines: [
+        { tier: "local", engine: "classical", algorithm: "logistic" },
+        { tier: "local", engine: "classical", algorithm: "gbm-small" },
+    ],
+    train: { minSamples: 8 },
+    output: {
+        labels: ["fails", "succeeds"],
+        decode: (p) => ({ succeeds: (p.scores[1] ?? 0) >= 0.5, probability: p.scores[1] ?? 0 }),
+    },
+};
+/** Weight of a cloud failure on a turn the local model never tried — weak evidence the turn was hard. */
+export const CLOUD_ONLY_FAILURE_WEIGHT = 0.5;
+/**
+ * The training label of one outcome, or null when it says nothing about the local model.
+ *  - local ran: its result (1 succeeded / 0 failed);
+ *  - fell back to the cloud: 0 — the local model could not finish it;
+ *  - cloud only, and the cloud failed: 0 at {@link CLOUD_ONLY_FAILURE_WEIGHT};
+ *  - cloud only, and the cloud succeeded: no evidence about local → null.
+ */
+export function localSuccessLabel(o) {
+    if (o.local)
+        return { label: o.local === "succeeded" ? 1 : 0, weight: 1 };
+    if (o.fellBack)
+        return { label: 0, weight: 1 };
+    if (o.cloud === "failed")
+        return { label: 0, weight: CLOUD_ONLY_FAILURE_WEIGHT };
+    return null;
+}
+/** Labelled examples from routed outcomes (local AND cloud), oldest first. */
+export function localSuccessExamples(outcomes) {
+    return outcomes.flatMap((o) => {
+        const l = localSuccessLabel(o);
+        return l ? [{ input: o.turn, label: l.label, weight: l.weight }] : [];
+    });
+}
+//# sourceMappingURL=local_success.js.map

package/dist/ml/tasks/local_success.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local_success.js","sourceRoot":"","sources":["../../../src/ml/tasks/local_success.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAsBtD,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,cAAc;IACd,eAAe;IACf,aAAa;IACb,WAAW;IACX,OAAO;IACP,WAAW;IACX,aAAa;IACb,uBAAuB;IACvB,WAAW;CACH,CAAC;AAEX,yEAAyE;AACzE,MAAM,UAAU,oBAAoB,CAAC,CAAoB;IACvD,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC;IACpF,OAAO;QACL,QAAQ,CAAC,CAAC,CAAC,YAAY,EAAE,OAAO,CAAC;QACjC,QAAQ,CAAC,CAAC,CAAC,aAAa,EAAE,OAAO,CAAC;QAClC,IAAI;QACJ,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QACrB,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC;QAC1B,QAAQ,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,qBAAqB,IAAI,GAAG,CAAC,CAAC;QACxD,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACpB,CAAC;AACJ,CAAC;AAQD,MAAM,CAAC,MAAM,kBAAkB,GAA4C;IACzE,IAAI,EAAE,UAAU;IAChB,EAAE,EAAE,mBAAmB;IACvB,WAAW,EAAE,4CAA4C;IACzD,QAAQ,EAAE,EAAE,OAAO,EAAE,oBAAoB,EAAE,YAAY,EAAE,sBAAsB,EAAE;IACjF,OAAO,EAAE;QACP,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE;QAC7D,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE;KAC/D;IACD,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE;IACxB,MAAM,EAAE;QACN,MAAM,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;QAC7B,MAAM,EAAE,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;KACtG;CACF,CAAC;AAeF,yGAAyG;AACzG,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,CAAC;AAE7C;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAsB;IACtD,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC1E,IAAI,CAAC,CAAC,QAAQ;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC/C,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAC;IACjF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,oBAAoB,CAAC,QAAwC;IAC3E,OAAO,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5B,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/ml/tasks/run_anomaly.d.ts

@@ -0,0 +1,51 @@
+/**
+ * ml/tasks/run_anomaly.ts — `run.anomaly`: a run that cost, took or failed far
+ * outside its normal range. Flags runs to leave out of training and to surface as
+ * Insights.
+ *
+ * Two detectors, one answer: robust z (median/MAD over the whole history — "far
+ * from normal") and EWMA (the recent trend — "drifting away from lately"). The
+ * score is the larger of the two, so either one can flag.
+ */
+import type { Run } from "../../experience/types.js";
+import { EwmaModel, type EwmaOptions } from "../classical/ewma.js";
+import { RobustZModel, type RobustZOptions } from "../classical/robust_z.js";
+import type { MlPrediction, MlPredictor, MlSample, MlTask } from "../types.js";
+/** What a run cost and how it went — the host supplies cost; the rest is in the run log. */
+export interface RunMetrics {
+    costUsd: number;
+    durationMs: number;
+    toolFailures: number;
+}
+export interface RunAnomaly {
+    anomalous: boolean;
+    /** Normalised score: ≥ 1 is anomalous. */
+    score: number;
+}
+export declare const RUN_ANOMALY_METRICS: readonly ["cost", "duration", "toolFailures"];
+/** Fixed log scales (a $10 run, a one-hour run, 50 failures map to 1). */
+export declare function runAnomalyFeatures(m: RunMetrics): number[];
+/** Robust z over the history, combined with EWMA over its recent trend. */
+export declare class RunAnomalyDetector implements MlPredictor {
+    readonly population: RobustZModel;
+    readonly trend: EwmaModel;
+    constructor(population: RobustZModel, trend: EwmaModel);
+    /** Which metrics are out of range, per detector (z / threshold, ≥ 1 = out of range). */
+    explain(x: ArrayLike<number>): {
+        metric: (typeof RUN_ANOMALY_METRICS)[number];
+        population: number;
+        trend: number;
+    }[];
+    /** Fold a finished, non-anomalous run into the trend. */
+    observe(x: ArrayLike<number>): void;
+    predict(x: Float32Array): MlPrediction;
+}
+/** Fit both detectors on a chronological history of runs (as feature vectors). */
+export declare function fitRunAnomaly(samples: readonly MlSample[], opts?: {
+    robustZ?: RobustZOptions;
+    ewma?: EwmaOptions;
+}): RunAnomalyDetector;
+export declare const RUN_ANOMALY_TASK: MlTask<RunMetrics, RunAnomaly>;
+/** Duration and tool-failure count of an experience run, with the host's cost. */
+export declare function experienceRunMetrics(run: Run, costUsd?: number): RunMetrics;
+//# sourceMappingURL=run_anomaly.d.ts.map

package/dist/ml/tasks/run_anomaly.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run_anomaly.d.ts","sourceRoot":"","sources":["../../../src/ml/tasks/run_anomaly.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAE,SAAS,EAAW,KAAK,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC5E,OAAO,EAAiC,YAAY,EAAE,KAAK,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE5G,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/E,4FAA4F;AAC5F,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,OAAO,CAAC;IACnB,0CAA0C;IAC1C,KAAK,EAAE,MAAM,CAAC;CACf;AAED,eAAO,MAAM,mBAAmB,+CAAgD,CAAC;AAEjF,0EAA0E;AAC1E,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,EAAE,CAE1D;AAED,2EAA2E;AAC3E,qBAAa,kBAAmB,YAAW,WAAW;IAElD,QAAQ,CAAC,UAAU,EAAE,YAAY;IACjC,QAAQ,CAAC,KAAK,EAAE,SAAS;gBADhB,UAAU,EAAE,YAAY,EACxB,KAAK,EAAE,SAAS;IAG3B,wFAAwF;IACxF,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG;QAAE,MAAM,EAAE,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE;IAUpH,yDAAyD;IACzD,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI;IAInC,OAAO,CAAC,CAAC,EAAE,YAAY,GAAG,YAAY;CAIvC;AAED,kFAAkF;AAClF,wBAAgB,aAAa,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,EAAE,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,cAAc,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAO,GAAG,kBAAkB,CAE3I;AAED,eAAO,MAAM,gBAAgB,EAAE,MAAM,CAAC,UAAU,EAAE,UAAU,CAW3D,CAAC;AAEF,kFAAkF;AAClF,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,SAAI,GAAG,UAAU,CAMtE"}

package/dist/ml/tasks/run_anomaly.js

@@ -0,0 +1,60 @@
+import { fitEwma } from "../classical/ewma.js";
+import { anomalyConfidence, fitRobustZ } from "../classical/robust_z.js";
+import { logScale } from "../features.js";
+export const RUN_ANOMALY_METRICS = ["cost", "duration", "toolFailures"];
+/** Fixed log scales (a $10 run, a one-hour run, 50 failures map to 1). */
+export function runAnomalyFeatures(m) {
+    return [logScale(m.costUsd * 100, 1000), logScale(m.durationMs, 3_600_000), logScale(m.toolFailures, 50)];
+}
+/** Robust z over the history, combined with EWMA over its recent trend. */
+export class RunAnomalyDetector {
+    population;
+    trend;
+    constructor(population, trend) {
+        this.population = population;
+        this.trend = trend;
+    }
+    /** Which metrics are out of range, per detector (z / threshold, ≥ 1 = out of range). */
+    explain(x) {
+        const pz = this.population.zScores(x);
+        const tz = this.trend.zScores(x);
+        return RUN_ANOMALY_METRICS.map((metric, i) => ({
+            metric,
+            population: pz[i] / this.population.threshold,
+            trend: tz[i] / this.trend.threshold,
+        }));
+    }
+    /** Fold a finished, non-anomalous run into the trend. */
+    observe(x) {
+        this.trend.update(x);
+    }
+    predict(x) {
+        const score = Math.max(this.population.predict(x).scores[0], this.trend.predict(x).scores[0]);
+        return { scores: [score], confidence: anomalyConfidence(score) };
+    }
+}
+/** Fit both detectors on a chronological history of runs (as feature vectors). */
+export function fitRunAnomaly(samples, opts = {}) {
+    return new RunAnomalyDetector(fitRobustZ(samples, opts.robustZ), fitEwma(samples, opts.ewma));
+}
+export const RUN_ANOMALY_TASK = {
+    kind: "anomaly",
+    id: "run.anomaly",
+    description: "Did this run cost, take or fail far outside its normal range?",
+    features: { numeric: runAnomalyFeatures, numericNames: RUN_ANOMALY_METRICS },
+    engines: [
+        { tier: "local", engine: "classical", algorithm: "robust-z" },
+        { tier: "local", engine: "classical", algorithm: "ewma" },
+    ],
+    train: { minSamples: 5, fit: (samples) => fitRunAnomaly(samples) },
+    output: { decode: (p) => ({ anomalous: (p.scores[0] ?? 0) >= 1, score: p.scores[0] ?? 0 }) },
+};
+/** Duration and tool-failure count of an experience run, with the host's cost. */
+export function experienceRunMetrics(run, costUsd = 0) {
+    return {
+        costUsd,
+        durationMs: run.endedAt != null ? Math.max(0, run.endedAt - run.startedAt) : 0,
+        toolFailures: run.steps.filter((s) => s.outcome === "failed").length,
+    };
+}
+//# sourceMappingURL=run_anomaly.js.map

package/dist/ml/tasks/run_anomaly.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run_anomaly.js","sourceRoot":"","sources":["../../../src/ml/tasks/run_anomaly.ts"],"names":[],"mappings":"AAUA,OAAO,EAAa,OAAO,EAAoB,MAAM,sBAAsB,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAqC,MAAM,0BAA0B,CAAC;AAC5G,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAgB1C,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,cAAc,CAAU,CAAC;AAEjF,0EAA0E;AAC1E,MAAM,UAAU,kBAAkB,CAAC,CAAa;IAC9C,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC;AAC5G,CAAC;AAED,2EAA2E;AAC3E,MAAM,OAAO,kBAAkB;IAElB;IACA;IAFX,YACW,UAAwB,EACxB,KAAgB;QADhB,eAAU,GAAV,UAAU,CAAc;QACxB,UAAK,GAAL,KAAK,CAAW;IACxB,CAAC;IAEJ,wFAAwF;IACxF,OAAO,CAAC,CAAoB;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM;YACN,UAAU,EAAE,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS;YAC9C,KAAK,EAAE,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;SACrC,CAAC,CAAC,CAAC;IACN,CAAC;IAED,yDAAyD;IACzD,OAAO,CAAC,CAAoB;QAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,CAAe;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;QAChG,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;IACnE,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,UAAU,aAAa,CAAC,OAA4B,EAAE,OAAyD,EAAE;IACrH,OAAO,IAAI,kBAAkB,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAChG,CAAC;AAED,MAAM,CAAC,MAAM,gBAAgB,GAAmC;IAC9D,IAAI,EAAE,SAAS;IACf,EAAE,EAAE,aAAa;IACjB,WAAW,EAAE,+DAA+D;IAC5E,QAAQ,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,mBAAmB,EAAE;IAC5E,OAAO,EAAE;QACP,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE;QAC7D,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE;KAC1D;IACD,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE;IAClE,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;CAC3G,CAAC;AAEF,kFAAkF;AAClF,MAAM,UAAU,oBAAoB,CAAC,GAAQ,EAAE,OAAO,GAAG,CAAC;IACxD,OAAO;QACL,OAAO;QACP,UAAU,EAAE,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,YAAY,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,MAAM;KACrE,CAAC;AACJ,CAAC"}