universal-physics-tensor 10.0.0 → 11.0.0

package/dist/composition/representative-values.js.map

@@ -1 +1 @@
-{"version":3,"file":"representative-values.js","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAUH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAE9B;IACF,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,gCAAgC,EAAE;IAC3E,uBAAuB,EAAE;QACvB,KAAK,EAAE,KAAK;QACZ,MAAM,EAAE,gEAAgE;KACzE;IACD,mBAAmB,EAAE;QACnB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,0CAA0C;KACnD;IAED,2EAA2E;IAC3E,yBAAyB,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,qBAAqB,EAAE;IAC5E,oBAAoB,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,wBAAwB,EAAE;IACzE,0BAA0B,EAAE;QAC1B,KAAK,EAAE,OAAO;QACd,MAAM,EAAE,uBAAuB;KAChC;IACD,gBAAgB,EAAE;QAChB,KAAK,EAAE,OAAO;QACd,MAAM,EAAE,sDAAsD;KAC/D;IAED,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE;IAC3D,gBAAgB,EAAE;QAChB,KAAK,EAAE,SAAS;QAChB,MAAM,EAAE,4DAA4D;KACrE;IAED,2EAA2E;IAC3E,iBAAiB,EAAE;QACjB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,mCAAmC;KAC5C;IACD,yBAAyB,EAAE;QACzB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,iEAAiE;KAC1E;IACD,eAAe,EAAE;QACf,KAAK,EAAE,KAAK;QACZ,MAAM,EAAE,+DAA+D;KACxE;IACD,eAAe,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE;IAC/D,2EAA2E;IAC3E,8EAA8E;IAC9E,8EAA8E;IAC9E,6DAA6D;IAC7D,oBAAoB,EAAE;QACpB,KAAK,EAAE,SAAS;QAChB,MAAM,EAAE,mEAAmE;KAC5E;IACD,aAAa,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,uCAAuC,EAAE;IAEpF,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE;CAC7D,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY;IAEZ,OAAO,qBAAqB,CAAC,IAAI,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/**\n * Order-of-magnitude representative values for the discovery falsifier.\n *\n * The discovery loop (`discovery.ts`) vets a hypothesised identification a≡b,\n * but its numeric check (`retrodict`) runs from a single anchor and cannot\n * evaluate the quantities a dimensional coincidence \"unlocks\" — so it never\n * contradicts them, and they surface as `promising` (e.g.\n * `landauer-erasure-energy ≟ planck-mass-energy`, ~30 orders apart). The graph\n * structurally CANNOT supply the magnitudes that would falsify these.\n *\n * This table injects that missing ground truth: a sourced, order-of-magnitude\n * value for quantities that have a WELL-DEFINED physical scale. Two classes are\n * deliberately ABSENT:\n *   - generic quantities (`mass`, `energy`, `length`, …) — no single scale (the\n *     discovery gate now reads these from the graph at the anchor instead, see\n *     `discovery.ts`); and\n *   - speculative-physics quantities with no agreed scale (`dark-fermion-mass`,\n *     `scalar-field-value`, `inflation-hubble-energy`, `boundary-length`, the\n *     time-dependent `coarsening-length`) — a value would be fabrication, so the\n *     gate correctly abstains on them.\n * When a value is absent the gate abstains; it never false-rejects on unknowns.\n *\n * Values are order-of-magnitude estimates (good to ~1 order), each carrying its\n * provenance. Nothing here is fabricated; coarse by design. When the canonical-\n * equation registry lands it can supply these centrally and this table folds in.\n *\n * INTERNAL — surfaced via `upt discover`.\n *\n * @module composition/representative-values\n */\n\n/** A sourced order-of-magnitude value for one quantity. @internal */\nexport interface RepresentativeValue {\n  /** Order-of-magnitude value in the quantity's SI unit (good to ~1 order). */\n  readonly value: number;\n  /** Provenance — how the estimate is obtained (a citation or a one-liner). */\n  readonly source: string;\n}\n\n/**\n * Scale-specific quantities only. Keyed by the canonical quantity name used in\n * the composition graph. Generic quantities are intentionally omitted.\n *\n * @internal\n */\nexport const REPRESENTATIVE_VALUES: Readonly<\n  Record<string, RepresentativeValue>\n> = {\n  // ── frequencies / rates [s^-1] ──────────────────────────────────────────\n  'hubble-rate': { value: 2.2e-18, source: 'H0 ≈ 67 km/s/Mpc (Planck 2018)' },\n  'grw-localization-rate': {\n    value: 1e-16,\n    source: 'GRW collapse rate λ ≈ 10^-16 s^-1 (Ghirardi–Rimini–Weber 1986)',\n  },\n  'attempt-frequency': {\n    value: 1e13,\n    source: 'Debye/phonon attempt frequency ~10^13 Hz',\n  },\n\n  // ── energies [J] ────────────────────────────────────────────────────────\n  'landauer-erasure-energy': { value: 2.9e-21, source: 'kT·ln2 at T = 300 K' },\n  'planck-mass-energy': { value: 1.96e9, source: 'm_P·c² (m_P = √(ℏc/G))' },\n  'vacuum-expectation-value': {\n    value: 3.94e-8,\n    source: 'Higgs VEV v ≈ 246 GeV',\n  },\n  'barrier-height': {\n    value: 3.2e-20,\n    source: 'BE-26 Löwdin DNA proton-transfer barrier V−E ~0.2 eV',\n  },\n\n  // ── masses [kg] ─────────────────────────────────────────────────────────\n  'planck-mass': { value: 2.176e-8, source: 'm_P = √(ℏc/G)' },\n  'tunneling-mass': {\n    value: 1.673e-27,\n    source: 'BE-26 tunneling particle is the proton, m_p = 1.673e-27 kg',\n  },\n\n  // ── lengths [m] ─────────────────────────────────────────────────────────\n  'foerster-radius': {\n    value: 5e-9,\n    source: 'typical FRET Förster radius ~5 nm',\n  },\n  'donor-acceptor-distance': {\n    value: 5e-9,\n    source: 'BE-24 FRET donor–acceptor separation ~5 nm (same regime as R_0)',\n  },\n  'barrier-width': {\n    value: 1e-10,\n    source: 'BE-26 DNA H-bond proton-tunneling distance ~1 Å (Löwdin 1963)',\n  },\n  'planck-length': { value: 1.616e-35, source: 'ℓ_P = √(ℏG/c³)' },\n  // Canonical-graph atomic length scales — sourced so the gate compares real\n  // magnitudes instead of falling back to the {mass: M_sun} anchor, which makes\n  // a 1/mass quantity like the Compton wavelength absurdly small (~10⁻⁷³ m) and\n  // produces a spurious clash against the (fixed) Bohr radius.\n  'compton-wavelength': {\n    value: 2.426e-12,\n    source: 'electron Compton wavelength λ_C = h/(m_e c) = 2.43e-12 m (CODATA)',\n  },\n  'bohr-radius': { value: 5.292e-11, source: 'Bohr radius a_0 = 5.29e-11 m (CODATA)' },\n\n  // ── times [s] ───────────────────────────────────────────────────────────\n  'planck-time': { value: 5.39e-44, source: 't_P = √(ℏG/c⁵)' },\n};\n\n/**\n * The sourced order-of-magnitude value for `name`, or `undefined` when the\n * quantity has no well-defined representative scale (the gate then abstains).\n *\n * @internal\n */\nexport function representativeValue(\n  name: string,\n): RepresentativeValue | undefined {\n  return REPRESENTATIVE_VALUES[name];\n}\n"]}
+{"version":3,"file":"representative-values.js","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAiBH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,EAAuB;IACpD,MAAM,KAAK,GAAG,EAAE,CAAC,YAAY,CAAC;IAC9B,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,qBAAqB,CAAC;IACtD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAClB,qCAAqC,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,MAAM,uCAAuC,CAChH,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAE9B;IACF,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,gCAAgC,EAAE;IAC3E,uBAAuB,EAAE;QACvB,KAAK,EAAE,KAAK;QACZ,MAAM,EAAE,gEAAgE;KACzE;IACD,mBAAmB,EAAE;QACnB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,0CAA0C;KACnD;IAED,2EAA2E;IAC3E,yBAAyB,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,qBAAqB,EAAE;IAC5E,oBAAoB,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,wBAAwB,EAAE;IACzE,0BAA0B,EAAE;QAC1B,KAAK,EAAE,OAAO;QACd,MAAM,EAAE,uBAAuB;KAChC;IACD,gBAAgB,EAAE;QAChB,KAAK,EAAE,OAAO;QACd,MAAM,EAAE,sDAAsD;KAC/D;IAED,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE;IAC3D,gBAAgB,EAAE;QAChB,KAAK,EAAE,SAAS;QAChB,MAAM,EAAE,4DAA4D;KACrE;IAED,2EAA2E;IAC3E,iBAAiB,EAAE;QACjB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,mCAAmC;KAC5C;IACD,yBAAyB,EAAE;QACzB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,iEAAiE;KAC1E;IACD,eAAe,EAAE;QACf,KAAK,EAAE,KAAK;QACZ,MAAM,EAAE,+DAA+D;KACxE;IACD,eAAe,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE;IAC/D,2EAA2E;IAC3E,8EAA8E;IAC9E,8EAA8E;IAC9E,6DAA6D;IAC7D,oBAAoB,EAAE;QACpB,KAAK,EAAE,SAAS;QAChB,MAAM,EAAE,mEAAmE;KAC5E;IACD,aAAa,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,uCAAuC,EAAE;IAEpF,2EAA2E;IAC3E,aAAa,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE;CAC7D,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY;IAEZ,OAAO,qBAAqB,CAAC,IAAI,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/**\n * Order-of-magnitude representative values for the discovery falsifier.\n *\n * The discovery loop (`discovery.ts`) vets a hypothesised identification a≡b,\n * but its numeric check (`retrodict`) runs from a single anchor and cannot\n * evaluate the quantities a dimensional coincidence \"unlocks\" — so it never\n * contradicts them, and they surface as `promising` (e.g.\n * `landauer-erasure-energy ≟ planck-mass-energy`, ~30 orders apart). The graph\n * structurally CANNOT supply the magnitudes that would falsify these.\n *\n * This table injects that missing ground truth: a sourced, order-of-magnitude\n * value for quantities that have a WELL-DEFINED physical scale. Two classes are\n * deliberately ABSENT:\n *   - generic quantities (`mass`, `energy`, `length`, …) — no single scale (the\n *     discovery gate now reads these from the graph at the anchor instead, see\n *     `discovery.ts`); and\n *   - speculative-physics quantities with no agreed scale (`dark-fermion-mass`,\n *     `scalar-field-value`, `inflation-hubble-energy`, `boundary-length`, the\n *     time-dependent `coarsening-length`) — a value would be fabrication, so the\n *     gate correctly abstains on them.\n * When a value is absent the gate abstains; it never false-rejects on unknowns.\n *\n * Values are order-of-magnitude estimates (good to ~1 order), each carrying its\n * provenance. Nothing here is fabricated; coarse by design. When the canonical-\n * equation registry lands it can supply these centrally and this table folds in.\n *\n * INTERNAL — surfaced via `upt discover`.\n *\n * @module composition/representative-values\n */\n\n/** A sourced order-of-magnitude value for one quantity. @internal */\nexport interface RepresentativeValue {\n  /** Order-of-magnitude value in the quantity's SI unit (good to ~1 order). */\n  readonly value: number;\n  /** Provenance — how the estimate is obtained (a citation or a one-liner). */\n  readonly source: string;\n  /**\n   * The value's stated uncertainty, as a standard deviation in decades of `log10|value|`.\n   * Absent means {@link DEFAULT_SIGMA_DECADES}, the table's \"good to about one order\"; a row\n   * states another only with a source for it. The graded magnitude gate\n   * (`discovery.ts`, `magnitudeP`) reads it; the verdict threshold does not.\n   */\n  readonly sigmaDecades?: number;\n}\n\n/**\n * The σ in decades a representative value carries when its row states none: one decade, the\n * precision this table has always claimed (\"good to ~1 order\"). Not a per-row measurement.\n *\n * @internal\n */\nexport const DEFAULT_SIGMA_DECADES = 1;\n\n/**\n * The σ in decades of a representative value: its own `sigmaDecades`, else the default. A stated\n * σ that is not a finite number > 0 is refused with a `RangeError` naming the row's source: σ = 0\n * would make the falsifier's strength 0 (certain) and a negative or NaN σ would make it NaN.\n *\n * @internal\n */\nexport function sigmaDecadesOf(rv: RepresentativeValue): number {\n  const sigma = rv.sigmaDecades;\n  if (sigma === undefined) return DEFAULT_SIGMA_DECADES;\n  if (!(Number.isFinite(sigma) && sigma > 0)) {\n    throw new RangeError(\n      `representative value sigmaDecades ${String(sigma)} (source: ${rv.source}) must be a finite number > 0 decades`,\n    );\n  }\n  return sigma;\n}\n\n/**\n * Scale-specific quantities only. Keyed by the canonical quantity name used in\n * the composition graph. Generic quantities are intentionally omitted.\n *\n * @internal\n */\nexport const REPRESENTATIVE_VALUES: Readonly<\n  Record<string, RepresentativeValue>\n> = {\n  // ── frequencies / rates [s^-1] ──────────────────────────────────────────\n  'hubble-rate': { value: 2.2e-18, source: 'H0 ≈ 67 km/s/Mpc (Planck 2018)' },\n  'grw-localization-rate': {\n    value: 1e-16,\n    source: 'GRW collapse rate λ ≈ 10^-16 s^-1 (Ghirardi–Rimini–Weber 1986)',\n  },\n  'attempt-frequency': {\n    value: 1e13,\n    source: 'Debye/phonon attempt frequency ~10^13 Hz',\n  },\n\n  // ── energies [J] ────────────────────────────────────────────────────────\n  'landauer-erasure-energy': { value: 2.9e-21, source: 'kT·ln2 at T = 300 K' },\n  'planck-mass-energy': { value: 1.96e9, source: 'm_P·c² (m_P = √(ℏc/G))' },\n  'vacuum-expectation-value': {\n    value: 3.94e-8,\n    source: 'Higgs VEV v ≈ 246 GeV',\n  },\n  'barrier-height': {\n    value: 3.2e-20,\n    source: 'BE-26 Löwdin DNA proton-transfer barrier V−E ~0.2 eV',\n  },\n\n  // ── masses [kg] ─────────────────────────────────────────────────────────\n  'planck-mass': { value: 2.176e-8, source: 'm_P = √(ℏc/G)' },\n  'tunneling-mass': {\n    value: 1.673e-27,\n    source: 'BE-26 tunneling particle is the proton, m_p = 1.673e-27 kg',\n  },\n\n  // ── lengths [m] ─────────────────────────────────────────────────────────\n  'foerster-radius': {\n    value: 5e-9,\n    source: 'typical FRET Förster radius ~5 nm',\n  },\n  'donor-acceptor-distance': {\n    value: 5e-9,\n    source: 'BE-24 FRET donor–acceptor separation ~5 nm (same regime as R_0)',\n  },\n  'barrier-width': {\n    value: 1e-10,\n    source: 'BE-26 DNA H-bond proton-tunneling distance ~1 Å (Löwdin 1963)',\n  },\n  'planck-length': { value: 1.616e-35, source: 'ℓ_P = √(ℏG/c³)' },\n  // Canonical-graph atomic length scales — sourced so the gate compares real\n  // magnitudes instead of falling back to the {mass: M_sun} anchor, which makes\n  // a 1/mass quantity like the Compton wavelength absurdly small (~10⁻⁷³ m) and\n  // produces a spurious clash against the (fixed) Bohr radius.\n  'compton-wavelength': {\n    value: 2.426e-12,\n    source: 'electron Compton wavelength λ_C = h/(m_e c) = 2.43e-12 m (CODATA)',\n  },\n  'bohr-radius': { value: 5.292e-11, source: 'Bohr radius a_0 = 5.29e-11 m (CODATA)' },\n\n  // ── times [s] ───────────────────────────────────────────────────────────\n  'planck-time': { value: 5.39e-44, source: 't_P = √(ℏG/c⁵)' },\n};\n\n/**\n * The sourced order-of-magnitude value for `name`, or `undefined` when the\n * quantity has no well-defined representative scale (the gate then abstains).\n *\n * @internal\n */\nexport function representativeValue(\n  name: string,\n): RepresentativeValue | undefined {\n  return REPRESENTATIVE_VALUES[name];\n}\n"]}

package/dist/composition/retrodiction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"retrodiction.d.ts","sourceRoot":"","sources":["../../src/composition/retrodiction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAM5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAqB3D,gDAAgD;AAChD,MAAM,MAAM,mBAAmB,GAC3B,YAAY,GACZ,cAAc,GACd,QAAQ,GACR,eAAe,CAAC;AAEpB,kEAAkE;AAClE,MAAM,WAAW,sBAAsB;IACrC,4CAA4C;IAC5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,uCAAuC;AACvC,MAAM,WAAW,mBAAmB;IAClC,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D,iEAAiE;IACjE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,mEAAmE;IACnE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,qEAAqE;IACrE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;CACtC;AAED,4EAA4E;AAC5E,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,mBAAmB,GAAG,cAAc,GAAG,SAAS,CAAC;IAC3E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,mDAAmD;AACnD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,uDAAuD;IACvD,QAAQ,CAAC,WAAW,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACxD,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACnD,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,4CAA4C;IAC5C,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,kEAAkE;IAClE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC;CAClC;AAED,uDAAuD;AACvD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,OAAO,EAAE,SAAS,kBAAkB,EAAE,CAAC;IAChD,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC;AAgBD;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,SAAS,sBAAsB,EAAE,GACxC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA+CrB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,mBAAwB,GAC7B,kBAAkB,CA0EpB;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,IAAI,GAAE,mBAAwB,GAC7B,kBAAkB,CA2BpB"}
+{"version":3,"file":"retrodiction.d.ts","sourceRoot":"","sources":["../../src/composition/retrodiction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAO5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAqB3D,gDAAgD;AAChD,MAAM,MAAM,mBAAmB,GAC3B,YAAY,GACZ,cAAc,GACd,QAAQ,GACR,eAAe,CAAC;AAEpB,kEAAkE;AAClE,MAAM,WAAW,sBAAsB;IACrC,4CAA4C;IAC5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,uCAAuC;AACvC,MAAM,WAAW,mBAAmB;IAClC,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D,iEAAiE;IACjE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,mEAAmE;IACnE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,qEAAqE;IACrE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;CACtC;AAED,4EAA4E;AAC5E,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,mBAAmB,GAAG,cAAc,GAAG,SAAS,CAAC;IAC3E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,mDAAmD;AACnD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,uDAAuD;IACvD,QAAQ,CAAC,WAAW,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACxD,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACnD,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,4CAA4C;IAC5C,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,kEAAkE;IAClE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC;CAClC;AAED,uDAAuD;AACvD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,OAAO,EAAE,SAAS,kBAAkB,EAAE,CAAC;IAChD,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC;AAgBD;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,SAAS,sBAAsB,EAAE,GACxC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA+CrB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,mBAAwB,GAC7B,kBAAkB,CAyEpB;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC7C,IAAI,GAAE,mBAAwB,GAC7B,kBAAkB,CA2BpB"}

package/dist/composition/retrodiction.js

@@ -33,6 +33,7 @@ import { CoefficientUnsetError, evaluateEdge } from './edge.js';
 import { DomainViolationError } from '../bridges/evaluation-errors.js';
 import { CarrierSignError } from '../bridges/carrier-sign.js';
 import { FormulaError } from '../numerical/formula-contract.js';
+import { meanOf } from '../numerical/statistics.js';
 import { QUANTITY_IDENTIFICATIONS } from './compose.js';
 import { conventionFactor } from '../dimensional/unit-convention.js';
 import { classifyAll } from './identifiability.js';
@@ -201,7 +202,7 @@ export function retrodictNode(edges, groundTruth, target, opts = {}) {
     };
     const ref = opts.references?.[target];
     if (ref !== undefined && predictions.length >= 1) {
-        const mean = predictions.reduce((a, p) => a + p.value, 0) / predictions.length;
+        const mean = meanOf(predictions.map((p) => p.value));
         const referenceRelError = Math.abs(mean - ref) / (Math.abs(ref) || 1);
         return {
             ...result,

package/dist/composition/retrodiction.js.map

@@ -1 +1 @@
-{"version":3,"file":"retrodiction.js","sourceRoot":"","sources":["../../src/composition/retrodiction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAGH,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAEhE,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEnD;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAgB,EAAE,MAAmC;IAC7E,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;IACnE,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;IACvE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AA4ED,yFAAyF;AACzF,SAAS,WAAW,CAAC,GAAY;IAC/B,IAAI,GAAG,YAAY,oBAAoB;QAAE,OAAO,QAAQ,CAAC;IACzD,IAAI,GAAG,YAAY,qBAAqB;QAAE,OAAO,mBAAmB,CAAC;IACrE,IAAI,GAAG,YAAY,gBAAgB;QAAE,OAAO,cAAc,CAAC;IAC3D,IAAI,GAAG,YAAY,YAAY;QAAE,OAAO,SAAS,CAAC;IAClD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kGAAkG;AAClG,SAAS,eAAe,CAAC,GAAY;IACnC,OAAO,WAAW,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;AACxC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,WAA6C,EAC7C,MAAyC;IAEzC,oEAAoE;IACpE,6EAA6E;IAC7E,uEAAuE;IACvE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,SAAS,CACjB,uCAAuC,IAAI,kCAAkC,CAAC,GAAG,CAClF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAiB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;IACpE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,OAAO,GAAG,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7D,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBAC7B,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAS;YACxC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YAC1D,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,CAAS,CAAC;YACd,IAAI,CAAC;gBACH,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9B,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,iFAAiF;gBACjF,gFAAgF;gBAChF,6EAA6E;gBAC7E,4EAA4E;gBAC5E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;oBAAE,MAAM,GAAG,CAAC;gBACrC,SAAS;YACX,CAAC;YACD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC7B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,WAA6C,EAC7C,MAAc,EACd,IAAI,GAAwB,EAAE;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IAChE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC;IAEzC,gEAAgE;IAChE,8DAA8D;IAC9D,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IAC3E,MAAM,MAAM,GAAG,eAAe,CAAC,oBAAoB,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IAE1E,MAAM,WAAW,GAA6B,EAAE,CAAC;IACjD,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACvC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,SAAS;QAC1D,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAS,CAAC;QACd,IAAI,CAAC;YACH,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,0EAA0E;YAC1E,uEAAuE;YACvE,2EAA2E;YAC3E,sCAAsC;YACtC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM,GAAG,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;YACpE,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,4EAA4E;QAC5E,wBAAwB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,cAAc,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,OAA4B,CAAC;IACjC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,eAAe,CAAC;SACnD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,QAAQ,CAAC;;QACjD,OAAO,GAAG,cAAc,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC;IAE3E,MAAM,MAAM,GAAuB;QACjC,MAAM;QACN,OAAO;QACP,WAAW;QACX,cAAc;QACd,SAAS;QACT,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,IAAI,EAAE,OAAO,KAAK,cAAc;KACjC,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,GACR,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;QACpE,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,OAAO;YACL,GAAG,MAAM;YACT,cAAc,EAAE,GAAG;YACnB,iBAAiB;YACjB,aAAa,EAAE,iBAAiB,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC;SACtE,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,KAA4B,EAC5B,WAA6C,EAC7C,IAAI,GAAwB,EAAE;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IAChE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,CAAC;IAE1E,MAAM,cAAc,GAAG,UAAU;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,iBAAiB,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACvE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAExE,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAChC,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,IAAI,CAAC,CAC3C,CAAC;IAEF,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IAC5E,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CACpC,CAAC,MAAM,CAAC;IAET,OAAO;QACL,OAAO;QACP,OAAO,EAAE,UAAU,GAAG,YAAY;QAClC,UAAU;QACV,YAAY;QACZ,aAAa,EAAE,YAAY,KAAK,CAAC;KAClC,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Retrodiction harness (Consequence 2 of\n * docs/planning/Bridge-Inference-Epistemics-Note.md, designed in\n * docs/planning/Retrodiction-Harness-Design-Note.md).\n *\n * The framework's own falsification benchmark. Mask a quantity the graph\n * can compute, recompute it from ground-truth inputs via EACH independent\n * derivation, and check the predictions agree. This operationalizes the\n * identifiability classifier's OVER-DETERMINED verdict: the surplus\n * derivations of an over-determined node are PREDICTED to be consistency\n * constraints; the harness evaluates them and checks that numerically.\n *\n *   - consistent    — ≥2 derivations agree within tolerance.\n *   - inconsistent  — ≥2 derivations DISAGREE (a falsification: two\n *                     encodings of one quantity-name are not the same\n *                     physics).\n *   - single        — exactly one derivation fired (recovered, no check).\n *   - unrecoverable — no derivation fired from the ground truth.\n *\n * \"Mask\" = compute source values over the graph with every edge INTO the\n * target removed (the classifier's target-removed closure — so the node\n * is genuinely hidden, never read back through its own derivation).\n * Forward evaluation honors `QUANTITY_IDENTIFICATIONS` and is\n * domain-checked (an edge that refuses its domain contributes no\n * prediction). The consistency check needs no external truth and is the\n * re-runnable core; an optional `references` map adds external-value\n * scoring. Pass bar pre-registered in the design note (spread ≤ 1e-6).\n *\n * @module composition/retrodiction\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { CANONICAL_GROUP_PREFACTORS } from './canonical-prefactors.js';\nimport { CoefficientUnsetError, evaluateEdge } from './edge.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\nimport { CarrierSignError } from '../bridges/carrier-sign.js';\nimport { FormulaError } from '../numerical/formula-contract.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport { conventionFactor } from '../dimensional/unit-convention.js';\nimport { classifyAll } from './identifiability.js';\n\n/**\n * Source values, plus a dimensionless group the edge multiplies when the\n * ground truth names it. The group is not a source: Buckingham cannot see\n * it, and a missing group is the unset coefficient, not a missing input.\n */\nfunction evaluationInputs(edge: BridgeEdge, values: ReadonlyMap<string, number>): Record<string, number> {\n  const inputs: Record<string, number> = {};\n  for (const s of edge.sources) inputs[s.name] = values.get(s.name)!;\n  const group = CANONICAL_GROUP_PREFACTORS.find((g) => g.id === edge.id);\n  if (group !== undefined) {\n    const g = values.get(group.group);\n    if (g !== undefined) inputs[group.group] = g;\n  }\n  return inputs;\n}\n\n/** Outcome of retrodicting one node. @public */\nexport type RetrodictionOutcome =\n  | 'consistent'\n  | 'inconsistent'\n  | 'single'\n  | 'unrecoverable';\n\n/** One derivation's recovered value for a masked node. @public */\nexport interface RetrodictionPrediction {\n  /** The edge id that produced this value. */\n  readonly edge: string;\n  readonly value: number;\n}\n\n/** Options for the harness. @public */\nexport interface RetrodictionOptions {\n  /** Identifications honored in forward evaluation (default registered). */\n  readonly identifications?: readonly QuantityIdentification[];\n  /** Relative-spread tolerance for `consistent` (default 1e-6). */\n  readonly tolerance?: number;\n  /** External (textbook) values to score recovered nodes against. */\n  readonly references?: Readonly<Record<string, number>>;\n  /** Relative-error tolerance for reference scoring (default 1e-3). */\n  readonly referenceTolerance?: number;\n}\n\n/** One refused edge in a retrodiction, with the kind of refusal. @public */\nexport interface RetrodictionRefusal {\n  readonly edge: string;\n  /**\n   * `domain`: the validity domain rejected the point. `coefficient-unset`: the edge has no\n   * sourced prefactor, whatever the values. `carrier-sign`: the carrier charge and the\n   * mobility had opposite signs. `formula`: the relation's formula did not evaluate at the\n   * point (a 0/0, say). Four facts, kept apart (AGENTS law 4).\n   */\n  readonly kind: 'domain' | 'coefficient-unset' | 'carrier-sign' | 'formula';\n  readonly reason: string;\n}\n\n/** The result of retrodicting one node. @public */\nexport interface RetrodictionResult {\n  readonly target: string;\n  readonly outcome: RetrodictionOutcome;\n  /** Recovered values, one per derivation that fired. */\n  readonly predictions: readonly RetrodictionPrediction[];\n  /** (max − min)/|mean| across predictions; 0 when fewer than two. */\n  readonly relativeSpread: number;\n  readonly tolerance: number;\n  /**\n   * Edges that refused the supplied values. `kind` keeps the refusals apart (AGENTS law 4):\n   * `domain`, `carrier-sign` and `formula` are the point (the edge does not fire there);\n   * `coefficient-unset` is the edge's own state (no sourced prefactor), whatever the values.\n   */\n  readonly refusals?: readonly RetrodictionRefusal[];\n  /** `outcome !== 'inconsistent'` — the falsification gate. */\n  readonly pass: boolean;\n  /** Supplied external value, when scored. */\n  readonly referenceValue?: number;\n  /** |mean(predictions) − reference| / |reference|, when scored. */\n  readonly referenceRelError?: number;\n  readonly referencePass?: boolean;\n}\n\n/** Aggregate report across the swept nodes. @public */\nexport interface RetrodictionReport {\n  readonly results: readonly RetrodictionResult[];\n  /** Nodes with ≥2 derivations (consistent + inconsistent). */\n  readonly checked: number;\n  readonly consistent: number;\n  readonly inconsistent: number;\n  /** The headline gate: no inconsistent node was found. */\n  readonly allConsistent: boolean;\n}\n\n/** The refusal an evaluator error is, or `undefined` when it is not a refusal at all. */\nfunction refusalKind(err: unknown): RetrodictionRefusal['kind'] | undefined {\n  if (err instanceof DomainViolationError) return 'domain';\n  if (err instanceof CoefficientUnsetError) return 'coefficient-unset';\n  if (err instanceof CarrierSignError) return 'carrier-sign';\n  if (err instanceof FormulaError) return 'formula';\n  return undefined;\n}\n\n/** True when the error says the edge does not fire here (or at all, for an unset coefficient). */\nfunction refusesThePoint(err: unknown): boolean {\n  return refusalKind(err) !== undefined;\n}\n\n/**\n * Monotone forward EVALUATION: propagate values from `groundTruth` through\n * the graph (domain-checked; identifications supply identified names;\n * non-finite or domain-refused edges do not fire). Each node is assigned\n * the value of the first edge that fires for it.\n *\n * Exported `@internal` so the discovery magnitude-gate can read a quantity's\n * value AT THE REGISTERED ANCHOR when the static representative-value table\n * has no entry for it (graph-derived quantities like `schwarzschild-radius`).\n *\n * @internal\n */\nexport function forwardEvaluate(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  idents: readonly QuantityIdentification[],\n): Map<string, number> {\n  // Finite-seed guard (matches the computed-value guard below and the\n  // library-wide finiteness discipline): a NaN/∞ seed would propagate silently\n  // through the graph and spoof downstream magnitude/consistency checks.\n  for (const [name, v] of Object.entries(groundTruth)) {\n    if (!Number.isFinite(v)) {\n      throw new TypeError(\n        `forwardEvaluate: ground-truth seed '${name}' must be a finite number, got ${v}.`,\n      );\n    }\n  }\n  const values = new Map<string, number>(Object.entries(groundTruth));\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const id of idents) {\n      const fromVal = values.get(id.from);\n      if (fromVal !== undefined && !values.has(id.to)) {\n        const converted = fromVal * conventionFactor(id.from, id.to);\n        if (Number.isFinite(converted)) {\n          values.set(id.to, converted);\n          changed = true;\n        }\n      }\n    }\n    for (const e of edges) {\n      if (values.has(e.target.name)) continue;\n      if (!e.sources.every((s) => values.has(s.name))) continue;\n      const inputs = evaluationInputs(e, values);\n      let v: number;\n      try {\n        v = evaluateEdge(e, inputs);\n      } catch (err) {\n        // The edge refusing this point (a domain miss, opposite carrier signs, a formula\n        // that has no finite value there) or an unset coefficient is \"the edge does not\n        // fire\". Anything else (an alias conflict, a TypeError in an evaluator) is a\n        // different fact and is not hidden as a non-derivation (9.0.0 audit §4 C6).\n        if (!refusesThePoint(err)) throw err;\n        continue;\n      }\n      if (Number.isFinite(v)) {\n        values.set(e.target.name, v);\n        changed = true;\n      }\n    }\n  }\n  return values;\n}\n\n/**\n * Retrodict one node: mask it (source values from the target-removed\n * graph), recover it via each incoming edge, and score the spread.\n *\n * @public\n */\nexport function retrodictNode(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  target: string,\n  opts: RetrodictionOptions = {},\n): RetrodictionResult {\n  const idents = opts.identifications ?? QUANTITY_IDENTIFICATIONS;\n  const tolerance = opts.tolerance ?? 1e-6;\n\n  // Masked source values: never let the target be assigned (so no\n  // derivation reads it back — circular self-support excluded).\n  const edgesMinusIntoTarget = edges.filter((e) => e.target.name !== target);\n  const values = forwardEvaluate(edgesMinusIntoTarget, groundTruth, idents);\n\n  const predictions: RetrodictionPrediction[] = [];\n  const refusals: RetrodictionRefusal[] = [];\n  for (const e of edges) {\n    if (e.target.name !== target) continue;\n    if (!e.sources.every((s) => values.has(s.name))) continue;\n    const inputs = evaluationInputs(e, values);\n    let v: number;\n    try {\n      v = evaluateEdge(e, inputs);\n    } catch (err) {\n      // A refusal of the point or an unset coefficient is a recorded refusal of\n      // this edge, under its own kind. Any other error (an alias conflict, a\n      // TypeError in an evaluator) is a different fact and propagates instead of\n      // reading as \"unrecoverable\" (§4 C6).\n      const kind = refusalKind(err);\n      if (kind === undefined) throw err;\n      refusals.push({ edge: e.id, kind, reason: (err as Error).message });\n      continue;\n    }\n    if (Number.isFinite(v)) predictions.push({ edge: e.id, value: v });\n  }\n\n  let relativeSpread = 0;\n  if (predictions.length >= 2) {\n    const vals = predictions.map((p) => p.value);\n    const max = Math.max(...vals);\n    const min = Math.min(...vals);\n    // Normalize the (max − min) span by the largest MAGNITUDE, not the mean:\n    // opposite-sign predictions (e.g. +6 and −6) cancel in the mean → a ~0\n    // denominator → spurious Infinity, even though the true relative spread is\n    // finite (12/6 = 2). `maxAbs === 0` only when every value is 0 (max = min),\n    // so the span is 0 too.\n    const maxAbs = Math.max(...vals.map(Math.abs));\n    relativeSpread = maxAbs > 0 ? (max - min) / maxAbs : 0;\n  }\n\n  let outcome: RetrodictionOutcome;\n  if (predictions.length === 0) outcome = 'unrecoverable';\n  else if (predictions.length === 1) outcome = 'single';\n  else outcome = relativeSpread <= tolerance ? 'consistent' : 'inconsistent';\n\n  const result: RetrodictionResult = {\n    target,\n    outcome,\n    predictions,\n    relativeSpread,\n    tolerance,\n    ...(refusals.length > 0 ? { refusals } : {}),\n    pass: outcome !== 'inconsistent',\n  };\n\n  const ref = opts.references?.[target];\n  if (ref !== undefined && predictions.length >= 1) {\n    const mean =\n      predictions.reduce((a, p) => a + p.value, 0) / predictions.length;\n    const referenceRelError = Math.abs(mean - ref) / (Math.abs(ref) || 1);\n    return {\n      ...result,\n      referenceValue: ref,\n      referenceRelError,\n      referencePass: referenceRelError <= (opts.referenceTolerance ?? 1e-3),\n    };\n  }\n\n  return result;\n}\n\n/**\n * Sweep the graph: retrodict every over-determined node (the classifier\n * is the feeder), plus any node with a supplied reference value. Returns\n * the per-node results and the headline `allConsistent` gate.\n *\n * @public\n */\nexport function retrodict(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  opts: RetrodictionOptions = {},\n): RetrodictionReport {\n  const idents = opts.identifications ?? QUANTITY_IDENTIFICATIONS;\n  const known = Object.keys(groundTruth);\n  const classified = classifyAll(edges, known, { identifications: idents });\n\n  const overDetermined = classified\n    .filter((r) => r.verdict === 'over-determined')\n    .map((r) => r.target);\n  const refTargets = opts.references ? Object.keys(opts.references) : [];\n  const targets = [...new Set([...overDetermined, ...refTargets])].sort();\n\n  const results = targets.map((t) =>\n    retrodictNode(edges, groundTruth, t, opts),\n  );\n\n  const consistent = results.filter((r) => r.outcome === 'consistent').length;\n  const inconsistent = results.filter(\n    (r) => r.outcome === 'inconsistent',\n  ).length;\n\n  return {\n    results,\n    checked: consistent + inconsistent,\n    consistent,\n    inconsistent,\n    allConsistent: inconsistent === 0,\n  };\n}\n"]}
+{"version":3,"file":"retrodiction.js","sourceRoot":"","sources":["../../src/composition/retrodiction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAGH,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAEpD,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEnD;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAgB,EAAE,MAAmC;IAC7E,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;IACnE,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;IACvE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AA4ED,yFAAyF;AACzF,SAAS,WAAW,CAAC,GAAY;IAC/B,IAAI,GAAG,YAAY,oBAAoB;QAAE,OAAO,QAAQ,CAAC;IACzD,IAAI,GAAG,YAAY,qBAAqB;QAAE,OAAO,mBAAmB,CAAC;IACrE,IAAI,GAAG,YAAY,gBAAgB;QAAE,OAAO,cAAc,CAAC;IAC3D,IAAI,GAAG,YAAY,YAAY;QAAE,OAAO,SAAS,CAAC;IAClD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kGAAkG;AAClG,SAAS,eAAe,CAAC,GAAY;IACnC,OAAO,WAAW,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;AACxC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,WAA6C,EAC7C,MAAyC;IAEzC,oEAAoE;IACpE,6EAA6E;IAC7E,uEAAuE;IACvE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,SAAS,CACjB,uCAAuC,IAAI,kCAAkC,CAAC,GAAG,CAClF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAiB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;IACpE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,OAAO,GAAG,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7D,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBAC7B,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAS;YACxC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YAC1D,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,CAAS,CAAC;YACd,IAAI,CAAC;gBACH,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9B,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,iFAAiF;gBACjF,gFAAgF;gBAChF,6EAA6E;gBAC7E,4EAA4E;gBAC5E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;oBAAE,MAAM,GAAG,CAAC;gBACrC,SAAS;YACX,CAAC;YACD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC7B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,WAA6C,EAC7C,MAAc,EACd,IAAI,GAAwB,EAAE;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IAChE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC;IAEzC,gEAAgE;IAChE,8DAA8D;IAC9D,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IAC3E,MAAM,MAAM,GAAG,eAAe,CAAC,oBAAoB,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IAE1E,MAAM,WAAW,GAA6B,EAAE,CAAC;IACjD,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACvC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,SAAS;QAC1D,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAS,CAAC;QACd,IAAI,CAAC;YACH,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,0EAA0E;YAC1E,uEAAuE;YACvE,2EAA2E;YAC3E,sCAAsC;YACtC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM,GAAG,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;YACpE,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,4EAA4E;QAC5E,wBAAwB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,cAAc,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,OAA4B,CAAC;IACjC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,eAAe,CAAC;SACnD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,QAAQ,CAAC;;QACjD,OAAO,GAAG,cAAc,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC;IAE3E,MAAM,MAAM,GAAuB;QACjC,MAAM;QACN,OAAO;QACP,WAAW;QACX,cAAc;QACd,SAAS;QACT,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,IAAI,EAAE,OAAO,KAAK,cAAc;KACjC,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,OAAO;YACL,GAAG,MAAM;YACT,cAAc,EAAE,GAAG;YACnB,iBAAiB;YACjB,aAAa,EAAE,iBAAiB,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC;SACtE,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,KAA4B,EAC5B,WAA6C,EAC7C,IAAI,GAAwB,EAAE;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IAChE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,CAAC;IAE1E,MAAM,cAAc,GAAG,UAAU;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,iBAAiB,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACvE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAExE,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAChC,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,IAAI,CAAC,CAC3C,CAAC;IAEF,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IAC5E,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CACpC,CAAC,MAAM,CAAC;IAET,OAAO;QACL,OAAO;QACP,OAAO,EAAE,UAAU,GAAG,YAAY;QAClC,UAAU;QACV,YAAY;QACZ,aAAa,EAAE,YAAY,KAAK,CAAC;KAClC,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Retrodiction harness (Consequence 2 of\n * docs/planning/Bridge-Inference-Epistemics-Note.md, designed in\n * docs/planning/Retrodiction-Harness-Design-Note.md).\n *\n * The framework's own falsification benchmark. Mask a quantity the graph\n * can compute, recompute it from ground-truth inputs via EACH independent\n * derivation, and check the predictions agree. This operationalizes the\n * identifiability classifier's OVER-DETERMINED verdict: the surplus\n * derivations of an over-determined node are PREDICTED to be consistency\n * constraints; the harness evaluates them and checks that numerically.\n *\n *   - consistent    — ≥2 derivations agree within tolerance.\n *   - inconsistent  — ≥2 derivations DISAGREE (a falsification: two\n *                     encodings of one quantity-name are not the same\n *                     physics).\n *   - single        — exactly one derivation fired (recovered, no check).\n *   - unrecoverable — no derivation fired from the ground truth.\n *\n * \"Mask\" = compute source values over the graph with every edge INTO the\n * target removed (the classifier's target-removed closure — so the node\n * is genuinely hidden, never read back through its own derivation).\n * Forward evaluation honors `QUANTITY_IDENTIFICATIONS` and is\n * domain-checked (an edge that refuses its domain contributes no\n * prediction). The consistency check needs no external truth and is the\n * re-runnable core; an optional `references` map adds external-value\n * scoring. Pass bar pre-registered in the design note (spread ≤ 1e-6).\n *\n * @module composition/retrodiction\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { CANONICAL_GROUP_PREFACTORS } from './canonical-prefactors.js';\nimport { CoefficientUnsetError, evaluateEdge } from './edge.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\nimport { CarrierSignError } from '../bridges/carrier-sign.js';\nimport { FormulaError } from '../numerical/formula-contract.js';\nimport { meanOf } from '../numerical/statistics.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport { conventionFactor } from '../dimensional/unit-convention.js';\nimport { classifyAll } from './identifiability.js';\n\n/**\n * Source values, plus a dimensionless group the edge multiplies when the\n * ground truth names it. The group is not a source: Buckingham cannot see\n * it, and a missing group is the unset coefficient, not a missing input.\n */\nfunction evaluationInputs(edge: BridgeEdge, values: ReadonlyMap<string, number>): Record<string, number> {\n  const inputs: Record<string, number> = {};\n  for (const s of edge.sources) inputs[s.name] = values.get(s.name)!;\n  const group = CANONICAL_GROUP_PREFACTORS.find((g) => g.id === edge.id);\n  if (group !== undefined) {\n    const g = values.get(group.group);\n    if (g !== undefined) inputs[group.group] = g;\n  }\n  return inputs;\n}\n\n/** Outcome of retrodicting one node. @public */\nexport type RetrodictionOutcome =\n  | 'consistent'\n  | 'inconsistent'\n  | 'single'\n  | 'unrecoverable';\n\n/** One derivation's recovered value for a masked node. @public */\nexport interface RetrodictionPrediction {\n  /** The edge id that produced this value. */\n  readonly edge: string;\n  readonly value: number;\n}\n\n/** Options for the harness. @public */\nexport interface RetrodictionOptions {\n  /** Identifications honored in forward evaluation (default registered). */\n  readonly identifications?: readonly QuantityIdentification[];\n  /** Relative-spread tolerance for `consistent` (default 1e-6). */\n  readonly tolerance?: number;\n  /** External (textbook) values to score recovered nodes against. */\n  readonly references?: Readonly<Record<string, number>>;\n  /** Relative-error tolerance for reference scoring (default 1e-3). */\n  readonly referenceTolerance?: number;\n}\n\n/** One refused edge in a retrodiction, with the kind of refusal. @public */\nexport interface RetrodictionRefusal {\n  readonly edge: string;\n  /**\n   * `domain`: the validity domain rejected the point. `coefficient-unset`: the edge has no\n   * sourced prefactor, whatever the values. `carrier-sign`: the carrier charge and the\n   * mobility had opposite signs. `formula`: the relation's formula did not evaluate at the\n   * point (a 0/0, say). Four facts, kept apart (AGENTS law 4).\n   */\n  readonly kind: 'domain' | 'coefficient-unset' | 'carrier-sign' | 'formula';\n  readonly reason: string;\n}\n\n/** The result of retrodicting one node. @public */\nexport interface RetrodictionResult {\n  readonly target: string;\n  readonly outcome: RetrodictionOutcome;\n  /** Recovered values, one per derivation that fired. */\n  readonly predictions: readonly RetrodictionPrediction[];\n  /** (max − min)/|mean| across predictions; 0 when fewer than two. */\n  readonly relativeSpread: number;\n  readonly tolerance: number;\n  /**\n   * Edges that refused the supplied values. `kind` keeps the refusals apart (AGENTS law 4):\n   * `domain`, `carrier-sign` and `formula` are the point (the edge does not fire there);\n   * `coefficient-unset` is the edge's own state (no sourced prefactor), whatever the values.\n   */\n  readonly refusals?: readonly RetrodictionRefusal[];\n  /** `outcome !== 'inconsistent'` — the falsification gate. */\n  readonly pass: boolean;\n  /** Supplied external value, when scored. */\n  readonly referenceValue?: number;\n  /** |mean(predictions) − reference| / |reference|, when scored. */\n  readonly referenceRelError?: number;\n  readonly referencePass?: boolean;\n}\n\n/** Aggregate report across the swept nodes. @public */\nexport interface RetrodictionReport {\n  readonly results: readonly RetrodictionResult[];\n  /** Nodes with ≥2 derivations (consistent + inconsistent). */\n  readonly checked: number;\n  readonly consistent: number;\n  readonly inconsistent: number;\n  /** The headline gate: no inconsistent node was found. */\n  readonly allConsistent: boolean;\n}\n\n/** The refusal an evaluator error is, or `undefined` when it is not a refusal at all. */\nfunction refusalKind(err: unknown): RetrodictionRefusal['kind'] | undefined {\n  if (err instanceof DomainViolationError) return 'domain';\n  if (err instanceof CoefficientUnsetError) return 'coefficient-unset';\n  if (err instanceof CarrierSignError) return 'carrier-sign';\n  if (err instanceof FormulaError) return 'formula';\n  return undefined;\n}\n\n/** True when the error says the edge does not fire here (or at all, for an unset coefficient). */\nfunction refusesThePoint(err: unknown): boolean {\n  return refusalKind(err) !== undefined;\n}\n\n/**\n * Monotone forward EVALUATION: propagate values from `groundTruth` through\n * the graph (domain-checked; identifications supply identified names;\n * non-finite or domain-refused edges do not fire). Each node is assigned\n * the value of the first edge that fires for it.\n *\n * Exported `@internal` so the discovery magnitude-gate can read a quantity's\n * value AT THE REGISTERED ANCHOR when the static representative-value table\n * has no entry for it (graph-derived quantities like `schwarzschild-radius`).\n *\n * @internal\n */\nexport function forwardEvaluate(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  idents: readonly QuantityIdentification[],\n): Map<string, number> {\n  // Finite-seed guard (matches the computed-value guard below and the\n  // library-wide finiteness discipline): a NaN/∞ seed would propagate silently\n  // through the graph and spoof downstream magnitude/consistency checks.\n  for (const [name, v] of Object.entries(groundTruth)) {\n    if (!Number.isFinite(v)) {\n      throw new TypeError(\n        `forwardEvaluate: ground-truth seed '${name}' must be a finite number, got ${v}.`,\n      );\n    }\n  }\n  const values = new Map<string, number>(Object.entries(groundTruth));\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const id of idents) {\n      const fromVal = values.get(id.from);\n      if (fromVal !== undefined && !values.has(id.to)) {\n        const converted = fromVal * conventionFactor(id.from, id.to);\n        if (Number.isFinite(converted)) {\n          values.set(id.to, converted);\n          changed = true;\n        }\n      }\n    }\n    for (const e of edges) {\n      if (values.has(e.target.name)) continue;\n      if (!e.sources.every((s) => values.has(s.name))) continue;\n      const inputs = evaluationInputs(e, values);\n      let v: number;\n      try {\n        v = evaluateEdge(e, inputs);\n      } catch (err) {\n        // The edge refusing this point (a domain miss, opposite carrier signs, a formula\n        // that has no finite value there) or an unset coefficient is \"the edge does not\n        // fire\". Anything else (an alias conflict, a TypeError in an evaluator) is a\n        // different fact and is not hidden as a non-derivation (9.0.0 audit §4 C6).\n        if (!refusesThePoint(err)) throw err;\n        continue;\n      }\n      if (Number.isFinite(v)) {\n        values.set(e.target.name, v);\n        changed = true;\n      }\n    }\n  }\n  return values;\n}\n\n/**\n * Retrodict one node: mask it (source values from the target-removed\n * graph), recover it via each incoming edge, and score the spread.\n *\n * @public\n */\nexport function retrodictNode(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  target: string,\n  opts: RetrodictionOptions = {},\n): RetrodictionResult {\n  const idents = opts.identifications ?? QUANTITY_IDENTIFICATIONS;\n  const tolerance = opts.tolerance ?? 1e-6;\n\n  // Masked source values: never let the target be assigned (so no\n  // derivation reads it back — circular self-support excluded).\n  const edgesMinusIntoTarget = edges.filter((e) => e.target.name !== target);\n  const values = forwardEvaluate(edgesMinusIntoTarget, groundTruth, idents);\n\n  const predictions: RetrodictionPrediction[] = [];\n  const refusals: RetrodictionRefusal[] = [];\n  for (const e of edges) {\n    if (e.target.name !== target) continue;\n    if (!e.sources.every((s) => values.has(s.name))) continue;\n    const inputs = evaluationInputs(e, values);\n    let v: number;\n    try {\n      v = evaluateEdge(e, inputs);\n    } catch (err) {\n      // A refusal of the point or an unset coefficient is a recorded refusal of\n      // this edge, under its own kind. Any other error (an alias conflict, a\n      // TypeError in an evaluator) is a different fact and propagates instead of\n      // reading as \"unrecoverable\" (§4 C6).\n      const kind = refusalKind(err);\n      if (kind === undefined) throw err;\n      refusals.push({ edge: e.id, kind, reason: (err as Error).message });\n      continue;\n    }\n    if (Number.isFinite(v)) predictions.push({ edge: e.id, value: v });\n  }\n\n  let relativeSpread = 0;\n  if (predictions.length >= 2) {\n    const vals = predictions.map((p) => p.value);\n    const max = Math.max(...vals);\n    const min = Math.min(...vals);\n    // Normalize the (max − min) span by the largest MAGNITUDE, not the mean:\n    // opposite-sign predictions (e.g. +6 and −6) cancel in the mean → a ~0\n    // denominator → spurious Infinity, even though the true relative spread is\n    // finite (12/6 = 2). `maxAbs === 0` only when every value is 0 (max = min),\n    // so the span is 0 too.\n    const maxAbs = Math.max(...vals.map(Math.abs));\n    relativeSpread = maxAbs > 0 ? (max - min) / maxAbs : 0;\n  }\n\n  let outcome: RetrodictionOutcome;\n  if (predictions.length === 0) outcome = 'unrecoverable';\n  else if (predictions.length === 1) outcome = 'single';\n  else outcome = relativeSpread <= tolerance ? 'consistent' : 'inconsistent';\n\n  const result: RetrodictionResult = {\n    target,\n    outcome,\n    predictions,\n    relativeSpread,\n    tolerance,\n    ...(refusals.length > 0 ? { refusals } : {}),\n    pass: outcome !== 'inconsistent',\n  };\n\n  const ref = opts.references?.[target];\n  if (ref !== undefined && predictions.length >= 1) {\n    const mean = meanOf(predictions.map((p) => p.value));\n    const referenceRelError = Math.abs(mean - ref) / (Math.abs(ref) || 1);\n    return {\n      ...result,\n      referenceValue: ref,\n      referenceRelError,\n      referencePass: referenceRelError <= (opts.referenceTolerance ?? 1e-3),\n    };\n  }\n\n  return result;\n}\n\n/**\n * Sweep the graph: retrodict every over-determined node (the classifier\n * is the feeder), plus any node with a supplied reference value. Returns\n * the per-node results and the headline `allConsistent` gate.\n *\n * @public\n */\nexport function retrodict(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  opts: RetrodictionOptions = {},\n): RetrodictionReport {\n  const idents = opts.identifications ?? QUANTITY_IDENTIFICATIONS;\n  const known = Object.keys(groundTruth);\n  const classified = classifyAll(edges, known, { identifications: idents });\n\n  const overDetermined = classified\n    .filter((r) => r.verdict === 'over-determined')\n    .map((r) => r.target);\n  const refTargets = opts.references ? Object.keys(opts.references) : [];\n  const targets = [...new Set([...overDetermined, ...refTargets])].sort();\n\n  const results = targets.map((t) =>\n    retrodictNode(edges, groundTruth, t, opts),\n  );\n\n  const consistent = results.filter((r) => r.outcome === 'consistent').length;\n  const inconsistent = results.filter(\n    (r) => r.outcome === 'inconsistent',\n  ).length;\n\n  return {\n    results,\n    checked: consistent + inconsistent,\n    consistent,\n    inconsistent,\n    allConsistent: inconsistent === 0,\n  };\n}\n"]}

package/dist/composition/user-equation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"user-equation.d.ts","sourceRoot":"","sources":["../../src/composition/user-equation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAOH,OAAO,EAA8B,KAAK,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAI5F,OAAO,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAKzD,oFAAoF;AACpF,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,iEAAiE;IACjE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAiBD,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,oFAAoF;AACpF,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAKjC;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,GAChC,MAAM,GAAG,IAAI,CAcf;AAsBD,yDAAyD;AACzD,MAAM,WAAW,0BAA0B;IACzC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC,+EAA+E;IAC/E,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;CAC1C;AAUD,wBAAsB,iBAAiB,CACrC,QAAQ,EAAE,MAAM,EAChB,YAAY,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GACpD,OAAO,CAAC,YAAY,CAAC,CAyCvB;AA0CD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,EAC9B,CAAC,SAAI,GACJ,MAAM,EAAE,CAEV;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,SAAS,EACd,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,CAAC,SAAI,EACL,IAAI,CAAC,EAAE,MAAM,GACZ,MAAM,EAAE,CAGV;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,+EAA+E;IAC/E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,kFAAkF;IAClF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,2DAA2D;IAC3D,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;CAClD;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,GAAG,eAAe,CAqBxF;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,QAAQ,EACf,OAAO,EAAE,eAAe,EACxB,OAAO,SAAI,GACV,SAAS,MAAM,EAAE,CA0BnB;AAED,4DAA4D;AAC5D,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;CACxB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,SAAS,GAAG,IAAI,CAAC;IACxC,QAAQ,CAAC,eAAe,EAAE,SAAS,GAAG,IAAI,CAAC;IAC3C,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,YAAY,EAAE,CAAC;IAChD;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,4EAA4E;IAC5E,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;;;GAOG;AACH,wBAAsB,mBAAmB,CACvC,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,OAAO,CAAC,EAAE,0BAA0B,GACnC,OAAO,CAAC,gBAAgB,CAAC,CAgI3B"}
+{"version":3,"file":"user-equation.d.ts","sourceRoot":"","sources":["../../src/composition/user-equation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAOH,OAAO,EAA8B,KAAK,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAI5F,OAAO,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAKzD,oFAAoF;AACpF,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,iEAAiE;IACjE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAiBD,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,oFAAoF;AACpF,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAKjC;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,GAChC,MAAM,GAAG,IAAI,CAcf;AAsBD,yDAAyD;AACzD,MAAM,WAAW,0BAA0B;IACzC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC,+EAA+E;IAC/E,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;CAC1C;AAUD,wBAAsB,iBAAiB,CACrC,QAAQ,EAAE,MAAM,EAChB,YAAY,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GACpD,OAAO,CAAC,YAAY,CAAC,CAuCvB;AA0CD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,EAC9B,CAAC,SAAI,GACJ,MAAM,EAAE,CAEV;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,SAAS,EACd,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,CAAC,SAAI,EACL,IAAI,CAAC,EAAE,MAAM,GACZ,MAAM,EAAE,CAGV;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,+EAA+E;IAC/E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,kFAAkF;IAClF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,2DAA2D;IAC3D,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;CAClD;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,GAAG,eAAe,CAqBxF;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,QAAQ,EACf,OAAO,EAAE,eAAe,EACxB,OAAO,SAAI,GACV,SAAS,MAAM,EAAE,CA0BnB;AAED,4DAA4D;AAC5D,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;CACxB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,SAAS,GAAG,IAAI,CAAC;IACxC,QAAQ,CAAC,eAAe,EAAE,SAAS,GAAG,IAAI,CAAC;IAC3C,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,YAAY,EAAE,CAAC;IAChD;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,4EAA4E;IAC5E,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;;;GAOG;AACH,wBAAsB,mBAAmB,CACvC,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,OAAO,CAAC,EAAE,0BAA0B,GACnC,OAAO,CAAC,gBAAgB,CAAC,CAgI3B"}

package/dist/composition/user-equation.js

@@ -21,7 +21,7 @@
 import { getFormulaParser, parsePhysics } from '../numerical/formula-registry.js';
 import { formulaSymbolDimension } from '../numerical/formula-dimension.js';
 import { CONSTANT_SPELLINGS } from '../dimensional/dimension-spec.js';
-import { CONSTANTS } from '../dimensional/symbolic-constants.js';
+import { CONSTANTS, isRegisteredConstant } from '../dimensional/symbolic-constants.js';
 import { formulaNameDimensions } from '../dimensional/formula-names.js';
 import { naturalNote, naturalPowers } from '../dimensional/natural-units.js';
 import { aliasesForTarget, editDistance } from './aliases.js';
@@ -131,7 +131,7 @@ export async function parseUserEquation(equation, catalogNames) {
         // No parse tree, so no subtraction was read: the hyphen hint needs the parsed variables.
         throw new UserEquationError(`could not parse the right-hand side '${rhs}': ${e.message}`);
     }
-    const sources = variables.filter((v) => !Object.prototype.hasOwnProperty.call(CONSTANTS, v));
+    const sources = variables.filter((v) => !isRegisteredConstant(v));
     // An all-constant right-hand side (the Planck length) is an equation about a catalog quantity
     // only when its target is one; otherwise it names nothing to check (persona finding W5).
     const targetIsCatalog = names !== undefined && resolveQuantityName(target, names) !== null;

package/dist/composition/user-equation.js.map

@@ -1 +1 @@
-{"version":3,"file":"user-equation.js","sourceRoot":"","sources":["../../src/composition/user-equation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,kCAAkC,CAAC;AACtE,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AACjE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAiB,MAAM,iCAAiC,CAAC;AAC5F,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,qBAAqB,EAAE,MAAM,uCAAuC,CAAC;AAE9E,oFAAoF;AACpF,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;IAClC,CAAC;CACF;AAeD;;;;;;;;;;;GAWG;AACH,8EAA8E;AAC9E,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,oFAAoF;AACpF,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAEjC,kFAAkF;AAClF,MAAM,UAAU,GAAG,8DAA8D,CAAC;AAElF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAW,EACX,SAA4B,EAC5B,YAAiC;IAEjC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAChD,CAAC,GAAG,EAAE,EAAE,CACN,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/C,mBAAmB,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,IAAI,CAClD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;IAC9D,OAAO,CACL,mEAAmE;QACnE,IAAI,OAAO,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAC/C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,uBAAuB,CAAC,IAAY;IAC3C,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,kBAAkB,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtD,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,oBAAoB,KAAK,kBAAkB,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,CAChB,0EAA0E,EAC1E,gBAAgB,CACjB,CAAC;AACJ,CAAC;AAcD,SAAS,gBAAgB,CAAC,OAAuC;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,qBAAqB,EAAE,EAAE,CAAC;QAClD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,QAAgB,EAChB,YAAqD;IAErD,IAAI,QAAQ,CAAC,MAAM,GAAG,qBAAqB,EAAE,CAAC;QAC5C,MAAM,IAAI,iBAAiB,CACzB,oBAAoB,qBAAqB,gBAAgB,QAAQ,CAAC,MAAM,GAAG,CAC5E,CAAC;IACJ,CAAC;IACD,iFAAiF;IACjF,MAAM,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxF,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,iBAAiB,CACzB,sDAAsD,QAAQ,IAAI,CACnE,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,iBAAiB,CAAC,4CAA4C,CAAC,CAAC;IACvF,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,iBAAiB,CAAC,uCAAuC,CAAC,CAAC;IAE/E,IAAI,SAA4B,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,gBAAgB,EAAE,CAAC;QACxC,CAAC,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,yFAAyF;QACzF,MAAM,IAAI,iBAAiB,CAAC,wCAAwC,GAAG,MAAO,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;IACvG,CAAC;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAC3D,CAAC;IACF,8FAA8F;IAC9F,yFAAyF;IACzF,MAAM,eAAe,GAAG,KAAK,KAAK,SAAS,IAAI,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC;IAC3F,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QAC7C,MAAM,IAAI,iBAAiB,CACzB,4BAA4B,GAAG,6BAA6B,CAC7D,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,4DAA4D;AAC5D,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;AAEzF,6FAA6F;AAC7F,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,UAA4B,EAAE,IAAa;IAC3E,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACzC,yFAAyF;IACzF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1D,kGAAkG;IAClG,+FAA+F;IAC/F,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,KAAa,EAAW,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,aAAa,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACjH,OAAO,CAAC,GAAG,UAAU,CAAC;SACnB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;IAC7D,CAAC,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC;SAC7D,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;QACvB,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM;QAC7B,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAC/B;SACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAY,EACZ,YAA8B,EAC9B,CAAC,GAAG,CAAC;IAEL,OAAO,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAc,EACd,WAA2C,EAC3C,CAAC,GAAG,CAAC,EACL,IAAa;IAEb,MAAM,IAAI,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAChG,OAAO,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxF,CAAC;AAmBD;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAe,EAAE,cAAsB;IACrE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC;IACnF,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,cAAc,CAAC,CAAC;IAClE,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,EAAE,EAAE,oBAAoB,EAAE,EAAE,EAAE,CAAC;IAC7G,CAAC;IACD,MAAM,oBAAoB,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,cAAc,CAAC,CAAC;IACvF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,EAAE,KAAK,cAAc,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7E,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC;YAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzE,CAAC;IACD,MAAM,gBAAgB,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAChG,OAAO;QACL,QAAQ,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC;QAC5B,WAAW,EAAE,OAAO,CAAC,IAAI;QACzB,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,gBAAgB;QAChB,oBAAoB;KACrB,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAe,EACf,OAAwB,EACxB,OAAO,GAAG,CAAC;IAEX,MAAM,GAAG,GAAG,OAAO,CAAC,oBAAoB,CAAC;IACzC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,EAAU,EAAU,EAAE,CAClC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAU,EAAE;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC;YAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,CAAC,EAAE,CAAC;QACnE,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAC1B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAC7E,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1C,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,OAAO,CAAC,2BAA2B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,OAAO;QACL,2BAA2B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ;QAC7D,0DAA0D;KAC3D,CAAC;AACJ,CAAC;AA+DD;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,QAAgB,EAChB,WAA2C,EAC3C,OAAoC;IAEpC,MAAM,MAAM,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,OAAO,EAAE,cAAc,KAAK,IAAI,CAAC;IACnD,2EAA2E;IAC3E,MAAM,EAAE,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,CAAC,CAAS,EAAiB,EAAE,CAChD,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACnD,MAAM,cAAc,GAAG,CAAC,CAAS,EAAiB,EAAE;QAClD,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxD,OAAO,mBAAmB,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IAC9C,CAAC,CAAC;IACF,yEAAyE;IACzE,kDAAkD;IAClD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,aAAa,EAAE,cAAc,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAiB,EAAE;QAC3C,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxD,OAAO,mBAAmB,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IACxD,CAAC,CAAC;IAEF,gFAAgF;IAChF,6EAA6E;IAC7E,uCAAuC;IACvC,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;IACtE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAe,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC;IAC5F,CAAC;IACD,0EAA0E;IAC1E,iDAAiD;IACjD,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAExD,IAAI,YAAY,GAAqB,IAAI,CAAC;IAC1C,IAAI,gBAAgB,GAA0D,IAAI,CAAC;IACnF,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACjD,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC;QAChC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC;IACjC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,6GAA6G;QAC7G,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,gBAAgB,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9C,CAAC;IAED,MAAM,cAAc,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAe,CAAC,CAAC,CAAC,IAAI,CAAC;IAE1F,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,gBAAgB,EAAE,CAAC;QACrB,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAC3F,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;YACjC,IAAI,KAAK,GAAoB,IAAI,CAAC;YAClC,IAAI,SAAS,GAAa,EAAE,CAAC;YAC7B,IAAI,eAAe,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,qBAAqB,CAAC,gBAAgB,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;gBAC7E,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnD,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,EAAE,CAAC;wBACrC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;6BAClC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;6BAC1C,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;6BACrB,IAAI,EAAE,CAAC;oBACZ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CACR,KAAK;gBACH,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,aAAa,EAAE;gBACtE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,aAAa,EAAE,CAC1G,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,cAAc,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YACvE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAClH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;SACrD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAc,EAAE,KAAK,EAAE,KAAc,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,cAAc,GAClB,CAAC,SAAS,IAAI,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,IAAI;QAC5C,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAc,EAAE,KAAK,EAAE,KAAc,EAAE,CAAC;QAC5G,CAAC,CAAC,EAAE,CAAC;IACT,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAc,EAAE,CAAC,CAAC,CAAC;IAE/F,IAAI,UAAU,GAAG,YAAY,IAAI,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,IAAI,OAA2B,CAAC;IAChC,IACE,UAAU,KAAK,KAAK;QACpB,YAAY;QACZ,eAAe;QACf,OAAO,EAAE,KAAK,KAAK,SAAS;QAC5B,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EACpB,CAAC;QACD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,EAAE,eAAe,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC3E,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACzE,IAAI,IAAI,EAAE,CAAC;YACT,UAAU,GAAG,IAAI,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE;YACR,EAAE,EAAE,eAAe;YACnB,KAAK,EAAE,EAAE,CAAC,IAAI;YACd,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,EAAE,cAAc,IAAI,EAAE,CAAC,MAAM;SACpC;QACD,UAAU;QACV,YAAY;QACZ,eAAe;QACf,UAAU;QACV,KAAK;QACL,aAAa,EAAE,CAAC,GAAG,QAAQ,EAAE,GAAG,UAAU,EAAE,GAAG,cAAc,CAAC;QAC9D,YAAY;QACZ,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;KAC3D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * User-equation injection — turn a free-form `TARGET = EXPR` string into a graph\n * junction (a target quantity + its source quantities), resolve the user's\n * symbols onto the catalog vocabulary, suggest near-misses, and report where the\n * injected junction lands in a built {@link VizModel}.\n *\n * Free-form means no dimensions: source quantities are the RHS's free variables\n * — extracted by the MathTS expression parser via {@link getFormulaParser},\n * which already drops constants like `pi`/`tau`, numbers, and functions —\n * minus the physics {@link CONSTANTS}. Multi-word quantities may be typed with\n * underscores **or** the catalog's own hyphens (`planck-length`): before parse,\n * {@link rewriteCatalogHyphens} rewrites kebab catalog names to underscores so\n * `-` is not read as subtraction (persona finding W2). Resolution still tries\n * the literal form first, then the `_`↔`-` swap.\n *\n * Pure: no file I/O. The injected junction is rendered as an `extraJunction`\n * (status `'user'`) and is never written into the catalog.\n *\n * @module composition/user-equation\n */\n\nimport { getFormulaParser, parsePhysics } from '../numerical/formula-registry.js';\nimport { formulaSymbolDimension } from '../numerical/formula-dimension.js';\nimport { CONSTANT_SPELLINGS } from '../dimensional/dimension-spec.js';\nimport { CONSTANTS } from '../dimensional/symbolic-constants.js';\nimport { formulaNameDimensions } from '../dimensional/formula-names.js';\nimport { naturalNote, naturalPowers, type UnitMode } from '../dimensional/natural-units.js';\nimport { aliasesForTarget, editDistance } from './aliases.js';\nimport { resolveQuantityName } from '../dimensional/formula-names.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport type { VizModel, VizJunction } from './graph-viz.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals } from '../dimensional/algebra.js';\nimport { inferUnknownDimension } from '../dimensional/dimension-inference.js';\n\n/** Thrown when a user equation cannot be parsed into a target + sources. @public */\nexport class UserEquationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UserEquationError';\n  }\n}\n\n/**\n * A parsed user equation: the target quantity and its source quantities, as\n * written (underscores preserved; constants/numbers/functions removed).\n *\n * @public\n */\nexport interface UserEquation {\n  readonly target: string;\n  readonly sources: readonly string[];\n  /** The original `TARGET = EXPR` text, for the junction label. */\n  readonly text: string;\n}\n\n/**\n * Parse `TARGET = EXPR` into `{ target, sources }`. The target is the text left\n * of the first `=`; the sources are the RHS's free variables minus the physics\n * constants.\n *\n * Uses the active formula parser (MathTS when installed, built-in otherwise) to\n * extract the RHS's free variables.\n *\n * @throws {UserEquationError} on a missing `=`, an empty target, an unparseable\n *   RHS, or an RHS with no source quantities.\n * @public\n */\n/** Upper bound on user `--equation` text to keep hint computation bounded. */\nconst MAX_USER_EQUATION_LEN = 8192;\n\nimport { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';\n/** Rewrite a catalog hyphenated name to underscores before the expression parse. */\nexport { rewriteCatalogHyphens };\n\n/** A hyphen-joined run of names, `a-b` or `a-b-c`, not the exponent of `1e-5`. */\nconst HYPHEN_RUN = /(?<![A-Za-z0-9_.])[A-Za-z_][A-Za-z0-9_]*(?:-[A-Za-z0-9_]+)+/g;\n\n/**\n * When the parse read a hyphen-joined run (`thermal-mass`) as a subtraction of\n * its pieces, and the run read as one name is a catalog quantity, tell the user\n * `-` is arithmetic here and to use underscores. Persona finding I2.\n *\n * Decided from the parse, not from an error's text: `variables` are the free\n * variables the formula parser read from `rhs`. The parser has no hyphenated\n * identifier, so a run whose underscored name is not a variable and whose\n * pieces are was parsed as a subtraction.\n *\n * @internal\n */\nexport function hyphenSubtractHint(\n  rhs: string,\n  variables: readonly string[],\n  catalogNames: ReadonlySet<string>,\n): string | null {\n  const read = new Set(variables);\n  const split = (rhs.match(HYPHEN_RUN) ?? []).filter(\n    (run) =>\n      !read.has(run.replace(/-/g, '_')) &&\n      run.split('-').some((piece) => read.has(piece)) &&\n      resolveQuantityName(run, catalogNames) !== null,\n  );\n  if (split.length === 0) return null;\n  const example = split.sort((a, b) => b.length - a.length)[0]!;\n  return (\n    `'-' is arithmetic here; multi-word catalog names use underscores ` +\n    `(${example} → ${example.replace(/-/g, '_')})`\n  );\n}\n\n/**\n * Spellings that must not be a bare `e`. Constant aliases come from\n * {@link CONSTANT_SPELLINGS}. `1-eccentricity^2` is the perihelion factor\n * `one_minus_e_sq`.\n */\nfunction rewriteFormulaSpellings(text: string): string {\n  let out = text;\n  for (const { names } of CONSTANT_SPELLINGS) {\n    const canonical = names[0]!;\n    for (const alias of names.slice(1)) {\n      if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(alias)) continue;\n      out = out.replace(new RegExp(`(?<![A-Za-z0-9_])${alias}(?![A-Za-z0-9_])`, 'g'), canonical);\n    }\n  }\n  return out.replace(\n    /(?<![A-Za-z0-9_])1\\s*-\\s*eccentricity\\s*(?:\\^|\\*\\*)\\s*2(?![A-Za-z0-9_])/g,\n    'one_minus_e_sq',\n  );\n}\n\n/** Options for {@link analyzeUserEquation}. @internal */\nexport interface AnalyzeUserEquationOptions {\n  /**\n   * Bind a one-letter token that is itself a catalog quantity (`a`, `r`, …).\n   * Default false: the match is reported and not applied. The alias `T` →\n   * `temperature` is not a one-letter catalog name and still binds.\n   */\n  readonly bindShortNames?: boolean;\n  /** Reconcile a dimension difference by powers of c, ħ, and (geometrized) G. */\n  readonly units?: Exclude<UnitMode, 'si'>;\n}\n\nfunction withFormulaNames(catalog: ReadonlyMap<string, Dimension>): Map<string, Dimension> {\n  const out = new Map(catalog);\n  for (const [name, dim] of formulaNameDimensions()) {\n    if (!out.has(name)) out.set(name, dim);\n  }\n  return out;\n}\n\nexport async function parseUserEquation(\n  equation: string,\n  catalogNames?: ReadonlySet<string> | Iterable<string>,\n): Promise<UserEquation> {\n  if (equation.length > MAX_USER_EQUATION_LEN) {\n    throw new UserEquationError(\n      `equation exceeds ${MAX_USER_EQUATION_LEN} characters (${equation.length})`,\n    );\n  }\n  // Materialized once: an iterator (`map.keys()`) would be spent by the first use.\n  const names = catalogNames === undefined ? undefined : new Set(catalogNames);\n  const spelled = rewriteFormulaSpellings(equation);\n  const rewritten = names === undefined ? spelled : rewriteCatalogHyphens(spelled, names);\n  const eqIdx = rewritten.indexOf('=');\n  if (eqIdx < 0) {\n    throw new UserEquationError(\n      `equation must be \"TARGET = EXPR\" (no \"=\" found in '${equation}')`,\n    );\n  }\n  const target = rewritten.slice(0, eqIdx).trim();\n  if (!target) throw new UserEquationError('equation has an empty target (left of \"=\")');\n  const rhs = rewritten.slice(eqIdx + 1).trim();\n  if (!rhs) throw new UserEquationError('equation has an empty right-hand side');\n\n  let variables: readonly string[];\n  try {\n    const parser = await getFormulaParser();\n    ({ variables } = parser.parse(rhs));\n  } catch (e) {\n    // No parse tree, so no subtraction was read: the hyphen hint needs the parsed variables.\n    throw new UserEquationError(`could not parse the right-hand side '${rhs}': ${(e as Error).message}`);\n  }\n  const sources = variables.filter(\n    (v) => !Object.prototype.hasOwnProperty.call(CONSTANTS, v),\n  );\n  // An all-constant right-hand side (the Planck length) is an equation about a catalog quantity\n  // only when its target is one; otherwise it names nothing to check (persona finding W5).\n  const targetIsCatalog = names !== undefined && resolveQuantityName(target, names) !== null;\n  if (sources.length === 0 && !targetIsCatalog) {\n    throw new UserEquationError(\n      `no source quantities in '${rhs}' (only constants/numbers?)`,\n    );\n  }\n  return { target, sources, text: rewritten.trim() };\n}\n\n/** Normalize for comparison: lowercase, `_`/`-` unified. */\nconst normalizeForCompare = (s: string): string => s.toLowerCase().replace(/[_-]/g, '-');\n\n/** The shortest name that counts as contained in another for the \"did you mean?\" ranking. */\nconst MIN_CONTAINED = 3;\n\n/**\n * The one \"did you mean?\" ranking, shared by {@link suggestQuantities} and\n * {@link suggestByDimension}: edit distance first, then containment (one name\n * inside the other), then length, then name. Edit distance leads so a one-edit\n * typo beats a substring: `hawkng-temperature` → `hawking-temperature` before\n * `temperature` (persona finding N5). `gate` keeps a candidate only if one name\n * contains the other (the contained one at least three characters long) or the\n * distance is small against the query length; the\n * dimension-based caller passes `false`, because there the dimension is the evidence.\n */\nfunction rankByName(name: string, candidates: Iterable<string>, gate: boolean): string[] {\n  const needle = normalizeForCompare(name);\n  // Without the gate, short catalog names (`a`, `nu`) are spurious \"matches\" for any typo.\n  const maxDist = Math.max(1, Math.ceil(needle.length / 2));\n  // A contained name counts only from MIN_CONTAINED characters: every one-letter name occurs inside\n  // a long input (`schrodinger-equation` holds a, g, q, r), and that is not nearness (audit I5).\n  const within = (outer: string, inner: string): boolean => inner.length >= MIN_CONTAINED && outer.includes(inner);\n  return [...candidates]\n    .map((cand) => {\n      const hay = normalizeForCompare(cand);\n      const contains = within(hay, needle) || within(needle, hay) ? 0 : 1;\n      return { cand, contains, dist: editDistance(needle, hay) };\n    })\n    .filter((s) => !gate || s.contains === 0 || s.dist <= maxDist)\n    .sort(\n      (x, y) =>\n        x.dist - y.dist ||\n        x.contains - y.contains ||\n        x.cand.length - y.cand.length ||\n        x.cand.localeCompare(y.cand),\n    )\n    .map((s) => s.cand);\n}\n\n/**\n * Up to `k` catalog names most similar to `name` — the \"did you mean?\" set for an\n * unmatched user symbol. Ranked by edit distance first, then containment, then\n * length (the shared ranking of `upt map` and `upt explain`).\n *\n * @public\n */\nexport function suggestQuantities(\n  name: string,\n  catalogNames: Iterable<string>,\n  k = 5,\n): string[] {\n  return rankByName(name, catalogNames, true).slice(0, k);\n}\n\n/**\n * Catalog quantity names whose dimension equals `dim`, capped at `k` — the\n * dimension-based \"did you mean?\" set once an unknown symbol's dimension has\n * been inferred. With `near` (the unknown symbol) they are ranked by the same\n * edit-distance ranking as {@link suggestQuantities}, so `lenght` lists `length`\n * first (persona finding N2); without it they are sorted by name.\n *\n * @public\n */\nexport function suggestByDimension(\n  dim: Dimension,\n  catalogDims: ReadonlyMap<string, Dimension>,\n  k = 5,\n  near?: string,\n): string[] {\n  const same = [...catalogDims.entries()].filter(([, d]) => equals(d, dim)).map(([name]) => name);\n  return (near === undefined ? same.sort() : rankByName(near, same, false)).slice(0, k);\n}\n\n/**\n * Where the injected user junction landed, computed from a built `VizModel`.\n *\n * @public\n */\nexport interface EquationLanding {\n  readonly isolated: boolean;\n  /** Junctions in the user equation's connected component (including itself). */\n  readonly clusterSize: number;\n  /** The component holds a law/established junction (anchored to known physics). */\n  readonly anchored: boolean;\n  /** User-equation quantities that also appear in a neighbouring junction. */\n  readonly sharedQuantities: readonly string[];\n  /** Other junction ids in the user equation's component. */\n  readonly connectedJunctionIds: readonly string[];\n}\n\n/**\n * Describe where `userJunctionId` sits in `model`: its component, the junctions it\n * connects to, and the quantities that link it to them.\n *\n * @public\n */\nexport function equationLanding(model: VizModel, userJunctionId: string): EquationLanding {\n  const cluster = model.clusters.find((c) => c.junctionIds.includes(userJunctionId));\n  const self = model.junctions.find((j) => j.id === userJunctionId);\n  if (!cluster || !self) {\n    return { isolated: true, clusterSize: 1, anchored: false, sharedQuantities: [], connectedJunctionIds: [] };\n  }\n  const connectedJunctionIds = cluster.junctionIds.filter((id) => id !== userJunctionId);\n  const selfQuantities = new Set([...self.sources, self.target]);\n  const neighbourQuantities = new Set<string>();\n  for (const j of model.junctions) {\n    if (j.id === userJunctionId || !cluster.junctionIds.includes(j.id)) continue;\n    for (const qn of [...j.sources, j.target]) neighbourQuantities.add(qn);\n  }\n  const sharedQuantities = [...selfQuantities].filter((qn) => neighbourQuantities.has(qn)).sort();\n  return {\n    isolated: cluster.size === 1,\n    clusterSize: cluster.size,\n    anchored: cluster.anchored,\n    sharedQuantities,\n    connectedJunctionIds,\n  };\n}\n\n/**\n * One or two lines summarising `connects to:` (persona findings W3 / I3).\n * Dumping ~100 edge ids next to a correct pendulum equation made shared\n * `length`/`temperature` look like a physics claim. Rank by overlap with the\n * user's shared quantities first, then textbook/law over bridges, then name.\n * When the list is long, state the structural caveat explicitly.\n *\n * @internal\n */\nexport function formatConnectedSummary(\n  model: VizModel,\n  landing: EquationLanding,\n  maxShow = 5,\n): readonly string[] {\n  const ids = landing.connectedJunctionIds;\n  if (ids.length === 0) return [];\n  const shared = new Set(landing.sharedQuantities);\n  const byId = new Map(model.junctions.map((j) => [j.id, j]));\n  const tier = (id: string): number =>\n    id.startsWith('CE-') || id.startsWith('law-') ? 0 : id.startsWith('be-') ? 1 : 2;\n  const overlap = (id: string): number => {\n    const j = byId.get(id);\n    if (!j) return 0;\n    let n = 0;\n    for (const qn of [...j.sources, j.target]) if (shared.has(qn)) n++;\n    return n;\n  };\n  const ranked = [...ids].sort(\n    (a, b) => overlap(b) - overlap(a) || tier(a) - tier(b) || a.localeCompare(b),\n  );\n  const shown = ranked.slice(0, maxShow);\n  const more = ranked.length - shown.length;\n  if (more <= 0) {\n    return [`     nearest equations: ${shown.join(', ')}`];\n  }\n  return [\n    `     nearest equations: ${shown.join(', ')} (+${more} more)`,\n    '     (shared-quantity connectivity, not a physics claim)',\n  ];\n}\n\n/** A \"did you mean?\" suggestion for an unmatched symbol. */\nexport interface EquationHint {\n  readonly name: string;\n  readonly suggestions: readonly string[];\n  /** True when the suggestions come from the symbol's INFERRED dimension. */\n  readonly byDimension: boolean;\n  /**\n   * Registered constants that carry the symbol's inferred dimension (`sigma` → `sigma_sb`,\n   * persona finding L5). Present only when a dimension was inferred and it is not dimensionless.\n   */\n  readonly constants?: readonly string[];\n}\n\n/** A one-letter user name bound to a catalog quantity (persona finding W6). */\nexport interface ShortBinding {\n  readonly name: string;\n  readonly quantity: string;\n  readonly dim: Dimension;\n  /**\n   * Present and false when a one-letter catalog name was recognised and not\n   * applied. Omitted when the name was bound.\n   */\n  readonly bound?: false;\n}\n\n/**\n * Full analysis of a user equation against a catalog name→dimension map: the\n * `user` junction (for the graph), the dimensional verdict (RHS dimension vs the\n * target's catalog dimension), and \"did you mean?\" hints (dimension-based when a\n * single unknown's dimension can be inferred, else name-similarity).\n *\n * Physics constants (`hbar`, `c`, `k_B`, …) are supplied to the parser with\n * their real dimensions (from `CONSTANTS`) so the dimensional check is correct.\n *\n * @public\n */\nexport interface EquationAnalysis {\n  readonly junction: VizJunction;\n  /** Set when the RHS is not dimensionally well-formed (then dims are null). */\n  readonly parseError: string | null;\n  readonly rhsDimension: Dimension | null;\n  readonly targetDimension: Dimension | null;\n  /** rhsDimension === targetDimension; null when unknowable or parse failed. */\n  readonly consistent: boolean | null;\n  readonly hints: readonly EquationHint[];\n  /**\n   * One-letter names that resolved to a catalog quantity. A one-letter name is the likeliest to\n   * mean something else: the catalog's `a` is perihelion's semi-major axis, a length, and the\n   * Unruh formula's `a` is an acceleration (persona finding W6).\n   */\n  readonly shortBindings: readonly ShortBinding[];\n  /**\n   * RHS names given a dimensionless placeholder because they did not resolve.\n   * The reported RHS dimension treats them as dimensionless, so it is not a\n   * check of the formula until they are bound.\n   */\n  readonly placeholders: readonly string[];\n  /** Set when `--natural` / `--geometrized` reconciled the two dimensions. */\n  readonly naturalNote?: string;\n}\n\n/**\n * Parse + dimensionally analyze a user `TARGET = EXPR` against `catalogDims`\n * (catalog quantity name → dimension). Throws {@link UserEquationError} on a\n * structurally malformed equation; reports a dimensional malformation via\n * `parseError`.\n *\n * @public\n */\nexport async function analyzeUserEquation(\n  equation: string,\n  catalogDims: ReadonlyMap<string, Dimension>,\n  options?: AnalyzeUserEquationOptions,\n): Promise<EquationAnalysis> {\n  const dimsIn = withFormulaNames(catalogDims);\n  const catalogNames = new Set(dimsIn.keys());\n  const bindShort = options?.bindShortNames === true;\n  // W2: rewrite catalog kebabs before either parser sees `-` as subtraction.\n  const eq = await parseUserEquation(equation, catalogNames);\n  const literalShort = (n: string): string | null =>\n    n.length === 1 && catalogNames.has(n) ? n : null;\n  const resolveCatalog = (n: string): string | null => {\n    if (!bindShort && literalShort(n) !== null) return null;\n    return resolveQuantityName(n, catalogNames);\n  };\n  // Evaluate keys are aliases of this target's sources. `R` is reflectance\n  // on radiation-pressure and is not a global name.\n  const aliasMap = aliasesForTarget(CATALOG_GRAPH, resolveCatalog(eq.target) ?? '');\n  const resolve = (n: string): string | null => {\n    if (!bindShort && literalShort(n) !== null) return null;\n    return resolveQuantityName(n, catalogNames, aliasMap);\n  };\n\n  // dims for parsePhysics: physics constants carry their REAL dimensions; matched\n  // sources their catalog dimension; the (≤1) unmatched source a DIMENSIONLESS\n  // placeholder so the RHS still parses.\n  const dims: Record<string, Dimension> = {};\n  for (const [name, c] of Object.entries(CONSTANTS)) dims[name] = c.dim;\n  for (const s of eq.sources) {\n    const r = resolve(s);\n    dims[s] = r ? (dimsIn.get(r) as Dimension) : (formulaSymbolDimension(s) ?? DIMENSIONLESS);\n  }\n  // Use the rewritten equation's RHS (eq.text) so planck-length has already\n  // become planck_length before dimensional parse.\n  const rhsText = eq.text.slice(eq.text.indexOf('=') + 1);\n\n  let rhsDimension: Dimension | null = null;\n  let exprForInference: import('../dimensional/validator.js').ExprNode | null = null;\n  let parseError: string | null = null;\n  try {\n    const parsed = await parsePhysics(rhsText, dims);\n    rhsDimension = parsed.dimension;\n    exprForInference = parsed.expr;\n  } catch (e) {\n    const msg = e instanceof Error ? e.message : String(e);\n    // The formula parser already read this right-hand side (parseUserEquation), so its variables are the tree's.\n    const { variables } = (await getFormulaParser()).parse(rhsText);\n    const hint = hyphenSubtractHint(rhsText, variables, catalogNames);\n    parseError = hint ? `${msg}. ${hint}` : msg;\n  }\n\n  const resolvedTarget = resolve(eq.target);\n  const targetDimension = resolvedTarget ? (dimsIn.get(resolvedTarget) as Dimension) : null;\n\n  const placeholders = eq.sources.filter((s) => !resolve(s));\n  const hints: EquationHint[] = [];\n  if (exprForInference) {\n    const unmatchedSources = placeholders.filter((s) => bindShort || literalShort(s) === null);\n    const totalUnmatched = placeholders.length + (resolvedTarget ? 0 : 1);\n    for (const s of unmatchedSources) {\n      let byDim: string[] | null = null;\n      let constants: string[] = [];\n      if (targetDimension && totalUnmatched === 1) {\n        const inferred = inferUnknownDimension(exprForInference, s, targetDimension);\n        if (inferred) {\n          byDim = suggestByDimension(inferred, dimsIn, 5, s);\n          if (!equals(inferred, DIMENSIONLESS)) {\n            constants = Object.entries(CONSTANTS)\n              .filter(([, c]) => equals(c.dim, inferred))\n              .map(([name]) => name)\n              .sort();\n          }\n        }\n      }\n      const withConstants = constants.length > 0 ? { constants } : {};\n      hints.push(\n        byDim\n          ? { name: s, suggestions: byDim, byDimension: true, ...withConstants }\n          : { name: s, suggestions: suggestQuantities(s, catalogNames, 5), byDimension: false, ...withConstants },\n      );\n    }\n    if (!resolvedTarget && (bindShort || literalShort(eq.target) === null)) {\n      hints.push({ name: eq.target, suggestions: suggestQuantities(eq.target, catalogNames, 5), byDimension: false });\n    }\n  }\n\n  const declined = eq.sources\n    .filter((s) => !bindShort && literalShort(s) !== null)\n    .map((s) => ({ name: s, quantity: s, dim: dimsIn.get(s) as Dimension, bound: false as const }));\n  const declinedTarget =\n    !bindShort && literalShort(eq.target) !== null\n      ? [{ name: eq.target, quantity: eq.target, dim: dimsIn.get(eq.target) as Dimension, bound: false as const }]\n      : [];\n  const boundShort = eq.sources\n    .filter((s) => s.length === 1 && resolve(s) !== null)\n    .map((s) => ({ name: s, quantity: resolve(s)!, dim: dimsIn.get(resolve(s)!) as Dimension }));\n\n  let consistent = rhsDimension && targetDimension ? equals(rhsDimension, targetDimension) : null;\n  let natural: string | undefined;\n  if (\n    consistent === false &&\n    rhsDimension &&\n    targetDimension &&\n    options?.units !== undefined &&\n    (hints.length === 0)\n  ) {\n    const powers = naturalPowers(rhsDimension, targetDimension, options.units);\n    const note = powers === null ? null : naturalNote(powers, options.units);\n    if (note) {\n      consistent = true;\n      natural = note;\n    }\n  }\n\n  return {\n    junction: {\n      id: 'user-equation',\n      label: eq.text,\n      status: 'user',\n      sources: eq.sources.map((s) => resolve(s) ?? s),\n      target: resolvedTarget ?? eq.target,\n    },\n    parseError,\n    rhsDimension,\n    targetDimension,\n    consistent,\n    hints,\n    shortBindings: [...declined, ...boundShort, ...declinedTarget],\n    placeholders,\n    ...(natural === undefined ? {} : { naturalNote: natural }),\n  };\n}\n"]}
+{"version":3,"file":"user-equation.js","sourceRoot":"","sources":["../../src/composition/user-equation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,kCAAkC,CAAC;AACtE,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AACvF,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAiB,MAAM,iCAAiC,CAAC;AAC5F,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,qBAAqB,EAAE,MAAM,uCAAuC,CAAC;AAE9E,oFAAoF;AACpF,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;IAClC,CAAC;CACF;AAeD;;;;;;;;;;;GAWG;AACH,8EAA8E;AAC9E,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,oFAAoF;AACpF,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAEjC,kFAAkF;AAClF,MAAM,UAAU,GAAG,8DAA8D,CAAC;AAElF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAW,EACX,SAA4B,EAC5B,YAAiC;IAEjC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAChD,CAAC,GAAG,EAAE,EAAE,CACN,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/C,mBAAmB,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,IAAI,CAClD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;IAC9D,OAAO,CACL,mEAAmE;QACnE,IAAI,OAAO,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAC/C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,uBAAuB,CAAC,IAAY;IAC3C,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,kBAAkB,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtD,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,oBAAoB,KAAK,kBAAkB,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,CAChB,0EAA0E,EAC1E,gBAAgB,CACjB,CAAC;AACJ,CAAC;AAcD,SAAS,gBAAgB,CAAC,OAAuC;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,qBAAqB,EAAE,EAAE,CAAC;QAClD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,QAAgB,EAChB,YAAqD;IAErD,IAAI,QAAQ,CAAC,MAAM,GAAG,qBAAqB,EAAE,CAAC;QAC5C,MAAM,IAAI,iBAAiB,CACzB,oBAAoB,qBAAqB,gBAAgB,QAAQ,CAAC,MAAM,GAAG,CAC5E,CAAC;IACJ,CAAC;IACD,iFAAiF;IACjF,MAAM,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxF,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,iBAAiB,CACzB,sDAAsD,QAAQ,IAAI,CACnE,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,iBAAiB,CAAC,4CAA4C,CAAC,CAAC;IACvF,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,iBAAiB,CAAC,uCAAuC,CAAC,CAAC;IAE/E,IAAI,SAA4B,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,gBAAgB,EAAE,CAAC;QACxC,CAAC,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,yFAAyF;QACzF,MAAM,IAAI,iBAAiB,CAAC,wCAAwC,GAAG,MAAO,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;IACvG,CAAC;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,8FAA8F;IAC9F,yFAAyF;IACzF,MAAM,eAAe,GAAG,KAAK,KAAK,SAAS,IAAI,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC;IAC3F,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QAC7C,MAAM,IAAI,iBAAiB,CACzB,4BAA4B,GAAG,6BAA6B,CAC7D,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,4DAA4D;AAC5D,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;AAEzF,6FAA6F;AAC7F,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,UAA4B,EAAE,IAAa;IAC3E,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACzC,yFAAyF;IACzF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1D,kGAAkG;IAClG,+FAA+F;IAC/F,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,KAAa,EAAW,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,aAAa,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACjH,OAAO,CAAC,GAAG,UAAU,CAAC;SACnB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;IAC7D,CAAC,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC;SAC7D,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;QACvB,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM;QAC7B,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAC/B;SACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAY,EACZ,YAA8B,EAC9B,CAAC,GAAG,CAAC;IAEL,OAAO,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAc,EACd,WAA2C,EAC3C,CAAC,GAAG,CAAC,EACL,IAAa;IAEb,MAAM,IAAI,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAChG,OAAO,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxF,CAAC;AAmBD;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAe,EAAE,cAAsB;IACrE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC;IACnF,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,cAAc,CAAC,CAAC;IAClE,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,EAAE,EAAE,oBAAoB,EAAE,EAAE,EAAE,CAAC;IAC7G,CAAC;IACD,MAAM,oBAAoB,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,cAAc,CAAC,CAAC;IACvF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,EAAE,KAAK,cAAc,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7E,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC;YAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzE,CAAC;IACD,MAAM,gBAAgB,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAChG,OAAO;QACL,QAAQ,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC;QAC5B,WAAW,EAAE,OAAO,CAAC,IAAI;QACzB,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,gBAAgB;QAChB,oBAAoB;KACrB,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAe,EACf,OAAwB,EACxB,OAAO,GAAG,CAAC;IAEX,MAAM,GAAG,GAAG,OAAO,CAAC,oBAAoB,CAAC;IACzC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,EAAU,EAAU,EAAE,CAClC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAU,EAAE;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC;YAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,CAAC,EAAE,CAAC;QACnE,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAC1B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAC7E,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1C,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,OAAO,CAAC,2BAA2B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,OAAO;QACL,2BAA2B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ;QAC7D,0DAA0D;KAC3D,CAAC;AACJ,CAAC;AA+DD;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,QAAgB,EAChB,WAA2C,EAC3C,OAAoC;IAEpC,MAAM,MAAM,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,OAAO,EAAE,cAAc,KAAK,IAAI,CAAC;IACnD,2EAA2E;IAC3E,MAAM,EAAE,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,CAAC,CAAS,EAAiB,EAAE,CAChD,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACnD,MAAM,cAAc,GAAG,CAAC,CAAS,EAAiB,EAAE;QAClD,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxD,OAAO,mBAAmB,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IAC9C,CAAC,CAAC;IACF,yEAAyE;IACzE,kDAAkD;IAClD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,aAAa,EAAE,cAAc,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAiB,EAAE;QAC3C,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxD,OAAO,mBAAmB,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IACxD,CAAC,CAAC;IAEF,gFAAgF;IAChF,6EAA6E;IAC7E,uCAAuC;IACvC,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;IACtE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAe,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC;IAC5F,CAAC;IACD,0EAA0E;IAC1E,iDAAiD;IACjD,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAExD,IAAI,YAAY,GAAqB,IAAI,CAAC;IAC1C,IAAI,gBAAgB,GAA0D,IAAI,CAAC;IACnF,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACjD,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC;QAChC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC;IACjC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,6GAA6G;QAC7G,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,gBAAgB,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9C,CAAC;IAED,MAAM,cAAc,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAe,CAAC,CAAC,CAAC,IAAI,CAAC;IAE1F,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,gBAAgB,EAAE,CAAC;QACrB,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAC3F,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;YACjC,IAAI,KAAK,GAAoB,IAAI,CAAC;YAClC,IAAI,SAAS,GAAa,EAAE,CAAC;YAC7B,IAAI,eAAe,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,qBAAqB,CAAC,gBAAgB,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;gBAC7E,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnD,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,EAAE,CAAC;wBACrC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;6BAClC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;6BAC1C,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;6BACrB,IAAI,EAAE,CAAC;oBACZ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CACR,KAAK;gBACH,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,aAAa,EAAE;gBACtE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,aAAa,EAAE,CAC1G,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,cAAc,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YACvE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAClH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;SACrD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAc,EAAE,KAAK,EAAE,KAAc,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,cAAc,GAClB,CAAC,SAAS,IAAI,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,IAAI;QAC5C,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAc,EAAE,KAAK,EAAE,KAAc,EAAE,CAAC;QAC5G,CAAC,CAAC,EAAE,CAAC;IACT,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAc,EAAE,CAAC,CAAC,CAAC;IAE/F,IAAI,UAAU,GAAG,YAAY,IAAI,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,IAAI,OAA2B,CAAC;IAChC,IACE,UAAU,KAAK,KAAK;QACpB,YAAY;QACZ,eAAe;QACf,OAAO,EAAE,KAAK,KAAK,SAAS;QAC5B,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EACpB,CAAC;QACD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,EAAE,eAAe,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC3E,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACzE,IAAI,IAAI,EAAE,CAAC;YACT,UAAU,GAAG,IAAI,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE;YACR,EAAE,EAAE,eAAe;YACnB,KAAK,EAAE,EAAE,CAAC,IAAI;YACd,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,EAAE,cAAc,IAAI,EAAE,CAAC,MAAM;SACpC;QACD,UAAU;QACV,YAAY;QACZ,eAAe;QACf,UAAU;QACV,KAAK;QACL,aAAa,EAAE,CAAC,GAAG,QAAQ,EAAE,GAAG,UAAU,EAAE,GAAG,cAAc,CAAC;QAC9D,YAAY;QACZ,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;KAC3D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * User-equation injection — turn a free-form `TARGET = EXPR` string into a graph\n * junction (a target quantity + its source quantities), resolve the user's\n * symbols onto the catalog vocabulary, suggest near-misses, and report where the\n * injected junction lands in a built {@link VizModel}.\n *\n * Free-form means no dimensions: source quantities are the RHS's free variables\n * — extracted by the MathTS expression parser via {@link getFormulaParser},\n * which already drops constants like `pi`/`tau`, numbers, and functions —\n * minus the physics {@link CONSTANTS}. Multi-word quantities may be typed with\n * underscores **or** the catalog's own hyphens (`planck-length`): before parse,\n * {@link rewriteCatalogHyphens} rewrites kebab catalog names to underscores so\n * `-` is not read as subtraction (persona finding W2). Resolution still tries\n * the literal form first, then the `_`↔`-` swap.\n *\n * Pure: no file I/O. The injected junction is rendered as an `extraJunction`\n * (status `'user'`) and is never written into the catalog.\n *\n * @module composition/user-equation\n */\n\nimport { getFormulaParser, parsePhysics } from '../numerical/formula-registry.js';\nimport { formulaSymbolDimension } from '../numerical/formula-dimension.js';\nimport { CONSTANT_SPELLINGS } from '../dimensional/dimension-spec.js';\nimport { CONSTANTS, isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { formulaNameDimensions } from '../dimensional/formula-names.js';\nimport { naturalNote, naturalPowers, type UnitMode } from '../dimensional/natural-units.js';\nimport { aliasesForTarget, editDistance } from './aliases.js';\nimport { resolveQuantityName } from '../dimensional/formula-names.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport type { VizModel, VizJunction } from './graph-viz.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals } from '../dimensional/algebra.js';\nimport { inferUnknownDimension } from '../dimensional/dimension-inference.js';\n\n/** Thrown when a user equation cannot be parsed into a target + sources. @public */\nexport class UserEquationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UserEquationError';\n  }\n}\n\n/**\n * A parsed user equation: the target quantity and its source quantities, as\n * written (underscores preserved; constants/numbers/functions removed).\n *\n * @public\n */\nexport interface UserEquation {\n  readonly target: string;\n  readonly sources: readonly string[];\n  /** The original `TARGET = EXPR` text, for the junction label. */\n  readonly text: string;\n}\n\n/**\n * Parse `TARGET = EXPR` into `{ target, sources }`. The target is the text left\n * of the first `=`; the sources are the RHS's free variables minus the physics\n * constants.\n *\n * Uses the active formula parser (MathTS when installed, built-in otherwise) to\n * extract the RHS's free variables.\n *\n * @throws {UserEquationError} on a missing `=`, an empty target, an unparseable\n *   RHS, or an RHS with no source quantities.\n * @public\n */\n/** Upper bound on user `--equation` text to keep hint computation bounded. */\nconst MAX_USER_EQUATION_LEN = 8192;\n\nimport { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';\n/** Rewrite a catalog hyphenated name to underscores before the expression parse. */\nexport { rewriteCatalogHyphens };\n\n/** A hyphen-joined run of names, `a-b` or `a-b-c`, not the exponent of `1e-5`. */\nconst HYPHEN_RUN = /(?<![A-Za-z0-9_.])[A-Za-z_][A-Za-z0-9_]*(?:-[A-Za-z0-9_]+)+/g;\n\n/**\n * When the parse read a hyphen-joined run (`thermal-mass`) as a subtraction of\n * its pieces, and the run read as one name is a catalog quantity, tell the user\n * `-` is arithmetic here and to use underscores. Persona finding I2.\n *\n * Decided from the parse, not from an error's text: `variables` are the free\n * variables the formula parser read from `rhs`. The parser has no hyphenated\n * identifier, so a run whose underscored name is not a variable and whose\n * pieces are was parsed as a subtraction.\n *\n * @internal\n */\nexport function hyphenSubtractHint(\n  rhs: string,\n  variables: readonly string[],\n  catalogNames: ReadonlySet<string>,\n): string | null {\n  const read = new Set(variables);\n  const split = (rhs.match(HYPHEN_RUN) ?? []).filter(\n    (run) =>\n      !read.has(run.replace(/-/g, '_')) &&\n      run.split('-').some((piece) => read.has(piece)) &&\n      resolveQuantityName(run, catalogNames) !== null,\n  );\n  if (split.length === 0) return null;\n  const example = split.sort((a, b) => b.length - a.length)[0]!;\n  return (\n    `'-' is arithmetic here; multi-word catalog names use underscores ` +\n    `(${example} → ${example.replace(/-/g, '_')})`\n  );\n}\n\n/**\n * Spellings that must not be a bare `e`. Constant aliases come from\n * {@link CONSTANT_SPELLINGS}. `1-eccentricity^2` is the perihelion factor\n * `one_minus_e_sq`.\n */\nfunction rewriteFormulaSpellings(text: string): string {\n  let out = text;\n  for (const { names } of CONSTANT_SPELLINGS) {\n    const canonical = names[0]!;\n    for (const alias of names.slice(1)) {\n      if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(alias)) continue;\n      out = out.replace(new RegExp(`(?<![A-Za-z0-9_])${alias}(?![A-Za-z0-9_])`, 'g'), canonical);\n    }\n  }\n  return out.replace(\n    /(?<![A-Za-z0-9_])1\\s*-\\s*eccentricity\\s*(?:\\^|\\*\\*)\\s*2(?![A-Za-z0-9_])/g,\n    'one_minus_e_sq',\n  );\n}\n\n/** Options for {@link analyzeUserEquation}. @internal */\nexport interface AnalyzeUserEquationOptions {\n  /**\n   * Bind a one-letter token that is itself a catalog quantity (`a`, `r`, …).\n   * Default false: the match is reported and not applied. The alias `T` →\n   * `temperature` is not a one-letter catalog name and still binds.\n   */\n  readonly bindShortNames?: boolean;\n  /** Reconcile a dimension difference by powers of c, ħ, and (geometrized) G. */\n  readonly units?: Exclude<UnitMode, 'si'>;\n}\n\nfunction withFormulaNames(catalog: ReadonlyMap<string, Dimension>): Map<string, Dimension> {\n  const out = new Map(catalog);\n  for (const [name, dim] of formulaNameDimensions()) {\n    if (!out.has(name)) out.set(name, dim);\n  }\n  return out;\n}\n\nexport async function parseUserEquation(\n  equation: string,\n  catalogNames?: ReadonlySet<string> | Iterable<string>,\n): Promise<UserEquation> {\n  if (equation.length > MAX_USER_EQUATION_LEN) {\n    throw new UserEquationError(\n      `equation exceeds ${MAX_USER_EQUATION_LEN} characters (${equation.length})`,\n    );\n  }\n  // Materialized once: an iterator (`map.keys()`) would be spent by the first use.\n  const names = catalogNames === undefined ? undefined : new Set(catalogNames);\n  const spelled = rewriteFormulaSpellings(equation);\n  const rewritten = names === undefined ? spelled : rewriteCatalogHyphens(spelled, names);\n  const eqIdx = rewritten.indexOf('=');\n  if (eqIdx < 0) {\n    throw new UserEquationError(\n      `equation must be \"TARGET = EXPR\" (no \"=\" found in '${equation}')`,\n    );\n  }\n  const target = rewritten.slice(0, eqIdx).trim();\n  if (!target) throw new UserEquationError('equation has an empty target (left of \"=\")');\n  const rhs = rewritten.slice(eqIdx + 1).trim();\n  if (!rhs) throw new UserEquationError('equation has an empty right-hand side');\n\n  let variables: readonly string[];\n  try {\n    const parser = await getFormulaParser();\n    ({ variables } = parser.parse(rhs));\n  } catch (e) {\n    // No parse tree, so no subtraction was read: the hyphen hint needs the parsed variables.\n    throw new UserEquationError(`could not parse the right-hand side '${rhs}': ${(e as Error).message}`);\n  }\n  const sources = variables.filter((v) => !isRegisteredConstant(v));\n  // An all-constant right-hand side (the Planck length) is an equation about a catalog quantity\n  // only when its target is one; otherwise it names nothing to check (persona finding W5).\n  const targetIsCatalog = names !== undefined && resolveQuantityName(target, names) !== null;\n  if (sources.length === 0 && !targetIsCatalog) {\n    throw new UserEquationError(\n      `no source quantities in '${rhs}' (only constants/numbers?)`,\n    );\n  }\n  return { target, sources, text: rewritten.trim() };\n}\n\n/** Normalize for comparison: lowercase, `_`/`-` unified. */\nconst normalizeForCompare = (s: string): string => s.toLowerCase().replace(/[_-]/g, '-');\n\n/** The shortest name that counts as contained in another for the \"did you mean?\" ranking. */\nconst MIN_CONTAINED = 3;\n\n/**\n * The one \"did you mean?\" ranking, shared by {@link suggestQuantities} and\n * {@link suggestByDimension}: edit distance first, then containment (one name\n * inside the other), then length, then name. Edit distance leads so a one-edit\n * typo beats a substring: `hawkng-temperature` → `hawking-temperature` before\n * `temperature` (persona finding N5). `gate` keeps a candidate only if one name\n * contains the other (the contained one at least three characters long) or the\n * distance is small against the query length; the\n * dimension-based caller passes `false`, because there the dimension is the evidence.\n */\nfunction rankByName(name: string, candidates: Iterable<string>, gate: boolean): string[] {\n  const needle = normalizeForCompare(name);\n  // Without the gate, short catalog names (`a`, `nu`) are spurious \"matches\" for any typo.\n  const maxDist = Math.max(1, Math.ceil(needle.length / 2));\n  // A contained name counts only from MIN_CONTAINED characters: every one-letter name occurs inside\n  // a long input (`schrodinger-equation` holds a, g, q, r), and that is not nearness (audit I5).\n  const within = (outer: string, inner: string): boolean => inner.length >= MIN_CONTAINED && outer.includes(inner);\n  return [...candidates]\n    .map((cand) => {\n      const hay = normalizeForCompare(cand);\n      const contains = within(hay, needle) || within(needle, hay) ? 0 : 1;\n      return { cand, contains, dist: editDistance(needle, hay) };\n    })\n    .filter((s) => !gate || s.contains === 0 || s.dist <= maxDist)\n    .sort(\n      (x, y) =>\n        x.dist - y.dist ||\n        x.contains - y.contains ||\n        x.cand.length - y.cand.length ||\n        x.cand.localeCompare(y.cand),\n    )\n    .map((s) => s.cand);\n}\n\n/**\n * Up to `k` catalog names most similar to `name` — the \"did you mean?\" set for an\n * unmatched user symbol. Ranked by edit distance first, then containment, then\n * length (the shared ranking of `upt map` and `upt explain`).\n *\n * @public\n */\nexport function suggestQuantities(\n  name: string,\n  catalogNames: Iterable<string>,\n  k = 5,\n): string[] {\n  return rankByName(name, catalogNames, true).slice(0, k);\n}\n\n/**\n * Catalog quantity names whose dimension equals `dim`, capped at `k` — the\n * dimension-based \"did you mean?\" set once an unknown symbol's dimension has\n * been inferred. With `near` (the unknown symbol) they are ranked by the same\n * edit-distance ranking as {@link suggestQuantities}, so `lenght` lists `length`\n * first (persona finding N2); without it they are sorted by name.\n *\n * @public\n */\nexport function suggestByDimension(\n  dim: Dimension,\n  catalogDims: ReadonlyMap<string, Dimension>,\n  k = 5,\n  near?: string,\n): string[] {\n  const same = [...catalogDims.entries()].filter(([, d]) => equals(d, dim)).map(([name]) => name);\n  return (near === undefined ? same.sort() : rankByName(near, same, false)).slice(0, k);\n}\n\n/**\n * Where the injected user junction landed, computed from a built `VizModel`.\n *\n * @public\n */\nexport interface EquationLanding {\n  readonly isolated: boolean;\n  /** Junctions in the user equation's connected component (including itself). */\n  readonly clusterSize: number;\n  /** The component holds a law/established junction (anchored to known physics). */\n  readonly anchored: boolean;\n  /** User-equation quantities that also appear in a neighbouring junction. */\n  readonly sharedQuantities: readonly string[];\n  /** Other junction ids in the user equation's component. */\n  readonly connectedJunctionIds: readonly string[];\n}\n\n/**\n * Describe where `userJunctionId` sits in `model`: its component, the junctions it\n * connects to, and the quantities that link it to them.\n *\n * @public\n */\nexport function equationLanding(model: VizModel, userJunctionId: string): EquationLanding {\n  const cluster = model.clusters.find((c) => c.junctionIds.includes(userJunctionId));\n  const self = model.junctions.find((j) => j.id === userJunctionId);\n  if (!cluster || !self) {\n    return { isolated: true, clusterSize: 1, anchored: false, sharedQuantities: [], connectedJunctionIds: [] };\n  }\n  const connectedJunctionIds = cluster.junctionIds.filter((id) => id !== userJunctionId);\n  const selfQuantities = new Set([...self.sources, self.target]);\n  const neighbourQuantities = new Set<string>();\n  for (const j of model.junctions) {\n    if (j.id === userJunctionId || !cluster.junctionIds.includes(j.id)) continue;\n    for (const qn of [...j.sources, j.target]) neighbourQuantities.add(qn);\n  }\n  const sharedQuantities = [...selfQuantities].filter((qn) => neighbourQuantities.has(qn)).sort();\n  return {\n    isolated: cluster.size === 1,\n    clusterSize: cluster.size,\n    anchored: cluster.anchored,\n    sharedQuantities,\n    connectedJunctionIds,\n  };\n}\n\n/**\n * One or two lines summarising `connects to:` (persona findings W3 / I3).\n * Dumping ~100 edge ids next to a correct pendulum equation made shared\n * `length`/`temperature` look like a physics claim. Rank by overlap with the\n * user's shared quantities first, then textbook/law over bridges, then name.\n * When the list is long, state the structural caveat explicitly.\n *\n * @internal\n */\nexport function formatConnectedSummary(\n  model: VizModel,\n  landing: EquationLanding,\n  maxShow = 5,\n): readonly string[] {\n  const ids = landing.connectedJunctionIds;\n  if (ids.length === 0) return [];\n  const shared = new Set(landing.sharedQuantities);\n  const byId = new Map(model.junctions.map((j) => [j.id, j]));\n  const tier = (id: string): number =>\n    id.startsWith('CE-') || id.startsWith('law-') ? 0 : id.startsWith('be-') ? 1 : 2;\n  const overlap = (id: string): number => {\n    const j = byId.get(id);\n    if (!j) return 0;\n    let n = 0;\n    for (const qn of [...j.sources, j.target]) if (shared.has(qn)) n++;\n    return n;\n  };\n  const ranked = [...ids].sort(\n    (a, b) => overlap(b) - overlap(a) || tier(a) - tier(b) || a.localeCompare(b),\n  );\n  const shown = ranked.slice(0, maxShow);\n  const more = ranked.length - shown.length;\n  if (more <= 0) {\n    return [`     nearest equations: ${shown.join(', ')}`];\n  }\n  return [\n    `     nearest equations: ${shown.join(', ')} (+${more} more)`,\n    '     (shared-quantity connectivity, not a physics claim)',\n  ];\n}\n\n/** A \"did you mean?\" suggestion for an unmatched symbol. */\nexport interface EquationHint {\n  readonly name: string;\n  readonly suggestions: readonly string[];\n  /** True when the suggestions come from the symbol's INFERRED dimension. */\n  readonly byDimension: boolean;\n  /**\n   * Registered constants that carry the symbol's inferred dimension (`sigma` → `sigma_sb`,\n   * persona finding L5). Present only when a dimension was inferred and it is not dimensionless.\n   */\n  readonly constants?: readonly string[];\n}\n\n/** A one-letter user name bound to a catalog quantity (persona finding W6). */\nexport interface ShortBinding {\n  readonly name: string;\n  readonly quantity: string;\n  readonly dim: Dimension;\n  /**\n   * Present and false when a one-letter catalog name was recognised and not\n   * applied. Omitted when the name was bound.\n   */\n  readonly bound?: false;\n}\n\n/**\n * Full analysis of a user equation against a catalog name→dimension map: the\n * `user` junction (for the graph), the dimensional verdict (RHS dimension vs the\n * target's catalog dimension), and \"did you mean?\" hints (dimension-based when a\n * single unknown's dimension can be inferred, else name-similarity).\n *\n * Physics constants (`hbar`, `c`, `k_B`, …) are supplied to the parser with\n * their real dimensions (from `CONSTANTS`) so the dimensional check is correct.\n *\n * @public\n */\nexport interface EquationAnalysis {\n  readonly junction: VizJunction;\n  /** Set when the RHS is not dimensionally well-formed (then dims are null). */\n  readonly parseError: string | null;\n  readonly rhsDimension: Dimension | null;\n  readonly targetDimension: Dimension | null;\n  /** rhsDimension === targetDimension; null when unknowable or parse failed. */\n  readonly consistent: boolean | null;\n  readonly hints: readonly EquationHint[];\n  /**\n   * One-letter names that resolved to a catalog quantity. A one-letter name is the likeliest to\n   * mean something else: the catalog's `a` is perihelion's semi-major axis, a length, and the\n   * Unruh formula's `a` is an acceleration (persona finding W6).\n   */\n  readonly shortBindings: readonly ShortBinding[];\n  /**\n   * RHS names given a dimensionless placeholder because they did not resolve.\n   * The reported RHS dimension treats them as dimensionless, so it is not a\n   * check of the formula until they are bound.\n   */\n  readonly placeholders: readonly string[];\n  /** Set when `--natural` / `--geometrized` reconciled the two dimensions. */\n  readonly naturalNote?: string;\n}\n\n/**\n * Parse + dimensionally analyze a user `TARGET = EXPR` against `catalogDims`\n * (catalog quantity name → dimension). Throws {@link UserEquationError} on a\n * structurally malformed equation; reports a dimensional malformation via\n * `parseError`.\n *\n * @public\n */\nexport async function analyzeUserEquation(\n  equation: string,\n  catalogDims: ReadonlyMap<string, Dimension>,\n  options?: AnalyzeUserEquationOptions,\n): Promise<EquationAnalysis> {\n  const dimsIn = withFormulaNames(catalogDims);\n  const catalogNames = new Set(dimsIn.keys());\n  const bindShort = options?.bindShortNames === true;\n  // W2: rewrite catalog kebabs before either parser sees `-` as subtraction.\n  const eq = await parseUserEquation(equation, catalogNames);\n  const literalShort = (n: string): string | null =>\n    n.length === 1 && catalogNames.has(n) ? n : null;\n  const resolveCatalog = (n: string): string | null => {\n    if (!bindShort && literalShort(n) !== null) return null;\n    return resolveQuantityName(n, catalogNames);\n  };\n  // Evaluate keys are aliases of this target's sources. `R` is reflectance\n  // on radiation-pressure and is not a global name.\n  const aliasMap = aliasesForTarget(CATALOG_GRAPH, resolveCatalog(eq.target) ?? '');\n  const resolve = (n: string): string | null => {\n    if (!bindShort && literalShort(n) !== null) return null;\n    return resolveQuantityName(n, catalogNames, aliasMap);\n  };\n\n  // dims for parsePhysics: physics constants carry their REAL dimensions; matched\n  // sources their catalog dimension; the (≤1) unmatched source a DIMENSIONLESS\n  // placeholder so the RHS still parses.\n  const dims: Record<string, Dimension> = {};\n  for (const [name, c] of Object.entries(CONSTANTS)) dims[name] = c.dim;\n  for (const s of eq.sources) {\n    const r = resolve(s);\n    dims[s] = r ? (dimsIn.get(r) as Dimension) : (formulaSymbolDimension(s) ?? DIMENSIONLESS);\n  }\n  // Use the rewritten equation's RHS (eq.text) so planck-length has already\n  // become planck_length before dimensional parse.\n  const rhsText = eq.text.slice(eq.text.indexOf('=') + 1);\n\n  let rhsDimension: Dimension | null = null;\n  let exprForInference: import('../dimensional/validator.js').ExprNode | null = null;\n  let parseError: string | null = null;\n  try {\n    const parsed = await parsePhysics(rhsText, dims);\n    rhsDimension = parsed.dimension;\n    exprForInference = parsed.expr;\n  } catch (e) {\n    const msg = e instanceof Error ? e.message : String(e);\n    // The formula parser already read this right-hand side (parseUserEquation), so its variables are the tree's.\n    const { variables } = (await getFormulaParser()).parse(rhsText);\n    const hint = hyphenSubtractHint(rhsText, variables, catalogNames);\n    parseError = hint ? `${msg}. ${hint}` : msg;\n  }\n\n  const resolvedTarget = resolve(eq.target);\n  const targetDimension = resolvedTarget ? (dimsIn.get(resolvedTarget) as Dimension) : null;\n\n  const placeholders = eq.sources.filter((s) => !resolve(s));\n  const hints: EquationHint[] = [];\n  if (exprForInference) {\n    const unmatchedSources = placeholders.filter((s) => bindShort || literalShort(s) === null);\n    const totalUnmatched = placeholders.length + (resolvedTarget ? 0 : 1);\n    for (const s of unmatchedSources) {\n      let byDim: string[] | null = null;\n      let constants: string[] = [];\n      if (targetDimension && totalUnmatched === 1) {\n        const inferred = inferUnknownDimension(exprForInference, s, targetDimension);\n        if (inferred) {\n          byDim = suggestByDimension(inferred, dimsIn, 5, s);\n          if (!equals(inferred, DIMENSIONLESS)) {\n            constants = Object.entries(CONSTANTS)\n              .filter(([, c]) => equals(c.dim, inferred))\n              .map(([name]) => name)\n              .sort();\n          }\n        }\n      }\n      const withConstants = constants.length > 0 ? { constants } : {};\n      hints.push(\n        byDim\n          ? { name: s, suggestions: byDim, byDimension: true, ...withConstants }\n          : { name: s, suggestions: suggestQuantities(s, catalogNames, 5), byDimension: false, ...withConstants },\n      );\n    }\n    if (!resolvedTarget && (bindShort || literalShort(eq.target) === null)) {\n      hints.push({ name: eq.target, suggestions: suggestQuantities(eq.target, catalogNames, 5), byDimension: false });\n    }\n  }\n\n  const declined = eq.sources\n    .filter((s) => !bindShort && literalShort(s) !== null)\n    .map((s) => ({ name: s, quantity: s, dim: dimsIn.get(s) as Dimension, bound: false as const }));\n  const declinedTarget =\n    !bindShort && literalShort(eq.target) !== null\n      ? [{ name: eq.target, quantity: eq.target, dim: dimsIn.get(eq.target) as Dimension, bound: false as const }]\n      : [];\n  const boundShort = eq.sources\n    .filter((s) => s.length === 1 && resolve(s) !== null)\n    .map((s) => ({ name: s, quantity: resolve(s)!, dim: dimsIn.get(resolve(s)!) as Dimension }));\n\n  let consistent = rhsDimension && targetDimension ? equals(rhsDimension, targetDimension) : null;\n  let natural: string | undefined;\n  if (\n    consistent === false &&\n    rhsDimension &&\n    targetDimension &&\n    options?.units !== undefined &&\n    (hints.length === 0)\n  ) {\n    const powers = naturalPowers(rhsDimension, targetDimension, options.units);\n    const note = powers === null ? null : naturalNote(powers, options.units);\n    if (note) {\n      consistent = true;\n      natural = note;\n    }\n  }\n\n  return {\n    junction: {\n      id: 'user-equation',\n      label: eq.text,\n      status: 'user',\n      sources: eq.sources.map((s) => resolve(s) ?? s),\n      target: resolvedTarget ?? eq.target,\n    },\n    parseError,\n    rhsDimension,\n    targetDimension,\n    consistent,\n    hints,\n    shortBindings: [...declined, ...boundShort, ...declinedTarget],\n    placeholders,\n    ...(natural === undefined ? {} : { naturalNote: natural }),\n  };\n}\n"]}

package/dist/core/assignment.d.ts

@@ -0,0 +1,19 @@
+/**
+ * One split of a `name=value` token.
+ *
+ * Every reader of such tokens (the CLI bindings, an evaluator's `key=value`
+ * arguments, a metric's parameters, a discovery anchor) splits on the first
+ * `=` and refuses a token with no `=` or an empty name. The split is here,
+ * once; what a null means (usage error, unit error, metric refusal) and what
+ * an empty value means stay with the caller.
+ *
+ * @module core/assignment
+ */
+/** A `name=value` token split on its first `=`. `raw` may be empty (`mass=`). @internal */
+export interface SplitAssignment {
+    readonly name: string;
+    readonly raw: string;
+}
+/** `token` split on its first `=`, or null when it has no `=` or an empty name. @internal */
+export declare function splitAssignment(token: string): SplitAssignment | null;
+//# sourceMappingURL=assignment.d.ts.map

package/dist/core/assignment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assignment.d.ts","sourceRoot":"","sources":["../../src/core/assignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,2FAA2F;AAC3F,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED,6FAA6F;AAC7F,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,GAAG,IAAI,CAIrE"}

package/dist/core/assignment.js

@@ -0,0 +1,19 @@
+/**
+ * One split of a `name=value` token.
+ *
+ * Every reader of such tokens (the CLI bindings, an evaluator's `key=value`
+ * arguments, a metric's parameters, a discovery anchor) splits on the first
+ * `=` and refuses a token with no `=` or an empty name. The split is here,
+ * once; what a null means (usage error, unit error, metric refusal) and what
+ * an empty value means stay with the caller.
+ *
+ * @module core/assignment
+ */
+/** `token` split on its first `=`, or null when it has no `=` or an empty name. @internal */
+export function splitAssignment(token) {
+    const eq = token.indexOf('=');
+    if (eq <= 0)
+        return null;
+    return { name: token.slice(0, eq), raw: token.slice(eq + 1) };
+}
+//# sourceMappingURL=assignment.js.map

package/dist/core/assignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assignment.js","sourceRoot":"","sources":["../../src/core/assignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAQH,6FAA6F;AAC7F,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;AAChE,CAAC","sourcesContent":["/**\n * One split of a `name=value` token.\n *\n * Every reader of such tokens (the CLI bindings, an evaluator's `key=value`\n * arguments, a metric's parameters, a discovery anchor) splits on the first\n * `=` and refuses a token with no `=` or an empty name. The split is here,\n * once; what a null means (usage error, unit error, metric refusal) and what\n * an empty value means stay with the caller.\n *\n * @module core/assignment\n */\n\n/** A `name=value` token split on its first `=`. `raw` may be empty (`mass=`). @internal */\nexport interface SplitAssignment {\n  readonly name: string;\n  readonly raw: string;\n}\n\n/** `token` split on its first `=`, or null when it has no `=` or an empty name. @internal */\nexport function splitAssignment(token: string): SplitAssignment | null {\n  const eq = token.indexOf('=');\n  if (eq <= 0) return null;\n  return { name: token.slice(0, eq), raw: token.slice(eq + 1) };\n}\n"]}

package/dist/core/compare.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Numeric and string comparisons the layers above share.
+ *
+ * Two quotients state how far a value is from a reference; three predicates
+ * decide agreement in the product form `|a − b| ≤ tol · scale`, which is the
+ * form the sites that migrated here used, so a verdict at a tolerance
+ * boundary does not move by an ulp. The codepoint order is the sort that
+ * `a < b ? -1 : a > b ? 1 : 0` spelled at ten sites; it is not
+ * `localeCompare`, and a sort that used `localeCompare` keeps it.
+ *
+ * @module core/compare
+ */
+/** `|value − ref| / max(|ref|, floor)`: the relative difference against a reference, with a floor for a reference near zero. @internal */
+export declare function relDiff(value: number, ref: number, floor?: number): number;
+/** `|a − b| / max(|a|, |b|, floor)`: the relative difference of two values neither of which is the reference. @internal */
+export declare function symmetricRelDiff(a: number, b: number, floor?: number): number;
+/** `|value − ref| ≤ tol · max(|ref|, floor)`: agreement relative to the reference. @internal */
+export declare function withinRel(value: number, ref: number, tol: number, floor?: number): boolean;
+/**
+ * `|value − ref| ≤ tol · max(1, |ref|)`: relative far from one, absolute near
+ * zero. The form a stored number written to a few significant digits is
+ * checked against the computed one with.
+ * @internal
+ */
+export declare function withinMixed(value: number, ref: number, tol: number): boolean;
+/** `|a − b| ≤ tol · max(|a|, |b|, floor)`: agreement of two values neither of which is the reference. @internal */
+export declare function withinSymmetric(a: number, b: number, tol: number, floor?: number): boolean;
+/** The UTF-16 code-unit order of two strings: −1, 0 or 1. Not `localeCompare`. @internal */
+export declare function compareCodepoint(a: string, b: string): number;
+/** A comparator over records, by a string key in codepoint order. @internal */
+export declare function byKey<T>(key: (item: T) => string): (a: T, b: T) => number;
+//# sourceMappingURL=compare.d.ts.map

package/dist/core/compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.d.ts","sourceRoot":"","sources":["../../src/core/compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,0IAA0I;AAC1I,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,MAAM,CAErE;AAED,2HAA2H;AAC3H,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,MAAM,CAExE;AAED,gGAAgG;AAChG,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAErF;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAE5E;AAED,mHAAmH;AACnH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAErF;AAED,4FAA4F;AAC5F,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,+EAA+E;AAC/E,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAEzE"}

package/dist/core/compare.js

@@ -0,0 +1,46 @@
+/**
+ * Numeric and string comparisons the layers above share.
+ *
+ * Two quotients state how far a value is from a reference; three predicates
+ * decide agreement in the product form `|a − b| ≤ tol · scale`, which is the
+ * form the sites that migrated here used, so a verdict at a tolerance
+ * boundary does not move by an ulp. The codepoint order is the sort that
+ * `a < b ? -1 : a > b ? 1 : 0` spelled at ten sites; it is not
+ * `localeCompare`, and a sort that used `localeCompare` keeps it.
+ *
+ * @module core/compare
+ */
+/** `|value − ref| / max(|ref|, floor)`: the relative difference against a reference, with a floor for a reference near zero. @internal */
+export function relDiff(value, ref, floor = 0) {
+    return Math.abs(value - ref) / Math.max(Math.abs(ref), floor);
+}
+/** `|a − b| / max(|a|, |b|, floor)`: the relative difference of two values neither of which is the reference. @internal */
+export function symmetricRelDiff(a, b, floor = 0) {
+    return Math.abs(a - b) / Math.max(Math.abs(a), Math.abs(b), floor);
+}
+/** `|value − ref| ≤ tol · max(|ref|, floor)`: agreement relative to the reference. @internal */
+export function withinRel(value, ref, tol, floor = 0) {
+    return Math.abs(value - ref) <= tol * Math.max(Math.abs(ref), floor);
+}
+/**
+ * `|value − ref| ≤ tol · max(1, |ref|)`: relative far from one, absolute near
+ * zero. The form a stored number written to a few significant digits is
+ * checked against the computed one with.
+ * @internal
+ */
+export function withinMixed(value, ref, tol) {
+    return Math.abs(value - ref) <= tol * Math.max(1, Math.abs(ref));
+}
+/** `|a − b| ≤ tol · max(|a|, |b|, floor)`: agreement of two values neither of which is the reference. @internal */
+export function withinSymmetric(a, b, tol, floor = 1) {
+    return Math.abs(a - b) <= tol * Math.max(Math.abs(a), Math.abs(b), floor);
+}
+/** The UTF-16 code-unit order of two strings: −1, 0 or 1. Not `localeCompare`. @internal */
+export function compareCodepoint(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/** A comparator over records, by a string key in codepoint order. @internal */
+export function byKey(key) {
+    return (a, b) => compareCodepoint(key(a), key(b));
+}
+//# sourceMappingURL=compare.js.map

package/dist/core/compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.js","sourceRoot":"","sources":["../../src/core/compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,0IAA0I;AAC1I,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,GAAW,EAAE,KAAK,GAAG,CAAC;IAC3D,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;AAChE,CAAC;AAED,2HAA2H;AAC3H,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS,EAAE,KAAK,GAAG,CAAC;IAC9D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrE,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,SAAS,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW,EAAE,KAAK,GAAG,CAAC;IAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;AACvE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW;IACjE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,mHAAmH;AACnH,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW,EAAE,KAAK,GAAG,CAAC;IAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC5E,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,KAAK,CAAI,GAAwB;IAC/C,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC","sourcesContent":["/**\n * Numeric and string comparisons the layers above share.\n *\n * Two quotients state how far a value is from a reference; three predicates\n * decide agreement in the product form `|a − b| ≤ tol · scale`, which is the\n * form the sites that migrated here used, so a verdict at a tolerance\n * boundary does not move by an ulp. The codepoint order is the sort that\n * `a < b ? -1 : a > b ? 1 : 0` spelled at ten sites; it is not\n * `localeCompare`, and a sort that used `localeCompare` keeps it.\n *\n * @module core/compare\n */\n\n/** `|value − ref| / max(|ref|, floor)`: the relative difference against a reference, with a floor for a reference near zero. @internal */\nexport function relDiff(value: number, ref: number, floor = 0): number {\n  return Math.abs(value - ref) / Math.max(Math.abs(ref), floor);\n}\n\n/** `|a − b| / max(|a|, |b|, floor)`: the relative difference of two values neither of which is the reference. @internal */\nexport function symmetricRelDiff(a: number, b: number, floor = 0): number {\n  return Math.abs(a - b) / Math.max(Math.abs(a), Math.abs(b), floor);\n}\n\n/** `|value − ref| ≤ tol · max(|ref|, floor)`: agreement relative to the reference. @internal */\nexport function withinRel(value: number, ref: number, tol: number, floor = 0): boolean {\n  return Math.abs(value - ref) <= tol * Math.max(Math.abs(ref), floor);\n}\n\n/**\n * `|value − ref| ≤ tol · max(1, |ref|)`: relative far from one, absolute near\n * zero. The form a stored number written to a few significant digits is\n * checked against the computed one with.\n * @internal\n */\nexport function withinMixed(value: number, ref: number, tol: number): boolean {\n  return Math.abs(value - ref) <= tol * Math.max(1, Math.abs(ref));\n}\n\n/** `|a − b| ≤ tol · max(|a|, |b|, floor)`: agreement of two values neither of which is the reference. @internal */\nexport function withinSymmetric(a: number, b: number, tol: number, floor = 1): boolean {\n  return Math.abs(a - b) <= tol * Math.max(Math.abs(a), Math.abs(b), floor);\n}\n\n/** The UTF-16 code-unit order of two strings: −1, 0 or 1. Not `localeCompare`. @internal */\nexport function compareCodepoint(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** A comparator over records, by a string key in codepoint order. @internal */\nexport function byKey<T>(key: (item: T) => string): (a: T, b: T) => number {\n  return (a, b) => compareCodepoint(key(a), key(b));\n}\n"]}