@seanhogg/builderforce-memory-engine 2026.9.34 → 2026.10.2

package/dist/ml/run.d.ts

@@ -0,0 +1,103 @@
+/**
+ * ml/run.ts — the ONE runner: `runMlTask(id, input, ctx)`.
+ *
+ * Picks the first engine the inference mode allows that can answer (Local only:
+ * local tiers; Hybrid: local first, then the host's cloud port; Specific: exactly
+ * the named engine), returns `{ output, confidence, engine }`, and records the
+ * decision so routing can be evaluated later. The cloud is a PORT the host
+ * supplies — nothing here touches the network.
+ */
+import { type TextEmbedder } from "./features.js";
+import type { MlTaskRegistry } from "./registry.js";
+import { type InferenceMode, type MlEngineRef, type MlPrediction, type MlPredictor, type MlTask } from "./types.js";
+/** Fitted local models, per (task id, engine key). */
+export interface MlModelStore {
+    get(taskId: string, engine: string): MlPredictor | undefined;
+    set(taskId: string, engine: string, predictor: MlPredictor): void;
+}
+/** The plain in-process store. */
+export declare class InMemoryMlModels implements MlModelStore {
+    private readonly _m;
+    get(taskId: string, engine: string): MlPredictor | undefined;
+    set(taskId: string, engine: string, predictor: MlPredictor): void;
+}
+/** A cloud engine, supplied by the host (Builderforce.ai passes its gateway client). */
+export interface MlCloudPort {
+    run(request: {
+        taskId: string;
+        engine: MlEngineRef;
+        input: unknown;
+    }): Promise<MlPrediction>;
+}
+/** Why the runner moved past an engine. */
+export type MlSkipReason = "unavailable" | "low-confidence" | "error";
+/** One routing decision, recorded for eval. */
+export interface MlDecision {
+    taskId: string;
+    mode: InferenceMode;
+    /** The engine that answered (key), or null when none could. */
+    engine: string | null;
+    tier: "local" | "cloud" | null;
+    confidence: number | null;
+    /** Engines passed over before the answer, with why. */
+    skipped: {
+        engine: string;
+        reason: MlSkipReason;
+        detail?: string;
+    }[];
+}
+export interface MlDecisionSink {
+    record(decision: MlDecision): void;
+}
+/** A bounded in-memory decision log with a per-task summary. */
+export declare class MlDecisionLog implements MlDecisionSink {
+    readonly capacity: number;
+    private readonly _d;
+    constructor(capacity?: number);
+    record(decision: MlDecision): void;
+    list(): readonly MlDecision[];
+    /** Per task: how many runs, which engines answered, mean confidence, unanswered count. */
+    summary(): Record<string, {
+        runs: number;
+        byEngine: Record<string, number>;
+        unanswered: number;
+        meanConfidence: number | null;
+    }>;
+}
+export interface MlRunContext {
+    registry: MlTaskRegistry;
+    mode: InferenceMode;
+    /** For `specific`: the engine (ref or key) to use. */
+    engine?: MlEngineRef | string;
+    models?: MlModelStore;
+    embedder?: TextEmbedder;
+    cloud?: MlCloudPort;
+    /** Hybrid only: a local answer below this confidence defers to the cloud when it can answer. */
+    minConfidence?: number;
+    decisions?: MlDecisionSink;
+}
+export interface MlResult<O> {
+    output: O;
+    confidence: number;
+    engine: MlEngineRef;
+}
+/** No engine allowed by the mode could answer. */
+export declare class MlEngineUnavailableError extends Error {
+    readonly taskId: string;
+    readonly decision: MlDecision;
+    constructor(taskId: string, decision: MlDecision);
+}
+/**
+ * The task's engines the mode allows, in the order the runner tries them. Exhaustive:
+ * a mode string outside {@link InferenceMode} (a host passing a stale or mistyped
+ * setting) throws instead of being read as `specific`.
+ */
+export declare function candidateEngines(task: MlTask<any, any>, mode: InferenceMode, specific?: MlEngineRef | string): MlEngineRef[];
+/**
+ * Answer task `id` for `input` with the first engine the mode allows that can. An
+ * engine that throws (feature extraction or its own predict) is recorded as an
+ * `error` skip and the next allowed engine is tried — in Hybrid, the cloud. Throws
+ * {@link MlEngineUnavailableError}, carrying every engine's reason, only when none answers.
+ */
+export declare function runMlTask<O = unknown, I = unknown>(id: string, input: I, ctx: MlRunContext): Promise<MlResult<O>>;
+//# sourceMappingURL=run.d.ts.map

package/dist/ml/run.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/ml/run.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAmB,KAAK,YAAY,EAAE,MAAM,eAAe,CAAC;AACnE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,EAAa,KAAK,aAAa,EAAE,KAAK,WAAW,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,MAAM,EAAE,MAAM,YAAY,CAAC;AAE/H,sDAAsD;AACtD,MAAM,WAAW,YAAY;IAC3B,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;IAC7D,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI,CAAC;CACnE;AAED,kCAAkC;AAClC,qBAAa,gBAAiB,YAAW,YAAY;IACnD,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAkC;IACrD,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAG5D,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI;CAGlE;AAED,wFAAwF;AACxF,MAAM,WAAW,WAAW;IAC1B,GAAG,CAAC,OAAO,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CAC9F;AAED,2CAA2C;AAC3C,MAAM,MAAM,YAAY,GAAG,aAAa,GAAG,gBAAgB,GAAG,OAAO,CAAC;AAEtE,+CAA+C;AAC/C,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,aAAa,CAAC;IACpB,+DAA+D;IAC/D,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,IAAI,EAAE,OAAO,GAAG,OAAO,GAAG,IAAI,CAAC;IAC/B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,uDAAuD;IACvD,OAAO,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CACtE;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,CAAC,QAAQ,EAAE,UAAU,GAAG,IAAI,CAAC;CACpC;AAED,gEAAgE;AAChE,qBAAa,aAAc,YAAW,cAAc;IAEtC,QAAQ,CAAC,QAAQ;IAD7B,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAoB;gBAClB,QAAQ,SAAM;IAEnC,MAAM,CAAC,QAAQ,EAAE,UAAU,GAAG,IAAI;IAKlC,IAAI,IAAI,SAAS,UAAU,EAAE;IAI7B,0FAA0F;IAC1F,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;CAkBjI;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,IAAI,EAAE,aAAa,CAAC;IACpB,sDAAsD;IACtD,MAAM,CAAC,EAAE,WAAW,GAAG,MAAM,CAAC;IAC9B,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,gGAAgG;IAChG,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,cAAc,CAAC;CAC5B;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC;IACzB,MAAM,EAAE,CAAC,CAAC;IACV,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,WAAW,CAAC;CACrB;AAED,kDAAkD;AAClD,qBAAa,wBAAyB,SAAQ,KAAK;IAE/C,QAAQ,CAAC,MAAM,EAAE,MAAM;IACvB,QAAQ,CAAC,QAAQ,EAAE,UAAU;gBADpB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,UAAU;CAShC;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,QAAQ,CAAC,EAAE,WAAW,GAAG,MAAM,GAAG,WAAW,EAAE,CAkB5H;AAID;;;;;GAKG;AACH,wBAAsB,SAAS,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAiEvH"}

package/dist/ml/run.js

@@ -0,0 +1,169 @@
+/**
+ * ml/run.ts — the ONE runner: `runMlTask(id, input, ctx)`.
+ *
+ * Picks the first engine the inference mode allows that can answer (Local only:
+ * local tiers; Hybrid: local first, then the host's cloud port; Specific: exactly
+ * the named engine), returns `{ output, confidence, engine }`, and records the
+ * decision so routing can be evaluated later. The cloud is a PORT the host
+ * supplies — nothing here touches the network.
+ */
+import { extractFeatures } from "./features.js";
+import { engineKey } from "./types.js";
+/** The plain in-process store. */
+export class InMemoryMlModels {
+    _m = new Map();
+    get(taskId, engine) {
+        return this._m.get(`${taskId}|${engine}`);
+    }
+    set(taskId, engine, predictor) {
+        this._m.set(`${taskId}|${engine}`, predictor);
+    }
+}
+/** A bounded in-memory decision log with a per-task summary. */
+export class MlDecisionLog {
+    capacity;
+    _d = [];
+    constructor(capacity = 500) {
+        this.capacity = capacity;
+    }
+    record(decision) {
+        this._d.push(decision);
+        if (this._d.length > this.capacity)
+            this._d.splice(0, this._d.length - this.capacity);
+    }
+    list() {
+        return this._d;
+    }
+    /** Per task: how many runs, which engines answered, mean confidence, unanswered count. */
+    summary() {
+        const out = {};
+        const sums = {};
+        for (const d of this._d) {
+            const t = (out[d.taskId] ??= { runs: 0, byEngine: {}, unanswered: 0, meanConfidence: null });
+            t.runs++;
+            if (d.engine == null) {
+                t.unanswered++;
+                continue;
+            }
+            t.byEngine[d.engine] = (t.byEngine[d.engine] ?? 0) + 1;
+            const c = (sums[d.taskId] ??= { s: 0, n: 0 });
+            c.s += d.confidence ?? 0;
+            c.n++;
+            t.meanConfidence = c.s / c.n;
+        }
+        return out;
+    }
+}
+/** No engine allowed by the mode could answer. */
+export class MlEngineUnavailableError extends Error {
+    taskId;
+    decision;
+    constructor(taskId, decision) {
+        super(`runMlTask(${taskId}): no engine could answer in '${decision.mode}' mode (${decision.skipped.map((s) => `${s.engine}: ${s.reason}${s.detail ? ` (${s.detail})` : ""}`).join(", ") || "none allowed"})`);
+        this.taskId = taskId;
+        this.decision = decision;
+        this.name = "MlEngineUnavailableError";
+    }
+}
+/**
+ * The task's engines the mode allows, in the order the runner tries them. Exhaustive:
+ * a mode string outside {@link InferenceMode} (a host passing a stale or mistyped
+ * setting) throws instead of being read as `specific`.
+ */
+export function candidateEngines(task, mode, specific) {
+    switch (mode) {
+        case "local-only":
+            return task.engines.filter((e) => e.tier === "local");
+        case "hybrid":
+            return [...task.engines.filter((e) => e.tier === "local"), ...task.engines.filter((e) => e.tier === "cloud")];
+        case "specific": {
+            if (specific == null)
+                throw new Error(`runMlTask(${task.id}): 'specific' mode needs ctx.engine`);
+            const key = typeof specific === "string" ? specific : engineKey(specific);
+            const match = task.engines.filter((e) => engineKey(e) === key);
+            if (match.length === 0)
+                throw new Error(`runMlTask(${task.id}): engine '${key}' is not one of this task's engines`);
+            return match;
+        }
+        default: {
+            const unknown = mode;
+            throw new Error(`runMlTask(${task.id}): unknown inference mode '${String(unknown)}'`);
+        }
+    }
+}
+const errorDetail = (error) => (error instanceof Error ? error.message : String(error));
+/**
+ * Answer task `id` for `input` with the first engine the mode allows that can. An
+ * engine that throws (feature extraction or its own predict) is recorded as an
+ * `error` skip and the next allowed engine is tried — in Hybrid, the cloud. Throws
+ * {@link MlEngineUnavailableError}, carrying every engine's reason, only when none answers.
+ */
+export async function runMlTask(id, input, ctx) {
+    const task = ctx.registry.require(id);
+    const engines = candidateEngines(task, ctx.mode, ctx.engine);
+    const skipped = [];
+    let features = null;
+    let featureError = null;
+    let deferred = null;
+    const finish = (ref, p) => {
+        ctx.decisions?.record({ taskId: id, mode: ctx.mode, engine: engineKey(ref), tier: ref.tier, confidence: p.confidence, skipped });
+        return { output: task.output.decode(p), confidence: p.confidence, engine: ref };
+    };
+    for (let i = 0; i < engines.length; i++) {
+        const ref = engines[i];
+        const key = engineKey(ref);
+        if (ref.tier === "local") {
+            const predictor = ctx.models?.get(id, key);
+            if (!predictor) {
+                skipped.push({ engine: key, reason: "unavailable" });
+                continue;
+            }
+            // Extract once; a failure (e.g. no embedder) fails every local engine alike, so
+            // it is remembered rather than retried per engine.
+            if (!features && featureError == null) {
+                try {
+                    features = await extractFeatures(task.features, input, ctx.embedder);
+                }
+                catch (error) {
+                    featureError = error;
+                }
+            }
+            if (!features) {
+                skipped.push({ engine: key, reason: "error", detail: `features: ${errorDetail(featureError)}` });
+                continue;
+            }
+            let p;
+            try {
+                p = predictor.predict(features);
+            }
+            catch (error) {
+                skipped.push({ engine: key, reason: "error", detail: errorDetail(error) });
+                continue;
+            }
+            const cloudLater = ctx.mode === "hybrid" && !!ctx.cloud && engines.slice(i + 1).some((e) => e.tier === "cloud");
+            if (ctx.minConfidence != null && p.confidence < ctx.minConfidence && cloudLater) {
+                skipped.push({ engine: key, reason: "low-confidence", detail: p.confidence.toFixed(3) });
+                deferred ??= { ref, p };
+                continue;
+            }
+            return finish(ref, p);
+        }
+        if (!ctx.cloud) {
+            skipped.push({ engine: key, reason: "unavailable" });
+            continue;
+        }
+        try {
+            return finish(ref, await ctx.cloud.run({ taskId: id, engine: ref, input }));
+        }
+        catch (error) {
+            skipped.push({ engine: key, reason: "error", detail: errorDetail(error) });
+        }
+    }
+    // The cloud could not answer after a low-confidence local one: the local answer stands.
+    if (deferred)
+        return finish(deferred.ref, deferred.p);
+    const decision = { taskId: id, mode: ctx.mode, engine: null, tier: null, confidence: null, skipped };
+    ctx.decisions?.record(decision);
+    throw new MlEngineUnavailableError(id, decision);
+}
+//# sourceMappingURL=run.js.map

package/dist/ml/run.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.js","sourceRoot":"","sources":["../../src/ml/run.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,eAAe,EAAqB,MAAM,eAAe,CAAC;AAEnE,OAAO,EAAE,SAAS,EAA0F,MAAM,YAAY,CAAC;AAQ/H,kCAAkC;AAClC,MAAM,OAAO,gBAAgB;IACV,EAAE,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,GAAG,CAAC,MAAc,EAAE,MAAc;QAChC,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IACD,GAAG,CAAC,MAAc,EAAE,MAAc,EAAE,SAAsB;QACxD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,MAAM,EAAE,EAAE,SAAS,CAAC,CAAC;IAChD,CAAC;CACF;AA0BD,gEAAgE;AAChE,MAAM,OAAO,aAAa;IAEH;IADJ,EAAE,GAAiB,EAAE,CAAC;IACvC,YAAqB,WAAW,GAAG;QAAd,aAAQ,GAAR,QAAQ,CAAM;IAAG,CAAC;IAEvC,MAAM,CAAC,QAAoB;QACzB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxF,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,0FAA0F;IAC1F,OAAO;QACL,MAAM,GAAG,GAA0H,EAAE,CAAC;QACtI,MAAM,IAAI,GAA6C,EAAE,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;YAC7F,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACrB,CAAC,CAAC,UAAU,EAAE,CAAC;gBACf,SAAS;YACX,CAAC;YACD,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAqBD,kDAAkD;AAClD,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IAEtC;IACA;IAFX,YACW,MAAc,EACd,QAAoB;QAE7B,KAAK,CACH,aAAa,MAAM,iCAAiC,QAAQ,CAAC,IAAI,WAC/D,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,cAC3G,GAAG,CACJ,CAAC;QAPO,WAAM,GAAN,MAAM,CAAQ;QACd,aAAQ,GAAR,QAAQ,CAAY;QAO7B,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAsB,EAAE,IAAmB,EAAE,QAA+B;IAC3G,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY;YACf,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QACxD,KAAK,QAAQ;YACX,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC;QAChH,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,IAAI,QAAQ,IAAI,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,qCAAqC,CAAC,CAAC;YACjG,MAAM,GAAG,GAAG,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,cAAc,GAAG,qCAAqC,CAAC,CAAC;YACpH,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,OAAO,GAAU,IAAI,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,8BAA8B,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,KAAc,EAAU,EAAE,CAAC,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AAEzG;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAA2B,EAAU,EAAE,KAAQ,EAAE,GAAiB;IAC/F,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAO,EAAE,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7D,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,QAAQ,GAAwB,IAAI,CAAC;IACzC,IAAI,YAAY,GAAY,IAAI,CAAC;IACjC,IAAI,QAAQ,GAAiD,IAAI,CAAC;IAElE,MAAM,MAAM,GAAG,CAAC,GAAgB,EAAE,CAAe,EAAe,EAAE;QAChE,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACjI,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAClF,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACxB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC3C,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;gBACrD,SAAS;YACX,CAAC;YACD,gFAAgF;YAChF,mDAAmD;YACnD,IAAI,CAAC,QAAQ,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;gBACtC,IAAI,CAAC;oBACH,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACvE,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,YAAY,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,aAAa,WAAW,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjG,SAAS;YACX,CAAC;YACD,IAAI,CAAe,CAAC;YACpB,IAAI,CAAC;gBACH,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC3E,SAAS;YACX,CAAC;YACD,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YAChH,IAAI,GAAG,CAAC,aAAa,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,aAAa,IAAI,UAAU,EAAE,CAAC;gBAChF,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzF,QAAQ,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YACD,OAAO,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QACD,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9E,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,wFAAwF;IACxF,IAAI,QAAQ;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAe,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IACjH,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,MAAM,IAAI,wBAAwB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;AACnD,CAAC"}

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

@@ -0,0 +1,127 @@
+/**
+ * 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,
+     * and so is an UNSCORED one (`runs === 0` — never run is unknown, not bad).
+     */
+    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>;
+    /**
+     * Documents the model has ALREADY learned. They seed the de-duplication index, so a
+     * pending document that only repeats one of them is dropped (reported `of` that
+     * one); they are never in `kept`. Each is embedded once per call, so this is
+     * bounded — {@link curatePendingExperience} keeps the {@link CURATION_KNOWN_LIMIT}
+     * most recently learned.
+     */
+    known?: readonly ExperienceDocument[];
+}
+/**
+ * How many already-learned documents curation de-duplicates against: the most
+ * recently learned ones. Each costs one CPU embed per curation call, and a
+ * repeat of something learned long ago is cheap to relearn, so a recent window is the
+ * trade — 200 embeds of a small Evermind take seconds on a laptop CPU.
+ */
+export declare const CURATION_KNOWN_LIMIT = 200;
+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 already-learned one (`known`) or 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>;
+/** What {@link curatePendingExperience} reads: the experience snapshot's raw records. */
+export interface ExperienceCurationSource {
+    episodes: Episode[];
+    skills: Skill[];
+    runs: readonly Run[];
+}
+/**
+ * The whole curation step a host runs in front of the adaptation passes, so every
+ * host wires it the same way: train `experience.quality` on the run outcomes there
+ * are (it stays untrained below its `minSamples`, and then nothing is dropped for
+ * quality), then {@link curateExperience} the pending documents with it,
+ * de-duplicating against each other and against `known` — the already-learned
+ * documents, MOST RECENTLY LEARNED FIRST; only the first {@link CURATION_KNOWN_LIMIT}
+ * are embedded, so a host can pass its whole ledger.
+ */
+export declare function curatePendingExperience(pending: readonly ExperienceDocument[], source: ExperienceCurationSource, opts: {
+    embedder: TextEmbedder;
+    known?: readonly ExperienceDocument[];
+    dedupeThreshold?: number;
+    minPHigh?: number;
+}): 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,EAAY,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE7D,OAAO,EAAyD,KAAK,YAAY,EAAE,MAAM,WAAW,CAAC;AACrG,OAAO,EAAe,KAAK,cAAc,EAAE,MAAM,aAAa,CAAC;AAC/D,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,CAwBrF,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;;;;OAIG;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;IAC9B;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;CACvC;AAED;;;;;GAKG;AACH,eAAO,MAAM,oBAAoB,MAAM,CAAC;AAExC,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,CA8C1H;AAED,yFAAyF;AACzF,MAAM,WAAW,wBAAwB;IACvC,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,IAAI,EAAE,SAAS,GAAG,EAAE,CAAC;CACtB;AAED;;;;;;;;GAQG;AACH,wBAAsB,uBAAuB,CAC3C,OAAO,EAAE,SAAS,kBAAkB,EAAE,EACtC,MAAM,EAAE,wBAAwB,EAChC,IAAI,EAAE;IAAE,QAAQ,EAAE,YAAY,CAAC;IAAC,KAAK,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;IAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GACnH,OAAO,CAAC,cAAc,CAAC,CAoBzB"}

package/dist/ml/tasks/experience.js

@@ -0,0 +1,213 @@
+/**
+ * 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 { logScale } from "../features.js";
+import { MlTaskRegistry } from "../registry.js";
+import { InMemoryMlModels, MlEngineUnavailableError, runMlTask } from "../run.js";
+import { trainMlTask } from "../train.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,
+        // No success/failure rate: the label IS `succeeded / runs >= 0.5`, so a rate
+        // feature would leak it — the model would learn the label, not the procedure.
+        numeric: (i) => [logScale(i.steps, 50), logScale(i.runs, 20)],
+        numericNames: ["steps", "runs"],
+    },
+    engines: [
+        { tier: "local", engine: "classical", algorithm: "knn" },
+        { tier: "local", engine: "classical", algorithm: "logistic" },
+    ],
+    // Below 12 labelled procedures the task stays untrained and curation keeps
+    // everything. At 12, after the 20% holdout ≈10 remain to fit, both classes can have
+    // several members, and kNN votes with k = ⌊√n⌋ = 3 neighbours rather than the whole
+    // set — with fewer, every point votes and the answer collapses to the class prior.
+    train: { minSamples: 12 },
+    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) };
+    }
+}
+/**
+ * How many already-learned documents curation de-duplicates against: the most
+ * recently learned ones. Each costs one CPU embed per curation call, and a
+ * repeat of something learned long ago is cheap to relearn, so a recent window is the
+ * trade — 200 embeds of a small Evermind take seconds on a laptop CPU.
+ */
+export const CURATION_KNOWN_LIMIT = 200;
+/** 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 already-learned one (`known`) or 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);
+    /** Index position → document id: the known documents first, then each kept one. */
+    const indexed = [];
+    const kept = [];
+    const dropped = [];
+    const qctx = opts.quality ? { ...opts.quality.ctx, embedder } : null;
+    const embedDoc = (doc) => embedder.embed(EXPERIENCE_DEDUPE_TASK.features.text(doc));
+    for (const doc of opts.known ?? []) {
+        index.add(await embedDoc(doc));
+        indexed.push(doc.id);
+    }
+    for (const doc of docs) {
+        if (opts.exclude?.has(doc.id)) {
+            dropped.push({ id: doc.id, reason: "excluded" });
+            continue;
+        }
+        if (opts.quality && qctx) {
+            const input = opts.quality.input(doc);
+            // Never run ⇒ no outcome to judge it by: keep it rather than let a guess drop it.
+            if (input.runs > 0) {
+                try {
+                    const r = await runMlTask(EXPERIENCE_QUALITY_TASK.id, input, 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 embedDoc(doc);
+        const d = EXPERIENCE_DEDUPE_TASK.output.decode(index.predict(x));
+        if (d.duplicate) {
+            dropped.push({ id: doc.id, reason: "duplicate", of: indexed[d.nearest], score: d.similarity });
+            continue;
+        }
+        index.add(x);
+        indexed.push(doc.id);
+        kept.push(doc);
+    }
+    return { kept, dropped };
+}
+/**
+ * The whole curation step a host runs in front of the adaptation passes, so every
+ * host wires it the same way: train `experience.quality` on the run outcomes there
+ * are (it stays untrained below its `minSamples`, and then nothing is dropped for
+ * quality), then {@link curateExperience} the pending documents with it,
+ * de-duplicating against each other and against `known` — the already-learned
+ * documents, MOST RECENTLY LEARNED FIRST; only the first {@link CURATION_KNOWN_LIMIT}
+ * are embedded, so a host can pass its whole ledger.
+ */
+export async function curatePendingExperience(pending, source, opts) {
+    const known = opts.known?.slice(0, CURATION_KNOWN_LIMIT);
+    const embedder = memoEmbedder(opts.embedder);
+    const inputs = experienceQualityInputs(source.episodes, source.skills, source.runs);
+    const byId = new Map(inputs.map((i) => [i.doc.id, i]));
+    const registry = new MlTaskRegistry();
+    registry.register(EXPERIENCE_QUALITY_TASK);
+    const models = new InMemoryMlModels();
+    await trainMlTask(EXPERIENCE_QUALITY_TASK, experienceQualityExamples(inputs), { embedder, models });
+    return curateExperience(pending, {
+        embedder,
+        ...(known ? { known } : {}),
+        ...(opts.dedupeThreshold != null ? { dedupeThreshold: opts.dedupeThreshold } : {}),
+        quality: {
+            ctx: { registry, mode: "local-only", models },
+            // A document with no joined input (not in the snapshot) counts as never run.
+            input: (doc) => byId.get(doc.id) ?? { doc, steps: 0, runs: 0, succeeded: 0, failed: 0 },
+            ...(opts.minPHigh != null ? { minPHigh: opts.minPHigh } : {}),
+        },
+    });
+}
+//# 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,QAAQ,EAAqB,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,wBAAwB,EAAE,SAAS,EAAqB,MAAM,WAAW,CAAC;AACrG,OAAO,EAAE,WAAW,EAAuB,MAAM,aAAa,CAAC;AAsB/D,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,6EAA6E;QAC7E,8EAA8E;QAC9E,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,CAAC;QAC7D,YAAY,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC;KAChC;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,2EAA2E;IAC3E,oFAAoF;IACpF,oFAAoF;IACpF,mFAAmF;IACnF,KAAK,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;IACzB,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;AA+BD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAOxC,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,mFAAmF;IACnF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,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;IACrE,MAAM,QAAQ,GAAG,CAAC,GAAuB,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,sBAAsB,CAAC,QAAQ,CAAC,IAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAEzG,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QACnC,KAAK,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,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,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACtC,kFAAkF;YAClF,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC;oBACH,MAAM,CAAC,GAAG,MAAM,SAAS,CAAoB,uBAAuB,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBACtF,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC;wBACpD,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;wBAC3E,SAAS;oBACX,CAAC;gBACH,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,IAAI,CAAC,CAAC,KAAK,YAAY,wBAAwB,CAAC;wBAAE,MAAM,KAAK,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,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,OAAO,CAAC,CAAC,CAAC,OAAO,CAAE,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YAChG,SAAS;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AASD;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,OAAsC,EACtC,MAAgC,EAChC,IAAoH;IAEpH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACzD,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,IAAI,cAAc,EAAE,CAAC;IACtC,QAAQ,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;IACtC,MAAM,WAAW,CAAC,uBAAuB,EAAE,yBAAyB,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IACpG,OAAO,gBAAgB,CAAC,OAAO,EAAE;QAC/B,QAAQ;QACR,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAClF,OAAO,EAAE;YACP,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE;YAC7C,6EAA6E;YAC7E,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YACvF,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9D;KACF,CAAC,CAAC;AACL,CAAC"}