universal-physics-tensor 9.0.0 → 10.0.0

package/dist/bridges/membership.js

@@ -8,7 +8,8 @@
  * not yet graph-encoded — the `bridges: [a, b]` tuple is the proxy.
  *
  * Adjudication precedence (design r2-4): the negative catalog
- * (`rejected.ts`) overlays the tuple proxy — an id listed there is
+ * (the `rejections` ledger of `data/bridge-catalog.json`, projected by
+ * `rejected.ts`) overlays the tuple proxy — an id listed there is
  * `'not-a-bridge'` regardless of its tuple (the repo's
  * `['unknown','unknown']` convention historically marked NOT-A-BRIDGE
  * entries, so the tuple alone cannot distinguish "rejected" from
@@ -17,7 +18,7 @@
  *
  * @module bridges/membership
  */
-import { REJECTED_BRIDGE_IDS } from './rejected.js';
+import { REJECTED_BRIDGE_ADJUDICATIONS, REJECTED_BRIDGE_IDS } from './rejected.js';
 /**
  * Apply the membership criterion to one catalog entry (tuple proxy +
  * rejected-registry overlay).
@@ -52,8 +53,6 @@ export function adjudicateCatalog(catalog) {
     }
     return { bridges, notABridges, unadjudicated };
 }
-// Re-exports: the negative catalog travels with the criterion it
-// overlays (v0.8.0 punch-list — replaced the membership-surface.ts
-// barrel indirection).
-export { REJECTED_BRIDGE_ADJUDICATIONS, REJECTED_BRIDGE_IDS } from './rejected.js';
+// Re-exports: the negative catalog travels with the criterion it overlays.
+export { REJECTED_BRIDGE_ADJUDICATIONS, REJECTED_BRIDGE_IDS };
 //# sourceMappingURL=membership.js.map

package/dist/bridges/membership.js.map

@@ -1 +1 @@
-{"version":3,"file":"membership.js","sourceRoot":"","sources":["../../src/bridges/membership.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AAKpD;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA0B;IAC9D,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAAE,OAAO,cAAc,CAAC;IAC7D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC7B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IAC/D,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC7C,CAAC;AASD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAA2C;IAE3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,OAAO,KAAK,QAAQ;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAC5C,IAAI,OAAO,KAAK,cAAc;YAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YAC3D,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AACjD,CAAC;AAED,iEAAiE;AACjE,mEAAmE;AACnE,uBAAuB;AACvB,OAAO,EAAE,6BAA6B,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC"}
+{"version":3,"file":"membership.js","sourceRoot":"","sources":["../../src/bridges/membership.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,6BAA6B,EAAE,mBAAmB,EAAmC,MAAM,eAAe,CAAC;AAKpH;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA0B;IAC9D,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAAE,OAAO,cAAc,CAAC;IAC7D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC7B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IAC/D,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC7C,CAAC;AASD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAA2C;IAE3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,OAAO,KAAK,QAAQ;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAC5C,IAAI,OAAO,KAAK,cAAc;YAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YAC3D,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AACjD,CAAC;AAED,2EAA2E;AAC3E,OAAO,EAAE,6BAA6B,EAAE,mBAAmB,EAAE,CAAC","sourcesContent":["/**\n * Bridge-membership criterion (v0.8.0 G-2) — the computable form.\n *\n * **Criterion:** *a bridge is an edge whose endpoint quantities differ\n * in at least one regime attribute; a law is an edge whose endpoints\n * share all stated regime attributes.* For graph edges this is\n * `regimesDiffer` (src/composition/quantity.ts). For catalog entries —\n * not yet graph-encoded — the `bridges: [a, b]` tuple is the proxy.\n *\n * Adjudication precedence (design r2-4): the negative catalog\n * (the `rejections` ledger of `data/bridge-catalog.json`, projected by\n * `rejected.ts`) overlays the tuple proxy — an id listed there is\n * `'not-a-bridge'` regardless of its tuple (the repo's\n * `['unknown','unknown']` convention historically marked NOT-A-BRIDGE\n * entries, so the tuple alone cannot distinguish \"rejected\" from\n * \"never adjudicated\"). Only after the overlay does an\n * `'unknown'`-containing tuple mean `'unadjudicated'`.\n *\n * @module bridges/membership\n */\n\nimport type { BridgeEquationEntry } from './index.js';\nimport { REJECTED_BRIDGE_ADJUDICATIONS, REJECTED_BRIDGE_IDS, type RejectedBridgeAdjudication } from './rejected.js';\n\n/** Adjudication verdict for a catalog entry. @public */\nexport type BridgeVerdict = 'bridge' | 'not-a-bridge' | 'unadjudicated';\n\n/**\n * Apply the membership criterion to one catalog entry (tuple proxy +\n * rejected-registry overlay).\n *\n * @public\n */\nexport function adjudicateBridgeEntry(entry: BridgeEquationEntry): BridgeVerdict {\n  if (REJECTED_BRIDGE_IDS.has(entry.id)) return 'not-a-bridge';\n  const [a, b] = entry.bridges;\n  if (a === 'unknown' || b === 'unknown') return 'unadjudicated';\n  return a === b ? 'not-a-bridge' : 'bridge';\n}\n\n/** Whole-catalog adjudication report. @public */\nexport interface CatalogAdjudicationReport {\n  readonly bridges: ReadonlyArray<number>;\n  readonly notABridges: ReadonlyArray<number>;\n  readonly unadjudicated: ReadonlyArray<number>;\n}\n\n/**\n * Adjudicate every entry of a catalog under the membership criterion.\n *\n * @public\n */\nexport function adjudicateCatalog(\n  catalog: ReadonlyArray<BridgeEquationEntry>,\n): CatalogAdjudicationReport {\n  const bridges: number[] = [];\n  const notABridges: number[] = [];\n  const unadjudicated: number[] = [];\n  for (const entry of catalog) {\n    const verdict = adjudicateBridgeEntry(entry);\n    if (verdict === 'bridge') bridges.push(entry.id);\n    else if (verdict === 'not-a-bridge') notABridges.push(entry.id);\n    else unadjudicated.push(entry.id);\n  }\n  return { bridges, notABridges, unadjudicated };\n}\n\n// Re-exports: the negative catalog travels with the criterion it overlays.\nexport { REJECTED_BRIDGE_ADJUDICATIONS, REJECTED_BRIDGE_IDS };\nexport type { RejectedBridgeAdjudication };\n"]}

package/dist/bridges/notices.js.map

@@ -1 +1 @@
-{"version":3,"file":"notices.js","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,sCAAsC,CAAC;AAGrE,kEAAkE;AAClE,SAAS,WAAW,CAAC,UAAkB;IACrC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,eAAe,CAAC,QAAyB;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpE,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IAChG,OAAO,KAAK,CAAC;AACf,CAAC"}
+{"version":3,"file":"notices.js","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,sCAAsC,CAAC;AAGrE,kEAAkE;AAClE,SAAS,WAAW,CAAC,UAAkB;IACrC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,eAAe,CAAC,QAAyB;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpE,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IAChG,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * The caveats printed beside a relation's value: the record's own notice, and\n * the note of every registered constant its expression names. No caller\n * switches on a notice; the text is the record's or the constant's.\n *\n * @module bridges/notices\n */\n\nimport { constantNotes } from '../dimensional/symbolic-constants.js';\nimport type { CatalogRelation } from './catalog-types.js';\n\n/** Identifiers in an expression, in order of first appearance. */\nfunction identifiers(expression: string): string[] {\n  return [...new Set(expression.match(/[A-Za-z_][A-Za-z0-9_]*/g) ?? [])];\n}\n\n/** The caveats to print beside `relation`'s value. @internal */\nexport function relationNotices(relation: CatalogRelation): string[] {\n  const notes: string[] = [];\n  if (relation.notice !== undefined) notes.push(relation.notice.text);\n  for (const note of constantNotes(identifiers(relation.expression))) notes.push(`note: ${note}`);\n  return notes;\n}\n"]}

package/dist/bridges/observations/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/bridges/observations/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAwKH,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,SAAiB,EAAE,QAAgB,EAAE,KAAa;IAChF,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;AAChD,CAAC;AAeD;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,CAAyD;IAEzD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAAC,6DAA6D,CAAC,CAAC;IACtF,CAAC;IACD,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtE,MAAM,cAAc,GAAG,CAAC,CAAC,eAAe,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;IACxF,MAAM,UAAU,GAAG,oCAA6C,CAAC;IACjE,IAAI,CAAC,CAAC,WAAW,KAAK,aAAa,EAAE,CAAC;QACpC,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAAC,iEAAiE,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,IAAI,EAAE,kCAAkC,EAAE,WAAW,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;IAChJ,CAAC;IACD,OAAO;QACL,kBAAkB;QAClB,UAAU;QACV,cAAc;QACd,IAAI,EAAE,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,gCAAgC;QACvE,WAAW,EAAE,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,cAAc;KAC7F,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,mBAAmB,CAAC,UAAqC;IACvE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9E,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/bridges/observations/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAwKH,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,SAAiB,EAAE,QAAgB,EAAE,KAAa;IAChF,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;AAChD,CAAC;AAeD;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,CAAyD;IAEzD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAAC,6DAA6D,CAAC,CAAC;IACtF,CAAC;IACD,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtE,MAAM,cAAc,GAAG,CAAC,CAAC,eAAe,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;IACxF,MAAM,UAAU,GAAG,oCAA6C,CAAC;IACjE,IAAI,CAAC,CAAC,WAAW,KAAK,aAAa,EAAE,CAAC;QACpC,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAAC,iEAAiE,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,IAAI,EAAE,kCAAkC,EAAE,WAAW,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;IAChJ,CAAC;IACD,OAAO;QACL,kBAAkB;QAClB,UAAU;QACV,cAAc;QACd,IAAI,EAAE,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,gCAAgC;QACvE,WAAW,EAAE,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,cAAc;KAC7F,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,mBAAmB,CAAC,UAAqC;IACvE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9E,CAAC","sourcesContent":["/**\n * Typed observation + confrontation-outcome layer for `upt confront`.\n * The outcome is a discriminated union on `kind` so each confrontation\n * carries only the fields it can honestly populate (no NaN placeholders).\n *\n * @module bridges/observations/types\n */\n\n/** Provenance every observation record must carry. @public */\nexport interface ObservationProvenance {\n  /** Paper + locus, e.g. \"Bertotti-Iess-Tortora 2003, Nature 425:374\". */\n  readonly citation: string;\n  readonly year: number;\n  /** ISO date the value was transcribed into the repo. */\n  readonly retrieved: string;\n  /** Caveats: what was digitized, unit conversions, model conventions. */\n  readonly note?: string;\n}\n\n/** One named uncertainty component (e.g. statistical vs systematic). @public */\nexport interface SigmaComponent {\n  readonly label: string;\n  readonly value: number;\n}\n\n/** How the observation constrains the prediction. @public */\nexport type ObservationKind = 'value' | 'upper-bound' | 'consistency' | 'table';\n\n/**\n * Where in this repository the support for a recorded statement is written:\n * a path from the repository root, and either a verbatim `quote` that must\n * occur in that file or a `symbol` the file must declare. A reference that\n * resolves shows only that the cited text exists; it does not show that the\n * statement it supports is true, nor that the text covers every clause.\n *\n * @public\n */\nexport type SourceRef =\n  | { readonly file: string; readonly quote: string }\n  | { readonly file: string; readonly symbol: string };\n\n/** One or more references; a statement is never sourced by nothing. @public */\nexport type SourceRefs = readonly [SourceRef, ...SourceRef[]];\n\n/**\n * What was done to the source's number before it reached the comparison\n * (averaging, selection, conversion, encoding of a stated agreement).\n * `source` names what supports the statement. `not-recorded` means the record\n * states nothing — it is not \"no preprocessing\".\n *\n * @public\n */\nexport type ConfrontationPreprocessing =\n  | { readonly state: 'recorded'; readonly statement: string; readonly source: SourceRefs }\n  | { readonly state: 'not-recorded' };\n\n/**\n * Whether the prediction is independent of the measurement it is compared\n * with. Separate from goodness of fit: a record can agree within 1σ and still\n * share an input with its prediction. `no-fitted-parameter`: the prediction\n * takes no parameter fitted to this measurement. `shares-input`: prediction\n * and observation share `shared` (a constant, calibration, baseline, or the\n * value itself). `not-recorded`: the record states neither.\n *\n * @public\n */\nexport type ConfrontationIndependence =\n  | { readonly state: 'no-fitted-parameter'; readonly statement: string; readonly source: SourceRefs }\n  | {\n      readonly state: 'shares-input';\n      readonly shared: string;\n      readonly statement: string;\n      readonly source: SourceRefs;\n    }\n  | { readonly state: 'not-recorded' };\n\n/** Data-handling fields every confrontation outcome carries. @public */\nexport interface ConfrontationDataHandling {\n  readonly preprocessing: ConfrontationPreprocessing;\n  readonly independence: ConfrontationIndependence;\n}\n\n/**\n * Normalized confrontation result — discriminated on `kind`. Each arm\n * carries only the fields it can honestly populate.\n *\n * @public\n */\nexport type ConfrontationOutcome = ConfrontationDataHandling & (\n  | {\n      readonly kind: 'value';\n      readonly predicted: number;\n      readonly observed: number;\n      readonly sigma: number;\n      readonly residualInSigma: number;\n      readonly withinObserved: boolean;\n      readonly units: string;\n      readonly provenance: ObservationProvenance;\n      /**\n       * Present when `observed` is DERIVED from a different measured quantity\n       * rather than measured itself. BE-51's \"observed\" deflection is the\n       * prediction times (1 + γ)/2: VLBI measured γ, not a solar-limb\n       * deflection to 16 digits. The report shows this measurement, and labels\n       * `observed` as derived by `derivation`.\n       */\n      readonly measured?: {\n        readonly quantity: string;\n        readonly value: number;\n        readonly sigma: number;\n        readonly source: string;\n        readonly derivation: string;\n      };\n    }\n  | {\n      readonly kind: 'upper-bound';\n      readonly predicted: number;\n      /** The observed upper limit. */\n      readonly bound: number;\n      readonly satisfied: boolean;\n      /**\n       * What `predicted` is. `'point'` (the default when absent): a predicted\n       * value, satisfied when it lies at or below the observed limit.\n       * `'encoded-bound'`: the bridge's own claim is a range `|x| ≤ predicted`,\n       * satisfied when the observed limit lies inside it (BE-36). The two are\n       * different comparisons and are displayed as such.\n       */\n      readonly predictedIs?: 'point' | 'encoded-bound';\n      /**\n       * Optional honesty caveat surfaced in the confront summary line — e.g. a\n       * one-sided pass where only part of an asymmetric observed interval was\n       * tested against a symmetric encoded bound (BE-36).\n       */\n      readonly caveat?: string;\n      readonly units: string;\n      readonly provenance: ObservationProvenance;\n    }\n  | {\n      readonly kind: 'consistency';\n      readonly predicted: number;\n      readonly approaches: number;\n      /** Holds what `fractionalGapIs` says; the name predates that split. */\n      readonly fractionalGap: number;\n      /**\n       * `'agreement-bound'`: `fractionalGap` is the record's stated tolerance\n       * on |observed − predicted|/|predicted|, NOT a measured difference.\n       * `'observed-difference'`: it is the difference itself, and the outcome\n       * carries no agreement bound. `consistencyComparison` computes the\n       * difference either way.\n       */\n      readonly fractionalGapIs: 'agreement-bound' | 'observed-difference';\n      /**\n       * What `predicted` is. `'reference'` (the default when absent): a reference value the\n       * observation is compared with. `'lower-limit'`: the bridge claims the range\n       * `x ≥ predicted` (BE-21's KSS bound η/s ≥ 1/(4π)), decided by observed ≥ predicted. A lower\n       * limit carries no agreement bound, so it requires `fractionalGapIs: 'observed-difference'`.\n       */\n      readonly predictedIs?: 'reference' | 'lower-limit';\n      readonly units: string;\n      readonly provenance: ObservationProvenance;\n    }\n  | {\n      readonly kind: 'table';\n      readonly rows: ReadonlyArray<{\n        readonly label: string;\n        readonly predicted: number;\n        readonly observed: number;\n        readonly sigma: number;\n        readonly residualInSigma: number;\n      }>;\n      readonly units: string;\n      readonly provenance: ObservationProvenance;\n    }\n);\n\n/** |predicted − observed| in units of the observed 1σ. @public */\nexport function residualInSigma(predicted: number, observed: number, sigma: number): number {\n  if (!(Number.isFinite(sigma) && sigma > 0)) {\n    throw new RangeError('residualInSigma: sigma must be finite and > 0');\n  }\n  return Math.abs(predicted - observed) / sigma;\n}\n\n/** A consistency outcome's actual difference, kept apart from its agreement bound. @public */\nexport interface ConsistencyComparison {\n  /** (observed − predicted) / predicted, signed; \"observed\" is the outcome's `approaches`. */\n  readonly relativeDifference: number;\n  readonly definition: '(observed − predicted) / predicted';\n  /** The record's stated tolerance on |relativeDifference|; null when the outcome carries none. */\n  readonly agreementBound: number | null;\n  /** The rule the decision applies; null when the outcome states none. */\n  readonly rule: '|difference| ≤ agreement bound' | 'observed ≥ predicted lower limit' | null;\n  /** The decision under `rule`: compatible (true) or not (false); null when there is no rule. */\n  readonly withinBound: boolean | null;\n}\n\n/**\n * The actual difference of a consistency outcome, computed from its own\n * predicted and observed values, and the compatibility decision: against its\n * agreement bound when it has one, or observed ≥ predicted when the prediction\n * is a lower limit.\n *\n * @public\n */\nexport function consistencyComparison(\n  o: Extract<ConfrontationOutcome, { kind: 'consistency' }>,\n): ConsistencyComparison {\n  if (!(Number.isFinite(o.predicted) && o.predicted !== 0)) {\n    throw new RangeError('consistencyComparison: predicted must be finite and nonzero');\n  }\n  const relativeDifference = (o.approaches - o.predicted) / o.predicted;\n  const agreementBound = o.fractionalGapIs === 'agreement-bound' ? o.fractionalGap : null;\n  const definition = '(observed − predicted) / predicted' as const;\n  if (o.predictedIs === 'lower-limit') {\n    if (agreementBound !== null) {\n      throw new RangeError('consistencyComparison: a lower limit carries no agreement bound');\n    }\n    return { relativeDifference, definition, agreementBound, rule: 'observed ≥ predicted lower limit', withinBound: o.approaches >= o.predicted };\n  }\n  return {\n    relativeDifference,\n    definition,\n    agreementBound,\n    rule: agreementBound === null ? null : '|difference| ≤ agreement bound',\n    withinBound: agreementBound === null ? null : Math.abs(relativeDifference) <= agreementBound,\n  };\n}\n\n/** Combined 1σ from named components (root-sum-square). @public */\nexport function combineInQuadrature(components: readonly SigmaComponent[]): number {\n  if (components.length === 0) {\n    throw new RangeError('combineInQuadrature: need at least one component');\n  }\n  return Math.sqrt(components.reduce((acc, c) => acc + c.value * c.value, 0));\n}\n"]}

package/dist/bridges/rejected.d.ts

@@ -1,19 +1,15 @@
 /**
- * Negative catalog (v0.8.0 P-4) — NOT-A-BRIDGE adjudications as
- * first-class data.
+ * Negative catalog — NOT-A-BRIDGE adjudications, projected from the
+ * `rejections` ledger of `data/bridge-catalog.json`.
  *
- * Each entry records the outcome of applying the v0.8.0 graph-native
- * membership criterion (*a bridge is an edge whose endpoint quantities
- * differ in at least one regime attribute*) to a catalog row, with the
- * physics reason and a citation. Rejected entries REMAIN in
- * `BRIDGE_EQUATIONS` (their formulas and encodings are still valid
- * physics); this registry is the adjudication overlay consumed by
- * `membership.ts` — an id listed here reports `'not-a-bridge'`
+ * Each record is the outcome of applying the graph-native membership
+ * criterion (*a bridge is an edge whose endpoint quantities differ in at
+ * least one regime attribute*) to a catalog row, with the physics reason and
+ * a citation. Rejected rows REMAIN in `BRIDGE_EQUATIONS` (their formulas are
+ * still valid physics); this projection is the adjudication overlay
+ * `membership.ts` consumes — an id listed here reports `'not-a-bridge'`
  * regardless of its `bridges` tuple (design r2-4 precedence).
  *
- * Recording rejections as data rather than audit-doc prose prevents
- * re-litigation and documents the criterion by counterexample.
- *
  * @module bridges/rejected
  */
 /** A NOT-A-BRIDGE adjudication record. @public */
@@ -26,11 +22,9 @@ export interface RejectedBridgeAdjudication {
     readonly citation: string;
 }
 /**
- * The negative catalog. Adjudicated 2026-06-11 (v0.8.0 Phase 4),
- * upholding five of the BRIDGE-PHYSICS-AUDIT §3 classifications under
- * the graph-native criterion. BE-42 was REVERSED to a bridge (see the
- * catalog entry and `docs/architecture/v0.8.0-catalog-adjudication.md`);
- * BE-44/46/50 remain contested/unadjudicated (same doc, with reasons).
+ * The negative catalog, in ledger order. Adjudicated 2026-06-11 (v0.8.0
+ * Phase 4); BE-42 was REVERSED to a bridge and BE-44/46/50 remain contested
+ * (`docs/architecture/v0.8.0-catalog-adjudication.md`).
  *
  * @public
  */

package/dist/bridges/rejected.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rejected.d.ts","sourceRoot":"","sources":["../../src/bridges/rejected.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,kDAAkD;AAClD,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IACjC,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,6BAA6B,EAAE,aAAa,CAAC,0BAA0B,CAwDjF,CAAC;AAEJ,8DAA8D;AAC9D,eAAO,MAAM,mBAAmB,EAAE,WAAW,CAAC,MAAM,CAEnD,CAAC"}
+{"version":3,"file":"rejected.d.ts","sourceRoot":"","sources":["../../src/bridges/rejected.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,kDAAkD;AAClD,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IACjC,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,6BAA6B,EAAE,aAAa,CAAC,0BAA0B,CAEnF,CAAC;AAEF,8DAA8D;AAC9D,eAAO,MAAM,mBAAmB,EAAE,WAAW,CAAC,MAAM,CAEnD,CAAC"}

package/dist/bridges/rejected.js

@@ -1,81 +1,26 @@
 /**
- * Negative catalog (v0.8.0 P-4) — NOT-A-BRIDGE adjudications as
- * first-class data.
+ * Negative catalog — NOT-A-BRIDGE adjudications, projected from the
+ * `rejections` ledger of `data/bridge-catalog.json`.
  *
- * Each entry records the outcome of applying the v0.8.0 graph-native
- * membership criterion (*a bridge is an edge whose endpoint quantities
- * differ in at least one regime attribute*) to a catalog row, with the
- * physics reason and a citation. Rejected entries REMAIN in
- * `BRIDGE_EQUATIONS` (their formulas and encodings are still valid
- * physics); this registry is the adjudication overlay consumed by
- * `membership.ts` — an id listed here reports `'not-a-bridge'`
+ * Each record is the outcome of applying the graph-native membership
+ * criterion (*a bridge is an edge whose endpoint quantities differ in at
+ * least one regime attribute*) to a catalog row, with the physics reason and
+ * a citation. Rejected rows REMAIN in `BRIDGE_EQUATIONS` (their formulas are
+ * still valid physics); this projection is the adjudication overlay
+ * `membership.ts` consumes — an id listed here reports `'not-a-bridge'`
  * regardless of its `bridges` tuple (design r2-4 precedence).
  *
- * Recording rejections as data rather than audit-doc prose prevents
- * re-litigation and documents the criterion by counterexample.
- *
  * @module bridges/rejected
  */
+import { catalogRejections } from './catalog-load.js';
 /**
- * The negative catalog. Adjudicated 2026-06-11 (v0.8.0 Phase 4),
- * upholding five of the BRIDGE-PHYSICS-AUDIT §3 classifications under
- * the graph-native criterion. BE-42 was REVERSED to a bridge (see the
- * catalog entry and `docs/architecture/v0.8.0-catalog-adjudication.md`);
- * BE-44/46/50 remain contested/unadjudicated (same doc, with reasons).
+ * The negative catalog, in ledger order. Adjudicated 2026-06-11 (v0.8.0
+ * Phase 4); BE-42 was REVERSED to a bridge and BE-44/46/50 remain contested
+ * (`docs/architecture/v0.8.0-catalog-adjudication.md`).
  *
  * @public
  */
-export const REJECTED_BRIDGE_ADJUDICATIONS = [
-    {
-        beId: 28,
-        name: 'Maximum Entropy Production Principle',
-        verdict: 'not-a-bridge',
-        reason: 'The encoded σ = Σᵢ Jᵢ Xᵢ is the definiendum of entropy ' +
-            'production within nonequilibrium thermodynamics — fluxes, ' +
-            'forces, and σ all live in the same classical statistical ' +
-            'regime. The variational MEPP claim (which might bridge) is ' +
-            'not what is encoded (see the catalog entry’s ⚠ warning).',
-        citation: 'Martyushev & Seleznev 2006 Phys. Rep. 426:1',
-    },
-    {
-        beId: 29,
-        name: 'Jarzynski free-energy equality (canonical 1997 form)',
-        verdict: 'not-a-bridge',
-        reason: '⟨e^(−βW)⟩ = e^(−βΔF) relates a nonequilibrium work ' +
-            'distribution to an equilibrium free energy, both within ' +
-            'classical statistical mechanics. Equilibrium-vs-nonequilibrium ' +
-            'status is not one of the regime axes — the endpoints share ' +
-            'scale and force attributes.',
-        citation: 'Jarzynski 1997 PRL 78:2690',
-    },
-    {
-        beId: 32,
-        name: 'Quantum Reference Frame Transformation',
-        verdict: 'not-a-bridge',
-        reason: 'A transformation between quantum descriptions relative to ' +
-            'different reference frames — both endpoints are quantum-scale ' +
-            'quantities; the relation is internal to quantum theory.',
-        citation: 'Giacomini, Castro-Ruiz & Brukner 2019 Nat. Commun. 10:494',
-    },
-    {
-        beId: 35,
-        name: 'Conformal Bootstrap - Physical Operator Equation',
-        verdict: 'not-a-bridge',
-        reason: 'The crossing-symmetry constraint is internal to a CFT’s ' +
-            'operator algebra — a consistency condition within one QFT ' +
-            'regime, not a relation between regimes.',
-        citation: 'Rattazzi, Rychkov, Tonni & Vichi 2008 JHEP 0812:031',
-    },
-    {
-        beId: 40,
-        name: 'Composite Higgs Potential',
-        verdict: 'not-a-bridge',
-        reason: 'The SILH effective potential V(h) is a single-regime ' +
-            'electroweak-QFT object; its endpoints (field value, potential ' +
-            'energy density) share scale and force attributes.',
-        citation: 'Giudice, Grojean, Pomarol & Rattazzi 2007 JHEP 0706:045',
-    },
-];
+export const REJECTED_BRIDGE_ADJUDICATIONS = catalogRejections().map((row) => ({ beId: row.catalogId, name: row.name, verdict: 'not-a-bridge', reason: row.reason, citation: row.citation }));
 /** The rejected ids as a Set, for overlay lookups. @public */
 export const REJECTED_BRIDGE_IDS = new Set(REJECTED_BRIDGE_ADJUDICATIONS.map((r) => r.beId));
 //# sourceMappingURL=rejected.js.map

package/dist/bridges/rejected.js.map

@@ -1 +1 @@
-{"version":3,"file":"rejected.js","sourceRoot":"","sources":["../../src/bridges/rejected.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAYH;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,6BAA6B,GACxC;IACE;QACE,IAAI,EAAE,EAAE;QACR,IAAI,EAAE,sCAAsC;QAC5C,OAAO,EAAE,cAAc;QACvB,MAAM,EACJ,yDAAyD;YACzD,4DAA4D;YAC5D,2DAA2D;YAC3D,6DAA6D;YAC7D,0DAA0D;QAC5D,QAAQ,EAAE,6CAA6C;KACxD;IACD;QACE,IAAI,EAAE,EAAE;QACR,IAAI,EAAE,sDAAsD;QAC5D,OAAO,EAAE,cAAc;QACvB,MAAM,EACJ,qDAAqD;YACrD,0DAA0D;YAC1D,iEAAiE;YACjE,6DAA6D;YAC7D,6BAA6B;QAC/B,QAAQ,EAAE,4BAA4B;KACvC;IACD;QACE,IAAI,EAAE,EAAE;QACR,IAAI,EAAE,wCAAwC;QAC9C,OAAO,EAAE,cAAc;QACvB,MAAM,EACJ,4DAA4D;YAC5D,gEAAgE;YAChE,yDAAyD;QAC3D,QAAQ,EAAE,2DAA2D;KACtE;IACD;QACE,IAAI,EAAE,EAAE;QACR,IAAI,EAAE,kDAAkD;QACxD,OAAO,EAAE,cAAc;QACvB,MAAM,EACJ,0DAA0D;YAC1D,4DAA4D;YAC5D,yCAAyC;QAC3C,QAAQ,EAAE,qDAAqD;KAChE;IACD;QACE,IAAI,EAAE,EAAE;QACR,IAAI,EAAE,2BAA2B;QACjC,OAAO,EAAE,cAAc;QACvB,MAAM,EACJ,uDAAuD;YACvD,gEAAgE;YAChE,mDAAmD;QACrD,QAAQ,EAAE,yDAAyD;KACpE;CACF,CAAC;AAEJ,8DAA8D;AAC9D,MAAM,CAAC,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CAC7D,6BAA6B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACjD,CAAC"}
+{"version":3,"file":"rejected.js","sourceRoot":"","sources":["../../src/bridges/rejected.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAYtD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAA8C,iBAAiB,EAAE,CAAC,GAAG,CAC7G,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CACxH,CAAC;AAEF,8DAA8D;AAC9D,MAAM,CAAC,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CAC7D,6BAA6B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACjD,CAAC","sourcesContent":["/**\n * Negative catalog — NOT-A-BRIDGE adjudications, projected from the\n * `rejections` ledger of `data/bridge-catalog.json`.\n *\n * Each record is the outcome of applying the graph-native membership\n * criterion (*a bridge is an edge whose endpoint quantities differ in at\n * least one regime attribute*) to a catalog row, with the physics reason and\n * a citation. Rejected rows REMAIN in `BRIDGE_EQUATIONS` (their formulas are\n * still valid physics); this projection is the adjudication overlay\n * `membership.ts` consumes — an id listed here reports `'not-a-bridge'`\n * regardless of its `bridges` tuple (design r2-4 precedence).\n *\n * @module bridges/rejected\n */\n\nimport { catalogRejections } from './catalog-load.js';\n\n/** A NOT-A-BRIDGE adjudication record. @public */\nexport interface RejectedBridgeAdjudication {\n  readonly beId: number;\n  readonly name: string;\n  readonly verdict: 'not-a-bridge';\n  /** Why the endpoints do NOT differ in regime attributes. */\n  readonly reason: string;\n  readonly citation: string;\n}\n\n/**\n * The negative catalog, in ledger order. Adjudicated 2026-06-11 (v0.8.0\n * Phase 4); BE-42 was REVERSED to a bridge and BE-44/46/50 remain contested\n * (`docs/architecture/v0.8.0-catalog-adjudication.md`).\n *\n * @public\n */\nexport const REJECTED_BRIDGE_ADJUDICATIONS: ReadonlyArray<RejectedBridgeAdjudication> = catalogRejections().map(\n  (row) => ({ beId: row.catalogId, name: row.name, verdict: 'not-a-bridge', reason: row.reason, citation: row.citation }),\n);\n\n/** The rejected ids as a Set, for overlay lookups. @public */\nexport const REJECTED_BRIDGE_IDS: ReadonlySet<number> = new Set(\n  REJECTED_BRIDGE_ADJUDICATIONS.map((r) => r.beId),\n);\n"]}

package/dist/bridges/relation-eval.d.ts

@@ -8,16 +8,15 @@ import { CarrierSignError } from './carrier-sign.js';
 import type { CatalogRelation } from './catalog-types.js';
 /** Thrown when two carrier roles have opposite signs. */
 export { CarrierSignError };
-/** Whether `inputs` satisfy the relation's validity condition. */
+/**
+ * Whether `inputs` satisfy the relation's validity condition. An unbound or
+ * unparsable condition is false; an input that names a constant the relation
+ * does not declare as a source throws `ConstantInputError`.
+ */
 export declare function relationHolds(rel: CatalogRelation, inputs: Readonly<Record<string, number>>): boolean;
 /**
  * The relation's number at `inputs`. The caller has already checked the
  * validity condition. Opposite carrier signs throw {@link CarrierSignError}.
  */
 export declare function evaluateCatalogRelation(rel: CatalogRelation, inputs: Readonly<Record<string, number>>): number;
-/**
- * Recover the one missing finite input that makes the relation equal `target`.
- * A bracket that does not change sign has no root and throws.
- */
-export declare function solveCatalogRelation(rel: CatalogRelation, known: Readonly<Record<string, number>>, unknown: string, target?: number): number;
 //# sourceMappingURL=relation-eval.d.ts.map

package/dist/bridges/relation-eval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relation-eval.d.ts","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAA0B,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAI1D,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AA4D5B,kEAAkE;AAClE,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAOrG;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,eAAe,EACpB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACvC,MAAM,CAiBR;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,eAAe,EACpB,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACvC,OAAO,EAAE,MAAM,EACf,MAAM,SAAI,GACT,MAAM,CA2BR"}
+{"version":3,"file":"relation-eval.d.ts","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAA0B,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAI1D,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AA4D5B;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAOrG;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,eAAe,EACpB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACvC,MAAM,CAiBR"}

package/dist/bridges/relation-eval.js

@@ -41,8 +41,8 @@ function classify(rel) {
             let pos;
             let neg;
             try {
-                pos = evaluateFormula(rel.expression, { ...base, [name]: magnitude });
-                neg = evaluateFormula(rel.expression, { ...base, [name]: -magnitude });
+                pos = evaluateFormula(rel.expression, { ...base, [name]: magnitude }, rel.sources);
+                neg = evaluateFormula(rel.expression, { ...base, [name]: -magnitude }, rel.sources);
             }
             catch {
                 continue;
@@ -72,10 +72,14 @@ function classify(rel) {
     parityCache.set(rel.id, found);
     return found;
 }
-/** Whether `inputs` satisfy the relation's validity condition. */
+/**
+ * Whether `inputs` satisfy the relation's validity condition. An unbound or
+ * unparsable condition is false; an input that names a constant the relation
+ * does not declare as a source throws `ConstantInputError`.
+ */
 export function relationHolds(rel, inputs) {
     try {
-        return holds(rel.holds, inputs, formulaScope(), [...formulaNames()]);
+        return holds(rel.holds, inputs, formulaScope(), [...formulaNames()], rel.sources);
     }
     catch (error) {
         if (error instanceof HoldsError)
@@ -98,39 +102,6 @@ export function evaluateCatalogRelation(rel, inputs) {
             left: named(rel, pair.charge),
             right: named(rel, pair.mobility),
         });
-    return evaluateFormula(rel.expression, adjusted);
-}
-/**
- * Recover the one missing finite input that makes the relation equal `target`.
- * A bracket that does not change sign has no root and throws.
- */
-export function solveCatalogRelation(rel, known, unknown, target = 0) {
-    const f = (value) => evaluateCatalogRelation(rel, { ...known, [unknown]: value }) - target;
-    let lo = 1e-6;
-    let hi = 1;
-    let flo = f(lo);
-    let fhi = f(hi);
-    for (let i = 0; i < 60 && flo * fhi > 0; i += 1) {
-        lo /= 2;
-        hi *= 2;
-        flo = f(lo);
-        fhi = f(hi);
-    }
-    if (!(flo * fhi <= 0)) {
-        throw new Error(`solveCatalogRelation: ${rel.id} has no root for ${unknown}`);
-    }
-    for (let i = 0; i < 80; i += 1) {
-        const mid = (lo + hi) / 2;
-        const fmid = f(mid);
-        if (flo * fmid <= 0) {
-            hi = mid;
-            fhi = fmid;
-        }
-        else {
-            lo = mid;
-            flo = fmid;
-        }
-    }
-    return (lo + hi) / 2;
+    return evaluateFormula(rel.expression, adjusted, rel.sources);
 }
 //# sourceMappingURL=relation-eval.js.map

package/dist/bridges/relation-eval.js.map

@@ -1 +1 @@
-{"version":3,"file":"relation-eval.js","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAE7E,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE/C,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwH,CAAC;AAEpJ,SAAS,KAAK,CAAC,GAAoB,EAAE,IAAY;IAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;AAC3D,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CAAC,GAAoB;IACxC,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;IACpE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,GAAoB;IACpC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA6C,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACnF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAW,CAAC;YAChB,IAAI,GAAW,CAAC;YAChB,IAAI,CAAC;gBACH,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;gBACtE,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC;YACzE,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YAClD,IAAI,MAAM,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,IAAI,KAAK,QAAQ;oBAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,IAAI,KAAK,UAAU;oBAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG;QACZ,IAAI;QACJ,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1F,CAAC;IACF,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,aAAa,CAAC,GAAoB,EAAE,MAAwC;IAC1F,IAAI,CAAC;QACH,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,UAAU;YAAE,OAAO,KAAK,CAAC;QAC9C,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAoB,EACpB,MAAwC;IAExC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,sBAAsB,CACrC,IAAI,EACJ,MAAM,EACN,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EACpB,IAAI,KAAK,SAAS;QAChB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG;YACpC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG;YACtC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;SACjC,CACN,CAAC;IACF,OAAO,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACnD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,GAAoB,EACpB,KAAuC,EACvC,OAAe,EACf,MAAM,GAAG,CAAC;IAEV,MAAM,CAAC,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,uBAAuB,CAAC,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;IAC3G,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAChB,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,EAAE,IAAI,CAAC,CAAC;QACR,EAAE,IAAI,CAAC,CAAC;QACR,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACZ,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,CAAC,EAAE,oBAAoB,OAAO,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;YACpB,EAAE,GAAG,GAAG,CAAC;YACT,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;aAAM,CAAC;YACN,EAAE,GAAG,GAAG,CAAC;YACT,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC"}
+{"version":3,"file":"relation-eval.js","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAE7E,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE/C,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwH,CAAC;AAEpJ,SAAS,KAAK,CAAC,GAAoB,EAAE,IAAY;IAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;AAC3D,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CAAC,GAAoB;IACxC,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;IACpE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,GAAoB;IACpC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA6C,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACnF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAW,CAAC;YAChB,IAAI,GAAW,CAAC;YAChB,IAAI,CAAC;gBACH,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;gBACnF,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YACtF,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YAClD,IAAI,MAAM,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,IAAI,KAAK,QAAQ;oBAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,IAAI,KAAK,UAAU;oBAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG;QACZ,IAAI;QACJ,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1F,CAAC;IACF,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,GAAoB,EAAE,MAAwC;IAC1F,IAAI,CAAC;QACH,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACpF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,UAAU;YAAE,OAAO,KAAK,CAAC;QAC9C,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAoB,EACpB,MAAwC;IAExC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,sBAAsB,CACrC,IAAI,EACJ,MAAM,EACN,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EACpB,IAAI,KAAK,SAAS;QAChB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG;YACpC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG;YACtC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;SACjC,CACN,CAAC;IACF,OAAO,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;AAChE,CAAC","sourcesContent":["/**\n * Evaluate one catalog relation: validity condition, carrier-sign policy,\n * and the parsed expression. No per-equation branch.\n *\n * @module bridges/relation-eval\n */\n\nimport { quantityRecord } from '../dimensional/quantity-registry.js';\nimport { applyCarrierSignPolicy, CarrierSignError } from './carrier-sign.js';\nimport type { CatalogRelation } from './catalog-types.js';\nimport { evaluateFormula, formulaNames, formulaScope } from './expr-parse.js';\nimport { holds, HoldsError } from './holds.js';\n\n/** Thrown when two carrier roles have opposite signs. */\nexport { CarrierSignError };\n\nconst parityCache = new Map<string, { readonly even: readonly string[]; readonly pair?: { readonly charge: string; readonly mobility: string } }>();\n\nfunction named(rel: CatalogRelation, name: string): string {\n  const alias = rel.aliases[name]?.[0];\n  return alias === undefined ? name : `${name} (${alias})`;\n}\n\nfunction signRole(name: string): 'charge' | 'mobility' | undefined {\n  return quantityRecord(name)?.signRole;\n}\n\nfunction sampleInputs(rel: CatalogRelation): Record<string, number> | null {\n  if (rel.reference !== undefined) return { ...rel.reference.inputs };\n  if (rel.sources.length === 0) return {};\n  return null;\n}\n\nfunction classify(rel: CatalogRelation): { even: readonly string[]; pair?: { charge: string; mobility: string } } {\n  const cached = parityCache.get(rel.id);\n  if (cached !== undefined) return cached;\n  const base = sampleInputs(rel);\n  const even: string[] = [];\n  const odd: { charge: string[]; mobility: string[] } = { charge: [], mobility: [] };\n  if (base !== null) {\n    for (const name of rel.sources) {\n      const x = base[name];\n      if (x === undefined || x === 0 || !Number.isFinite(x)) continue;\n      const magnitude = Math.abs(x);\n      let pos: number;\n      let neg: number;\n      try {\n        pos = evaluateFormula(rel.expression, { ...base, [name]: magnitude }, rel.sources);\n        neg = evaluateFormula(rel.expression, { ...base, [name]: -magnitude }, rel.sources);\n      } catch {\n        continue;\n      }\n      if (!Number.isFinite(pos) || !Number.isFinite(neg)) continue;\n      const scale = Math.max(Math.abs(pos), Math.abs(neg), 1);\n      const isEven = Math.abs(pos - neg) <= 1e-8 * scale;\n      const isOdd = Math.abs(pos + neg) <= 1e-8 * scale;\n      if (isEven && !isOdd) even.push(name);\n      if (isOdd && !isEven) {\n        const role = signRole(name);\n        if (role === 'charge') odd.charge.push(name);\n        if (role === 'mobility') odd.mobility.push(name);\n      }\n    }\n  }\n  const charge = odd.charge[0];\n  const mobility = odd.mobility[0];\n  const found = {\n    even,\n    ...(charge !== undefined && mobility !== undefined ? { pair: { charge, mobility } } : {}),\n  };\n  parityCache.set(rel.id, found);\n  return found;\n}\n\n/**\n * Whether `inputs` satisfy the relation's validity condition. An unbound or\n * unparsable condition is false; an input that names a constant the relation\n * does not declare as a source throws `ConstantInputError`.\n */\nexport function relationHolds(rel: CatalogRelation, inputs: Readonly<Record<string, number>>): boolean {\n  try {\n    return holds(rel.holds, inputs, formulaScope(), [...formulaNames()], rel.sources);\n  } catch (error) {\n    if (error instanceof HoldsError) return false;\n    throw error;\n  }\n}\n\n/**\n * The relation's number at `inputs`. The caller has already checked the\n * validity condition. Opposite carrier signs throw {@link CarrierSignError}.\n */\nexport function evaluateCatalogRelation(\n  rel: CatalogRelation,\n  inputs: Readonly<Record<string, number>>,\n): number {\n  const policy = classify(rel);\n  const pair = policy.pair;\n  const adjusted = applyCarrierSignPolicy(\n    null,\n    inputs,\n    new Set(policy.even),\n    pair === undefined\n      ? undefined\n      : {\n          a: inputs[pair.charge] ?? Number.NaN,\n          b: inputs[pair.mobility] ?? Number.NaN,\n          left: named(rel, pair.charge),\n          right: named(rel, pair.mobility),\n        },\n  );\n  return evaluateFormula(rel.expression, adjusted, rel.sources);\n}\n"]}

package/dist/bridges/rhs-registry.js.map

@@ -1 +1 @@
-{"version":3,"file":"rhs-registry.js","sourceRoot":"","sources":["../../src/bridges/rhs-registry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACnF,OAAO,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAEzD,iGAAiG;AACjG,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,4DAA4D;AAC5D,MAAM,CAAC,MAAM,gBAAgB,GAAkC,IAAI,GAAG,CACpE,cAAc,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;IACjC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,UAAU,IAAI,KAAK,CAAC,gBAAgB,CAAC;IACnF,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,sBAAsB,CAAC,UAAU,CAAC,CAAU,CAAC,CAAC;AACnE,CAAC,CAAC,CACH,CAAC"}
+{"version":3,"file":"rhs-registry.js","sourceRoot":"","sources":["../../src/bridges/rhs-registry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACnF,OAAO,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAEzD,iGAAiG;AACjG,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,4DAA4D;AAC5D,MAAM,CAAC,MAAM,gBAAgB,GAAkC,IAAI,GAAG,CACpE,cAAc,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;IACjC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,UAAU,IAAI,KAAK,CAAC,gBAAgB,CAAC;IACnF,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,sBAAsB,CAAC,UAAU,CAAC,CAAU,CAAC,CAAC;AACnE,CAAC,CAAC,CACH,CAAC","sourcesContent":["/**\n * Right-hand side of each catalog id that has a relation, projected from\n * that relation's expression.\n *\n * @module bridges/rhs-registry\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { catalogEntries, parseBridgeId, primaryRelation } from './catalog-load.js';\nimport { parseCatalogExpression } from './expr-parse.js';\n\n/** Parse `42`, `be-42`, or `BE-42` into a catalog id. This module re-exports the only parser. */\nexport { parseBridgeId };\n\n/** Catalog id → expression tree of its primary relation. */\nexport const BRIDGE_RHS_BY_ID: ReadonlyMap<number, ExprNode> = new Map(\n  catalogEntries().flatMap((entry) => {\n    const expression = primaryRelation(entry.id)?.expression ?? entry.scalarExpression;\n    if (expression === undefined) return [];\n    return [[entry.id, parseCatalogExpression(expression)] as const];\n  }),\n);\n"]}

package/dist/bridges/sensitivity.d.ts

@@ -1,16 +1,24 @@
 /**
  * Deciding-measurement elasticity for value-kind confrontations. For each
- * numeric input of a stored prediction point, report the dimensionless
- * log-sensitivity E_i = |∂P/∂x_i|·x_i/P. This ranks which input the
- * prediction depends on most strongly. It is not an uncertainty budget.
+ * input of a stored prediction point, report the dimensionless
+ * log-sensitivity E_i = |∂P/∂x_i|·x_i/P of the number the record predicts.
+ * This ranks which input the prediction depends on most strongly. It is not
+ * an uncertainty budget.
  *
  * @module bridges/sensitivity
  */
+import type { CatalogPrediction } from './catalog-types.js';
 /** One input's elasticity. @public */
 export interface Elasticity {
     readonly input: string;
     readonly elasticity: number;
 }
+/**
+ * The number a confrontation's prediction point yields: the evaluator's value
+ * at the point, or the extra output the prediction names.
+ * @internal
+ */
+export declare function predictedAt(catalogId: number, prediction: CatalogPrediction, inputs: Record<string, number>): number;
 /**
  * Elasticity ranking for a value-kind confrontation that stores a prediction
  * point. `[]` when the record is not value-kind, has no point, or is absent.

package/dist/bridges/sensitivity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sensitivity.d.ts","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAiBD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE,CAUnE"}
+{"version":3,"file":"sensitivity.d.ts","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAG5D,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAiBD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQpH;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE,CASnE"}

package/dist/bridges/sensitivity.js

@@ -1,14 +1,14 @@
 /**
  * Deciding-measurement elasticity for value-kind confrontations. For each
- * numeric input of a stored prediction point, report the dimensionless
- * log-sensitivity E_i = |∂P/∂x_i|·x_i/P. This ranks which input the
- * prediction depends on most strongly. It is not an uncertainty budget.
+ * input of a stored prediction point, report the dimensionless
+ * log-sensitivity E_i = |∂P/∂x_i|·x_i/P of the number the record predicts.
+ * This ranks which input the prediction depends on most strongly. It is not
+ * an uncertainty budget.
  *
  * @module bridges/sensitivity
  */
 import { catalogConfrontations } from './catalog-load.js';
-import { evaluateFormula } from './expr-parse.js';
-import { primaryRelation } from './catalog-load.js';
+import { BRIDGE_EVALUATORS } from './evaluators.js';
 function elasticityOf(predict, point, key) {
     const x = point[key];
     const h = Math.abs(x) * 1e-6 || 1e-12;
@@ -20,6 +20,22 @@ function elasticityOf(predict, point, key) {
         return 0;
     return (Math.abs(dP) * Math.abs(x)) / Math.abs(P);
 }
+/**
+ * The number a confrontation's prediction point yields: the evaluator's value
+ * at the point, or the extra output the prediction names.
+ * @internal
+ */
+export function predictedAt(catalogId, prediction, inputs) {
+    const spec = BRIDGE_EVALUATORS.get(catalogId);
+    if (spec === undefined)
+        throw new Error(`confrontation ${catalogId}: no evaluator predicts it`);
+    const result = spec.run(inputs, prediction.output === undefined ? 'value' : 'all');
+    const key = prediction.output ?? 'value';
+    const value = result[key];
+    if (value === undefined)
+        throw new Error(`confrontation ${catalogId}: the evaluator returns no '${key}' at the prediction point`);
+    return value;
+}
 /**
  * Elasticity ranking for a value-kind confrontation that stores a prediction
  * point. `[]` when the record is not value-kind, has no point, or is absent.
@@ -30,11 +46,9 @@ export function decidingMeasurement(catalogId) {
     const row = catalogConfrontations().find((item) => item.catalogId === catalogId);
     if (row === undefined || row.kind !== 'value' || row.prediction === undefined)
         return [];
-    const relation = primaryRelation(catalogId);
-    if (relation === undefined)
-        return [];
-    const point = { ...row.prediction.inputs };
-    const predict = (inputs) => evaluateFormula(relation.expression, inputs);
+    const prediction = row.prediction;
+    const point = { ...prediction.inputs };
+    const predict = (inputs) => predictedAt(catalogId, prediction, inputs);
     return Object.keys(point)
         .map((key) => ({ input: key, elasticity: elasticityOf(predict, point, key) }))
         .sort((a, b) => b.elasticity - a.elasticity);

package/dist/bridges/sensitivity.js.map

@@ -1 +1 @@
-{"version":3,"file":"sensitivity.js","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAQpD,SAAS,YAAY,CACnB,OAAkD,EAClD,KAA6B,EAC7B,GAAW;IAEX,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,MAAM,GAAG,GAAG,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;IACjF,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;IAC5C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;IAC3C,MAAM,OAAO,GAAG,CAAC,MAA8B,EAAU,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IACzG,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SACtB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;SAC7E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AACjD,CAAC"}
+{"version":3,"file":"sensitivity.js","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAQpD,SAAS,YAAY,CACnB,OAAkD,EAClD,KAA6B,EAC7B,GAAW;IAEX,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAE,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,UAA6B,EAAE,MAA8B;IAC1G,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,4BAA4B,CAAC,CAAC;IAChG,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnF,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,+BAA+B,GAAG,2BAA2B,CAAC,CAAC;IAClI,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,MAAM,GAAG,GAAG,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;IACjF,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;IAClC,MAAM,KAAK,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,CAAC,MAA8B,EAAU,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACvG,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SACtB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;SAC7E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AACjD,CAAC","sourcesContent":["/**\n * Deciding-measurement elasticity for value-kind confrontations. For each\n * input of a stored prediction point, report the dimensionless\n * log-sensitivity E_i = |∂P/∂x_i|·x_i/P of the number the record predicts.\n * This ranks which input the prediction depends on most strongly. It is not\n * an uncertainty budget.\n *\n * @module bridges/sensitivity\n */\n\nimport { catalogConfrontations } from './catalog-load.js';\nimport type { CatalogPrediction } from './catalog-types.js';\nimport { BRIDGE_EVALUATORS } from './evaluators.js';\n\n/** One input's elasticity. @public */\nexport interface Elasticity {\n  readonly input: string;\n  readonly elasticity: number;\n}\n\nfunction elasticityOf(\n  predict: (point: Record<string, number>) => number,\n  point: Record<string, number>,\n  key: string,\n): number {\n  const x = point[key]!;\n  const h = Math.abs(x) * 1e-6 || 1e-12;\n  const up = { ...point, [key]: x + h };\n  const dn = { ...point, [key]: x - h };\n  const P = predict(point);\n  const dP = (predict(up) - predict(dn)) / (2 * h);\n  if (!(Number.isFinite(P) && P !== 0)) return 0;\n  return (Math.abs(dP) * Math.abs(x)) / Math.abs(P);\n}\n\n/**\n * The number a confrontation's prediction point yields: the evaluator's value\n * at the point, or the extra output the prediction names.\n * @internal\n */\nexport function predictedAt(catalogId: number, prediction: CatalogPrediction, inputs: Record<string, number>): number {\n  const spec = BRIDGE_EVALUATORS.get(catalogId);\n  if (spec === undefined) throw new Error(`confrontation ${catalogId}: no evaluator predicts it`);\n  const result = spec.run(inputs, prediction.output === undefined ? 'value' : 'all');\n  const key = prediction.output ?? 'value';\n  const value = result[key];\n  if (value === undefined) throw new Error(`confrontation ${catalogId}: the evaluator returns no '${key}' at the prediction point`);\n  return value;\n}\n\n/**\n * Elasticity ranking for a value-kind confrontation that stores a prediction\n * point. `[]` when the record is not value-kind, has no point, or is absent.\n *\n * @public\n */\nexport function decidingMeasurement(catalogId: number): Elasticity[] {\n  const row = catalogConfrontations().find((item) => item.catalogId === catalogId);\n  if (row === undefined || row.kind !== 'value' || row.prediction === undefined) return [];\n  const prediction = row.prediction;\n  const point = { ...prediction.inputs };\n  const predict = (inputs: Record<string, number>): number => predictedAt(catalogId, prediction, inputs);\n  return Object.keys(point)\n    .map((key) => ({ input: key, elasticity: elasticityOf(predict, point, key) }))\n    .sort((a, b) => b.elasticity - a.elasticity);\n}\n"]}

package/dist/bridges/tensor-index.js.map

@@ -1 +1 @@
-{"version":3,"file":"tensor-index.js","sourceRoot":"","sources":["../../src/bridges/tensor-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAWH;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAE7B;IACF,mBAAmB,EACjB,yFAAyF;IAC3F,sBAAsB,EACpB,oFAAoF;IACtF,+EAA+E;IAC/E,SAAS,EAAE,uEAAuE;IAClF,mBAAmB,EACjB,wFAAwF;IAC1F,kBAAkB,EAChB,uFAAuF;CAC1F,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAmD;IACtF,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,YAAY;CAChB,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAgB;IACnD,MAAM,SAAS,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACrD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,kDAAkD,QAAQ,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}
+{"version":3,"file":"tensor-index.js","sourceRoot":"","sources":["../../src/bridges/tensor-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAWH;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAE7B;IACF,mBAAmB,EACjB,yFAAyF;IAC3F,sBAAsB,EACpB,oFAAoF;IACtF,+EAA+E;IAC/E,SAAS,EAAE,uEAAuE;IAClF,mBAAmB,EACjB,wFAAwF;IAC1F,kBAAkB,EAChB,uFAAuF;CAC1F,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAmD;IACtF,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,sBAAsB;IACzB,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,WAAW;IACd,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,mBAAmB;IACtB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,kBAAkB;IACrB,CAAC,EAAE,YAAY;CAChB,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAgB;IACnD,MAAM,SAAS,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACrD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,kDAAkD,QAAQ,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/**\n * §VI.6.1 tensor-index component for a catalog category.\n *\n * Part II §VI.6.1 files each bridge under one component. The component is\n * the category cluster. It is not the `bridges` tuple, and it is not the\n * formula's tensor rank or `dimensional_signature`. Those three were checked\n * against the lists for ids 11–50: when they disagree with the category, the\n * list follows the category (BE-34, BE-39, BE-48 for the tuple; BE-13 and\n * BE-17 for rank; BE-11 and BE-48 share `[frequency]` and do not share a\n * component).\n *\n * `unassigned` is category N. The specification states that those three\n * equations do not fit the other five patterns. A category letter absent\n * from this map throws: a new letter is not silently `unassigned`.\n *\n * The pattern strings are the alt text of the five displayed indices.\n *\n * @internal\n * @module bridges/tensor-index\n */\n\n/** The five displayed indices, plus the category-N refusal. */\nexport type TensorIndexComponent =\n  | 'quantum-classical'\n  | 'information-geometry'\n  | 'emergence'\n  | 'field-unification'\n  | 'scale-transition'\n  | 'unassigned';\n\n/**\n * Alt text of the index Part II §VI.6.1 displays for that component.\n * Category N has no index.\n */\nexport const TENSOR_INDEX_PATTERN: Readonly<\n  Record<Exclude<TensorIndexComponent, 'unassigned'>, string>\n> = {\n  'quantum-classical':\n    '\\\\boldsymbol{\\\\Pi}^{\\\\text{quantum},\\\\text{classical},\\\\gamma,\\\\delta,\\\\epsilon,\\\\zeta}',\n  'information-geometry':\n    '\\\\boldsymbol{\\\\Pi}^{\\\\alpha,\\\\beta,\\\\text{Poincaré},\\\\text{info},\\\\epsilon,\\\\zeta}',\n  // U+2026, the character in the §VI.6.1 alt text, not the LaTeX command \\ldots.\n  emergence: '\\\\boldsymbol{\\\\Pi}^{\\\\alpha\\\\beta\\\\gamma\\\\delta\\\\epsilon\\\\zeta\\u2026}',\n  'field-unification':\n    '\\\\boldsymbol{\\\\Pi}^{\\\\alpha,\\\\text{force}_i,\\\\text{symmetry},\\\\delta,\\\\epsilon,\\\\zeta}',\n  'scale-transition':\n    '\\\\boldsymbol{\\\\Pi}^{\\\\text{scale}_i,\\\\text{scale}_j,\\\\gamma,\\\\delta,\\\\epsilon,\\\\zeta}',\n};\n\n/**\n * Category letter → component. A and J are one component, and so on, matching\n * the id lists in §VI.6.1 for ids 11–50.\n */\nexport const TENSOR_INDEX_BY_CATEGORY: Readonly<Record<string, TensorIndexComponent>> = {\n  A: 'quantum-classical',\n  J: 'quantum-classical',\n  B: 'information-geometry',\n  I: 'information-geometry',\n  M: 'information-geometry',\n  C: 'emergence',\n  H: 'emergence',\n  O: 'emergence',\n  D: 'field-unification',\n  K: 'field-unification',\n  L: 'field-unification',\n  E: 'scale-transition',\n  F: 'scale-transition',\n  G: 'scale-transition',\n  N: 'unassigned',\n};\n\n/**\n * Component for a catalog category letter.\n *\n * @throws when `category` is not one of A–O. A new letter is not guessed.\n */\nexport function tensorIndexComponent(category: string): TensorIndexComponent {\n  const component = TENSOR_INDEX_BY_CATEGORY[category];\n  if (component === undefined) {\n    throw new Error(`no §VI.6.1 tensor-index component for category ${category}`);\n  }\n  return component;\n}\n"]}

package/dist/bridges/types.d.ts

@@ -6,18 +6,14 @@
 import type { Conventions, Counterexample, Regime, RelationContract } from '../relations/types.js';
 /** Lifecycle status of a bridge equation in the catalog. @public */
 export type BridgeEquationStatus = 'established' | 'speculative' | 'highly-speculative' | 'invalid';
-/** An active status is every status except `invalid`. */
-export declare function isActiveStatus(s: BridgeEquationStatus): s is Exclude<BridgeEquationStatus, 'invalid'>;
 /** How badly a catalogued defect undermines a bridge equation. @public */
 export type BridgeIssueSeverity = 'self-refuting' | 'dimensional' | 'index-structure' | 'sign' | 'undefined-quantity' | 'phenomenological-ansatz' | 'other';
 /** Whether a catalogued defect can be repaired, and at what cost. @public */
 export type BridgeIssueFixable = 'spec-edit' | 'reformulation' | 'unfixable-must-mark-invalid' | 'unknown';
-/** Tractability of a catalog row. */
-export type BridgeTractabilityClass = 'closed-form' | 'numerical-tractable' | 'numerical-asymptotic' | 'formally-divergent' | 'undefined';
 /** One recorded defect. @public */
 export interface KnownIssue {
     severity: BridgeIssueSeverity;
-    /** Verbatim issue text from the spec (may be paraphrased; cf. source). */
+    /** The defect, in the catalog's words. */
     description: string;
     fixable: BridgeIssueFixable;
 }
@@ -41,8 +37,6 @@ export interface BridgeEquationEntry {
     references: string[];
     dependencies: number[];
     dimensional_signature: string | null;
-    encoded_form?: string;
-    tractability_class: BridgeTractabilityClass;
     notes: string;
     relation?: RelationContract;
     regime?: Regime;

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

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/bridges/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEnG,oEAAoE;AACpE,MAAM,MAAM,oBAAoB,GAC5B,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,SAAS,CAAC;AAEd,yDAAyD;AACzD,wBAAgB,cAAc,CAC5B,CAAC,EAAE,oBAAoB,GACtB,CAAC,IAAI,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAE/C;AAED,0EAA0E;AAC1E,MAAM,MAAM,mBAAmB,GAC3B,eAAe,GACf,aAAa,GACb,iBAAiB,GACjB,MAAM,GACN,oBAAoB,GACpB,yBAAyB,GACzB,OAAO,CAAC;AAEZ,6EAA6E;AAC7E,MAAM,MAAM,kBAAkB,GAC1B,WAAW,GACX,eAAe,GACf,6BAA6B,GAC7B,SAAS,CAAC;AAEd,qCAAqC;AACrC,MAAM,MAAM,uBAAuB,GAC/B,aAAa,GACb,qBAAqB,GACrB,sBAAsB,GACtB,oBAAoB,GACpB,WAAW,CAAC;AAEhB,mCAAmC;AACnC,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,mBAAmB,CAAC;IAC9B,0EAA0E;IAC1E,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,kBAAkB,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,2DAA2D;IAC3D,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1B,MAAM,EAAE,oBAAoB,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,WAAW,EAAE,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;IACpD,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,UAAU,EAAE,CAAC;IAC3B,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,uBAAuB,CAAC;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;CAC7C"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/bridges/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEnG,oEAAoE;AACpE,MAAM,MAAM,oBAAoB,GAC5B,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,SAAS,CAAC;AAEd,0EAA0E;AAC1E,MAAM,MAAM,mBAAmB,GAC3B,eAAe,GACf,aAAa,GACb,iBAAiB,GACjB,MAAM,GACN,oBAAoB,GACpB,yBAAyB,GACzB,OAAO,CAAC;AAEZ,6EAA6E;AAC7E,MAAM,MAAM,kBAAkB,GAC1B,WAAW,GACX,eAAe,GACf,6BAA6B,GAC7B,SAAS,CAAC;AAEd,mCAAmC;AACnC,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,mBAAmB,CAAC;IAC9B,0CAA0C;IAC1C,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,kBAAkB,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,2DAA2D;IAC3D,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1B,MAAM,EAAE,oBAAoB,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,WAAW,EAAE,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;IACpD,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,UAAU,EAAE,CAAC;IAC3B,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;CAC7C"}

package/dist/bridges/types.js

@@ -3,8 +3,5 @@
  *
  * @module bridges/types
  */
-/** An active status is every status except `invalid`. */
-export function isActiveStatus(s) {
-    return s !== 'invalid';
-}
+export {};
 //# sourceMappingURL=types.js.map

package/dist/bridges/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/bridges/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAWH,yDAAyD;AACzD,MAAM,UAAU,cAAc,CAC5B,CAAuB;IAEvB,OAAO,CAAC,KAAK,SAAS,CAAC;AACzB,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/bridges/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG","sourcesContent":["/**\n * Catalog entry types. The rows themselves live in `data/bridge-catalog.json`.\n *\n * @module bridges/types\n */\n\nimport type { Conventions, Counterexample, Regime, RelationContract } from '../relations/types.js';\n\n/** Lifecycle status of a bridge equation in the catalog. @public */\nexport type BridgeEquationStatus =\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative'\n  | 'invalid';\n\n/** How badly a catalogued defect undermines a bridge equation. @public */\nexport type BridgeIssueSeverity =\n  | 'self-refuting'\n  | 'dimensional'\n  | 'index-structure'\n  | 'sign'\n  | 'undefined-quantity'\n  | 'phenomenological-ansatz'\n  | 'other';\n\n/** Whether a catalogued defect can be repaired, and at what cost. @public */\nexport type BridgeIssueFixable =\n  | 'spec-edit'\n  | 'reformulation'\n  | 'unfixable-must-mark-invalid'\n  | 'unknown';\n\n/** One recorded defect. @public */\nexport interface KnownIssue {\n  severity: BridgeIssueSeverity;\n  /** The defect, in the catalog's words. */\n  description: string;\n  fixable: BridgeIssueFixable;\n}\n\n/**\n * One bridge equation as the catalog records it.\n * @public\n */\nexport interface BridgeEquationEntry {\n  /** Stable catalog id. A field, never a code identifier. */\n  id: number;\n  name: string;\n  category: string;\n  category_name: string;\n  bridges: [string, string];\n  status: BridgeEquationStatus;\n  context: string;\n  formula_latex: string | null;\n  source_part: 'I' | 'II' | 'III' | 'IV' | 'V' | 'VI';\n  source_section: string;\n  known_issues: KnownIssue[];\n  references: string[];\n  dependencies: number[];\n  dimensional_signature: string | null;\n  notes: string;\n  relation?: RelationContract;\n  regime?: Regime;\n  conventions?: Conventions;\n  counterexamples?: readonly Counterexample[];\n}\n"]}

package/dist/canonical/canonical-equation.js.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-equation.js","sourceRoot":"","sources":["../../src/canonical/canonical-equation.ts"],"names":[],"mappings":""}
+{"version":3,"file":"canonical-equation.js","sourceRoot":"","sources":["../../src/canonical/canonical-equation.ts"],"names":[],"mappings":"","sourcesContent":["/**\n * Canonical (textbook) physics equations — the ground-truth L-layer of the\n * universal tensor (Π = L + B + E). A `CanonicalEquation` is the *answer key*\n * that bridge equations (the B-layer) are validated against; it is NOT a\n * speculative claim.\n *\n * Entries carry whichever FIDELITY LEVELS they can:\n *   - L0 (mandatory) — `dimensional`: target dim + governing vars (+ monomial\n *     when dimensionally determined). Reproduced by the Buckingham-π engine.\n *   - L1 (optional)  — `scalarAst`: an `ExprNode` RHS, validated dimensionally.\n *   - L2 (optional)  — `fieldEquation`: a tensor/PDE predicate node.\n *\n * Epistemic honesty (review finding F1): an L0-only entry must never read as\n * more than \"dimensionally consistent\". `epistemicStatus` is the highest claim\n * the entry supports; `freeDimensionlessGroups > 0` means dimensions cannot pin\n * the form. Consumers must not use an entry above its `epistemicStatus`.\n *\n * See `docs/planning/Canonical-Equation-Registry-A-Design.md`.\n *\n * @module canonical/canonical-equation\n */\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { DimensionalVariable } from '../dimensional/buckingham.js';\nimport type { TensorIndices } from '../core/types.js';\nimport type { EinsteinFieldEquationNode } from '../dimensional/einstein-equation.js';\nimport type { Conventions } from '../relations/types.js';\n\n/** Physics domain — indexes the registry and (later) the discovery kind filter. */\nexport type CanonicalDomain =\n  | 'mechanics'\n  | 'gravitation'\n  | 'general-relativity'\n  | 'cosmology'\n  | 'electromagnetism'\n  | 'quantum'\n  | 'thermodynamics'\n  | 'statistical'\n  | 'information'\n  | 'condensed-matter';\n\n/**\n * The strongest claim an entry supports:\n *   - `dimensional`          — only the dimensional signature (L0).\n *   - `scalar-up-to-constant`— the algebraic form, leading constant aside (L1).\n *   - `fully-quantitative`   — the complete relation incl. the constant.\n */\nexport type EpistemicStatus =\n  | 'dimensional'\n  | 'scalar-up-to-constant'\n  | 'fully-quantitative';\n\n/** A field-equation predicate node (L2). Concrete node kinds live in the\n *  dimensional layer; widen this union as Maxwell/Klein–Gordon nodes land. */\nexport type FieldEquationNode = EinsteinFieldEquationNode;\n\n/** Disambiguators for forms that share a dimensional signature (finding F3). */\nexport interface CanonicalForms {\n  /** Bekenstein–Hawking depends on horizon AREA, not radius. */\n  readonly areaOrRadius?: 'area' | 'radius';\n  /** Landauer uses the NATURAL log. */\n  readonly logBase?: 'e' | '2' | '10';\n  /** Stefan–Boltzmann `j=σT⁴` is a FLUX; luminosity `L=σAT⁴` changes σ. */\n  readonly quantityKind?: 'flux' | 'power' | 'energy';\n}\n\n/** One sourced prefactor: the exact dimensionless factor and the verbatim text it is read from. */\nexport interface SourcedPrefactor {\n  readonly value: number;\n  /** Verbatim source text the factor is read from. */\n  readonly quote: string;\n  /** Where the quote is: page, revision id and wikitext line. */\n  readonly locator: string;\n}\n\n/** A sourced prefactor that is `coefficient · group^exponent` of a dimensionless group the record does not carry. */\nexport interface SourcedGroupPrefactor {\n  /** The group as the entry's formula names it (`'gamma'` for γ). */\n  readonly group: string;\n  readonly coefficient: number;\n  readonly exponent: number;\n  readonly quote: string;\n  readonly locator: string;\n}\n\n/** A canonical (textbook) physics equation. */\nexport interface CanonicalEquation {\n  /** Stable id, e.g. 'CE-newton-gravitation'. */\n  readonly id: string;\n  readonly name: string;\n  readonly domain: CanonicalDomain;\n  /** LaTeX rendering (display only). */\n  readonly formula_latex: string;\n\n  // ── epistemic honesty (F1) ──────────────────────────────────────────────\n  readonly epistemicStatus: EpistemicStatus;\n  /** 0 ⇒ the L0 monomial is fully determined; ≥1 ⇒ dimensions can't pin it. */\n  readonly freeDimensionlessGroups: number;\n\n  // ── L0 (always present) ─────────────────────────────────────────────────\n  readonly dimensional: {\n    readonly target: DimensionalVariable;\n    readonly governing: readonly DimensionalVariable[];\n    /** Textbook monomial exponents, or null when there are free groups. */\n    readonly monomial: Readonly<Record<string, number>> | null;\n  };\n  // ── L1 / L2 (optional) ──────────────────────────────────────────────────\n  readonly scalarAst?: ExprNode;\n  readonly fieldEquation?: FieldEquationNode;\n\n  // ── disambiguation (F3) ─────────────────────────────────────────────────\n  readonly forms?: CanonicalForms;\n\n  // ── placement + provenance ──────────────────────────────────────────────\n  /** L-layer cell coordinates. */\n  readonly regime: TensorIndices;\n  /** Implicit regime assumptions (e.g. 'blackbody equilibrium'). */\n  readonly assumptions: readonly string[];\n  readonly references: readonly string[];\n  /** Bridges this law is the intended correspondence partner for (advisory;\n   *  the check itself is Sub-project B). */\n  readonly partnerBridges: readonly string[];\n  /** Set when this law is LITERALLY a bridge's own relation (BH≡BE-21, …);\n   *  Sub-project B uses it to discount the trivial X≡X match (finding F4). */\n  readonly restatesBridge?: string;\n\n  // ── facts of this equation that side tables once held ──────────────────\n  /** Validity condition over the governing names, in the holds grammar. Absent: permissive. */\n  readonly holds?: string;\n  /** The exact dimensionless prefactor in front of the AST or monomial, with its verbatim source. */\n  readonly prefactor?: SourcedPrefactor;\n  /** A prefactor that is a power of a dimensionless group the record does not carry (√γ). */\n  readonly groupPrefactor?: SourcedGroupPrefactor;\n  /** Disclosure printed when the factor is unset: the textbook factor the unit monomial is not. */\n  readonly unsetFactorNote?: string;\n  /** Convention line a comparison prints beside this entry. */\n  readonly conventionNote?: string;\n  /** Entries that share a group are one law under different conventions; a formula agreeing with any of them has matched that law. */\n  readonly conventionGroup?: string;\n  /** Target names this entry answers to in a comparison besides its own target. */\n  readonly targetAliases?: readonly string[];\n\n  // ── Atlas Phase 1 overlay (OPTIONAL; an entry without it is unchanged) ──\n  /**\n   * Sign/unit choices the equation depends on (first-law sign, metric\n   * signature, Fourier normalization, unit system, …). A canonical equation\n   * asserts no BETWEEN-model relation, so it takes `conventions` only — no\n   * `relation` and no `counterexamples`.\n   */\n  readonly conventions?: Conventions;\n\n  // ── Atlas Phase 3 overlay (OPTIONAL; an entry without it is unchanged) ──\n  /**\n   * The `Model` this equation is stated WITHIN (`'model-spring'`, …), as an\n   * `AtlasModel.id`. ROADMAP Phase 3 makes the model the unit rather than the\n   * equation; an entry whose model is not recorded omits the field rather\n   * than naming a plausible one.\n   */\n  readonly model?: string;\n}\n"]}