open-multi-agent-kit 0.99.0 → 1.2.0

package/dist/metacognition/decision.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Minimum expected loss over a finite set of terminal decisions.
+ * losses[d][h] is the loss of decision d when hypothesis h is true.
+ */
+export declare function bayesRisk(prior: readonly number[], losses: readonly (readonly number[])[]): number;
+export interface ExperimentBranch {
+    readonly outcome: number;
+    readonly probability: number;
+    readonly posterior: readonly number[];
+    readonly risk: number;
+}
+export interface ExperimentValue {
+    readonly before: number;
+    readonly expectedAfter: number;
+    readonly grossValue: number;
+    readonly cost: number;
+    readonly netValue: number;
+    readonly branches: readonly ExperimentBranch[];
+}
+/**
+ * One-step value of information: Bayes risk before minus expected Bayes risk
+ * after observing the experiment outcome, minus the experiment cost.
+ * likelihoodByHypothesis[h][o] = P(outcome o | hypothesis h).
+ * Zero-probability outcomes are skipped; the caller must treat an actually
+ * observed impossible outcome as a model mismatch, never renormalize it away.
+ */
+export declare function experimentValue(prior: readonly number[], losses: readonly (readonly number[])[], likelihoodByHypothesis: readonly (readonly number[])[], cost: number): ExperimentValue;
+/** Brier score for one binary event. */
+export declare function brier(predicted: number, outcome: 0 | 1): number;
+/** Negative log-likelihood surprise for one binary event (epsilon-clamped). */
+export declare function surprise(predicted: number, outcome: 0 | 1, epsilon?: number): number;
+/**
+ * Beta posterior mean for an independent binary task outcome under a fixed
+ * policy in a homogeneous condition bucket. The prior (alpha, beta) must be
+ * declared by the host; this is not a learned-calibration claim.
+ */
+export declare function betaPosteriorMean(alpha: number, beta: number, successes: number, failures: number): number;
+/**
+ * CUSUM-style drift accumulator over per-observation losses in one condition
+ * bucket. Returns the new accumulator value; the caller compares it against
+ * a host-declared threshold h_g. Not a guaranteed false-alarm rate.
+ */
+export declare function driftStatistic(previous: number, loss: number, referenceMean: number, slack: number): number;
+//# sourceMappingURL=decision.d.ts.map

package/dist/metacognition/decision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decision.d.ts","sourceRoot":"","sources":["../../src/metacognition/decision.ts"],"names":[],"mappings":"AAaA;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,CAclG;AAED,MAAM,WAAW,gBAAgB;IAChC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACtB;AACD,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;CAC/C;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC9B,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACtC,sBAAsB,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACtD,IAAI,EAAE,MAAM,GACV,eAAe,CA8BjB;AAED,wCAAwC;AACxC,wBAAgB,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAI/D;AAED,+EAA+E;AAC/E,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,SAAQ,GAAG,MAAM,CAMnF;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAO1G;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAM3G","sourcesContent":["/**\n * Finite decision-model arithmetic for metacognitive control.\n *\n * TypeScript port of docs/OMK_meta_algorithm_checks_2026-09-19.zip\n * (check_examples.py) — the numerical checks referenced by\n * OMK_metacognitive_control_algorithms_2026-09-19.md §5.3, §6.2.\n *\n * These are illustrative finite-model computations, NOT measured OMK risk\n * estimates. Callers must supply real, defensible probabilities; this module\n * only guarantees the arithmetic is correct and rejects malformed inputs.\n */\nimport { ensure, finite, probability, probabilityVector } from \"./validation.ts\";\n\n/**\n * Minimum expected loss over a finite set of terminal decisions.\n * losses[d][h] is the loss of decision d when hypothesis h is true.\n */\nexport function bayesRisk(prior: readonly number[], losses: readonly (readonly number[])[]): number {\n\tprobabilityVector(prior, \"prior\");\n\tensure(losses.length > 0, \"at least one terminal decision is required\");\n\tlet best = Number.POSITIVE_INFINITY;\n\tfor (const row of losses) {\n\t\tensure(row.length === prior.length, \"loss row must match hypotheses\");\n\t\tlet risk = 0;\n\t\tfor (let h = 0; h < prior.length; h++) {\n\t\t\tfinite(row[h]!, \"loss\");\n\t\t\trisk += prior[h]! * row[h]!;\n\t\t}\n\t\tif (risk < best) best = risk;\n\t}\n\treturn best;\n}\n\nexport interface ExperimentBranch {\n\treadonly outcome: number;\n\treadonly probability: number;\n\treadonly posterior: readonly number[];\n\treadonly risk: number;\n}\nexport interface ExperimentValue {\n\treadonly before: number;\n\treadonly expectedAfter: number;\n\treadonly grossValue: number;\n\treadonly cost: number;\n\treadonly netValue: number;\n\treadonly branches: readonly ExperimentBranch[];\n}\n\n/**\n * One-step value of information: Bayes risk before minus expected Bayes risk\n * after observing the experiment outcome, minus the experiment cost.\n * likelihoodByHypothesis[h][o] = P(outcome o | hypothesis h).\n * Zero-probability outcomes are skipped; the caller must treat an actually\n * observed impossible outcome as a model mismatch, never renormalize it away.\n */\nexport function experimentValue(\n\tprior: readonly number[],\n\tlosses: readonly (readonly number[])[],\n\tlikelihoodByHypothesis: readonly (readonly number[])[],\n\tcost: number,\n): ExperimentValue {\n\tprobabilityVector(prior, \"prior\");\n\tfinite(cost, \"cost\");\n\tconst rows = likelihoodByHypothesis.map((row) => {\n\t\tprobabilityVector(row, \"likelihood\");\n\t\treturn row;\n\t});\n\tensure(rows.length === prior.length, \"likelihood matrix must match hypotheses\");\n\tensure(new Set(rows.map((r) => r.length)).size === 1, \"likelihood matrix shape mismatch\");\n\tconst outcomeCount = rows[0]!.length;\n\tconst before = bayesRisk(prior, losses);\n\tconst branches: ExperimentBranch[] = [];\n\tlet expectedAfter = 0;\n\tfor (let outcome = 0; outcome < outcomeCount; outcome++) {\n\t\tconst masses = prior.map((p, h) => p * rows[h]![outcome]!);\n\t\tconst marginal = masses.reduce((a, b) => a + b, 0);\n\t\tif (marginal === 0) continue;\n\t\tconst posterior = masses.map((m) => m / marginal);\n\t\tconst after = bayesRisk(posterior, losses);\n\t\texpectedAfter += marginal * after;\n\t\tbranches.push({ outcome, probability: marginal, posterior, risk: after });\n\t}\n\treturn {\n\t\tbefore,\n\t\texpectedAfter,\n\t\tgrossValue: before - expectedAfter,\n\t\tcost,\n\t\tnetValue: before - expectedAfter - cost,\n\t\tbranches,\n\t};\n}\n\n/** Brier score for one binary event. */\nexport function brier(predicted: number, outcome: 0 | 1): number {\n\tprobability(predicted, \"predicted\");\n\tconst p = outcome === 1 ? predicted : 1 - predicted;\n\treturn (1 - p) ** 2;\n}\n\n/** Negative log-likelihood surprise for one binary event (epsilon-clamped). */\nexport function surprise(predicted: number, outcome: 0 | 1, epsilon = 1e-12): number {\n\tprobability(predicted, \"predicted\");\n\tfinite(epsilon, \"epsilon\", 1);\n\tensure(epsilon > 0, \"epsilon must be positive\");\n\tconst p = outcome === 1 ? predicted : 1 - predicted;\n\treturn -Math.log(Math.max(epsilon, p));\n}\n\n/**\n * Beta posterior mean for an independent binary task outcome under a fixed\n * policy in a homogeneous condition bucket. The prior (alpha, beta) must be\n * declared by the host; this is not a learned-calibration claim.\n */\nexport function betaPosteriorMean(alpha: number, beta: number, successes: number, failures: number): number {\n\tfinite(alpha, \"alpha\", 1e9);\n\tfinite(beta, \"beta\", 1e9);\n\tensure(alpha > 0 && beta > 0, \"beta prior parameters must be positive\");\n\tfinite(successes, \"successes\", 1e12);\n\tfinite(failures, \"failures\", 1e12);\n\treturn (alpha + successes) / (alpha + beta + successes + failures);\n}\n\n/**\n * CUSUM-style drift accumulator over per-observation losses in one condition\n * bucket. Returns the new accumulator value; the caller compares it against\n * a host-declared threshold h_g. Not a guaranteed false-alarm rate.\n */\nexport function driftStatistic(previous: number, loss: number, referenceMean: number, slack: number): number {\n\tfinite(previous, \"previous\");\n\tfinite(loss, \"loss\");\n\tfinite(referenceMean, \"referenceMean\");\n\tfinite(slack, \"slack\");\n\treturn Math.max(0, previous + loss - referenceMean - slack);\n}\n"]}

package/dist/metacognition/decision.js

@@ -0,0 +1,111 @@
+/**
+ * Finite decision-model arithmetic for metacognitive control.
+ *
+ * TypeScript port of docs/OMK_meta_algorithm_checks_2026-09-19.zip
+ * (check_examples.py) — the numerical checks referenced by
+ * OMK_metacognitive_control_algorithms_2026-09-19.md §5.3, §6.2.
+ *
+ * These are illustrative finite-model computations, NOT measured OMK risk
+ * estimates. Callers must supply real, defensible probabilities; this module
+ * only guarantees the arithmetic is correct and rejects malformed inputs.
+ */
+import { ensure, finite, probability, probabilityVector } from "./validation.js";
+/**
+ * Minimum expected loss over a finite set of terminal decisions.
+ * losses[d][h] is the loss of decision d when hypothesis h is true.
+ */
+export function bayesRisk(prior, losses) {
+    probabilityVector(prior, "prior");
+    ensure(losses.length > 0, "at least one terminal decision is required");
+    let best = Number.POSITIVE_INFINITY;
+    for (const row of losses) {
+        ensure(row.length === prior.length, "loss row must match hypotheses");
+        let risk = 0;
+        for (let h = 0; h < prior.length; h++) {
+            finite(row[h], "loss");
+            risk += prior[h] * row[h];
+        }
+        if (risk < best)
+            best = risk;
+    }
+    return best;
+}
+/**
+ * One-step value of information: Bayes risk before minus expected Bayes risk
+ * after observing the experiment outcome, minus the experiment cost.
+ * likelihoodByHypothesis[h][o] = P(outcome o | hypothesis h).
+ * Zero-probability outcomes are skipped; the caller must treat an actually
+ * observed impossible outcome as a model mismatch, never renormalize it away.
+ */
+export function experimentValue(prior, losses, likelihoodByHypothesis, cost) {
+    probabilityVector(prior, "prior");
+    finite(cost, "cost");
+    const rows = likelihoodByHypothesis.map((row) => {
+        probabilityVector(row, "likelihood");
+        return row;
+    });
+    ensure(rows.length === prior.length, "likelihood matrix must match hypotheses");
+    ensure(new Set(rows.map((r) => r.length)).size === 1, "likelihood matrix shape mismatch");
+    const outcomeCount = rows[0].length;
+    const before = bayesRisk(prior, losses);
+    const branches = [];
+    let expectedAfter = 0;
+    for (let outcome = 0; outcome < outcomeCount; outcome++) {
+        const masses = prior.map((p, h) => p * rows[h][outcome]);
+        const marginal = masses.reduce((a, b) => a + b, 0);
+        if (marginal === 0)
+            continue;
+        const posterior = masses.map((m) => m / marginal);
+        const after = bayesRisk(posterior, losses);
+        expectedAfter += marginal * after;
+        branches.push({ outcome, probability: marginal, posterior, risk: after });
+    }
+    return {
+        before,
+        expectedAfter,
+        grossValue: before - expectedAfter,
+        cost,
+        netValue: before - expectedAfter - cost,
+        branches,
+    };
+}
+/** Brier score for one binary event. */
+export function brier(predicted, outcome) {
+    probability(predicted, "predicted");
+    const p = outcome === 1 ? predicted : 1 - predicted;
+    return (1 - p) ** 2;
+}
+/** Negative log-likelihood surprise for one binary event (epsilon-clamped). */
+export function surprise(predicted, outcome, epsilon = 1e-12) {
+    probability(predicted, "predicted");
+    finite(epsilon, "epsilon", 1);
+    ensure(epsilon > 0, "epsilon must be positive");
+    const p = outcome === 1 ? predicted : 1 - predicted;
+    return -Math.log(Math.max(epsilon, p));
+}
+/**
+ * Beta posterior mean for an independent binary task outcome under a fixed
+ * policy in a homogeneous condition bucket. The prior (alpha, beta) must be
+ * declared by the host; this is not a learned-calibration claim.
+ */
+export function betaPosteriorMean(alpha, beta, successes, failures) {
+    finite(alpha, "alpha", 1e9);
+    finite(beta, "beta", 1e9);
+    ensure(alpha > 0 && beta > 0, "beta prior parameters must be positive");
+    finite(successes, "successes", 1e12);
+    finite(failures, "failures", 1e12);
+    return (alpha + successes) / (alpha + beta + successes + failures);
+}
+/**
+ * CUSUM-style drift accumulator over per-observation losses in one condition
+ * bucket. Returns the new accumulator value; the caller compares it against
+ * a host-declared threshold h_g. Not a guaranteed false-alarm rate.
+ */
+export function driftStatistic(previous, loss, referenceMean, slack) {
+    finite(previous, "previous");
+    finite(loss, "loss");
+    finite(referenceMean, "referenceMean");
+    finite(slack, "slack");
+    return Math.max(0, previous + loss - referenceMean - slack);
+}
+//# sourceMappingURL=decision.js.map

package/dist/metacognition/decision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decision.js","sourceRoot":"","sources":["../../src/metacognition/decision.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEjF;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB,EAAE,MAAsC,EAAU;IACnG,iBAAiB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAClC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,4CAA4C,CAAC,CAAC;IACxE,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,gCAAgC,CAAC,CAAC;QACtE,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;YACxB,IAAI,IAAI,KAAK,CAAC,CAAC,CAAE,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,GAAG,IAAI;YAAE,IAAI,GAAG,IAAI,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AAAA,CACZ;AAiBD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC9B,KAAwB,EACxB,MAAsC,EACtC,sBAAsD,EACtD,IAAY,EACM;IAClB,iBAAiB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAClC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC;QAChD,iBAAiB,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,OAAO,GAAG,CAAC;IAAA,CACX,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,yCAAyC,CAAC,CAAC;IAChF,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAuB,EAAE,CAAC;IACxC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,YAAY,EAAE,OAAO,EAAE,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,OAAO,CAAE,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,QAAQ,KAAK,CAAC;YAAE,SAAS;QAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC3C,aAAa,IAAI,QAAQ,GAAG,KAAK,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO;QACN,MAAM;QACN,aAAa;QACb,UAAU,EAAE,MAAM,GAAG,aAAa;QAClC,IAAI;QACJ,QAAQ,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;QACvC,QAAQ;KACR,CAAC;AAAA,CACF;AAED,wCAAwC;AACxC,MAAM,UAAU,KAAK,CAAC,SAAiB,EAAE,OAAc,EAAU;IAChE,WAAW,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACpD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,CACpB;AAED,+EAA+E;AAC/E,MAAM,UAAU,QAAQ,CAAC,SAAiB,EAAE,OAAc,EAAE,OAAO,GAAG,KAAK,EAAU;IACpF,WAAW,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACpC,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAChD,MAAM,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACpD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,CACvC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,IAAY,EAAE,SAAiB,EAAE,QAAgB,EAAU;IAC3G,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC5B,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAC1B,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,wCAAwC,CAAC,CAAC;IACxE,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;IACrC,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IACnC,OAAO,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC;AAAA,CACnE;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,IAAY,EAAE,aAAqB,EAAE,KAAa,EAAU;IAC5G,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC7B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrB,MAAM,CAAC,aAAa,EAAE,eAAe,CAAC,CAAC;IACvC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACvB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,GAAG,aAAa,GAAG,KAAK,CAAC,CAAC;AAAA,CAC5D","sourcesContent":["/**\n * Finite decision-model arithmetic for metacognitive control.\n *\n * TypeScript port of docs/OMK_meta_algorithm_checks_2026-09-19.zip\n * (check_examples.py) — the numerical checks referenced by\n * OMK_metacognitive_control_algorithms_2026-09-19.md §5.3, §6.2.\n *\n * These are illustrative finite-model computations, NOT measured OMK risk\n * estimates. Callers must supply real, defensible probabilities; this module\n * only guarantees the arithmetic is correct and rejects malformed inputs.\n */\nimport { ensure, finite, probability, probabilityVector } from \"./validation.ts\";\n\n/**\n * Minimum expected loss over a finite set of terminal decisions.\n * losses[d][h] is the loss of decision d when hypothesis h is true.\n */\nexport function bayesRisk(prior: readonly number[], losses: readonly (readonly number[])[]): number {\n\tprobabilityVector(prior, \"prior\");\n\tensure(losses.length > 0, \"at least one terminal decision is required\");\n\tlet best = Number.POSITIVE_INFINITY;\n\tfor (const row of losses) {\n\t\tensure(row.length === prior.length, \"loss row must match hypotheses\");\n\t\tlet risk = 0;\n\t\tfor (let h = 0; h < prior.length; h++) {\n\t\t\tfinite(row[h]!, \"loss\");\n\t\t\trisk += prior[h]! * row[h]!;\n\t\t}\n\t\tif (risk < best) best = risk;\n\t}\n\treturn best;\n}\n\nexport interface ExperimentBranch {\n\treadonly outcome: number;\n\treadonly probability: number;\n\treadonly posterior: readonly number[];\n\treadonly risk: number;\n}\nexport interface ExperimentValue {\n\treadonly before: number;\n\treadonly expectedAfter: number;\n\treadonly grossValue: number;\n\treadonly cost: number;\n\treadonly netValue: number;\n\treadonly branches: readonly ExperimentBranch[];\n}\n\n/**\n * One-step value of information: Bayes risk before minus expected Bayes risk\n * after observing the experiment outcome, minus the experiment cost.\n * likelihoodByHypothesis[h][o] = P(outcome o | hypothesis h).\n * Zero-probability outcomes are skipped; the caller must treat an actually\n * observed impossible outcome as a model mismatch, never renormalize it away.\n */\nexport function experimentValue(\n\tprior: readonly number[],\n\tlosses: readonly (readonly number[])[],\n\tlikelihoodByHypothesis: readonly (readonly number[])[],\n\tcost: number,\n): ExperimentValue {\n\tprobabilityVector(prior, \"prior\");\n\tfinite(cost, \"cost\");\n\tconst rows = likelihoodByHypothesis.map((row) => {\n\t\tprobabilityVector(row, \"likelihood\");\n\t\treturn row;\n\t});\n\tensure(rows.length === prior.length, \"likelihood matrix must match hypotheses\");\n\tensure(new Set(rows.map((r) => r.length)).size === 1, \"likelihood matrix shape mismatch\");\n\tconst outcomeCount = rows[0]!.length;\n\tconst before = bayesRisk(prior, losses);\n\tconst branches: ExperimentBranch[] = [];\n\tlet expectedAfter = 0;\n\tfor (let outcome = 0; outcome < outcomeCount; outcome++) {\n\t\tconst masses = prior.map((p, h) => p * rows[h]![outcome]!);\n\t\tconst marginal = masses.reduce((a, b) => a + b, 0);\n\t\tif (marginal === 0) continue;\n\t\tconst posterior = masses.map((m) => m / marginal);\n\t\tconst after = bayesRisk(posterior, losses);\n\t\texpectedAfter += marginal * after;\n\t\tbranches.push({ outcome, probability: marginal, posterior, risk: after });\n\t}\n\treturn {\n\t\tbefore,\n\t\texpectedAfter,\n\t\tgrossValue: before - expectedAfter,\n\t\tcost,\n\t\tnetValue: before - expectedAfter - cost,\n\t\tbranches,\n\t};\n}\n\n/** Brier score for one binary event. */\nexport function brier(predicted: number, outcome: 0 | 1): number {\n\tprobability(predicted, \"predicted\");\n\tconst p = outcome === 1 ? predicted : 1 - predicted;\n\treturn (1 - p) ** 2;\n}\n\n/** Negative log-likelihood surprise for one binary event (epsilon-clamped). */\nexport function surprise(predicted: number, outcome: 0 | 1, epsilon = 1e-12): number {\n\tprobability(predicted, \"predicted\");\n\tfinite(epsilon, \"epsilon\", 1);\n\tensure(epsilon > 0, \"epsilon must be positive\");\n\tconst p = outcome === 1 ? predicted : 1 - predicted;\n\treturn -Math.log(Math.max(epsilon, p));\n}\n\n/**\n * Beta posterior mean for an independent binary task outcome under a fixed\n * policy in a homogeneous condition bucket. The prior (alpha, beta) must be\n * declared by the host; this is not a learned-calibration claim.\n */\nexport function betaPosteriorMean(alpha: number, beta: number, successes: number, failures: number): number {\n\tfinite(alpha, \"alpha\", 1e9);\n\tfinite(beta, \"beta\", 1e9);\n\tensure(alpha > 0 && beta > 0, \"beta prior parameters must be positive\");\n\tfinite(successes, \"successes\", 1e12);\n\tfinite(failures, \"failures\", 1e12);\n\treturn (alpha + successes) / (alpha + beta + successes + failures);\n}\n\n/**\n * CUSUM-style drift accumulator over per-observation losses in one condition\n * bucket. Returns the new accumulator value; the caller compares it against\n * a host-declared threshold h_g. Not a guaranteed false-alarm rate.\n */\nexport function driftStatistic(previous: number, loss: number, referenceMean: number, slack: number): number {\n\tfinite(previous, \"previous\");\n\tfinite(loss, \"loss\");\n\tfinite(referenceMean, \"referenceMean\");\n\tfinite(slack, \"slack\");\n\treturn Math.max(0, previous + loss - referenceMean - slack);\n}\n"]}

package/dist/metacognition/evaluation.d.ts

@@ -0,0 +1,73 @@
+/** One logged decision for DR evaluation. Single checkpoint, not a trajectory. */
+export interface LoggedDecision {
+    readonly contextHash: string;
+    readonly action: string;
+    readonly reward: number;
+    /** Logged selection probability under the recording policy. Required, never imputed. */
+    readonly propensity: number;
+}
+export interface DRInput {
+    readonly decisions: readonly LoggedDecision[];
+    /** π(a|x): the evaluated policy's action for each logged context. */
+    readonly evaluatedActions: readonly string[];
+    /** r̂(x,a): reward model per context-action pair. */
+    readonly rewardModel: readonly (readonly number[])[];
+}
+export interface DREstimate {
+    readonly value: number;
+    readonly n: number;
+    readonly clipped: number;
+    /** Contexts where the evaluated action had zero logged support — excluded, never imputed. */
+    readonly unsupported: number;
+}
+/**
+ * Single-decision Doubly Robust estimate:
+ * V̂_DR(π) = 1/n Σ [ Σ_a π(a|x_i)r̂(x_i,a) + (π(a_i|x_i)/μ(a_i|x_i))(r_i - r̂(x_i,a_i)) ].
+ * Deterministic logging policies that never tried an action cannot evaluate
+ * that action post-hoc — those rows are excluded and counted.
+ */
+export declare function doublyRobustEstimate(input: DRInput, maxWeight?: number): DREstimate;
+/** §11.3 experience memory — failure mechanism and discrimination, not essays. */
+export interface ExperienceRecord {
+    readonly recordId: string;
+    readonly conditions: {
+        readonly modelRevision: string;
+        readonly toolchain: string;
+        readonly environmentHash: string;
+        readonly taskBand: string;
+    };
+    readonly failureMechanism: string;
+    readonly firstWrongExpectation: string;
+    readonly discriminatingObservation: string;
+    readonly appliedFixOrStrategy: string;
+    readonly checksBefore: readonly string[];
+    readonly checksAfter: readonly string[];
+    readonly knownCounterexamples: readonly string[];
+    readonly applicabilityConditions: readonly string[];
+    readonly evidenceRefs: readonly string[];
+    readonly policyVersion: string;
+    readonly skillHashes: readonly string[];
+}
+export declare function validateExperienceRecord(r: ExperienceRecord): void;
+/** §15.3 completion metrics. Zero denominators are `undefined`, never 0 or 1. */
+export interface OutcomeCounts {
+    readonly declaredComplete: number;
+    readonly independentFailAmongDeclared: number;
+    readonly allTasks: number;
+    readonly succeeded: number;
+    readonly abstained: number;
+    readonly totalCost: number;
+}
+export declare function completionMetrics(c: OutcomeCounts): {
+    readonly falseCompletionDeclared?: number;
+    readonly falseCompletionAll?: number;
+    readonly successRate?: number;
+    readonly abstainRate?: number;
+    readonly meanCost?: number;
+};
+/** §15.3 hidden-obligation detection with false alarms, for held-out requirements. */
+export declare function hiddenObligationMetrics(detected: number, totalHidden: number, falseAlarms: number): {
+    readonly detectionRate?: number;
+    readonly falseAlarms: number;
+};
+//# sourceMappingURL=evaluation.d.ts.map

package/dist/metacognition/evaluation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation.d.ts","sourceRoot":"","sources":["../../src/metacognition/evaluation.ts"],"names":[],"mappings":"AAWA,kFAAkF;AAClF,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wFAAwF;IACxF,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC5B;AACD,MAAM,WAAW,OAAO;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,cAAc,EAAE,CAAC;IAC9C,sEAAqE;IACrE,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,sDAAqD;IACrD,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;CACrD;AACD,MAAM,WAAW,UAAU;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,+FAA6F;IAC7F,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,SAAK,GAAG,UAAU,CAkC/E;AAED,qFAAkF;AAClF,MAAM,WAAW,gBAAgB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE;QACpB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;QACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;KAC1B,CAAC;IACF,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAC3C,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;IACjD,QAAQ,CAAC,uBAAuB,EAAE,SAAS,MAAM,EAAE,CAAC;IACpD,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AACD,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,gBAAgB,GAAG,IAAI,CAiBlE;AAED,kFAAiF;AACjF,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,4BAA4B,EAAE,MAAM,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B;AACD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,aAAa,GAAG;IACpD,QAAQ,CAAC,uBAAuB,CAAC,EAAE,MAAM,CAAC;IAC1C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IACrC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC3B,CAmBA;AAED,uFAAsF;AACtF,wBAAgB,uBAAuB,CACtC,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,GACjB;IACF,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B,CASA","sourcesContent":["/**\n * §11 causal strategy evaluation + §15 outcome metrics.\n *\n * Doubly Robust estimation is a second-stage offline tool over logged\n * single-checkpoint decisions: it needs real logged propensities, action\n * support, and rewards — never probabilities invented after the fact.\n * Completion metrics report false-completion alongside success/abstain rates,\n * because a policy that never completes can trivially zero false completions.\n */\nimport { ensure, finite, integer, probability, text } from \"./validation.ts\";\n\n/** One logged decision for DR evaluation. Single checkpoint, not a trajectory. */\nexport interface LoggedDecision {\n\treadonly contextHash: string;\n\treadonly action: string;\n\treadonly reward: number;\n\t/** Logged selection probability under the recording policy. Required, never imputed. */\n\treadonly propensity: number;\n}\nexport interface DRInput {\n\treadonly decisions: readonly LoggedDecision[];\n\t/** π(a|x): the evaluated policy's action for each logged context. */\n\treadonly evaluatedActions: readonly string[];\n\t/** r̂(x,a): reward model per context-action pair. */\n\treadonly rewardModel: readonly (readonly number[])[];\n}\nexport interface DREstimate {\n\treadonly value: number;\n\treadonly n: number;\n\treadonly clipped: number;\n\t/** Contexts where the evaluated action had zero logged support — excluded, never imputed. */\n\treadonly unsupported: number;\n}\n\n/**\n * Single-decision Doubly Robust estimate:\n * V̂_DR(π) = 1/n Σ [ Σ_a π(a|x_i)r̂(x_i,a) + (π(a_i|x_i)/μ(a_i|x_i))(r_i - r̂(x_i,a_i)) ].\n * Deterministic logging policies that never tried an action cannot evaluate\n * that action post-hoc — those rows are excluded and counted.\n */\nexport function doublyRobustEstimate(input: DRInput, maxWeight = 50): DREstimate {\n\tconst { decisions, evaluatedActions, rewardModel } = input;\n\tinteger(decisions.length, \"decisions\", 1_000_000);\n\tensure(decisions.length > 0, \"no logged decisions\");\n\tensure(evaluatedActions.length === decisions.length, \"evaluated action count mismatch\");\n\tensure(rewardModel.length === decisions.length, \"reward model row mismatch\");\n\tfinite(maxWeight, \"maxWeight\", 1e9);\n\tlet sum = 0,\n\t\tclipped = 0,\n\t\tunsupported = 0,\n\t\tusable = 0;\n\tfor (let i = 0; i < decisions.length; i++) {\n\t\tconst d = decisions[i]!;\n\t\ttext(d.contextHash, \"contextHash\", 256);\n\t\ttext(d.action, \"action\", 128);\n\t\tfinite(d.reward, \"reward\");\n\t\tprobability(d.propensity, \"propensity\");\n\t\ttext(evaluatedActions[i]!, \"evaluated action\", 128);\n\t\tconst rewards = rewardModel[i]!;\n\t\tensure(rewards.length > 0, \"reward model row empty\");\n\t\tfor (const r of rewards) finite(r, \"reward model value\");\n\t\t// Contexts may carry several logged actions; μ is per recorded decision.\n\t\tconst modelMean = rewards.reduce((a, b) => a + b, 0) / rewards.length;\n\t\tif (d.propensity === 0 && d.action === evaluatedActions[i]) {\n\t\t\tunsupported++;\n\t\t\tcontinue;\n\t\t}\n\t\tusable++;\n\t\tconst weight = d.action === evaluatedActions[i] ? Math.min(maxWeight, 1 / d.propensity) : 0;\n\t\tif (weight === maxWeight) clipped++;\n\t\tsum += modelMean + weight * (d.reward - modelMean);\n\t}\n\tensure(usable > 0, \"no decisions with logged support for the evaluated policy\");\n\treturn { value: sum / usable, n: usable, clipped, unsupported };\n}\n\n/** §11.3 experience memory — failure mechanism and discrimination, not essays. */\nexport interface ExperienceRecord {\n\treadonly recordId: string;\n\treadonly conditions: {\n\t\treadonly modelRevision: string;\n\t\treadonly toolchain: string;\n\t\treadonly environmentHash: string;\n\t\treadonly taskBand: string;\n\t};\n\treadonly failureMechanism: string;\n\treadonly firstWrongExpectation: string;\n\treadonly discriminatingObservation: string;\n\treadonly appliedFixOrStrategy: string;\n\treadonly checksBefore: readonly string[];\n\treadonly checksAfter: readonly string[];\n\treadonly knownCounterexamples: readonly string[];\n\treadonly applicabilityConditions: readonly string[];\n\treadonly evidenceRefs: readonly string[];\n\treadonly policyVersion: string;\n\treadonly skillHashes: readonly string[];\n}\nexport function validateExperienceRecord(r: ExperienceRecord): void {\n\ttext(r.recordId, \"recordId\", 128);\n\ttext(r.failureMechanism, \"failureMechanism\", 2048);\n\ttext(r.firstWrongExpectation, \"firstWrongExpectation\", 2048);\n\ttext(r.discriminatingObservation, \"discriminatingObservation\", 2048);\n\ttext(r.appliedFixOrStrategy, \"appliedFixOrStrategy\", 2048);\n\ttext(r.policyVersion, \"policyVersion\", 64);\n\tfor (const list of [\n\t\tr.checksBefore,\n\t\tr.checksAfter,\n\t\tr.knownCounterexamples,\n\t\tr.applicabilityConditions,\n\t\tr.evidenceRefs,\n\t\tr.skillHashes,\n\t]) {\n\t\tensure(Array.isArray(list) && list.length <= 128, \"experience record list bound\");\n\t}\n}\n\n/** §15.3 completion metrics. Zero denominators are `undefined`, never 0 or 1. */\nexport interface OutcomeCounts {\n\treadonly declaredComplete: number;\n\treadonly independentFailAmongDeclared: number;\n\treadonly allTasks: number;\n\treadonly succeeded: number;\n\treadonly abstained: number;\n\treadonly totalCost: number;\n}\nexport function completionMetrics(c: OutcomeCounts): {\n\treadonly falseCompletionDeclared?: number;\n\treadonly falseCompletionAll?: number;\n\treadonly successRate?: number;\n\treadonly abstainRate?: number;\n\treadonly meanCost?: number;\n} {\n\tinteger(c.declaredComplete, \"declaredComplete\");\n\tinteger(c.independentFailAmongDeclared, \"independentFail\");\n\tinteger(c.allTasks, \"allTasks\");\n\tinteger(c.succeeded, \"succeeded\");\n\tinteger(c.abstained, \"abstained\");\n\tfinite(c.totalCost, \"totalCost\");\n\tensure(c.independentFailAmongDeclared <= c.declaredComplete, \"fail count exceeds declared\");\n\tensure(\n\t\tc.declaredComplete <= c.allTasks && c.succeeded <= c.allTasks && c.abstained <= c.allTasks,\n\t\t\"counts exceed task total\",\n\t);\n\treturn {\n\t\tfalseCompletionDeclared: c.declaredComplete > 0 ? c.independentFailAmongDeclared / c.declaredComplete : undefined,\n\t\tfalseCompletionAll: c.allTasks > 0 ? c.independentFailAmongDeclared / c.allTasks : undefined,\n\t\tsuccessRate: c.allTasks > 0 ? c.succeeded / c.allTasks : undefined,\n\t\tabstainRate: c.allTasks > 0 ? c.abstained / c.allTasks : undefined,\n\t\tmeanCost: c.allTasks > 0 ? c.totalCost / c.allTasks : undefined,\n\t};\n}\n\n/** §15.3 hidden-obligation detection with false alarms, for held-out requirements. */\nexport function hiddenObligationMetrics(\n\tdetected: number,\n\ttotalHidden: number,\n\tfalseAlarms: number,\n): {\n\treadonly detectionRate?: number;\n\treadonly falseAlarms: number;\n} {\n\tinteger(detected, \"detected\");\n\tinteger(totalHidden, \"totalHidden\");\n\tinteger(falseAlarms, \"falseAlarms\");\n\tensure(detected <= totalHidden, \"detected exceeds hidden total\");\n\treturn {\n\t\tdetectionRate: totalHidden > 0 ? detected / totalHidden : undefined,\n\t\tfalseAlarms,\n\t};\n}\n"]}

package/dist/metacognition/evaluation.js

@@ -0,0 +1,97 @@
+/**
+ * §11 causal strategy evaluation + §15 outcome metrics.
+ *
+ * Doubly Robust estimation is a second-stage offline tool over logged
+ * single-checkpoint decisions: it needs real logged propensities, action
+ * support, and rewards — never probabilities invented after the fact.
+ * Completion metrics report false-completion alongside success/abstain rates,
+ * because a policy that never completes can trivially zero false completions.
+ */
+import { ensure, finite, integer, probability, text } from "./validation.js";
+/**
+ * Single-decision Doubly Robust estimate:
+ * V̂_DR(π) = 1/n Σ [ Σ_a π(a|x_i)r̂(x_i,a) + (π(a_i|x_i)/μ(a_i|x_i))(r_i - r̂(x_i,a_i)) ].
+ * Deterministic logging policies that never tried an action cannot evaluate
+ * that action post-hoc — those rows are excluded and counted.
+ */
+export function doublyRobustEstimate(input, maxWeight = 50) {
+    const { decisions, evaluatedActions, rewardModel } = input;
+    integer(decisions.length, "decisions", 1_000_000);
+    ensure(decisions.length > 0, "no logged decisions");
+    ensure(evaluatedActions.length === decisions.length, "evaluated action count mismatch");
+    ensure(rewardModel.length === decisions.length, "reward model row mismatch");
+    finite(maxWeight, "maxWeight", 1e9);
+    let sum = 0, clipped = 0, unsupported = 0, usable = 0;
+    for (let i = 0; i < decisions.length; i++) {
+        const d = decisions[i];
+        text(d.contextHash, "contextHash", 256);
+        text(d.action, "action", 128);
+        finite(d.reward, "reward");
+        probability(d.propensity, "propensity");
+        text(evaluatedActions[i], "evaluated action", 128);
+        const rewards = rewardModel[i];
+        ensure(rewards.length > 0, "reward model row empty");
+        for (const r of rewards)
+            finite(r, "reward model value");
+        // Contexts may carry several logged actions; μ is per recorded decision.
+        const modelMean = rewards.reduce((a, b) => a + b, 0) / rewards.length;
+        if (d.propensity === 0 && d.action === evaluatedActions[i]) {
+            unsupported++;
+            continue;
+        }
+        usable++;
+        const weight = d.action === evaluatedActions[i] ? Math.min(maxWeight, 1 / d.propensity) : 0;
+        if (weight === maxWeight)
+            clipped++;
+        sum += modelMean + weight * (d.reward - modelMean);
+    }
+    ensure(usable > 0, "no decisions with logged support for the evaluated policy");
+    return { value: sum / usable, n: usable, clipped, unsupported };
+}
+export function validateExperienceRecord(r) {
+    text(r.recordId, "recordId", 128);
+    text(r.failureMechanism, "failureMechanism", 2048);
+    text(r.firstWrongExpectation, "firstWrongExpectation", 2048);
+    text(r.discriminatingObservation, "discriminatingObservation", 2048);
+    text(r.appliedFixOrStrategy, "appliedFixOrStrategy", 2048);
+    text(r.policyVersion, "policyVersion", 64);
+    for (const list of [
+        r.checksBefore,
+        r.checksAfter,
+        r.knownCounterexamples,
+        r.applicabilityConditions,
+        r.evidenceRefs,
+        r.skillHashes,
+    ]) {
+        ensure(Array.isArray(list) && list.length <= 128, "experience record list bound");
+    }
+}
+export function completionMetrics(c) {
+    integer(c.declaredComplete, "declaredComplete");
+    integer(c.independentFailAmongDeclared, "independentFail");
+    integer(c.allTasks, "allTasks");
+    integer(c.succeeded, "succeeded");
+    integer(c.abstained, "abstained");
+    finite(c.totalCost, "totalCost");
+    ensure(c.independentFailAmongDeclared <= c.declaredComplete, "fail count exceeds declared");
+    ensure(c.declaredComplete <= c.allTasks && c.succeeded <= c.allTasks && c.abstained <= c.allTasks, "counts exceed task total");
+    return {
+        falseCompletionDeclared: c.declaredComplete > 0 ? c.independentFailAmongDeclared / c.declaredComplete : undefined,
+        falseCompletionAll: c.allTasks > 0 ? c.independentFailAmongDeclared / c.allTasks : undefined,
+        successRate: c.allTasks > 0 ? c.succeeded / c.allTasks : undefined,
+        abstainRate: c.allTasks > 0 ? c.abstained / c.allTasks : undefined,
+        meanCost: c.allTasks > 0 ? c.totalCost / c.allTasks : undefined,
+    };
+}
+/** §15.3 hidden-obligation detection with false alarms, for held-out requirements. */
+export function hiddenObligationMetrics(detected, totalHidden, falseAlarms) {
+    integer(detected, "detected");
+    integer(totalHidden, "totalHidden");
+    integer(falseAlarms, "falseAlarms");
+    ensure(detected <= totalHidden, "detected exceeds hidden total");
+    return {
+        detectionRate: totalHidden > 0 ? detected / totalHidden : undefined,
+        falseAlarms,
+    };
+}
+//# sourceMappingURL=evaluation.js.map

package/dist/metacognition/evaluation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation.js","sourceRoot":"","sources":["../../src/metacognition/evaluation.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAyB7E;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAc,EAAE,SAAS,GAAG,EAAE,EAAc;IAChF,MAAM,EAAE,SAAS,EAAE,gBAAgB,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;IAC3D,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACpD,MAAM,CAAC,gBAAgB,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,iCAAiC,CAAC,CAAC;IACxF,MAAM,CAAC,WAAW,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,2BAA2B,CAAC,CAAC;IAC7E,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,EACV,OAAO,GAAG,CAAC,EACX,WAAW,GAAG,CAAC,EACf,MAAM,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;QACxB,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC3B,WAAW,CAAC,CAAC,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QACxC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAE,EAAE,kBAAkB,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,wBAAwB,CAAC,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;QACzD,0EAAyE;QACzE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACtE,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,WAAW,EAAE,CAAC;YACd,SAAS;QACV,CAAC;QACD,MAAM,EAAE,CAAC;QACT,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QACpC,GAAG,IAAI,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IACpD,CAAC;IACD,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,2DAA2D,CAAC,CAAC;IAChF,OAAO,EAAE,KAAK,EAAE,GAAG,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;AAAA,CAChE;AAuBD,MAAM,UAAU,wBAAwB,CAAC,CAAmB,EAAQ;IACnE,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAC;IACnD,IAAI,CAAC,CAAC,CAAC,qBAAqB,EAAE,uBAAuB,EAAE,IAAI,CAAC,CAAC;IAC7D,IAAI,CAAC,CAAC,CAAC,yBAAyB,EAAE,2BAA2B,EAAE,IAAI,CAAC,CAAC;IACrE,IAAI,CAAC,CAAC,CAAC,oBAAoB,EAAE,sBAAsB,EAAE,IAAI,CAAC,CAAC;IAC3D,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI;QAClB,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,oBAAoB;QACtB,CAAC,CAAC,uBAAuB;QACzB,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,WAAW;KACb,EAAE,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,GAAG,EAAE,8BAA8B,CAAC,CAAC;IACnF,CAAC;AAAA,CACD;AAWD,MAAM,UAAU,iBAAiB,CAAC,CAAgB,EAMhD;IACD,OAAO,CAAC,CAAC,CAAC,gBAAgB,EAAE,kBAAkB,CAAC,CAAC;IAChD,OAAO,CAAC,CAAC,CAAC,4BAA4B,EAAE,iBAAiB,CAAC,CAAC;IAC3D,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAChC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAClC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAClC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACjC,MAAM,CAAC,CAAC,CAAC,4BAA4B,IAAI,CAAC,CAAC,gBAAgB,EAAE,6BAA6B,CAAC,CAAC;IAC5F,MAAM,CACL,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,EAC1F,0BAA0B,CAC1B,CAAC;IACF,OAAO;QACN,uBAAuB,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS;QACjH,kBAAkB,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;QAC5F,WAAW,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;QAClE,WAAW,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;QAClE,QAAQ,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;KAC/D,CAAC;AAAA,CACF;AAED,uFAAsF;AACtF,MAAM,UAAU,uBAAuB,CACtC,QAAgB,EAChB,WAAmB,EACnB,WAAmB,EAIlB;IACD,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC9B,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IACpC,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IACpC,MAAM,CAAC,QAAQ,IAAI,WAAW,EAAE,+BAA+B,CAAC,CAAC;IACjE,OAAO;QACN,aAAa,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS;QACnE,WAAW;KACX,CAAC;AAAA,CACF","sourcesContent":["/**\n * §11 causal strategy evaluation + §15 outcome metrics.\n *\n * Doubly Robust estimation is a second-stage offline tool over logged\n * single-checkpoint decisions: it needs real logged propensities, action\n * support, and rewards — never probabilities invented after the fact.\n * Completion metrics report false-completion alongside success/abstain rates,\n * because a policy that never completes can trivially zero false completions.\n */\nimport { ensure, finite, integer, probability, text } from \"./validation.ts\";\n\n/** One logged decision for DR evaluation. Single checkpoint, not a trajectory. */\nexport interface LoggedDecision {\n\treadonly contextHash: string;\n\treadonly action: string;\n\treadonly reward: number;\n\t/** Logged selection probability under the recording policy. Required, never imputed. */\n\treadonly propensity: number;\n}\nexport interface DRInput {\n\treadonly decisions: readonly LoggedDecision[];\n\t/** π(a|x): the evaluated policy's action for each logged context. */\n\treadonly evaluatedActions: readonly string[];\n\t/** r̂(x,a): reward model per context-action pair. */\n\treadonly rewardModel: readonly (readonly number[])[];\n}\nexport interface DREstimate {\n\treadonly value: number;\n\treadonly n: number;\n\treadonly clipped: number;\n\t/** Contexts where the evaluated action had zero logged support — excluded, never imputed. */\n\treadonly unsupported: number;\n}\n\n/**\n * Single-decision Doubly Robust estimate:\n * V̂_DR(π) = 1/n Σ [ Σ_a π(a|x_i)r̂(x_i,a) + (π(a_i|x_i)/μ(a_i|x_i))(r_i - r̂(x_i,a_i)) ].\n * Deterministic logging policies that never tried an action cannot evaluate\n * that action post-hoc — those rows are excluded and counted.\n */\nexport function doublyRobustEstimate(input: DRInput, maxWeight = 50): DREstimate {\n\tconst { decisions, evaluatedActions, rewardModel } = input;\n\tinteger(decisions.length, \"decisions\", 1_000_000);\n\tensure(decisions.length > 0, \"no logged decisions\");\n\tensure(evaluatedActions.length === decisions.length, \"evaluated action count mismatch\");\n\tensure(rewardModel.length === decisions.length, \"reward model row mismatch\");\n\tfinite(maxWeight, \"maxWeight\", 1e9);\n\tlet sum = 0,\n\t\tclipped = 0,\n\t\tunsupported = 0,\n\t\tusable = 0;\n\tfor (let i = 0; i < decisions.length; i++) {\n\t\tconst d = decisions[i]!;\n\t\ttext(d.contextHash, \"contextHash\", 256);\n\t\ttext(d.action, \"action\", 128);\n\t\tfinite(d.reward, \"reward\");\n\t\tprobability(d.propensity, \"propensity\");\n\t\ttext(evaluatedActions[i]!, \"evaluated action\", 128);\n\t\tconst rewards = rewardModel[i]!;\n\t\tensure(rewards.length > 0, \"reward model row empty\");\n\t\tfor (const r of rewards) finite(r, \"reward model value\");\n\t\t// Contexts may carry several logged actions; μ is per recorded decision.\n\t\tconst modelMean = rewards.reduce((a, b) => a + b, 0) / rewards.length;\n\t\tif (d.propensity === 0 && d.action === evaluatedActions[i]) {\n\t\t\tunsupported++;\n\t\t\tcontinue;\n\t\t}\n\t\tusable++;\n\t\tconst weight = d.action === evaluatedActions[i] ? Math.min(maxWeight, 1 / d.propensity) : 0;\n\t\tif (weight === maxWeight) clipped++;\n\t\tsum += modelMean + weight * (d.reward - modelMean);\n\t}\n\tensure(usable > 0, \"no decisions with logged support for the evaluated policy\");\n\treturn { value: sum / usable, n: usable, clipped, unsupported };\n}\n\n/** §11.3 experience memory — failure mechanism and discrimination, not essays. */\nexport interface ExperienceRecord {\n\treadonly recordId: string;\n\treadonly conditions: {\n\t\treadonly modelRevision: string;\n\t\treadonly toolchain: string;\n\t\treadonly environmentHash: string;\n\t\treadonly taskBand: string;\n\t};\n\treadonly failureMechanism: string;\n\treadonly firstWrongExpectation: string;\n\treadonly discriminatingObservation: string;\n\treadonly appliedFixOrStrategy: string;\n\treadonly checksBefore: readonly string[];\n\treadonly checksAfter: readonly string[];\n\treadonly knownCounterexamples: readonly string[];\n\treadonly applicabilityConditions: readonly string[];\n\treadonly evidenceRefs: readonly string[];\n\treadonly policyVersion: string;\n\treadonly skillHashes: readonly string[];\n}\nexport function validateExperienceRecord(r: ExperienceRecord): void {\n\ttext(r.recordId, \"recordId\", 128);\n\ttext(r.failureMechanism, \"failureMechanism\", 2048);\n\ttext(r.firstWrongExpectation, \"firstWrongExpectation\", 2048);\n\ttext(r.discriminatingObservation, \"discriminatingObservation\", 2048);\n\ttext(r.appliedFixOrStrategy, \"appliedFixOrStrategy\", 2048);\n\ttext(r.policyVersion, \"policyVersion\", 64);\n\tfor (const list of [\n\t\tr.checksBefore,\n\t\tr.checksAfter,\n\t\tr.knownCounterexamples,\n\t\tr.applicabilityConditions,\n\t\tr.evidenceRefs,\n\t\tr.skillHashes,\n\t]) {\n\t\tensure(Array.isArray(list) && list.length <= 128, \"experience record list bound\");\n\t}\n}\n\n/** §15.3 completion metrics. Zero denominators are `undefined`, never 0 or 1. */\nexport interface OutcomeCounts {\n\treadonly declaredComplete: number;\n\treadonly independentFailAmongDeclared: number;\n\treadonly allTasks: number;\n\treadonly succeeded: number;\n\treadonly abstained: number;\n\treadonly totalCost: number;\n}\nexport function completionMetrics(c: OutcomeCounts): {\n\treadonly falseCompletionDeclared?: number;\n\treadonly falseCompletionAll?: number;\n\treadonly successRate?: number;\n\treadonly abstainRate?: number;\n\treadonly meanCost?: number;\n} {\n\tinteger(c.declaredComplete, \"declaredComplete\");\n\tinteger(c.independentFailAmongDeclared, \"independentFail\");\n\tinteger(c.allTasks, \"allTasks\");\n\tinteger(c.succeeded, \"succeeded\");\n\tinteger(c.abstained, \"abstained\");\n\tfinite(c.totalCost, \"totalCost\");\n\tensure(c.independentFailAmongDeclared <= c.declaredComplete, \"fail count exceeds declared\");\n\tensure(\n\t\tc.declaredComplete <= c.allTasks && c.succeeded <= c.allTasks && c.abstained <= c.allTasks,\n\t\t\"counts exceed task total\",\n\t);\n\treturn {\n\t\tfalseCompletionDeclared: c.declaredComplete > 0 ? c.independentFailAmongDeclared / c.declaredComplete : undefined,\n\t\tfalseCompletionAll: c.allTasks > 0 ? c.independentFailAmongDeclared / c.allTasks : undefined,\n\t\tsuccessRate: c.allTasks > 0 ? c.succeeded / c.allTasks : undefined,\n\t\tabstainRate: c.allTasks > 0 ? c.abstained / c.allTasks : undefined,\n\t\tmeanCost: c.allTasks > 0 ? c.totalCost / c.allTasks : undefined,\n\t};\n}\n\n/** §15.3 hidden-obligation detection with false alarms, for held-out requirements. */\nexport function hiddenObligationMetrics(\n\tdetected: number,\n\ttotalHidden: number,\n\tfalseAlarms: number,\n): {\n\treadonly detectionRate?: number;\n\treadonly falseAlarms: number;\n} {\n\tinteger(detected, \"detected\");\n\tinteger(totalHidden, \"totalHidden\");\n\tinteger(falseAlarms, \"falseAlarms\");\n\tensure(detected <= totalHidden, \"detected exceeds hidden total\");\n\treturn {\n\t\tdetectionRate: totalHidden > 0 ? detected / totalHidden : undefined,\n\t\tfalseAlarms,\n\t};\n}\n"]}

package/dist/metacognition/index.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Metacognitive control kernel for OMK.
+ *
+ * Pure, deterministic, bounded modules implementing the observation /
+ * control / evaluation loop of OMK_metacognitive_control_algorithms_2026-09-19.
+ * Host-owned state only; no model output is ever treated as runner truth,
+ * and learned scores never relax a required approval or check.
+ */
+export * from "./calibration.ts";
+export * from "./calibration-selective.ts";
+export * from "./checkpoint.ts";
+export * from "./context7.ts";
+export * from "./decision.ts";
+export * from "./evaluation.ts";
+export * from "./knowledge.ts";
+export * from "./knowledge-action.ts";
+export * from "./obligations.ts";
+export * from "./observation-validity.ts";
+export * from "./observe.ts";
+export * from "./policy.ts";
+export * from "./predictions.ts";
+export * from "./retrieval.ts";
+export * from "./risk.ts";
+export * from "./route-economics.ts";
+export * from "./runtime-bridge.ts";
+export * from "./skills.ts";
+export * from "./state.ts";
+export * from "./validation.ts";
+export * from "./verification.ts";
+export * from "./verifier.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/metacognition/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/metacognition/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC","sourcesContent":["/**\n * Metacognitive control kernel for OMK.\n *\n * Pure, deterministic, bounded modules implementing the observation /\n * control / evaluation loop of OMK_metacognitive_control_algorithms_2026-09-19.\n * Host-owned state only; no model output is ever treated as runner truth,\n * and learned scores never relax a required approval or check.\n */\n\nexport * from \"./calibration.ts\";\nexport * from \"./calibration-selective.ts\";\nexport * from \"./checkpoint.ts\";\nexport * from \"./context7.ts\";\nexport * from \"./decision.ts\";\nexport * from \"./evaluation.ts\";\nexport * from \"./knowledge.ts\";\nexport * from \"./knowledge-action.ts\";\nexport * from \"./obligations.ts\";\nexport * from \"./observation-validity.ts\";\nexport * from \"./observe.ts\";\nexport * from \"./policy.ts\";\nexport * from \"./predictions.ts\";\nexport * from \"./retrieval.ts\";\nexport * from \"./risk.ts\";\nexport * from \"./route-economics.ts\";\nexport * from \"./runtime-bridge.ts\";\nexport * from \"./skills.ts\";\nexport * from \"./state.ts\";\nexport * from \"./validation.ts\";\nexport * from \"./verification.ts\";\nexport * from \"./verifier.ts\";\n"]}

package/dist/metacognition/index.js

@@ -0,0 +1,31 @@
+/**
+ * Metacognitive control kernel for OMK.
+ *
+ * Pure, deterministic, bounded modules implementing the observation /
+ * control / evaluation loop of OMK_metacognitive_control_algorithms_2026-09-19.
+ * Host-owned state only; no model output is ever treated as runner truth,
+ * and learned scores never relax a required approval or check.
+ */
+export * from "./calibration.js";
+export * from "./calibration-selective.js";
+export * from "./checkpoint.js";
+export * from "./context7.js";
+export * from "./decision.js";
+export * from "./evaluation.js";
+export * from "./knowledge.js";
+export * from "./knowledge-action.js";
+export * from "./obligations.js";
+export * from "./observation-validity.js";
+export * from "./observe.js";
+export * from "./policy.js";
+export * from "./predictions.js";
+export * from "./retrieval.js";
+export * from "./risk.js";
+export * from "./route-economics.js";
+export * from "./runtime-bridge.js";
+export * from "./skills.js";
+export * from "./state.js";
+export * from "./validation.js";
+export * from "./verification.js";
+export * from "./verifier.js";
+//# sourceMappingURL=index.js.map

package/dist/metacognition/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/metacognition/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC","sourcesContent":["/**\n * Metacognitive control kernel for OMK.\n *\n * Pure, deterministic, bounded modules implementing the observation /\n * control / evaluation loop of OMK_metacognitive_control_algorithms_2026-09-19.\n * Host-owned state only; no model output is ever treated as runner truth,\n * and learned scores never relax a required approval or check.\n */\n\nexport * from \"./calibration.ts\";\nexport * from \"./calibration-selective.ts\";\nexport * from \"./checkpoint.ts\";\nexport * from \"./context7.ts\";\nexport * from \"./decision.ts\";\nexport * from \"./evaluation.ts\";\nexport * from \"./knowledge.ts\";\nexport * from \"./knowledge-action.ts\";\nexport * from \"./obligations.ts\";\nexport * from \"./observation-validity.ts\";\nexport * from \"./observe.ts\";\nexport * from \"./policy.ts\";\nexport * from \"./predictions.ts\";\nexport * from \"./retrieval.ts\";\nexport * from \"./risk.ts\";\nexport * from \"./route-economics.ts\";\nexport * from \"./runtime-bridge.ts\";\nexport * from \"./skills.ts\";\nexport * from \"./state.ts\";\nexport * from \"./validation.ts\";\nexport * from \"./verification.ts\";\nexport * from \"./verifier.ts\";\n"]}

package/dist/metacognition/knowledge-action.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Bounded next-action selector for knowledge gaps.
+ *
+ * Split from knowledge.ts to keep each module under the repository's
+ * 250-line module-size ratchet. Same behavior as the reference port.
+ */
+import type { Claim, KnowledgeReport } from "./knowledge.ts";
+export type SearchChannel = "local" | "official" | "web";
+export interface SearchAttempt {
+    readonly claimId: string;
+    readonly binding: string;
+    readonly channel: SearchChannel;
+    readonly result: "empty" | "failed" | "candidates" | "in-flight";
+}
+export interface ActionPolicy {
+    readonly availableChannels: readonly SearchChannel[];
+    readonly remoteQueryApprovedClaimIds: readonly string[];
+    readonly remainingRequests: number;
+    readonly remainingMs: number;
+}
+export type KnowledgeAction = {
+    readonly kind: "proceed";
+    readonly meaning: "evidence-predicates-satisfied-not-general-correctness";
+} | {
+    readonly kind: "search";
+    readonly claimId: string;
+    readonly channel: SearchChannel;
+    readonly query: string;
+} | {
+    readonly kind: "run-check";
+    readonly claimId: string;
+    readonly checkId: string;
+} | {
+    readonly kind: "inspect-local" | "repair" | "review-candidates" | "await-owned-work" | "ask-user" | "form-obligations";
+    readonly claimId: string;
+} | {
+    readonly kind: "blocked";
+    readonly claimId: string;
+    readonly reason: string;
+};
+/** One bounded next action, not an autonomous recursion that can spend unbounded API calls. */
+export declare function nextKnowledgeAction(report: KnowledgeReport, claims: readonly Claim[], attempts: readonly SearchAttempt[], policy: ActionPolicy): KnowledgeAction;
+//# sourceMappingURL=knowledge-action.d.ts.map

package/dist/metacognition/knowledge-action.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-action.d.ts","sourceRoot":"","sources":["../../src/metacognition/knowledge-action.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAG7D,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,UAAU,GAAG,KAAK,CAAC;AACzD,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,OAAO,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,CAAC;CACjE;AACD,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,iBAAiB,EAAE,SAAS,aAAa,EAAE,CAAC;IACrD,QAAQ,CAAC,2BAA2B,EAAE,SAAS,MAAM,EAAE,CAAC;IACxD,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AACD,MAAM,MAAM,eAAe,GACxB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,uDAAuD,CAAA;CAAE,GACvG;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC9G;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAClF;IACA,QAAQ,CAAC,IAAI,EACV,eAAe,GACf,QAAQ,GACR,mBAAmB,GACnB,kBAAkB,GAClB,UAAU,GACV,kBAAkB,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACxB,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnF,+FAA+F;AAC/F,wBAAgB,mBAAmB,CAClC,MAAM,EAAE,eAAe,EACvB,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,QAAQ,EAAE,SAAS,aAAa,EAAE,EAClC,MAAM,EAAE,YAAY,GAClB,eAAe,CAwCjB","sourcesContent":["/**\n * Bounded next-action selector for knowledge gaps.\n *\n * Split from knowledge.ts to keep each module under the repository's\n * 250-line module-size ratchet. Same behavior as the reference port.\n */\n\nimport type { Claim, KnowledgeReport } from \"./knowledge.ts\";\nimport { ensure, integer, member, text, unique } from \"./validation.ts\";\n\nexport type SearchChannel = \"local\" | \"official\" | \"web\";\nexport interface SearchAttempt {\n\treadonly claimId: string;\n\treadonly binding: string;\n\treadonly channel: SearchChannel;\n\treadonly result: \"empty\" | \"failed\" | \"candidates\" | \"in-flight\";\n}\nexport interface ActionPolicy {\n\treadonly availableChannels: readonly SearchChannel[];\n\treadonly remoteQueryApprovedClaimIds: readonly string[];\n\treadonly remainingRequests: number;\n\treadonly remainingMs: number;\n}\nexport type KnowledgeAction =\n\t| { readonly kind: \"proceed\"; readonly meaning: \"evidence-predicates-satisfied-not-general-correctness\" }\n\t| { readonly kind: \"search\"; readonly claimId: string; readonly channel: SearchChannel; readonly query: string }\n\t| { readonly kind: \"run-check\"; readonly claimId: string; readonly checkId: string }\n\t| {\n\t\t\treadonly kind:\n\t\t\t\t| \"inspect-local\"\n\t\t\t\t| \"repair\"\n\t\t\t\t| \"review-candidates\"\n\t\t\t\t| \"await-owned-work\"\n\t\t\t\t| \"ask-user\"\n\t\t\t\t| \"form-obligations\";\n\t\t\treadonly claimId: string;\n\t  }\n\t| { readonly kind: \"blocked\"; readonly claimId: string; readonly reason: string };\n\n/** One bounded next action, not an autonomous recursion that can spend unbounded API calls. */\nexport function nextKnowledgeAction(\n\treport: KnowledgeReport,\n\tclaims: readonly Claim[],\n\tattempts: readonly SearchAttempt[],\n\tpolicy: ActionPolicy,\n): KnowledgeAction {\n\tinteger(policy.remainingRequests, \"remainingRequests\");\n\tinteger(policy.remainingMs, \"remainingMs\");\n\tunique(policy.availableChannels, \"availableChannels\", 3);\n\tfor (const channel of policy.availableChannels) member(channel, [\"local\", \"official\", \"web\"], \"search channel\");\n\tunique(policy.remoteQueryApprovedClaimIds, \"remote approvals\", 128);\n\tensure(attempts.length <= 4096, \"too many search attempts\");\n\tfor (const attempt of attempts) {\n\t\ttext(attempt.claimId, \"attempt claim\");\n\t\ttext(attempt.binding, \"attempt binding\");\n\t\tmember(attempt.channel, [\"local\", \"official\", \"web\"], \"attempt channel\");\n\t\tmember(attempt.result, [\"empty\", \"failed\", \"candidates\", \"in-flight\"], \"attempt result\");\n\t}\n\tconst gap = report.gaps.find((g) => g.required);\n\tif (!gap) return { kind: \"proceed\", meaning: \"evidence-predicates-satisfied-not-general-correctness\" };\n\tconst claimId = gap.claimId;\n\tif (gap.reason === \"unassessed-step\") return { kind: \"form-obligations\", claimId };\n\tif (gap.reason === \"missing-user-decision\") return { kind: \"ask-user\", claimId };\n\tif (gap.reason === \"unknown-version\") return { kind: \"inspect-local\", claimId };\n\tif (gap.reason === \"failed-check\") return { kind: \"repair\", claimId };\n\tif (gap.reason === \"pending-check\") return { kind: \"await-owned-work\", claimId };\n\tif (gap.reason === \"missing-check\") {\n\t\tensure(gap.checkId !== null, \"missing checkId\");\n\t\treturn { kind: \"run-check\", claimId, checkId: gap.checkId };\n\t}\n\tconst claim = claims.find((c) => c.id === claimId && c.binding === gap.binding);\n\tensure(claim !== undefined, \"report has stale or unknown claim\");\n\tconst history = attempts.filter((a) => a.claimId === claimId && a.binding === gap.binding);\n\tif (history.some((a) => a.result === \"in-flight\")) return { kind: \"await-owned-work\", claimId };\n\tif (history.some((a) => a.result === \"candidates\")) return { kind: \"review-candidates\", claimId };\n\tif (policy.remainingRequests === 0 || policy.remainingMs === 0) {\n\t\treturn { kind: \"blocked\", claimId, reason: \"acquisition-budget-exhausted\" };\n\t}\n\tfor (const channel of [\"local\", \"official\", \"web\"] as const) {\n\t\tif (!policy.availableChannels.includes(channel) || history.some((a) => a.channel === channel)) continue;\n\t\tif (channel !== \"local\" && (!policy.remoteQueryApprovedClaimIds.includes(claimId) || claim.publicQuery === null))\n\t\t\tcontinue;\n\t\treturn { kind: \"search\", claimId, channel, query: channel === \"local\" ? claim.statement : claim.publicQuery! };\n\t}\n\treturn { kind: \"blocked\", claimId, reason: \"no-approved-untried-source\" };\n}\n"]}

package/dist/metacognition/knowledge-action.js

@@ -0,0 +1,60 @@
+/**
+ * Bounded next-action selector for knowledge gaps.
+ *
+ * Split from knowledge.ts to keep each module under the repository's
+ * 250-line module-size ratchet. Same behavior as the reference port.
+ */
+import { ensure, integer, member, text, unique } from "./validation.js";
+/** One bounded next action, not an autonomous recursion that can spend unbounded API calls. */
+export function nextKnowledgeAction(report, claims, attempts, policy) {
+    integer(policy.remainingRequests, "remainingRequests");
+    integer(policy.remainingMs, "remainingMs");
+    unique(policy.availableChannels, "availableChannels", 3);
+    for (const channel of policy.availableChannels)
+        member(channel, ["local", "official", "web"], "search channel");
+    unique(policy.remoteQueryApprovedClaimIds, "remote approvals", 128);
+    ensure(attempts.length <= 4096, "too many search attempts");
+    for (const attempt of attempts) {
+        text(attempt.claimId, "attempt claim");
+        text(attempt.binding, "attempt binding");
+        member(attempt.channel, ["local", "official", "web"], "attempt channel");
+        member(attempt.result, ["empty", "failed", "candidates", "in-flight"], "attempt result");
+    }
+    const gap = report.gaps.find((g) => g.required);
+    if (!gap)
+        return { kind: "proceed", meaning: "evidence-predicates-satisfied-not-general-correctness" };
+    const claimId = gap.claimId;
+    if (gap.reason === "unassessed-step")
+        return { kind: "form-obligations", claimId };
+    if (gap.reason === "missing-user-decision")
+        return { kind: "ask-user", claimId };
+    if (gap.reason === "unknown-version")
+        return { kind: "inspect-local", claimId };
+    if (gap.reason === "failed-check")
+        return { kind: "repair", claimId };
+    if (gap.reason === "pending-check")
+        return { kind: "await-owned-work", claimId };
+    if (gap.reason === "missing-check") {
+        ensure(gap.checkId !== null, "missing checkId");
+        return { kind: "run-check", claimId, checkId: gap.checkId };
+    }
+    const claim = claims.find((c) => c.id === claimId && c.binding === gap.binding);
+    ensure(claim !== undefined, "report has stale or unknown claim");
+    const history = attempts.filter((a) => a.claimId === claimId && a.binding === gap.binding);
+    if (history.some((a) => a.result === "in-flight"))
+        return { kind: "await-owned-work", claimId };
+    if (history.some((a) => a.result === "candidates"))
+        return { kind: "review-candidates", claimId };
+    if (policy.remainingRequests === 0 || policy.remainingMs === 0) {
+        return { kind: "blocked", claimId, reason: "acquisition-budget-exhausted" };
+    }
+    for (const channel of ["local", "official", "web"]) {
+        if (!policy.availableChannels.includes(channel) || history.some((a) => a.channel === channel))
+            continue;
+        if (channel !== "local" && (!policy.remoteQueryApprovedClaimIds.includes(claimId) || claim.publicQuery === null))
+            continue;
+        return { kind: "search", claimId, channel, query: channel === "local" ? claim.statement : claim.publicQuery };
+    }
+    return { kind: "blocked", claimId, reason: "no-approved-untried-source" };
+}
+//# sourceMappingURL=knowledge-action.js.map