open-multi-agent-kit 0.99.0 → 1.2.0

package/dist/metacognition/obligations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"obligations.js","sourceRoot":"","sources":["../../src/metacognition/obligations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAmEpG,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,MAAM,UAAU,GAAG,GAAG,CAAC;AAEvB,MAAM,UAAU,YAAY,CAAC,IAAgB,EAAQ;IACpD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;IACvC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,eAAe,EAAE,GAAG,CAAC,CAAC;IAC/C,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7F,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACzG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,eAAe,EAAE,mBAAmB,EAAE,oBAAoB,CAAC,EAAE,aAAa,CAAC,CAAC;IACjG,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,EAAE,kBAAkB,CAAC,CAAC;AAAA,CACpG;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACrC,KAA4B,EAC5B,KAAgC,EAChC,KAAa,EACM;IACnB,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACxB,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,UAAU,EAAE,gBAAgB,CAAC,CAAC;IACrD,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,UAAU,EAAE,gBAAgB,CAAC,CAAC;IACrD,MAAM,CACL,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACtB,UAAU,CACV,CAAC;IACF,MAAM,CACL,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAC1B,UAAU,CACV,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,YAAY,CAAC,IAAI,CAAC,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,kBAAkB,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,EAAE,qBAAqB,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,QAAQ,GAAiB,EAAE,CAAC;IAClC,MAAM,UAAU,GAAiB,EAAE,CAAC;IACpC,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,iBAAiB,GAAa,EAAE,CAAC;IACvC,MAAM,oBAAoB,GAAa,EAAE,CAAC;IAC1C,IAAI,kBAAkB,GAAG,KAAK,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS;YAAE,kBAAkB,GAAG,IAAI,CAAC;QACnE,IAAI,IAAI,CAAC,gBAAgB,KAAK,aAAa;YAAE,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7E,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YACrB,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAChE,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC;gBAAE,SAAS;YAClF,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;gBAAE,SAAS;YAC/E,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC;gBAAE,SAAS;YACnE,OAAO,GAAG,IAAI,CAAC;YACf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,mBAAmB,EAAE,SAAS,CAAC,CAAC;gBACpD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/D,MAAM,UAAU,GAAe;oBAC9B,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,YAAY,EAAE;oBACpD,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;oBACzB,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,aAAa,EAAE,IAAI,CAAC,aAAa;oBACjC,KAAK,EAAE,IAAI,CAAC,QAAQ;oBACpB,qBAAqB,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,OAAO;oBACP,cAAc,EAAE,CAAC;oBACjB,gBAAgB,EAAE,CAAC;oBACnB,MAAM,EACL,IAAI,CAAC,MAAM,KAAK,oBAAoB;wBACnC,CAAC,CAAC,IAAI,CAAC,cAAc,KAAK,OAAO;4BAChC,IAAI,CAAC,cAAc,KAAK,SAAS;4BACjC,IAAI,CAAC,cAAc,KAAK,QAAQ;4BAChC,CAAC,CAAC,mBAAmB;4BACrB,CAAC,CAAC,WAAW;wBACd,CAAC,CAAC,IAAI,CAAC,QAAQ;4BACd,CAAC,CAAC,UAAU;4BACZ,CAAC,CAAC,WAAW;iBAChB,CAAC;gBACF,CAAC,IAAI,CAAC,MAAM,KAAK,oBAAoB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACjF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM;YAAE,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,eAAe,GAAG,CAAC,CAAa,EAAE,CAAa,EAAU,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7G,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC/B,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACjC,OAAO;QACN,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC;QACzD,UAAU;QACV,eAAe,EAAE,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC;QAC9C,iBAAiB,EAAE,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC;QAClD,mBAAmB,EAAE,EAAE;QACvB,QAAQ,EACP,kBAAkB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;KACzG,CAAC;AAAA,CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAa,EAAE,OAAO,GAAG,IAAI,EAAU;IACzE,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,CAAC,gBAAgB,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC1C,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IAChC,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;AAAA,CAC9F;AAED,sFAAsF;AACtF,MAAM,UAAU,gBAAgB,CAC/B,WAAkC,EAClC,YAAoB,EACpB,YAA8C,EACtB;IACxB,IAAI,CAAC,YAAY,EAAE,cAAc,EAAE,GAAG,CAAC,CAAC;IACxC,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,CAAC,CAAC,EAAE,KAAK,YAAY;YAAE,OAAO,CAAC,CAAC;QACpC,MAAM,MAAM,GACX,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACzF,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC;IAAA,CACxB,CAAC,CAAC;AAAA,CACH;AAED,oEAAoE;AACpE,MAAM,UAAU,qBAAqB,CAAC,CAAa,EAAU;IAC5D,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAAA,CAC5E","sourcesContent":["/**\n * Algorithm A — missing-condition discovery and obligation generation.\n * Spec: OMK_metacognitive_control_algorithms_2026-09-19.md §4.\n *\n * Change atoms (target + operation + trust boundary + temporal property +\n * external effect + observation source + analyzer coverage) are matched\n * against a versioned host rule set. Host facts promote candidates to\n * required obligations; model hypotheses stay candidates. Model proposals\n * can never remove user or policy obligations.\n */\nimport { canonical, ensure, finite, integer, lexical, member, text, unique } from \"./validation.ts\";\n\nexport type ObservationSource = \"host-observed\" | \"analyzer-inferred\" | \"model-hypothesized\";\nexport type Coverage = \"covered\" | \"partial\" | \"unsupported\" | \"unknown\";\n\n/** §4.2: one observable change atom, not a filename or keyword. */\nexport interface ChangeAtom {\n\treadonly id: string;\n\treadonly targetId: string;\n\treadonly operation: string;\n\treadonly trustBoundary: string;\n\treadonly temporal: \"synchronous\" | \"async\" | \"concurrent\" | \"retried\" | \"none\";\n\treadonly externalEffect: \"none\" | \"read\" | \"write\" | \"network\" | \"payment\" | \"delete\";\n\treadonly source: ObservationSource;\n\treadonly analyzerCoverage: Coverage;\n}\n/** A versioned host rule: when its predicates hold, instantiate obligations. */\nexport interface ObligationRule {\n\treadonly ruleId: string;\n\treadonly ruleVersion: string;\n\treadonly description: string;\n\treadonly match: {\n\t\treadonly temporal?: readonly ChangeAtom[\"temporal\"][];\n\t\treadonly externalEffect?: readonly ChangeAtom[\"externalEffect\"][];\n\t\treadonly trustBoundary?: readonly string[];\n\t\treadonly operation?: readonly string[];\n\t};\n\t/** Obligations instantiated when this rule fires. */\n\treadonly produce: readonly {\n\t\treadonly obligationId: string;\n\t\treadonly statement: string;\n\t\treadonly kind: \"precondition\" | \"postcondition\";\n\t\treadonly checkMethodId: string | null;\n\t\treadonly required: boolean;\n\t\treadonly impact: number;\n\t\treadonly minSourceFamilies?: number;\n\t\treadonly requiresVersion?: boolean;\n\t}[];\n}\nexport type ObligationStatus = \"candidate\" | \"required\" | \"satisfied\" | \"violated\" | \"blocked-high-risk\";\nexport interface Obligation {\n\treadonly id: string;\n\treadonly atomId: string;\n\treadonly ruleId: string;\n\treadonly ruleVersion: string;\n\treadonly statement: string;\n\treadonly kind: \"precondition\" | \"postcondition\";\n\treadonly checkMethodId: string | null;\n\treadonly scope: string;\n\treadonly triggerObservationIds: readonly string[];\n\treadonly required: boolean;\n\treadonly impact: number;\n\treadonly novelty: number;\n\treadonly normalizedCost: number;\n\treadonly coverageFraction: number;\n\tstatus: ObligationStatus;\n}\nexport interface ObligationReport {\n\treadonly required: readonly Obligation[];\n\treadonly candidates: readonly Obligation[];\n\t/** Effects/rules we could not map — never claim completeness. */\n\treadonly unmappedEffects: readonly string[];\n\treadonly unsupportedSyntax: readonly string[];\n\treadonly unobservedConsumers: readonly string[];\n\treadonly coverage: \"complete\" | \"partial\" | \"unknown\";\n}\n\nconst ATOM_BOUND = 512;\nconst RULE_BOUND = 256;\n\nexport function validateAtom(atom: ChangeAtom): void {\n\ttext(atom.id, \"atom id\", 128);\n\ttext(atom.targetId, \"targetId\", 512);\n\ttext(atom.operation, \"operation\", 128);\n\ttext(atom.trustBoundary, \"trustBoundary\", 256);\n\tmember(atom.temporal, [\"synchronous\", \"async\", \"concurrent\", \"retried\", \"none\"], \"temporal\");\n\tmember(atom.externalEffect, [\"none\", \"read\", \"write\", \"network\", \"payment\", \"delete\"], \"externalEffect\");\n\tmember(atom.source, [\"host-observed\", \"analyzer-inferred\", \"model-hypothesized\"], \"atom source\");\n\tmember(atom.analyzerCoverage, [\"covered\", \"partial\", \"unsupported\", \"unknown\"], \"analyzerCoverage\");\n}\n\n/**\n * Instantiate host rules over observed atoms. Rules fire only on atoms whose\n * predicates are satisfied; `model-hypothesized` atoms produce candidates,\n * never required obligations. High-risk effects on unverified hypotheses are\n * surfaced as `blocked-high-risk` candidates so the host can gate the effect.\n */\nexport function instantiateObligations(\n\tatoms: readonly ChangeAtom[],\n\trules: readonly ObligationRule[],\n\tnowMs: number,\n): ObligationReport {\n\tinteger(nowMs, \"nowMs\");\n\tensure(atoms.length <= ATOM_BOUND, \"too many atoms\");\n\tensure(rules.length <= RULE_BOUND, \"too many rules\");\n\tunique(\n\t\tatoms.map((a) => a.id),\n\t\t\"atom ids\",\n\t);\n\tunique(\n\t\trules.map((r) => r.ruleId),\n\t\t\"rule ids\",\n\t);\n\tfor (const atom of atoms) validateAtom(atom);\n\tfor (const rule of rules) {\n\t\ttext(rule.ruleVersion, \"ruleVersion\", 64);\n\t\ttext(rule.description, \"rule description\", 512);\n\t\tensure(rule.produce.length > 0 && rule.produce.length <= 32, \"rule produce bounds\");\n\t}\n\tconst required: Obligation[] = [];\n\tconst candidates: Obligation[] = [];\n\tconst unmappedEffects: string[] = [];\n\tconst unsupportedSyntax: string[] = [];\n\tconst _unobservedConsumers: string[] = [];\n\tlet sawUnknownCoverage = false;\n\tfor (const atom of atoms) {\n\t\tif (atom.analyzerCoverage === \"unknown\") sawUnknownCoverage = true;\n\t\tif (atom.analyzerCoverage === \"unsupported\") unsupportedSyntax.push(atom.id);\n\t\tlet matched = false;\n\t\tfor (const rule of rules) {\n\t\t\tconst m = rule.match;\n\t\t\tif (m.temporal && !m.temporal.includes(atom.temporal)) continue;\n\t\t\tif (m.externalEffect && !m.externalEffect.includes(atom.externalEffect)) continue;\n\t\t\tif (m.trustBoundary && !m.trustBoundary.includes(atom.trustBoundary)) continue;\n\t\t\tif (m.operation && !m.operation.includes(atom.operation)) continue;\n\t\t\tmatched = true;\n\t\t\tfor (const prod of rule.produce) {\n\t\t\t\tfinite(prod.impact, \"obligation impact\", 1_000_000);\n\t\t\t\tconst novelty = atom.source === \"model-hypothesized\" ? 1 : 0.5;\n\t\t\t\tconst obligation: Obligation = {\n\t\t\t\t\tid: `${rule.ruleId}:${atom.id}:${prod.obligationId}`,\n\t\t\t\t\tatomId: atom.id,\n\t\t\t\t\truleId: rule.ruleId,\n\t\t\t\t\truleVersion: rule.ruleVersion,\n\t\t\t\t\tstatement: prod.statement,\n\t\t\t\t\tkind: prod.kind,\n\t\t\t\t\tcheckMethodId: prod.checkMethodId,\n\t\t\t\t\tscope: atom.targetId,\n\t\t\t\t\ttriggerObservationIds: [atom.id],\n\t\t\t\t\trequired: prod.required,\n\t\t\t\t\timpact: prod.impact,\n\t\t\t\t\tnovelty,\n\t\t\t\t\tnormalizedCost: 1,\n\t\t\t\t\tcoverageFraction: 0,\n\t\t\t\t\tstatus:\n\t\t\t\t\t\tatom.source === \"model-hypothesized\"\n\t\t\t\t\t\t\t? atom.externalEffect === \"write\" ||\n\t\t\t\t\t\t\t\tatom.externalEffect === \"payment\" ||\n\t\t\t\t\t\t\t\tatom.externalEffect === \"delete\"\n\t\t\t\t\t\t\t\t? \"blocked-high-risk\"\n\t\t\t\t\t\t\t\t: \"candidate\"\n\t\t\t\t\t\t\t: prod.required\n\t\t\t\t\t\t\t\t? \"required\"\n\t\t\t\t\t\t\t\t: \"candidate\",\n\t\t\t\t};\n\t\t\t\t(atom.source === \"model-hypothesized\" ? candidates : required).push(obligation);\n\t\t\t}\n\t\t}\n\t\tif (!matched && atom.externalEffect !== \"none\") unmappedEffects.push(atom.id);\n\t}\n\tconst sortObligations = (a: Obligation, b: Obligation): number => b.impact - a.impact || lexical(a.id, b.id);\n\trequired.sort(sortObligations);\n\tcandidates.sort(sortObligations);\n\treturn {\n\t\trequired: required.filter((o) => o.status === \"required\"),\n\t\tcandidates,\n\t\tunmappedEffects: unmappedEffects.sort(lexical),\n\t\tunsupportedSyntax: unsupportedSyntax.sort(lexical),\n\t\tunobservedConsumers: [],\n\t\tcoverage:\n\t\t\tsawUnknownCoverage || unmappedEffects.length > 0 || unsupportedSyntax.length > 0 ? \"unknown\" : \"partial\",\n\t};\n}\n\n/**\n * §4.4 ranking score. NOT a failure probability — an explainable ordering key:\n * J(o) = impact·(1-coverage)·(1+novelty) / (ε + normalizedCost).\n * Priority classes are applied by the caller before this score is consulted.\n */\nexport function obligationPriority(o: Obligation, epsilon = 0.01): number {\n\tfinite(o.impact, \"impact\", 1_000_000);\n\tfinite(o.coverageFraction, \"coverage\", 1);\n\tfinite(o.novelty, \"novelty\", 1);\n\tfinite(o.normalizedCost, \"cost\", 1_000_000);\n\tfinite(epsilon, \"epsilon\", 1);\n\treturn (o.impact * (1 - o.coverageFraction) * (1 + o.novelty)) / (epsilon + o.normalizedCost);\n}\n\n/** Close an obligation when its bound check passes; open violations when it fails. */\nexport function settleObligation(\n\tobligations: readonly Obligation[],\n\tobligationId: string,\n\tcheckOutcome: \"pass\" | \"fail\" | \"unverifiable\",\n): readonly Obligation[] {\n\ttext(obligationId, \"obligationId\", 512);\n\treturn obligations.map((o) => {\n\t\tif (o.id !== obligationId) return o;\n\t\tconst status: ObligationStatus =\n\t\t\tcheckOutcome === \"pass\" ? \"satisfied\" : checkOutcome === \"fail\" ? \"violated\" : o.status;\n\t\treturn { ...o, status };\n\t});\n}\n\n/** Structural fingerprint for de-duplication across checkpoints. */\nexport function obligationFingerprint(o: Obligation): string {\n\treturn canonical([o.ruleId, o.ruleVersion, o.atomId, o.statement, o.scope]);\n}\n"]}

package/dist/metacognition/observation-validity.d.ts

@@ -0,0 +1,83 @@
+/**
+ * Observation validity and state packing (Jev audit algorithm A2, finding F10).
+ *
+ * F10: the value the existing code calls `freshness` is really a change
+ * indicator. Those are different facts — a screen observed one millisecond ago
+ * that has not changed scores zero on one and one on the other — so this module
+ * reports them separately and never derives one from the other.
+ *
+ * For anything risky the decay score is not the gate at all. An explicit
+ * maximum observation age and equality of the document and action generations
+ * decide validity; the decay value is a continuous signal for ranking, not a
+ * learned safety probability.
+ *
+ * "Check then click" is not a database transaction: the page keeps running.
+ * Re-checking the target narrows the race window, and the postcondition is what
+ * actually establishes the result.
+ */
+/** f = exp(−Δt/τ). A ranking signal, not a probability of safety. */
+export declare function timeDecayFreshness(elapsedMs: number, decayConstantMs: number): number;
+/** n = 1[h(x_t) ≠ h(x_{t−1})]. Orthogonal to age. */
+export declare function changeIndicator(previousStateHash: string | undefined, currentStateHash: string | undefined): 0 | 1;
+export interface ObservationValidityInput {
+    readonly observedAtMs: number;
+    readonly dispatchAtMs: number;
+    readonly decayConstantMs: number;
+    /** Hard bound for this risk tier; outranks any decay score. */
+    readonly maxObservationAgeMs: number;
+    /** Navigation, frame swap, tab swap, permission-session change. */
+    readonly observedDocumentGeneration: number;
+    readonly currentDocumentGeneration: number;
+    /** Chosen element's attachment, role, name, arguments, enabled state. */
+    readonly observedActionGeneration: number;
+    readonly currentActionGeneration: number;
+    readonly previousStateHash?: string;
+    readonly currentStateHash?: string;
+}
+export type ObservationValidityVerdict = {
+    readonly valid: true;
+    readonly freshness: number;
+    readonly changed: 0 | 1;
+    readonly ageMs: number;
+} | {
+    readonly valid: false;
+    readonly reason: "document-generation-changed" | "action-generation-changed" | "max-age-exceeded";
+};
+/**
+ * Decide whether an observation may still back a dispatch.
+ *
+ * Generation mismatches are reported before age: if the page navigated, saying
+ * "observation too old" sends the operator to tune a timeout instead of looking
+ * at the navigation that actually invalidated the target.
+ */
+export declare function evaluateObservationValidity(input: ObservationValidityInput): ObservationValidityVerdict;
+export interface StateItem {
+    readonly id: string;
+    readonly tokenCost: number;
+    readonly utility: number;
+    readonly required: boolean;
+}
+export type StatePackingResult = {
+    readonly status: "packed";
+    readonly selected: readonly string[];
+    readonly tokensUsed: number;
+    readonly utility: number;
+} | {
+    readonly status: "incomplete-state";
+    readonly missingRequired: readonly string[];
+    readonly requiredTokens: number;
+    readonly budget: number;
+};
+/**
+ * Pack observation state under a token budget.
+ *
+ * Required evidence is pinned first. When it alone exceeds the budget the
+ * result is `incomplete-state`, never a quietly truncated view: the caller has
+ * to narrow the observation rather than act on a state that lost its evidence.
+ *
+ * Optional items are then taken by utility density. That is the fixed-rule
+ * starting point the design asks for, not an optimal knapsack solution, and it
+ * is not claimed to be one.
+ */
+export declare function packState(items: readonly StateItem[], budget: number): StatePackingResult;
+//# sourceMappingURL=observation-validity.d.ts.map

package/dist/metacognition/observation-validity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"observation-validity.d.ts","sourceRoot":"","sources":["../../src/metacognition/observation-validity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,yEAAqE;AACrE,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,MAAM,CAUrF;AAED,yDAAqD;AACrD,wBAAgB,eAAe,CAAC,iBAAiB,EAAE,MAAM,GAAG,SAAS,EAAE,gBAAgB,EAAE,MAAM,GAAG,SAAS,GAAG,CAAC,GAAG,CAAC,CAGlH;AAED,MAAM,WAAW,wBAAwB;IACxC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,+DAA+D;IAC/D,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;IACrC,mEAAmE;IACnE,QAAQ,CAAC,0BAA0B,EAAE,MAAM,CAAC;IAC5C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAC3C,yEAAyE;IACzE,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC;IAC1C,QAAQ,CAAC,uBAAuB,EAAE,MAAM,CAAC;IACzC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACnC;AAED,MAAM,MAAM,0BAA0B,GACnC;IAAE,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACrG;IACA,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,6BAA6B,GAAG,2BAA2B,GAAG,kBAAkB,CAAC;CACjG,CAAC;AAEL;;;;;;GAMG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,wBAAwB,GAAG,0BAA0B,CAyBvG;AAED,MAAM,WAAW,SAAS;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,MAAM,kBAAkB,GAC3B;IACA,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACxB,GACD;IACA,QAAQ,CAAC,MAAM,EAAE,kBAAkB,CAAC;IACpC,QAAQ,CAAC,eAAe,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5C,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACvB,CAAC;AAEL;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,kBAAkB,CA4CzF","sourcesContent":["/**\n * Observation validity and state packing (Jev audit algorithm A2, finding F10).\n *\n * F10: the value the existing code calls `freshness` is really a change\n * indicator. Those are different facts — a screen observed one millisecond ago\n * that has not changed scores zero on one and one on the other — so this module\n * reports them separately and never derives one from the other.\n *\n * For anything risky the decay score is not the gate at all. An explicit\n * maximum observation age and equality of the document and action generations\n * decide validity; the decay value is a continuous signal for ranking, not a\n * learned safety probability.\n *\n * \"Check then click\" is not a database transaction: the page keeps running.\n * Re-checking the target narrows the race window, and the postcondition is what\n * actually establishes the result.\n */\n\nimport { ensure } from \"./validation.ts\";\n\n/** f = exp(−Δt/τ). A ranking signal, not a probability of safety. */\nexport function timeDecayFreshness(elapsedMs: number, decayConstantMs: number): number {\n\tensure(\n\t\ttypeof elapsedMs === \"number\" && Number.isFinite(elapsedMs) && elapsedMs >= 0,\n\t\t\"elapsedMs must be a nonnegative finite number\",\n\t);\n\tensure(\n\t\ttypeof decayConstantMs === \"number\" && Number.isFinite(decayConstantMs) && decayConstantMs > 0,\n\t\t\"decayConstantMs must be positive\",\n\t);\n\treturn Math.exp(-elapsedMs / decayConstantMs);\n}\n\n/** n = 1[h(x_t) ≠ h(x_{t−1})]. Orthogonal to age. */\nexport function changeIndicator(previousStateHash: string | undefined, currentStateHash: string | undefined): 0 | 1 {\n\tif (previousStateHash === undefined || currentStateHash === undefined) return 0;\n\treturn previousStateHash === currentStateHash ? 0 : 1;\n}\n\nexport interface ObservationValidityInput {\n\treadonly observedAtMs: number;\n\treadonly dispatchAtMs: number;\n\treadonly decayConstantMs: number;\n\t/** Hard bound for this risk tier; outranks any decay score. */\n\treadonly maxObservationAgeMs: number;\n\t/** Navigation, frame swap, tab swap, permission-session change. */\n\treadonly observedDocumentGeneration: number;\n\treadonly currentDocumentGeneration: number;\n\t/** Chosen element's attachment, role, name, arguments, enabled state. */\n\treadonly observedActionGeneration: number;\n\treadonly currentActionGeneration: number;\n\treadonly previousStateHash?: string;\n\treadonly currentStateHash?: string;\n}\n\nexport type ObservationValidityVerdict =\n\t| { readonly valid: true; readonly freshness: number; readonly changed: 0 | 1; readonly ageMs: number }\n\t| {\n\t\t\treadonly valid: false;\n\t\t\treadonly reason: \"document-generation-changed\" | \"action-generation-changed\" | \"max-age-exceeded\";\n\t  };\n\n/**\n * Decide whether an observation may still back a dispatch.\n *\n * Generation mismatches are reported before age: if the page navigated, saying\n * \"observation too old\" sends the operator to tune a timeout instead of looking\n * at the navigation that actually invalidated the target.\n */\nexport function evaluateObservationValidity(input: ObservationValidityInput): ObservationValidityVerdict {\n\tfor (const [label, value] of [\n\t\t[\"observedAtMs\", input.observedAtMs],\n\t\t[\"dispatchAtMs\", input.dispatchAtMs],\n\t\t[\"maxObservationAgeMs\", input.maxObservationAgeMs],\n\t] as const) {\n\t\tensure(typeof value === \"number\" && Number.isFinite(value) && value >= 0, `${label} must be nonnegative`);\n\t}\n\tconst ageMs = input.dispatchAtMs - input.observedAtMs;\n\tensure(ageMs >= 0, \"dispatchAtMs must not precede observedAtMs on a monotonic clock\");\n\n\tif (input.observedDocumentGeneration !== input.currentDocumentGeneration) {\n\t\treturn { valid: false, reason: \"document-generation-changed\" };\n\t}\n\tif (input.observedActionGeneration !== input.currentActionGeneration) {\n\t\treturn { valid: false, reason: \"action-generation-changed\" };\n\t}\n\tif (ageMs > input.maxObservationAgeMs) return { valid: false, reason: \"max-age-exceeded\" };\n\n\treturn {\n\t\tvalid: true,\n\t\tfreshness: timeDecayFreshness(ageMs, input.decayConstantMs),\n\t\tchanged: changeIndicator(input.previousStateHash, input.currentStateHash),\n\t\tageMs,\n\t};\n}\n\nexport interface StateItem {\n\treadonly id: string;\n\treadonly tokenCost: number;\n\treadonly utility: number;\n\treadonly required: boolean;\n}\n\nexport type StatePackingResult =\n\t| {\n\t\t\treadonly status: \"packed\";\n\t\t\treadonly selected: readonly string[];\n\t\t\treadonly tokensUsed: number;\n\t\t\treadonly utility: number;\n\t  }\n\t| {\n\t\t\treadonly status: \"incomplete-state\";\n\t\t\treadonly missingRequired: readonly string[];\n\t\t\treadonly requiredTokens: number;\n\t\t\treadonly budget: number;\n\t  };\n\n/**\n * Pack observation state under a token budget.\n *\n * Required evidence is pinned first. When it alone exceeds the budget the\n * result is `incomplete-state`, never a quietly truncated view: the caller has\n * to narrow the observation rather than act on a state that lost its evidence.\n *\n * Optional items are then taken by utility density. That is the fixed-rule\n * starting point the design asks for, not an optimal knapsack solution, and it\n * is not claimed to be one.\n */\nexport function packState(items: readonly StateItem[], budget: number): StatePackingResult {\n\tensure(Array.isArray(items), \"items must be an array\");\n\tensure(Number.isFinite(budget) && budget >= 0, \"budget must be nonnegative\");\n\tfor (const item of items) {\n\t\tensure(typeof item.id === \"string\" && item.id.length > 0, \"each item needs a non-empty id\");\n\t\tensure(Number.isFinite(item.tokenCost) && item.tokenCost >= 0, \"tokenCost must be nonnegative\");\n\t\tensure(Number.isFinite(item.utility) && item.utility >= 0, \"utility must be nonnegative\");\n\t}\n\n\tconst required: StateItem[] = [];\n\tconst optional: Array<{ item: StateItem; density: number }> = [];\n\tfor (const item of items) {\n\t\tif (item.required) required.push(item);\n\t\telse optional.push({ item, density: item.tokenCost === 0 ? Infinity : item.utility / item.tokenCost });\n\t}\n\tconst requiredTokens = required.reduce((sum, item) => sum + item.tokenCost, 0);\n\tif (requiredTokens > budget) {\n\t\treturn {\n\t\t\tstatus: \"incomplete-state\",\n\t\t\tmissingRequired: required.map((item) => item.id),\n\t\t\trequiredTokens,\n\t\t\tbudget,\n\t\t};\n\t}\n\n\tconst selected = required.map((item) => item.id);\n\tlet tokensUsed = requiredTokens;\n\tlet utility = required.reduce((sum, item) => sum + item.utility, 0);\n\n\t// Density order, with id as a tiebreak so equal densities pack deterministically.\n\tconst byId = (a: StateItem, b: StateItem): number => {\n\t\tif (a.id < b.id) return -1;\n\t\treturn a.id > b.id ? 1 : 0;\n\t};\n\toptional.sort((a, b) => b.density - a.density || byId(a.item, b.item));\n\n\tfor (const { item } of optional) {\n\t\tif (tokensUsed + item.tokenCost > budget) continue;\n\t\tselected.push(item.id);\n\t\ttokensUsed += item.tokenCost;\n\t\tutility += item.utility;\n\t}\n\n\treturn { status: \"packed\", selected, tokensUsed, utility };\n}\n"]}

package/dist/metacognition/observation-validity.js

@@ -0,0 +1,118 @@
+/**
+ * Observation validity and state packing (Jev audit algorithm A2, finding F10).
+ *
+ * F10: the value the existing code calls `freshness` is really a change
+ * indicator. Those are different facts — a screen observed one millisecond ago
+ * that has not changed scores zero on one and one on the other — so this module
+ * reports them separately and never derives one from the other.
+ *
+ * For anything risky the decay score is not the gate at all. An explicit
+ * maximum observation age and equality of the document and action generations
+ * decide validity; the decay value is a continuous signal for ranking, not a
+ * learned safety probability.
+ *
+ * "Check then click" is not a database transaction: the page keeps running.
+ * Re-checking the target narrows the race window, and the postcondition is what
+ * actually establishes the result.
+ */
+import { ensure } from "./validation.js";
+/** f = exp(−Δt/τ). A ranking signal, not a probability of safety. */
+export function timeDecayFreshness(elapsedMs, decayConstantMs) {
+    ensure(typeof elapsedMs === "number" && Number.isFinite(elapsedMs) && elapsedMs >= 0, "elapsedMs must be a nonnegative finite number");
+    ensure(typeof decayConstantMs === "number" && Number.isFinite(decayConstantMs) && decayConstantMs > 0, "decayConstantMs must be positive");
+    return Math.exp(-elapsedMs / decayConstantMs);
+}
+/** n = 1[h(x_t) ≠ h(x_{t−1})]. Orthogonal to age. */
+export function changeIndicator(previousStateHash, currentStateHash) {
+    if (previousStateHash === undefined || currentStateHash === undefined)
+        return 0;
+    return previousStateHash === currentStateHash ? 0 : 1;
+}
+/**
+ * Decide whether an observation may still back a dispatch.
+ *
+ * Generation mismatches are reported before age: if the page navigated, saying
+ * "observation too old" sends the operator to tune a timeout instead of looking
+ * at the navigation that actually invalidated the target.
+ */
+export function evaluateObservationValidity(input) {
+    for (const [label, value] of [
+        ["observedAtMs", input.observedAtMs],
+        ["dispatchAtMs", input.dispatchAtMs],
+        ["maxObservationAgeMs", input.maxObservationAgeMs],
+    ]) {
+        ensure(typeof value === "number" && Number.isFinite(value) && value >= 0, `${label} must be nonnegative`);
+    }
+    const ageMs = input.dispatchAtMs - input.observedAtMs;
+    ensure(ageMs >= 0, "dispatchAtMs must not precede observedAtMs on a monotonic clock");
+    if (input.observedDocumentGeneration !== input.currentDocumentGeneration) {
+        return { valid: false, reason: "document-generation-changed" };
+    }
+    if (input.observedActionGeneration !== input.currentActionGeneration) {
+        return { valid: false, reason: "action-generation-changed" };
+    }
+    if (ageMs > input.maxObservationAgeMs)
+        return { valid: false, reason: "max-age-exceeded" };
+    return {
+        valid: true,
+        freshness: timeDecayFreshness(ageMs, input.decayConstantMs),
+        changed: changeIndicator(input.previousStateHash, input.currentStateHash),
+        ageMs,
+    };
+}
+/**
+ * Pack observation state under a token budget.
+ *
+ * Required evidence is pinned first. When it alone exceeds the budget the
+ * result is `incomplete-state`, never a quietly truncated view: the caller has
+ * to narrow the observation rather than act on a state that lost its evidence.
+ *
+ * Optional items are then taken by utility density. That is the fixed-rule
+ * starting point the design asks for, not an optimal knapsack solution, and it
+ * is not claimed to be one.
+ */
+export function packState(items, budget) {
+    ensure(Array.isArray(items), "items must be an array");
+    ensure(Number.isFinite(budget) && budget >= 0, "budget must be nonnegative");
+    for (const item of items) {
+        ensure(typeof item.id === "string" && item.id.length > 0, "each item needs a non-empty id");
+        ensure(Number.isFinite(item.tokenCost) && item.tokenCost >= 0, "tokenCost must be nonnegative");
+        ensure(Number.isFinite(item.utility) && item.utility >= 0, "utility must be nonnegative");
+    }
+    const required = [];
+    const optional = [];
+    for (const item of items) {
+        if (item.required)
+            required.push(item);
+        else
+            optional.push({ item, density: item.tokenCost === 0 ? Infinity : item.utility / item.tokenCost });
+    }
+    const requiredTokens = required.reduce((sum, item) => sum + item.tokenCost, 0);
+    if (requiredTokens > budget) {
+        return {
+            status: "incomplete-state",
+            missingRequired: required.map((item) => item.id),
+            requiredTokens,
+            budget,
+        };
+    }
+    const selected = required.map((item) => item.id);
+    let tokensUsed = requiredTokens;
+    let utility = required.reduce((sum, item) => sum + item.utility, 0);
+    // Density order, with id as a tiebreak so equal densities pack deterministically.
+    const byId = (a, b) => {
+        if (a.id < b.id)
+            return -1;
+        return a.id > b.id ? 1 : 0;
+    };
+    optional.sort((a, b) => b.density - a.density || byId(a.item, b.item));
+    for (const { item } of optional) {
+        if (tokensUsed + item.tokenCost > budget)
+            continue;
+        selected.push(item.id);
+        tokensUsed += item.tokenCost;
+        utility += item.utility;
+    }
+    return { status: "packed", selected, tokensUsed, utility };
+}
+//# sourceMappingURL=observation-validity.js.map

package/dist/metacognition/observation-validity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"observation-validity.js","sourceRoot":"","sources":["../../src/metacognition/observation-validity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEzC,yEAAqE;AACrE,MAAM,UAAU,kBAAkB,CAAC,SAAiB,EAAE,eAAuB,EAAU;IACtF,MAAM,CACL,OAAO,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,IAAI,CAAC,EAC7E,+CAA+C,CAC/C,CAAC;IACF,MAAM,CACL,OAAO,eAAe,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,eAAe,GAAG,CAAC,EAC9F,kCAAkC,CAClC,CAAC;IACF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,eAAe,CAAC,CAAC;AAAA,CAC9C;AAED,yDAAqD;AACrD,MAAM,UAAU,eAAe,CAAC,iBAAqC,EAAE,gBAAoC,EAAS;IACnH,IAAI,iBAAiB,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAChF,OAAO,iBAAiB,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,CACtD;AAyBD;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CAAC,KAA+B,EAA8B;IACxG,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI;QAC5B,CAAC,cAAc,EAAE,KAAK,CAAC,YAAY,CAAC;QACpC,CAAC,cAAc,EAAE,KAAK,CAAC,YAAY,CAAC;QACpC,CAAC,qBAAqB,EAAE,KAAK,CAAC,mBAAmB,CAAC;KACzC,EAAE,CAAC;QACZ,MAAM,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG,KAAK,sBAAsB,CAAC,CAAC;IAC3G,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACtD,MAAM,CAAC,KAAK,IAAI,CAAC,EAAE,iEAAiE,CAAC,CAAC;IAEtF,IAAI,KAAK,CAAC,0BAA0B,KAAK,KAAK,CAAC,yBAAyB,EAAE,CAAC;QAC1E,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC;IAChE,CAAC;IACD,IAAI,KAAK,CAAC,wBAAwB,KAAK,KAAK,CAAC,uBAAuB,EAAE,CAAC;QACtE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,2BAA2B,EAAE,CAAC;IAC9D,CAAC;IACD,IAAI,KAAK,GAAG,KAAK,CAAC,mBAAmB;QAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC;IAE3F,OAAO;QACN,KAAK,EAAE,IAAI;QACX,SAAS,EAAE,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC;QAC3D,OAAO,EAAE,eAAe,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,gBAAgB,CAAC;QACzE,KAAK;KACL,CAAC;AAAA,CACF;AAuBD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,KAA2B,EAAE,MAAc,EAAsB;IAC1F,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,wBAAwB,CAAC,CAAC;IACvD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,4BAA4B,CAAC,CAAC;IAC7E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,CAAC,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,gCAAgC,CAAC,CAAC;QAC5F,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,+BAA+B,CAAC,CAAC;QAChG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,EAAE,6BAA6B,CAAC,CAAC;IAC3F,CAAC;IAED,MAAM,QAAQ,GAAgB,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAgD,EAAE,CAAC;IACjE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACxG,CAAC;IACD,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC/E,IAAI,cAAc,GAAG,MAAM,EAAE,CAAC;QAC7B,OAAO;YACN,MAAM,EAAE,kBAAkB;YAC1B,eAAe,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,cAAc;YACd,MAAM;SACN,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,IAAI,UAAU,GAAG,cAAc,CAAC;IAChC,IAAI,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAEpE,kFAAkF;IAClF,MAAM,IAAI,GAAG,CAAC,CAAY,EAAE,CAAY,EAAU,EAAE,CAAC;QACpD,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC;QAC3B,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAAA,CAC3B,CAAC;IACF,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEvE,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,EAAE,CAAC;QACjC,IAAI,UAAU,GAAG,IAAI,CAAC,SAAS,GAAG,MAAM;YAAE,SAAS;QACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvB,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC;QAC7B,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;IACzB,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAAA,CAC3D","sourcesContent":["/**\n * Observation validity and state packing (Jev audit algorithm A2, finding F10).\n *\n * F10: the value the existing code calls `freshness` is really a change\n * indicator. Those are different facts — a screen observed one millisecond ago\n * that has not changed scores zero on one and one on the other — so this module\n * reports them separately and never derives one from the other.\n *\n * For anything risky the decay score is not the gate at all. An explicit\n * maximum observation age and equality of the document and action generations\n * decide validity; the decay value is a continuous signal for ranking, not a\n * learned safety probability.\n *\n * \"Check then click\" is not a database transaction: the page keeps running.\n * Re-checking the target narrows the race window, and the postcondition is what\n * actually establishes the result.\n */\n\nimport { ensure } from \"./validation.ts\";\n\n/** f = exp(−Δt/τ). A ranking signal, not a probability of safety. */\nexport function timeDecayFreshness(elapsedMs: number, decayConstantMs: number): number {\n\tensure(\n\t\ttypeof elapsedMs === \"number\" && Number.isFinite(elapsedMs) && elapsedMs >= 0,\n\t\t\"elapsedMs must be a nonnegative finite number\",\n\t);\n\tensure(\n\t\ttypeof decayConstantMs === \"number\" && Number.isFinite(decayConstantMs) && decayConstantMs > 0,\n\t\t\"decayConstantMs must be positive\",\n\t);\n\treturn Math.exp(-elapsedMs / decayConstantMs);\n}\n\n/** n = 1[h(x_t) ≠ h(x_{t−1})]. Orthogonal to age. */\nexport function changeIndicator(previousStateHash: string | undefined, currentStateHash: string | undefined): 0 | 1 {\n\tif (previousStateHash === undefined || currentStateHash === undefined) return 0;\n\treturn previousStateHash === currentStateHash ? 0 : 1;\n}\n\nexport interface ObservationValidityInput {\n\treadonly observedAtMs: number;\n\treadonly dispatchAtMs: number;\n\treadonly decayConstantMs: number;\n\t/** Hard bound for this risk tier; outranks any decay score. */\n\treadonly maxObservationAgeMs: number;\n\t/** Navigation, frame swap, tab swap, permission-session change. */\n\treadonly observedDocumentGeneration: number;\n\treadonly currentDocumentGeneration: number;\n\t/** Chosen element's attachment, role, name, arguments, enabled state. */\n\treadonly observedActionGeneration: number;\n\treadonly currentActionGeneration: number;\n\treadonly previousStateHash?: string;\n\treadonly currentStateHash?: string;\n}\n\nexport type ObservationValidityVerdict =\n\t| { readonly valid: true; readonly freshness: number; readonly changed: 0 | 1; readonly ageMs: number }\n\t| {\n\t\t\treadonly valid: false;\n\t\t\treadonly reason: \"document-generation-changed\" | \"action-generation-changed\" | \"max-age-exceeded\";\n\t  };\n\n/**\n * Decide whether an observation may still back a dispatch.\n *\n * Generation mismatches are reported before age: if the page navigated, saying\n * \"observation too old\" sends the operator to tune a timeout instead of looking\n * at the navigation that actually invalidated the target.\n */\nexport function evaluateObservationValidity(input: ObservationValidityInput): ObservationValidityVerdict {\n\tfor (const [label, value] of [\n\t\t[\"observedAtMs\", input.observedAtMs],\n\t\t[\"dispatchAtMs\", input.dispatchAtMs],\n\t\t[\"maxObservationAgeMs\", input.maxObservationAgeMs],\n\t] as const) {\n\t\tensure(typeof value === \"number\" && Number.isFinite(value) && value >= 0, `${label} must be nonnegative`);\n\t}\n\tconst ageMs = input.dispatchAtMs - input.observedAtMs;\n\tensure(ageMs >= 0, \"dispatchAtMs must not precede observedAtMs on a monotonic clock\");\n\n\tif (input.observedDocumentGeneration !== input.currentDocumentGeneration) {\n\t\treturn { valid: false, reason: \"document-generation-changed\" };\n\t}\n\tif (input.observedActionGeneration !== input.currentActionGeneration) {\n\t\treturn { valid: false, reason: \"action-generation-changed\" };\n\t}\n\tif (ageMs > input.maxObservationAgeMs) return { valid: false, reason: \"max-age-exceeded\" };\n\n\treturn {\n\t\tvalid: true,\n\t\tfreshness: timeDecayFreshness(ageMs, input.decayConstantMs),\n\t\tchanged: changeIndicator(input.previousStateHash, input.currentStateHash),\n\t\tageMs,\n\t};\n}\n\nexport interface StateItem {\n\treadonly id: string;\n\treadonly tokenCost: number;\n\treadonly utility: number;\n\treadonly required: boolean;\n}\n\nexport type StatePackingResult =\n\t| {\n\t\t\treadonly status: \"packed\";\n\t\t\treadonly selected: readonly string[];\n\t\t\treadonly tokensUsed: number;\n\t\t\treadonly utility: number;\n\t  }\n\t| {\n\t\t\treadonly status: \"incomplete-state\";\n\t\t\treadonly missingRequired: readonly string[];\n\t\t\treadonly requiredTokens: number;\n\t\t\treadonly budget: number;\n\t  };\n\n/**\n * Pack observation state under a token budget.\n *\n * Required evidence is pinned first. When it alone exceeds the budget the\n * result is `incomplete-state`, never a quietly truncated view: the caller has\n * to narrow the observation rather than act on a state that lost its evidence.\n *\n * Optional items are then taken by utility density. That is the fixed-rule\n * starting point the design asks for, not an optimal knapsack solution, and it\n * is not claimed to be one.\n */\nexport function packState(items: readonly StateItem[], budget: number): StatePackingResult {\n\tensure(Array.isArray(items), \"items must be an array\");\n\tensure(Number.isFinite(budget) && budget >= 0, \"budget must be nonnegative\");\n\tfor (const item of items) {\n\t\tensure(typeof item.id === \"string\" && item.id.length > 0, \"each item needs a non-empty id\");\n\t\tensure(Number.isFinite(item.tokenCost) && item.tokenCost >= 0, \"tokenCost must be nonnegative\");\n\t\tensure(Number.isFinite(item.utility) && item.utility >= 0, \"utility must be nonnegative\");\n\t}\n\n\tconst required: StateItem[] = [];\n\tconst optional: Array<{ item: StateItem; density: number }> = [];\n\tfor (const item of items) {\n\t\tif (item.required) required.push(item);\n\t\telse optional.push({ item, density: item.tokenCost === 0 ? Infinity : item.utility / item.tokenCost });\n\t}\n\tconst requiredTokens = required.reduce((sum, item) => sum + item.tokenCost, 0);\n\tif (requiredTokens > budget) {\n\t\treturn {\n\t\t\tstatus: \"incomplete-state\",\n\t\t\tmissingRequired: required.map((item) => item.id),\n\t\t\trequiredTokens,\n\t\t\tbudget,\n\t\t};\n\t}\n\n\tconst selected = required.map((item) => item.id);\n\tlet tokensUsed = requiredTokens;\n\tlet utility = required.reduce((sum, item) => sum + item.utility, 0);\n\n\t// Density order, with id as a tiebreak so equal densities pack deterministically.\n\tconst byId = (a: StateItem, b: StateItem): number => {\n\t\tif (a.id < b.id) return -1;\n\t\treturn a.id > b.id ? 1 : 0;\n\t};\n\toptional.sort((a, b) => b.density - a.density || byId(a.item, b.item));\n\n\tfor (const { item } of optional) {\n\t\tif (tokensUsed + item.tokenCost > budget) continue;\n\t\tselected.push(item.id);\n\t\ttokensUsed += item.tokenCost;\n\t\tutility += item.utility;\n\t}\n\n\treturn { status: \"packed\", selected, tokensUsed, utility };\n}\n"]}

package/dist/metacognition/observe.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Observation mode — §13 "기존 완료 판정 호출부: 메타상태를 진단으로 첨부,
+ * 최종 승인·검증 영수증은 기존 권위에 둠."
+ *
+ * Produces a serializable diagnostic snapshot for the host to attach at a
+ * completion/verification boundary. It never mutates the run, never issues a
+ * receipt, and never changes `verified` — it only reports what the
+ * metacognition state saw at that checkpoint.
+ */
+import { type CheckpointResult } from "./checkpoint.ts";
+import type { ActionConstraints, MetaAction } from "./policy.ts";
+import type { MetaState } from "./state.ts";
+export interface MetaDiagnostic {
+    readonly schema: "omk.metacognition.diagnostic.v1";
+    readonly taskId: string;
+    readonly stageId: string;
+    readonly stateFingerprint: string;
+    readonly finishKind: "continue" | "verified-completion" | "inconclusive";
+    readonly finishReason?: string;
+    readonly proposedAction: MetaActionKindLabel;
+    readonly openRequiredObligations: number;
+    readonly violatedObligations: number;
+    readonly blockedHighRiskCandidates: number;
+    readonly unresolvedMismatches: number;
+    readonly verifierBlindSpots: number;
+    readonly runnerHealth: MetaState["verifier"]["runnerHealth"];
+    readonly calibrationDemoted: number;
+    readonly checkpointCount: number;
+}
+type MetaActionKindLabel = MetaAction["kind"];
+/** Observation-mode diagnostic. Read-only over MetaState — no side effects. */
+export declare function attachMetaDiagnostics(state: MetaState, constraints: ActionConstraints, nowMs: number): MetaDiagnostic;
+/** Project a checkpoint result into the diagnostic record. */
+export declare function toDiagnostic(state: MetaState, result: CheckpointResult): MetaDiagnostic;
+/**
+ * Run one observation-mode checkpoint through the bridge: returns the kernel
+ * report plus the diagnostic to attach. The host keeps its own completion
+ * verdict; this only advises.
+ */
+export declare function observeCheckpoint(state: MetaState, constraints: ActionConstraints, nowMs: number): {
+    readonly result: CheckpointResult;
+    readonly diagnostic: MetaDiagnostic;
+};
+export {};
+//# sourceMappingURL=observe.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"observe.d.ts","sourceRoot":"","sources":["../../src/metacognition/observe.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,KAAK,gBAAgB,EAAc,MAAM,iBAAiB,CAAC;AACpE,OAAO,KAAK,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEjE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAI5C,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,qBAAqB,GAAG,cAAc,CAAC;IACzE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,cAAc,EAAE,mBAAmB,CAAC;IAC7C,QAAQ,CAAC,uBAAuB,EAAE,MAAM,CAAC;IACzC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;IACrC,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAC3C,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,YAAY,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,CAAC;IAC7D,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;CACjC;AACD,KAAK,mBAAmB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;AAE9C,iFAA+E;AAC/E,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,iBAAiB,EAAE,KAAK,EAAE,MAAM,GAAG,cAAc,CAIrH;AAED,8DAA8D;AAC9D,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,GAAG,cAAc,CAiCvF;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAChC,KAAK,EAAE,SAAS,EAChB,WAAW,EAAE,iBAAiB,EAC9B,KAAK,EAAE,MAAM,GACX;IAAE,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAA;CAAE,CAG5E","sourcesContent":["/**\n * Observation mode — §13 \"기존 완료 판정 호출부: 메타상태를 진단으로 첨부,\n * 최종 승인·검증 영수증은 기존 권위에 둠.\"\n *\n * Produces a serializable diagnostic snapshot for the host to attach at a\n * completion/verification boundary. It never mutates the run, never issues a\n * receipt, and never changes `verified` — it only reports what the\n * metacognition state saw at that checkpoint.\n */\nimport { type CheckpointResult, checkpoint } from \"./checkpoint.ts\";\nimport type { ActionConstraints, MetaAction } from \"./policy.ts\";\nimport { mismatchSummary } from \"./predictions.ts\";\nimport type { MetaState } from \"./state.ts\";\nimport { stateFingerprint } from \"./state.ts\";\nimport { integer } from \"./validation.ts\";\n\nexport interface MetaDiagnostic {\n\treadonly schema: \"omk.metacognition.diagnostic.v1\";\n\treadonly taskId: string;\n\treadonly stageId: string;\n\treadonly stateFingerprint: string;\n\treadonly finishKind: \"continue\" | \"verified-completion\" | \"inconclusive\";\n\treadonly finishReason?: string;\n\treadonly proposedAction: MetaActionKindLabel;\n\treadonly openRequiredObligations: number;\n\treadonly violatedObligations: number;\n\treadonly blockedHighRiskCandidates: number;\n\treadonly unresolvedMismatches: number;\n\treadonly verifierBlindSpots: number;\n\treadonly runnerHealth: MetaState[\"verifier\"][\"runnerHealth\"];\n\treadonly calibrationDemoted: number;\n\treadonly checkpointCount: number;\n}\ntype MetaActionKindLabel = MetaAction[\"kind\"];\n\n/** Observation-mode diagnostic. Read-only over MetaState — no side effects. */\nexport function attachMetaDiagnostics(state: MetaState, constraints: ActionConstraints, nowMs: number): MetaDiagnostic {\n\tinteger(nowMs, \"nowMs\");\n\tconst result = checkpoint({ state, nowMs, constraints });\n\treturn toDiagnostic(state, result);\n}\n\n/** Project a checkpoint result into the diagnostic record. */\nexport function toDiagnostic(state: MetaState, result: CheckpointResult): MetaDiagnostic {\n\tconst mismatches = mismatchSummary(state.predictions);\n\tconst blindSpots = state.verifier.evaluations.reduce(\n\t\t(n, e) => n + e.blindSpots.length + (e.detectionRate === \"unknown\" ? 1 : 0),\n\t\t0,\n\t);\n\tconst demoted = Object.values(state.calibration.buckets).filter((b) => b.state === \"demoted\").length;\n\treturn {\n\t\tschema: \"omk.metacognition.diagnostic.v1\",\n\t\ttaskId: state.goal.taskId,\n\t\tstageId: state.goal.stageId,\n\t\tstateFingerprint: stateFingerprint(state),\n\t\tfinishKind: result.finish.kind,\n\t\tfinishReason:\n\t\t\tresult.finish.kind === \"inconclusive\"\n\t\t\t\t? result.finish.reason\n\t\t\t\t: result.finish.kind === \"verified-completion\"\n\t\t\t\t\t? result.finish.receiptId\n\t\t\t\t\t: undefined,\n\t\tproposedAction: result.action.kind,\n\t\topenRequiredObligations: state.obligations.filter((o) => o.status === \"required\").length,\n\t\tviolatedObligations: state.obligations.filter((o) => o.status === \"violated\").length,\n\t\tblockedHighRiskCandidates: state.obligations.filter((o) => o.status === \"blocked-high-risk\").length,\n\t\tunresolvedMismatches:\n\t\t\tmismatches.byKind[\"unexpected-fail\"] +\n\t\t\tmismatches.byKind[\"unexpected-side-effect\"] +\n\t\t\tmismatches.byKind[\"scope-mismatch\"] +\n\t\t\tmismatches.byKind[\"missing-observation\"],\n\t\tverifierBlindSpots: blindSpots,\n\t\trunnerHealth: state.verifier.runnerHealth,\n\t\tcalibrationDemoted: demoted,\n\t\tcheckpointCount: result.state.checkpointCount,\n\t};\n}\n\n/**\n * Run one observation-mode checkpoint through the bridge: returns the kernel\n * report plus the diagnostic to attach. The host keeps its own completion\n * verdict; this only advises.\n */\nexport function observeCheckpoint(\n\tstate: MetaState,\n\tconstraints: ActionConstraints,\n\tnowMs: number,\n): { readonly result: CheckpointResult; readonly diagnostic: MetaDiagnostic } {\n\tconst result = checkpoint({ state, nowMs, constraints });\n\treturn { result, diagnostic: toDiagnostic(state, result) };\n}\n"]}

package/dist/metacognition/observe.js

@@ -0,0 +1,59 @@
+/**
+ * Observation mode — §13 "기존 완료 판정 호출부: 메타상태를 진단으로 첨부,
+ * 최종 승인·검증 영수증은 기존 권위에 둠."
+ *
+ * Produces a serializable diagnostic snapshot for the host to attach at a
+ * completion/verification boundary. It never mutates the run, never issues a
+ * receipt, and never changes `verified` — it only reports what the
+ * metacognition state saw at that checkpoint.
+ */
+import { checkpoint } from "./checkpoint.js";
+import { mismatchSummary } from "./predictions.js";
+import { stateFingerprint } from "./state.js";
+import { integer } from "./validation.js";
+/** Observation-mode diagnostic. Read-only over MetaState — no side effects. */
+export function attachMetaDiagnostics(state, constraints, nowMs) {
+    integer(nowMs, "nowMs");
+    const result = checkpoint({ state, nowMs, constraints });
+    return toDiagnostic(state, result);
+}
+/** Project a checkpoint result into the diagnostic record. */
+export function toDiagnostic(state, result) {
+    const mismatches = mismatchSummary(state.predictions);
+    const blindSpots = state.verifier.evaluations.reduce((n, e) => n + e.blindSpots.length + (e.detectionRate === "unknown" ? 1 : 0), 0);
+    const demoted = Object.values(state.calibration.buckets).filter((b) => b.state === "demoted").length;
+    return {
+        schema: "omk.metacognition.diagnostic.v1",
+        taskId: state.goal.taskId,
+        stageId: state.goal.stageId,
+        stateFingerprint: stateFingerprint(state),
+        finishKind: result.finish.kind,
+        finishReason: result.finish.kind === "inconclusive"
+            ? result.finish.reason
+            : result.finish.kind === "verified-completion"
+                ? result.finish.receiptId
+                : undefined,
+        proposedAction: result.action.kind,
+        openRequiredObligations: state.obligations.filter((o) => o.status === "required").length,
+        violatedObligations: state.obligations.filter((o) => o.status === "violated").length,
+        blockedHighRiskCandidates: state.obligations.filter((o) => o.status === "blocked-high-risk").length,
+        unresolvedMismatches: mismatches.byKind["unexpected-fail"] +
+            mismatches.byKind["unexpected-side-effect"] +
+            mismatches.byKind["scope-mismatch"] +
+            mismatches.byKind["missing-observation"],
+        verifierBlindSpots: blindSpots,
+        runnerHealth: state.verifier.runnerHealth,
+        calibrationDemoted: demoted,
+        checkpointCount: result.state.checkpointCount,
+    };
+}
+/**
+ * Run one observation-mode checkpoint through the bridge: returns the kernel
+ * report plus the diagnostic to attach. The host keeps its own completion
+ * verdict; this only advises.
+ */
+export function observeCheckpoint(state, constraints, nowMs) {
+    const result = checkpoint({ state, nowMs, constraints });
+    return { result, diagnostic: toDiagnostic(state, result) };
+}
+//# sourceMappingURL=observe.js.map

package/dist/metacognition/observe.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"observe.js","sourceRoot":"","sources":["../../src/metacognition/observe.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAyB,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAEpE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAqB1C,iFAA+E;AAC/E,MAAM,UAAU,qBAAqB,CAAC,KAAgB,EAAE,WAA8B,EAAE,KAAa,EAAkB;IACtH,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACzD,OAAO,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAAA,CACnC;AAED,8DAA8D;AAC9D,MAAM,UAAU,YAAY,CAAC,KAAgB,EAAE,MAAwB,EAAkB;IACxF,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CACnD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC3E,CAAC,CACD,CAAC;IACF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IACrG,OAAO;QACN,MAAM,EAAE,iCAAiC;QACzC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM;QACzB,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO;QAC3B,gBAAgB,EAAE,gBAAgB,CAAC,KAAK,CAAC;QACzC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;QAC9B,YAAY,EACX,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,cAAc;YACpC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM;YACtB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,qBAAqB;gBAC7C,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS;gBACzB,CAAC,CAAC,SAAS;QACd,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;QAClC,uBAAuB,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM;QACxF,mBAAmB,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM;QACpF,yBAAyB,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,mBAAmB,CAAC,CAAC,MAAM;QACnG,oBAAoB,EACnB,UAAU,CAAC,MAAM,CAAC,iBAAiB,CAAC;YACpC,UAAU,CAAC,MAAM,CAAC,wBAAwB,CAAC;YAC3C,UAAU,CAAC,MAAM,CAAC,gBAAgB,CAAC;YACnC,UAAU,CAAC,MAAM,CAAC,qBAAqB,CAAC;QACzC,kBAAkB,EAAE,UAAU;QAC9B,YAAY,EAAE,KAAK,CAAC,QAAQ,CAAC,YAAY;QACzC,kBAAkB,EAAE,OAAO;QAC3B,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,eAAe;KAC7C,CAAC;AAAA,CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAChC,KAAgB,EAChB,WAA8B,EAC9B,KAAa,EACgE;IAC7E,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACzD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;AAAA,CAC3D","sourcesContent":["/**\n * Observation mode — §13 \"기존 완료 판정 호출부: 메타상태를 진단으로 첨부,\n * 최종 승인·검증 영수증은 기존 권위에 둠.\"\n *\n * Produces a serializable diagnostic snapshot for the host to attach at a\n * completion/verification boundary. It never mutates the run, never issues a\n * receipt, and never changes `verified` — it only reports what the\n * metacognition state saw at that checkpoint.\n */\nimport { type CheckpointResult, checkpoint } from \"./checkpoint.ts\";\nimport type { ActionConstraints, MetaAction } from \"./policy.ts\";\nimport { mismatchSummary } from \"./predictions.ts\";\nimport type { MetaState } from \"./state.ts\";\nimport { stateFingerprint } from \"./state.ts\";\nimport { integer } from \"./validation.ts\";\n\nexport interface MetaDiagnostic {\n\treadonly schema: \"omk.metacognition.diagnostic.v1\";\n\treadonly taskId: string;\n\treadonly stageId: string;\n\treadonly stateFingerprint: string;\n\treadonly finishKind: \"continue\" | \"verified-completion\" | \"inconclusive\";\n\treadonly finishReason?: string;\n\treadonly proposedAction: MetaActionKindLabel;\n\treadonly openRequiredObligations: number;\n\treadonly violatedObligations: number;\n\treadonly blockedHighRiskCandidates: number;\n\treadonly unresolvedMismatches: number;\n\treadonly verifierBlindSpots: number;\n\treadonly runnerHealth: MetaState[\"verifier\"][\"runnerHealth\"];\n\treadonly calibrationDemoted: number;\n\treadonly checkpointCount: number;\n}\ntype MetaActionKindLabel = MetaAction[\"kind\"];\n\n/** Observation-mode diagnostic. Read-only over MetaState — no side effects. */\nexport function attachMetaDiagnostics(state: MetaState, constraints: ActionConstraints, nowMs: number): MetaDiagnostic {\n\tinteger(nowMs, \"nowMs\");\n\tconst result = checkpoint({ state, nowMs, constraints });\n\treturn toDiagnostic(state, result);\n}\n\n/** Project a checkpoint result into the diagnostic record. */\nexport function toDiagnostic(state: MetaState, result: CheckpointResult): MetaDiagnostic {\n\tconst mismatches = mismatchSummary(state.predictions);\n\tconst blindSpots = state.verifier.evaluations.reduce(\n\t\t(n, e) => n + e.blindSpots.length + (e.detectionRate === \"unknown\" ? 1 : 0),\n\t\t0,\n\t);\n\tconst demoted = Object.values(state.calibration.buckets).filter((b) => b.state === \"demoted\").length;\n\treturn {\n\t\tschema: \"omk.metacognition.diagnostic.v1\",\n\t\ttaskId: state.goal.taskId,\n\t\tstageId: state.goal.stageId,\n\t\tstateFingerprint: stateFingerprint(state),\n\t\tfinishKind: result.finish.kind,\n\t\tfinishReason:\n\t\t\tresult.finish.kind === \"inconclusive\"\n\t\t\t\t? result.finish.reason\n\t\t\t\t: result.finish.kind === \"verified-completion\"\n\t\t\t\t\t? result.finish.receiptId\n\t\t\t\t\t: undefined,\n\t\tproposedAction: result.action.kind,\n\t\topenRequiredObligations: state.obligations.filter((o) => o.status === \"required\").length,\n\t\tviolatedObligations: state.obligations.filter((o) => o.status === \"violated\").length,\n\t\tblockedHighRiskCandidates: state.obligations.filter((o) => o.status === \"blocked-high-risk\").length,\n\t\tunresolvedMismatches:\n\t\t\tmismatches.byKind[\"unexpected-fail\"] +\n\t\t\tmismatches.byKind[\"unexpected-side-effect\"] +\n\t\t\tmismatches.byKind[\"scope-mismatch\"] +\n\t\t\tmismatches.byKind[\"missing-observation\"],\n\t\tverifierBlindSpots: blindSpots,\n\t\trunnerHealth: state.verifier.runnerHealth,\n\t\tcalibrationDemoted: demoted,\n\t\tcheckpointCount: result.state.checkpointCount,\n\t};\n}\n\n/**\n * Run one observation-mode checkpoint through the bridge: returns the kernel\n * report plus the diagnostic to attach. The host keeps its own completion\n * verdict; this only advises.\n */\nexport function observeCheckpoint(\n\tstate: MetaState,\n\tconstraints: ActionConstraints,\n\tnowMs: number,\n): { readonly result: CheckpointResult; readonly diagnostic: MetaDiagnostic } {\n\tconst result = checkpoint({ state, nowMs, constraints });\n\treturn { result, diagnostic: toDiagnostic(state, result) };\n}\n"]}

package/dist/metacognition/policy.d.ts

@@ -0,0 +1,53 @@
+import type { MetaState } from "./state.ts";
+export type MetaActionKind = "inspect_local" | "retrieve_reference" | "run_discriminating_probe" | "strengthen_verifier" | "reselect_skills" | "revise_implementation" | "switch_strategy" | "request_required_decision" | "continue_object_work" | "finish_with_bound_receipt" | "stop_inconclusive" | "settle_safety" | "form_obligations";
+export interface MetaAction {
+    readonly kind: MetaActionKind;
+    readonly obligationId?: string;
+    readonly hypothesisId?: string;
+    readonly reason: string;
+    readonly priority: number;
+}
+export interface ActionConstraints {
+    readonly authorizedActions: readonly MetaActionKind[];
+    readonly prerequisites: Partial<Readonly<Record<MetaActionKind, readonly string[]>>>;
+    readonly actionCostsMs: Partial<Readonly<Record<MetaActionKind, number>>>;
+    readonly actionCostsRequests: Partial<Readonly<Record<MetaActionKind, number>>>;
+    readonly inScopeKinds: readonly MetaActionKind[];
+}
+/** §9.2: Authorized ∧ Prerequisites ∧ BudgetFits ∧ ScopeBound. */
+export declare function feasibleActions(state: MetaState, constraints: ActionConstraints): MetaActionKind[];
+/**
+ * §14 priority table — the baseline deterministic policy. Safety first, then
+ * required decisions, host-observed obligations, verifier health, prediction
+ * mismatches, verifier blind spots, stagnation, optional positive-VOI work,
+ * object work, then finish.
+ */
+export declare function selectAction(state: MetaState, constraints: ActionConstraints, options?: {
+    readonly receipt?: {
+        receiptId: string;
+        candidateHash: string;
+        scope: string;
+    } | null;
+    readonly maxRepetitions?: number;
+    readonly switchCost?: number;
+    readonly estimatedSwitchGain?: number;
+    readonly voiCandidates?: readonly {
+        kind: MetaActionKind;
+        voi: number;
+    }[];
+    readonly progress?: {
+        goalScope: string;
+        candidateFamily: string;
+        errorClass: string;
+        approach: string;
+        checkMethod: string;
+        sourceFamily: string;
+    };
+}): MetaAction;
+/**
+ * §6.2/§6.5 VOI evaluation for one observation action. Returns the finite
+ * computation result; the caller supplies real priors and likelihoods and may
+ * include approved 2-step bundles whose joint value is computed the same way.
+ */
+export declare function valueOfObservation(prior: readonly number[], losses: readonly (readonly number[])[], likelihoodByHypothesis: readonly (readonly number[])[], cost: number): number;
+//# sourceMappingURL=policy.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"policy.d.ts","sourceRoot":"","sources":["../../src/metacognition/policy.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAG5C,MAAM,MAAM,cAAc,GACvB,eAAe,GACf,oBAAoB,GACpB,0BAA0B,GAC1B,qBAAqB,GACrB,iBAAiB,GACjB,uBAAuB,GACvB,iBAAiB,GACjB,2BAA2B,GAC3B,sBAAsB,GACtB,2BAA2B,GAC3B,mBAAmB,GACnB,eAAe,GACf,kBAAkB,CAAC;AAEtB,MAAM,WAAW,UAAU;IAC1B,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAC9B,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,iBAAiB;IACjC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,cAAc,EAAE,CAAC;IACtD,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IACrF,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAChF,QAAQ,CAAC,YAAY,EAAE,SAAS,cAAc,EAAE,CAAC;CACjD;AAkBD,yEAAkE;AAClE,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,iBAAiB,GAAG,cAAc,EAAE,CAclG;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAC3B,KAAK,EAAE,SAAS,EAChB,WAAW,EAAE,iBAAiB,EAC9B,OAAO,CAAC,EAAE;IACT,QAAQ,CAAC,OAAO,CAAC,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IACtF,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,aAAa,CAAC,EAAE,SAAS;QAAE,IAAI,EAAE,cAAc,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;QACxB,UAAU,EAAE,MAAM,CAAC;QACnB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,EAAE,MAAM,CAAC;KACrB,CAAC;CACF,GACC,UAAU,CAsGZ;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CACjC,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,MAAM,CAER","sourcesContent":["/**\n * Algorithm F — bounded metacontrol policy. Spec §9, §14.\n *\n * Feasibility precedes optimization: an action that is unauthorized, missing\n * prerequisites, over budget, or out of scope is absent from the feasible set\n * no matter how much information it promises. The baseline policy is the\n * explicit priority table of §14, not a score-sum that folds safety\n * constraints into a utility number.\n */\nimport { experimentValue } from \"./decision.ts\";\nimport type { MetaState } from \"./state.ts\";\nimport { isStagnant, netSwitchValue, progressKey } from \"./verifier.ts\";\n\nexport type MetaActionKind =\n\t| \"inspect_local\"\n\t| \"retrieve_reference\"\n\t| \"run_discriminating_probe\"\n\t| \"strengthen_verifier\"\n\t| \"reselect_skills\"\n\t| \"revise_implementation\"\n\t| \"switch_strategy\"\n\t| \"request_required_decision\"\n\t| \"continue_object_work\"\n\t| \"finish_with_bound_receipt\"\n\t| \"stop_inconclusive\"\n\t| \"settle_safety\"\n\t| \"form_obligations\";\n\nexport interface MetaAction {\n\treadonly kind: MetaActionKind;\n\treadonly obligationId?: string;\n\treadonly hypothesisId?: string;\n\treadonly reason: string;\n\treadonly priority: number;\n}\n\nexport interface ActionConstraints {\n\treadonly authorizedActions: readonly MetaActionKind[];\n\treadonly prerequisites: Partial<Readonly<Record<MetaActionKind, readonly string[]>>>;\n\treadonly actionCostsMs: Partial<Readonly<Record<MetaActionKind, number>>>;\n\treadonly actionCostsRequests: Partial<Readonly<Record<MetaActionKind, number>>>;\n\treadonly inScopeKinds: readonly MetaActionKind[];\n}\n\nconst ALL_KINDS: readonly MetaActionKind[] = [\n\t\"inspect_local\",\n\t\"retrieve_reference\",\n\t\"run_discriminating_probe\",\n\t\"strengthen_verifier\",\n\t\"reselect_skills\",\n\t\"revise_implementation\",\n\t\"switch_strategy\",\n\t\"request_required_decision\",\n\t\"continue_object_work\",\n\t\"finish_with_bound_receipt\",\n\t\"stop_inconclusive\",\n\t\"settle_safety\",\n\t\"form_obligations\",\n];\n\n/** §9.2: Authorized ∧ Prerequisites ∧ BudgetFits ∧ ScopeBound. */\nexport function feasibleActions(state: MetaState, constraints: ActionConstraints): MetaActionKind[] {\n\treturn ALL_KINDS.filter((kind) => {\n\t\tif (!constraints.authorizedActions.includes(kind)) return false;\n\t\tif (!constraints.inScopeKinds.includes(kind)) return false;\n\t\tfor (const prereq of constraints.prerequisites[kind] ?? []) {\n\t\t\tconst met =\n\t\t\t\tstate.obligations.some((o) => o.id === prereq && o.status === \"satisfied\") ||\n\t\t\t\tstate.predictions.some((p) => p.predictionId === prereq && p.status === \"resolved\");\n\t\t\tif (!met) return false;\n\t\t}\n\t\tconst ms = constraints.actionCostsMs[kind] ?? 0;\n\t\tconst req = constraints.actionCostsRequests[kind] ?? 0;\n\t\treturn ms <= state.budget.remainingMs && req <= state.budget.remainingRequests;\n\t});\n}\n\n/**\n * §14 priority table — the baseline deterministic policy. Safety first, then\n * required decisions, host-observed obligations, verifier health, prediction\n * mismatches, verifier blind spots, stagnation, optional positive-VOI work,\n * object work, then finish.\n */\nexport function selectAction(\n\tstate: MetaState,\n\tconstraints: ActionConstraints,\n\toptions?: {\n\t\treadonly receipt?: { receiptId: string; candidateHash: string; scope: string } | null;\n\t\treadonly maxRepetitions?: number;\n\t\treadonly switchCost?: number;\n\t\treadonly estimatedSwitchGain?: number;\n\t\treadonly voiCandidates?: readonly { kind: MetaActionKind; voi: number }[];\n\t\treadonly progress?: {\n\t\t\tgoalScope: string;\n\t\t\tcandidateFamily: string;\n\t\t\terrorClass: string;\n\t\t\tapproach: string;\n\t\t\tcheckMethod: string;\n\t\t\tsourceFamily: string;\n\t\t};\n\t},\n): MetaAction {\n\tconst feasible = new Set(feasibleActions(state, constraints));\n\tconst pick = (\n\t\tkind: MetaActionKind,\n\t\treason: string,\n\t\tpriority: number,\n\t\textra?: Partial<MetaAction>,\n\t): MetaAction | null => (feasible.has(kind) ? { kind, reason, priority, ...extra } : null);\n\n\t// 0: cancellation, authorization violation, safety constraint, binding mismatch.\n\tif (\n\t\tstate.policy.interruptionReason !== null ||\n\t\tstate.facts.candidateHash === \"\" ||\n\t\t!constraints.authorizedActions.every((a) => state.policy.authorizedActions.includes(a))\n\t) {\n\t\treturn (\n\t\t\tpick(\"settle_safety\", \"safety-or-binding\", 0) ?? {\n\t\t\t\tkind: \"stop_inconclusive\",\n\t\t\t\treason: \"unsafe-feasible-set\",\n\t\t\t\tpriority: 0,\n\t\t\t}\n\t\t);\n\t}\n\t// 1: required user decision or unknown prerequisite.\n\tconst needsDecision = state.obligations.find(\n\t\t(o) => o.status === \"blocked-high-risk\" || (o.status === \"required\" && o.checkMethodId === null && o.required),\n\t);\n\tif (needsDecision) {\n\t\tconst action = pick(\"request_required_decision\", `required-decision:${needsDecision.id}`, 1, {\n\t\t\tobligationId: needsDecision.id,\n\t\t});\n\t\tif (action) return action;\n\t}\n\t// 2: host-observed new required obligation → refresh obligations, gate the step.\n\tconst newRequired = state.obligations.find((o) => o.status === \"required\" && o.coverageFraction === 0);\n\tif (newRequired) {\n\t\tconst action = pick(\"form_obligations\", `new-required:${newRequired.id}`, 2, { obligationId: newRequired.id });\n\t\tif (action) return action;\n\t}\n\t// 3: check execution itself invalid → diagnose environment, not code.\n\tif (state.verifier.runnerHealth !== \"healthy\") {\n\t\tconst action = pick(\"inspect_local\", \"verifier-health-unverified\", 3);\n\t\tif (action) return action;\n\t}\n\t// 4: prediction mismatch or adoptable evidence conflict → discriminate causes.\n\tconst mismatch = state.predictions.find(\n\t\t(p) => p.status === \"resolved\" && p.mismatch !== undefined && p.mismatch !== \"none\",\n\t);\n\tif (mismatch && state.hypotheses.open.length > 1) {\n\t\tconst action = pick(\"run_discriminating_probe\", `mismatch:${mismatch.predictionId}`, 4, {\n\t\t\thypothesisId: state.hypotheses.open[0],\n\t\t});\n\t\tif (action) return action;\n\t}\n\t// 5: verifier blind spot on an important obligation → negative control / new check.\n\tconst blind = state.verifier.evaluations.find((e) => e.detectionRate === \"unknown\" || e.blindSpots.length > 0);\n\tif (blind) {\n\t\tconst action = pick(\"strengthen_verifier\", `blind-spot:${blind.obligationId}`, 5, {\n\t\t\tobligationId: blind.obligationId,\n\t\t});\n\t\tif (action) return action;\n\t}\n\t// 6: same strategy, no valid progress → switch with hysteresis, or stop.\n\tconst maxRep = options?.maxRepetitions ?? 3;\n\tif (options?.progress && isStagnant(options.progress, state.progressHistory, maxRep)) {\n\t\tconst switchGain = netSwitchValue(options.estimatedSwitchGain ?? 0, 0, options.switchCost ?? 0);\n\t\tif (switchGain > 0) {\n\t\t\tconst action = pick(\"switch_strategy\", `stagnant:${progressKey(options.progress)}`, 6);\n\t\t\tif (action) return action;\n\t\t}\n\t\tconst stop = pick(\"stop_inconclusive\", \"stagnant-no-progress\", 6);\n\t\tif (stop) return stop;\n\t}\n\t// 7: optional information acquisition with positive VOI.\n\tconst voi = (options?.voiCandidates ?? [])\n\t\t.filter((c) => c.voi > 0 && feasible.has(c.kind))\n\t\t.sort((a, b) => b.voi - a.voi);\n\tif (voi.length > 0) {\n\t\treturn (\n\t\t\tpick(voi[0]!.kind, `positive-voi:${voi[0]!.voi}`, 7) ?? {\n\t\t\t\tkind: \"stop_inconclusive\",\n\t\t\t\treason: \"no-feasible-voi-action\",\n\t\t\t\tpriority: 7,\n\t\t\t}\n\t\t);\n\t}\n\t// 8: premises sufficient, object work remains.\n\tconst openRequired = state.obligations.filter((o) => o.status === \"required\" || o.status === \"violated\");\n\tif (openRequired.length === 0) {\n\t\tconst action = pick(\"continue_object_work\", \"premises-satisfied\", 8);\n\t\tif (action) return action;\n\t}\n\t// 9: object work done → verified bounded completion or inconclusive stop.\n\tif (options?.receipt && openRequired.length === 0) {\n\t\tconst action = pick(\"finish_with_bound_receipt\", `receipt:${options.receipt.receiptId}`, 9);\n\t\tif (action) return action;\n\t}\n\tconst blocked =\n\t\tpick(\"revise_implementation\", `open-obligations:${openRequired.length}`, 8) ??\n\t\tpick(\"inspect_local\", \"open-obligations-inspect\", 8);\n\tif (blocked) return blocked;\n\treturn { kind: \"stop_inconclusive\", reason: \"no-feasible-action\", priority: 9 };\n}\n\n/**\n * §6.2/§6.5 VOI evaluation for one observation action. Returns the finite\n * computation result; the caller supplies real priors and likelihoods and may\n * include approved 2-step bundles whose joint value is computed the same way.\n */\nexport function valueOfObservation(\n\tprior: readonly number[],\n\tlosses: readonly (readonly number[])[],\n\tlikelihoodByHypothesis: readonly (readonly number[])[],\n\tcost: number,\n): number {\n\treturn experimentValue(prior, losses, likelihoodByHypothesis, cost).netValue;\n}\n"]}