melete-ai 0.88.2

package/dist/multiobjective.d.ts

@@ -0,0 +1,42 @@
+/**
+ * MULTI-OBJECTIVE — real problems rarely have ONE goal. A pharma formulation must be more POTENT *and* more
+ * STABLE *and* cheaper; a fraud model must catch more fraud *and* decline fewer good customers. These trade
+ * off — there is no single best, but a PARETO FRONT of best-possible compromises.
+ *
+ * MULTI-OBJECTIVE finds that front from hand-measured results: you score each experiment on N objectives,
+ * and Melete (a) computes the exact non-dominated set and (b) proposes the next experiment to widen the
+ * front, by scalarising the objectives with a deterministically-varying weight vector so successive
+ * proposals probe different trade-offs. Deterministic ⇒ reproducible + signable like every Melete run.
+ *
+ * Honest by construction (DIAKRISIS): the Pareto front (dominance) is EXACT. The proposer uses weighted-sum
+ * scalarisation with rotating weights — simple, robust, and it reliably spreads along the front; it is not
+ * guaranteed to recover points on a deeply CONCAVE front (a known limitation of linear scalarisation, the
+ * honest trade-off for a dependency-free deterministic engine). The front it reports is always exact.
+ */
+import { type Space, type Experiment } from "./space.js";
+export interface MGoal {
+    name?: string;
+    goal: "maximize" | "minimize";
+}
+export interface MObservation {
+    experiment: Experiment;
+    values: number[];
+}
+/** Does `a` Pareto-dominate `b` across all objectives (≥ in every one, > in at least one, in goal direction)? */
+export declare function dominates(a: number[], b: number[], goals: ReadonlyArray<MGoal>): boolean;
+/** The exact non-dominated set — the achievable best trade-offs. */
+export declare function paretoFront(obs: ReadonlyArray<MObservation>, goals: ReadonlyArray<MGoal>): MObservation[];
+/**
+ * Propose the next experiment to widen the Pareto front. Scalarises the N objectives with a weight vector
+ * that rotates with the run, so successive calls probe different corners of the trade-off space.
+ */
+export declare function proposeNextMulti(space: Space, obs: ReadonlyArray<MObservation>, goals: ReadonlyArray<MGoal>, seed?: number): Experiment;
+export declare function multiObjectiveGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=multiobjective.d.ts.map

package/dist/multiobjective.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multiobjective.d.ts","sourceRoot":"","sources":["../src/multiobjective.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAAO,MAAM,YAAY,CAAC;AAG9D,MAAM,WAAW,KAAK;IAAG,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAAA;CAAE;AACvE,MAAM,WAAW,YAAY;IAAG,UAAU,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE;AAE1E,iHAAiH;AACjH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,GAAG,OAAO,CASxF;AAED,oEAAoE;AACpE,wBAAgB,WAAW,CAAC,GAAG,EAAE,aAAa,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,GAAG,YAAY,EAAE,CAGzG;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,IAAI,SAAI,GAAG,UAAU,CAiBlI;AAGD,wBAAgB,sBAAsB,IAAI;IAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CA4C3H"}

package/dist/multiobjective.js

@@ -0,0 +1,123 @@
+/**
+ * MULTI-OBJECTIVE — real problems rarely have ONE goal. A pharma formulation must be more POTENT *and* more
+ * STABLE *and* cheaper; a fraud model must catch more fraud *and* decline fewer good customers. These trade
+ * off — there is no single best, but a PARETO FRONT of best-possible compromises.
+ *
+ * MULTI-OBJECTIVE finds that front from hand-measured results: you score each experiment on N objectives,
+ * and Melete (a) computes the exact non-dominated set and (b) proposes the next experiment to widen the
+ * front, by scalarising the objectives with a deterministically-varying weight vector so successive
+ * proposals probe different trade-offs. Deterministic ⇒ reproducible + signable like every Melete run.
+ *
+ * Honest by construction (DIAKRISIS): the Pareto front (dominance) is EXACT. The proposer uses weighted-sum
+ * scalarisation with rotating weights — simple, robust, and it reliably spreads along the front; it is not
+ * guaranteed to recover points on a deeply CONCAVE front (a known limitation of linear scalarisation, the
+ * honest trade-off for a dependency-free deterministic engine). The front it reports is always exact.
+ */
+import { lcg } from "./space.js";
+import { proposeNext } from "./interactive.js";
+/** Does `a` Pareto-dominate `b` across all objectives (≥ in every one, > in at least one, in goal direction)? */
+export function dominates(a, b, goals) {
+    let strictly = false;
+    for (let i = 0; i < goals.length; i++) {
+        const dir = goals[i].goal === "minimize" ? -1 : 1;
+        const av = dir * a[i], bv = dir * b[i];
+        if (av < bv)
+            return false; // worse on some objective → cannot dominate
+        if (av > bv)
+            strictly = true; // strictly better on at least one
+    }
+    return strictly;
+}
+/** The exact non-dominated set — the achievable best trade-offs. */
+export function paretoFront(obs, goals) {
+    const valid = (obs ?? []).filter((o) => o && Array.isArray(o.values) && o.values.length === goals.length && o.values.every((v) => Number.isFinite(v)));
+    return valid.filter((o, i) => !valid.some((p, j) => j !== i && dominates(p.values, o.values, goals)));
+}
+/**
+ * Propose the next experiment to widen the Pareto front. Scalarises the N objectives with a weight vector
+ * that rotates with the run, so successive calls probe different corners of the trade-off space.
+ */
+export function proposeNextMulti(space, obs, goals, seed = 1) {
+    const valid = (obs ?? []).filter((o) => o && o.experiment && Array.isArray(o.values) && o.values.length === goals.length && o.values.every((v) => Number.isFinite(v)));
+    const t = valid.length;
+    if (t === 0 || goals.length === 0)
+        return proposeNext(space, [], "maximize", seed);
+    // deterministic rotating weights (a different trade-off each step)
+    const rnd = lcg(((seed >>> 0) || 1) + t * 131 + 7);
+    const w = goals.map(() => rnd() + 1e-3);
+    const wsum = w.reduce((a, b) => a + b, 0) || 1;
+    for (let i = 0; i < w.length; i++)
+        w[i] /= wsum;
+    // per-objective range for fair normalisation across different scales
+    const mins = goals.map((_, i) => Math.min(...valid.map((o) => o.values[i])));
+    const maxs = goals.map((_, i) => Math.max(...valid.map((o) => o.values[i])));
+    const scalar = (vals) => {
+        let s = 0;
+        for (let i = 0; i < goals.length; i++) {
+            const dir = goals[i].goal === "minimize" ? -1 : 1;
+            const rng = (maxs[i] - mins[i]) || 1;
+            s += w[i] * dir * (vals[i] - mins[i]) / rng;
+        }
+        return s;
+    };
+    const sObs = valid.map((o) => ({ experiment: o.experiment, value: scalar(o.values) }));
+    return proposeNext(space, sObs, "maximize", seed + t);
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+export function multiObjectiveGauntlet() {
+    const goals = [{ name: "f1", goal: "maximize" }, { name: "f2", goal: "maximize" }];
+    // a clean trade-off: f1 peaks at x=2, f2 peaks at x=8 → Pareto front is x ∈ [2,8]
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 10 }] };
+    const f = (x) => [-((x - 2) ** 2), -((x - 8) ** 2)];
+    // DOMINATES: [2,2] dominates [1,1] (both maximise); neither dominates on a trade-off
+    const dom = dominates([2, 2], [1, 1], goals) === true && dominates([2, 1], [1, 2], goals) === false && dominates([1, 1], [2, 2], goals) === false;
+    // PARETO-FRONT: dominated points excluded
+    const pts = [
+        { experiment: { x: 0 }, values: [-4, -64] }, // dominated
+        { experiment: { x: 2 }, values: [0, -36] }, // on front (best f1)
+        { experiment: { x: 5 }, values: [-9, -9] }, // on front (balanced)
+        { experiment: { x: 8 }, values: [-36, 0] }, // on front (best f2)
+        { experiment: { x: 5.0 }, values: [-16, -16] }, // dominated by x=5
+    ];
+    const front = paretoFront(pts, goals);
+    const frontOK = front.length === 3 && front.some((o) => o.experiment.x === 2) && front.some((o) => o.experiment.x === 8) && !front.some((o) => o.experiment.x === 0);
+    // PROPOSE: valid in-bounds
+    const next = proposeNextMulti(space, pts, goals, 3);
+    const proposeOK = typeof next.x === "number" && next.x >= 0 && next.x <= 10;
+    // SPREAD: a guided multi-objective loop discovers a SPREAD of trade-offs (not one point)
+    const obs = [];
+    for (let i = 0; i < 50; i++) {
+        const e = proposeNextMulti(space, obs, goals, 7);
+        const v = f(e.x ?? 0);
+        obs.push({ experiment: e, values: v });
+    }
+    const fr = paretoFront(obs, goals);
+    const xs = fr.map((o) => o.experiment.x ?? 0);
+    const spread = (Math.max(...xs) - Math.min(...xs)) > 3 && fr.length >= 3; // front spans much of [2,8]
+    // MIXED goals (one max, one min) works
+    const mixed = [{ goal: "maximize" }, { goal: "minimize" }];
+    const mdom = dominates([5, 1], [4, 2], mixed) === true; // higher f1 + lower f2 dominates
+    // DETERMINISTIC
+    const det = JSON.stringify(proposeNextMulti(space, pts, goals, 9)) === JSON.stringify(proposeNextMulti(space, pts, goals, 9));
+    // TOTAL
+    const total = (() => { try {
+        paretoFront(null, goals);
+        proposeNextMulti(space, null, goals);
+        dominates([], [], []);
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "DOMINANCE", pass: dom, detail: "Pareto-dominance is correct (strictly-better-in-one, not-worse-in-any); trade-offs do not dominate" },
+        { name: "PARETO-FRONT-EXACT", pass: frontOK, detail: `the non-dominated set is exact (kept 3 front points, dropped the dominated ones)` },
+        { name: "PROPOSE-VALID", pass: proposeOK, detail: "proposes a valid in-bounds next experiment" },
+        { name: "SPREADS-THE-FRONT", pass: spread, detail: `a guided multi-objective loop discovers a spread of trade-offs (front size ${fr.length}, x-span ${(Math.max(...xs) - Math.min(...xs)).toFixed(1)})` },
+        { name: "MIXED-MAX-MIN", pass: mdom, detail: "handles a mix of maximise + minimise objectives" },
+        { name: "DETERMINISTIC", pass: det, detail: "same seed + history → same proposal" },
+        { name: "TOTAL", pass: total, detail: "null / empty / mismatched inputs never throw" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=multiobjective.js.map

package/dist/multiobjective.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"multiobjective.js","sourceRoot":"","sources":["../src/multiobjective.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAA+B,GAAG,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAK/C,iHAAiH;AACjH,MAAM,UAAU,SAAS,CAAC,CAAW,EAAE,CAAW,EAAE,KAA2B;IAC7E,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,KAAK,CAAC,CAAO,4CAA4C;QAC7E,IAAI,EAAE,GAAG,EAAE;YAAE,QAAQ,GAAG,IAAI,CAAC,CAAI,kCAAkC;IACrE,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,WAAW,CAAC,GAAgC,EAAE,KAA2B;IACvF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvJ,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AACxG,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY,EAAE,GAAgC,EAAE,KAA2B,EAAE,IAAI,GAAG,CAAC;IACpH,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvK,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IACnF,mEAAmE;IACnE,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACnD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;IAAC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACzI,qEAAqE;IACrE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,CAAC,IAAc,EAAE,EAAE;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAAC,CAAC;QAChL,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACvF,OAAO,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;AACxD,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,sBAAsB;IACpC,MAAM,KAAK,GAAY,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAC5F,kFAAkF;IAClF,MAAM,KAAK,GAAU,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC9E,MAAM,CAAC,GAAG,CAAC,CAAS,EAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEtE,qFAAqF;IACrF,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,KAAK,CAAC;IAClJ,0CAA0C;IAC1C,MAAM,GAAG,GAAmB;QAC1B,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAI,YAAY;QAC3D,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAK,qBAAqB;QACpE,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAK,sBAAsB;QACrE,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAK,qBAAqB;QACpE,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,mBAAmB;KACpE,CAAC;IACF,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACrK,2BAA2B;IAC3B,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,OAAO,IAAI,CAAC,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5E,yFAAyF;IACzF,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IACjJ,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAAC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClF,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,CAAG,4BAA4B;IACxG,uCAAuC;IACvC,MAAM,KAAK,GAAY,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC,CAAG,iCAAiC;IAC3F,gBAAgB;IAChB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9H,QAAQ;IACR,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,WAAW,CAAC,IAAa,EAAE,KAAK,CAAC,CAAC;QAAC,gBAAgB,CAAC,KAAK,EAAE,IAAa,EAAE,KAAK,CAAC,CAAC;QAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAElL,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,oGAAoG,EAAE;QAC9I,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kFAAkF,EAAE;QACzI,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,4CAA4C,EAAE;QAChG,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,8EAA8E,EAAE,CAAC,MAAM,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE;QACzM,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,iDAAiD,EAAE;QAChG,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,qCAAqC,EAAE;QACnF,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,8CAA8C,EAAE;KACvF,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;AAClE,CAAC"}

package/dist/noise.d.ts

@@ -0,0 +1,45 @@
+/**
+ * NOISE — the replication advisor. Hand-measured scores are NOISY (a lab assay drifts, a taste test is
+ * subjective, a benchmark jitters). No simple optimizer tells you "that reading looks unreliable —
+ * re-measure it" or "your measurements are too noisy to trust this winner yet". NOISE does.
+ *
+ * It estimates the measurement noise σ from DISAGREEMENT between experiments that sit close together in
+ * the variable space: if two near-identical settings gave very different scores, that gap is noise (the
+ * response barely changed, so the difference is the meter wobbling). From σ it reports the signal-to-noise
+ * ratio, flags individual readings that deviate far from their neighbours (likely mis-measurements), and
+ * recommends whether to TRUST the result, RE-CHECK a flagged point, or REPLICATE measurements because the
+ * noise is drowning the signal.
+ *
+ * Honest by construction (DIAKRISIS): σ is estimated from near-neighbour pairs (it slightly over-counts any
+ * real local variation, so it is a conservative upper-ish bound); it needs enough close pairs and abstains
+ * to UNKNOWN otherwise. Decision support, not a guarantee — but the σ estimate is checkable: feed it data
+ * with a known injected noise and it recovers it (see the gauntlet).
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface NoiseOutlier {
+    experiment: Experiment;
+    value: number;
+    deviation: number;
+}
+export interface NoiseReport {
+    n: number;
+    noiseSigma: number;
+    signalRange: number;
+    snr: number;
+    nearPairs: number;
+    outliers: NoiseOutlier[];
+    recommendation: "trust" | "recheck-flagged" | "replicate" | "unknown";
+    note: string;
+}
+/** Estimate measurement noise + flag unreliable readings from near-neighbour disagreement. */
+export declare function analyzeNoise(obs: ReadonlyArray<Observation>, space: Space, _goal?: Goal, neighborFrac?: number): NoiseReport;
+export declare function noiseGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=noise.d.ts.map

package/dist/noise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"noise.d.ts","sourceRoot":"","sources":["../src/noise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,WAAW,YAAY;IAAG,UAAU,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE;AAC1F,MAAM,WAAW,WAAW;IAC1B,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,cAAc,EAAE,OAAO,GAAG,iBAAiB,GAAG,WAAW,GAAG,SAAS,CAAC;IACtE,IAAI,EAAE,MAAM,CAAC;CACd;AAOD,8FAA8F;AAC9F,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAE,IAAiB,EAAE,YAAY,SAAM,GAAG,WAAW,CAkDrI;AAKD,wBAAgB,aAAa,IAAI;IAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAiDlH"}

package/dist/noise.js

@@ -0,0 +1,148 @@
+function norm(space, e) {
+    return space.dims.map((d) => { const lo = d.min ?? 0, hi = d.max ?? 1; const span = hi - lo || 1; return Math.max(0, Math.min(1, ((+e[d.name] || 0) - lo) / span)); });
+}
+const dist = (a, b) => { let s = 0; for (let i = 0; i < a.length; i++)
+    s += (a[i] - b[i]) ** 2; return Math.sqrt(s); };
+/** Estimate measurement noise + flag unreliable readings from near-neighbour disagreement. */
+export function analyzeNoise(obs, space, _goal = "maximize", neighborFrac = 0.1) {
+    const hist = (obs ?? []).filter((o) => o && o.experiment && Number.isFinite(o.value));
+    const n = hist.length;
+    if ((space?.dims?.length ?? 0) === 0 || n < 8) {
+        return { n, noiseSigma: 0, signalRange: 0, snr: 0, nearPairs: 0, outliers: [], recommendation: "unknown", note: `need ≈8+ measurements (have ${n})` };
+    }
+    const pts = hist.map((o) => norm(space, o.experiment));
+    const vals = hist.map((o) => o.value);
+    const vMin = Math.min(...vals), vMax = Math.max(...vals);
+    const signalRange = vMax - vMin;
+    // σ from the CLOSEST pairs: at small separation the response is ~flat, so the value gap is ~ noise.
+    // For two readings each with noise σ, Var(diff) = 2σ², so σ̂ = sqrt(mean(diff²)/2). Use the nearest pairs only.
+    const pairs = [];
+    for (let i = 0; i < n; i++)
+        for (let j = i + 1; j < n; j++) {
+            if (dist(pts[i], pts[j]) < neighborFrac)
+                pairs.push((vals[i] - vals[j]) ** 2);
+        }
+    // widen the radius if too few close pairs (sparse data)
+    let radius = neighborFrac;
+    while (pairs.length < 5 && radius < 0.6) {
+        radius += 0.1;
+        pairs.length = 0;
+        for (let i = 0; i < n; i++)
+            for (let j = i + 1; j < n; j++) {
+                if (dist(pts[i], pts[j]) < radius)
+                    pairs.push((vals[i] - vals[j]) ** 2);
+            }
+    }
+    if (pairs.length < 3) {
+        return { n, noiseSigma: 0, signalRange: +signalRange.toFixed(6), snr: 0, nearPairs: pairs.length, outliers: [], recommendation: "unknown", note: "samples too spread out to estimate noise — repeat a setting or sample closer together" };
+    }
+    // robust σ via the MEDIAN of squared near-pair gaps (one mis-measured reading can't poison it) with the
+    // χ²₁ median de-bias: E[median(diff²)] = 2σ²·0.45494, so σ̂ = sqrt(median / 0.90987).
+    const sorted = pairs.slice().sort((a, b) => a - b);
+    const m = sorted.length;
+    const median = m % 2 ? sorted[(m - 1) / 2] : (sorted[m / 2 - 1] + sorted[m / 2]) / 2;
+    const noiseSigma = Math.sqrt(median / 0.90987);
+    const snr = noiseSigma > 1e-12 ? signalRange / noiseSigma : Infinity;
+    // outliers: a reading far from the local mean of its CLOSE neighbours (tight radius keeps the trend out;
+    // 4σ threshold so ordinary noise is not mistaken for a mis-measurement)
+    const outliers = [];
+    if (noiseSigma > 1e-9) {
+        for (let i = 0; i < n; i++) {
+            const neigh = [];
+            for (let j = 0; j < n; j++) {
+                if (j === i)
+                    continue;
+                if (dist(pts[i], pts[j]) < radius * 1.5)
+                    neigh.push(vals[j]);
+            }
+            if (neigh.length >= 2) {
+                neigh.sort((a, b) => a - b);
+                const k = neigh.length;
+                const localMed = k % 2 ? neigh[(k - 1) / 2] : (neigh[k / 2 - 1] + neigh[k / 2]) / 2; // robust centre — a bad point can't drag it
+                const dev = Math.abs(vals[i] - localMed);
+                if (dev > 4 * noiseSigma)
+                    outliers.push({ experiment: hist[i].experiment, value: vals[i], deviation: +dev.toFixed(4) });
+            }
+        }
+        outliers.sort((a, b) => b.deviation - a.deviation); // worst first, so slice() keeps the real culprits
+    }
+    let recommendation;
+    let note;
+    if (noiseSigma > 0.15 * (signalRange || 1)) {
+        recommendation = "replicate";
+        note = `noise (σ≈${noiseSigma.toPrecision(3)}) is large vs the signal (SNR≈${snr.toFixed(1)}) — replicate measurements before trusting the winner`;
+    }
+    else if (outliers.length) {
+        recommendation = "recheck-flagged";
+        note = `${outliers.length} reading(s) look mis-measured (>3σ from neighbours) — re-check them`;
+    }
+    else {
+        recommendation = "trust";
+        note = `measurements look clean (σ≈${noiseSigma.toPrecision(3)}, SNR≈${snr.toFixed(1)})`;
+    }
+    return { n, noiseSigma: +noiseSigma.toFixed(6), signalRange: +signalRange.toFixed(6), snr: Number.isFinite(snr) ? +snr.toFixed(3) : 9999, nearPairs: pairs.length, outliers: outliers.slice(0, 5), recommendation, note };
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+import { lcg } from "./space.js";
+export function noiseGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 10 }, { name: "y", type: "real", min: 0, max: 10 }] };
+    // deterministic Gaussian noise (Box–Muller) from the seeded RNG
+    const rnd = lcg(11);
+    const gauss = () => { const u1 = Math.max(1e-9, rnd()), u2 = rnd(); return Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2); };
+    // a nearly-flat response (so near-pair gaps are dominated by noise) + KNOWN noise σ = 0.30
+    const SIGMA = 0.30;
+    const flat = (e) => 5 + 0.05 * (e.x ?? 0); // very gentle slope
+    const noisy = [];
+    for (let i = 0; i < 120; i++) {
+        const e = { x: rnd() * 10, y: rnd() * 10 };
+        noisy.push({ experiment: e, value: flat(e) + SIGMA * gauss() });
+    }
+    const rN = analyzeNoise(noisy, space, "maximize");
+    // RECOVERS-NOISE: the estimate is within 2x of the injected σ (a real, falsifiable accuracy check)
+    const recovers = rN.noiseSigma > SIGMA * 0.5 && rN.noiseSigma < SIGMA * 2;
+    // a clean (noiseless) smooth response → σ̂ ≈ 0
+    const clean = [];
+    const rnd2 = lcg(3);
+    for (let i = 0; i < 120; i++) {
+        const e = { x: rnd2() * 10, y: rnd2() * 10 };
+        clean.push({ experiment: e, value: 5 + 0.05 * (e.x ?? 0) });
+    }
+    const rC = analyzeNoise(clean, space, "maximize");
+    const cleanLow = rC.noiseSigma < 0.05 && rC.recommendation === "trust";
+    // OUTLIER: inject one wildly-off reading into the clean set → it is flagged
+    const withOut = clean.slice();
+    withOut.push({ experiment: { x: 5, y: 5 }, value: 999 });
+    const rO = analyzeNoise(withOut, space, "maximize");
+    const flagsOutlier = rO.outliers.some((o) => o.value === 999);
+    // REPLICATE advice when noise is large vs signal (flat response + big noise)
+    const veryNoisy = [];
+    const rnd3 = lcg(5);
+    for (let i = 0; i < 120; i++) {
+        const e = { x: rnd3() * 10, y: rnd3() * 10 };
+        veryNoisy.push({ experiment: e, value: 5 + 1.5 * (Math.sqrt(-2 * Math.log(Math.max(1e-9, rnd3()))) * Math.cos(2 * Math.PI * rnd3())) });
+    }
+    const rV = analyzeNoise(veryNoisy, space, "maximize");
+    const advisesReplicate = rV.recommendation === "replicate";
+    const det = JSON.stringify(analyzeNoise(noisy, space, "maximize")) === JSON.stringify(analyzeNoise(noisy, space, "maximize"));
+    const thin = analyzeNoise(noisy.slice(0, 4), space, "maximize");
+    const abstains = thin.recommendation === "unknown";
+    const total = (() => { try {
+        analyzeNoise(null, space);
+        analyzeNoise([], space);
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "RECOVERS-INJECTED-NOISE", pass: recovers, detail: `injected σ=${SIGMA}; estimated σ=${rN.noiseSigma} (within 2x = accurate)` },
+        { name: "CLEAN-IS-LOW", pass: cleanLow, detail: `noiseless data → σ≈${rC.noiseSigma} and "trust"` },
+        { name: "FLAGS-OUTLIER", pass: flagsOutlier, detail: "a 999 reading among clean data is flagged as mis-measured" },
+        { name: "ADVISES-REPLICATE", pass: advisesReplicate, detail: `large noise vs signal → recommends replicate (got "${rV.recommendation}")` },
+        { name: "DETERMINISTIC", pass: det, detail: "same data → same report" },
+        { name: "ABSTAINS-WHEN-THIN", pass: abstains, detail: "too few measurements → UNKNOWN" },
+        { name: "TOTAL", pass: total, detail: "null / empty never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=noise.js.map

package/dist/noise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"noise.js","sourceRoot":"","sources":["../src/noise.ts"],"names":[],"mappings":"AAgCA,SAAS,IAAI,CAAC,KAAY,EAAE,CAAa;IACvC,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzK,CAAC;AACD,MAAM,IAAI,GAAG,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;IAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE3I,8FAA8F;AAC9F,MAAM,UAAU,YAAY,CAAC,GAA+B,EAAE,KAAY,EAAE,QAAc,UAAU,EAAE,YAAY,GAAG,GAAG;IACtH,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,+BAA+B,CAAC,GAAG,EAAE,CAAC;IACxJ,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAAC,MAAM,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC;IAE1F,oGAAoG;IACpG,gHAAgH;IAChH,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAC,CAAC;IAC9I,wDAAwD;IACxD,IAAI,MAAM,GAAG,YAAY,CAAC;IAC1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;QAAC,MAAM,IAAI,GAAG,CAAC;QAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAC,CAAC;IAAC,CAAC;IACtN,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,uFAAuF,EAAE,CAAC;IAC7O,CAAC;IACD,wGAAwG;IACxG,sFAAsF;IACtF,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAAC,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9G,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC;IAErE,yGAAyG;IACzG,wEAAwE;IACxE,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,GAAG;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC;YACpH,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;gBAAC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAG,4CAA4C;gBACxL,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;gBACzC,IAAI,GAAG,GAAG,CAAC,GAAG,UAAU;oBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1H,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAG,kDAAkD;IAC1G,CAAC;IAED,IAAI,cAA6C,CAAC;IAClD,IAAI,IAAY,CAAC;IACjB,IAAI,UAAU,GAAG,IAAI,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,EAAE,CAAC;QAAC,cAAc,GAAG,WAAW,CAAC;QAAC,IAAI,GAAG,YAAY,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,iCAAiC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,uDAAuD,CAAC;IAAC,CAAC;SAC5N,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAAC,cAAc,GAAG,iBAAiB,CAAC;QAAC,IAAI,GAAG,GAAG,QAAQ,CAAC,MAAM,qEAAqE,CAAC;IAAC,CAAC;SAC5J,CAAC;QAAC,cAAc,GAAG,OAAO,CAAC;QAAC,IAAI,GAAG,8BAA8B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAAC,CAAC;IAE5H,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;AAC5N,CAAC;AAED,iFAAiF;AACjF,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAEjC,MAAM,UAAU,aAAa;IAC3B,MAAM,KAAK,GAAU,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC5H,gEAAgE;IAChE,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,GAAG,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAExI,2FAA2F;IAC3F,MAAM,KAAK,GAAG,IAAI,CAAC;IACnB,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAG,oBAAoB;IAC7E,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,CAAC,CAAC;IAAC,CAAC;IAC9I,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAClD,mGAAmG;IACnG,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,GAAG,KAAK,GAAG,GAAG,IAAI,EAAE,CAAC,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;IAE1E,+CAA+C;IAC/C,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAC5I,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,cAAc,KAAK,OAAO,CAAC;IAEvE,4EAA4E;IAC5E,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAAC,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACxF,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACpD,MAAM,YAAY,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC;IAE9D,6EAA6E;IAC7E,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QAAC,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IACxN,MAAM,EAAE,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,gBAAgB,GAAG,EAAE,CAAC,cAAc,KAAK,WAAW,CAAC;IAE3D,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9H,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC;IACnD,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,YAAY,CAAC,IAAa,EAAE,KAAK,CAAC,CAAC;QAAC,YAAY,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtI,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,yBAAyB,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,cAAc,KAAK,iBAAiB,EAAE,CAAC,UAAU,yBAAyB,EAAE;QACvI,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAC,UAAU,cAAc,EAAE;QACnG,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,2DAA2D,EAAE;QAClH,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,sDAAsD,EAAE,CAAC,cAAc,IAAI,EAAE;QAC1I,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,yBAAyB,EAAE;QACvE,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,gCAAgC,EAAE;QACxF,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,2BAA2B,EAAE;KACpE,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;AAClE,CAAC"}

package/dist/noiserobust.d.ts

@@ -0,0 +1,71 @@
+/**
+ * 🛰 NOISE-ROBUST DISCOVERY — the engine that doesn't get fooled by luck.
+ *
+ * Every ordinary optimizer trusts the single highest reading it ever saw. In a deterministic lab that's fine.
+ * But run Melete as a 24/7 service on a real system — a satellite link in a solar storm, a database under a
+ * traffic spike, an assay with batch-to-batch drift — and the measurements are NOISY: the SAME setting can
+ * read 99% one second and 40% the next. A naive optimizer locks onto a setting that got one lucky high
+ * reading and then collapses in production. That is the single most expensive failure mode in real Bayesian
+ * optimization.
+ *
+ * NOISE-ROBUST fixes it the honest way:
+ *   1. REPLICATE — it re-measures each candidate several times to estimate not just the mean μ but the
+ *      spread σ. Noise is HETEROSCEDASTIC (different in different regions), so σ is estimated PER POINT from
+ *      that point's own replicates — never assumed global.
+ *   2. RACE (LUCB) — it spends extra measurements where it matters: tightening the confidence interval of the
+ *      current leader and its closest challenger, so the winner is decided by evidence, not by a single fluke.
+ *   3. SELECT BY TRUST — the winner is the point with the highest LOWER confidence bound (μ − z·σ/√n): the
+ *      value you can actually rely on. A lucky spike with huge σ has a low LCB and loses; a genuinely good,
+ *      quiet setting wins. It also reports the "lucky max" (the naive answer) it rejected and a per-point risk
+ *      band, so a human/dashboard can see the noise it filtered.
+ *
+ * Honest by construction (DIAKRISIS): σ is measured from real replicates, not modelled from a prior; the
+ * guarantee is statistical (it needs a few replicates per point) and the gauntlet proves it on a deliberately
+ * noisy landscape where a high-variance trap occasionally out-reads the true optimum — NOISE-ROBUST picks the
+ * trustworthy optimum ≥97.5% of seeds while a naive max-picker is fooled most of the time. Distinct from
+ * AEGIS (which is robust to INPUT wobble / landscape geometry); this is robust to OUTPUT measurement noise.
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface RobustPoint {
+    experiment: Experiment;
+    mean: number;
+    std: number;
+    n: number;
+    lcb: number;
+    ucb: number;
+}
+export interface NoiseRobustResult {
+    best: Observation;
+    bestMean: number;
+    bestStd: number;
+    bestN: number;
+    bestLcb: number;
+    luckyMax: Observation;
+    rejectedLucky: boolean;
+    noiseFiltered: number;
+    points: RobustPoint[];
+    evaluations: number;
+}
+/**
+ * Noise-robust discovery on a stochastic oracle. `replicates` = initial measurements per candidate (≥3);
+ * `z` = confidence multiplier for the lower bound (higher = more conservative / trust-demanding).
+ */
+export declare function noiseRobustDiscover(opts: {
+    space: Space;
+    oracle: (e: Experiment) => number;
+    budget: number;
+    goal?: Goal;
+    seed?: number;
+    z?: number;
+    replicates?: number;
+}): NoiseRobustResult;
+export declare function noiseRobustGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=noiserobust.d.ts.map

package/dist/noiserobust.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"noiserobust.d.ts","sourceRoot":"","sources":["../src/noiserobust.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAAO,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAM1D,MAAM,WAAW,WAAW;IAAG,UAAU,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;CAAE;AACxH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,WAAW,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAClE,QAAQ,EAAE,WAAW,CAAC;IACtB,aAAa,EAAE,OAAO,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;CACrB;AAID;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,CAAC,CAAC,EAAE,UAAU,KAAK,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,iBAAiB,CAgE7L;AAOD,wBAAgB,mBAAmB,IAAI;IAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAuDxH"}