melete-ai 0.88.2

package/dist/achievability.d.ts

@@ -0,0 +1,38 @@
+/**
+ * ACHIEVABILITY — is the target you WANT even reachable with the knobs you have? Every optimizer chases a
+ * better number; none tell you when you're chasing one that the physics can't deliver. If your goal is
+ * "yield ≥ 95%" but the best these variables can ever produce is ~88%, you can tune forever and never get
+ * there — the answer isn't a better setting, it's a new lever (a variable you aren't yet controlling) or a
+ * relaxed target. Knowing that EARLY saves weeks of doomed experiments.
+ *
+ * ACHIEVABILITY estimates the optimistic CEILING of your response over the whole variable space — a
+ * Lipschitz (smoothness) upper bound built from your own measurements — and compares your target against it.
+ * Target already met → achieved. Target below the ceiling → reachable, keep going. Target ABOVE even the
+ * optimistic ceiling → likely out of reach with these variables; stop tuning, change the experiment.
+ *
+ * Honest by construction (DIAKRISIS): the ceiling is an OPTIMISTIC estimate from the smoothness of your data,
+ * so "unreachable" means "above what your measurements can justify" — not a theorem of impossibility (a sharp
+ * spike between samples could exceed it; that's exactly what exploration is for). It abstains when data is
+ * thin, and it never cries "impossible" for a target your data already brackets.
+ */
+import { type Space } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface AchievabilityReport {
+    target: number;
+    bestSoFar: number;
+    ceiling: number;
+    feasibility: number;
+    verdict: "achieved" | "reachable" | "unreachable" | "unknown";
+    note: string;
+}
+/** Estimate whether `target` is reachable for this objective given the measurements so far. */
+export declare function assessAchievability(obs: ReadonlyArray<Observation>, space: Space, target: number, goal?: Goal): AchievabilityReport;
+export declare function achievabilityGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=achievability.d.ts.map

package/dist/achievability.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"achievability.d.ts","sourceRoot":"","sources":["../src/achievability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAmB,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,UAAU,GAAG,WAAW,GAAG,aAAa,GAAG,SAAS,CAAC;IAC9D,IAAI,EAAE,MAAM,CAAC;CACd;AAMD,+FAA+F;AAC/F,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,IAAiB,GAAG,mBAAmB,CA8C/I;AAKD,wBAAgB,qBAAqB,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,CA8C1H"}

package/dist/achievability.js

@@ -0,0 +1,135 @@
+const HB = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37];
+const hal = (k, b) => { let f = 1, r = 0, i = k + 1; while (i > 0) {
+    f /= b;
+    r += f * (i % b);
+    i = Math.floor(i / b);
+} return r; };
+const dst = (a, c) => { let s = 0; for (let i = 0; i < a.length; i++)
+    s += (a[i] - c[i]) ** 2; return Math.sqrt(s); };
+/** Estimate whether `target` is reachable for this objective given the measurements so far. */
+export function assessAchievability(obs, space, target, goal = "maximize") {
+    const dims = space?.dims ?? [];
+    const D = dims.length;
+    const hist = (obs ?? []).filter((o) => o && o.experiment && Number.isFinite(o.value));
+    const n = hist.length;
+    if (D === 0 || n < 6 || !Number.isFinite(target)) {
+        return { target, bestSoFar: NaN, ceiling: NaN, feasibility: 0, verdict: "unknown", note: `need ≈6+ measurements to estimate the ceiling (have ${n})` };
+    }
+    const sgn = goal === "minimize" ? -1 : 1;
+    const lo = (i) => dims[i].min ?? 0, hi = (i) => dims[i].max ?? 1;
+    const toN = (e) => dims.map((d, i) => { const sp = hi(i) - lo(i) || 1; return Math.max(0, Math.min(1, ((+e[d.name] || 0) - lo(i)) / sp)); });
+    const npts = hist.map((o) => toN(o.experiment));
+    const vals = hist.map((o) => sgn * o.value); // work in "bigger is better" space
+    const bestSigned = Math.max(...vals);
+    // Lipschitz constant from the data (largest value-change per unit distance)
+    let L = 0;
+    for (let i = 0; i < npts.length; i++)
+        for (let j = i + 1; j < npts.length; j++) {
+            const dx = dst(npts[i], npts[j]);
+            if (dx > 1e-9)
+                L = Math.max(L, Math.abs(vals[i] - vals[j]) / dx);
+        }
+    L = (L > 0 ? L : 1e-6) * 1.1;
+    // optimistic ceiling: max over a dense space-filling grid of the Lipschitz upper bound min_i(v_i + L·dist)
+    let ceilingSigned = bestSigned;
+    for (let k = 0; k < 1500; k++) {
+        const c = [];
+        for (let d = 0; d < D; d++)
+            c.push(hal(k * 5 + 1, HB[d % HB.length]));
+        let ub = Infinity;
+        for (let i = 0; i < npts.length; i++) {
+            const b = vals[i] + L * dst(c, npts[i]);
+            if (b < ub)
+                ub = b;
+        }
+        if (ub > ceilingSigned)
+            ceilingSigned = ub;
+    }
+    const bestSoFar = sgn * bestSigned;
+    const ceiling = sgn * ceilingSigned;
+    const targetSigned = sgn * target;
+    const span = Math.max(1e-9, ceilingSigned - bestSigned);
+    const feasibility = Math.max(0, Math.min(1, (ceilingSigned - targetSigned) / span)); // 1 at target=best, 0 at target=ceiling, <0→unreachable
+    let verdict;
+    let note;
+    const cmp = goal === "minimize" ? "≤" : "≥";
+    const fmt = (x) => (Math.abs(x) < 1 ? +x.toFixed(3) : +x.toFixed(2));
+    if (targetSigned <= bestSigned + 1e-9) {
+        verdict = "achieved";
+        note = `target ${cmp} ${fmt(target)} is already met (best so far ${fmt(bestSoFar)}) — you can stop or push further`;
+    }
+    else if (targetSigned <= ceilingSigned) {
+        verdict = "reachable";
+        note = `target ${fmt(target)} is below the estimated ceiling (~${fmt(ceiling)}) — reachable; keep optimizing (${(feasibility * 100).toFixed(0)}% headroom remaining)`;
+    }
+    else {
+        verdict = "unreachable";
+        note = `target ${fmt(target)} is ABOVE the optimistic ceiling (~${fmt(ceiling)}) these variables can reach — likely out of reach; add a new lever or relax the target`;
+    }
+    return { target, bestSoFar: +fmt(bestSoFar), ceiling: +fmt(ceiling), feasibility: +feasibility.toFixed(3), verdict, note };
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+import { lcg } from "./space.js";
+export function achievabilityGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 1 }, { name: "y", type: "real", min: 0, max: 1 }] };
+    const TRUE_MAX = 1.0;
+    const f = (x, y) => Math.exp(-(((x - 0.5) ** 2) + ((y - 0.5) ** 2)) / 0.08); // peak 1.0 at (0.5,0.5)
+    const rnd = lcg(17);
+    const obs = [];
+    for (let i = 0; i < 80; i++) {
+        const x = rnd(), y = rnd();
+        obs.push({ experiment: { x, y }, value: f(x, y) });
+    }
+    // make sure the optimum region is sampled so bestSoFar is near the true max
+    for (let i = 0; i < 8; i++) {
+        const x = 0.5 + (rnd() - 0.5) * 0.1, y = 0.5 + (rnd() - 0.5) * 0.1;
+        obs.push({ experiment: { x, y }, value: f(x, y) });
+    }
+    const achieved = assessAchievability(obs, space, 0.5, "maximize"); // below best → achieved
+    const reachable = assessAchievability(obs, space, 0.97, "maximize"); // just under the true max → reachable, NOT impossible
+    const unreach = assessAchievability(obs, space, 1.6, "maximize"); // well above the max → unreachable
+    const achievedOk = achieved.verdict === "achieved";
+    const reachableOk = reachable.verdict !== "unreachable"; // must NOT falsely cry impossible below the real max
+    const unreachOk = unreach.verdict === "unreachable" && unreach.ceiling < 1.6;
+    // higher target → lower feasibility
+    const fa = assessAchievability(obs, space, 0.9, "maximize").feasibility;
+    const fb = assessAchievability(obs, space, 1.1, "maximize").feasibility;
+    const monotone = fa >= fb;
+    // MINIMIZE: target floor that's unreachably low
+    const g = (x, y) => 1 - f(x, y); // min 0.0 at (0.5,0.5)
+    const rnd2 = lcg(5);
+    const obsMin = [];
+    for (let i = 0; i < 88; i++) {
+        const x = rnd2(), y = rnd2();
+        obsMin.push({ experiment: { x, y }, value: g(x, y) });
+    }
+    for (let i = 0; i < 8; i++) {
+        const x = 0.5 + (rnd2() - 0.5) * 0.1, y = 0.5 + (rnd2() - 0.5) * 0.1;
+        obsMin.push({ experiment: { x, y }, value: g(x, y) });
+    }
+    const minUnreach = assessAchievability(obsMin, space, -0.5, "minimize"); // can't get below 0 → −0.5 unreachable
+    const minReach = assessAchievability(obsMin, space, 0.1, "minimize"); // 0.1 is reachable
+    const minOk = minUnreach.verdict === "unreachable" && minReach.verdict !== "unreachable";
+    const det = JSON.stringify(assessAchievability(obs, space, 1.6, "maximize")) === JSON.stringify(assessAchievability(obs, space, 1.6, "maximize"));
+    const abstains = assessAchievability(obs.slice(0, 4), space, 0.5, "maximize").verdict === "unknown";
+    const total = (() => { try {
+        assessAchievability(null, space, 1);
+        assessAchievability([], space, NaN);
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "ACHIEVED-WHEN-MET", pass: achievedOk, detail: `target below best → achieved (best ${achieved.bestSoFar})` },
+        { name: "REACHABLE-BELOW-MAX", pass: reachableOk, detail: `0.97 < true max ${TRUE_MAX} is NOT called impossible (verdict ${reachable.verdict}, ceiling ${reachable.ceiling})` },
+        { name: "UNREACHABLE-ABOVE-MAX", pass: unreachOk, detail: `1.6 > ceiling ${unreach.ceiling} → unreachable (add a lever)` },
+        { name: "HIGHER-TARGET-LOWER-FEASIBILITY", pass: monotone, detail: `feasibility drops as the target rises (${fa.toFixed(2)} → ${fb.toFixed(2)})` },
+        { name: "MINIMIZE-DIRECTION", pass: minOk, detail: `floor 0 → −0.5 unreachable, 0.1 reachable` },
+        { name: "DETERMINISTIC", pass: det, detail: "same data+target → same verdict" },
+        { name: "ABSTAINS-WHEN-THIN", pass: abstains, detail: "too few measurements → unknown" },
+        { name: "TOTAL", pass: total, detail: "null / empty / NaN target never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=achievability.js.map

package/dist/achievability.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"achievability.js","sourceRoot":"","sources":["../src/achievability.ts"],"names":[],"mappings":"AA6BA,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AACxD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACpJ,MAAM,GAAG,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;AAE1I,+FAA+F;AAC/F,MAAM,UAAU,mBAAmB,CAAC,GAA+B,EAAE,KAAY,EAAE,MAAc,EAAE,OAAa,UAAU;IACxH,MAAM,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;IAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtD,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,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACjD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,uDAAuD,CAAC,GAAG,EAAE,CAAC;IACzJ,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACjF,MAAM,GAAG,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,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,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAyB,mCAAmC;IACxG,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAErC,4EAA4E;IAC5E,IAAI,CAAC,GAAG,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,EAAE,GAAG,IAAI;gBAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAAC,CAAC;IAClM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IAE7B,2GAA2G;IAC3G,IAAI,aAAa,GAAG,UAAU,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAa,EAAE,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9F,IAAI,EAAE,GAAG,QAAQ,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;QAAC,CAAC;QACzH,IAAI,EAAE,GAAG,aAAa;YAAE,aAAa,GAAG,EAAE,CAAC;IAC7C,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,GAAG,UAAU,CAAC;IACnC,MAAM,OAAO,GAAG,GAAG,GAAG,aAAa,CAAC;IACpC,MAAM,YAAY,GAAG,GAAG,GAAG,MAAM,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,GAAG,UAAU,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,aAAa,GAAG,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAG,wDAAwD;IAE/I,IAAI,OAAuC,CAAC;IAAC,IAAI,IAAY,CAAC;IAC9D,MAAM,GAAG,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5C,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAI,YAAY,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;QACtC,OAAO,GAAG,UAAU,CAAC;QACrB,IAAI,GAAG,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,gCAAgC,GAAG,CAAC,SAAS,CAAC,kCAAkC,CAAC;IACtH,CAAC;SAAM,IAAI,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,OAAO,GAAG,WAAW,CAAC;QACtB,IAAI,GAAG,UAAU,GAAG,CAAC,MAAM,CAAC,qCAAqC,GAAG,CAAC,OAAO,CAAC,mCAAmC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uBAAuB,CAAC;IACxK,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,aAAa,CAAC;QACxB,IAAI,GAAG,UAAU,GAAG,CAAC,MAAM,CAAC,sCAAsC,GAAG,CAAC,OAAO,CAAC,wFAAwF,CAAC;IACzK,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC7H,CAAC;AAED,iFAAiF;AACjF,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAEjC,MAAM,UAAU,qBAAqB;IACnC,MAAM,KAAK,GAAU,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC1H,MAAM,QAAQ,GAAG,GAAG,CAAC;IACrB,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAG,wBAAwB;IACvH,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,MAAM,GAAG,GAAkB,EAAE,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAChH,4EAA4E;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAEvJ,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAM,wBAAwB;IAChG,MAAM,SAAS,GAAG,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAI,sDAAsD;IAC9H,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAO,mCAAmC;IAE3G,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,KAAK,UAAU,CAAC;IACnD,MAAM,WAAW,GAAG,SAAS,CAAC,OAAO,KAAK,aAAa,CAAC,CAAgB,qDAAqD;IAC7H,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,KAAK,aAAa,IAAI,OAAO,CAAC,OAAO,GAAG,GAAG,CAAC;IAE7E,oCAAoC;IACpC,MAAM,EAAE,GAAG,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,WAAW,CAAC;IACxE,MAAM,EAAE,GAAG,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,WAAW,CAAC;IACxE,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,CAAC;IAE1B,gDAAgD;IAChD,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAwB,uBAAuB;IAC/F,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,MAAM,MAAM,GAAkB,EAAE,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC;QAAC,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IACrH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAAC,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAC5J,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAG,uCAAuC;IAClH,MAAM,QAAQ,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAM,mBAAmB;IAC9F,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,KAAK,aAAa,IAAI,QAAQ,CAAC,OAAO,KAAK,aAAa,CAAC;IAEzF,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;IAClJ,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC;IACpG,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,mBAAmB,CAAC,IAAa,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAAC,mBAAmB,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAE5J,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,sCAAsC,QAAQ,CAAC,SAAS,GAAG,EAAE;QACpH,EAAE,IAAI,EAAE,qBAAqB,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,mBAAmB,QAAQ,sCAAsC,SAAS,CAAC,OAAO,aAAa,SAAS,CAAC,OAAO,GAAG,EAAE;QAC/K,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,OAAO,CAAC,OAAO,8BAA8B,EAAE;QAC1H,EAAE,IAAI,EAAE,iCAAiC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,0CAA0C,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE;QAClJ,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,2CAA2C,EAAE;QAChG,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,iCAAiC,EAAE;QAC/E,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,wCAAwC,EAAE;KACjF,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/aegis.d.ts

@@ -0,0 +1,52 @@
+/**
+ * 🛡 AEGIS — the Self-Aware Engine. Every optimizer on earth chases the single highest number. AEGIS refuses
+ * to. A tall spike perched on a cliff edge is a trap: it scores beautifully in the lab and fails the morning
+ * the temperature drifts 1°, the reagent batch changes, the operator's hand wobbles. AEGIS optimizes for the
+ * value that SURVIVES the real world — it watches its own search, learns where the cliffs and fragile spikes
+ * are, and deliberately steers toward a broad, stable optimum, even when a more fragile setting scores
+ * slightly higher.
+ *
+ * This is what makes it "self-aware": the same diagnostics Melete reports to humans (local steepness, cliff
+ * proximity, robustness) are fed back IN to drive the engine. Its acquisition isn't "highest predicted
+ * value" — it's "highest predicted value that also holds when you nudge it." And its final answer isn't the
+ * raw maximum, it's the best ROBUST optimum. No competitor's optimizer does this: they hand you the spike,
+ * then act surprised when it doesn't reproduce.
+ *
+ * Honest by construction (DIAKRISIS): robustness is estimated from your real data — how much the value
+ * changes for a small move, measured from the nearest measurements — not assumed. AEGIS trades a little raw
+ * peak height for a lot of stability; if you genuinely want the absolute spike, a plain maximiser still
+ * exists. The gauntlet proves it head-to-head: on a tall-fragile-spike-vs-broad-stable-peak landscape, AEGIS
+ * returns the setting that survives a real-world wobble while a plain maximiser returns the one that collapses.
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface AegisResult {
+    best: Observation;
+    rawBest: Observation;
+    robustnessOfBest: number;
+    tradedHeight: number;
+    evaluations: number;
+    obs: Observation[];
+}
+/**
+ * Run a self-aware discovery: search with a robustness-weighted acquisition and return the best STABLE
+ * optimum (not the fragile spike). `robustWeight` 0 = pure height (a normal maximiser), 1 = strongly favour
+ * flat regions.
+ */
+export declare function aegisDiscover(opts: {
+    space: Space;
+    oracle: (e: Experiment) => number;
+    budget: number;
+    goal?: Goal;
+    seed?: number;
+    robustWeight?: number;
+}): AegisResult;
+export declare function aegisGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=aegis.d.ts.map

package/dist/aegis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aegis.d.ts","sourceRoot":"","sources":["../src/aegis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;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;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,OAAO,EAAE,WAAW,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,GAAG,EAAE,WAAW,EAAE,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,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,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,WAAW,CA4DvK;AAGD,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,CAmClH"}

package/dist/aegis.js

@@ -0,0 +1,191 @@
+/**
+ * 🛡 AEGIS — the Self-Aware Engine. Every optimizer on earth chases the single highest number. AEGIS refuses
+ * to. A tall spike perched on a cliff edge is a trap: it scores beautifully in the lab and fails the morning
+ * the temperature drifts 1°, the reagent batch changes, the operator's hand wobbles. AEGIS optimizes for the
+ * value that SURVIVES the real world — it watches its own search, learns where the cliffs and fragile spikes
+ * are, and deliberately steers toward a broad, stable optimum, even when a more fragile setting scores
+ * slightly higher.
+ *
+ * This is what makes it "self-aware": the same diagnostics Melete reports to humans (local steepness, cliff
+ * proximity, robustness) are fed back IN to drive the engine. Its acquisition isn't "highest predicted
+ * value" — it's "highest predicted value that also holds when you nudge it." And its final answer isn't the
+ * raw maximum, it's the best ROBUST optimum. No competitor's optimizer does this: they hand you the spike,
+ * then act surprised when it doesn't reproduce.
+ *
+ * Honest by construction (DIAKRISIS): robustness is estimated from your real data — how much the value
+ * changes for a small move, measured from the nearest measurements — not assumed. AEGIS trades a little raw
+ * peak height for a lot of stability; if you genuinely want the absolute spike, a plain maximiser still
+ * exists. The gauntlet proves it head-to-head: on a tall-fragile-spike-vs-broad-stable-peak landscape, AEGIS
+ * returns the setting that survives a real-world wobble while a plain maximiser returns the one that collapses.
+ */
+import { lcg } from "./space.js";
+const HB = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37];
+const hal = (k, b) => { let f = 1, r = 0, i = k + 1; while (i > 0) {
+    f /= b;
+    r += f * (i % b);
+    i = Math.floor(i / b);
+} return r; };
+const dst = (a, c) => { let s = 0; for (let i = 0; i < a.length; i++)
+    s += (a[i] - c[i]) ** 2; return Math.sqrt(s); };
+/**
+ * Run a self-aware discovery: search with a robustness-weighted acquisition and return the best STABLE
+ * optimum (not the fragile spike). `robustWeight` 0 = pure height (a normal maximiser), 1 = strongly favour
+ * flat regions.
+ */
+export function aegisDiscover(opts) {
+    const goal = opts.goal ?? "maximize";
+    const sgn = goal === "minimize" ? -1 : 1;
+    const budget = Math.max(2, Math.floor(opts.budget));
+    const seed = (opts.seed ?? 1) | 0;
+    const rw = Math.max(0, Math.min(1, opts.robustWeight ?? 0.6));
+    const dims = opts.space.dims, D = dims.length;
+    const lo = (i) => dims[i].min ?? 0, hi = (i) => dims[i].max ?? 1;
+    const toN = (e) => dims.map((d, i) => { const sp = hi(i) - lo(i) || 1; return Math.max(0, Math.min(1, ((+e[d.name] || 0) - lo(i)) / sp)); });
+    const toE = (v) => { const e = {}; dims.forEach((d, i) => { let x = lo(i) + v[i] * (hi(i) - lo(i)); if (d.type === "int")
+        x = Math.round(x); e[d.name] = x; }); return e; };
+    const obs = [];
+    const npts = [];
+    const vals = [];
+    const rnd = lcg((seed >>> 0) || 1);
+    const take = (p) => { const e = toE(p); const v = opts.oracle(e); obs.push({ experiment: e, value: v }); npts.push(p); vals.push(sgn * v); };
+    // local steepness at p: the biggest value-change per unit distance among nearby measurements (∞-fragile)
+    const steepness = (p) => {
+        let g = 0, any = false;
+        for (let i = 0; i < npts.length; i++) {
+            const d = dst(p, npts[i]);
+            if (d > 1e-6 && d < 0.28) {
+                any = true;
+                const s = Math.abs(vals[i] - nearestVal(p)) / d;
+                if (s > g)
+                    g = s;
+            }
+        }
+        return any ? g : 0;
+    };
+    const nearestVal = (p) => { let dm = Infinity, v = 0; for (let i = 0; i < npts.length; i++) {
+        const d = dst(p, npts[i]);
+        if (d < dm) {
+            dm = d;
+            v = vals[i];
+        }
+    } return v; };
+    // seed: a small space-filling burst so we can see the terrain before judging it
+    const seeds = Math.min(budget, Math.max(4, Math.round(budget * 0.4)));
+    for (let k = 0; k < seeds; k++) {
+        const p = [];
+        for (let d = 0; d < D; d++)
+            p.push(hal(k * 5 + 1, HB[d % HB.length]));
+        take(p);
+    }
+    while (obs.length < budget) {
+        // value model: optimistic Lipschitz upper bound
+        let L = 0;
+        for (let i = 0; i < npts.length; i++)
+            for (let j = i + 1; j < npts.length; j++) {
+                const dx = dst(npts[i], npts[j]);
+                if (dx > 1e-9)
+                    L = Math.max(L, Math.abs(vals[i] - vals[j]) / dx);
+            }
+        L = (L > 0 ? L : 1e-6) * 1.15;
+        const vRange = Math.max(1e-9, Math.max(...vals) - Math.min(...vals));
+        const bestRobust = robustPick();
+        const cands = [];
+        for (let k = 0; k < 600; k++) {
+            const c = [];
+            for (let d = 0; d < D; d++)
+                c.push(hal(k * 7 + (obs.length % 5) + 1, HB[d % HB.length]));
+            cands.push(c);
+        }
+        if (bestRobust)
+            for (let k = 0; k < 120; k++)
+                cands.push(bestRobust.p.map((x) => Math.max(0, Math.min(1, x + (rnd() - 0.5) * 0.2))));
+        let pick = null, pickScore = -Infinity;
+        for (const c of cands) {
+            let ub = Infinity;
+            for (let i = 0; i < npts.length; i++) {
+                const b = vals[i] + L * dst(c, npts[i]);
+                if (b < ub)
+                    ub = b;
+            }
+            const flat = 1 / (1 + (steepness(c) / vRange) * 2); // 1 = flat/robust, →0 = on a steep wall
+            const score = ub * (1 - rw + rw * flat); // robustness-weighted acquisition
+            if (score > pickScore) {
+                pickScore = score;
+                pick = c;
+            }
+        }
+        take(pick ?? cands[0]);
+    }
+    // final selection: the best ROBUST optimum (value × local flatness), not the raw spike
+    function robustPick() {
+        if (!npts.length)
+            return null;
+        const vRange = Math.max(1e-9, Math.max(...vals) - Math.min(...vals));
+        let bi = 0, bs = -Infinity;
+        for (let i = 0; i < npts.length; i++) {
+            const flat = 1 / (1 + (steepness(npts[i]) / vRange) * 2);
+            const s = vals[i] * (1 - rw) + vals[i] * rw * flat;
+            if (s > bs) {
+                bs = s;
+                bi = i;
+            }
+        }
+        return { i: bi, p: npts[bi], flat: 1 / (1 + (steepness(npts[bi]) / vRange) * 2) };
+    }
+    const rp = robustPick();
+    const vRange = Math.max(1e-9, Math.max(...vals) - Math.min(...vals));
+    let rawI = 0;
+    for (let i = 1; i < vals.length; i++)
+        if (vals[i] > vals[rawI])
+            rawI = i;
+    return {
+        best: obs[rp.i], rawBest: obs[rawI],
+        robustnessOfBest: +(1 / (1 + (steepness(npts[rp.i]) / vRange) * 2)).toFixed(3),
+        tradedHeight: +(sgn * (obs[rawI].value - obs[rp.i].value)).toFixed(4),
+        evaluations: obs.length, obs,
+    };
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+export function aegisGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 1 }, { name: "y", type: "real", min: 0, max: 1 }] };
+    // a TALL FRAGILE spike at (0.8,0.8) (collapses if you move a little) + a BROAD STABLE peak at (0.3,0.3)
+    const fragile = (x, y) => 1.05 * Math.exp(-(((x - 0.8) ** 2) + ((y - 0.8) ** 2)) / 0.03);
+    const stable = (x, y) => 0.9 * Math.exp(-(((x - 0.3) ** 2) + ((y - 0.3) ** 2)) / 0.25);
+    const f = (x, y) => Math.max(fragile(x, y), stable(x, y));
+    const aegis = aegisDiscover({ space, oracle: (e) => f(e.x ?? 0, e.y ?? 0), budget: 60, goal: "maximize", seed: 7, robustWeight: 0.75 });
+    const greedy = aegisDiscover({ space, oracle: (e) => f(e.x ?? 0, e.y ?? 0), budget: 60, goal: "maximize", seed: 7, robustWeight: 0 }); // rw=0 → pure height, no robustness
+    // perturbation-survival: nudge the chosen setting and see how much value is retained (worst over a ring)
+    const survives = (x, y) => { let worst = Infinity; for (let a = 0; a < 8; a++) {
+        const th = a / 8 * 2 * Math.PI;
+        worst = Math.min(worst, f(x + 0.14 * Math.cos(th), y + 0.14 * Math.sin(th)));
+    } return worst; };
+    const aegisSurvival = survives(aegis.best.experiment.x ?? 0, aegis.best.experiment.y ?? 0);
+    const spikeSurvival = survives(0.8, 0.8); // the fragile GLOBAL maximum's survival
+    const choosesStable = Math.abs((aegis.best.experiment.x ?? 0) - 0.3) < 0.18 && Math.abs((aegis.best.experiment.y ?? 0) - 0.3) < 0.18;
+    const answerIsRobust = aegisSurvival > 0.8; // AEGIS's pick barely moves under a real wobble
+    const beatsGlobalSpike = aegisSurvival > spikeSurvival + 0.2; // and it's far more stable than the tall spike
+    const weightHelps = survives(aegis.best.experiment.x ?? 0, aegis.best.experiment.y ?? 0) >= survives(greedy.best.experiment.x ?? 0, greedy.best.experiment.y ?? 0) - 1e-9; // turning robustness ON never hurts stability
+    const stillHigh = aegis.best.value > 0.8; // it didn't sacrifice much height
+    const reportsTrade = aegis.tradedHeight >= 0 && aegis.robustnessOfBest > 0.3;
+    const det = (() => { const a = aegisDiscover({ space, oracle: (e) => f(e.x ?? 0, e.y ?? 0), budget: 40, seed: 7, robustWeight: 0.75 }); const b = aegisDiscover({ space, oracle: (e) => f(e.x ?? 0, e.y ?? 0), budget: 40, seed: 7, robustWeight: 0.75 }); return a.best.value === b.best.value && JSON.stringify(a.best.experiment) === JSON.stringify(b.best.experiment); })();
+    const total = (() => { try {
+        aegisDiscover({ space, oracle: () => 0, budget: 3 });
+        aegisDiscover({ space: { dims: [{ name: "x", type: "real", min: 0, max: 1 }] }, oracle: () => 1, budget: 5 });
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "CHOOSES-STABLE-OPTIMUM", pass: choosesStable, detail: `AEGIS → (${(aegis.best.experiment.x ?? 0).toFixed(2)}, ${(aegis.best.experiment.y ?? 0).toFixed(2)}) ≈ the broad stable peak (0.3,0.3)` },
+        { name: "ANSWER-SURVIVES-WOBBLE", pass: answerIsRobust, detail: `under a 0.14 nudge AEGIS's pick still scores ${aegisSurvival.toFixed(2)} (≥0.8)` },
+        { name: "BEATS-THE-FRAGILE-GLOBAL-MAX", pass: beatsGlobalSpike, detail: `${aegisSurvival.toFixed(2)} survival vs the tall spike's ${spikeSurvival.toFixed(2)} — robustness ≫ raw height` },
+        { name: "ROBUSTNESS-KNOB-NEVER-HURTS", pass: weightHelps, detail: "turning robustness ON never lowers the answer's stability" },
+        { name: "DIDNT-SACRIFICE-MUCH-HEIGHT", pass: stillHigh, detail: `AEGIS best still scores ${aegis.best.value.toFixed(3)} (≥0.8)` },
+        { name: "REPORTS-THE-TRADE", pass: reportsTrade, detail: `robustness of the chosen optimum ${aegis.robustnessOfBest}` },
+        { name: "DETERMINISTIC", pass: det, detail: "same seed → same robust optimum" },
+        { name: "TOTAL", pass: total, detail: "tiny budget / 1-D never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=aegis.js.map

package/dist/aegis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aegis.js","sourceRoot":"","sources":["../src/aegis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAA+B,GAAG,EAAE,MAAM,YAAY,CAAC;AAG9D,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AACxD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACpJ,MAAM,GAAG,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;AAW1I;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAA4H;IACxJ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC;IAAC,MAAM,GAAG,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACvF,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC9C,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACjF,MAAM,GAAG,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,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,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,MAAM,GAAG,GAAG,CAAC,CAAW,EAAc,EAAE,GAAG,MAAM,CAAC,GAAe,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;QAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9M,MAAM,GAAG,GAAkB,EAAE,CAAC;IAAC,MAAM,IAAI,GAAe,EAAE,CAAC;IAAC,MAAM,IAAI,GAAa,EAAE,CAAC;IACtF,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,CAAC,CAAW,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvJ,yGAAyG;IACzG,MAAM,SAAS,GAAG,CAAC,CAAW,EAAE,EAAE;QAChC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBAAC,GAAG,GAAG,IAAI,CAAC;gBAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAC,IAAI,CAAC,GAAG,CAAC;oBAAE,CAAC,GAAG,CAAC,CAAC;YAAC,CAAC;QAAC,CAAC;QACjL,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,CAAW,EAAE,EAAE,GAAG,IAAI,EAAE,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAAC,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtL,gFAAgF;IAChF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAa,EAAE,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAE3I,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;QAC3B,gDAAgD;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,IAAI,EAAE,GAAG,IAAI;oBAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAAC,CAAC;QAClM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACrE,MAAM,UAAU,GAAG,UAAU,EAAE,CAAC;QAChC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAa,EAAE,CAAC;YAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;QAClK,IAAI,UAAU;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrI,IAAI,IAAI,GAAoB,IAAI,EAAE,SAAS,GAAG,CAAC,QAAQ,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,EAAE,GAAG,QAAQ,CAAC;YAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,IAAI,CAAC,GAAG,EAAE;oBAAE,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC;YACzH,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAY,wCAAwC;YACvG,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAuB,kCAAkC;YACjG,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBAAC,SAAS,GAAG,KAAK,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC;YAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,uFAAuF;IACvF,SAAS,UAAU;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACrE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;YAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;gBAAC,EAAE,GAAG,CAAC,CAAC;gBAAC,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC;QAAC,CAAC;QACvL,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IACpF,CAAC;IACD,MAAM,EAAE,GAAG,UAAU,EAAG,CAAC;IACzB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACrE,IAAI,IAAI,GAAG,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,GAAG,CAAC,CAAC;IACvF,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;QACnC,gBAAgB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9E,YAAY,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACrE,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG;KAC7B,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,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,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC1H,wGAAwG;IACxG,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACzG,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACvG,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAE1E,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;IACxI,MAAM,MAAM,GAAG,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAG,oCAAoC;IAE7K,yGAAyG;IACzG,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,GAAG,IAAI,KAAK,GAAG,QAAQ,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;QAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IACjO,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3F,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAA0B,wCAAwC;IAE3G,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;IACrI,MAAM,cAAc,GAAG,aAAa,GAAG,GAAG,CAAC,CAAwB,gDAAgD;IACnH,MAAM,gBAAgB,GAAG,aAAa,GAAG,aAAa,GAAG,GAAG,CAAC,CAAM,+CAA+C;IAClH,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAG,8CAA8C;IAC3N,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,CAA0B,kCAAkC;IACrG,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,IAAI,CAAC,IAAI,KAAK,CAAC,gBAAgB,GAAG,GAAG,CAAC;IAC7E,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACjX,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,aAAa,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAE9O,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,wBAAwB,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qCAAqC,EAAE;QACzM,EAAE,IAAI,EAAE,wBAAwB,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,gDAAgD,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;QACnJ,EAAE,IAAI,EAAE,8BAA8B,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,iCAAiC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,4BAA4B,EAAE;QAC1L,EAAE,IAAI,EAAE,6BAA6B,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,2DAA2D,EAAE;QAC/H,EAAE,IAAI,EAAE,6BAA6B,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;QACjI,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,oCAAoC,KAAK,CAAC,gBAAgB,EAAE,EAAE;QACvH,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,iCAAiC,EAAE;QAC/E,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,gCAAgC,EAAE;KACzE,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/arms.d.ts

@@ -0,0 +1,70 @@
+/**
+ * STRATEGY ARMS — interchangeable per-step experiment proposers for the portfolio brain.
+ *
+ * The No-Free-Lunch theorem is the production reality: no single optimiser is best across all landscapes
+ * (smooth, rugged, low-D, high-D). So Melete does not bet on one algorithm — it runs a PORTFOLIO of arms
+ * and lets a bandit (portfolio.ts) allocate each expensive experiment to whichever arm is winning ON THIS
+ * problem. An arm is a stateful proposer: given the history so far, propose the next experiment.
+ *
+ * Arms shipped:
+ *   • kernel-ucb  — Gaussian-kernel surrogate + UCB (the strong low-D Bayesian-lite core)
+ *   • cmaes       — a (1+1) self-adaptive evolution strategy (robust in higher-D and on rugged surfaces,
+ *                   where the kernel surrogate degrades — fixes the high-D failure of a pure-BO engine)
+ *   • resonance   — the wave-interference field (a diversity/exploration hedge; earns budget only when it
+ *                   actually helps — honest: it is not strong alone, but a portfolio loses nothing by
+ *                   holding a hedge that the bandit can ignore)
+ *   • random      — uniform exploration (the escape hatch / baseline)
+ *
+ * Each arm is created fresh per run via a factory (closure-held state), so a discovery is deterministic
+ * and reproducible. Proposers avoid already-seen experiments.
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Goal, type Observation } from "./engine.js";
+export interface ArmContext {
+    space: Space;
+    obs: Observation[];
+    t: number;
+    budget: number;
+    rnd: () => number;
+    goal: Goal;
+}
+export interface Arm {
+    name: string;
+    propose: (ctx: ArmContext) => Experiment;
+}
+/** kernel-UCB: dense grid + local cloud candidates; pick argmax(surrogate mean + annealed·uncertainty). */
+export declare function armKernelUCB(bandwidth?: number, kappa0?: number): Arm;
+/** (1+1) self-adaptive evolution strategy — sample N(best, σ); σ grows when stuck, shrinks on success. */
+export declare function armCMAES(sigma0?: number): Arm;
+/** Wave-interference field (diversity hedge). Honest: weak alone; the bandit only funds it when it helps. */
+export declare function armResonance(sigma?: number, k0?: number, rho?: number): Arm;
+export declare function armRandom(): Arm;
+/** Real GP surrogate + Expected Improvement — the gold-standard sample-efficient acquisition. */
+export declare function armGP(lengthscale?: number, noise?: number): Arm;
+/** Simulated annealing arm — temperature-annealed random walk from the best; escapes via occasional far jumps. */
+export declare function armSimAnneal(temp0?: number): Arm;
+/** Trust-region arm — coordinate steps within a region around the best; region tightens as the run progresses. */
+export declare function armTrustRegion(radius0?: number): Arm;
+/** Maximin space-filler — propose the point FARTHEST from every prior experiment. Pure global coverage;
+ * measured to materially help on rugged/multimodal surfaces (finds un-sampled basins the others miss). */
+export declare function armMaximin(pool?: number): Arm;
+/** Basin-hopping — restart from a fresh random anchor every few calls, then refine locally around it.
+ * Escapes the global-best trap by deliberately exploring OTHER basins of a multimodal surface. */
+export declare function armBasinHop(restartEvery?: number, radius?: number): Arm;
+/** Differential Evolution arm — DE/rand/1: combine three past experiments (a + F·(b−c)) + crossover with
+ * the best. A population-based global optimiser that is strong on rugged/multimodal surfaces. */
+export declare function armDiffEvolution(F?: number, CR?: number): Arm;
+/** The production portfolio. Curated by MEASURED robustness (see bench.robustnessBench): the strong
+ * convergers (gp, cmaes, kernel-ucb) + a local refiner (trust-region) + escape/diversity (anneal, random).
+ * resonance stays available as an arm but is not in the default set (measured weakest; keep the bandit lean). */
+export declare function defaultArms(): Arm[];
+export declare function allArms(): Arm[];
+export declare function armsGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=arms.d.ts.map

package/dist/arms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arms.d.ts","sourceRoot":"","sources":["../src/arms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAA4D,MAAM,YAAY,CAAC;AACnH,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,WAAW,UAAU;IAAG,KAAK,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,WAAW,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,MAAM,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE;AAC1H,MAAM,WAAW,GAAG;IAAG,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,CAAC,GAAG,EAAE,UAAU,KAAK,UAAU,CAAA;CAAE;AAM/E,2GAA2G;AAC3G,wBAAgB,YAAY,CAAC,SAAS,SAAQ,EAAE,MAAM,SAAM,GAAG,GAAG,CAqBjE;AAED,0GAA0G;AAC1G,wBAAgB,QAAQ,CAAC,MAAM,SAAM,GAAG,GAAG,CAgB1C;AAED,6GAA6G;AAC7G,wBAAgB,YAAY,CAAC,KAAK,SAAO,EAAE,EAAE,SAAM,EAAE,GAAG,SAAO,GAAG,GAAG,CAuBpE;AAED,wBAAgB,SAAS,IAAI,GAAG,CAE/B;AAgBD,iGAAiG;AACjG,wBAAgB,KAAK,CAAC,WAAW,SAAO,EAAE,KAAK,SAAO,GAAG,GAAG,CA2B3D;AAED,kHAAkH;AAClH,wBAAgB,YAAY,CAAC,KAAK,SAAM,GAAG,GAAG,CAe7C;AAED,kHAAkH;AAClH,wBAAgB,cAAc,CAAC,OAAO,SAAM,GAAG,GAAG,CAmBjD;AAED;0GAC0G;AAC1G,wBAAgB,UAAU,CAAC,IAAI,SAAM,GAAG,GAAG,CAc1C;AAED;kGACkG;AAClG,wBAAgB,WAAW,CAAC,YAAY,SAAI,EAAE,MAAM,SAAO,GAAG,GAAG,CAYhE;AAED;iGACiG;AACjG,wBAAgB,gBAAgB,CAAC,CAAC,SAAM,EAAE,EAAE,SAAM,GAAG,GAAG,CAmBvD;AAED;;iHAEiH;AAGjH,wBAAgB,WAAW,IAAI,GAAG,EAAE,CAA8H;AAGlK,wBAAgB,OAAO,IAAI,GAAG,EAAE,CAAkK;AAIlM,wBAAgB,YAAY,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,CA6BjH"}