universal-physics-tensor 10.0.0 → 12.0.0

package/dist/atlas/witness-symbolic.js

@@ -31,19 +31,123 @@
  * `lhs − rhs = 0`; the capability needed is SIMPLIFICATION, which lives in
  * `expr-simplify.ts` (a different peer, `@danielsimonjr/mathts-functions`).
  *
+ * ## The numeric probe is a SECOND result, never folded into the CAS status
+ *
+ * A simplifier that fails on everything would leave every wrong dictionary
+ * `'unresolved'`, which is "not checked", not "shown wrong" (the weaker
+ * guarantee NOTES.md records). {@link probeSymbolicWitness} therefore
+ * evaluates both sides at seeded random positive points through `evalExpr`
+ * and REFUTES on disagreement. Its outcome is its own kind
+ * ({@link NumericProbeKind}), carried on the run result beside `status`:
+ * a probe that agrees never makes a run `'checked'`, a probe that refutes
+ * never makes it `'refuted'`, and the two are tallied as two sets of
+ * numbers ({@link tallySymbolicResults}; AGENTS law 4). MathTS
+ * `symbolicEqual` is not used: it is the same simplifier, not a second method.
+ *
  * @module atlas/witness-symbolic
  * @internal
  */
+import { random, seedProbabilityRng } from '@danielsimonjr/mathts-functions';
+import { sym } from '../dimensional/ast-builders.js';
+import { DIMENSIONLESS } from '../dimensional/types.js';
+import { evalExpr } from '../composition/expr-eval.js';
 import { isSimplifierAvailable, simplifyExpr } from '../composition/expr-simplify.js';
+import { scalarSymbolsFromMathTs } from '../composition/mathts-scalar-symbols.js';
+import { literalValue as leafLiteral } from '../dimensional/ast-leaves.js';
 const DEFAULT_BUDGET_MS = 5000;
-/** The numeric value of a literal leaf, or `null`. Same rule as `validator.ts`. */
+/** Seeded points per probe. @internal */
+export const NUMERIC_PROBE_POINTS = 8;
+/** The relative difference above which a point refutes. @internal */
+export const NUMERIC_PROBE_TOLERANCE = 1e-12;
+/** A leaf that evaluates on its own (π, a registered constant, a literal) is a constant, not a free symbol. */
+function evaluatesAlone(name) {
+    try {
+        return Number.isFinite(evalExpr(sym(name, DIMENSIONLESS)));
+    }
+    catch {
+        return false;
+    }
+}
+/** MathTS `random(lo, hi)`, read back as the number it is. */
+function seededPoint(lo, hi) {
+    const v = random(lo, hi);
+    if (typeof v !== 'number')
+        throw new TypeError('random did not return a number');
+    return v;
+}
+/**
+ * Evaluate a symbolic witness's two sides at `points` seeded random points,
+ * every free symbol drawn from [0.5, 2) by MathTS `random` after
+ * `seedProbabilityRng(spec.id)`, so a re-run sees the same points. The free
+ * symbols are the scalar leaves (`scalarSymbolsFromMathTs`) that do not
+ * evaluate on their own. Never throws.
+ *
+ * @internal
+ */
+export function probeSymbolicWitness(spec, points = NUMERIC_PROBE_POINTS) {
+    const notRun = (why) => ({ kind: 'numeric-not-run', points: 0, detail: `The numeric probe did not run: ${why}.` });
+    try {
+        const names = new Set();
+        for (const leaf of [...scalarSymbolsFromMathTs(spec.lhs), ...scalarSymbolsFromMathTs(spec.rhs)])
+            names.add(leaf.name);
+        const free = [...names].filter((name) => !evaluatesAlone(name)).sort();
+        seedProbabilityRng(spec.id);
+        let worst = 0;
+        for (let i = 0; i < points; i++) {
+            const values = {};
+            for (const name of free)
+                values[name] = seededPoint(0.5, 2);
+            const lhs = evalExpr(spec.lhs, values);
+            const rhs = evalExpr(spec.rhs, values);
+            if (!Number.isFinite(lhs) || !Number.isFinite(rhs)) {
+                return notRun(`a non-finite value (lhs ${lhs}, rhs ${rhs}) at point ${i + 1}`);
+            }
+            const scale = Math.abs(lhs) + Math.abs(rhs);
+            worst = Math.max(worst, scale === 0 ? 0 : Math.abs(lhs - rhs) / scale);
+        }
+        if (worst > NUMERIC_PROBE_TOLERANCE) {
+            return {
+                kind: 'numeric-refuted',
+                points,
+                worst,
+                detail: `lhs and rhs differ at a seeded point: max |lhs − rhs|/(|lhs| + |rhs|) = ${worst} over ${points} points, above ${NUMERIC_PROBE_TOLERANCE}.`,
+            };
+        }
+        return {
+            kind: 'numeric-agrees',
+            points,
+            worst,
+            detail: `lhs and rhs agree at ${points} seeded points: max |lhs − rhs|/(|lhs| + |rhs|) = ${worst}. Agreement at points is not a proof.`,
+        };
+    }
+    catch (err) {
+        return notRun(`the evaluator threw: ${String(err)}`);
+    }
+}
+/**
+ * The CAS outcomes and the numeric outcomes of symbolic runs, as two separate
+ * tallies. They are never added together.
+ *
+ * @internal
+ */
+export function tallySymbolicResults(results) {
+    const cas = { checked: 0, refuted: 0, unresolved: 0 };
+    const numeric = { agrees: 0, refuted: 0, notRun: 0 };
+    for (const r of results) {
+        cas[r.status] += 1;
+        if (r.numericProbe.kind === 'numeric-agrees')
+            numeric.agrees += 1;
+        else if (r.numericProbe.kind === 'numeric-refuted')
+            numeric.refuted += 1;
+        else
+            numeric.notRun += 1;
+    }
+    return { cas, numeric };
+}
+/** The finite value of a decimal-literal leaf (the one rule, `dimensional/ast-leaves.ts`), or `null`. */
 function literalValue(node) {
-    if (node.kind !== 'symbol')
-        return null;
-    if (node.name.trim() === '')
-        return null;
-    const v = Number(node.name);
-    return Number.isFinite(v) ? v : null;
+    const v = leafLiteral(node);
+    return v !== undefined && Number.isFinite(v) ? v : null;
 }
 /** A sentinel the timeout race resolves with; never confusable with a result. */
 const TIMED_OUT = Symbol('timed-out');
@@ -54,8 +158,9 @@ const TIMED_OUT = Symbol('timed-out');
  * @param simplifier - the CAS capability, or `null` when the optional peer is
  * absent. When omitted, resolves to `simplifyExpr` if the peer is available and
  * to `null` otherwise. Pass `null` EXPLICITLY to exercise the absent path.
- * @returns a result; **never throws**, because a thrown error forces callers
- * into a `catch` that cannot distinguish "did not run" from "failed".
+ * @returns a result carrying the CAS status and, beside it, the numeric
+ * probe; **never throws**, because a thrown error forces callers into a
+ * `catch` that cannot distinguish "did not run" from "failed".
  * @internal
  */
 export async function runSymbolicWitness(spec, simplifier) {
@@ -63,7 +168,8 @@ export async function runSymbolicWitness(spec, simplifier) {
     if (simplifier === undefined) {
         simplifier = (await isSimplifierAvailable()) ? simplifyExpr : null;
     }
-    const base = { witnessId: spec.id, kind: 'symbolic' };
+    // The probe is independent of the CAS: it runs on every path, and decides nothing below.
+    const base = { witnessId: spec.id, kind: 'symbolic', numericProbe: probeSymbolicWitness(spec) };
     const elapsed = () => Date.now() - started;
     if (simplifier === null) {
         return {

package/dist/atlas/witness-symbolic.js.map

@@ -1 +1 @@
-{"version":3,"file":"witness-symbolic.js","sourceRoot":"","sources":["../../src/atlas/witness-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAGH,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAgCtF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAE/B,mFAAmF;AACnF,SAAS,YAAY,CAAC,IAAc;IAClC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACxC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC;AAED,iFAAiF;AACjF,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;AAEtC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAyB,EACzB,UAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,UAAU,GAAG,CAAC,MAAM,qBAAqB,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,UAAmB,EAAE,CAAC;IAC/D,MAAM,OAAO,GAAG,GAAW,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;IAEnD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,aAAa;YACrB,MAAM,EACJ,4EAA4E;gBAC5E,0BAA0B;YAC5B,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IAElD,IAAI,OAAmE,CAAC;IACxE,IAAI,KAAgD,CAAC;IACrD,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;YAC3B,UAAU,CAAC,UAAU,CAAC;YACtB,IAAI,OAAO,CAAmB,CAAC,OAAO,EAAE,EAAE;gBACxC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC;YACvD,CAAC,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,aAAa;YACrB,MAAM,EACJ,+CAA+C,MAAM,CAAC,GAAG,CAAC,qBAAqB;gBAC/E,aAAa;YACf,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,IAAI,KAAK,KAAK,SAAS;YAAE,YAAY,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,SAAS;YACjB,MAAM,EACJ,4BAA4B,MAAM,2CAA2C;gBAC7E,0DAA0D;YAC5D,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,oCAAoC;YAC5C,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,iDAAiD,KAAK,GAAG;YACjE,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,OAAO;QACL,GAAG,IAAI;QACP,MAAM,EAAE,YAAY;QACpB,MAAM,EAAE,gBAAgB;QACxB,MAAM,EACJ,8EAA8E;YAC9E,+BAA+B;QACjC,SAAS,EAAE,OAAO,EAAE;KACrB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.2 — the symbolic witness runner.\n *\n * Design note: `docs/planning/Atlas-Phase-4-Design.md` §2.\n *\n * A symbolic witness claims `lhs = rhs`. The runner forms the DIFFERENCE and\n * asks the optional CAS peer to simplify it: a difference that collapses to a\n * literal zero is `'checked'`; one that collapses to a non-zero literal is\n * `'refuted'`; anything else is `'unresolved'` with the reason it could not\n * decide.\n *\n * ## The simplifier is INJECTED, and no test touches the registry\n *\n * `src/numerical/formula-registry.ts` caches its selection in module scope and\n * exposes no reset hook, so a test that registered a stub would leak it into\n * every later test in the same worker. {@link runSymbolicWitness} therefore\n * takes the simplifier as a PARAMETER, defaulting to `simplifyExpr`. Tests\n * pass a stub for the present path and `null` for the absent path; the\n * registry is never written. One test exercises the real peer under the\n * existing skip-when-absent pattern.\n *\n * `null` means \"the peer is absent\" and is a first-class argument value, not a\n * forgotten one. `simplifyExpr` itself CANNOT tell absence from \"nothing to\n * simplify\" — both return `simplified: false` — so when the argument is\n * OMITTED the runner asks `isSimplifierAvailable()` first and maps absence to\n * `null`. Without that step the default path would report a missing peer as\n * `'not-simplified'`, the wrong reason on the one path most callers take.\n *\n * Deviation from the plan's wording, recorded in the design note §2.1: the\n * plan names `getFormulaParser()` as the default. A parser cannot decide\n * `lhs − rhs = 0`; the capability needed is SIMPLIFICATION, which lives in\n * `expr-simplify.ts` (a different peer, `@danielsimonjr/mathts-functions`).\n *\n * @module atlas/witness-symbolic\n * @internal\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { isSimplifierAvailable, simplifyExpr } from '../composition/expr-simplify.js';\nimport type { WitnessRunResult } from './witness-result.js';\n\n/**\n * The simplification capability this runner needs, as a function rather than\n * the whole module — so a stub is five lines and cannot accidentally depend on\n * anything else `expr-simplify.ts` exports.\n *\n * @internal\n */\nexport type SymbolicSimplifier = (\n  expr: ExprNode,\n) => Promise<{ readonly expr: ExprNode; readonly simplified: boolean }>;\n\n/** What a symbolic witness asserts. @internal */\nexport interface SymbolicWitnessSpec {\n  /** The `Witness.id` (`'W7b'`). */\n  readonly id: string;\n  readonly lhs: ExprNode;\n  readonly rhs: ExprNode;\n  /**\n   * Wall-clock budget in milliseconds. Default 5000.\n   *\n   * ⚠ **This bounds how long the RUNNER WAITS, not how long the CAS works.**\n   * The peer's `simplify` is synchronous inside its promise, so nothing here\n   * can interrupt it; a timeout reports that no answer arrived in time and the\n   * underlying work may still be running. Saying otherwise would be the\n   * \"a running process is not a working one\" error in reverse.\n   */\n  readonly budgetMs?: number;\n}\n\nconst DEFAULT_BUDGET_MS = 5000;\n\n/** The numeric value of a literal leaf, or `null`. Same rule as `validator.ts`. */\nfunction literalValue(node: ExprNode): number | null {\n  if (node.kind !== 'symbol') return null;\n  if (node.name.trim() === '') return null;\n  const v = Number(node.name);\n  return Number.isFinite(v) ? v : null;\n}\n\n/** A sentinel the timeout race resolves with; never confusable with a result. */\nconst TIMED_OUT = Symbol('timed-out');\n\n/**\n * Run one symbolic witness.\n *\n * @param spec - the claim, as two ASTs whose difference should vanish.\n * @param simplifier - the CAS capability, or `null` when the optional peer is\n * absent. When omitted, resolves to `simplifyExpr` if the peer is available and\n * to `null` otherwise. Pass `null` EXPLICITLY to exercise the absent path.\n * @returns a result; **never throws**, because a thrown error forces callers\n * into a `catch` that cannot distinguish \"did not run\" from \"failed\".\n * @internal\n */\nexport async function runSymbolicWitness(\n  spec: SymbolicWitnessSpec,\n  simplifier?: SymbolicSimplifier | null,\n): Promise<WitnessRunResult> {\n  const started = Date.now();\n  if (simplifier === undefined) {\n    simplifier = (await isSimplifierAvailable()) ? simplifyExpr : null;\n  }\n  const base = { witnessId: spec.id, kind: 'symbolic' as const };\n  const elapsed = (): number => Date.now() - started;\n\n  if (simplifier === null) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'peer-absent',\n      detail:\n        'The optional CAS peer is absent, so the claim was never examined. This is ' +\n        'not evidence against it.',\n      elapsedMs: elapsed(),\n    };\n  }\n\n  const difference: ExprNode = { kind: 'op', op: '-', args: [spec.lhs, spec.rhs] };\n  const budget = spec.budgetMs ?? DEFAULT_BUDGET_MS;\n\n  let outcome: Awaited<ReturnType<SymbolicSimplifier>> | typeof TIMED_OUT;\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  try {\n    outcome = await Promise.race([\n      simplifier(difference),\n      new Promise<typeof TIMED_OUT>((resolve) => {\n        timer = setTimeout(() => resolve(TIMED_OUT), budget);\n      }),\n    ]);\n  } catch (err) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'parse-error',\n      detail:\n        `The simplifier threw rather than answering: ${String(err)}. A throw is not a ` +\n        'refutation.',\n      elapsedMs: elapsed(),\n    };\n  } finally {\n    if (timer !== undefined) clearTimeout(timer);\n  }\n\n  if (outcome === TIMED_OUT) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'timeout',\n      detail:\n        `No answer arrived within ${budget} ms. The budget bounds the WAIT, not the ` +\n        'CAS: the underlying simplification may still be running.',\n      elapsedMs: elapsed(),\n    };\n  }\n\n  const value = literalValue(outcome.expr);\n  if (value === 0) {\n    return {\n      ...base,\n      status: 'checked',\n      detail: 'lhs − rhs simplified to literal 0.',\n      elapsedMs: elapsed(),\n    };\n  }\n  if (value !== null) {\n    return {\n      ...base,\n      status: 'refuted',\n      detail: `lhs − rhs simplified to the non-zero constant ${value}.`,\n      elapsedMs: elapsed(),\n    };\n  }\n  return {\n    ...base,\n    status: 'unresolved',\n    reason: 'not-simplified',\n    detail:\n      'The difference did not reduce to a constant. The claim may still hold; this ' +\n      'simplifier could not show it.',\n    elapsedMs: elapsed(),\n  };\n}\n"]}
+{"version":3,"file":"witness-symbolic.js","sourceRoot":"","sources":["../../src/atlas/witness-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;AAEH,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAE7E,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AACtF,OAAO,EAAE,uBAAuB,EAAE,MAAM,yCAAyC,CAAC;AAElF,OAAO,EAAE,YAAY,IAAI,WAAW,EAAE,MAAM,8BAA8B,CAAC;AA+B3E,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAyB/B,yCAAyC;AACzC,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC;AACtC,qEAAqE;AACrE,MAAM,CAAC,MAAM,uBAAuB,GAAG,KAAK,CAAC;AAE7C,+GAA+G;AAC/G,SAAS,cAAc,CAAC,IAAY;IAClC,IAAI,CAAC;QACH,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,8DAA8D;AAC9D,SAAS,WAAW,CAAC,EAAU,EAAE,EAAU;IACzC,MAAM,CAAC,GAAY,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;IACjF,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAyB,EAAE,MAAM,GAAW,oBAAoB;IACnG,MAAM,MAAM,GAAG,CAAC,GAAW,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,kCAAkC,GAAG,GAAG,EAAE,CAAC,CAAC;IACzI,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,uBAAuB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,uBAAuB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtH,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvE,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAA2B,EAAE,CAAC;YAC1C,KAAK,MAAM,IAAI,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5D,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACvC,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnD,OAAO,MAAM,CAAC,2BAA2B,GAAG,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjF,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,KAAK,GAAG,uBAAuB,EAAE,CAAC;YACpC,OAAO;gBACL,IAAI,EAAE,iBAAiB;gBACvB,MAAM;gBACN,KAAK;gBACL,MAAM,EAAE,2EAA2E,KAAK,SAAS,MAAM,kBAAkB,uBAAuB,GAAG;aACpJ,CAAC;QACJ,CAAC;QACD,OAAO;YACL,IAAI,EAAE,gBAAgB;YACtB,MAAM;YACN,KAAK;YACL,MAAM,EAAE,wBAAwB,MAAM,qDAAqD,KAAK,uCAAuC;SACxI,CAAC;IACJ,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,MAAM,CAAC,wBAAwB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAQD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAA4C;IAI/E,MAAM,GAAG,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACtD,MAAM,OAAO,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,gBAAgB;YAAE,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;aAC7D,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,iBAAiB;YAAE,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;;YACpE,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AAC1B,CAAC;AAED,yGAAyG;AACzG,SAAS,YAAY,CAAC,IAAc;IAClC,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC;AAED,iFAAiF;AACjF,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;AAEtC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAyB,EACzB,UAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,UAAU,GAAG,CAAC,MAAM,qBAAqB,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;IACrE,CAAC;IACD,yFAAyF;IACzF,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,UAAmB,EAAE,YAAY,EAAE,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;IACzG,MAAM,OAAO,GAAG,GAAW,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;IAEnD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,aAAa;YACrB,MAAM,EACJ,4EAA4E;gBAC5E,0BAA0B;YAC5B,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IAElD,IAAI,OAAmE,CAAC;IACxE,IAAI,KAAgD,CAAC;IACrD,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;YAC3B,UAAU,CAAC,UAAU,CAAC;YACtB,IAAI,OAAO,CAAmB,CAAC,OAAO,EAAE,EAAE;gBACxC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC;YACvD,CAAC,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,aAAa;YACrB,MAAM,EACJ,+CAA+C,MAAM,CAAC,GAAG,CAAC,qBAAqB;gBAC/E,aAAa;YACf,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,IAAI,KAAK,KAAK,SAAS;YAAE,YAAY,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,YAAY;YACpB,MAAM,EAAE,SAAS;YACjB,MAAM,EACJ,4BAA4B,MAAM,2CAA2C;gBAC7E,0DAA0D;YAC5D,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,oCAAoC;YAC5C,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,OAAO;YACL,GAAG,IAAI;YACP,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,iDAAiD,KAAK,GAAG;YACjE,SAAS,EAAE,OAAO,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,OAAO;QACL,GAAG,IAAI;QACP,MAAM,EAAE,YAAY;QACpB,MAAM,EAAE,gBAAgB;QACxB,MAAM,EACJ,8EAA8E;YAC9E,+BAA+B;QACjC,SAAS,EAAE,OAAO,EAAE;KACrB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.2 — the symbolic witness runner.\n *\n * Design note: `docs/planning/Atlas-Phase-4-Design.md` §2.\n *\n * A symbolic witness claims `lhs = rhs`. The runner forms the DIFFERENCE and\n * asks the optional CAS peer to simplify it: a difference that collapses to a\n * literal zero is `'checked'`; one that collapses to a non-zero literal is\n * `'refuted'`; anything else is `'unresolved'` with the reason it could not\n * decide.\n *\n * ## The simplifier is INJECTED, and no test touches the registry\n *\n * `src/numerical/formula-registry.ts` caches its selection in module scope and\n * exposes no reset hook, so a test that registered a stub would leak it into\n * every later test in the same worker. {@link runSymbolicWitness} therefore\n * takes the simplifier as a PARAMETER, defaulting to `simplifyExpr`. Tests\n * pass a stub for the present path and `null` for the absent path; the\n * registry is never written. One test exercises the real peer under the\n * existing skip-when-absent pattern.\n *\n * `null` means \"the peer is absent\" and is a first-class argument value, not a\n * forgotten one. `simplifyExpr` itself CANNOT tell absence from \"nothing to\n * simplify\" — both return `simplified: false` — so when the argument is\n * OMITTED the runner asks `isSimplifierAvailable()` first and maps absence to\n * `null`. Without that step the default path would report a missing peer as\n * `'not-simplified'`, the wrong reason on the one path most callers take.\n *\n * Deviation from the plan's wording, recorded in the design note §2.1: the\n * plan names `getFormulaParser()` as the default. A parser cannot decide\n * `lhs − rhs = 0`; the capability needed is SIMPLIFICATION, which lives in\n * `expr-simplify.ts` (a different peer, `@danielsimonjr/mathts-functions`).\n *\n * ## The numeric probe is a SECOND result, never folded into the CAS status\n *\n * A simplifier that fails on everything would leave every wrong dictionary\n * `'unresolved'`, which is \"not checked\", not \"shown wrong\" (the weaker\n * guarantee NOTES.md records). {@link probeSymbolicWitness} therefore\n * evaluates both sides at seeded random positive points through `evalExpr`\n * and REFUTES on disagreement. Its outcome is its own kind\n * ({@link NumericProbeKind}), carried on the run result beside `status`:\n * a probe that agrees never makes a run `'checked'`, a probe that refutes\n * never makes it `'refuted'`, and the two are tallied as two sets of\n * numbers ({@link tallySymbolicResults}; AGENTS law 4). MathTS\n * `symbolicEqual` is not used: it is the same simplifier, not a second method.\n *\n * @module atlas/witness-symbolic\n * @internal\n */\n\nimport { random, seedProbabilityRng } from '@danielsimonjr/mathts-functions';\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { sym } from '../dimensional/ast-builders.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { evalExpr } from '../composition/expr-eval.js';\nimport { isSimplifierAvailable, simplifyExpr } from '../composition/expr-simplify.js';\nimport { scalarSymbolsFromMathTs } from '../composition/mathts-scalar-symbols.js';\nimport type { WitnessRunResult } from './witness-result.js';\nimport { literalValue as leafLiteral } from '../dimensional/ast-leaves.js';\n\n/**\n * The simplification capability this runner needs, as a function rather than\n * the whole module — so a stub is five lines and cannot accidentally depend on\n * anything else `expr-simplify.ts` exports.\n *\n * @internal\n */\nexport type SymbolicSimplifier = (\n  expr: ExprNode,\n) => Promise<{ readonly expr: ExprNode; readonly simplified: boolean }>;\n\n/** What a symbolic witness asserts. @internal */\nexport interface SymbolicWitnessSpec {\n  /** The `Witness.id` (`'W7b'`). */\n  readonly id: string;\n  readonly lhs: ExprNode;\n  readonly rhs: ExprNode;\n  /**\n   * Wall-clock budget in milliseconds. Default 5000.\n   *\n   * ⚠ **This bounds how long the RUNNER WAITS, not how long the CAS works.**\n   * The peer's `simplify` is synchronous inside its promise, so nothing here\n   * can interrupt it; a timeout reports that no answer arrived in time and the\n   * underlying work may still be running. Saying otherwise would be the\n   * \"a running process is not a working one\" error in reverse.\n   */\n  readonly budgetMs?: number;\n}\n\nconst DEFAULT_BUDGET_MS = 5000;\n\n/**\n * What the numeric probe concluded: its own kind, never the CAS status.\n *\n * - `'numeric-refuted'`: some seeded point gives |lhs − rhs|/(|lhs| + |rhs|)\n *   above {@link NUMERIC_PROBE_TOLERANCE}.\n * - `'numeric-agrees'`: every point is within it. Agreement at finitely\n *   many points is not a proof, so this never lights an evidence tag.\n * - `'numeric-not-run'`: a side could not be evaluated to a finite number.\n *\n * @internal\n */\nexport type NumericProbeKind = 'numeric-refuted' | 'numeric-agrees' | 'numeric-not-run';\n\n/** The numeric probe's record. @internal */\nexport interface NumericProbe {\n  readonly kind: NumericProbeKind;\n  /** Points evaluated; 0 when not run. */\n  readonly points: number;\n  /** max |lhs − rhs|/(|lhs| + |rhs|) over the points; absent when not run. */\n  readonly worst?: number;\n  readonly detail: string;\n}\n\n/** Seeded points per probe. @internal */\nexport const NUMERIC_PROBE_POINTS = 8;\n/** The relative difference above which a point refutes. @internal */\nexport const NUMERIC_PROBE_TOLERANCE = 1e-12;\n\n/** A leaf that evaluates on its own (π, a registered constant, a literal) is a constant, not a free symbol. */\nfunction evaluatesAlone(name: string): boolean {\n  try {\n    return Number.isFinite(evalExpr(sym(name, DIMENSIONLESS)));\n  } catch {\n    return false;\n  }\n}\n\n/** MathTS `random(lo, hi)`, read back as the number it is. */\nfunction seededPoint(lo: number, hi: number): number {\n  const v: unknown = random(lo, hi);\n  if (typeof v !== 'number') throw new TypeError('random did not return a number');\n  return v;\n}\n\n/**\n * Evaluate a symbolic witness's two sides at `points` seeded random points,\n * every free symbol drawn from [0.5, 2) by MathTS `random` after\n * `seedProbabilityRng(spec.id)`, so a re-run sees the same points. The free\n * symbols are the scalar leaves (`scalarSymbolsFromMathTs`) that do not\n * evaluate on their own. Never throws.\n *\n * @internal\n */\nexport function probeSymbolicWitness(spec: SymbolicWitnessSpec, points: number = NUMERIC_PROBE_POINTS): NumericProbe {\n  const notRun = (why: string): NumericProbe => ({ kind: 'numeric-not-run', points: 0, detail: `The numeric probe did not run: ${why}.` });\n  try {\n    const names = new Set<string>();\n    for (const leaf of [...scalarSymbolsFromMathTs(spec.lhs), ...scalarSymbolsFromMathTs(spec.rhs)]) names.add(leaf.name);\n    const free = [...names].filter((name) => !evaluatesAlone(name)).sort();\n    seedProbabilityRng(spec.id);\n    let worst = 0;\n    for (let i = 0; i < points; i++) {\n      const values: Record<string, number> = {};\n      for (const name of free) values[name] = seededPoint(0.5, 2);\n      const lhs = evalExpr(spec.lhs, values);\n      const rhs = evalExpr(spec.rhs, values);\n      if (!Number.isFinite(lhs) || !Number.isFinite(rhs)) {\n        return notRun(`a non-finite value (lhs ${lhs}, rhs ${rhs}) at point ${i + 1}`);\n      }\n      const scale = Math.abs(lhs) + Math.abs(rhs);\n      worst = Math.max(worst, scale === 0 ? 0 : Math.abs(lhs - rhs) / scale);\n    }\n    if (worst > NUMERIC_PROBE_TOLERANCE) {\n      return {\n        kind: 'numeric-refuted',\n        points,\n        worst,\n        detail: `lhs and rhs differ at a seeded point: max |lhs − rhs|/(|lhs| + |rhs|) = ${worst} over ${points} points, above ${NUMERIC_PROBE_TOLERANCE}.`,\n      };\n    }\n    return {\n      kind: 'numeric-agrees',\n      points,\n      worst,\n      detail: `lhs and rhs agree at ${points} seeded points: max |lhs − rhs|/(|lhs| + |rhs|) = ${worst}. Agreement at points is not a proof.`,\n    };\n  } catch (err) {\n    return notRun(`the evaluator threw: ${String(err)}`);\n  }\n}\n\n/** A symbolic run: the CAS status, and the numeric probe beside it. @internal */\nexport interface SymbolicWitnessRunResult extends WitnessRunResult {\n  readonly kind: 'symbolic';\n  readonly numericProbe: NumericProbe;\n}\n\n/**\n * The CAS outcomes and the numeric outcomes of symbolic runs, as two separate\n * tallies. They are never added together.\n *\n * @internal\n */\nexport function tallySymbolicResults(results: readonly SymbolicWitnessRunResult[]): {\n  readonly cas: { readonly checked: number; readonly refuted: number; readonly unresolved: number };\n  readonly numeric: { readonly agrees: number; readonly refuted: number; readonly notRun: number };\n} {\n  const cas = { checked: 0, refuted: 0, unresolved: 0 };\n  const numeric = { agrees: 0, refuted: 0, notRun: 0 };\n  for (const r of results) {\n    cas[r.status] += 1;\n    if (r.numericProbe.kind === 'numeric-agrees') numeric.agrees += 1;\n    else if (r.numericProbe.kind === 'numeric-refuted') numeric.refuted += 1;\n    else numeric.notRun += 1;\n  }\n  return { cas, numeric };\n}\n\n/** The finite value of a decimal-literal leaf (the one rule, `dimensional/ast-leaves.ts`), or `null`. */\nfunction literalValue(node: ExprNode): number | null {\n  const v = leafLiteral(node);\n  return v !== undefined && Number.isFinite(v) ? v : null;\n}\n\n/** A sentinel the timeout race resolves with; never confusable with a result. */\nconst TIMED_OUT = Symbol('timed-out');\n\n/**\n * Run one symbolic witness.\n *\n * @param spec - the claim, as two ASTs whose difference should vanish.\n * @param simplifier - the CAS capability, or `null` when the optional peer is\n * absent. When omitted, resolves to `simplifyExpr` if the peer is available and\n * to `null` otherwise. Pass `null` EXPLICITLY to exercise the absent path.\n * @returns a result carrying the CAS status and, beside it, the numeric\n * probe; **never throws**, because a thrown error forces callers into a\n * `catch` that cannot distinguish \"did not run\" from \"failed\".\n * @internal\n */\nexport async function runSymbolicWitness(\n  spec: SymbolicWitnessSpec,\n  simplifier?: SymbolicSimplifier | null,\n): Promise<SymbolicWitnessRunResult> {\n  const started = Date.now();\n  if (simplifier === undefined) {\n    simplifier = (await isSimplifierAvailable()) ? simplifyExpr : null;\n  }\n  // The probe is independent of the CAS: it runs on every path, and decides nothing below.\n  const base = { witnessId: spec.id, kind: 'symbolic' as const, numericProbe: probeSymbolicWitness(spec) };\n  const elapsed = (): number => Date.now() - started;\n\n  if (simplifier === null) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'peer-absent',\n      detail:\n        'The optional CAS peer is absent, so the claim was never examined. This is ' +\n        'not evidence against it.',\n      elapsedMs: elapsed(),\n    };\n  }\n\n  const difference: ExprNode = { kind: 'op', op: '-', args: [spec.lhs, spec.rhs] };\n  const budget = spec.budgetMs ?? DEFAULT_BUDGET_MS;\n\n  let outcome: Awaited<ReturnType<SymbolicSimplifier>> | typeof TIMED_OUT;\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  try {\n    outcome = await Promise.race([\n      simplifier(difference),\n      new Promise<typeof TIMED_OUT>((resolve) => {\n        timer = setTimeout(() => resolve(TIMED_OUT), budget);\n      }),\n    ]);\n  } catch (err) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'parse-error',\n      detail:\n        `The simplifier threw rather than answering: ${String(err)}. A throw is not a ` +\n        'refutation.',\n      elapsedMs: elapsed(),\n    };\n  } finally {\n    if (timer !== undefined) clearTimeout(timer);\n  }\n\n  if (outcome === TIMED_OUT) {\n    return {\n      ...base,\n      status: 'unresolved',\n      reason: 'timeout',\n      detail:\n        `No answer arrived within ${budget} ms. The budget bounds the WAIT, not the ` +\n        'CAS: the underlying simplification may still be running.',\n      elapsedMs: elapsed(),\n    };\n  }\n\n  const value = literalValue(outcome.expr);\n  if (value === 0) {\n    return {\n      ...base,\n      status: 'checked',\n      detail: 'lhs − rhs simplified to literal 0.',\n      elapsedMs: elapsed(),\n    };\n  }\n  if (value !== null) {\n    return {\n      ...base,\n      status: 'refuted',\n      detail: `lhs − rhs simplified to the non-zero constant ${value}.`,\n      elapsedMs: elapsed(),\n    };\n  }\n  return {\n    ...base,\n    status: 'unresolved',\n    reason: 'not-simplified',\n    detail:\n      'The difference did not reduce to a constant. The claim may still hold; this ' +\n      'simplifier could not show it.',\n    elapsedMs: elapsed(),\n  };\n}\n"]}

package/dist/bridges/catalog-load.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EACV,oBAAoB,EAEpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AA6M5B;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,WAAW,CAGhE;AAID,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,yDAAyD;AACzD,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAED,2CAA2C;AAC3C,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}
+{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EACV,oBAAoB,EAEpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AAiN5B;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,WAAW,CAGhE;AAID,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,yDAAyD;AACzD,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAED,2CAA2C;AAC3C,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}

package/dist/bridges/catalog-load.js

@@ -5,6 +5,7 @@
  * @module bridges/catalog-load
  */
 import { residualInSigma } from './observations/types.js';
+import { withinMixed } from '../core/compare.js';
 import { checkedDataFile } from '../core/data-file.js';
 /**
  * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`
@@ -59,7 +60,7 @@ const boolean = (o, key, where) => {
  */
 /** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */
 function agreesToStoredPrecision(stored, computed) {
-    return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));
+    return withinMixed(stored, computed, 1e-3);
 }
 /** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */
 function holdsStatesClause(holds, clause) {
@@ -74,6 +75,12 @@ function holdsStatesClause(holds, clause) {
         from = at + 1;
     }
 }
+/**
+ * Checks `row.outcome` arm by arm on the record's `kind` and narrows the row to
+ * a loaded {@link CatalogConfrontation}: an assertion guard, so the loaded
+ * record is a `ConfrontationOutcome` by inspection, not by a cast. A field
+ * that is missing or of the wrong type throws naming the record.
+ */
 function readOutcome(row) {
     const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;
     const o = row.outcome;
@@ -129,10 +136,12 @@ function readOutcome(row) {
                 throw new Error(`${where}: outcome.rows must be an array`);
             break;
     }
-    return o;
 }
 function narrowConfrontations(file) {
-    return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));
+    return file.confrontations.map((row) => {
+        readOutcome(row);
+        return row;
+    });
 }
 /**
  * A relation's confidence is its catalog row's `status`. The row is the one
@@ -203,11 +212,7 @@ function deriveDomains(file) {
         if (clauses.length === 0)
             return relation;
         const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;
-        return {
-            ...relation,
-            holds: `${stated}${clauses.join(' and ')}`,
-            domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,
-        };
+        return { ...relation, holds: `${stated}${clauses.join(' and ')}` };
     });
     return { ...file, relations };
 }

package/dist/bridges/catalog-load.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAcvD;;;;GAIG;AACH,SAAS,QAAQ;IACf,OAAO,eAAe,CAAC,qBAAqB,CAAsB,CAAC;AACrE,CAAC;AAED,gFAAgF;AAChF,SAAS,UAAU,CAAC,IAAuB;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;QACpC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,mCAAmC,OAAO,kBAAkB,QAAQ,qCAAqC,CAAC,CAAC;QAC7H,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,yBAAyB,CAAC,CAAC;QAC7H,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,GAAG,CAAC,SAAS,uBAAuB,CAAC,CAAC;QAC1H,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,oBAAoB,CAAC,CAAC;QAC5H,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAU,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,0BAA0B,CAAC,CAAC;IACtH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAW,EAAE;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,oBAAoB,CAAC,CAAC;IAC1F,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;GAKG;AACH,yJAAyJ;AACzJ,SAAS,uBAAuB,CAAC,MAAc,EAAE,QAAgB;IAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,+FAA+F;AAC/F,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAAc;IACtD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,SAAS,CAAC;QACR,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;QAC/C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,GAA+B;IAClD,MAAM,KAAK,GAAG,2CAA2C,GAAG,CAAC,SAAS,EAAE,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,kBAAkB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,2BAA2B,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9H,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,OAAO,EAAE,CAAC;YACb,yFAAyF;YACzF,+EAA+E;YAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,MAAM,0CAA0C,QAAQ,EAAE,CAAC,CAAC;YACnH,CAAC;YACD,IAAI,OAAO,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0DAA0D,QAAQ,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,2FAA2F;YAC3F,8FAA8F;YAC9F,MAAM,YAAY,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,eAAe,CAAC;YAC1D,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,KAAK,CAAC;YACxE,IAAI,OAAO,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,+BAA+B,YAAY,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,KAAK,SAAS,OAAO,KAAK,GAAG,CAC/H,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,EAAE,CAAC;gBACjG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,8DAA8D,CAAC,CAAC;YAC1F,CAAC;YACD,0FAA0F;YAC1F,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACtE,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;gBACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,2BAA2B,GAAG,gDAAgD,QAAQ,EAAE,CAAC,CAAC;gBACpH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;YAC1F,MAAM;IACV,CAAC;IACD,OAAO,CAAoC,CAAC;AAC9C,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAuB;IACnD,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACnF,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAuB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAmB,EAAE;QACjE,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,uCAAuC,CAAC,CAAC;YAC5G,CAAC;YACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,qDAAqD,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,gCAAgC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QACzH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,2CAA2C,CAAC,CAAC;QAChH,CAAC;QACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,SAAoC,EAAE,MAAc;IACtE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClG,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,GAAG,MAAM,MAAM,CAAC;IAChD,IAAI,IAAI,KAAK,aAAa;QAAE,OAAO,GAAG,MAAM,OAAO,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAChD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;YAAE,OAAO,QAAQ,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjH,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7C,iFAAiF;YACjF,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC;QAChF,OAAO;YACL,GAAG,QAAQ;YACX,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YAC1C,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAClG,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,UAAU,CAAC,IAAI,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;AAExC,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC","sourcesContent":["/**\n * The catalog loader. This module is the only place that parses a bridge id\n * out of text. Everywhere else reads the loaded records.\n *\n * @module bridges/catalog-load\n */\n\nimport { residualInSigma } from './observations/types.js';\nimport { checkedDataFile } from '../core/data-file.js';\nimport type {\n  CatalogConfrontation,\n  CatalogConfrontationRecord,\n  CatalogEntry,\n  CatalogEvaluator,\n  CatalogEvaluatorParameter,\n  CatalogFile,\n  CatalogFileRecord,\n  CatalogRejection,\n  CatalogRelation,\n} from './catalog-types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\n\n/**\n * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`\n * (every record's `type`, the relation, evaluator, parameter and confrontation\n * shapes). What a schema cannot state is checked by {@link loadCatalog}.\n */\nfunction loadFile(): CatalogFileRecord {\n  return checkedDataFile('bridge-catalog.json') as CatalogFileRecord;\n}\n\n/** Records in ascending id order; a duplicate or a disordered id is refused. */\nfunction checkOrder(file: CatalogFileRecord): void {\n  for (let i = 1; i < file.entries.length; i += 1) {\n    const previous = file.entries[i - 1]!.id;\n    const current = file.entries[i]!.id;\n    if (current <= previous) {\n      throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);\n    }\n  }\n  const seen = new Set<number>();\n  for (const row of file.confrontations) {\n    if (seen.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);\n    seen.add(row.catalogId);\n  }\n  const rejected = new Set<number>();\n  const ids = new Set(file.entries.map((entry) => entry.id));\n  for (const row of file.rejections) {\n    if (!ids.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);\n    if (rejected.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);\n    rejected.add(row.catalogId);\n  }\n}\n\nconst number = (o: Readonly<Record<string, unknown>>, key: string, where: string): number => {\n  const v = o[key];\n  if (typeof v !== 'number' || !Number.isFinite(v)) throw new Error(`${where}: outcome.${key} must be a finite number`);\n  return v;\n};\nconst boolean = (o: Readonly<Record<string, unknown>>, key: string, where: string): boolean => {\n  const v = o[key];\n  if (typeof v !== 'boolean') throw new Error(`${where}: outcome.${key} must be a boolean`);\n  return v;\n};\n\n/**\n * The outcome of one confrontation, checked arm by arm on its `kind`. The\n * schema states the shared fields (`kind`, `units`, `provenance`, the data\n * handling); the fields each arm must carry are checked here, so the loaded\n * record is a {@link ConfrontationOutcome} by inspection, not by assertion.\n */\n/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */\nfunction agreesToStoredPrecision(stored: number, computed: number): boolean {\n  return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));\n}\n\n/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */\nfunction holdsStatesClause(holds: string, clause: string): boolean {\n  let from = 0;\n  for (;;) {\n    const at = holds.indexOf(clause, from);\n    if (at < 0) return false;\n    const before = at === 0 ? ' ' : holds[at - 1]!;\n    if (!/[A-Za-z0-9_-]/.test(before)) return true;\n    from = at + 1;\n  }\n}\n\nfunction readOutcome(row: CatalogConfrontationRecord): ConfrontationOutcome {\n  const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;\n  const o = row.outcome;\n  if (o['kind'] !== row.kind) throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);\n  switch (row.kind) {\n    case 'value': {\n      // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored\n      // residual or verdict that disagrees with |predicted − observed|/σ is refused.\n      const predicted = number(o, 'predicted', where);\n      const observed = number(o, 'observed', where);\n      const sigma = number(o, 'sigma', where);\n      const stored = number(o, 'residualInSigma', where);\n      const computed = residualInSigma(predicted, observed, sigma);\n      if (!agreesToStoredPrecision(stored, computed)) {\n        throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);\n      }\n      if (boolean(o, 'withinObserved', where) !== computed <= 1) {\n        throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);\n      }\n      break;\n    }\n    case 'upper-bound': {\n      const predicted = number(o, 'predicted', where);\n      const bound = number(o, 'bound', where);\n      // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or\n      // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.\n      const encodedBound = o['predictedIs'] === 'encoded-bound';\n      const expected = encodedBound ? bound <= predicted : predicted <= bound;\n      if (boolean(o, 'satisfied', where) !== expected) {\n        throw new Error(\n          `${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`,\n        );\n      }\n      break;\n    }\n    case 'consistency': {\n      const predicted = number(o, 'predicted', where);\n      const approaches = number(o, 'approaches', where);\n      const gap = number(o, 'fractionalGap', where);\n      if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {\n        throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);\n      }\n      // An agreement bound is the record's stated tolerance; an observed difference is derived.\n      if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {\n        const computed = (approaches - predicted) / predicted;\n        if (!agreesToStoredPrecision(gap, computed)) {\n          throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);\n        }\n      }\n      break;\n    }\n    case 'table':\n      if (!Array.isArray(o['rows'])) throw new Error(`${where}: outcome.rows must be an array`);\n      break;\n  }\n  return o as unknown as ConfrontationOutcome;\n}\n\nfunction narrowConfrontations(file: CatalogFileRecord): readonly CatalogConfrontation[] {\n  return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));\n}\n\n/**\n * A relation's confidence is its catalog row's `status`. The row is the one\n * owner, so the file may not store a confidence beside a catalog id; a\n * relation with no row stores its own. A row that is `invalid` has no\n * relation to evaluate.\n */\nfunction deriveConfidence(file: CatalogFileRecord): CatalogFile {\n  const entries = new Map(file.entries.map((entry) => [entry.id, entry]));\n  const confrontations = narrowConfrontations(file);\n  const relations = file.relations.map((relation): CatalogRelation => {\n    if (relation.catalogId === null) {\n      if (relation.confidence === undefined) {\n        throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);\n      }\n      return { ...relation, confidence: relation.confidence };\n    }\n    if (relation.confidence !== undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);\n    }\n    const entry = entries.get(relation.catalogId);\n    if (entry === undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);\n    }\n    if (entry.status === 'invalid') {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);\n    }\n    return { ...relation, confidence: entry.status };\n  });\n  return { ...file, relations, confrontations };\n}\n\n/**\n * The validity clause a parameter's sign states, in the relation's own source\n * name. An absolute temperature is nonnegative unless the parameter says `any`.\n */\nfunction signClause(parameter: CatalogEvaluatorParameter, source: string): string | undefined {\n  const sign = parameter.sign ?? (parameter.temperature === 'absolute' ? 'nonnegative' : undefined);\n  if (sign === 'positive') return `${source} > 0`;\n  if (sign === 'nonnegative') return `${source} >= 0`;\n  return undefined;\n}\n\n/**\n * Add the sign clauses the evaluator parameters state to the relation they\n * evaluate. The validity domain is derived from the flags, so a new bridge\n * that flags its inputs cannot leave the domain behind. A clause the record\n * already states is not repeated.\n */\nfunction deriveDomains(file: CatalogFile): CatalogFile {\n  const relations = file.relations.map((relation) => {\n    if (relation.catalogId === null) return relation;\n    const evaluator = file.evaluators.find((row) => row.catalogId === relation.catalogId);\n    if (evaluator === undefined) return relation;\n    const clauses: string[] = [];\n    for (const parameter of evaluator.parameters) {\n      const source =\n        relation.sources.find((name) => name === parameter.key || (relation.aliases[name] ?? []).includes(parameter.key)) ??\n        (relation.sources.includes(parameter.quantity) ? parameter.quantity : undefined);\n      if (source === undefined) continue;\n      const clause = signClause(parameter, source);\n      // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.\n      if (clause !== undefined && !holdsStatesClause(relation.holds, clause)) clauses.push(clause);\n    }\n    if (clauses.length === 0) return relation;\n    const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;\n    return {\n      ...relation,\n      holds: `${stated}${clauses.join(' and ')}`,\n      domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,\n    };\n  });\n  return { ...file, relations };\n}\n\n/**\n * The loaded catalog from a file record: the records are in id order, each\n * outcome is checked on its kind, each relation takes its row's status as its\n * confidence, then the sign clauses its evaluator parameters state. The\n * production catalog is this function on `data/bridge-catalog.json`.\n * @internal\n */\nexport function loadCatalog(file: CatalogFileRecord): CatalogFile {\n  checkOrder(file);\n  return deriveDomains(deriveConfidence(file));\n}\n\nconst CATALOG = loadCatalog(loadFile());\n\n/** The loaded catalog. */\nexport function bridgeCatalog(): CatalogFile {\n  return CATALOG;\n}\n\n/** Catalog rows, in file order. */\nexport function catalogEntries(): readonly CatalogEntry[] {\n  return CATALOG.entries;\n}\n\n/** Closed forms, in file order. */\nexport function catalogRelations(): readonly CatalogRelation[] {\n  return CATALOG.relations;\n}\n\n/** Evaluator input contracts, in file order. */\nexport function catalogEvaluators(): readonly CatalogEvaluator[] {\n  return CATALOG.evaluators;\n}\n\n/** Confrontations, in file order; one per catalog id. */\nexport function catalogConfrontations(): readonly CatalogConfrontation[] {\n  return CATALOG.confrontations;\n}\n\n/** The negative catalog, in file order. */\nexport function catalogRejections(): readonly CatalogRejection[] {\n  return CATALOG.rejections;\n}\n\nconst ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));\nconst RELATIONS_BY_CATALOG = new Map<number, CatalogRelation[]>();\nfor (const relation of CATALOG.relations) {\n  if (relation.catalogId === null) continue;\n  const list = RELATIONS_BY_CATALOG.get(relation.catalogId);\n  if (list === undefined) RELATIONS_BY_CATALOG.set(relation.catalogId, [relation]);\n  else list.push(relation);\n}\n\n/** The row for a catalog id, or undefined. */\nexport function catalogEntry(id: number): CatalogEntry | undefined {\n  return ENTRY_BY_ID.get(id);\n}\n\n/** Relations whose catalog id is `id`, in file order. */\nexport function relationsForCatalog(id: number): readonly CatalogRelation[] {\n  return RELATIONS_BY_CATALOG.get(id) ?? [];\n}\n\n/**\n * The relation a numeric catalog id evaluates. The graph id `be-<id>` wins\n * when several relations share the id. Otherwise the first relation does.\n */\nexport function primaryRelation(id: number): CatalogRelation | undefined {\n  const rows = relationsForCatalog(id);\n  return rows.find((row) => row.id === `be-${id}`) ?? rows[0];\n}\n\n/**\n * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or\n * undefined when it names none (an atlas id, a canonical id, a quantity).\n * The one place a bridge id is read from text; {@link parseBridgeId} throws\n * where this returns undefined.\n */\nexport function catalogIdNumber(raw: string): number | undefined {\n  const match = /^(?:be-)?(\\d+)$/i.exec(raw.trim());\n  return match === null ? undefined : Number(match[1]);\n}\n\n/**\n * Parse a catalog id from a number or from text the caller typed.\n * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.\n */\nexport function parseBridgeId(bridgeId: number | string): number {\n  if (typeof bridgeId === 'number') {\n    if (!Number.isInteger(bridgeId)) {\n      throw new RangeError(`parseBridgeId: ${bridgeId} is not an integer catalog id`);\n    }\n    return bridgeId;\n  }\n  const id = catalogIdNumber(bridgeId);\n  if (id === undefined) {\n    throw new TypeError(`parseBridgeId: '${bridgeId}' is not a catalog id`);\n  }\n  return id;\n}\n\n/** Graph id for a catalog number: the stable key, not a switch. */\nexport function catalogEdgeKey(id: number): string {\n  return `be-${id}`;\n}\n"]}
+{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAcvD;;;;GAIG;AACH,SAAS,QAAQ;IACf,OAAO,eAAe,CAAC,qBAAqB,CAAsB,CAAC;AACrE,CAAC;AAED,gFAAgF;AAChF,SAAS,UAAU,CAAC,IAAuB;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;QACpC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,mCAAmC,OAAO,kBAAkB,QAAQ,qCAAqC,CAAC,CAAC;QAC7H,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,yBAAyB,CAAC,CAAC;QAC7H,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,GAAG,CAAC,SAAS,uBAAuB,CAAC,CAAC;QAC1H,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,oBAAoB,CAAC,CAAC;QAC5H,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAU,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,0BAA0B,CAAC,CAAC;IACtH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAW,EAAE;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,oBAAoB,CAAC,CAAC;IAC1F,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;GAKG;AACH,yJAAyJ;AACzJ,SAAS,uBAAuB,CAAC,MAAc,EAAE,QAAgB;IAC/D,OAAO,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED,+FAA+F;AAC/F,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAAc;IACtD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,SAAS,CAAC;QACR,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;QAC/C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,GAA+B;IAClD,MAAM,KAAK,GAAG,2CAA2C,GAAG,CAAC,SAAS,EAAE,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,kBAAkB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,2BAA2B,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9H,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,OAAO,EAAE,CAAC;YACb,yFAAyF;YACzF,+EAA+E;YAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,MAAM,0CAA0C,QAAQ,EAAE,CAAC,CAAC;YACnH,CAAC;YACD,IAAI,OAAO,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0DAA0D,QAAQ,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,2FAA2F;YAC3F,8FAA8F;YAC9F,MAAM,YAAY,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,eAAe,CAAC;YAC1D,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,KAAK,CAAC;YACxE,IAAI,OAAO,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,+BAA+B,YAAY,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,KAAK,SAAS,OAAO,KAAK,GAAG,CAC/H,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,EAAE,CAAC;gBACjG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,8DAA8D,CAAC,CAAC;YAC1F,CAAC;YACD,0FAA0F;YAC1F,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACtE,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;gBACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,2BAA2B,GAAG,gDAAgD,QAAQ,EAAE,CAAC,CAAC;gBACpH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;YAC1F,MAAM;IACV,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAuB;IACnD,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACrC,WAAW,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAuB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAmB,EAAE;QACjE,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,uCAAuC,CAAC,CAAC;YAC5G,CAAC;YACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,qDAAqD,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,gCAAgC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QACzH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,2CAA2C,CAAC,CAAC;QAChH,CAAC;QACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,SAAoC,EAAE,MAAc;IACtE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClG,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,GAAG,MAAM,MAAM,CAAC;IAChD,IAAI,IAAI,KAAK,aAAa;QAAE,OAAO,GAAG,MAAM,OAAO,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAChD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;YAAE,OAAO,QAAQ,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjH,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7C,iFAAiF;YACjF,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC;QAChF,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;IACrE,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,UAAU,CAAC,IAAI,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;AAExC,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC","sourcesContent":["/**\n * The catalog loader. This module is the only place that parses a bridge id\n * out of text. Everywhere else reads the loaded records.\n *\n * @module bridges/catalog-load\n */\n\nimport { residualInSigma } from './observations/types.js';\nimport { withinMixed } from '../core/compare.js';\nimport { checkedDataFile } from '../core/data-file.js';\nimport type {\n  CatalogConfrontation,\n  CatalogConfrontationRecord,\n  CatalogEntry,\n  CatalogEvaluator,\n  CatalogEvaluatorParameter,\n  CatalogFile,\n  CatalogFileRecord,\n  CatalogRejection,\n  CatalogRelation,\n} from './catalog-types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\n\n/**\n * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`\n * (every record's `type`, the relation, evaluator, parameter and confrontation\n * shapes). What a schema cannot state is checked by {@link loadCatalog}.\n */\nfunction loadFile(): CatalogFileRecord {\n  return checkedDataFile('bridge-catalog.json') as CatalogFileRecord;\n}\n\n/** Records in ascending id order; a duplicate or a disordered id is refused. */\nfunction checkOrder(file: CatalogFileRecord): void {\n  for (let i = 1; i < file.entries.length; i += 1) {\n    const previous = file.entries[i - 1]!.id;\n    const current = file.entries[i]!.id;\n    if (current <= previous) {\n      throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);\n    }\n  }\n  const seen = new Set<number>();\n  for (const row of file.confrontations) {\n    if (seen.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);\n    seen.add(row.catalogId);\n  }\n  const rejected = new Set<number>();\n  const ids = new Set(file.entries.map((entry) => entry.id));\n  for (const row of file.rejections) {\n    if (!ids.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);\n    if (rejected.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);\n    rejected.add(row.catalogId);\n  }\n}\n\nconst number = (o: Readonly<Record<string, unknown>>, key: string, where: string): number => {\n  const v = o[key];\n  if (typeof v !== 'number' || !Number.isFinite(v)) throw new Error(`${where}: outcome.${key} must be a finite number`);\n  return v;\n};\nconst boolean = (o: Readonly<Record<string, unknown>>, key: string, where: string): boolean => {\n  const v = o[key];\n  if (typeof v !== 'boolean') throw new Error(`${where}: outcome.${key} must be a boolean`);\n  return v;\n};\n\n/**\n * The outcome of one confrontation, checked arm by arm on its `kind`. The\n * schema states the shared fields (`kind`, `units`, `provenance`, the data\n * handling); the fields each arm must carry are checked here, so the loaded\n * record is a {@link ConfrontationOutcome} by inspection, not by assertion.\n */\n/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */\nfunction agreesToStoredPrecision(stored: number, computed: number): boolean {\n  return withinMixed(stored, computed, 1e-3);\n}\n\n/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */\nfunction holdsStatesClause(holds: string, clause: string): boolean {\n  let from = 0;\n  for (;;) {\n    const at = holds.indexOf(clause, from);\n    if (at < 0) return false;\n    const before = at === 0 ? ' ' : holds[at - 1]!;\n    if (!/[A-Za-z0-9_-]/.test(before)) return true;\n    from = at + 1;\n  }\n}\n\n/**\n * Checks `row.outcome` arm by arm on the record's `kind` and narrows the row to\n * a loaded {@link CatalogConfrontation}: an assertion guard, so the loaded\n * record is a `ConfrontationOutcome` by inspection, not by a cast. A field\n * that is missing or of the wrong type throws naming the record.\n */\nfunction readOutcome(row: CatalogConfrontationRecord): asserts row is CatalogConfrontationRecord & CatalogConfrontation {\n  const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;\n  const o = row.outcome;\n  if (o['kind'] !== row.kind) throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);\n  switch (row.kind) {\n    case 'value': {\n      // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored\n      // residual or verdict that disagrees with |predicted − observed|/σ is refused.\n      const predicted = number(o, 'predicted', where);\n      const observed = number(o, 'observed', where);\n      const sigma = number(o, 'sigma', where);\n      const stored = number(o, 'residualInSigma', where);\n      const computed = residualInSigma(predicted, observed, sigma);\n      if (!agreesToStoredPrecision(stored, computed)) {\n        throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);\n      }\n      if (boolean(o, 'withinObserved', where) !== computed <= 1) {\n        throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);\n      }\n      break;\n    }\n    case 'upper-bound': {\n      const predicted = number(o, 'predicted', where);\n      const bound = number(o, 'bound', where);\n      // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or\n      // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.\n      const encodedBound = o['predictedIs'] === 'encoded-bound';\n      const expected = encodedBound ? bound <= predicted : predicted <= bound;\n      if (boolean(o, 'satisfied', where) !== expected) {\n        throw new Error(\n          `${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`,\n        );\n      }\n      break;\n    }\n    case 'consistency': {\n      const predicted = number(o, 'predicted', where);\n      const approaches = number(o, 'approaches', where);\n      const gap = number(o, 'fractionalGap', where);\n      if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {\n        throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);\n      }\n      // An agreement bound is the record's stated tolerance; an observed difference is derived.\n      if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {\n        const computed = (approaches - predicted) / predicted;\n        if (!agreesToStoredPrecision(gap, computed)) {\n          throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);\n        }\n      }\n      break;\n    }\n    case 'table':\n      if (!Array.isArray(o['rows'])) throw new Error(`${where}: outcome.rows must be an array`);\n      break;\n  }\n}\n\nfunction narrowConfrontations(file: CatalogFileRecord): readonly CatalogConfrontation[] {\n  return file.confrontations.map((row) => {\n    readOutcome(row);\n    return row;\n  });\n}\n\n/**\n * A relation's confidence is its catalog row's `status`. The row is the one\n * owner, so the file may not store a confidence beside a catalog id; a\n * relation with no row stores its own. A row that is `invalid` has no\n * relation to evaluate.\n */\nfunction deriveConfidence(file: CatalogFileRecord): CatalogFile {\n  const entries = new Map(file.entries.map((entry) => [entry.id, entry]));\n  const confrontations = narrowConfrontations(file);\n  const relations = file.relations.map((relation): CatalogRelation => {\n    if (relation.catalogId === null) {\n      if (relation.confidence === undefined) {\n        throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);\n      }\n      return { ...relation, confidence: relation.confidence };\n    }\n    if (relation.confidence !== undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);\n    }\n    const entry = entries.get(relation.catalogId);\n    if (entry === undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);\n    }\n    if (entry.status === 'invalid') {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);\n    }\n    return { ...relation, confidence: entry.status };\n  });\n  return { ...file, relations, confrontations };\n}\n\n/**\n * The validity clause a parameter's sign states, in the relation's own source\n * name. An absolute temperature is nonnegative unless the parameter says `any`.\n */\nfunction signClause(parameter: CatalogEvaluatorParameter, source: string): string | undefined {\n  const sign = parameter.sign ?? (parameter.temperature === 'absolute' ? 'nonnegative' : undefined);\n  if (sign === 'positive') return `${source} > 0`;\n  if (sign === 'nonnegative') return `${source} >= 0`;\n  return undefined;\n}\n\n/**\n * Add the sign clauses the evaluator parameters state to the relation they\n * evaluate. The validity domain is derived from the flags, so a new bridge\n * that flags its inputs cannot leave the domain behind. A clause the record\n * already states is not repeated.\n */\nfunction deriveDomains(file: CatalogFile): CatalogFile {\n  const relations = file.relations.map((relation) => {\n    if (relation.catalogId === null) return relation;\n    const evaluator = file.evaluators.find((row) => row.catalogId === relation.catalogId);\n    if (evaluator === undefined) return relation;\n    const clauses: string[] = [];\n    for (const parameter of evaluator.parameters) {\n      const source =\n        relation.sources.find((name) => name === parameter.key || (relation.aliases[name] ?? []).includes(parameter.key)) ??\n        (relation.sources.includes(parameter.quantity) ? parameter.quantity : undefined);\n      if (source === undefined) continue;\n      const clause = signClause(parameter, source);\n      // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.\n      if (clause !== undefined && !holdsStatesClause(relation.holds, clause)) clauses.push(clause);\n    }\n    if (clauses.length === 0) return relation;\n    const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;\n    return { ...relation, holds: `${stated}${clauses.join(' and ')}` };\n  });\n  return { ...file, relations };\n}\n\n/**\n * The loaded catalog from a file record: the records are in id order, each\n * outcome is checked on its kind, each relation takes its row's status as its\n * confidence, then the sign clauses its evaluator parameters state. The\n * production catalog is this function on `data/bridge-catalog.json`.\n * @internal\n */\nexport function loadCatalog(file: CatalogFileRecord): CatalogFile {\n  checkOrder(file);\n  return deriveDomains(deriveConfidence(file));\n}\n\nconst CATALOG = loadCatalog(loadFile());\n\n/** The loaded catalog. */\nexport function bridgeCatalog(): CatalogFile {\n  return CATALOG;\n}\n\n/** Catalog rows, in file order. */\nexport function catalogEntries(): readonly CatalogEntry[] {\n  return CATALOG.entries;\n}\n\n/** Closed forms, in file order. */\nexport function catalogRelations(): readonly CatalogRelation[] {\n  return CATALOG.relations;\n}\n\n/** Evaluator input contracts, in file order. */\nexport function catalogEvaluators(): readonly CatalogEvaluator[] {\n  return CATALOG.evaluators;\n}\n\n/** Confrontations, in file order; one per catalog id. */\nexport function catalogConfrontations(): readonly CatalogConfrontation[] {\n  return CATALOG.confrontations;\n}\n\n/** The negative catalog, in file order. */\nexport function catalogRejections(): readonly CatalogRejection[] {\n  return CATALOG.rejections;\n}\n\nconst ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));\nconst RELATIONS_BY_CATALOG = new Map<number, CatalogRelation[]>();\nfor (const relation of CATALOG.relations) {\n  if (relation.catalogId === null) continue;\n  const list = RELATIONS_BY_CATALOG.get(relation.catalogId);\n  if (list === undefined) RELATIONS_BY_CATALOG.set(relation.catalogId, [relation]);\n  else list.push(relation);\n}\n\n/** The row for a catalog id, or undefined. */\nexport function catalogEntry(id: number): CatalogEntry | undefined {\n  return ENTRY_BY_ID.get(id);\n}\n\n/** Relations whose catalog id is `id`, in file order. */\nexport function relationsForCatalog(id: number): readonly CatalogRelation[] {\n  return RELATIONS_BY_CATALOG.get(id) ?? [];\n}\n\n/**\n * The relation a numeric catalog id evaluates. The graph id `be-<id>` wins\n * when several relations share the id. Otherwise the first relation does.\n */\nexport function primaryRelation(id: number): CatalogRelation | undefined {\n  const rows = relationsForCatalog(id);\n  return rows.find((row) => row.id === `be-${id}`) ?? rows[0];\n}\n\n/**\n * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or\n * undefined when it names none (an atlas id, a canonical id, a quantity).\n * The one place a bridge id is read from text; {@link parseBridgeId} throws\n * where this returns undefined.\n */\nexport function catalogIdNumber(raw: string): number | undefined {\n  const match = /^(?:be-)?(\\d+)$/i.exec(raw.trim());\n  return match === null ? undefined : Number(match[1]);\n}\n\n/**\n * Parse a catalog id from a number or from text the caller typed.\n * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.\n */\nexport function parseBridgeId(bridgeId: number | string): number {\n  if (typeof bridgeId === 'number') {\n    if (!Number.isInteger(bridgeId)) {\n      throw new RangeError(`parseBridgeId: ${bridgeId} is not an integer catalog id`);\n    }\n    return bridgeId;\n  }\n  const id = catalogIdNumber(bridgeId);\n  if (id === undefined) {\n    throw new TypeError(`parseBridgeId: '${bridgeId}' is not a catalog id`);\n  }\n  return id;\n}\n\n/** Graph id for a catalog number: the stable key, not a switch. */\nexport function catalogEdgeKey(id: number): string {\n  return `be-${id}`;\n}\n"]}

package/dist/bridges/catalog-types.d.ts

@@ -13,14 +13,38 @@ import type { BridgeEquationEntry, BridgeEquationStatus } from './types.js';
  * Absence is not a state this record carries.
  */
 export type CatalogFiling = 'standard' | 'cross-domain';
+/**
+ * How far `lean/` proves a catalog record, best first. `full`: the record's
+ * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states
+ * the catalogued equation and the catalog path passes it to `deriveEvidence`.
+ * `weak`: the theorem proves part of the equation (a derivation-step, limit,
+ * reduction, property or cross-check) or its row is unreviewed. `pending`: the
+ * record has no Lean theorem. The order of this array is the rank.
+ *
+ * @internal
+ */
+export declare const PROOF_STATUSES: readonly ['full', 'weak', 'pending'];
+/** One of {@link PROOF_STATUSES}. @internal */
+export type ProofStatus = (typeof PROOF_STATUSES)[number];
 /**
  * One catalog row. The row owns the relation contract, the regime, the
  * conventions and the counterexamples; its relations carry no copy.
  */
 export interface CatalogEntry extends BridgeEquationEntry {
     readonly type: CatalogFiling;
-    /** The PhysJS manifest key. The reference and its kind are that entry's. */
+    /** The key of this record's entry in `formal/lean/manifest.json`. The reference and its kind are that entry's. */
     readonly formalKey?: string;
+    /**
+     * The Lean theorem that manifest entry names, present exactly when
+     * `formalKey` is. A projection of the manifest; `catalogFormalRef` refuses
+     * a record whose theorem is not the manifest's.
+     */
+    readonly theorem?: string;
+    /**
+     * The record's {@link ProofStatus}, a projection of `formalKey` and the
+     * manifest that `catalogProofProblems` checks against its derivation.
+     */
+    readonly proofStatus: ProofStatus;
     readonly dimension?: Dimension;
     /** The confrontation is a caller-supplied table, not a stored outcome. */
     readonly callerTable?: true;
@@ -50,7 +74,6 @@ export interface CatalogRelation {
     readonly sources: readonly string[];
     readonly aliases: Readonly<Record<string, readonly string[]>>;
     readonly holds: string;
-    readonly domain: string;
     readonly confidence: 'established' | 'speculative' | 'highly-speculative';
     readonly citation: string;
     readonly coefficientUnset?: boolean;
@@ -97,6 +120,7 @@ export interface CatalogEvaluatorOutput {
     readonly name: string;
     readonly unit: string;
     readonly meaning: string;
+    /** Read over the evaluator's inputs and `value`. The output is computed when every input it reads is given. */
     readonly expression: string;
 }
 /** The input contract of one catalog evaluator. */

package/dist/bridges/catalog-types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-types.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAEpB;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,cAAc,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,YAAa,SAAQ,mBAAmB;IACvD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC;IAC5B,kGAAkG;IAClG,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC;IAC1B,wDAAwD;IACxD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,gEAAgE;AAChE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,aAAa,GAAG,aAAa,GAAG,oBAAoB,CAAC;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC;IACtC,qGAAqG;IACrG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAED,8CAA8C;AAC9C,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;IAClG,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,KAAK,CAAC;IACnD,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC7G;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,sBAAsB;IACrC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,SAAS,yBAAyB,EAAE,CAAC;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACtD;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,mHAAmH;AACnH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,OAAO,CAAC;IACjE,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,oBAAoB,CAAC;IACvC,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;CACzC;AAED,uGAAuG;AACvG,MAAM,MAAM,0BAA0B,GAAG,IAAI,CAAC,oBAAoB,EAAE,SAAS,CAAC,GAAG;IAC/E,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACrD,CAAC;AAEF,gGAAgG;AAChG,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,MAAM,qBAAqB,GAAG,IAAI,CAAC,eAAe,EAAE,YAAY,CAAC,GAAG;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,eAAe,CAAC,YAAY,CAAC,CAAC;CACrD,CAAC;AAEF,mHAAmH;AACnH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,SAAS,eAAe,EAAE,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzD,0HAA0H;IAC1H,QAAQ,CAAC,aAAa,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E;AAED,uIAAuI;AACvI,MAAM,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,EAAE,WAAW,GAAG,gBAAgB,CAAC,GAAG;IAClF,QAAQ,CAAC,SAAS,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACrD,QAAQ,CAAC,cAAc,EAAE,SAAS,0BAA0B,EAAE,CAAC;CAChE,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhF,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,+FAA+F;IAC/F,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yCAAyC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yCAAyC;AACzC,YAAY,EAAE,oBAAoB,EAAE,CAAC"}
+{"version":3,"file":"catalog-types.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAEpB;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,cAAc,CAAC;AAExD;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,YAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAU,CAAC;AAEnE,+CAA+C;AAC/C,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1D;;;GAGG;AACH,MAAM,WAAW,YAAa,SAAQ,mBAAmB;IACvD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,kHAAkH;IAClH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAClC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC;IAC5B,kGAAkG;IAClG,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC;IAC1B,wDAAwD;IACxD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,gEAAgE;AAChE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,aAAa,GAAG,aAAa,GAAG,oBAAoB,CAAC;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC;IACtC,qGAAqG;IACrG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAED,8CAA8C;AAC9C,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;IAClG,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,KAAK,CAAC;IACnD,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC7G;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,sBAAsB;IACrC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,+GAA+G;IAC/G,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,SAAS,yBAAyB,EAAE,CAAC;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACtD;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,mHAAmH;AACnH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,OAAO,CAAC;IACjE,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,oBAAoB,CAAC;IACvC,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;CACzC;AAED,uGAAuG;AACvG,MAAM,MAAM,0BAA0B,GAAG,IAAI,CAAC,oBAAoB,EAAE,SAAS,CAAC,GAAG;IAC/E,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACrD,CAAC;AAEF,gGAAgG;AAChG,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,MAAM,qBAAqB,GAAG,IAAI,CAAC,eAAe,EAAE,YAAY,CAAC,GAAG;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,eAAe,CAAC,YAAY,CAAC,CAAC;CACrD,CAAC;AAEF,mHAAmH;AACnH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,SAAS,eAAe,EAAE,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzD,0HAA0H;IAC1H,QAAQ,CAAC,aAAa,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E;AAED,uIAAuI;AACvI,MAAM,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,EAAE,WAAW,GAAG,gBAAgB,CAAC,GAAG;IAClF,QAAQ,CAAC,SAAS,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACrD,QAAQ,CAAC,cAAc,EAAE,SAAS,0BAA0B,EAAE,CAAC;CAChE,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhF,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,+FAA+F;IAC/F,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yCAAyC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yCAAyC;AACzC,YAAY,EAAE,oBAAoB,EAAE,CAAC"}

package/dist/bridges/catalog-types.js

@@ -4,5 +4,15 @@
  *
  * @module bridges/catalog-types
  */
-export {};
+/**
+ * How far `lean/` proves a catalog record, best first. `full`: the record's
+ * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states
+ * the catalogued equation and the catalog path passes it to `deriveEvidence`.
+ * `weak`: the theorem proves part of the equation (a derivation-step, limit,
+ * reduction, property or cross-check) or its row is unreviewed. `pending`: the
+ * record has no Lean theorem. The order of this array is the rank.
+ *
+ * @internal
+ */
+export const PROOF_STATUSES = ['full', 'weak', 'pending'];
 //# sourceMappingURL=catalog-types.js.map

package/dist/bridges/catalog-types.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-types.js","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG","sourcesContent":["/**\n * Catalog record shapes. The file `data/bridge-catalog.json` is the source.\n * A bridge number is the `id` field. It is not a code identifier.\n *\n * @module bridges/catalog-types\n */\n\nimport type { Dimension } from '../dimensional/types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\nimport type {\n  BridgeEquationEntry,\n  BridgeEquationStatus,\n} from './types.js';\n\n/**\n * Filing label. `cross-domain` means the equation links quantities or\n * constants from two distinct fields. `standard` means it stays inside one.\n * Absence is not a state this record carries.\n */\nexport type CatalogFiling = 'standard' | 'cross-domain';\n\n/**\n * One catalog row. The row owns the relation contract, the regime, the\n * conventions and the counterexamples; its relations carry no copy.\n */\nexport interface CatalogEntry extends BridgeEquationEntry {\n  readonly type: CatalogFiling;\n  /** The PhysJS manifest key. The reference and its kind are that entry's. */\n  readonly formalKey?: string;\n  readonly dimension?: Dimension;\n  /** The confrontation is a caller-supplied table, not a stored outcome. */\n  readonly callerTable?: true;\n  /** The adjudication is contested; the row stays out of the null-result list until adjudicated. */\n  readonly contested?: true;\n  /** A named statement this row's expression supports. */\n  readonly statement?: string;\n  /**\n   * Scalar expression for a row that has no relation. The structural\n   * registry parses it. It is not a graph edge and it is not evaluated.\n   */\n  readonly scalarExpression?: string;\n}\n\n/** Inputs and the number the engine returns at those inputs. */\nexport interface CatalogReference {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly value: number;\n}\n\n/** One closed form. Several relations may share one catalog id. */\nexport interface CatalogRelation {\n  readonly id: string;\n  readonly catalogId: number | null;\n  readonly kind: 'bridge' | 'law';\n  readonly label: string;\n  readonly expression: string;\n  readonly target: string;\n  readonly sources: readonly string[];\n  readonly aliases: Readonly<Record<string, readonly string[]>>;\n  readonly holds: string;\n  readonly domain: string;\n  readonly confidence: 'established' | 'speculative' | 'highly-speculative';\n  readonly citation: string;\n  readonly coefficientUnset?: boolean;\n  readonly formulaFactors?: Readonly<Record<string, number>>;\n  readonly reference?: CatalogReference;\n  /** A caveat the record states beside its value. The text is the record's; nothing switches on it. */\n  readonly notice?: { readonly text: string };\n}\n\n/** One named input of a catalog evaluator. */\nexport interface CatalogEvaluatorParameter {\n  readonly key: string;\n  readonly quantity: string;\n  readonly symbol: string;\n  readonly unit: string;\n  readonly meaning: string;\n  readonly geometry?: 'radius' | 'diameter' | 'separation' | 'impact-parameter' | 'semi-major-axis';\n  readonly temperature?: 'absolute';\n  /**\n   * The sign this input must have. `positive` is `> 0`, `nonnegative` is `>= 0`,\n   * and `any` states that the quantity is signed and overrides the temperature\n   * rule. An absolute temperature is `nonnegative` when no sign is stated.\n   */\n  readonly sign?: 'positive' | 'nonnegative' | 'any';\n  /** An angular frequency in rad/s. A cycle unit (Hz, rpm) given to it is multiplied by 2π. */\n  readonly angular?: true;\n  readonly alternates?: readonly { readonly key: string; readonly meaning: string; readonly toKey: number }[];\n}\n\n/**\n * A second number the same record returns beside its `value`. The expression\n * reads evaluator parameter keys, the constants, and `value`. It is computed\n * when every parameter key it reads was given; a parameter only an output\n * reads is optional.\n *\n * @public\n */\nexport interface CatalogEvaluatorOutput {\n  /** The result key, with its unit as a suffix (`E_F_J`). */\n  readonly name: string;\n  readonly unit: string;\n  readonly meaning: string;\n  readonly expression: string;\n}\n\n/** The input contract of one catalog evaluator. */\nexport interface CatalogEvaluator {\n  readonly catalogId: number;\n  readonly name: string;\n  readonly parameters: readonly CatalogEvaluatorParameter[];\n  readonly outputs?: readonly CatalogEvaluatorOutput[];\n}\n\n/**\n * The prediction point of a value-kind confrontation, in the evaluator's input\n * spellings. The evaluator at these inputs returns the outcome's `predicted`:\n * its value, or the extra output `output` names.\n */\nexport interface CatalogPrediction {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly output?: string;\n}\n\n/** One committed data confrontation of a catalog record, its outcome narrowed on `kind` when the catalog loads. */\nexport interface CatalogConfrontation {\n  readonly catalogId: number;\n  readonly title: string;\n  readonly kind: 'value' | 'upper-bound' | 'consistency' | 'table';\n  readonly rigor: 'stringent' | 'moderate' | 'loose';\n  readonly outcome: ConfrontationOutcome;\n  readonly prediction?: CatalogPrediction;\n}\n\n/** A confrontation as the file stores it: the outcome is checked arm by arm when the catalog loads. */\nexport type CatalogConfrontationRecord = Omit<CatalogConfrontation, 'outcome'> & {\n  readonly outcome: Readonly<Record<string, unknown>>;\n};\n\n/** One row of the negative catalog: adjudicated not-a-bridge under the membership criterion. */\nexport interface CatalogRejection {\n  readonly catalogId: number;\n  readonly name: string;\n  /** Why the endpoints do NOT differ in regime attributes. */\n  readonly reason: string;\n  readonly citation: string;\n}\n\n/**\n * A relation as the file stores it. `confidence` is stored only on a relation\n * that has no catalog row; a relation with a row takes its row's `status`\n * when the catalog loads, so the two cannot drift.\n */\nexport type CatalogRelationRecord = Omit<CatalogRelation, 'confidence'> & {\n  readonly confidence?: CatalogRelation['confidence'];\n};\n\n/** The loaded catalog: schema 3, entries, relations, evaluators, confrontations, the two ledgers and the spine. */\nexport interface CatalogFile {\n  readonly schemaVersion: 3;\n  readonly packageVersion: string;\n  readonly entries: readonly CatalogEntry[];\n  readonly relations: readonly CatalogRelation[];\n  readonly evaluators: readonly CatalogEvaluator[];\n  readonly confrontations: readonly CatalogConfrontation[];\n  /** The adjudication ledger: recorded verdicts on identification hypotheses. `composition/adjudication.ts` projects it. */\n  readonly adjudications: readonly CatalogAdjudication[];\n  /** The negative catalog. `bridges/rejected.ts` projects it. */\n  readonly rejections: readonly CatalogRejection[];\n  readonly spine: Readonly<Record<string, Readonly<Record<string, number>>>>;\n}\n\n/** The catalog as `data/bridge-catalog.json` stores it, before the loader derives the per-relation fields and narrows each outcome. */\nexport type CatalogFileRecord = Omit<CatalogFile, 'relations' | 'confrontations'> & {\n  readonly relations: readonly CatalogRelationRecord[];\n  readonly confrontations: readonly CatalogConfrontationRecord[];\n};\n\n/**\n * A recorded human verdict on an identification hypothesis `a ≟ b`.\n * - `genuine`  — real physics AND a new link (nothing recorded qualifies yet).\n * - `entailed` — real physics already carried by the L-layer; not a new link.\n * - `decoy`    — dimensional coincidence / no mechanism, including trivial and definitional identifications.\n * - `deferred` — reviewed and consciously parked (not the same as absent, which means never reviewed).\n */\nexport type AdjudicationVerdict = 'genuine' | 'decoy' | 'entailed' | 'deferred';\n\n/** One record of the adjudication ledger in `data/bridge-catalog.json`. */\nexport interface CatalogAdjudication {\n  /** `candidateId(a, b)` of the identification: the two slugs in sorted order, joined by `~`. */\n  readonly id: string;\n  readonly verdict: AdjudicationVerdict;\n  /** Why, condensed from the adjudication document; never machine-generated. */\n  readonly grounds: string;\n  /** Repo-relative path of the adjudication document. */\n  readonly source: string;\n  /** ISO date the verdict was recorded. */\n  readonly date: string;\n}\n\n/** Lifecycle status of a catalog row. */\nexport type { BridgeEquationStatus };\n"]}
+{"version":3,"file":"catalog-types.js","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgBH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAU,CAAC","sourcesContent":["/**\n * Catalog record shapes. The file `data/bridge-catalog.json` is the source.\n * A bridge number is the `id` field. It is not a code identifier.\n *\n * @module bridges/catalog-types\n */\n\nimport type { Dimension } from '../dimensional/types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\nimport type {\n  BridgeEquationEntry,\n  BridgeEquationStatus,\n} from './types.js';\n\n/**\n * Filing label. `cross-domain` means the equation links quantities or\n * constants from two distinct fields. `standard` means it stays inside one.\n * Absence is not a state this record carries.\n */\nexport type CatalogFiling = 'standard' | 'cross-domain';\n\n/**\n * How far `lean/` proves a catalog record, best first. `full`: the record's\n * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states\n * the catalogued equation and the catalog path passes it to `deriveEvidence`.\n * `weak`: the theorem proves part of the equation (a derivation-step, limit,\n * reduction, property or cross-check) or its row is unreviewed. `pending`: the\n * record has no Lean theorem. The order of this array is the rank.\n *\n * @internal\n */\nexport const PROOF_STATUSES = ['full', 'weak', 'pending'] as const;\n\n/** One of {@link PROOF_STATUSES}. @internal */\nexport type ProofStatus = (typeof PROOF_STATUSES)[number];\n\n/**\n * One catalog row. The row owns the relation contract, the regime, the\n * conventions and the counterexamples; its relations carry no copy.\n */\nexport interface CatalogEntry extends BridgeEquationEntry {\n  readonly type: CatalogFiling;\n  /** The key of this record's entry in `formal/lean/manifest.json`. The reference and its kind are that entry's. */\n  readonly formalKey?: string;\n  /**\n   * The Lean theorem that manifest entry names, present exactly when\n   * `formalKey` is. A projection of the manifest; `catalogFormalRef` refuses\n   * a record whose theorem is not the manifest's.\n   */\n  readonly theorem?: string;\n  /**\n   * The record's {@link ProofStatus}, a projection of `formalKey` and the\n   * manifest that `catalogProofProblems` checks against its derivation.\n   */\n  readonly proofStatus: ProofStatus;\n  readonly dimension?: Dimension;\n  /** The confrontation is a caller-supplied table, not a stored outcome. */\n  readonly callerTable?: true;\n  /** The adjudication is contested; the row stays out of the null-result list until adjudicated. */\n  readonly contested?: true;\n  /** A named statement this row's expression supports. */\n  readonly statement?: string;\n  /**\n   * Scalar expression for a row that has no relation. The structural\n   * registry parses it. It is not a graph edge and it is not evaluated.\n   */\n  readonly scalarExpression?: string;\n}\n\n/** Inputs and the number the engine returns at those inputs. */\nexport interface CatalogReference {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly value: number;\n}\n\n/** One closed form. Several relations may share one catalog id. */\nexport interface CatalogRelation {\n  readonly id: string;\n  readonly catalogId: number | null;\n  readonly kind: 'bridge' | 'law';\n  readonly label: string;\n  readonly expression: string;\n  readonly target: string;\n  readonly sources: readonly string[];\n  readonly aliases: Readonly<Record<string, readonly string[]>>;\n  readonly holds: string;\n  readonly confidence: 'established' | 'speculative' | 'highly-speculative';\n  readonly citation: string;\n  readonly coefficientUnset?: boolean;\n  readonly formulaFactors?: Readonly<Record<string, number>>;\n  readonly reference?: CatalogReference;\n  /** A caveat the record states beside its value. The text is the record's; nothing switches on it. */\n  readonly notice?: { readonly text: string };\n}\n\n/** One named input of a catalog evaluator. */\nexport interface CatalogEvaluatorParameter {\n  readonly key: string;\n  readonly quantity: string;\n  readonly symbol: string;\n  readonly unit: string;\n  readonly meaning: string;\n  readonly geometry?: 'radius' | 'diameter' | 'separation' | 'impact-parameter' | 'semi-major-axis';\n  readonly temperature?: 'absolute';\n  /**\n   * The sign this input must have. `positive` is `> 0`, `nonnegative` is `>= 0`,\n   * and `any` states that the quantity is signed and overrides the temperature\n   * rule. An absolute temperature is `nonnegative` when no sign is stated.\n   */\n  readonly sign?: 'positive' | 'nonnegative' | 'any';\n  /** An angular frequency in rad/s. A cycle unit (Hz, rpm) given to it is multiplied by 2π. */\n  readonly angular?: true;\n  readonly alternates?: readonly { readonly key: string; readonly meaning: string; readonly toKey: number }[];\n}\n\n/**\n * A second number the same record returns beside its `value`. The expression\n * reads evaluator parameter keys, the constants, and `value`. It is computed\n * when every parameter key it reads was given; a parameter only an output\n * reads is optional.\n *\n * @public\n */\nexport interface CatalogEvaluatorOutput {\n  /** The result key, with its unit as a suffix (`E_F_J`). */\n  readonly name: string;\n  readonly unit: string;\n  readonly meaning: string;\n  /** Read over the evaluator's inputs and `value`. The output is computed when every input it reads is given. */\n  readonly expression: string;\n}\n\n/** The input contract of one catalog evaluator. */\nexport interface CatalogEvaluator {\n  readonly catalogId: number;\n  readonly name: string;\n  readonly parameters: readonly CatalogEvaluatorParameter[];\n  readonly outputs?: readonly CatalogEvaluatorOutput[];\n}\n\n/**\n * The prediction point of a value-kind confrontation, in the evaluator's input\n * spellings. The evaluator at these inputs returns the outcome's `predicted`:\n * its value, or the extra output `output` names.\n */\nexport interface CatalogPrediction {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly output?: string;\n}\n\n/** One committed data confrontation of a catalog record, its outcome narrowed on `kind` when the catalog loads. */\nexport interface CatalogConfrontation {\n  readonly catalogId: number;\n  readonly title: string;\n  readonly kind: 'value' | 'upper-bound' | 'consistency' | 'table';\n  readonly rigor: 'stringent' | 'moderate' | 'loose';\n  readonly outcome: ConfrontationOutcome;\n  readonly prediction?: CatalogPrediction;\n}\n\n/** A confrontation as the file stores it: the outcome is checked arm by arm when the catalog loads. */\nexport type CatalogConfrontationRecord = Omit<CatalogConfrontation, 'outcome'> & {\n  readonly outcome: Readonly<Record<string, unknown>>;\n};\n\n/** One row of the negative catalog: adjudicated not-a-bridge under the membership criterion. */\nexport interface CatalogRejection {\n  readonly catalogId: number;\n  readonly name: string;\n  /** Why the endpoints do NOT differ in regime attributes. */\n  readonly reason: string;\n  readonly citation: string;\n}\n\n/**\n * A relation as the file stores it. `confidence` is stored only on a relation\n * that has no catalog row; a relation with a row takes its row's `status`\n * when the catalog loads, so the two cannot drift.\n */\nexport type CatalogRelationRecord = Omit<CatalogRelation, 'confidence'> & {\n  readonly confidence?: CatalogRelation['confidence'];\n};\n\n/** The loaded catalog: schema 3, entries, relations, evaluators, confrontations, the two ledgers and the spine. */\nexport interface CatalogFile {\n  readonly schemaVersion: 3;\n  readonly packageVersion: string;\n  readonly entries: readonly CatalogEntry[];\n  readonly relations: readonly CatalogRelation[];\n  readonly evaluators: readonly CatalogEvaluator[];\n  readonly confrontations: readonly CatalogConfrontation[];\n  /** The adjudication ledger: recorded verdicts on identification hypotheses. `composition/adjudication.ts` projects it. */\n  readonly adjudications: readonly CatalogAdjudication[];\n  /** The negative catalog. `bridges/rejected.ts` projects it. */\n  readonly rejections: readonly CatalogRejection[];\n  readonly spine: Readonly<Record<string, Readonly<Record<string, number>>>>;\n}\n\n/** The catalog as `data/bridge-catalog.json` stores it, before the loader derives the per-relation fields and narrows each outcome. */\nexport type CatalogFileRecord = Omit<CatalogFile, 'relations' | 'confrontations'> & {\n  readonly relations: readonly CatalogRelationRecord[];\n  readonly confrontations: readonly CatalogConfrontationRecord[];\n};\n\n/**\n * A recorded human verdict on an identification hypothesis `a ≟ b`.\n * - `genuine`  — real physics AND a new link (nothing recorded qualifies yet).\n * - `entailed` — real physics already carried by the L-layer; not a new link.\n * - `decoy`    — dimensional coincidence / no mechanism, including trivial and definitional identifications.\n * - `deferred` — reviewed and consciously parked (not the same as absent, which means never reviewed).\n */\nexport type AdjudicationVerdict = 'genuine' | 'decoy' | 'entailed' | 'deferred';\n\n/** One record of the adjudication ledger in `data/bridge-catalog.json`. */\nexport interface CatalogAdjudication {\n  /** `candidateId(a, b)` of the identification: the two slugs in sorted order, joined by `~`. */\n  readonly id: string;\n  readonly verdict: AdjudicationVerdict;\n  /** Why, condensed from the adjudication document; never machine-generated. */\n  readonly grounds: string;\n  /** Repo-relative path of the adjudication document. */\n  readonly source: string;\n  /** ISO date the verdict was recorded. */\n  readonly date: string;\n}\n\n/** Lifecycle status of a catalog row. */\nexport type { BridgeEquationStatus };\n"]}

package/dist/bridges/evaluation-errors.d.ts

@@ -72,8 +72,34 @@ export declare class DuplicateInputError extends Error {
  * @internal
  */
 export declare function isInputContractError(error: unknown): error is MissingInputError | UnknownInputError | InputTypeError | NonFiniteInputError | DuplicateInputError | ConstantInputError;
+/**
+ * One input a violated condition reads: the key the caller gave it under, the
+ * name the relation reads it by, and its value. @public
+ */
+export interface DomainInput {
+    readonly key: string;
+    readonly quantity: string;
+    readonly value: number;
+}
+/**
+ * One violated condition of a validity domain. `condition` is the conjunct of
+ * the record's `holds` that failed, written with the caller's keys
+ * (`T_K >= 0`); `key` and `value` are the first input it reads, and `inputs`
+ * every input it reads. A condition that reads no input (a constant check) has
+ * `key` `''` and `value` `NaN`. A later range-per-kind change generates the
+ * same objects. @public
+ */
+export interface DomainViolation {
+    readonly condition: string;
+    readonly key: string;
+    readonly value: number;
+    readonly inputs: readonly DomainInput[];
+}
 /**
  * Evaluation refused: the inputs fall outside the relation's validity domain.
+ * The error lists only the conditions that failed, each with the input keys it
+ * reads and their values; the message is rendered from them, so it cannot name
+ * a condition the check did not run.
  *
  * Honest deviation from design D-3's "domain-incompatible at compose
  * time": domain predicates are opaque functions, so incompatibility is
@@ -84,6 +110,10 @@ export declare function isInputContractError(error: unknown): error is MissingIn
  * @public
  */
 export declare class DomainViolationError extends Error {
-    constructor(message: string);
+    readonly id: string;
+    readonly violations: readonly DomainViolation[];
+    readonly context?: string | undefined;
+    /** The id evaluated, every violated condition, and, for a composed edge, where in the composition it failed. */
+    constructor(id: string, violations: readonly DomainViolation[], context?: string | undefined);
 }
 //# sourceMappingURL=evaluation-errors.d.ts.map

package/dist/bridges/evaluation-errors.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"evaluation-errors.d.ts","sourceRoot":"","sources":["../../src/bridges/evaluation-errors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,4EAA4E;AAC5E,qBAAa,iBAAkB,SAAQ,KAAK;IAGxC,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE;IACnC,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;IAJpC,iEAAiE;IACjE,YACW,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,MAAM,EAAE,SAAS,MAAM,EAAE,EAInC;CACF;AAID,+EAA+E;AAC/E,qBAAa,iBAAkB,SAAQ,KAAK;IAGxC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;IAJpC,0GAA0G;IAC1G,YACW,EAAE,EAAE,MAAM,GAAG,SAAS,EACtB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,SAAS,MAAM,EAAE,EAInC;CACF;AAED,wFAAwF;AACxF,qBAAa,cAAe,SAAQ,SAAS;IAGzC,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM;IAJtB,yEAAyE;IACzE,YACW,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EAIrB;CACF;AAED;;;;GAIG;AACH,qBAAa,mBAAoB,SAAQ,KAAK;IAG1C,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM;IAJxB,+DAA+D;IAC/D,YACW,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EAIvB;CACF;AAED;;;;;;;GAOG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;IAE/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IADhC,8BAA8B;IAC9B,YAAqB,GAAG,EAAE,MAAM,EAG/B;CACF;AAED,yGAAyG;AACzG,qBAAa,mBAAoB,SAAQ,KAAK;IAG1C,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC;IAJ/C,sHAAsH;IACtH,YACW,EAAE,EAAE,MAAM,GAAG,SAAS,EACtB,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,EAQ9C;CACF;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,OAAO,GACb,KAAK,IAAI,iBAAiB,GAAG,iBAAiB,GAAG,cAAc,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CASlI;AAED;;;;;;;;;;GAUG;AACH,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF"}
+{"version":3,"file":"evaluation-errors.d.ts","sourceRoot":"","sources":["../../src/bridges/evaluation-errors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,4EAA4E;AAC5E,qBAAa,iBAAkB,SAAQ,KAAK;IAGxC,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE;IACnC,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;IAJpC,iEAAiE;IACjE,YACW,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,MAAM,EAAE,SAAS,MAAM,EAAE,EAInC;CACF;AAID,+EAA+E;AAC/E,qBAAa,iBAAkB,SAAQ,KAAK;IAGxC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;IAJpC,0GAA0G;IAC1G,YACW,EAAE,EAAE,MAAM,GAAG,SAAS,EACtB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,SAAS,MAAM,EAAE,EAInC;CACF;AAED,wFAAwF;AACxF,qBAAa,cAAe,SAAQ,SAAS;IAGzC,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM;IAJtB,yEAAyE;IACzE,YACW,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EAIrB;CACF;AAED;;;;GAIG;AACH,qBAAa,mBAAoB,SAAQ,KAAK;IAG1C,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM;IAJxB,+DAA+D;IAC/D,YACW,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EAIvB;CACF;AAED;;;;;;;GAOG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;IAE/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IADhC,8BAA8B;IAC9B,YAAqB,GAAG,EAAE,MAAM,EAG/B;CACF;AAED,yGAAyG;AACzG,qBAAa,mBAAoB,SAAQ,KAAK;IAG1C,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM;IACpB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC;IAJ/C,sHAAsH;IACtH,YACW,EAAE,EAAE,MAAM,GAAG,SAAS,EACtB,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,EAQ9C;CACF;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,OAAO,GACb,KAAK,IAAI,iBAAiB,GAAG,iBAAiB,GAAG,cAAc,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CASlI;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;CACzC;AASD;;;;;;;;;;;;;GAaG;AACH,qBAAa,oBAAqB,SAAQ,KAAK;IAG3C,QAAQ,CAAC,EAAE,EAAE,MAAM;IACnB,QAAQ,CAAC,UAAU,EAAE,SAAS,eAAe,EAAE;IAC/C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM;IAJ3B,gHAAgH;IAChH,YACW,EAAE,EAAE,MAAM,EACV,UAAU,EAAE,SAAS,eAAe,EAAE,EACtC,OAAO,CAAC,EAAE,MAAM,YAAA,EAO1B;CACF"}