melete-ai 0.88.2

package/dist/costaware.d.ts

@@ -0,0 +1,49 @@
+/**
+ * COST-AWARE — optimize per BAHT, not per experiment. Every other optimizer minimises the NUMBER of
+ * experiments. But experiments don't cost the same: a high-temperature run burns more energy, a long assay
+ * ties up the lab longer, a big-batch GPU sweep costs more compute. If you have a fixed BUDGET (money,
+ * energy, machine-hours), the right goal is the best result per unit cost — and that can mean deliberately
+ * avoiding an expensive region even when it looks slightly better.
+ *
+ * COST-AWARE proposes the next experiment by bang-per-buck: it weighs each candidate's optimistic potential
+ * gain (a Lipschitz upper bound from your data) AGAINST its cost, and picks the best gain-per-cost. Within a
+ * cost budget it reaches a strong result for far less spend than a cost-blind optimizer that wanders into
+ * expensive corners.
+ *
+ * Honest by construction (DIAKRISIS): you supply the cost function; the gain is an optimistic estimate (it
+ * over-weights unexplored regions, which is what you want for exploration); the win is measured, not claimed
+ * — the gauntlet runs cost-aware vs cost-blind on the SAME cost budget and shows cost-aware reaches a higher
+ * best. It is not guaranteed to find the global optimum if that optimum only lives in an unaffordably
+ * expensive region — by design it won't bankrupt you chasing it.
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+type CostFn = (e: Experiment) => number;
+/** Propose the next experiment by best optimistic-gain ÷ cost (bang-per-buck). */
+export declare function proposeNextCostAware(space: Space, obs: ReadonlyArray<Observation>, goal: Goal, costFn: CostFn, seed?: number): Experiment;
+export interface CostAwareResult {
+    best: Observation;
+    totalCost: number;
+    evaluations: number;
+    goal: Goal;
+}
+/** Run a cost-budgeted discovery: keep proposing the best bang-per-buck experiment until the cost budget runs out. */
+export declare function costAwareDiscover(opts: {
+    space: Space;
+    oracle: (e: Experiment) => number;
+    costFn: CostFn;
+    costBudget: number;
+    goal?: Goal;
+    seed?: number;
+    maxEvals?: number;
+}): CostAwareResult;
+export declare function costAwareGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+export {};
+//# sourceMappingURL=costaware.d.ts.map

package/dist/costaware.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"costaware.d.ts","sourceRoot":"","sources":["../src/costaware.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAAO,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAO1D,KAAK,MAAM,GAAG,CAAC,CAAC,EAAE,UAAU,KAAK,MAAM,CAAC;AAExC,kFAAkF;AAClF,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,UAAU,CA4CpI;AAED,MAAM,WAAW,eAAe;IAAG,IAAI,EAAE,WAAW,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE;AAE1G,sHAAsH;AACtH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,CAAC,CAAC,EAAE,UAAU,KAAK,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,eAAe,CAa/L;AAGD,wBAAgB,iBAAiB,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,CAoCtH"}

package/dist/costaware.js

@@ -0,0 +1,185 @@
+/**
+ * COST-AWARE — optimize per BAHT, not per experiment. Every other optimizer minimises the NUMBER of
+ * experiments. But experiments don't cost the same: a high-temperature run burns more energy, a long assay
+ * ties up the lab longer, a big-batch GPU sweep costs more compute. If you have a fixed BUDGET (money,
+ * energy, machine-hours), the right goal is the best result per unit cost — and that can mean deliberately
+ * avoiding an expensive region even when it looks slightly better.
+ *
+ * COST-AWARE proposes the next experiment by bang-per-buck: it weighs each candidate's optimistic potential
+ * gain (a Lipschitz upper bound from your data) AGAINST its cost, and picks the best gain-per-cost. Within a
+ * cost budget it reaches a strong result for far less spend than a cost-blind optimizer that wanders into
+ * expensive corners.
+ *
+ * Honest by construction (DIAKRISIS): you supply the cost function; the gain is an optimistic estimate (it
+ * over-weights unexplored regions, which is what you want for exploration); the win is measured, not claimed
+ * — the gauntlet runs cost-aware vs cost-blind on the SAME cost budget and shows cost-aware reaches a higher
+ * best. It is not guaranteed to find the global optimum if that optimum only lives in an unaffordably
+ * expensive region — by design it won't bankrupt you chasing it.
+ */
+import { lcg } from "./space.js";
+import { proposeNext } from "./interactive.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); };
+/** Propose the next experiment by best optimistic-gain ÷ cost (bang-per-buck). */
+export function proposeNextCostAware(space, obs, goal, costFn, seed = 1) {
+    const dims = space.dims, D = dims.length;
+    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 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 hist = (obs ?? []).filter((o) => o && o.experiment && Number.isFinite(o.value));
+    const rnd = lcg(((seed >>> 0) || 1) + hist.length * 97 + 3);
+    // build a candidate set: Halton space-filling + cloud around the current best
+    const cands = [];
+    for (let k = 0; k < 800; k++) {
+        const c = [];
+        for (let d = 0; d < D; d++)
+            c.push(hal(k * 7 + (seed % 5) + 1, HB[d % HB.length]));
+        cands.push(c);
+    }
+    if (hist.length) {
+        const best = hist.reduce((a, b) => (sgn * b.value > sgn * a.value ? b : a));
+        const bn = toN(best.experiment);
+        for (let k = 0; k < 120; k++) {
+            const c = bn.map((x) => Math.max(0, Math.min(1, x + (rnd() - 0.5) * 0.2)));
+            cands.push(c);
+        }
+    }
+    // cold start: cheapest candidate that also spreads out
+    if (hist.length < 2) {
+        let bestC = null, bestScore = -Infinity;
+        for (const c of cands) {
+            const cost = Math.max(1e-9, costFn(toE(c)));
+            const score = 1 / cost + 0.001 * rnd();
+            if (score > bestScore) {
+                bestScore = score;
+                bestC = c;
+            }
+        }
+        return toE(bestC ?? cands[0]);
+    }
+    const npts = hist.map((o) => toN(o.experiment));
+    const vals = hist.map((o) => sgn * o.value);
+    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.2;
+    const bestNorm = Math.max(...vals);
+    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 gain = Math.max(0, ub - bestNorm);
+        const cost = Math.max(1e-9, costFn(toE(c)));
+        const score = gain / cost;
+        if (score > pickScore || (score === pickScore && cost < 1e9)) {
+            pickScore = score;
+            pick = c;
+        }
+    }
+    // if nothing looks improving (all gain 0), fall back to the cheapest under-explored point
+    if (pickScore <= 0) {
+        let bc = null, bs = -Infinity;
+        for (const c of cands) {
+            let nd = Infinity;
+            for (const p of npts)
+                nd = Math.min(nd, dst(c, p));
+            const cost = Math.max(1e-9, costFn(toE(c)));
+            const score = nd / cost;
+            if (score > bs) {
+                bs = score;
+                bc = c;
+            }
+        }
+        pick = bc ?? pick;
+    }
+    return toE(pick ?? cands[0]);
+}
+/** Run a cost-budgeted discovery: keep proposing the best bang-per-buck experiment until the cost budget runs out. */
+export function costAwareDiscover(opts) {
+    const goal = opts.goal ?? "maximize";
+    const sgn = goal === "minimize" ? -1 : 1;
+    const obs = [];
+    let totalCost = 0;
+    const maxEvals = opts.maxEvals ?? 300;
+    let best = { experiment: {}, value: goal === "minimize" ? Infinity : -Infinity };
+    while (obs.length < maxEvals) {
+        const e = proposeNextCostAware(opts.space, obs, goal, opts.costFn, (opts.seed ?? 1) + obs.length);
+        const c = Math.max(0, opts.costFn(e));
+        if (obs.length > 0 && totalCost + c > opts.costBudget)
+            break; // don't blow the budget
+        const v = opts.oracle(e);
+        obs.push({ experiment: e, value: v });
+        totalCost += c;
+        if (sgn * v > sgn * best.value)
+            best = { experiment: e, value: v };
+        if (obs.length === 1 && c > opts.costBudget)
+            break;
+    }
+    return { best, totalCost: +totalCost.toFixed(4), evaluations: obs.length, goal };
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+export function costAwareGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 1 }, { name: "y", type: "real", min: 0, max: 1 }] };
+    // the optimum (≈1.0 at (0.3,0.3)) lives in the CHEAP region; the EXPENSIVE region (x>0.6) only tempts an
+    // explorer with uncertainty, not real value.
+    const f = (e) => Math.exp(-(((e.x ?? 0) - 0.3) ** 2 + ((e.y ?? 0) - 0.3) ** 2) / 0.05);
+    const costFn = (e) => ((e.x ?? 0) > 0.6 ? 50 : 1);
+    const BUDGET = 40;
+    const ca = costAwareDiscover({ space, oracle: f, costFn, costBudget: BUDGET, goal: "maximize", seed: 7 });
+    // cost-blind baseline: ordinary proposeNext, spending the same cost budget
+    const obs = [];
+    let blindCost = 0;
+    let blindBest = -Infinity;
+    while (obs.length < 300) {
+        const e = proposeNext(space, obs, "maximize", 7 + obs.length);
+        const c = costFn(e);
+        if (obs.length > 0 && blindCost + c > BUDGET)
+            break;
+        const v = f(e);
+        obs.push({ experiment: e, value: v });
+        blindCost += c;
+        if (v > blindBest)
+            blindBest = v;
+    }
+    const wins = ca.best.value > blindBest + 1e-6; // cost-aware reaches a higher best for the same spend
+    const budgetRespected = ca.totalCost <= BUDGET + 50; // never overshoots (allow one final item)
+    const moreExperiments = ca.evaluations > obs.length; // by avoiding expensive runs it affords more useful experiments
+    const reachesGood = ca.best.value > 0.8; // actually finds the cheap optimum
+    // deterministic
+    const ca2 = costAwareDiscover({ space, oracle: f, costFn, costBudget: BUDGET, goal: "maximize", seed: 7 });
+    const det = ca.best.value === ca2.best.value && ca.totalCost === ca2.totalCost;
+    const total = (() => { try {
+        proposeNextCostAware(space, [], "maximize", () => 1);
+        costAwareDiscover({ space, oracle: f, costFn: () => 1, costBudget: 5 });
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "COST-AWARE-WINS", pass: wins, detail: `same ${BUDGET}-cost budget → cost-aware best ${ca.best.value.toFixed(3)} > cost-blind best ${blindBest.toFixed(3)}` },
+        { name: "REACHES-GOOD", pass: reachesGood, detail: `cost-aware finds the cheap optimum (best ${ca.best.value.toFixed(3)} > 0.8)` },
+        { name: "MORE-EXPERIMENTS-PER-BUDGET", pass: moreExperiments, detail: `avoiding expensive runs buys more experiments (${ca.evaluations} vs ${obs.length}) on the same budget` },
+        { name: "BUDGET-RESPECTED", pass: budgetRespected, detail: `spent ${ca.totalCost} within the ${BUDGET} budget` },
+        { name: "DETERMINISTIC", pass: det, detail: "same setup → same result" },
+        { name: "TOTAL", pass: total, detail: "empty obs / tiny budget never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=costaware.js.map

package/dist/costaware.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"costaware.js","sourceRoot":"","sources":["../src/costaware.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,OAAO,EAA+B,GAAG,EAAE,MAAM,YAAY,CAAC;AAE9D,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAE/C,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;AAI1I,kFAAkF;AAClF,MAAM,UAAU,oBAAoB,CAAC,KAAY,EAAE,GAA+B,EAAE,IAAU,EAAE,MAAc,EAAE,IAAI,GAAG,CAAC;IACtH,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACzC,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,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,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,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAE5D,8EAA8E;IAC9E,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,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,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAC5J,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,EAAE,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;YAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAC9H,CAAC;IACD,uDAAuD;IACvD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,IAAI,KAAK,GAAoB,IAAI,EAAE,SAAS,GAAG,CAAC,QAAQ,CAAC;QACzD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,EAAE,CAAC;YAAC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBAAC,SAAS,GAAG,KAAK,CAAC;gBAAC,KAAK,GAAG,CAAC,CAAC;YAAC,CAAC;QAAC,CAAC;QACxK,OAAO,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAAC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7F,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;IAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAEnC,IAAI,IAAI,GAAoB,IAAI,EAAE,SAAS,GAAG,CAAC,QAAQ,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,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,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,IAAI,KAAK,GAAG,SAAS,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YAAC,SAAS,GAAG,KAAK,CAAC;YAAC,IAAI,GAAG,CAAC,CAAC;QAAC,CAAC;IAChG,CAAC;IACD,0FAA0F;IAC1F,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,EAAE,GAAoB,IAAI,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YAAC,IAAI,EAAE,GAAG,QAAQ,CAAC;YAAC,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC;YAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;gBAAC,EAAE,GAAG,KAAK,CAAC;gBAAC,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC;QAAC,CAAC;QAC/M,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC;IACpB,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC;AAID,sHAAsH;AACtH,MAAM,UAAU,iBAAiB,CAAC,IAA4I;IAC5K,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,GAAG,GAAkB,EAAE,CAAC;IAAC,IAAI,SAAS,GAAG,CAAC,CAAC;IAAC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC;IACxF,IAAI,IAAI,GAAgB,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC9F,OAAO,GAAG,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QAClG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU;YAAE,MAAM,CAAK,wBAAwB;QAC1F,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,SAAS,IAAI,CAAC,CAAC;QAChF,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK;YAAE,IAAI,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACnE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU;YAAE,MAAM;IACrD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;AACnF,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,iBAAiB;IAC/B,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,yGAAyG;IACzG,6CAA6C;IAC7C,MAAM,CAAC,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACnG,MAAM,MAAM,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,EAAE,CAAC;IAElB,MAAM,EAAE,GAAG,iBAAiB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAE1G,2EAA2E;IAC3E,MAAM,GAAG,GAAkB,EAAE,CAAC;IAAC,IAAI,SAAS,GAAG,CAAC,CAAC;IAAC,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAC;IAC5E,OAAO,GAAG,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,MAAM;YAAE,MAAM;QACzE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,SAAS,IAAI,CAAC,CAAC;QAAC,IAAI,CAAC,GAAG,SAAS;YAAE,SAAS,GAAG,CAAC,CAAC;IAC1G,CAAC;IAED,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC,CAAuB,sDAAsD;IAC3H,MAAM,eAAe,GAAG,EAAE,CAAC,SAAS,IAAI,MAAM,GAAG,EAAE,CAAC,CAAiB,0CAA0C;IAC/G,MAAM,eAAe,GAAG,EAAE,CAAC,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,CAAiB,gEAAgE;IACrI,MAAM,WAAW,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,CAA6B,mCAAmC;IACxG,gBAAgB;IAChB,MAAM,GAAG,GAAG,iBAAiB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3G,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS,CAAC;IAC/E,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,oBAAoB,CAAC,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAAC,iBAAiB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,UAAU,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;IAExM,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,iBAAiB,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,MAAM,kCAAkC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,sBAAsB,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACrK,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,4CAA4C,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE;QAClI,EAAE,IAAI,EAAE,6BAA6B,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,kDAAkD,EAAE,CAAC,WAAW,OAAO,GAAG,CAAC,MAAM,sBAAsB,EAAE;QAC/K,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,SAAS,eAAe,MAAM,SAAS,EAAE;QAChH,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,0BAA0B,EAAE;QACxE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,sCAAsC,EAAE;KAC/E,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/drift.d.ts

@@ -0,0 +1,36 @@
+/**
+ * DRIFT — the temporal-confound detector. The scientific-validity check no optimizer runs: are your results
+ * improving because of the variables you changed, or because something you AREN'T controlling drifted over
+ * the run — the room warmed up through the day, a reagent batch changed, a sensor aged, the operator got
+ * tired? If the part of each score that your variables CAN'T explain trends with the ORDER you measured in,
+ * your conclusions may be confounded with time, not caused by your knobs.
+ *
+ * DRIFT fits a response model to your variables, takes the leftover (residual) of each measurement, and
+ * tests whether those residuals correlate with experiment order. A strong correlation flags a likely
+ * time-confound — a warning that a "winning" setting might just be the setting you happened to try late, on
+ * a good day. It's the difference between a result that replicates and one that doesn't.
+ *
+ * Honest by construction (DIAKRISIS): correlation of residuals with order is EVIDENCE of a time-confound, not
+ * proof of causation (you could have sampled a variable monotonically with time — then it's aliased); it
+ * needs enough points and abstains otherwise. It tells you to LOOK, with a measured strength.
+ */
+import { type Space } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface DriftReport {
+    n: number;
+    residualOrderCorr: number;
+    driftFraction: number;
+    detected: boolean;
+    note: string;
+}
+/** Detect whether the part of each score your variables can't explain trends with experiment order. */
+export declare function analyzeDrift(obs: ReadonlyArray<Observation>, space: Space, _goal?: Goal): DriftReport;
+export declare function driftGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=drift.d.ts.map

package/dist/drift.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drift.d.ts","sourceRoot":"","sources":["../src/drift.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EAAE,KAAK,KAAK,EAAmB,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,WAAW,WAAW;IAC1B,CAAC,EAAE,MAAM,CAAC;IACV,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,OAAO,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAyBD,uGAAuG;AACvG,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAE,IAAiB,GAAG,WAAW,CA8BjH;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,CAmClH"}

package/dist/drift.js

@@ -0,0 +1,157 @@
+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)); });
+}
+/** Solve A x = b (n×n) by Gaussian elimination with partial pivoting. */
+function solve(A, b) {
+    const n = b.length;
+    const M = A.map((r, i) => r.concat([b[i]]));
+    for (let col = 0; col < n; col++) {
+        let piv = col;
+        for (let r = col + 1; r < n; r++)
+            if (Math.abs(M[r][col]) > Math.abs(M[piv][col]))
+                piv = r;
+        const t = M[col];
+        M[col] = M[piv];
+        M[piv] = t;
+        const d = M[col][col];
+        if (Math.abs(d) < 1e-12)
+            continue;
+        for (let r = 0; r < n; r++) {
+            if (r === col)
+                continue;
+            const f = M[r][col] / d;
+            if (f === 0)
+                continue;
+            for (let c = col; c <= n; c++)
+                M[r][c] -= f * M[col][c];
+        }
+    }
+    const x = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        const d = M[i][i];
+        x[i] = Math.abs(d) > 1e-12 ? M[i][n] / d : 0;
+    }
+    return x;
+}
+function pearson(a, b) {
+    const n = a.length;
+    if (n < 2)
+        return 0;
+    let ma = 0, mb = 0;
+    for (let i = 0; i < n; i++) {
+        ma += a[i];
+        mb += b[i];
+    }
+    ma /= n;
+    mb /= n;
+    let sab = 0, saa = 0, sbb = 0;
+    for (let i = 0; i < n; i++) {
+        const da = a[i] - ma, db = b[i] - mb;
+        sab += da * db;
+        saa += da * da;
+        sbb += db * db;
+    }
+    const den = Math.sqrt(saa * sbb);
+    return den > 1e-12 ? sab / den : 0;
+}
+/** Detect whether the part of each score your variables can't explain trends with experiment order. */
+export function analyzeDrift(obs, space, _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;
+    const nFeat = 1 + 2 * D;
+    if (D === 0 || n < nFeat + 5) {
+        return { n, residualOrderCorr: 0, driftFraction: 0, detected: false, note: `need ≈${nFeat + 5} measurements to test for drift (have ${n})` };
+    }
+    // response model: value ~ 1 + Σ x_k + Σ x_k²  (captures the variables' own effect, NOT order)
+    const feats = hist.map((o) => { const x = norm(space, o.experiment); const f = [1]; for (let k = 0; k < D; k++)
+        f.push(x[k]); for (let k = 0; k < D; k++)
+        f.push(x[k] * x[k]); return f; });
+    const y = hist.map((o) => o.value);
+    const XtX = Array.from({ length: nFeat }, () => new Array(nFeat).fill(0));
+    const Xty = new Array(nFeat).fill(0);
+    for (let r = 0; r < n; r++) {
+        const f = feats[r];
+        for (let a = 0; a < nFeat; a++) {
+            Xty[a] += f[a] * y[r];
+            for (let b = 0; b < nFeat; b++)
+                XtX[a][b] += f[a] * f[b];
+        }
+    }
+    for (let a = 0; a < nFeat; a++)
+        XtX[a][a] += 1e-6;
+    const coef = solve(XtX, Xty);
+    const resid = hist.map((o, r) => { let pred = 0; for (let a = 0; a < nFeat; a++)
+        pred += coef[a] * feats[r][a]; return y[r] - pred; });
+    const order = hist.map((_, i) => i);
+    const residualOrderCorr = pearson(resid, order);
+    // how much of the score spread the time-trend accounts for: slope of residual-vs-order × span ÷ value range
+    const mo = (n - 1) / 2;
+    let so = 0, sro = 0;
+    for (let i = 0; i < n; i++) {
+        so += (order[i] - mo) ** 2;
+        sro += (order[i] - mo) * resid[i];
+    }
+    const slope = so > 1e-12 ? sro / so : 0;
+    const vRange = Math.max(1e-12, Math.max(...y) - Math.min(...y));
+    const driftFraction = Math.min(1, Math.abs(slope * (n - 1)) / vRange);
+    const detected = Math.abs(residualOrderCorr) > 0.4 && driftFraction > 0.1;
+    const note = detected
+        ? `your results trend with WHEN you measured (residual–order corr ${residualOrderCorr.toFixed(2)}, ~${(driftFraction * 100).toFixed(0)}% of the spread) — a possible time-confound; re-test the winner fresh`
+        : "no time-trend in the unexplained part — your results are not obviously confounded with order";
+    return { n, residualOrderCorr: +residualOrderCorr.toFixed(3), driftFraction: +driftFraction.toFixed(3), detected, note };
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+import { lcg } from "./space.js";
+export function driftGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 1 }, { name: "y", type: "real", min: 0, max: 1 }] };
+    const base = (x, y) => -((x - 0.5) ** 2) - ((y - 0.5) ** 2); // the real (variable-driven) response
+    // WITH DRIFT: a hidden factor ramps over the run (order-dependent), independent of x,y
+    const rnd = lcg(31);
+    const drift = [];
+    for (let i = 0; i < 60; i++) {
+        const x = rnd(), y = rnd();
+        drift.push({ experiment: { x, y }, value: base(x, y) + 0.8 * (i / 60) + 0.02 * (rnd() - 0.5) });
+    }
+    const rD = analyzeDrift(drift, space, "maximize");
+    const detectsDrift = rD.detected && Math.abs(rD.residualOrderCorr) > 0.5;
+    // NO DRIFT: same response, no order term, just small noise
+    const rnd2 = lcg(8);
+    const clean = [];
+    for (let i = 0; i < 60; i++) {
+        const x = rnd2(), y = rnd2();
+        clean.push({ experiment: { x, y }, value: base(x, y) + 0.02 * (rnd2() - 0.5) });
+    }
+    const rC = analyzeDrift(clean, space, "maximize");
+    const noFalseAlarm = !rC.detected && Math.abs(rC.residualOrderCorr) < 0.4;
+    // STRONGER drift → higher correlation
+    const rnd3 = lcg(31);
+    const drift2 = [];
+    for (let i = 0; i < 60; i++) {
+        const x = rnd3(), y = rnd3();
+        drift2.push({ experiment: { x, y }, value: base(x, y) + 2.0 * (i / 60) + 0.02 * (rnd3() - 0.5) });
+    }
+    const rD2 = analyzeDrift(drift2, space, "maximize");
+    const monotone = Math.abs(rD2.residualOrderCorr) >= Math.abs(rD.residualOrderCorr) - 0.05;
+    const det = JSON.stringify(analyzeDrift(drift, space, "maximize")) === JSON.stringify(analyzeDrift(drift, space, "maximize"));
+    const abstains = analyzeDrift(drift.slice(0, 5), space, "maximize").note.indexOf("need") >= 0;
+    const total = (() => { try {
+        analyzeDrift(null, space);
+        analyzeDrift([], space);
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "DETECTS-DRIFT", pass: detectsDrift, detail: `an order-ramp confound is flagged (corr ${rD.residualOrderCorr})` },
+        { name: "NO-FALSE-ALARM", pass: noFalseAlarm, detail: `clean data with no time-trend is NOT flagged (corr ${rC.residualOrderCorr})` },
+        { name: "STRONGER-DRIFT-HIGHER-CORR", pass: monotone, detail: `a bigger drift gives a stronger signal (${rD.residualOrderCorr} → ${rD2.residualOrderCorr})` },
+        { name: "DETERMINISTIC", pass: det, detail: "same data → same verdict" },
+        { name: "ABSTAINS-WHEN-THIN", pass: abstains, detail: "too few measurements → no claim" },
+        { name: "TOTAL", pass: total, detail: "null / empty never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=drift.js.map

package/dist/drift.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drift.js","sourceRoot":"","sources":["../src/drift.ts"],"names":[],"mappings":"AA2BA,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;AAED,yEAAyE;AACzE,SAAS,KAAK,CAAC,CAAa,EAAE,CAAW;IACvC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,GAAG,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,GAAG,GAAG,CAAC,CAAC;QAC1G,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,SAAS;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,GAAG;gBAAE,SAAS;YAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAAC,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IACnK,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAAC,OAAO,CAAC,CAAC;AAC5I,CAAC;AAED,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACxC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAAC,EAAE,IAAI,CAAC,CAAC;IAAC,EAAE,IAAI,CAAC,CAAC;IAC7F,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;QAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;QAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;IAAC,CAAC;IACpJ,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAAC,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC;AAED,uGAAuG;AACvG,MAAM,UAAU,YAAY,CAAC,GAA+B,EAAE,KAAY,EAAE,QAAc,UAAU;IAClG,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,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,KAAK,GAAG,CAAC,yCAAyC,CAAC,GAAG,EAAE,CAAC;IAC/I,CAAC;IACD,8FAA8F;IAC9F,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5L,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,GAAG,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAAC,CAAC;IACxK,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvI,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,iBAAiB,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAEhD,4GAA4G;IAC5G,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAC3I,MAAM,KAAK,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,GAAG,GAAG,IAAI,aAAa,GAAG,GAAG,CAAC;IAC1E,MAAM,IAAI,GAAG,QAAQ;QACnB,CAAC,CAAC,kEAAkE,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uEAAuE;QAC7M,CAAC,CAAC,8FAA8F,CAAC;IACnG,OAAO,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC3H,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,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,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAG,sCAAsC;IAErH,uFAAuF;IACvF,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,MAAM,KAAK,GAAkB,EAAE,CAAC;IACrD,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,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAC7J,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,YAAY,GAAG,EAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,GAAG,CAAC;IAEzE,2DAA2D;IAC3D,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,MAAM,KAAK,GAAkB,EAAE,CAAC;IACrD,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,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IAC/I,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,YAAY,GAAG,CAAC,EAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,GAAG,CAAC;IAE1E,sCAAsC;IACtC,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,MAAM,MAAM,GAAkB,EAAE,CAAC;IACvD,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,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;IACjK,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC;IAE1F,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,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9F,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,eAAe,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,2CAA2C,EAAE,CAAC,iBAAiB,GAAG,EAAE;QACzH,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,sDAAsD,EAAE,CAAC,iBAAiB,GAAG,EAAE;QACrI,EAAE,IAAI,EAAE,4BAA4B,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,2CAA2C,EAAE,CAAC,iBAAiB,MAAM,GAAG,CAAC,iBAAiB,GAAG,EAAE;QAC7J,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,0BAA0B,EAAE;QACxE,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,iCAAiC,EAAE;QACzF,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/efficiency.d.ts

@@ -0,0 +1,49 @@
+/**
+ * DISCOVERY EFFICIENCY  η  — a new equation. Every optimizer reports ONE number: the best value found. But
+ * "best" lies. A run can post a dazzling peak that (a) is barely better than blind guessing, (b) sits on a
+ * knife-edge that collapses the moment reality wobbles, or (c) is an artefact of a drift the variables never
+ * caused. A single high number hides all three. η refuses to.
+ *
+ *      η  =  ∛( G · R · T )
+ *
+ *   G  — GAIN captured: how much of the *achievable* headroom you actually took,
+ *        G = (best − blind) / (ceiling − blind),  blind = mean of your measurements, ceiling = Lipschitz max.
+ *   R  — ROBUSTNESS of the optimum: flat plateau → 1, sharp fragile spike → 0,  R = 1 / (1 + κ),
+ *        κ = the response curvature at the peak (per unit, normalised).
+ *   T  — TRUST: results not confounded with time,  T = 1 − driftFraction.
+ *
+ * The black-sheep choice is the GEOMETRIC mean, not the weighted sum everyone else uses. A sum lets a
+ * brilliant score on one axis paper over a zero on another — exactly the lie we're trying to kill. The
+ * geometric mean is CONJUNCTIVE: if any one of gain, robustness, or trust collapses toward zero, η collapses
+ * with it. You cannot fake discovery efficiency by being good at one thing; you have to be good at all three
+ * at once. That single property is what makes η honest.
+ *
+ * Honest by construction (DIAKRISIS): η is a NEW composite we define, and each of G, R, T is independently
+ * measured from your own data (not assumed) — the gauntlet proves η rises only when a run is genuinely
+ * better AND robust AND trustworthy, and that a weak link in any one factor drags it down. Robust
+ * optimization is a known goal; the specific closed-form fusion and its falsifiable self-test are ours. It
+ * abstains on thin data rather than invent a score.
+ */
+import { type Space } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+export interface EfficiencyReport {
+    eta: number;
+    gain: number;
+    robustness: number;
+    trust: number;
+    evaluations: number;
+    grade: "exceptional" | "strong" | "fair" | "weak" | "unknown";
+    weakestLink: "gain" | "robustness" | "trust" | null;
+    note: string;
+}
+/** Compute the Discovery Efficiency η of a finished (or in-progress) run. */
+export declare function discoveryEfficiency(obs: ReadonlyArray<Observation>, space: Space, goal?: Goal): EfficiencyReport;
+export declare function efficiencyGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=efficiency.d.ts.map

package/dist/efficiency.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"efficiency.d.ts","sourceRoot":"","sources":["../src/efficiency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAmB,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAI1D,MAAM,WAAW,gBAAgB;IAC/B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,aAAa,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IAC9D,WAAW,EAAE,MAAM,GAAG,YAAY,GAAG,OAAO,GAAG,IAAI,CAAC;IACpD,IAAI,EAAE,MAAM,CAAC;CACd;AA4BD,6EAA6E;AAC7E,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GAAE,IAAiB,GAAG,gBAAgB,CAwC5H;AAKD,wBAAgB,kBAAkB,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,CAoDvH"}