@principles/core 1.284.17 → 1.284.18

package/dist/runtime-v2/internalization/context-resolution.js

@@ -1,317 +0,0 @@
-/**
- * Shared Information Plane — context resolution composition (design §6.4/§6.6).
- *
- * Pure logic only: no I/O, no fs, no DB, no network (Core vs Plugin boundary,
- * AGENTS.md `antipattern-core-io`).
- *
- * This module is the seam that turns three independent fact-acquisition
- * channels into ONE `available` map consumed by `resolveInjection`:
- *
- *   1. predecessor summary envelope → `summary-field-reader` (pure, Layer 1)
- *   2. ancestry content             → `CandidateLineage` nodes (Layer 2; the
- *                                     traversal/I/O is owned by the caller).
- *                                     Serves BOTH `<stage>.raw.*` and
- *                                     `<stage>.summary.*` for any ancestor.
- *   3. related references           → explicit caller-provided sources
- *                                     (e.g. the PR-A replay evidence), which
- *                                     are causal references — NOT ancestry
- *
- * Why three channels stay separate at acquisition but merge at composition
- * (design §33 / INV-LINEAGE-SCOPE): `lineageArtifactIds` expresses *content
- * ancestry*; a repair's `sourceEvaluatorTaskId` expresses *causal reference*.
- * Collapsing them into one data structure would silently redefine what
- * "lineage" means. They are unified at read time, never at write time.
- *
- * rc-1/rc-5: every source `contentJson` stays `unknown`; all reads use
- * `Object.hasOwn` + typeof/Array.isArray guards — no `as` casts.
- */
-import { readSummaryField } from './summary-field-reader.js';
-import { deriveArtifactSummary, SUMMARY_RUNNER_KINDS, } from './artifact-summary.js';
-/**
- * Split a manifest field path into namespace / layer / rest.
- * Returns null for paths that do not follow the grammar (e.g. malformed,
- * too short) so callers can skip them instead of throwing.
- */
-export function parseContextPath(fieldPath) {
-    const parts = fieldPath.split('.');
-    if (parts.length < 3)
-        return null;
-    const [namespace, layer] = parts;
-    const rest = parts.slice(2);
-    if (namespace === undefined || namespace === '')
-        return null;
-    if (layer !== 'raw' && layer !== 'summary' && layer !== 'predecessorSummary')
-        return null;
-    if (rest.length === 0 || rest.some((segment) => segment === ''))
-        return null;
-    return { namespace, layer, rest };
-}
-// ── Pure raw field reader (design §16–§18) ──────────────────────────────────
-/**
- * Keys that must never be traversed: reading them is how prototype pollution
- * enters a context map. Rejected at every segment, not just the first.
- */
-const FORBIDDEN_SEGMENTS = new Set([
-    '__proto__',
-    'constructor',
-    'prototype',
-]);
-function isRecord(value) {
-    return value !== null && typeof value === 'object' && !Array.isArray(value);
-}
-/** A dotted segment addressing an array element, e.g. `0` in `candidates.0`. */
-const ARRAY_INDEX = /^(0|[1-9][0-9]*)$/;
-/**
- * Read a dotted path out of an untrusted contentJson (rc-1/rc-5).
- *
- * Supports array element addressing via numeric segments
- * (`candidates.0.betterDecision`) because several durable artifacts nest their
- * semantic payload under an array (DreamerOutput.candidates). No I/O, no
- * lineage traversal, no manifest knowledge — it only walks a path.
- *
- * Returns undefined for: non-object intermediates, missing own properties,
- * out-of-range or non-numeric array access, and forbidden keys.
- */
-export function readRawField(rawPath, contentJson) {
-    let current = contentJson;
-    for (const segment of rawPath) {
-        if (FORBIDDEN_SEGMENTS.has(segment))
-            return undefined;
-        if (Array.isArray(current)) {
-            if (!ARRAY_INDEX.test(segment))
-                return undefined;
-            if (!Object.hasOwn(current, segment))
-                return undefined;
-            current = current[Number(segment)];
-            continue;
-        }
-        if (!isRecord(current))
-            return undefined;
-        if (!Object.hasOwn(current, segment))
-            return undefined;
-        current = current[segment];
-    }
-    return current;
-}
-// ── Channel 2: ancestry raw resolution (CandidateLineage) ───────────────────
-/**
- * A manifest NAMESPACE is a *semantic* stage; a lineage node's stage is the
- * *producer taskKind* (two-hop F1). Explicit fixed mapping — never fuzzy:
- *
- *   diagnostician → the manifest addresses the final diagnosis artifact
- *   (DiagnosticianOutputV1). Its canonical producer on the DEFAULT split
- *   pipeline is taskKind `diag_router` (SplitDiagnosticianRunner stage C);
- *   the legacy monolithic runner committed the identical output contract
- *   under taskKind `diagnostician`. Both must resolve the same namespace.
- *
- * Adding an alias here is a contract change — the resolver's nearest-match
- * then accepts the listed producer kinds for that namespace.
- */
-export const SEMANTIC_STAGE_ALIASES = {
-    diagnostician: ['diagnostician', 'diag_router'],
-};
-/**
- * Producer taskKind used for the read-time summary projection (below).
- * `diagnostician` is NOT a SummaryRunnerKind, but its output is byte-for-byte
- * the diag_router contract, so the derivation reuses the diag_router resolver.
- */
-const SUMMARY_DERIVATION_STAGE = {
-    diagnostician: 'diag_router',
-};
-/**
- * Read `<stage>.summary.<key>` from an ancestry node, with a bounded
- * read-time projection fallback.
- *
- * Why the fallback exists (review round): the writer-side envelope for diag
- * outputs is SKIPPED (`output_summary_key_collision`, base-peer-runner) —
- * DiagnosticianOutputV1 owns a top-level `summary` STRING that the Layer 0
- * envelope must not overwrite. So `diagnostician.summary.rootSymptom` /
- * `category` would be structurally absent forever. The fields are derivable
- * from the unchanged durable output via the SAME derivation the writer would
- * have used (`deriveArtifactSummary`, pure, no I/O), so the read side applies
- * it as a bounded projection. Deterministic: same output → same fields. Only
- * fires when the direct envelope read misses; still-absent → `absent` floor.
- */
-function readSummaryWithProjection(fieldPath, stage, contentJson) {
-    const direct = readSummaryField(fieldPath, contentJson);
-    if (direct !== undefined)
-        return direct;
-    if (!isRecord(contentJson))
-        return undefined;
-    const derivationStage = SUMMARY_DERIVATION_STAGE[stage]
-        ?? (SUMMARY_RUNNER_KINDS.includes(stage) ? stage : undefined);
-    if (derivationStage === undefined)
-        return undefined;
-    const derived = deriveArtifactSummary(derivationStage, contentJson);
-    if (!derived.ok)
-        return undefined;
-    const parsed = parseContextPath(fieldPath);
-    if (parsed === null)
-        return undefined;
-    const [key] = parsed.rest;
-    if (key === undefined || FORBIDDEN_SEGMENTS.has(key))
-        return undefined;
-    if (key === 'headline')
-        return derived.value.headline;
-    if (!Object.hasOwn(derived.value.fields, key))
-        return undefined;
-    return derived.value.fields[key];
-}
-/**
- * Convert CandidateLineage nodes into raw stage sources.
- *
- * Order is preserved, which is what makes stage selection deterministic:
- * `CandidateLineage.resolve` walks BFS from the start artifact, so the FIRST
- * node matching a stage is the NEAREST ancestor (design §20). Later duplicates
- * are ignored — never a positional/arbitrary pick.
- *
- * Nodes whose stage could not be determined (`taskKind === 'unknown'`) carry no
- * stage authority and are dropped.
- */
-export function toRawStageSources(nodes) {
-    const sources = [];
-    for (const node of nodes) {
-        if (node.taskKind === 'unknown' || node.taskKind === '')
-            continue;
-        sources.push({ stage: node.taskKind, contentJson: node.contentJson });
-    }
-    return sources;
-}
-/**
- * Split a manifest's tier2 into (ancestry raw paths, related raw paths).
- *
- * Related namespaces are excluded from the ancestry walk explicitly: a related
- * reference is a causal pointer supplied by the caller, so it must never be
- * mistaken for an ancestor stage — even if a taskKind happened to share the
- * name. This is the executable form of INV-LINEAGE-SCOPE (design §33).
- */
-export function partitionTier2Paths(tier2Paths, relatedNamespaces) {
-    const related = new Set(relatedNamespaces);
-    const ancestry = [];
-    const relatedPaths = [];
-    for (const fieldPath of tier2Paths) {
-        const parsed = parseContextPath(fieldPath);
-        if (parsed !== null && parsed.layer === 'raw' && related.has(parsed.namespace)) {
-            relatedPaths.push(fieldPath);
-            continue;
-        }
-        ancestry.push(fieldPath);
-    }
-    return { ancestry, related: relatedPaths };
-}
-/**
- * Resolve ancestor-declared paths against ancestry sources — BOTH layers:
- *
- *   `<stage>.raw.<dotted.path>` — full contentJson walk (`readRawField`)
- *   `<stage>.summary.<key>`     — the ancestor's own Layer 0 envelope
- *                                 (`readSummaryField`)
- *
- * Why the summary layer needs the ancestry channel too (PR B, evidence-backed):
- * `readSummaryField` deliberately STRIPS the leading `<stage>.` namespace and
- * reads only its single `predecessorContentJson`. That convention is correct
- * for manifests whose stage namespace is the runner's direct predecessor
- * (dreamer/scribe/artificer), but a manifest that names an ancestor further up
- * the chain (the Evaluator's `scribe.*` / `dreamer.*` / `diagnostician.*`)
- * would otherwise have those paths structurally unreachable — they would land
- * in `absent` forever and force the information-floor fallback on every run.
- * The lineage walk already holds every ancestor's contentJson, so the same
- * traversal that serves `raw` also serves `summary`, with no extra store read.
- *
- * First (nearest) matching stage wins; unresolvable paths are omitted so the
- * caller's information-floor logic records them in `absent`.
- *
- * `predecessorSummary` is intentionally NOT answered here: it is the
- * direct-predecessor forwarding concept owned by Channel 1.
- *
- * Namespace → node matching honors `SEMANTIC_STAGE_ALIASES`: a manifest
- * namespace is the SEMANTIC stage, a node's stage is the producer taskKind.
- */
-export function resolveAncestryPaths(fieldPaths, sources) {
-    const resolved = new Map();
-    for (const fieldPath of fieldPaths) {
-        const parsed = parseContextPath(fieldPath);
-        if (parsed === null)
-            continue;
-        if (parsed.layer === 'predecessorSummary')
-            continue;
-        const producerStages = [
-            parsed.namespace,
-            ...(SEMANTIC_STAGE_ALIASES[parsed.namespace] ?? []),
-        ];
-        const source = sources.find((candidate) => producerStages.includes(candidate.stage));
-        if (source === undefined)
-            continue;
-        const value = parsed.layer === 'raw'
-            ? readRawField(parsed.rest, source.contentJson)
-            : readSummaryWithProjection(fieldPath, source.stage, source.contentJson);
-        if (value !== undefined)
-            resolved.set(fieldPath, value);
-    }
-    return resolved;
-}
-/**
- * Resolve `<ns>.summary.<key>` / `<ns>.raw.<key>` against related sources.
- * Related refs expose flat keys only — a multi-segment rest path is not a
- * related reference and is skipped (it belongs to the ancestry reader).
- */
-export function resolveRelatedPaths(fieldPaths, sources) {
-    const resolved = new Map();
-    for (const fieldPath of fieldPaths) {
-        const parsed = parseContextPath(fieldPath);
-        if (parsed === null)
-            continue;
-        if (parsed.rest.length !== 1)
-            continue;
-        if (parsed.layer === 'predecessorSummary')
-            continue;
-        const source = sources.find((candidate) => candidate.namespace === parsed.namespace);
-        if (source === undefined)
-            continue;
-        const table = parsed.layer === 'raw' ? source.raw : source.summary;
-        if (table === undefined)
-            continue;
-        const [key] = parsed.rest;
-        if (key === undefined || FORBIDDEN_SEGMENTS.has(key))
-            continue;
-        if (!Object.hasOwn(table, key))
-            continue;
-        const value = table[key];
-        if (value !== undefined)
-            resolved.set(fieldPath, value);
-    }
-    return resolved;
-}
-// ── Composition ─────────────────────────────────────────────────────────────
-/**
- * Merge the channel maps into one `available` map. FIRST WRITER WINS: the
- * predecessor summary envelope is the highest-authority local source, then
- * ancestry raw, then related. Channel namespaces are disjoint by construction
- * (a path is either a summary path, an ancestry raw path, or a related path),
- * so the rule only matters defensively — but it keeps the result deterministic.
- */
-export function mergeContextFields(base, extras) {
-    const merged = new Map(base);
-    for (const extra of extras) {
-        for (const [fieldPath, value] of extra) {
-            if (!merged.has(fieldPath))
-                merged.set(fieldPath, value);
-        }
-    }
-    return merged;
-}
-// ── Information floor: required-evidence gate (design §33–§37) ──────────────
-/**
- * Required paths that did NOT reach the prompt — either absent from the
- * available map or dropped/truncated by the budget.
- *
- * This is the regression guard for "Stage2 enabled + raw fields silently
- * absent": a required field that was truncated by `PromptBudgetManager` counts
- * as unresolved just like an absent one, because the runner's semantic
- * requirement was still not met.
- */
-export function findUnresolvedRequiredPaths(params) {
-    const absentPaths = new Set(params.absent);
-    const truncatedPaths = new Set(params.truncated.map((record) => record.fieldPath));
-    return params.required.filter((path) => absentPaths.has(path) || truncatedPaths.has(path));
-}
-//# sourceMappingURL=context-resolution.js.map

package/dist/runtime-v2/internalization/context-resolution.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"context-resolution.js","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/context-resolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EACL,qBAAqB,EACrB,oBAAoB,GAErB,MAAM,uBAAuB,CAAC;AAoB/B;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAChD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC;IACjC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC7D,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,oBAAoB;QAAE,OAAO,IAAI,CAAC;IAC1F,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7E,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACpC,CAAC;AAED,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC;IACtD,WAAW;IACX,aAAa;IACb,WAAW;CACZ,CAAC,CAAC;AAEH,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,gFAAgF;AAChF,MAAM,WAAW,GAAG,mBAAmB,CAAC;AAExC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,OAA0B,EAC1B,WAAoB;IAEpB,IAAI,OAAO,GAAY,WAAW,CAAC;IACnC,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO,SAAS,CAAC;QAEtD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,OAAO,SAAS,CAAC;YACjD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC;gBAAE,OAAO,SAAS,CAAC;YACvD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC;YAAE,OAAO,SAAS,CAAC;QACvD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAgD;IACjF,aAAa,EAAE,CAAC,eAAe,EAAE,aAAa,CAAC;CAChD,CAAC;AAEF;;;;GAIG;AACH,MAAM,wBAAwB,GAAgD;IAC5E,aAAa,EAAE,aAAa;CAC7B,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,SAAS,yBAAyB,CAChC,SAAiB,EACjB,KAAa,EACb,WAAoB;IAEpB,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACxD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAExC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7C,MAAM,eAAe,GAAG,wBAAwB,CAAC,KAAK,CAAC;WAClD,CAAE,oBAA0C,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAA2B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC9G,IAAI,eAAe,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACpD,MAAM,OAAO,GAAG,qBAAqB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;IACpE,IAAI,CAAC,OAAO,CAAC,EAAE;QAAE,OAAO,SAAS,CAAC;IAElC,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACtC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;IAC1B,IAAI,GAAG,KAAK,SAAS,IAAI,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IACvE,IAAI,GAAG,KAAK,UAAU;QAAE,OAAO,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;IACtD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAChE,OAAO,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACnC,CAAC;AAgBD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA8E;IAE9E,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE;YAAE,SAAS;QAClE,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAA6B,EAC7B,iBAAoC;IAEpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/E,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAA6B,EAC7B,OAAkC;IAElC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,MAAM,KAAK,IAAI;YAAE,SAAS;QAC9B,IAAI,MAAM,CAAC,KAAK,KAAK,oBAAoB;YAAE,SAAS;QACpD,MAAM,cAAc,GAAG;YACrB,MAAM,CAAC,SAAS;YAChB,GAAG,CAAC,sBAAsB,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;SACpD,CAAC;QACF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACrF,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,KAAK,KAAK;YAClC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC;YAC/C,CAAC,CAAC,yBAAyB,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QAC3E,IAAI,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAuBD;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAA6B,EAC7B,OAAwC;IAExC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,MAAM,KAAK,IAAI;YAAE,SAAS;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACvC,IAAI,MAAM,CAAC,KAAK,KAAK,oBAAoB;YAAE,SAAS;QACpD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,KAAK,MAAM,CAAC,SAAS,CAAC,CAAC;QACrF,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC;QACnE,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS,IAAI,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC/D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC;YAAE,SAAS;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+EAA+E;AAE/E;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAkC,EAClC,MAA+C;IAE/C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAkB,IAAI,CAAC,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CAAC,MAI3C;IACC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IACnF,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAC3B,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAC5D,CAAC;AACJ,CAAC"}

package/dist/runtime-v2/internalization/progressive-evaluator.d.ts

@@ -1,115 +0,0 @@
-/**
- * Layer 2 — Progressive Evaluator: two-stage evaluation with flagged criteria
- * (design §6.5).
- *
- * Pure logic only (Core vs Plugin boundary, `antipattern-core-io`).
- *
- * The progressive evaluator runs Stage 1 (summary-level context) first; only
- * when flagged / undetermined / forced-sample does it trigger Stage 2 (tier2
- * full-contentJson re-evaluation). This keeps daily cost low while enabling
- * deep diagnosis on demand.
- *
- * Key invariants:
- *   - Stage 2 output is INDEPENDENT — never merged with Stage 1 (rc-7 /
- *     ERR-015 / ERR-018 / ERR-019). `stagesRun === 2` ⟹ `finalOutput` is
- *     entirely the Stage 2 result.
- *   - flagged criteria read DIMENSION_COVERAGE_POLICY (single source of truth),
- *     never inline a dimension-name array. Untrusted LLM input is filtered by
- *     the policy table before flagging (rc-1 / rc-4).
- *   - Deterministic forced sampling via fnv1a32 (no Math.random, design §4.4).
- */
-export declare const IMPLEMENTATION_FIDELITY_THRESHOLD = 0.7;
-export declare const FORCED_STAGE2_SAMPLE_MODULUS = 20;
-export type FlaggedReasonCode = 'missing_dimensions' | 'pain_not_fully_covered' | 'implementation_fidelity_below_threshold';
-export interface FlaggedDecision {
-    readonly flagged: boolean;
-    readonly reasons: readonly FlaggedReasonCode[];
-    /** Fields that could not be determined (missing/malformed) — rc-3 + rc-9. */
-    readonly undetermined: readonly string[];
-}
-export interface ProgressiveEvaluationOutcome {
-    /** Stage 2 ran → entirely Stage 2's result; never merged with Stage 1. */
-    readonly finalOutput: unknown;
-    readonly stagesRun: 1 | 2;
-    readonly stage1Decision: FlaggedDecision;
-    readonly forcedStage2: boolean;
-    readonly stage1FalseNegative?: {
-        readonly newConcernKeys: readonly string[];
-    };
-    readonly stage2Aborted?: {
-        readonly reason: 'lineage_error';
-        readonly detail: string;
-    };
-}
-/**
- * FNV-1a 32-bit hash. Pure, deterministic, no crypto, no Math.random.
- * Supports the full Unicode range in the input string.
- */
-export declare function fnv1a32(input: string): number;
-/**
- * Deterministic ~5% forced Stage 2 sampling. `fnv1a32(taskId) % modulus === 0`.
- * Never uses Math.random or any non-deterministic source (design §4.4).
- */
-export declare function isForcedStage2(taskId: string, modulus?: number): boolean;
-/**
- * Evaluate the three flagged criteria against Stage 1 output (design §6.5.3).
- *
- * Preconditions: none — `stage1Output` is untrusted LLM output (rc-1), read
- * via `Object.hasOwn` (rc-5 / ERR-013).
- *
- * Postconditions:
- *   - `flagged === true` iff `reasons` is non-empty.
- *   - Three criteria: required-dimension missing, painCoverage.fullyCovered === false,
- *     implementationFidelity.score < 0.7.
- *   - Fields missing or wrong type → `undetermined` (rc-3: fail loud, never
- *     silently pass).
- *
- * Dimension criterion (§6.5.3, measurement-driven tightening):
- *   - Only **required** dimension names in `missingDimensions` count. The LLM
- *     may stuff optional/excluded/unknown strings in — all filtered out by
- *     `isRequiredDimension` before checking. `optionalUncovered` never enters
- *     `reasons`.
- */
-export declare function evaluateFlaggedCriteria(stage1Output: unknown): FlaggedDecision;
-/**
- * LLM evaluator callback type. The caller injects the actual LLM invocation;
- * this module is pure logic and never calls an LLM directly.
- */
-export interface ProgressiveEvaluatorLLM {
-    /** Evaluate using the provided context fields. Returns the raw LLM output (unknown). */
-    evaluate(fields: Readonly<Record<string, string>>): Promise<unknown>;
-}
-/**
- * Lineage resolver type (CandidateLineage from Layer 2, injected by caller).
- */
-export interface ProgressiveEvaluatorLineage {
-    resolve(startArtifactId: string): Promise<{
-        readonly ok: true;
-        readonly value: {
-            readonly nodes: readonly unknown[];
-        };
-    } | {
-        readonly ok: false;
-        readonly error: {
-            readonly kind: string;
-        };
-    }>;
-}
-export interface ProgressiveEvaluatorDeps {
-    readonly taskId: string;
-    readonly startArtifactId: string;
-    readonly stage1Context: Readonly<Record<string, string>>;
-    readonly stage2Context?: Readonly<Record<string, string>>;
-    readonly llm: ProgressiveEvaluatorLLM;
-    readonly lineage?: ProgressiveEvaluatorLineage;
-    readonly emit?: (event: ProgressiveEvaluatorEvent) => void;
-}
-export type ProgressiveEvaluatorEvent = {
-    readonly type: 'lineage_data_corrupt';
-    readonly detail: string;
-} | {
-    readonly type: 'stage1_false_negative';
-    readonly newConcernKeys: readonly string[];
-};
-export declare function runProgressiveEvaluation(deps: ProgressiveEvaluatorDeps): Promise<ProgressiveEvaluationOutcome>;
-//# sourceMappingURL=progressive-evaluator.d.ts.map

package/dist/runtime-v2/internalization/progressive-evaluator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"progressive-evaluator.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/internalization/progressive-evaluator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAMH,eAAO,MAAM,iCAAiC,MAAM,CAAC;AACrD,eAAO,MAAM,4BAA4B,KAAK,CAAC;AAE/C,MAAM,MAAM,iBAAiB,GACzB,oBAAoB,GACpB,wBAAwB,GACxB,yCAAyC,CAAC;AAE9C,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC/C,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1C;AAED,MAAM,WAAW,4BAA4B;IAC3C,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,eAAe,CAAC;IACzC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,mBAAmB,CAAC,EAAE;QAAE,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,CAAC;IAC9E,QAAQ,CAAC,aAAa,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACxF;AA6BD;;;GAGG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAS7C;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,MAAqC,GAAG,OAAO,CAGtG;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,uBAAuB,CAAC,YAAY,EAAE,OAAO,GAAG,eAAe,CA+D9E;AAID;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,wFAAwF;IACxF,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CACtE;AAED;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC1C,OAAO,CAAC,eAAe,EAAE,MAAM,GAAG,OAAO,CACrC;QAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE;YAAE,QAAQ,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAA;SAAE,CAAA;KAAE,GAC7E;QAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE;YAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CACpE,CAAC;CACH;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,QAAQ,CAAC,aAAa,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC1D,QAAQ,CAAC,GAAG,EAAE,uBAAuB,CAAC;IACtC,QAAQ,CAAC,OAAO,CAAC,EAAE,2BAA2B,CAAC;IAC/C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,yBAAyB,KAAK,IAAI,CAAC;CAC5D;AAED,MAAM,MAAM,yBAAyB,GACjC;IAAE,QAAQ,CAAC,IAAI,EAAE,sBAAsB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAClE;IAAE,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AA8C3F,wBAAsB,wBAAwB,CAC5C,IAAI,EAAE,wBAAwB,GAC7B,OAAO,CAAC,4BAA4B,CAAC,CAkDvC"}