open-multi-agent-kit 1.0.0 → 1.2.0

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

package/dist/metacognition/knowledge-action.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-action.js","sourceRoot":"","sources":["../../src/metacognition/knowledge-action.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AA+BxE,+FAA+F;AAC/F,MAAM,UAAU,mBAAmB,CAClC,MAAuB,EACvB,MAAwB,EACxB,QAAkC,EAClC,MAAoB,EACF;IAClB,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,CAAC;IACvD,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IAC3C,MAAM,CAAC,MAAM,CAAC,iBAAiB,EAAE,mBAAmB,EAAE,CAAC,CAAC,CAAC;IACzD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,iBAAiB;QAAE,MAAM,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAChH,MAAM,CAAC,MAAM,CAAC,2BAA2B,EAAE,kBAAkB,EAAE,GAAG,CAAC,CAAC;IACpE,MAAM,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAE,0BAA0B,CAAC,CAAC;IAC5D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QACvC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,iBAAiB,CAAC,CAAC;QACzE,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC1F,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChD,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,uDAAuD,EAAE,CAAC;IACvG,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;IAC5B,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB;QAAE,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,CAAC;IACnF,IAAI,GAAG,CAAC,MAAM,KAAK,uBAAuB;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IACjF,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB;QAAE,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;IAChF,IAAI,GAAG,CAAC,MAAM,KAAK,cAAc;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IACtE,IAAI,GAAG,CAAC,MAAM,KAAK,eAAe;QAAE,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,CAAC;IACjF,IAAI,GAAG,CAAC,MAAM,KAAK,eAAe,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,OAAO,KAAK,IAAI,EAAE,iBAAiB,CAAC,CAAC;QAChD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;IAC7D,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;IAChF,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,mCAAmC,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;IAC3F,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,CAAC;IAChG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,mBAAmB,EAAE,OAAO,EAAE,CAAC;IAClG,IAAI,MAAM,CAAC,iBAAiB,KAAK,CAAC,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;QAChE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,8BAA8B,EAAE,CAAC;IAC7E,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAU,EAAE,CAAC;QAC7D,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC;YAAE,SAAS;QACxG,IAAI,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,MAAM,CAAC,2BAA2B,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI,CAAC;YAC/G,SAAS;QACV,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,WAAY,EAAE,CAAC;IAChH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC;AAAA,CAC1E","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.d.ts

@@ -0,0 +1,84 @@
+export type Stage = "before-change" | "after-change";
+export interface Claim {
+    readonly id: string;
+    /** Hash/fingerprint computed by the host over the relevant subject and environment. */
+    readonly binding: string;
+    readonly phase: "precondition" | "postcondition";
+    readonly statement: string;
+    readonly required: boolean;
+    readonly impact: number;
+    readonly needsReference: boolean;
+    readonly requiresVersion: boolean;
+    readonly version: string | null;
+    readonly minSourceFamilies: number;
+    readonly requiredCheckIds: readonly string[];
+    readonly needsUserDecision: boolean;
+    /** Only explicit, host-approved public text can leave the repository. */
+    readonly publicQuery: string | null;
+}
+export interface SourceIdentity {
+    readonly id: string;
+    readonly family: string;
+    readonly kind: "repository" | "official" | "community" | "model";
+}
+interface ObservationBase {
+    readonly id: string;
+    readonly claimId: string;
+    readonly binding: string;
+    readonly observedAtMs: number;
+    readonly expiresAtMs: number;
+}
+export interface ReferenceObservation extends ObservationBase {
+    readonly kind: "reference";
+    readonly sourceId: string;
+    readonly version: string | null;
+    readonly stance: "support" | "refute";
+    readonly documentDigest: string;
+    readonly locator: string;
+}
+export interface CheckObservation extends ObservationBase {
+    readonly kind: "check";
+    readonly runnerId: string;
+    readonly checkId: string;
+    /** Host-ordered snapshot. In OMK, project the existing strict evidence ledger here. */
+    readonly sequence: number;
+    readonly verdict: "pass" | "fail" | "pending";
+}
+export interface DecisionObservation extends ObservationBase {
+    readonly kind: "decision";
+    readonly actorId: string;
+    readonly accepted: boolean;
+}
+export type Observation = ReferenceObservation | CheckObservation | DecisionObservation;
+export type GapReason = "unassessed-step" | "unknown-version" | "unsupported-reference" | "contradictory-reference" | "missing-check" | "failed-check" | "pending-check" | "missing-user-decision";
+export interface KnowledgeGap {
+    readonly claimId: string;
+    readonly binding: string;
+    readonly reason: GapReason;
+    readonly required: boolean;
+    readonly impact: number;
+    readonly checkId: string | null;
+}
+export interface KnowledgeReport {
+    readonly state: "supported" | "gaps";
+    readonly gaps: readonly KnowledgeGap[];
+    readonly supportedClaimIds: readonly string[];
+    readonly rejectedObservations: readonly {
+        id: string;
+        reason: string;
+    }[];
+}
+export interface KnowledgeInput {
+    readonly stage: Stage;
+    readonly requiresAssessment: boolean;
+    readonly nowMs: number;
+    readonly claims: readonly Claim[];
+    /** Admitted host observations only. Never pass a model's JSON here as runner truth. */
+    readonly observations: readonly Observation[];
+    readonly sources: readonly SourceIdentity[];
+    readonly trustedRunnerIds: readonly string[];
+    readonly decisionActorIds: readonly string[];
+}
+export declare function inspectKnowledge(input: KnowledgeInput): KnowledgeReport;
+export {};
+//# sourceMappingURL=knowledge.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge.d.ts","sourceRoot":"","sources":["../../src/metacognition/knowledge.ts"],"names":[],"mappings":"AASA,MAAM,MAAM,KAAK,GAAG,eAAe,GAAG,cAAc,CAAC;AACrD,MAAM,WAAW,KAAK;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,uFAAuF;IACvF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,cAAc,GAAG,eAAe,CAAC;IACjD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,QAAQ,CAAC,iBAAiB,EAAE,OAAO,CAAC;IACpC,yEAAyE;IACzE,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AACD,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,YAAY,GAAG,UAAU,GAAG,WAAW,GAAG,OAAO,CAAC;CACjE;AACD,UAAU,eAAe;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AACD,MAAM,WAAW,oBAAqB,SAAQ,eAAe;IAC5D,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,QAAQ,CAAC;IACtC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB;AACD,MAAM,WAAW,gBAAiB,SAAQ,eAAe;IACxD,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uFAAuF;IACvF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;CAC9C;AACD,MAAM,WAAW,mBAAoB,SAAQ,eAAe;IAC3D,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC3B;AACD,MAAM,MAAM,WAAW,GAAG,oBAAoB,GAAG,gBAAgB,GAAG,mBAAmB,CAAC;AACxF,MAAM,MAAM,SAAS,GAClB,iBAAiB,GACjB,iBAAiB,GACjB,uBAAuB,GACvB,yBAAyB,GACzB,eAAe,GACf,cAAc,GACd,eAAe,GACf,uBAAuB,CAAC;AAC3B,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AACD,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C,QAAQ,CAAC,oBAAoB,EAAE,SAAS;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CACzE;AACD,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC;IAClC,uFAAuF;IACvF,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9C,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7C;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,cAAc,GAAG,eAAe,CAuJvE","sourcesContent":["/**\n * Claim/evidence gap inspection and the bounded next-action selector.\n *\n * Ported from docs/OMK_skill_knowledge_control_2026-09-19.zip\n * (src/knowledge.ts). Host-owned observations only; a model's JSON is never\n * runner truth. See OMK_metacognitive_control_algorithms_2026-09-19.md §13.\n */\nimport { canonical, ensure, integer, lexical, member, text, unique } from \"./validation.ts\";\n\nexport type Stage = \"before-change\" | \"after-change\";\nexport interface Claim {\n\treadonly id: string;\n\t/** Hash/fingerprint computed by the host over the relevant subject and environment. */\n\treadonly binding: string;\n\treadonly phase: \"precondition\" | \"postcondition\";\n\treadonly statement: string;\n\treadonly required: boolean;\n\treadonly impact: number;\n\treadonly needsReference: boolean;\n\treadonly requiresVersion: boolean;\n\treadonly version: string | null;\n\treadonly minSourceFamilies: number;\n\treadonly requiredCheckIds: readonly string[];\n\treadonly needsUserDecision: boolean;\n\t/** Only explicit, host-approved public text can leave the repository. */\n\treadonly publicQuery: string | null;\n}\nexport interface SourceIdentity {\n\treadonly id: string;\n\treadonly family: string;\n\treadonly kind: \"repository\" | \"official\" | \"community\" | \"model\";\n}\ninterface ObservationBase {\n\treadonly id: string;\n\treadonly claimId: string;\n\treadonly binding: string;\n\treadonly observedAtMs: number;\n\treadonly expiresAtMs: number;\n}\nexport interface ReferenceObservation extends ObservationBase {\n\treadonly kind: \"reference\";\n\treadonly sourceId: string;\n\treadonly version: string | null;\n\treadonly stance: \"support\" | \"refute\";\n\treadonly documentDigest: string;\n\treadonly locator: string;\n}\nexport interface CheckObservation extends ObservationBase {\n\treadonly kind: \"check\";\n\treadonly runnerId: string;\n\treadonly checkId: string;\n\t/** Host-ordered snapshot. In OMK, project the existing strict evidence ledger here. */\n\treadonly sequence: number;\n\treadonly verdict: \"pass\" | \"fail\" | \"pending\";\n}\nexport interface DecisionObservation extends ObservationBase {\n\treadonly kind: \"decision\";\n\treadonly actorId: string;\n\treadonly accepted: boolean;\n}\nexport type Observation = ReferenceObservation | CheckObservation | DecisionObservation;\nexport type GapReason =\n\t| \"unassessed-step\"\n\t| \"unknown-version\"\n\t| \"unsupported-reference\"\n\t| \"contradictory-reference\"\n\t| \"missing-check\"\n\t| \"failed-check\"\n\t| \"pending-check\"\n\t| \"missing-user-decision\";\nexport interface KnowledgeGap {\n\treadonly claimId: string;\n\treadonly binding: string;\n\treadonly reason: GapReason;\n\treadonly required: boolean;\n\treadonly impact: number;\n\treadonly checkId: string | null;\n}\nexport interface KnowledgeReport {\n\treadonly state: \"supported\" | \"gaps\";\n\treadonly gaps: readonly KnowledgeGap[];\n\treadonly supportedClaimIds: readonly string[];\n\treadonly rejectedObservations: readonly { id: string; reason: string }[];\n}\nexport interface KnowledgeInput {\n\treadonly stage: Stage;\n\treadonly requiresAssessment: boolean;\n\treadonly nowMs: number;\n\treadonly claims: readonly Claim[];\n\t/** Admitted host observations only. Never pass a model's JSON here as runner truth. */\n\treadonly observations: readonly Observation[];\n\treadonly sources: readonly SourceIdentity[];\n\treadonly trustedRunnerIds: readonly string[];\n\treadonly decisionActorIds: readonly string[];\n}\n\nexport function inspectKnowledge(input: KnowledgeInput): KnowledgeReport {\n\tmember(input.stage, [\"before-change\", \"after-change\"], \"stage\");\n\tinteger(input.nowMs, \"nowMs\");\n\tensure(typeof input.requiresAssessment === \"boolean\", \"requiresAssessment must be boolean\");\n\tensure(input.claims.length <= 128 && input.observations.length <= 4096, \"knowledge input too large\");\n\tunique(\n\t\tinput.claims.map((c) => c.id),\n\t\t\"claim ids\",\n\t\t128,\n\t);\n\tunique(\n\t\tinput.sources.map((s) => s.id),\n\t\t\"source ids\",\n\t\t512,\n\t);\n\tunique(input.trustedRunnerIds, \"runner ids\");\n\tunique(input.decisionActorIds, \"decision actor ids\");\n\tfor (const c of input.claims) {\n\t\ttext(c.binding, \"binding\");\n\t\ttext(c.statement, \"statement\");\n\t\tmember(c.phase, [\"precondition\", \"postcondition\"], \"claim phase\");\n\t\tfor (const v of [c.required, c.needsReference, c.requiresVersion, c.needsUserDecision]) {\n\t\t\tensure(typeof v === \"boolean\", \"invalid claim flag\");\n\t\t}\n\t\tensure(Number.isFinite(c.impact) && c.impact >= 0 && c.impact <= 1_000_000, \"invalid impact\");\n\t\tinteger(c.minSourceFamilies, \"minSourceFamilies\", 16);\n\t\tensure(!c.needsReference || c.minSourceFamilies > 0, \"reference needs at least one source family\");\n\t\tif (c.version !== null) text(c.version, \"version\", 128);\n\t\tif (c.publicQuery !== null) text(c.publicQuery, \"publicQuery\", 500);\n\t\tunique(c.requiredCheckIds, \"check ids\", 128);\n\t\tensure(\n\t\t\tc.needsReference || c.requiredCheckIds.length > 0 || c.needsUserDecision,\n\t\t\t\"claim has no evidence predicate\",\n\t\t);\n\t}\n\tconst sources = new Map(\n\t\tinput.sources.map((s) => {\n\t\t\ttext(s.family, \"source family\");\n\t\t\tmember(s.kind, [\"repository\", \"official\", \"community\", \"model\"], \"source kind\");\n\t\t\treturn [s.id, s] as const;\n\t\t}),\n\t);\n\tconst observations = new Map<string, Observation>();\n\tconst sequences = new Map<string, string>();\n\tfor (const obs of input.observations) {\n\t\ttext(obs.id, \"observation id\");\n\t\ttext(obs.claimId, \"observation claim\");\n\t\ttext(obs.binding, \"observation binding\");\n\t\tinteger(obs.observedAtMs, \"observedAtMs\");\n\t\tinteger(obs.expiresAtMs, \"expiresAtMs\");\n\t\tensure(obs.expiresAtMs >= obs.observedAtMs, \"invalid observation validity interval\");\n\t\tmember(obs.kind, [\"reference\", \"check\", \"decision\"], \"observation kind\");\n\t\tif (obs.kind === \"reference\") {\n\t\t\ttext(obs.sourceId, \"sourceId\");\n\t\t\ttext(obs.documentDigest, \"documentDigest\");\n\t\t\ttext(obs.locator, \"locator\");\n\t\t\tif (obs.version !== null) text(obs.version, \"observation version\", 128);\n\t\t\tmember(obs.stance, [\"support\", \"refute\"], \"stance\");\n\t\t} else if (obs.kind === \"check\") {\n\t\t\ttext(obs.runnerId, \"runnerId\");\n\t\t\ttext(obs.checkId, \"checkId\");\n\t\t\tinteger(obs.sequence, \"sequence\");\n\t\t\tmember(obs.verdict, [\"pass\", \"fail\", \"pending\"], \"check verdict\");\n\t\t\tconst key = canonical([obs.claimId, obs.binding, obs.checkId, obs.sequence]);\n\t\t\tconst previous = sequences.get(key);\n\t\t\tensure(previous === undefined || previous === canonical(obs), \"conflicting check sequence\");\n\t\t\tsequences.set(key, canonical(obs));\n\t\t} else {\n\t\t\ttext(obs.actorId, \"actorId\");\n\t\t\tensure(typeof obs.accepted === \"boolean\", \"invalid decision\");\n\t\t}\n\t\tconst previous = observations.get(obs.id);\n\t\tensure(previous === undefined || canonical(previous) === canonical(obs), \"conflicting observation id\");\n\t\tobservations.set(obs.id, obs);\n\t}\n\tconst relevantClaims = input.claims.filter((c) => input.stage === \"after-change\" || c.phase === \"precondition\");\n\tconst rejectedObservations: { id: string; reason: string }[] = [];\n\tconst admissible = new Map<string, Observation[]>();\n\tconst claimMap = new Map(relevantClaims.map((c) => [c.id, c]));\n\tfor (const obs of observations.values()) {\n\t\tconst c = claimMap.get(obs.claimId);\n\t\tlet reason: string | undefined;\n\t\tif (!c) reason = \"irrelevant-claim-or-stage\";\n\t\telse if (obs.binding !== c.binding) reason = \"stale-binding\";\n\t\telse if (obs.observedAtMs > input.nowMs || obs.expiresAtMs <= input.nowMs) reason = \"expired-or-future\";\n\t\telse if (obs.kind === \"reference\") {\n\t\t\tconst source = sources.get(obs.sourceId);\n\t\t\tif (!source || (source.kind !== \"repository\" && source.kind !== \"official\")) reason = \"inadmissible-source\";\n\t\t\telse if (c.requiresVersion && (c.version === null || obs.version !== c.version)) reason = \"version-mismatch\";\n\t\t} else if (obs.kind === \"check\" && !input.trustedRunnerIds.includes(obs.runnerId)) reason = \"untrusted-runner\";\n\t\telse if (obs.kind === \"decision\" && !input.decisionActorIds.includes(obs.actorId)) {\n\t\t\treason = \"untrusted-decision-actor\";\n\t\t}\n\t\tif (reason) rejectedObservations.push({ id: obs.id, reason });\n\t\telse admissible.set(obs.claimId, [...(admissible.get(obs.claimId) ?? []), obs]);\n\t}\n\tconst gaps: KnowledgeGap[] = [];\n\tconst supportedClaimIds: string[] = [];\n\tif (input.requiresAssessment && relevantClaims.filter((c) => c.required).length === 0) {\n\t\tgaps.push({\n\t\t\tclaimId: \"$step\",\n\t\t\tbinding: \"unassessed\",\n\t\t\treason: \"unassessed-step\",\n\t\t\trequired: true,\n\t\t\timpact: 1_000_000,\n\t\t\tcheckId: null,\n\t\t});\n\t}\n\tfor (const c of relevantClaims) {\n\t\tconst before = gaps.length;\n\t\tconst evidence = admissible.get(c.id) ?? [];\n\t\tconst add = (reason: GapReason, checkId: string | null = null): void => {\n\t\t\tgaps.push({ claimId: c.id, binding: c.binding, reason, required: c.required, impact: c.impact, checkId });\n\t\t};\n\t\tif (c.requiresVersion && c.version === null) add(\"unknown-version\");\n\t\tif (c.needsReference) {\n\t\t\tconst refs = evidence.filter((obs): obs is ReferenceObservation => obs.kind === \"reference\");\n\t\t\tconst support = new Set(\n\t\t\t\trefs.filter((r) => r.stance === \"support\").map((r) => sources.get(r.sourceId)!.family),\n\t\t\t);\n\t\t\tif (refs.some((r) => r.stance === \"refute\")) add(\"contradictory-reference\");\n\t\t\telse if (support.size < c.minSourceFamilies) add(\"unsupported-reference\");\n\t\t}\n\t\tfor (const checkId of c.requiredCheckIds) {\n\t\t\tconst records = evidence\n\t\t\t\t.filter((obs): obs is CheckObservation => obs.kind === \"check\" && obs.checkId === checkId)\n\t\t\t\t.sort((a, b) => a.sequence - b.sequence);\n\t\t\tconst latest = records.at(-1);\n\t\t\tif (!latest) add(\"missing-check\", checkId);\n\t\t\telse if (latest.verdict === \"fail\") add(\"failed-check\", checkId);\n\t\t\telse if (latest.verdict === \"pending\") add(\"pending-check\", checkId);\n\t\t}\n\t\tif (c.needsUserDecision) {\n\t\t\tconst decisions = evidence.filter((obs): obs is DecisionObservation => obs.kind === \"decision\");\n\t\t\tif (!decisions.some((d) => d.accepted) || decisions.some((d) => !d.accepted)) add(\"missing-user-decision\");\n\t\t}\n\t\tif (before === gaps.length) supportedClaimIds.push(c.id);\n\t}\n\tgaps.sort(\n\t\t(a, b) =>\n\t\t\tNumber(b.required) - Number(a.required) ||\n\t\t\tb.impact - a.impact ||\n\t\t\tlexical(a.claimId, b.claimId) ||\n\t\t\tlexical(a.reason, b.reason),\n\t);\n\treturn {\n\t\tstate: gaps.some((g) => g.required) ? \"gaps\" : \"supported\",\n\t\tgaps,\n\t\tsupportedClaimIds: supportedClaimIds.sort(lexical),\n\t\trejectedObservations,\n\t};\n}\n"]}

package/dist/metacognition/knowledge.js

@@ -0,0 +1,165 @@
+/**
+ * Claim/evidence gap inspection and the bounded next-action selector.
+ *
+ * Ported from docs/OMK_skill_knowledge_control_2026-09-19.zip
+ * (src/knowledge.ts). Host-owned observations only; a model's JSON is never
+ * runner truth. See OMK_metacognitive_control_algorithms_2026-09-19.md §13.
+ */
+import { canonical, ensure, integer, lexical, member, text, unique } from "./validation.js";
+export function inspectKnowledge(input) {
+    member(input.stage, ["before-change", "after-change"], "stage");
+    integer(input.nowMs, "nowMs");
+    ensure(typeof input.requiresAssessment === "boolean", "requiresAssessment must be boolean");
+    ensure(input.claims.length <= 128 && input.observations.length <= 4096, "knowledge input too large");
+    unique(input.claims.map((c) => c.id), "claim ids", 128);
+    unique(input.sources.map((s) => s.id), "source ids", 512);
+    unique(input.trustedRunnerIds, "runner ids");
+    unique(input.decisionActorIds, "decision actor ids");
+    for (const c of input.claims) {
+        text(c.binding, "binding");
+        text(c.statement, "statement");
+        member(c.phase, ["precondition", "postcondition"], "claim phase");
+        for (const v of [c.required, c.needsReference, c.requiresVersion, c.needsUserDecision]) {
+            ensure(typeof v === "boolean", "invalid claim flag");
+        }
+        ensure(Number.isFinite(c.impact) && c.impact >= 0 && c.impact <= 1_000_000, "invalid impact");
+        integer(c.minSourceFamilies, "minSourceFamilies", 16);
+        ensure(!c.needsReference || c.minSourceFamilies > 0, "reference needs at least one source family");
+        if (c.version !== null)
+            text(c.version, "version", 128);
+        if (c.publicQuery !== null)
+            text(c.publicQuery, "publicQuery", 500);
+        unique(c.requiredCheckIds, "check ids", 128);
+        ensure(c.needsReference || c.requiredCheckIds.length > 0 || c.needsUserDecision, "claim has no evidence predicate");
+    }
+    const sources = new Map(input.sources.map((s) => {
+        text(s.family, "source family");
+        member(s.kind, ["repository", "official", "community", "model"], "source kind");
+        return [s.id, s];
+    }));
+    const observations = new Map();
+    const sequences = new Map();
+    for (const obs of input.observations) {
+        text(obs.id, "observation id");
+        text(obs.claimId, "observation claim");
+        text(obs.binding, "observation binding");
+        integer(obs.observedAtMs, "observedAtMs");
+        integer(obs.expiresAtMs, "expiresAtMs");
+        ensure(obs.expiresAtMs >= obs.observedAtMs, "invalid observation validity interval");
+        member(obs.kind, ["reference", "check", "decision"], "observation kind");
+        if (obs.kind === "reference") {
+            text(obs.sourceId, "sourceId");
+            text(obs.documentDigest, "documentDigest");
+            text(obs.locator, "locator");
+            if (obs.version !== null)
+                text(obs.version, "observation version", 128);
+            member(obs.stance, ["support", "refute"], "stance");
+        }
+        else if (obs.kind === "check") {
+            text(obs.runnerId, "runnerId");
+            text(obs.checkId, "checkId");
+            integer(obs.sequence, "sequence");
+            member(obs.verdict, ["pass", "fail", "pending"], "check verdict");
+            const key = canonical([obs.claimId, obs.binding, obs.checkId, obs.sequence]);
+            const previous = sequences.get(key);
+            ensure(previous === undefined || previous === canonical(obs), "conflicting check sequence");
+            sequences.set(key, canonical(obs));
+        }
+        else {
+            text(obs.actorId, "actorId");
+            ensure(typeof obs.accepted === "boolean", "invalid decision");
+        }
+        const previous = observations.get(obs.id);
+        ensure(previous === undefined || canonical(previous) === canonical(obs), "conflicting observation id");
+        observations.set(obs.id, obs);
+    }
+    const relevantClaims = input.claims.filter((c) => input.stage === "after-change" || c.phase === "precondition");
+    const rejectedObservations = [];
+    const admissible = new Map();
+    const claimMap = new Map(relevantClaims.map((c) => [c.id, c]));
+    for (const obs of observations.values()) {
+        const c = claimMap.get(obs.claimId);
+        let reason;
+        if (!c)
+            reason = "irrelevant-claim-or-stage";
+        else if (obs.binding !== c.binding)
+            reason = "stale-binding";
+        else if (obs.observedAtMs > input.nowMs || obs.expiresAtMs <= input.nowMs)
+            reason = "expired-or-future";
+        else if (obs.kind === "reference") {
+            const source = sources.get(obs.sourceId);
+            if (!source || (source.kind !== "repository" && source.kind !== "official"))
+                reason = "inadmissible-source";
+            else if (c.requiresVersion && (c.version === null || obs.version !== c.version))
+                reason = "version-mismatch";
+        }
+        else if (obs.kind === "check" && !input.trustedRunnerIds.includes(obs.runnerId))
+            reason = "untrusted-runner";
+        else if (obs.kind === "decision" && !input.decisionActorIds.includes(obs.actorId)) {
+            reason = "untrusted-decision-actor";
+        }
+        if (reason)
+            rejectedObservations.push({ id: obs.id, reason });
+        else
+            admissible.set(obs.claimId, [...(admissible.get(obs.claimId) ?? []), obs]);
+    }
+    const gaps = [];
+    const supportedClaimIds = [];
+    if (input.requiresAssessment && relevantClaims.filter((c) => c.required).length === 0) {
+        gaps.push({
+            claimId: "$step",
+            binding: "unassessed",
+            reason: "unassessed-step",
+            required: true,
+            impact: 1_000_000,
+            checkId: null,
+        });
+    }
+    for (const c of relevantClaims) {
+        const before = gaps.length;
+        const evidence = admissible.get(c.id) ?? [];
+        const add = (reason, checkId = null) => {
+            gaps.push({ claimId: c.id, binding: c.binding, reason, required: c.required, impact: c.impact, checkId });
+        };
+        if (c.requiresVersion && c.version === null)
+            add("unknown-version");
+        if (c.needsReference) {
+            const refs = evidence.filter((obs) => obs.kind === "reference");
+            const support = new Set(refs.filter((r) => r.stance === "support").map((r) => sources.get(r.sourceId).family));
+            if (refs.some((r) => r.stance === "refute"))
+                add("contradictory-reference");
+            else if (support.size < c.minSourceFamilies)
+                add("unsupported-reference");
+        }
+        for (const checkId of c.requiredCheckIds) {
+            const records = evidence
+                .filter((obs) => obs.kind === "check" && obs.checkId === checkId)
+                .sort((a, b) => a.sequence - b.sequence);
+            const latest = records.at(-1);
+            if (!latest)
+                add("missing-check", checkId);
+            else if (latest.verdict === "fail")
+                add("failed-check", checkId);
+            else if (latest.verdict === "pending")
+                add("pending-check", checkId);
+        }
+        if (c.needsUserDecision) {
+            const decisions = evidence.filter((obs) => obs.kind === "decision");
+            if (!decisions.some((d) => d.accepted) || decisions.some((d) => !d.accepted))
+                add("missing-user-decision");
+        }
+        if (before === gaps.length)
+            supportedClaimIds.push(c.id);
+    }
+    gaps.sort((a, b) => Number(b.required) - Number(a.required) ||
+        b.impact - a.impact ||
+        lexical(a.claimId, b.claimId) ||
+        lexical(a.reason, b.reason));
+    return {
+        state: gaps.some((g) => g.required) ? "gaps" : "supported",
+        gaps,
+        supportedClaimIds: supportedClaimIds.sort(lexical),
+        rejectedObservations,
+    };
+}
+//# sourceMappingURL=knowledge.js.map