universal-physics-tensor 11.0.0 → 12.0.0

package/dist/composition/probe/t-tail.d.ts

@@ -3,14 +3,13 @@
  *
  * MathTS `linearRegression.pValue` and `ols.pValues` are `2·(1 − studentTCDF)`
  * and round a far tail to 0 (TOOLS.md), so a probe never consumes them. The
- * tail here is the regularized incomplete beta `I_{ν/(ν+t²)}(ν/2, 1/2)`, MathTS
- * `betainc`, which is the two-sided probability itself and resolves where
- * `1 − CDF` cannot.
+ * tail here is `2·studentTCDF(−|t|, ν)`: the CDF at the negative point is the
+ * lower tail itself, so it resolves where `1 − CDF` cannot.
  *
  * @internal
  */
 /**
- * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `I_{ν/(ν+t²)}(ν/2, 1/2)`.
+ * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `2·studentTCDF(−|t|, ν)`.
  * `t = 0` is 1, an infinite `t` is 0. @throws RangeError when ν is not positive. @internal
  */
 export declare function studentTwoSidedP(t: number, df: number): number;

package/dist/composition/probe/t-tail.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"t-tail.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/t-tail.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAS9D"}
+{"version":3,"file":"t-tail.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/t-tail.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAO9D"}

package/dist/composition/probe/t-tail.js

@@ -3,15 +3,15 @@
  *
  * MathTS `linearRegression.pValue` and `ols.pValues` are `2·(1 − studentTCDF)`
  * and round a far tail to 0 (TOOLS.md), so a probe never consumes them. The
- * tail here is the regularized incomplete beta `I_{ν/(ν+t²)}(ν/2, 1/2)`, MathTS
- * `betainc`, which is the two-sided probability itself and resolves where
- * `1 − CDF` cannot.
+ * tail here is `2·studentTCDF(−|t|, ν)`: the CDF at the negative point is the
+ * lower tail itself, so it resolves where `1 − CDF` cannot.
  *
  * @internal
  */
-import { betainc } from '@danielsimonjr/mathts-functions';
+import { studentTCDF } from '@danielsimonjr/mathts-functions';
+import { numberFrom } from '../../core/mathts-read.js';
 /**
- * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `I_{ν/(ν+t²)}(ν/2, 1/2)`.
+ * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `2·studentTCDF(−|t|, ν)`.
  * `t = 0` is 1, an infinite `t` is 0. @throws RangeError when ν is not positive. @internal
  */
 export function studentTwoSidedP(t, df) {
@@ -23,10 +23,7 @@ export function studentTwoSidedP(t, df) {
         return 1;
     if (!Number.isFinite(t))
         return 0;
-    const x = df / (df + t * t);
-    const v = betainc(df / 2, 0.5, x);
-    if (typeof v !== 'number')
-        throw new TypeError('betainc did not return a number for number arguments');
-    return Math.min(1, Math.max(0, v));
+    const lower = numberFrom('studentTCDF', studentTCDF(-Math.abs(t), df));
+    return Math.min(1, Math.max(0, 2 * lower));
 }
 //# sourceMappingURL=t-tail.js.map

package/dist/composition/probe/t-tail.js.map

@@ -1 +1 @@
-{"version":3,"file":"t-tail.js","sourceRoot":"","sources":["../../../src/composition/probe/t-tail.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,iCAAiC,CAAC;AAE1D;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,EAAU;IACpD,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,uDAAuD,CAAC,CAAC;IAC7F,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,CAAC,CAAC;IACxE,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAY,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC3C,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,MAAM,IAAI,SAAS,CAAC,sDAAsD,CAAC,CAAC;IACvG,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/**\n * The two-sided tail of Student's t, computed directly.\n *\n * MathTS `linearRegression.pValue` and `ols.pValues` are `2·(1 − studentTCDF)`\n * and round a far tail to 0 (TOOLS.md), so a probe never consumes them. The\n * tail here is the regularized incomplete beta `I_{ν/(ν+t²)}(ν/2, 1/2)`, MathTS\n * `betainc`, which is the two-sided probability itself and resolves where\n * `1 − CDF` cannot.\n *\n * @internal\n */\n\nimport { betainc } from '@danielsimonjr/mathts-functions';\n\n/**\n * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `I_{ν/(ν+t²)}(ν/2, 1/2)`.\n * `t = 0` is 1, an infinite `t` is 0. @throws RangeError when ν is not positive. @internal\n */\nexport function studentTwoSidedP(t: number, df: number): number {\n  if (!(df > 0)) throw new RangeError('studentTwoSidedP: degrees of freedom must be positive');\n  if (Number.isNaN(t)) throw new RangeError('studentTwoSidedP: t is NaN');\n  if (t === 0) return 1;\n  if (!Number.isFinite(t)) return 0;\n  const x = df / (df + t * t);\n  const v: unknown = betainc(df / 2, 0.5, x);\n  if (typeof v !== 'number') throw new TypeError('betainc did not return a number for number arguments');\n  return Math.min(1, Math.max(0, v));\n}\n"]}
+{"version":3,"file":"t-tail.js","sourceRoot":"","sources":["../../../src/composition/probe/t-tail.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAEvD;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,EAAU;IACpD,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,uDAAuD,CAAC,CAAC;IAC7F,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,CAAC,CAAC;IACxE,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,UAAU,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAC7C,CAAC","sourcesContent":["/**\n * The two-sided tail of Student's t, computed directly.\n *\n * MathTS `linearRegression.pValue` and `ols.pValues` are `2·(1 − studentTCDF)`\n * and round a far tail to 0 (TOOLS.md), so a probe never consumes them. The\n * tail here is `2·studentTCDF(−|t|, ν)`: the CDF at the negative point is the\n * lower tail itself, so it resolves where `1 − CDF` cannot.\n *\n * @internal\n */\n\nimport { studentTCDF } from '@danielsimonjr/mathts-functions';\nimport { numberFrom } from '../../core/mathts-read.js';\n\n/**\n * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `2·studentTCDF(−|t|, ν)`.\n * `t = 0` is 1, an infinite `t` is 0. @throws RangeError when ν is not positive. @internal\n */\nexport function studentTwoSidedP(t: number, df: number): number {\n  if (!(df > 0)) throw new RangeError('studentTwoSidedP: degrees of freedom must be positive');\n  if (Number.isNaN(t)) throw new RangeError('studentTwoSidedP: t is NaN');\n  if (t === 0) return 1;\n  if (!Number.isFinite(t)) return 0;\n  const lower = numberFrom('studentTCDF', studentTCDF(-Math.abs(t), df));\n  return Math.min(1, Math.max(0, 2 * lower));\n}\n"]}

package/dist/composition/proposed-bridges.d.ts

@@ -1,5 +1,5 @@
 /**
- * Identity-consequence surfacer — turns a `promising` discovery identification
+ * Identity-consequence surfacer — turns a promising (either tier) discovery identification
  * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.
  *
  * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal
@@ -89,6 +89,13 @@ export interface ProposedBridge {
             readonly a: string;
             readonly b: string;
             readonly dim: string;
+            /**
+             * The source row's magnitude evidence: true when it was `promising` (the magnitude
+             * falsifier ran and could have failed), false when it was `promising-unchecked` (the gate
+             * abstained, or its pass was anchor-invariant). A proposal from an unchecked
+             * identification is printed as such.
+             */
+            readonly magnitudeEvidence: boolean;
         };
         readonly sourceEquationIds: readonly [string, string];
         readonly solvedFor: string;
@@ -150,7 +157,9 @@ interface EquationSource {
  *  @internal */
 export declare function resolveSources(name: string): EquationSource[];
 /**
- * Derive the implied relation for each `promising` identification in `candidates`.
+ * Derive the implied relation for each identification in `candidates` in either promising tier
+ * (`promising` or `promising-unchecked`, {@link isPromisingTier}); each proposal records which in
+ * `derivedFrom.identification.magnitudeEvidence`.
  * Returns ONE proposal per admissible candidate (Adam M2), structurally
  * de-duplicated (`dedupByNormalForm`).
  *

package/dist/composition/proposed-bridges.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"proposed-bridges.d.ts","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAG5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACxE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAEhE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAQtD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAStD;;;;;;;GAOG;AACH,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,CAAC,CAAC;AAKlE,2FAA2F;AAC3F,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAkBD;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAmC9C;AAED;;;;;;;;;;gBAUgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,QAAQ,CAiB9C;AAID;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B,gDAAgD;IAChD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,WAAW,EAAE;QACpB,QAAQ,CAAC,cAAc,EAAE;YAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAC;QAC1F,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE,mBAAmB,CAAC;IACrC,0DAA0D;IAC1D,QAAQ,CAAC,SAAS,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACnD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC7B,6EAA6E;IAC7E,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,4DAA4D;IAC5D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B;;+EAE2E;IAC3E,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IACjC;uDACmD;IACnD,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;CAC5D;AAID,gEAAgE;AAChE,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;CACxB;AAUD,8FAA8F;AAC9F,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAW7C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAUxE;AAoDD;;;;;GAKG;AACH,UAAU,cAAc;IACtB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,QAAQ,CAAC;IACtC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAoBD;;;;gBAIgB;AAChB,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,EAAE,CAoD7D;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,GAAE,SAAS,eAAe,EAAqC,GACxE,SAAS,cAAc,EAAE,CAc3B;AA2FD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,SAAS,cAAc,EAAE,GACnC,SAAS,cAAc,EAAE,CAkC3B;AAID,iFAAiF;AACjF,UAAU,iBAAiB;IACzB,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qDAAqD;IACrD,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;6DAC6D;AAC7D,UAAU,gBAAgB;IACxB,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;IAClC,QAAQ,CAAC,QAAQ,EAAE,iBAAiB,CAAC;CACtC;AAED,gGAAgG;AAChG,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,cAAc,EACxB,QAAQ,EAAE,iBAAiB,GAC1B,gBAAgB,CAMlB;AAID;;;;;;;;GAQG;AACH,UAAU,mBAAmB;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC;IACvB,QAAQ,CAAC,aAAa,EAAE,uDAAuD,CAAC;IAChF,+DAA+D;IAC/D,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,qDAAqD;IACrD,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IACjC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC;uEACmE;IACnE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,YAAY,EAAE,SAAS,UAAU,EAAE,CAAC;IAC7C,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC;IACpD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAaD,yFAAyF;AACzF,wBAAgB,eAAe,CAAC,CAAC,EAAE,cAAc,GAAG,mBAAmB,CA6CtE;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,mBAAmB,EACb,CAAC"}
+{"version":3,"file":"proposed-bridges.d.ts","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAG5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACxE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAEhE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAQtD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAStD;;;;;;;GAOG;AACH,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,CAAC,CAAC;AAKlE,2FAA2F;AAC3F,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAkBD;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAmC9C;AAED;;;;;;;;;;gBAUgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,QAAQ,CAiB9C;AAID;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B,gDAAgD;IAChD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,WAAW,EAAE;QACpB,QAAQ,CAAC,cAAc,EAAE;YACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;YACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;YACnB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;YACrB;;;;;eAKG;YACH,QAAQ,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACrC,CAAC;QACF,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE,mBAAmB,CAAC;IACrC,0DAA0D;IAC1D,QAAQ,CAAC,SAAS,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACnD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC7B,6EAA6E;IAC7E,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,4DAA4D;IAC5D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B;;+EAE2E;IAC3E,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IACjC;uDACmD;IACnD,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;CAC5D;AAID,gEAAgE;AAChE,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;CACxB;AAUD,8FAA8F;AAC9F,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAW7C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAUxE;AAoDD;;;;;GAKG;AACH,UAAU,cAAc;IACtB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,QAAQ,CAAC;IACtC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAoBD;;;;gBAIgB;AAChB,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,EAAE,CAoD7D;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,GAAE,SAAS,eAAe,EAAqC,GACxE,SAAS,cAAc,EAAE,CAc3B;AA2FD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,SAAS,cAAc,EAAE,GACnC,SAAS,cAAc,EAAE,CAkC3B;AAID,iFAAiF;AACjF,UAAU,iBAAiB;IACzB,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qDAAqD;IACrD,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;6DAC6D;AAC7D,UAAU,gBAAgB;IACxB,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;IAClC,QAAQ,CAAC,QAAQ,EAAE,iBAAiB,CAAC;CACtC;AAED,gGAAgG;AAChG,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,cAAc,EACxB,QAAQ,EAAE,iBAAiB,GAC1B,gBAAgB,CAMlB;AAID;;;;;;;;GAQG;AACH,UAAU,mBAAmB;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC;IACvB,QAAQ,CAAC,aAAa,EAAE,uDAAuD,CAAC;IAChF,+DAA+D;IAC/D,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,qDAAqD;IACrD,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IACjC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC;uEACmE;IACnE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,YAAY,EAAE,SAAS,UAAU,EAAE,CAAC;IAC7C,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC;IACpD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAaD,yFAAyF;AACzF,wBAAgB,eAAe,CAAC,CAAC,EAAE,cAAc,GAAG,mBAAmB,CA6CtE;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,mBAAmB,EACb,CAAC"}

package/dist/composition/proposed-bridges.js

@@ -1,5 +1,5 @@
 /**
- * Identity-consequence surfacer — turns a `promising` discovery identification
+ * Identity-consequence surfacer — turns a promising (either tier) discovery identification
  * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.
  *
  * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal
@@ -42,7 +42,7 @@ import { normalForm } from '../canonical/normal-form.js';
 import { isRegisteredConstant } from '../dimensional/symbolic-constants.js';
 import { forEachScalarLeaf, isDecimalLiteral, mapScalarLeaves } from '../dimensional/ast-leaves.js';
 import { evalExpr } from './expr-eval.js';
-import { rankDiscoveries } from './discovery.js';
+import { rankDiscoveries, isPromisingTier } from './discovery.js';
 import { CANONICAL_GRAPH } from './canonical-graph.js';
 import { CATALOG_GRAPH } from './catalog-graph.js';
 import { rationalExponentOf } from './formula-shape.js';
@@ -295,7 +295,9 @@ export function resolveSources(name) {
     return out;
 }
 /**
- * Derive the implied relation for each `promising` identification in `candidates`.
+ * Derive the implied relation for each identification in `candidates` in either promising tier
+ * (`promising` or `promising-unchecked`, {@link isPromisingTier}); each proposal records which in
+ * `derivedFrom.identification.magnitudeEvidence`.
  * Returns ONE proposal per admissible candidate (Adam M2), structurally
  * de-duplicated (`dedupByNormalForm`).
  *
@@ -319,7 +321,7 @@ export function resolveSources(name) {
 export function deriveProposedBridges(candidates = rankDiscoveries(CANONICAL_GRAPH)) {
     const out = [];
     for (const cand of candidates) {
-        if (cand.verdict !== 'promising')
+        if (!isPromisingTier(cand.verdict))
             continue;
         const [t0, t1] = [cand.a, cand.b].sort();
         // Enumerate every admissible source pair (de-ambiguation by enumeration).
@@ -368,7 +370,7 @@ function derivePair(cand, t0, t1, E1, E2) {
     return {
         id: `IC-${t0}--${t1}--${solveFor.name}`,
         derivedFrom: {
-            identification: { a: cand.a, b: cand.b, dim: cand.dim },
+            identification: { a: cand.a, b: cand.b, dim: cand.dim, magnitudeEvidence: cand.verdict === 'promising' },
             sourceEquationIds: [E1.id, E2.id],
             solvedFor: solveFor.name,
         },

package/dist/composition/proposed-bridges.js.map

@@ -1 +1 @@
-{"version":3,"file":"proposed-bridges.js","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AACpG,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAc1E,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC5B,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnC,2FAA2F;AAC3F,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,SAAS,SAAS,CAAC,IAAU,EAAE,IAAU,EAAE,KAAe;IACxD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,iBAAiB,CACzB,SAAS,IAAI,wCAAwC,CACtD,CAAC;YACJ,CAAC;YACD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,GAAa;IACtC,MAAM,GAAG,GAAS,IAAI,GAAG,EAAE,CAAC;IAC5B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC;gBACf,KAAK,GAAG;oBACN,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC7D,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBAChC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;oBACrC,KAAK,MAAM,CAAC,IAAI,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC/D,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBACjC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAC9B,MAAM,IAAI,iBAAiB,CAAC,sBAAsB,CAAC,CAAC;oBACtD,CAAC;oBACD,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;wBACpB,MAAM,IAAI,iBAAiB,CAAC,yBAAyB,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACxE,CAAC;oBACD,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD;oBACE,MAAM,IAAI,iBAAiB,CAAC,aAAa,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACxE,CAAC;QACH;YACE,MAAM,IAAI,iBAAiB,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED;;;;;;;;;;gBAUgB;AAChB,MAAM,UAAU,YAAY,CAAC,CAAO;IAClC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,GAAc,EAAE,CAAW,EAAY,EAAE,CACrE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,IAAI,GAAG,CAAC,SAAS,GAAG,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;;YACpD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAc,EAAY,EAAE,CAC3C,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAE9D,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC;AAyCD,MAAM,UAAU,GAAG,oBAAoB,CAAC;AASxC,sEAAsE;AACtE,SAAS,qBAAqB,CAAC,CAAO;IACpC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,aAAa,CAAC,CAAO;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC;QACpF,CAAC,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;IACtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,EAAQ,EAAE,EAAQ,EAAE,QAAkB;IAChE,MAAM,MAAM,GAAS,IAAI,GAAG,EAAE,CAAC;IAC/B,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3B,MAAM,SAAS,GAAS,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;IACpC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;YAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,0EAA0E;AAC1E,iFAAiF;AACjF,4EAA4E;AAC5E,6EAA6E;AAC7E,sEAAsE;AAEtE,SAAS,eAAe,CAAC,GAAa,EAAE,IAA4B;IAClE,iBAAiB,CACf,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1D,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,SAAS,YAAY,CACnB,SAAmB,EACnB,SAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC;YAAE,SAAS;QACzD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS,CAAC,uBAAuB;QAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,GAAa,EAAE,GAAgC;IACnE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/B,OAAO,eAAe,CACpB,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAoBD;;;gFAGgF;AAChF,SAAS,kBAAkB,CAAC,CAAO,EAAE,MAA2B;IAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IACE,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAC1B,CAAC,UAAU,CAAC,IAAI,CAAC;YACjB,CAAC,gBAAgB,CAAC,IAAI,CAAC;YACvB,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EACjB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;gBAIgB;AAChB,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,MAAM,GAAG,GAAqB,EAAE,CAAC;IAEjC,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IACE,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI;YAC/B,CAAC,CAAC,eAAe,KAAK,oBAAoB,EAC1C,CAAC;YACD,yEAAyE;YACzE,4EAA4E;YAC5E,sCAAsC;YACtC,MAAM,SAAS,GAAG,YAAY,CAC5B,CAAC,CAAC,SAAS,EACX,YAAY,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CACnD,CAAC;YACF,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,WAAW;gBACjB,SAAS;gBACT,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;gBACnC,KAAK,EAAE,CAAC,CAAC,eAAe;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,wEAAwE;IACxE,6DAA6D;IAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAC1D,IAAI,CAAO,CAAC;QACZ,IAAI,CAAC;YACH,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,iBAAiB;gBAAE,SAAS;YAC/C,MAAM,GAAG,CAAC;QACZ,CAAC;QACD,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9E,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,iBAAiB,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QACpD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG;YAC1B,KAAK,EAAE,IAAI,CAAC,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAU,GAA+B,eAAe,CAAC,eAAe,CAAC;IAEzE,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,OAAO,KAAK,WAAW;YAAE,SAAS;QAC3C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,0EAA0E;QAC1E,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,6EAA6E;AAC7E,SAAS,UAAU,CACjB,IAAqB,EACrB,EAAU,EACV,EAAU,EACV,EAAkB,EAClB,EAAkB;IAElB,IAAI,EAAQ,CAAC;IACb,IAAI,EAAQ,CAAC;IACb,IAAI,CAAC;QACH,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9B,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,iBAAiB;YAAE,OAAO,IAAI,CAAC;QAChD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,MAAM,QAAQ,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,kCAAkC;IAC9D,IAAI,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mCAAmC;IAE3E,6EAA6E;IAC7E,MAAM,MAAM,GAAG,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IAE7C,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,iBAAiB,CAAC;IAClD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mBAAmB;IAExE,MAAM,SAAS,GAA0B,CAAC,GAAG,MAAM,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACrC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAG,CAAC,CAAiB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC;IACrE,MAAM,UAAU,GACd,4DAA4D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG;QACjF,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,sBAAsB,QAAQ,CAAC,IAAI,KAAK;QACpE,wEAAwE;QACxE,wEAAwE,CAAC;IAE3E,OAAO;QACL,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,QAAQ,CAAC,IAAI,EAAE;QACvC,WAAW,EAAE;YACX,cAAc,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;YACvD,iBAAiB,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;YACjC,SAAS,EAAE,QAAQ,CAAC,IAAI;SACzB;QACD,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE;QAClD,SAAS;QACT,YAAY,EAAE,GAAG,QAAQ,CAAC,IAAI,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE;QAC3D,SAAS;QACT,oBAAoB,EAAE,MAAM,CAAC,GAAG,CAAC;QACjC,UAAU;QACV,iBAAiB,EAAE,EAAE;QACrB,MAAM,EAAE,eAAe;QACvB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,eAAe,CACtB,SAAoC;IAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;QACzB,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;QACvE,CAAC,CAAC,CAAC,CACN,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,CAAiB;IACjC,IAAI,SAAS,GAAa,CAAC,CAAC,SAAS,CAAC;IACtC,IAAI,CAAC;QACH,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,YAAY,iBAAiB,CAAC;YAAE,MAAM,GAAG,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,4EAA4E;QAC5E,0EAA0E;QAC1E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAChC,OAAO,SAAS,CAAC,oBAAoB,KAAK,CAAC,CAAC,oBAAoB,IAAI,iBAAiB,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC;YAChI,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,KAAK,SAAS;gBAAE,GAAG,GAAG,IAAI,CAAC;QACrC,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,iBAAiB,CAAC,MAAM;YACjD,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC;AAqBD,gGAAgG;AAChG,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,QAA2B;IAE3B,MAAM,KAAK,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;IAChF,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;IAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACpF,IAAI,CAAC,QAAQ,CAAC,MAAM;QAAE,MAAM,IAAI,oBAAoB,CAAC,iCAAiC,CAAC,CAAC;IACxF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAiCD;qEACqE;AACrE,SAAS,YAAY,CAAC,EAAU;IAC9B,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7B,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IAChE,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAClF,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IACzG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC/C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,eAAe,CAAC,CAAiB;IAC/C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC;IACnD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC;IAC9C,MAAM,OAAO,GAAG;QACd,CAAC,GAAG,EAAE,EAAE,CAAU;QAClB,CAAC,GAAG,EAAE,EAAE,CAAU;KACnB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,SAAS,YAAY;QAC1D,QAAQ,EAAE,GAAG;QACb,aAAa,EAAE,uDAAuD;QACtE,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;QAC/B,MAAM,EAAE,eAAe;QACvB,OAAO,EACL,6DAA6D,CAAC,MAAM,CAAC,GAAG;YACxE,IAAI,GAAG,UAAU,GAAG,qBAAqB,CAAC,CAAC,WAAW,CAAC,SAAS,MAAM;YACtE,yEAAyE;YACzE,gDAAgD;QAClD,aAAa,EAAE,CAAC,CAAC,YAAY;QAC7B,qBAAqB,EAAE,CAAC,CAAC,oBAAoB;QAC7C,UAAU,EAAE;YACV,uEAAuE;YACvE,GAAG,OAAO;SACX;QACD,YAAY,EAAE;YACZ;gBACE,QAAQ,EAAE,yBAAyB;gBACnC,WAAW,EACT,qEAAqE;oBACrE,+DAA+D;oBAC/D,oEAAoE;oBACpE,2EAA2E;gBAC7E,OAAO,EAAE,SAAS;aACnB;SACF;QACD,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,KAAK,EACH,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM;gBACzB,CAAC,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBAC5D,CAAC,CAAC,EAAE,CAAC;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAC3B,qBAAqB,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC","sourcesContent":["/**\n * Identity-consequence surfacer — turns a `promising` discovery identification\n * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.\n *\n * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal\n * dimension), and `a`, `b` are the TARGETS of two canonical equations `Eₐ`, `E_b`,\n * the hypothesised identity `a ≡ b` makes their right-hand sides equal:\n *\n *     Eₐ.scalarAst  =  E_b.scalarAst\n *\n * Eliminating (isolating) one free variable yields a relation among the union of\n * the two governing sets — e.g. Landauer `k_B T ln2` ≟ Planck–Einstein `h ν`\n * gives `ν = (k_B ln2 / h) · T`, the \"Landauer photon\".\n *\n * CRITICAL — this is NOT new physics and NOT a bridge. It is the algebraic\n * consequence of an UNADJUDICATED identification, surfaced for a physicist to\n * judge (Part-VI §XXVII-B: the enumerator proposes, humans dispose). Every\n * emitted record carries `status: 'unadjudicated'` — a literal that is NOT a\n * member of `BridgeEquationStatus`, so a proposal can never be assigned where a\n * catalog entry is expected. The generator NEVER writes `BRIDGE_EQUATIONS` and a\n * proposal is NEVER added to `CANONICAL_GRAPH` (no coincidence-amplifying loop).\n *\n * Scope (v0.24.0 pilot): canonical-only `promising` candidates whose BOTH source\n * equations (a) have a non-null `dimensional.monomial` (determinate) and (b) are\n * `epistemicStatus: 'fully-quantitative'` (so the eliminated prefactor is a\n * closed numeric constant, not an operator-valued stub — this gates out\n * `CE-jarzynski`). See `docs/planning/v0.24.0-{Design,Review-Findings}.md`.\n *\n * INTERNAL tooling — deliberately NOT re-exported from `src/index.ts`.\n *\n * @module composition/proposed-bridges\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { sym, symbolPower } from '../dimensional/ast-builders.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { DimensionalVariable } from '../dimensional/buckingham.js';\nimport type { BridgeEquationStatus } from '../bridges/index.js';\nimport { canonicalByTarget, canonicalById } from '../canonical/registry.js';\nimport type { KnownIssue } from '../bridges/index.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { catalogIdNumber } from '../bridges/catalog-load.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { forEachScalarLeaf, isDecimalLiteral, mapScalarLeaves } from '../dimensional/ast-leaves.js';\nimport { evalExpr } from './expr-eval.js';\nimport { rankDiscoveries } from './discovery.js';\nimport type { VettedCandidate } from './discovery.js';\nimport { CANONICAL_GRAPH } from './canonical-graph.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { rationalExponentOf } from './formula-shape.js';\nimport { equalUpToConstant } from './algebraic-equivalence.js';\nimport { formatRational, fractionToNumber } from './rational-exponent.js';\n\n// ── monomial algebra over flat ExprNode forms ───────────────────────────────\n\n/**\n * A flat monomial: leaf name → its dimension and signed exact exponent.\n * `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. The exponent is a core\n * `Fraction`, so solving for a cubed leaf carries `1/3`, not\n * `0.3333333333333333`, and a cancellation is an exact zero.\n *\n * @internal\n */\nexport type Mono = Map<string, { dim: Dimension; exp: Fraction }>;\n\nconst ONE = new Fraction(1);\nconst MINUS_ONE = new Fraction(-1);\n\n/** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */\nexport class NotAMonomialError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotAMonomialError';\n  }\n}\n\nfunction mergeInto(into: Mono, from: Mono, scale: Fraction): void {\n  for (const [name, { dim, exp }] of from) {\n    const cur = into.get(name);\n    if (cur === undefined) {\n      into.set(name, { dim, exp: exp.multiply(scale) });\n    } else {\n      if (!equals(cur.dim, dim)) {\n        throw new NotAMonomialError(\n          `leaf '${name}' appears with inconsistent dimensions`,\n        );\n      }\n      cur.exp = cur.exp.add(exp.multiply(scale));\n    }\n  }\n}\n\n/**\n * Decompose a flat-monomial `ExprNode` into a leaf→exponent map. Throws\n * `NotAMonomialError` on sums, differences, or non-symbol bases — this is the\n * AST-level monomial gate.\n *\n * @internal\n */\nexport function toMonomial(ast: ExprNode): Mono {\n  const out: Mono = new Map();\n  switch (ast.kind) {\n    case 'symbol':\n      out.set(ast.name, { dim: ast.dim, exp: ONE });\n      return out;\n    case 'op':\n      switch (ast.op) {\n        case '*':\n          for (const a of ast.args) mergeInto(out, toMonomial(a), ONE);\n          return out;\n        case '/': {\n          const [num, ...dens] = ast.args;\n          mergeInto(out, toMonomial(num), ONE);\n          for (const d of dens) mergeInto(out, toMonomial(d), MINUS_ONE);\n          return out;\n        }\n        case '^': {\n          const [base, expNode] = ast.args;\n          if (expNode.kind !== 'symbol') {\n            throw new NotAMonomialError('non-literal exponent');\n          }\n          const n = rationalExponentOf(expNode.name);\n          if (n === undefined) {\n            throw new NotAMonomialError(`non-numeric exponent '${expNode.name}'`);\n          }\n          mergeInto(out, toMonomial(base), n);\n          return out;\n        }\n        default:\n          throw new NotAMonomialError(`operator '${ast.op}' is not monomial`);\n      }\n    default:\n      throw new NotAMonomialError(`node kind '${ast.kind}' is not monomial`);\n  }\n}\n\n/** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =\n *  positive exponents, denominator = negative). Zero exponents drop out. The\n *  exponent literal is the double built from the fraction (`1/3` is written\n *  `0.3333333333333333`), so one rational is always one spelling.\n *\n *  This is not merged with `monomialToExpr` (composition/probe/generator.ts),\n *  which writes one product with negative exponents in code-unit name order;\n *  this one orders names by `localeCompare` and splits a quotient. The\n *  proposals' printed formulas and the IC dedup key read this tree, so one\n *  builder would move them. Both build each factor with `symbolPower`.\n *  @internal */\nexport function fromMonomial(m: Mono): ExprNode {\n  const factor = (name: string, dim: Dimension, e: Fraction): ExprNode =>\n    symbolPower(sym(name, dim), fractionToNumber(e));\n\n  const num: ExprNode[] = [];\n  const den: ExprNode[] = [];\n  for (const [name, { dim, exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    if (exp.numerator > 0n) num.push(factor(name, dim, exp));\n    else den.push(factor(name, dim, exp.abs()));\n  }\n  const product = (xs: ExprNode[]): ExprNode =>\n    xs.length === 1 ? xs[0] : { kind: 'op', op: '*', args: xs };\n\n  const numerator = num.length === 0 ? sym('1', DIMENSIONLESS) : product(num);\n  if (den.length === 0) return numerator;\n  return { kind: 'op', op: '/', args: [numerator, product(den)] };\n}\n\n// ── the proposal record ─────────────────────────────────────────────────────\n\n/**\n * A machine-DERIVED candidate bridge — the MATH ONLY. The algebraic consequence\n * of an UNADJUDICATED identification; never a status claim. Structurally distinct\n * from `BridgeEquationEntry` (omits every physics-judgment field) and carries the\n * literal `status: 'unadjudicated'`, which is NOT a `BridgeEquationStatus`.\n *\n * @internal\n */\nexport interface ProposedBridge {\n  /** `IC-<sorted-a>--<sorted-b>--<solvedFor>`. */\n  readonly id: string;\n  readonly derivedFrom: {\n    readonly identification: { readonly a: string; readonly b: string; readonly dim: string };\n    readonly sourceEquationIds: readonly [string, string];\n    readonly solvedFor: string;\n  };\n  readonly target: DimensionalVariable;\n  /** Free (non-constant) inputs of the derived relation. */\n  readonly governing: readonly DimensionalVariable[];\n  readonly formulaLatex: string;\n  /** Dimensionally-VALIDATED derived RHS (round-trips to `dimensionalSignature`). */\n  readonly scalarAst: ExprNode;\n  /** `format()` of the inferred dimension — same convention as the catalog. */\n  readonly dimensionalSignature: string;\n  /** Mechanical derivation description — NO physics claim. */\n  readonly provenance: string;\n  /** Other identifications that derive the SAME relation (same normal form, up\n   *  to dimensionless constants), collapsed into this proposal by the dedup pass.\n   *  Empty unless a wider candidate scope produced structural duplicates. */\n  readonly alsoDerivableFrom: readonly string[];\n  /** ALWAYS the literal 'unadjudicated'. NOT a BridgeEquationStatus. */\n  readonly status: 'unadjudicated';\n  /** Numerically evaluate the derived RHS; constants auto-resolve, supply the\n   *  free `governing` leaves (e.g. `{ T: 300 }`). */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\nconst isConstant = isRegisteredConstant;\n\n/** One leaf of a monomial with its exact exponent. @internal */\nexport interface MonoLeaf {\n  readonly name: string;\n  readonly dim: Dimension;\n  readonly exp: Fraction;\n}\n\n/** The single non-constant leaf of a monomial, or null if 0 or >1. */\nfunction uniqueNonConstantLeaf(m: Mono): MonoLeaf | null {\n  const free = [...m].filter(([name]) => !isConstant(name));\n  if (free.length !== 1) return null;\n  const [name, { dim, exp }] = free[0];\n  return { name, dim, exp };\n}\n\n/** The LaTeX of a monomial, exponents rendered from their fractions (`y^{1/3}`). @internal */\nexport function latexFromMono(m: Mono): string {\n  const num: string[] = [];\n  const den: string[] = [];\n  for (const [name, { exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    const magnitude = exp.abs();\n    const tok = magnitude.equals(ONE) ? name : `${name}^{${formatRational(magnitude)}}`;\n    (exp.numerator > 0n ? num : den).push(tok);\n  }\n  const n = num.join(' \\\\cdot ') || '1';\n  return den.length ? `\\\\frac{${n}}{${den.join(' \\\\cdot ')}}` : n;\n}\n\n/**\n * Isolate `solveFor` from `m1 = m2`: `solveFor^e = m1 / (m2 without solveFor)`,\n * every exponent divided by `e`, exactly. `m2` must hold `solveFor`.\n *\n * @internal\n */\nexport function isolateLeaf(m1: Mono, m2: Mono, solveFor: MonoLeaf): Mono {\n  const result: Mono = new Map();\n  mergeInto(result, m1, ONE);\n  const m2NoSolve: Mono = new Map(m2);\n  m2NoSolve.delete(solveFor.name);\n  mergeInto(result, m2NoSolve, MINUS_ONE);\n  if (!solveFor.exp.equals(ONE)) {\n    for (const v of result.values()) v.exp = v.exp.divide(solveFor.exp);\n  }\n  return result;\n}\n\n// ── leaf-name canonicalization ──────────────────────────────────────────────\n// A canonical equation's `scalarAst` uses private symbols (`T`) while its\n// `dimensional.governing` and the whole composition graph (and bridge `symbolic`\n// forms) use quantity names (`temperature`). Aligning the AST leaves to the\n// governing names lets a derivation from a canonical equation and one from a\n// bridge edge of the SAME physics collapse under `dedupByNormalForm`.\n\nfunction collectLeafDims(ast: ExprNode, into: Map<string, Dimension>): void {\n  forEachScalarLeaf(\n    ast,\n    (leaf) => {\n      if (!into.has(leaf.name)) into.set(leaf.name, leaf.dim);\n    },\n    {},\n  );\n}\n\n/** Map each non-constant `scalarAst` leaf to the governing quantity of equal\n *  dimension, when that match is unique (else leave it — never guess). */\nfunction leafCanonMap(\n  scalarAst: ExprNode,\n  governing: readonly DimensionalVariable[],\n): Map<string, string> {\n  const leaves = new Map<string, Dimension>();\n  collectLeafDims(scalarAst, leaves);\n  const govFree = governing.filter((g) => !isConstant(g.name));\n  const map = new Map<string, string>();\n  for (const [leaf, dim] of leaves) {\n    if (isConstant(leaf) || isDecimalLiteral(leaf)) continue;\n    if (govFree.some((g) => g.name === leaf)) continue; // already a graph name\n    const matches = govFree.filter((g) => equals(g.dim, dim));\n    if (matches.length === 1) map.set(leaf, matches[0].name);\n  }\n  return map;\n}\n\nfunction renameLeaves(ast: ExprNode, map: ReadonlyMap<string, string>): ExprNode {\n  if (map.size === 0) return ast;\n  return mapScalarLeaves(\n    ast,\n    (leaf) => {\n      const r = map.get(leaf.name);\n      return r ? { ...leaf, name: r } : leaf;\n    },\n    {},\n  );\n}\n\n// ── the generator ───────────────────────────────────────────────────────────\n\n/**\n * An admissible source for the elimination: a target name backed by a flat\n * monomial `scalarAst` whose prefactor is a closed constant. Canonical equations\n * and bridge edges both project to this shape, so the generator no longer needs\n * to know which it came from.\n */\ninterface EquationSource {\n  /** `CE-…` (canonical) or `BE-<n>` (bridge). */\n  readonly id: string;\n  readonly kind: 'canonical' | 'bridge';\n  readonly scalarAst: ExprNode;\n  readonly targetDim: Dimension;\n  /** `epistemicStatus` (canonical) or `confidence` (bridge) — recorded, not gated. */\n  readonly grade: string;\n}\n\n/** True if the monomial carries a dimensionless leaf that is neither a known\n *  constant, a numeric literal, NOR a declared input quantity — i.e. an\n *  operator-valued STUB (e.g. Jarzynski's `ln_avg_exp_minus_betaW`), not a clean\n *  dimensionless INPUT like a coupling constant (BE-18's `yukawa-coupling`). */\nfunction hasNonConstantStub(m: Mono, inputs: ReadonlySet<string>): boolean {\n  for (const [name, { dim }] of m) {\n    if (\n      equals(dim, DIMENSIONLESS) &&\n      !isConstant(name) &&\n      !isDecimalLiteral(name) &&\n      !inputs.has(name)\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** ALL admissible sources for `name` — every canonical equation AND every bridge\n *  edge whose target is `name` and whose form is a clean monomial. A target with\n *  several sources (e.g. BE-42 Hawking's two parametrisations) is DE-AMBIGUATED by\n *  enumeration, not skipped; coinciding derivations collapse later under dedup.\n *  @internal */\nexport function resolveSources(name: string): EquationSource[] {\n  const out: EquationSource[] = [];\n\n  // Canonical: a determinate monomial AND a fully-quantitative form.\n  for (const e of canonicalByTarget(name)) {\n    if (\n      e.scalarAst &&\n      e.dimensional.monomial !== null &&\n      e.epistemicStatus === 'fully-quantitative'\n    ) {\n      // Align the AST's private leaf symbols (`T`) with the governing quantity\n      // names (`temperature`) so canonical- and bridge-sourced derivations of the\n      // same relation collapse under dedup.\n      const scalarAst = renameLeaves(\n        e.scalarAst,\n        leafCanonMap(e.scalarAst, e.dimensional.governing),\n      );\n      out.push({\n        id: e.id,\n        kind: 'canonical',\n        scalarAst,\n        targetDim: e.dimensional.target.dim,\n        grade: e.epistemicStatus,\n      });\n    }\n  }\n\n  // Bridge: edges carrying a clean-monomial `symbolic` form. `confidence` is about\n  // FRAMING, not formula completeness, so it is recorded — not gated; the\n  // structural stub check enforces a closed prefactor instead.\n  for (const edge of CATALOG_GRAPH) {\n    if (edge.target.name !== name || !edge.symbolic) continue;\n    let m: Mono;\n    try {\n      m = toMonomial(edge.symbolic);\n    } catch (err) {\n      if (err instanceof NotAMonomialError) continue;\n      throw err;\n    }\n    if (hasNonConstantStub(m, new Set(edge.sources.map((s) => s.name)))) continue;\n    const dim = validate(edge.symbolic).inferredDimension;\n    if (!dim || !equals(dim, edge.target.dim)) continue;\n    out.push({\n      id: edge.beId !== null ? `BE-${edge.beId}` : edge.id,\n      kind: 'bridge',\n      scalarAst: edge.symbolic,\n      targetDim: edge.target.dim,\n      grade: edge.confidence,\n    });\n  }\n\n  return out;\n}\n\n/**\n * Derive the implied relation for each `promising` identification in `candidates`.\n * Returns ONE proposal per admissible candidate (Adam M2), structurally\n * de-duplicated (`dedupByNormalForm`).\n *\n * Candidate-set-agnostic: pass `rankDiscoveries(CANONICAL_GRAPH)` (default),\n * `…(CATALOG_GRAPH)`, or `…([...CATALOG_GRAPH, ...CANONICAL_GRAPH])` to widen the\n * source — the CLI `discover --derive` forwards whichever `--source=` graph is\n * selected. Each endpoint is resolved by `resolveSource` to a canonical equation\n * OR a bridge edge with a clean-monomial `symbolic` form, so a candidate yields a\n * proposal when BOTH endpoints resolve (the Landauer photon, for instance, is\n * derivable both from `CE-landauer` and — at `--source=both` — from the BE-16\n * bridge). A target with SEVERAL admissible sources (BE-42 Hawking's two\n * parametrisations, or a canonical + bridge pair) is de-ambiguated by ENUMERATION\n * — every source pair is tried and coincidences collapse under dedup. HONEST\n * BOUNDARY: an endpoint with no clean-monomial source (a bridge with no `symbolic`\n * form or a non-monomial one) yields nothing.\n *\n * Pure; reads the registries, writes nothing.\n *\n * @internal\n */\nexport function deriveProposedBridges(\n  candidates: readonly VettedCandidate[] = rankDiscoveries(CANONICAL_GRAPH),\n): readonly ProposedBridge[] {\n  const out: ProposedBridge[] = [];\n  for (const cand of candidates) {\n    if (cand.verdict !== 'promising') continue;\n    const [t0, t1] = [cand.a, cand.b].sort();\n    // Enumerate every admissible source pair (de-ambiguation by enumeration).\n    for (const E1 of resolveSources(t0)) {\n      for (const E2 of resolveSources(t1)) {\n        const p = derivePair(cand, t0, t1, E1, E2);\n        if (p) out.push(p);\n      }\n    }\n  }\n  return disambiguateIds(dedupByNormalForm(out));\n}\n\n/** Derive one proposal from a fixed source pair, or null if inadmissible. */\nfunction derivePair(\n  cand: VettedCandidate,\n  t0: string,\n  t1: string,\n  E1: EquationSource,\n  E2: EquationSource,\n): ProposedBridge | null {\n  let m1: Mono;\n  let m2: Mono;\n  try {\n    m1 = toMonomial(E1.scalarAst);\n    m2 = toMonomial(E2.scalarAst);\n  } catch (e) {\n    if (e instanceof NotAMonomialError) return null;\n    throw e;\n  }\n\n  const solveFor = uniqueNonConstantLeaf(m2);\n  if (!solveFor) return null; // no single observable to isolate\n  if (m1.has(solveFor.name)) return null; // degenerate overlap (Design §5.2)\n\n  // Isolate solveFor from `m1 = m2`:  solveFor^e = m1 / (m2 without solveFor).\n  const result = isolateLeaf(m1, m2, solveFor);\n\n  const scalarAst = fromMonomial(result);\n  const dim = validate(scalarAst).inferredDimension;\n  if (!dim || !equals(dim, solveFor.dim)) return null; // round-trip guard\n\n  const governing: DimensionalVariable[] = [...result]\n    .filter(([name]) => !isConstant(name))\n    .map(([name, { dim: d }]) => ({ name, dim: d }));\n\n  const src = (e: EquationSource) => `${e.id} (${e.kind}, ${e.grade})`;\n  const provenance =\n    `Monomial elimination of the UNADJUDICATED identification ${cand.a} ≡ ${cand.b} ` +\n    `(${src(E1)}.rhs = ${src(E2)}.rhs), solved for '${solveFor.name}'. ` +\n    `Algebraic consequence of a hypothesised identity — NOT a new physical ` +\n    `relation and NOT a bridge. Invertible (any free leaf may be isolated).`;\n\n  return {\n    id: `IC-${t0}--${t1}--${solveFor.name}`,\n    derivedFrom: {\n      identification: { a: cand.a, b: cand.b, dim: cand.dim },\n      sourceEquationIds: [E1.id, E2.id],\n      solvedFor: solveFor.name,\n    },\n    target: { name: solveFor.name, dim: solveFor.dim },\n    governing,\n    formulaLatex: `${solveFor.name} = ${latexFromMono(result)}`,\n    scalarAst,\n    dimensionalSignature: format(dim),\n    provenance,\n    alsoDerivableFrom: [],\n    status: 'unadjudicated',\n    evaluate: (values) => evalExpr(scalarAst, values),\n  };\n}\n\n/** Make ids unique: when distinct proposals (different source pairs) collide on\n *  the base `IC-<a>--<b>--<solveFor>` id, suffix each with its source pair. */\nfunction disambiguateIds(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const counts = new Map<string, number>();\n  for (const p of proposals) counts.set(p.id, (counts.get(p.id) ?? 0) + 1);\n  return proposals.map((p) =>\n    (counts.get(p.id) ?? 0) > 1\n      ? { ...p, id: `${p.id}--${p.derivedFrom.sourceEquationIds.join('+')}` }\n      : p,\n  );\n}\n\n/**\n * The hash a proposal dedupes under: `normalForm` of its monomial rebuilt\n * from the exact exponents (so `0.3333333333333333` and\n * `0.33333333333333337` are one `1/3`), or of the AST itself when it is not\n * a monomial.\n */\nfunction dedupKey(p: ProposedBridge): string {\n  let canonical: ExprNode = p.scalarAst;\n  try {\n    canonical = fromMonomial(toMonomial(p.scalarAst));\n  } catch (err) {\n    if (!(err instanceof NotAMonomialError)) throw err;\n  }\n  return `${normalForm(canonical)}::${p.dimensionalSignature}`;\n}\n\n/**\n * Collapse proposals that derive the SAME relation — equal `normalForm` (up to\n * dimensionless constants) of the exact monomial AND equal target dimension —\n * into the first, recording the others' identifications in\n * `alsoDerivableFrom`. Distinct stubs do NOT collapse (e.g. Landauer's dropped\n * `ln2` vs an operator stub hash differently), so this only merges genuine\n * structural twins that a wider candidate scope can produce (Design §9 #2).\n * Deterministic: input order is preserved.\n *\n * @internal\n */\nexport function dedupByNormalForm(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const byKey = new Map<string, ProposedBridge>();\n  const order: string[] = [];\n  const extras = new Map<string, string[]>();\n\n  for (const p of proposals) {\n    let key = dedupKey(p);\n    // On a hash miss, the algebraic step: a kept proposal of the same dimension\n    // that is this one up to a constant owns the key (`a/(b/c)` for `a·c/b`).\n    if (!byKey.has(key)) {\n      const twin = order.find((k) => {\n        const candidate = byKey.get(k)!;\n        return candidate.dimensionalSignature === p.dimensionalSignature && equalUpToConstant(candidate.scalarAst, p.scalarAst).equal;\n      });\n      if (twin !== undefined) key = twin;\n    }\n    const kept = byKey.get(key);\n    if (kept === undefined) {\n      byKey.set(key, p);\n      order.push(key);\n      extras.set(key, [...p.alsoDerivableFrom]);\n    } else {\n      const tag = `${p.derivedFrom.identification.a} ≡ ${p.derivedFrom.identification.b}`;\n      extras.get(key)!.push(tag, ...p.alsoDerivableFrom);\n    }\n  }\n\n  return order.map((key) => {\n    const p = byKey.get(key)!;\n    const merged = [...new Set(extras.get(key)!)].sort();\n    return merged.length === p.alsoDerivableFrom.length\n      ? p\n      : { ...p, alsoDerivableFrom: merged };\n  });\n}\n\n// ── promotion gate (guardrail #5) ───────────────────────────────────────────\n\n/** The human inputs a proposal CANNOT supply — fabricating them is forbidden. */\ninterface PromotionEvidence {\n  /** Literature anchor establishing the relation (appears / contradicts / neither). */\n  readonly citation: string;\n  /** Human-chosen catalog status — never defaulted. */\n  readonly status: BridgeEquationStatus;\n  /** Path to the recorded adversarial + literature review. */\n  readonly reviewRef: string;\n}\n\n/** A review-ready promotion request — the artifact a human turns into a catalog\n *  entry. Holding one does NOT mutate `BRIDGE_EQUATIONS`. */\ninterface PromotionRequest {\n  readonly proposal: ProposedBridge;\n  readonly evidence: PromotionEvidence;\n}\n\n/** Thrown when a proposal is promoted without the evidence the promotion requires. @internal */\nexport class MissingEvidenceError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'MissingEvidenceError';\n  }\n}\n\n/**\n * Gate a proposal toward the catalog. THROWS `MissingEvidenceError` unless every\n * human input is present and non-blank (operationalises \"null, not guessed\").\n * Returns a `PromotionRequest`; it deliberately does NOT synthesise a\n * `BridgeEquationEntry` — the physics-judgment fields are human work.\n *\n * @internal\n */\nexport function promoteProposal(\n  proposal: ProposedBridge,\n  evidence: PromotionEvidence,\n): PromotionRequest {\n  const blank = (s: unknown): boolean => typeof s !== 'string' || s.trim() === '';\n  if (blank(evidence.citation)) throw new MissingEvidenceError('citation required');\n  if (blank(evidence.reviewRef)) throw new MissingEvidenceError('reviewRef required');\n  if (!evidence.status) throw new MissingEvidenceError('status required (not defaulted)');\n  return { proposal, evidence };\n}\n\n// ── PROPOSED_BRIDGES review surface (catalog field-shape, own registry) ──────\n\n/**\n * A derived proposal in the catalog's field SHAPE, for review — but in its OWN\n * registry and carrying `status: 'unadjudicated'` (NOT a `BridgeEquationStatus`).\n * This is deliberately NOT a `BridgeEquationEntry`: it omits the spec-only fields\n * (`source_part`/`source_section`/numeric `id`) and never enters `BRIDGE_EQUATIONS`,\n * which stays the faithful encoding of the specification.\n *\n * @internal\n */\ninterface ProposedBridgeEntry {\n  readonly id: string;\n  readonly name: string;\n  readonly category: 'Z';\n  readonly category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)';\n  /** The two regimes bridged — the source equations' domains. */\n  readonly bridges: readonly [string, string];\n  /** ALWAYS 'unadjudicated' — not a catalog status. */\n  readonly status: 'unadjudicated';\n  readonly context: string;\n  readonly formula_latex: string;\n  readonly dimensional_signature: string;\n  /** Honest references: a derivation note + the SOURCE equations' citations,\n   *  never a fabricated citation for the derived relation itself. */\n  readonly references: readonly string[];\n  readonly known_issues: readonly KnownIssue[];\n  readonly derivedFrom: ProposedBridge['derivedFrom'];\n  readonly notes: string;\n}\n\n/** Domain label + citations for a source id — canonical (`CE-…`) or bridge\n *  (`BE-<n>`), so the entry surface works for either source kind. */\nfunction equationMeta(id: string): { domain: string; references: readonly string[] } {\n  const ce = canonicalById(id);\n  if (ce) return { domain: ce.domain, references: ce.references };\n  const n = catalogIdNumber(id);\n  const be = n === undefined ? undefined : BRIDGE_EQUATIONS.find((e) => e.id === n);\n  if (be) return { domain: `${be.bridges[0]}↔${be.bridges[1]} (${be.status})`, references: be.references };\n  return { domain: 'unknown', references: [] };\n}\n\n/** Render a `ProposedBridge` into the catalog field-shape, filled honestly. @internal */\nexport function toProposedEntry(p: ProposedBridge): ProposedBridgeEntry {\n  const [id1, id2] = p.derivedFrom.sourceEquationIds;\n  const M1 = equationMeta(id1);\n  const M2 = equationMeta(id2);\n  const { a, b } = p.derivedFrom.identification;\n  const srcRefs = [\n    [id1, M1] as const,\n    [id2, M2] as const,\n  ].flatMap(([id, m]) => m.references.map((r) => `source ${id}: ${r}`));\n  return {\n    id: p.id,\n    name: `${a} ≡ ${b} ⇒ ${p.derivedFrom.solvedFor} (derived)`,\n    category: 'Z',\n    category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)',\n    bridges: [M1.domain, M2.domain],\n    status: 'unadjudicated',\n    context:\n      `Algebraic consequence of the UNADJUDICATED identification ${a} ≡ ${b} ` +\n      `(${id1}.rhs = ${id2}.rhs), solved for ${p.derivedFrom.solvedFor}. A ` +\n      `dimensional coincidence surfaced by the discovery funnel — no physical ` +\n      `mechanism is asserted, and it is NOT a bridge.`,\n    formula_latex: p.formulaLatex,\n    dimensional_signature: p.dimensionalSignature,\n    references: [\n      'Machine-derived; the combined relation has no independent literature.',\n      ...srcRefs,\n    ],\n    known_issues: [\n      {\n        severity: 'phenomenological-ansatz',\n        description:\n          'Machine-derived dimensional coincidence: the algebraic consequence ' +\n          'of an unadjudicated identification, with no mechanism and no ' +\n          'independent literature. Promotion to BRIDGE_EQUATIONS requires an ' +\n          'adversarial + literature review (Part-VI §XXVII-B) via promoteProposal().',\n        fixable: 'unknown',\n      },\n    ],\n    derivedFrom: p.derivedFrom,\n    notes:\n      p.provenance +\n      (p.alsoDerivableFrom.length\n        ? ` Also derivable from: ${p.alsoDerivableFrom.join('; ')}.`\n        : ''),\n  };\n}\n\n/**\n * The PROPOSED-BRIDGE review surface: derived identity-consequences in the\n * catalog's field shape, in their OWN registry, every entry `status:\n * 'unadjudicated'`. Separate from `BRIDGE_EQUATIONS` (the faithful spec\n * encoding), which this never mutates. Default scope: canonical-only — widen with\n * `deriveProposedBridges(rankDiscoveries(graph)).map(toProposedEntry)`.\n *\n * @internal\n */\nexport const PROPOSED_BRIDGES: readonly ProposedBridgeEntry[] =\n  deriveProposedBridges().map(toProposedEntry);\n"]}
+{"version":3,"file":"proposed-bridges.js","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AACpG,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAElE,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAc1E,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC5B,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnC,2FAA2F;AAC3F,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,SAAS,SAAS,CAAC,IAAU,EAAE,IAAU,EAAE,KAAe;IACxD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,iBAAiB,CACzB,SAAS,IAAI,wCAAwC,CACtD,CAAC;YACJ,CAAC;YACD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,GAAa;IACtC,MAAM,GAAG,GAAS,IAAI,GAAG,EAAE,CAAC;IAC5B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC;gBACf,KAAK,GAAG;oBACN,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC7D,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBAChC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;oBACrC,KAAK,MAAM,CAAC,IAAI,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC/D,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBACjC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAC9B,MAAM,IAAI,iBAAiB,CAAC,sBAAsB,CAAC,CAAC;oBACtD,CAAC;oBACD,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;wBACpB,MAAM,IAAI,iBAAiB,CAAC,yBAAyB,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACxE,CAAC;oBACD,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD;oBACE,MAAM,IAAI,iBAAiB,CAAC,aAAa,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACxE,CAAC;QACH;YACE,MAAM,IAAI,iBAAiB,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED;;;;;;;;;;gBAUgB;AAChB,MAAM,UAAU,YAAY,CAAC,CAAO;IAClC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,GAAc,EAAE,CAAW,EAAY,EAAE,CACrE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,IAAI,GAAG,CAAC,SAAS,GAAG,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;;YACpD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAc,EAAY,EAAE,CAC3C,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAE9D,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC;AAoDD,MAAM,UAAU,GAAG,oBAAoB,CAAC;AASxC,sEAAsE;AACtE,SAAS,qBAAqB,CAAC,CAAO;IACpC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,aAAa,CAAC,CAAO;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC;QACpF,CAAC,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;IACtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,EAAQ,EAAE,EAAQ,EAAE,QAAkB;IAChE,MAAM,MAAM,GAAS,IAAI,GAAG,EAAE,CAAC;IAC/B,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3B,MAAM,SAAS,GAAS,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;IACpC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;YAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,0EAA0E;AAC1E,iFAAiF;AACjF,4EAA4E;AAC5E,6EAA6E;AAC7E,sEAAsE;AAEtE,SAAS,eAAe,CAAC,GAAa,EAAE,IAA4B;IAClE,iBAAiB,CACf,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1D,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,SAAS,YAAY,CACnB,SAAmB,EACnB,SAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC;YAAE,SAAS;QACzD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS,CAAC,uBAAuB;QAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,GAAa,EAAE,GAAgC;IACnE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/B,OAAO,eAAe,CACpB,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAoBD;;;gFAGgF;AAChF,SAAS,kBAAkB,CAAC,CAAO,EAAE,MAA2B;IAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IACE,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAC1B,CAAC,UAAU,CAAC,IAAI,CAAC;YACjB,CAAC,gBAAgB,CAAC,IAAI,CAAC;YACvB,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EACjB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;gBAIgB;AAChB,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,MAAM,GAAG,GAAqB,EAAE,CAAC;IAEjC,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IACE,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI;YAC/B,CAAC,CAAC,eAAe,KAAK,oBAAoB,EAC1C,CAAC;YACD,yEAAyE;YACzE,4EAA4E;YAC5E,sCAAsC;YACtC,MAAM,SAAS,GAAG,YAAY,CAC5B,CAAC,CAAC,SAAS,EACX,YAAY,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CACnD,CAAC;YACF,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,WAAW;gBACjB,SAAS;gBACT,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;gBACnC,KAAK,EAAE,CAAC,CAAC,eAAe;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,wEAAwE;IACxE,6DAA6D;IAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAC1D,IAAI,CAAO,CAAC;QACZ,IAAI,CAAC;YACH,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,iBAAiB;gBAAE,SAAS;YAC/C,MAAM,GAAG,CAAC;QACZ,CAAC;QACD,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9E,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,iBAAiB,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QACpD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG;YAC1B,KAAK,EAAE,IAAI,CAAC,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAU,GAA+B,eAAe,CAAC,eAAe,CAAC;IAEzE,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QAC7C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,0EAA0E;QAC1E,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,6EAA6E;AAC7E,SAAS,UAAU,CACjB,IAAqB,EACrB,EAAU,EACV,EAAU,EACV,EAAkB,EAClB,EAAkB;IAElB,IAAI,EAAQ,CAAC;IACb,IAAI,EAAQ,CAAC;IACb,IAAI,CAAC;QACH,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9B,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,iBAAiB;YAAE,OAAO,IAAI,CAAC;QAChD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,MAAM,QAAQ,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,kCAAkC;IAC9D,IAAI,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mCAAmC;IAE3E,6EAA6E;IAC7E,MAAM,MAAM,GAAG,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IAE7C,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,iBAAiB,CAAC;IAClD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mBAAmB;IAExE,MAAM,SAAS,GAA0B,CAAC,GAAG,MAAM,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACrC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAG,CAAC,CAAiB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC;IACrE,MAAM,UAAU,GACd,4DAA4D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG;QACjF,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,sBAAsB,QAAQ,CAAC,IAAI,KAAK;QACpE,wEAAwE;QACxE,wEAAwE,CAAC;IAE3E,OAAO;QACL,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,QAAQ,CAAC,IAAI,EAAE;QACvC,WAAW,EAAE;YACX,cAAc,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,iBAAiB,EAAE,IAAI,CAAC,OAAO,KAAK,WAAW,EAAE;YACxG,iBAAiB,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;YACjC,SAAS,EAAE,QAAQ,CAAC,IAAI;SACzB;QACD,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE;QAClD,SAAS;QACT,YAAY,EAAE,GAAG,QAAQ,CAAC,IAAI,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE;QAC3D,SAAS;QACT,oBAAoB,EAAE,MAAM,CAAC,GAAG,CAAC;QACjC,UAAU;QACV,iBAAiB,EAAE,EAAE;QACrB,MAAM,EAAE,eAAe;QACvB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,eAAe,CACtB,SAAoC;IAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;QACzB,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;QACvE,CAAC,CAAC,CAAC,CACN,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,CAAiB;IACjC,IAAI,SAAS,GAAa,CAAC,CAAC,SAAS,CAAC;IACtC,IAAI,CAAC;QACH,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,YAAY,iBAAiB,CAAC;YAAE,MAAM,GAAG,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,4EAA4E;QAC5E,0EAA0E;QAC1E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAChC,OAAO,SAAS,CAAC,oBAAoB,KAAK,CAAC,CAAC,oBAAoB,IAAI,iBAAiB,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC;YAChI,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,KAAK,SAAS;gBAAE,GAAG,GAAG,IAAI,CAAC;QACrC,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,iBAAiB,CAAC,MAAM;YACjD,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC;AAqBD,gGAAgG;AAChG,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,QAA2B;IAE3B,MAAM,KAAK,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;IAChF,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;IAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACpF,IAAI,CAAC,QAAQ,CAAC,MAAM;QAAE,MAAM,IAAI,oBAAoB,CAAC,iCAAiC,CAAC,CAAC;IACxF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAiCD;qEACqE;AACrE,SAAS,YAAY,CAAC,EAAU;IAC9B,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7B,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IAChE,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAClF,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IACzG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC/C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,eAAe,CAAC,CAAiB;IAC/C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC;IACnD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC;IAC9C,MAAM,OAAO,GAAG;QACd,CAAC,GAAG,EAAE,EAAE,CAAU;QAClB,CAAC,GAAG,EAAE,EAAE,CAAU;KACnB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,SAAS,YAAY;QAC1D,QAAQ,EAAE,GAAG;QACb,aAAa,EAAE,uDAAuD;QACtE,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;QAC/B,MAAM,EAAE,eAAe;QACvB,OAAO,EACL,6DAA6D,CAAC,MAAM,CAAC,GAAG;YACxE,IAAI,GAAG,UAAU,GAAG,qBAAqB,CAAC,CAAC,WAAW,CAAC,SAAS,MAAM;YACtE,yEAAyE;YACzE,gDAAgD;QAClD,aAAa,EAAE,CAAC,CAAC,YAAY;QAC7B,qBAAqB,EAAE,CAAC,CAAC,oBAAoB;QAC7C,UAAU,EAAE;YACV,uEAAuE;YACvE,GAAG,OAAO;SACX;QACD,YAAY,EAAE;YACZ;gBACE,QAAQ,EAAE,yBAAyB;gBACnC,WAAW,EACT,qEAAqE;oBACrE,+DAA+D;oBAC/D,oEAAoE;oBACpE,2EAA2E;gBAC7E,OAAO,EAAE,SAAS;aACnB;SACF;QACD,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,KAAK,EACH,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM;gBACzB,CAAC,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBAC5D,CAAC,CAAC,EAAE,CAAC;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAC3B,qBAAqB,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC","sourcesContent":["/**\n * Identity-consequence surfacer — turns a promising (either tier) discovery identification\n * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.\n *\n * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal\n * dimension), and `a`, `b` are the TARGETS of two canonical equations `Eₐ`, `E_b`,\n * the hypothesised identity `a ≡ b` makes their right-hand sides equal:\n *\n *     Eₐ.scalarAst  =  E_b.scalarAst\n *\n * Eliminating (isolating) one free variable yields a relation among the union of\n * the two governing sets — e.g. Landauer `k_B T ln2` ≟ Planck–Einstein `h ν`\n * gives `ν = (k_B ln2 / h) · T`, the \"Landauer photon\".\n *\n * CRITICAL — this is NOT new physics and NOT a bridge. It is the algebraic\n * consequence of an UNADJUDICATED identification, surfaced for a physicist to\n * judge (Part-VI §XXVII-B: the enumerator proposes, humans dispose). Every\n * emitted record carries `status: 'unadjudicated'` — a literal that is NOT a\n * member of `BridgeEquationStatus`, so a proposal can never be assigned where a\n * catalog entry is expected. The generator NEVER writes `BRIDGE_EQUATIONS` and a\n * proposal is NEVER added to `CANONICAL_GRAPH` (no coincidence-amplifying loop).\n *\n * Scope (v0.24.0 pilot): canonical-only `promising` candidates whose BOTH source\n * equations (a) have a non-null `dimensional.monomial` (determinate) and (b) are\n * `epistemicStatus: 'fully-quantitative'` (so the eliminated prefactor is a\n * closed numeric constant, not an operator-valued stub — this gates out\n * `CE-jarzynski`). See `docs/planning/v0.24.0-{Design,Review-Findings}.md`.\n *\n * INTERNAL tooling — deliberately NOT re-exported from `src/index.ts`.\n *\n * @module composition/proposed-bridges\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { sym, symbolPower } from '../dimensional/ast-builders.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { DimensionalVariable } from '../dimensional/buckingham.js';\nimport type { BridgeEquationStatus } from '../bridges/index.js';\nimport { canonicalByTarget, canonicalById } from '../canonical/registry.js';\nimport type { KnownIssue } from '../bridges/index.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { catalogIdNumber } from '../bridges/catalog-load.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { forEachScalarLeaf, isDecimalLiteral, mapScalarLeaves } from '../dimensional/ast-leaves.js';\nimport { evalExpr } from './expr-eval.js';\nimport { rankDiscoveries, isPromisingTier } from './discovery.js';\nimport type { VettedCandidate } from './discovery.js';\nimport { CANONICAL_GRAPH } from './canonical-graph.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { rationalExponentOf } from './formula-shape.js';\nimport { equalUpToConstant } from './algebraic-equivalence.js';\nimport { formatRational, fractionToNumber } from './rational-exponent.js';\n\n// ── monomial algebra over flat ExprNode forms ───────────────────────────────\n\n/**\n * A flat monomial: leaf name → its dimension and signed exact exponent.\n * `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. The exponent is a core\n * `Fraction`, so solving for a cubed leaf carries `1/3`, not\n * `0.3333333333333333`, and a cancellation is an exact zero.\n *\n * @internal\n */\nexport type Mono = Map<string, { dim: Dimension; exp: Fraction }>;\n\nconst ONE = new Fraction(1);\nconst MINUS_ONE = new Fraction(-1);\n\n/** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */\nexport class NotAMonomialError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotAMonomialError';\n  }\n}\n\nfunction mergeInto(into: Mono, from: Mono, scale: Fraction): void {\n  for (const [name, { dim, exp }] of from) {\n    const cur = into.get(name);\n    if (cur === undefined) {\n      into.set(name, { dim, exp: exp.multiply(scale) });\n    } else {\n      if (!equals(cur.dim, dim)) {\n        throw new NotAMonomialError(\n          `leaf '${name}' appears with inconsistent dimensions`,\n        );\n      }\n      cur.exp = cur.exp.add(exp.multiply(scale));\n    }\n  }\n}\n\n/**\n * Decompose a flat-monomial `ExprNode` into a leaf→exponent map. Throws\n * `NotAMonomialError` on sums, differences, or non-symbol bases — this is the\n * AST-level monomial gate.\n *\n * @internal\n */\nexport function toMonomial(ast: ExprNode): Mono {\n  const out: Mono = new Map();\n  switch (ast.kind) {\n    case 'symbol':\n      out.set(ast.name, { dim: ast.dim, exp: ONE });\n      return out;\n    case 'op':\n      switch (ast.op) {\n        case '*':\n          for (const a of ast.args) mergeInto(out, toMonomial(a), ONE);\n          return out;\n        case '/': {\n          const [num, ...dens] = ast.args;\n          mergeInto(out, toMonomial(num), ONE);\n          for (const d of dens) mergeInto(out, toMonomial(d), MINUS_ONE);\n          return out;\n        }\n        case '^': {\n          const [base, expNode] = ast.args;\n          if (expNode.kind !== 'symbol') {\n            throw new NotAMonomialError('non-literal exponent');\n          }\n          const n = rationalExponentOf(expNode.name);\n          if (n === undefined) {\n            throw new NotAMonomialError(`non-numeric exponent '${expNode.name}'`);\n          }\n          mergeInto(out, toMonomial(base), n);\n          return out;\n        }\n        default:\n          throw new NotAMonomialError(`operator '${ast.op}' is not monomial`);\n      }\n    default:\n      throw new NotAMonomialError(`node kind '${ast.kind}' is not monomial`);\n  }\n}\n\n/** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =\n *  positive exponents, denominator = negative). Zero exponents drop out. The\n *  exponent literal is the double built from the fraction (`1/3` is written\n *  `0.3333333333333333`), so one rational is always one spelling.\n *\n *  This is not merged with `monomialToExpr` (composition/probe/generator.ts),\n *  which writes one product with negative exponents in code-unit name order;\n *  this one orders names by `localeCompare` and splits a quotient. The\n *  proposals' printed formulas and the IC dedup key read this tree, so one\n *  builder would move them. Both build each factor with `symbolPower`.\n *  @internal */\nexport function fromMonomial(m: Mono): ExprNode {\n  const factor = (name: string, dim: Dimension, e: Fraction): ExprNode =>\n    symbolPower(sym(name, dim), fractionToNumber(e));\n\n  const num: ExprNode[] = [];\n  const den: ExprNode[] = [];\n  for (const [name, { dim, exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    if (exp.numerator > 0n) num.push(factor(name, dim, exp));\n    else den.push(factor(name, dim, exp.abs()));\n  }\n  const product = (xs: ExprNode[]): ExprNode =>\n    xs.length === 1 ? xs[0] : { kind: 'op', op: '*', args: xs };\n\n  const numerator = num.length === 0 ? sym('1', DIMENSIONLESS) : product(num);\n  if (den.length === 0) return numerator;\n  return { kind: 'op', op: '/', args: [numerator, product(den)] };\n}\n\n// ── the proposal record ─────────────────────────────────────────────────────\n\n/**\n * A machine-DERIVED candidate bridge — the MATH ONLY. The algebraic consequence\n * of an UNADJUDICATED identification; never a status claim. Structurally distinct\n * from `BridgeEquationEntry` (omits every physics-judgment field) and carries the\n * literal `status: 'unadjudicated'`, which is NOT a `BridgeEquationStatus`.\n *\n * @internal\n */\nexport interface ProposedBridge {\n  /** `IC-<sorted-a>--<sorted-b>--<solvedFor>`. */\n  readonly id: string;\n  readonly derivedFrom: {\n    readonly identification: {\n      readonly a: string;\n      readonly b: string;\n      readonly dim: string;\n      /**\n       * The source row's magnitude evidence: true when it was `promising` (the magnitude\n       * falsifier ran and could have failed), false when it was `promising-unchecked` (the gate\n       * abstained, or its pass was anchor-invariant). A proposal from an unchecked\n       * identification is printed as such.\n       */\n      readonly magnitudeEvidence: boolean;\n    };\n    readonly sourceEquationIds: readonly [string, string];\n    readonly solvedFor: string;\n  };\n  readonly target: DimensionalVariable;\n  /** Free (non-constant) inputs of the derived relation. */\n  readonly governing: readonly DimensionalVariable[];\n  readonly formulaLatex: string;\n  /** Dimensionally-VALIDATED derived RHS (round-trips to `dimensionalSignature`). */\n  readonly scalarAst: ExprNode;\n  /** `format()` of the inferred dimension — same convention as the catalog. */\n  readonly dimensionalSignature: string;\n  /** Mechanical derivation description — NO physics claim. */\n  readonly provenance: string;\n  /** Other identifications that derive the SAME relation (same normal form, up\n   *  to dimensionless constants), collapsed into this proposal by the dedup pass.\n   *  Empty unless a wider candidate scope produced structural duplicates. */\n  readonly alsoDerivableFrom: readonly string[];\n  /** ALWAYS the literal 'unadjudicated'. NOT a BridgeEquationStatus. */\n  readonly status: 'unadjudicated';\n  /** Numerically evaluate the derived RHS; constants auto-resolve, supply the\n   *  free `governing` leaves (e.g. `{ T: 300 }`). */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\nconst isConstant = isRegisteredConstant;\n\n/** One leaf of a monomial with its exact exponent. @internal */\nexport interface MonoLeaf {\n  readonly name: string;\n  readonly dim: Dimension;\n  readonly exp: Fraction;\n}\n\n/** The single non-constant leaf of a monomial, or null if 0 or >1. */\nfunction uniqueNonConstantLeaf(m: Mono): MonoLeaf | null {\n  const free = [...m].filter(([name]) => !isConstant(name));\n  if (free.length !== 1) return null;\n  const [name, { dim, exp }] = free[0];\n  return { name, dim, exp };\n}\n\n/** The LaTeX of a monomial, exponents rendered from their fractions (`y^{1/3}`). @internal */\nexport function latexFromMono(m: Mono): string {\n  const num: string[] = [];\n  const den: string[] = [];\n  for (const [name, { exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    const magnitude = exp.abs();\n    const tok = magnitude.equals(ONE) ? name : `${name}^{${formatRational(magnitude)}}`;\n    (exp.numerator > 0n ? num : den).push(tok);\n  }\n  const n = num.join(' \\\\cdot ') || '1';\n  return den.length ? `\\\\frac{${n}}{${den.join(' \\\\cdot ')}}` : n;\n}\n\n/**\n * Isolate `solveFor` from `m1 = m2`: `solveFor^e = m1 / (m2 without solveFor)`,\n * every exponent divided by `e`, exactly. `m2` must hold `solveFor`.\n *\n * @internal\n */\nexport function isolateLeaf(m1: Mono, m2: Mono, solveFor: MonoLeaf): Mono {\n  const result: Mono = new Map();\n  mergeInto(result, m1, ONE);\n  const m2NoSolve: Mono = new Map(m2);\n  m2NoSolve.delete(solveFor.name);\n  mergeInto(result, m2NoSolve, MINUS_ONE);\n  if (!solveFor.exp.equals(ONE)) {\n    for (const v of result.values()) v.exp = v.exp.divide(solveFor.exp);\n  }\n  return result;\n}\n\n// ── leaf-name canonicalization ──────────────────────────────────────────────\n// A canonical equation's `scalarAst` uses private symbols (`T`) while its\n// `dimensional.governing` and the whole composition graph (and bridge `symbolic`\n// forms) use quantity names (`temperature`). Aligning the AST leaves to the\n// governing names lets a derivation from a canonical equation and one from a\n// bridge edge of the SAME physics collapse under `dedupByNormalForm`.\n\nfunction collectLeafDims(ast: ExprNode, into: Map<string, Dimension>): void {\n  forEachScalarLeaf(\n    ast,\n    (leaf) => {\n      if (!into.has(leaf.name)) into.set(leaf.name, leaf.dim);\n    },\n    {},\n  );\n}\n\n/** Map each non-constant `scalarAst` leaf to the governing quantity of equal\n *  dimension, when that match is unique (else leave it — never guess). */\nfunction leafCanonMap(\n  scalarAst: ExprNode,\n  governing: readonly DimensionalVariable[],\n): Map<string, string> {\n  const leaves = new Map<string, Dimension>();\n  collectLeafDims(scalarAst, leaves);\n  const govFree = governing.filter((g) => !isConstant(g.name));\n  const map = new Map<string, string>();\n  for (const [leaf, dim] of leaves) {\n    if (isConstant(leaf) || isDecimalLiteral(leaf)) continue;\n    if (govFree.some((g) => g.name === leaf)) continue; // already a graph name\n    const matches = govFree.filter((g) => equals(g.dim, dim));\n    if (matches.length === 1) map.set(leaf, matches[0].name);\n  }\n  return map;\n}\n\nfunction renameLeaves(ast: ExprNode, map: ReadonlyMap<string, string>): ExprNode {\n  if (map.size === 0) return ast;\n  return mapScalarLeaves(\n    ast,\n    (leaf) => {\n      const r = map.get(leaf.name);\n      return r ? { ...leaf, name: r } : leaf;\n    },\n    {},\n  );\n}\n\n// ── the generator ───────────────────────────────────────────────────────────\n\n/**\n * An admissible source for the elimination: a target name backed by a flat\n * monomial `scalarAst` whose prefactor is a closed constant. Canonical equations\n * and bridge edges both project to this shape, so the generator no longer needs\n * to know which it came from.\n */\ninterface EquationSource {\n  /** `CE-…` (canonical) or `BE-<n>` (bridge). */\n  readonly id: string;\n  readonly kind: 'canonical' | 'bridge';\n  readonly scalarAst: ExprNode;\n  readonly targetDim: Dimension;\n  /** `epistemicStatus` (canonical) or `confidence` (bridge) — recorded, not gated. */\n  readonly grade: string;\n}\n\n/** True if the monomial carries a dimensionless leaf that is neither a known\n *  constant, a numeric literal, NOR a declared input quantity — i.e. an\n *  operator-valued STUB (e.g. Jarzynski's `ln_avg_exp_minus_betaW`), not a clean\n *  dimensionless INPUT like a coupling constant (BE-18's `yukawa-coupling`). */\nfunction hasNonConstantStub(m: Mono, inputs: ReadonlySet<string>): boolean {\n  for (const [name, { dim }] of m) {\n    if (\n      equals(dim, DIMENSIONLESS) &&\n      !isConstant(name) &&\n      !isDecimalLiteral(name) &&\n      !inputs.has(name)\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** ALL admissible sources for `name` — every canonical equation AND every bridge\n *  edge whose target is `name` and whose form is a clean monomial. A target with\n *  several sources (e.g. BE-42 Hawking's two parametrisations) is DE-AMBIGUATED by\n *  enumeration, not skipped; coinciding derivations collapse later under dedup.\n *  @internal */\nexport function resolveSources(name: string): EquationSource[] {\n  const out: EquationSource[] = [];\n\n  // Canonical: a determinate monomial AND a fully-quantitative form.\n  for (const e of canonicalByTarget(name)) {\n    if (\n      e.scalarAst &&\n      e.dimensional.monomial !== null &&\n      e.epistemicStatus === 'fully-quantitative'\n    ) {\n      // Align the AST's private leaf symbols (`T`) with the governing quantity\n      // names (`temperature`) so canonical- and bridge-sourced derivations of the\n      // same relation collapse under dedup.\n      const scalarAst = renameLeaves(\n        e.scalarAst,\n        leafCanonMap(e.scalarAst, e.dimensional.governing),\n      );\n      out.push({\n        id: e.id,\n        kind: 'canonical',\n        scalarAst,\n        targetDim: e.dimensional.target.dim,\n        grade: e.epistemicStatus,\n      });\n    }\n  }\n\n  // Bridge: edges carrying a clean-monomial `symbolic` form. `confidence` is about\n  // FRAMING, not formula completeness, so it is recorded — not gated; the\n  // structural stub check enforces a closed prefactor instead.\n  for (const edge of CATALOG_GRAPH) {\n    if (edge.target.name !== name || !edge.symbolic) continue;\n    let m: Mono;\n    try {\n      m = toMonomial(edge.symbolic);\n    } catch (err) {\n      if (err instanceof NotAMonomialError) continue;\n      throw err;\n    }\n    if (hasNonConstantStub(m, new Set(edge.sources.map((s) => s.name)))) continue;\n    const dim = validate(edge.symbolic).inferredDimension;\n    if (!dim || !equals(dim, edge.target.dim)) continue;\n    out.push({\n      id: edge.beId !== null ? `BE-${edge.beId}` : edge.id,\n      kind: 'bridge',\n      scalarAst: edge.symbolic,\n      targetDim: edge.target.dim,\n      grade: edge.confidence,\n    });\n  }\n\n  return out;\n}\n\n/**\n * Derive the implied relation for each identification in `candidates` in either promising tier\n * (`promising` or `promising-unchecked`, {@link isPromisingTier}); each proposal records which in\n * `derivedFrom.identification.magnitudeEvidence`.\n * Returns ONE proposal per admissible candidate (Adam M2), structurally\n * de-duplicated (`dedupByNormalForm`).\n *\n * Candidate-set-agnostic: pass `rankDiscoveries(CANONICAL_GRAPH)` (default),\n * `…(CATALOG_GRAPH)`, or `…([...CATALOG_GRAPH, ...CANONICAL_GRAPH])` to widen the\n * source — the CLI `discover --derive` forwards whichever `--source=` graph is\n * selected. Each endpoint is resolved by `resolveSource` to a canonical equation\n * OR a bridge edge with a clean-monomial `symbolic` form, so a candidate yields a\n * proposal when BOTH endpoints resolve (the Landauer photon, for instance, is\n * derivable both from `CE-landauer` and — at `--source=both` — from the BE-16\n * bridge). A target with SEVERAL admissible sources (BE-42 Hawking's two\n * parametrisations, or a canonical + bridge pair) is de-ambiguated by ENUMERATION\n * — every source pair is tried and coincidences collapse under dedup. HONEST\n * BOUNDARY: an endpoint with no clean-monomial source (a bridge with no `symbolic`\n * form or a non-monomial one) yields nothing.\n *\n * Pure; reads the registries, writes nothing.\n *\n * @internal\n */\nexport function deriveProposedBridges(\n  candidates: readonly VettedCandidate[] = rankDiscoveries(CANONICAL_GRAPH),\n): readonly ProposedBridge[] {\n  const out: ProposedBridge[] = [];\n  for (const cand of candidates) {\n    if (!isPromisingTier(cand.verdict)) continue;\n    const [t0, t1] = [cand.a, cand.b].sort();\n    // Enumerate every admissible source pair (de-ambiguation by enumeration).\n    for (const E1 of resolveSources(t0)) {\n      for (const E2 of resolveSources(t1)) {\n        const p = derivePair(cand, t0, t1, E1, E2);\n        if (p) out.push(p);\n      }\n    }\n  }\n  return disambiguateIds(dedupByNormalForm(out));\n}\n\n/** Derive one proposal from a fixed source pair, or null if inadmissible. */\nfunction derivePair(\n  cand: VettedCandidate,\n  t0: string,\n  t1: string,\n  E1: EquationSource,\n  E2: EquationSource,\n): ProposedBridge | null {\n  let m1: Mono;\n  let m2: Mono;\n  try {\n    m1 = toMonomial(E1.scalarAst);\n    m2 = toMonomial(E2.scalarAst);\n  } catch (e) {\n    if (e instanceof NotAMonomialError) return null;\n    throw e;\n  }\n\n  const solveFor = uniqueNonConstantLeaf(m2);\n  if (!solveFor) return null; // no single observable to isolate\n  if (m1.has(solveFor.name)) return null; // degenerate overlap (Design §5.2)\n\n  // Isolate solveFor from `m1 = m2`:  solveFor^e = m1 / (m2 without solveFor).\n  const result = isolateLeaf(m1, m2, solveFor);\n\n  const scalarAst = fromMonomial(result);\n  const dim = validate(scalarAst).inferredDimension;\n  if (!dim || !equals(dim, solveFor.dim)) return null; // round-trip guard\n\n  const governing: DimensionalVariable[] = [...result]\n    .filter(([name]) => !isConstant(name))\n    .map(([name, { dim: d }]) => ({ name, dim: d }));\n\n  const src = (e: EquationSource) => `${e.id} (${e.kind}, ${e.grade})`;\n  const provenance =\n    `Monomial elimination of the UNADJUDICATED identification ${cand.a} ≡ ${cand.b} ` +\n    `(${src(E1)}.rhs = ${src(E2)}.rhs), solved for '${solveFor.name}'. ` +\n    `Algebraic consequence of a hypothesised identity — NOT a new physical ` +\n    `relation and NOT a bridge. Invertible (any free leaf may be isolated).`;\n\n  return {\n    id: `IC-${t0}--${t1}--${solveFor.name}`,\n    derivedFrom: {\n      identification: { a: cand.a, b: cand.b, dim: cand.dim, magnitudeEvidence: cand.verdict === 'promising' },\n      sourceEquationIds: [E1.id, E2.id],\n      solvedFor: solveFor.name,\n    },\n    target: { name: solveFor.name, dim: solveFor.dim },\n    governing,\n    formulaLatex: `${solveFor.name} = ${latexFromMono(result)}`,\n    scalarAst,\n    dimensionalSignature: format(dim),\n    provenance,\n    alsoDerivableFrom: [],\n    status: 'unadjudicated',\n    evaluate: (values) => evalExpr(scalarAst, values),\n  };\n}\n\n/** Make ids unique: when distinct proposals (different source pairs) collide on\n *  the base `IC-<a>--<b>--<solveFor>` id, suffix each with its source pair. */\nfunction disambiguateIds(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const counts = new Map<string, number>();\n  for (const p of proposals) counts.set(p.id, (counts.get(p.id) ?? 0) + 1);\n  return proposals.map((p) =>\n    (counts.get(p.id) ?? 0) > 1\n      ? { ...p, id: `${p.id}--${p.derivedFrom.sourceEquationIds.join('+')}` }\n      : p,\n  );\n}\n\n/**\n * The hash a proposal dedupes under: `normalForm` of its monomial rebuilt\n * from the exact exponents (so `0.3333333333333333` and\n * `0.33333333333333337` are one `1/3`), or of the AST itself when it is not\n * a monomial.\n */\nfunction dedupKey(p: ProposedBridge): string {\n  let canonical: ExprNode = p.scalarAst;\n  try {\n    canonical = fromMonomial(toMonomial(p.scalarAst));\n  } catch (err) {\n    if (!(err instanceof NotAMonomialError)) throw err;\n  }\n  return `${normalForm(canonical)}::${p.dimensionalSignature}`;\n}\n\n/**\n * Collapse proposals that derive the SAME relation — equal `normalForm` (up to\n * dimensionless constants) of the exact monomial AND equal target dimension —\n * into the first, recording the others' identifications in\n * `alsoDerivableFrom`. Distinct stubs do NOT collapse (e.g. Landauer's dropped\n * `ln2` vs an operator stub hash differently), so this only merges genuine\n * structural twins that a wider candidate scope can produce (Design §9 #2).\n * Deterministic: input order is preserved.\n *\n * @internal\n */\nexport function dedupByNormalForm(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const byKey = new Map<string, ProposedBridge>();\n  const order: string[] = [];\n  const extras = new Map<string, string[]>();\n\n  for (const p of proposals) {\n    let key = dedupKey(p);\n    // On a hash miss, the algebraic step: a kept proposal of the same dimension\n    // that is this one up to a constant owns the key (`a/(b/c)` for `a·c/b`).\n    if (!byKey.has(key)) {\n      const twin = order.find((k) => {\n        const candidate = byKey.get(k)!;\n        return candidate.dimensionalSignature === p.dimensionalSignature && equalUpToConstant(candidate.scalarAst, p.scalarAst).equal;\n      });\n      if (twin !== undefined) key = twin;\n    }\n    const kept = byKey.get(key);\n    if (kept === undefined) {\n      byKey.set(key, p);\n      order.push(key);\n      extras.set(key, [...p.alsoDerivableFrom]);\n    } else {\n      const tag = `${p.derivedFrom.identification.a} ≡ ${p.derivedFrom.identification.b}`;\n      extras.get(key)!.push(tag, ...p.alsoDerivableFrom);\n    }\n  }\n\n  return order.map((key) => {\n    const p = byKey.get(key)!;\n    const merged = [...new Set(extras.get(key)!)].sort();\n    return merged.length === p.alsoDerivableFrom.length\n      ? p\n      : { ...p, alsoDerivableFrom: merged };\n  });\n}\n\n// ── promotion gate (guardrail #5) ───────────────────────────────────────────\n\n/** The human inputs a proposal CANNOT supply — fabricating them is forbidden. */\ninterface PromotionEvidence {\n  /** Literature anchor establishing the relation (appears / contradicts / neither). */\n  readonly citation: string;\n  /** Human-chosen catalog status — never defaulted. */\n  readonly status: BridgeEquationStatus;\n  /** Path to the recorded adversarial + literature review. */\n  readonly reviewRef: string;\n}\n\n/** A review-ready promotion request — the artifact a human turns into a catalog\n *  entry. Holding one does NOT mutate `BRIDGE_EQUATIONS`. */\ninterface PromotionRequest {\n  readonly proposal: ProposedBridge;\n  readonly evidence: PromotionEvidence;\n}\n\n/** Thrown when a proposal is promoted without the evidence the promotion requires. @internal */\nexport class MissingEvidenceError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'MissingEvidenceError';\n  }\n}\n\n/**\n * Gate a proposal toward the catalog. THROWS `MissingEvidenceError` unless every\n * human input is present and non-blank (operationalises \"null, not guessed\").\n * Returns a `PromotionRequest`; it deliberately does NOT synthesise a\n * `BridgeEquationEntry` — the physics-judgment fields are human work.\n *\n * @internal\n */\nexport function promoteProposal(\n  proposal: ProposedBridge,\n  evidence: PromotionEvidence,\n): PromotionRequest {\n  const blank = (s: unknown): boolean => typeof s !== 'string' || s.trim() === '';\n  if (blank(evidence.citation)) throw new MissingEvidenceError('citation required');\n  if (blank(evidence.reviewRef)) throw new MissingEvidenceError('reviewRef required');\n  if (!evidence.status) throw new MissingEvidenceError('status required (not defaulted)');\n  return { proposal, evidence };\n}\n\n// ── PROPOSED_BRIDGES review surface (catalog field-shape, own registry) ──────\n\n/**\n * A derived proposal in the catalog's field SHAPE, for review — but in its OWN\n * registry and carrying `status: 'unadjudicated'` (NOT a `BridgeEquationStatus`).\n * This is deliberately NOT a `BridgeEquationEntry`: it omits the spec-only fields\n * (`source_part`/`source_section`/numeric `id`) and never enters `BRIDGE_EQUATIONS`,\n * which stays the faithful encoding of the specification.\n *\n * @internal\n */\ninterface ProposedBridgeEntry {\n  readonly id: string;\n  readonly name: string;\n  readonly category: 'Z';\n  readonly category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)';\n  /** The two regimes bridged — the source equations' domains. */\n  readonly bridges: readonly [string, string];\n  /** ALWAYS 'unadjudicated' — not a catalog status. */\n  readonly status: 'unadjudicated';\n  readonly context: string;\n  readonly formula_latex: string;\n  readonly dimensional_signature: string;\n  /** Honest references: a derivation note + the SOURCE equations' citations,\n   *  never a fabricated citation for the derived relation itself. */\n  readonly references: readonly string[];\n  readonly known_issues: readonly KnownIssue[];\n  readonly derivedFrom: ProposedBridge['derivedFrom'];\n  readonly notes: string;\n}\n\n/** Domain label + citations for a source id — canonical (`CE-…`) or bridge\n *  (`BE-<n>`), so the entry surface works for either source kind. */\nfunction equationMeta(id: string): { domain: string; references: readonly string[] } {\n  const ce = canonicalById(id);\n  if (ce) return { domain: ce.domain, references: ce.references };\n  const n = catalogIdNumber(id);\n  const be = n === undefined ? undefined : BRIDGE_EQUATIONS.find((e) => e.id === n);\n  if (be) return { domain: `${be.bridges[0]}↔${be.bridges[1]} (${be.status})`, references: be.references };\n  return { domain: 'unknown', references: [] };\n}\n\n/** Render a `ProposedBridge` into the catalog field-shape, filled honestly. @internal */\nexport function toProposedEntry(p: ProposedBridge): ProposedBridgeEntry {\n  const [id1, id2] = p.derivedFrom.sourceEquationIds;\n  const M1 = equationMeta(id1);\n  const M2 = equationMeta(id2);\n  const { a, b } = p.derivedFrom.identification;\n  const srcRefs = [\n    [id1, M1] as const,\n    [id2, M2] as const,\n  ].flatMap(([id, m]) => m.references.map((r) => `source ${id}: ${r}`));\n  return {\n    id: p.id,\n    name: `${a} ≡ ${b} ⇒ ${p.derivedFrom.solvedFor} (derived)`,\n    category: 'Z',\n    category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)',\n    bridges: [M1.domain, M2.domain],\n    status: 'unadjudicated',\n    context:\n      `Algebraic consequence of the UNADJUDICATED identification ${a} ≡ ${b} ` +\n      `(${id1}.rhs = ${id2}.rhs), solved for ${p.derivedFrom.solvedFor}. A ` +\n      `dimensional coincidence surfaced by the discovery funnel — no physical ` +\n      `mechanism is asserted, and it is NOT a bridge.`,\n    formula_latex: p.formulaLatex,\n    dimensional_signature: p.dimensionalSignature,\n    references: [\n      'Machine-derived; the combined relation has no independent literature.',\n      ...srcRefs,\n    ],\n    known_issues: [\n      {\n        severity: 'phenomenological-ansatz',\n        description:\n          'Machine-derived dimensional coincidence: the algebraic consequence ' +\n          'of an unadjudicated identification, with no mechanism and no ' +\n          'independent literature. Promotion to BRIDGE_EQUATIONS requires an ' +\n          'adversarial + literature review (Part-VI §XXVII-B) via promoteProposal().',\n        fixable: 'unknown',\n      },\n    ],\n    derivedFrom: p.derivedFrom,\n    notes:\n      p.provenance +\n      (p.alsoDerivableFrom.length\n        ? ` Also derivable from: ${p.alsoDerivableFrom.join('; ')}.`\n        : ''),\n  };\n}\n\n/**\n * The PROPOSED-BRIDGE review surface: derived identity-consequences in the\n * catalog's field shape, in their OWN registry, every entry `status:\n * 'unadjudicated'`. Separate from `BRIDGE_EQUATIONS` (the faithful spec\n * encoding), which this never mutates. Default scope: canonical-only — widen with\n * `deriveProposedBridges(rankDiscoveries(graph)).map(toProposedEntry)`.\n *\n * @internal\n */\nexport const PROPOSED_BRIDGES: readonly ProposedBridgeEntry[] =\n  deriveProposedBridges().map(toProposedEntry);\n"]}

package/dist/composition/rational-exponent.d.ts

@@ -33,8 +33,8 @@ export interface RationalizeOptions {
  * @internal
  */
 export declare function rationalize(x: number, options?: RationalizeOptions): Fraction | undefined;
-/** The double a fraction stands for (numerator over denominator, one rounding). @internal */
+/** The double a fraction stands for, MathTS `Fraction#toNumber`. @internal */
 export declare function fractionToNumber(f: Fraction): number;
-/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */
+/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator; MathTS `Fraction#toString`. @internal */
 export declare function formatRational(f: Fraction): string;
 //# sourceMappingURL=rational-exponent.d.ts.map

package/dist/composition/rational-exponent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rational-exponent.d.ts","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,gDAAgD;AAChD,MAAM,WAAW,kBAAkB;IACjC,8EAA8E;IAC9E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,qGAAqG;IACrG,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAQD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,QAAQ,GAAG,SAAS,CAiB7F;AAED,6FAA6F;AAC7F,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAEpD;AAED,8FAA8F;AAC9F,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAElD"}
+{"version":3,"file":"rational-exponent.d.ts","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,gDAAgD;AAChD,MAAM,WAAW,kBAAkB;IACjC,8EAA8E;IAC9E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,qGAAqG;IACrG,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAQD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,QAAQ,GAAG,SAAS,CAiB7F;AAED,8EAA8E;AAC9E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAEpD;AAED,0HAA0H;AAC1H,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAElD"}

package/dist/composition/rational-exponent.js

@@ -54,12 +54,12 @@ export function rationalize(x, options = {}) {
     }
     return undefined;
 }
-/** The double a fraction stands for (numerator over denominator, one rounding). @internal */
+/** The double a fraction stands for, MathTS `Fraction#toNumber`. @internal */
 export function fractionToNumber(f) {
-    return Number(f.numerator) / Number(f.denominator);
+    return f.toNumber();
 }
-/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */
+/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator; MathTS `Fraction#toString`. @internal */
 export function formatRational(f) {
-    return f.denominator === 1n ? f.numerator.toString() : `${f.numerator}/${f.denominator}`;
+    return f.toString();
 }
 //# sourceMappingURL=rational-exponent.js.map

package/dist/composition/rational-exponent.js.map

@@ -1 +1 @@
-{"version":3,"file":"rational-exponent.js","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAU3C,SAAS,MAAM,CAAC,SAAmB,EAAE,CAAS,EAAE,SAAiB;IAC/D,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,OAAO,GAAuB,EAAE;IACrE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;IACzE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;IAC7D,IAAI,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,2EAA2E;QAC3E,8EAA8E;QAC9E,kEAAkE;QAClE,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3F,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IACxD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,gBAAgB,CAAC,CAAW;IAC1C,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;AACrD,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,cAAc,CAAC,CAAW;IACxC,OAAO,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3F,CAAC","sourcesContent":["/**\n * Exact rationals from doubles, for exponents and prefactors.\n *\n * A monomial exponent read from an AST literal (`0.5`, `0.3333333333333333`)\n * and a prefactor recovered by a fit are doubles that stand for small\n * rationals. This module turns one into a core `Fraction` when a rational\n * with a bounded denominator reproduces it to a stated relative tolerance,\n * and refuses otherwise, so an irrational is never approximated into a\n * rational and a rounding error never becomes a denominator of 10¹⁶.\n *\n * `Fraction.fromNumber(x, cap)` is asked first. Before `@danielsimonjr/mathts-core`\n * 0.18.1 it could return a denominator above its cap; the cap and the tolerance\n * are still checked here, which costs nothing and catches a regression. When that answer is refused, a bounded-denominator scan (the one\n * `dimensional/buckingham.ts` uses for dimension exponents) is the second\n * method, so a rational the continued fraction stepped past is still found.\n *\n * @module composition/rational-exponent\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\n\n/** The denominator cap the Buckingham enumerator uses for exponents. @internal */\nexport const DEFAULT_MAX_DENOMINATOR = 720;\n\n/** Options of {@link rationalize}. @internal */\nexport interface RationalizeOptions {\n  /** Largest denominator accepted (default {@link DEFAULT_MAX_DENOMINATOR}). */\n  readonly maxDenominator?: number;\n  /** Relative tolerance `|n/d − x| ≤ tolerance·|x|` (default 1e-9); for `x = 0` the match is exact. */\n  readonly tolerance?: number;\n}\n\nfunction within(candidate: Fraction, x: number, tolerance: number): boolean {\n  const value = fractionToNumber(candidate);\n  if (x === 0) return value === 0;\n  return Math.abs(value - x) <= tolerance * Math.abs(x);\n}\n\n/**\n * The rational with denominator ≤ `maxDenominator` that reproduces `x` to\n * the tolerance, or `undefined` when there is none.\n *\n * @internal\n */\nexport function rationalize(x: number, options: RationalizeOptions = {}): Fraction | undefined {\n  if (!Number.isFinite(x)) return undefined;\n  const maxDenominator = options.maxDenominator ?? DEFAULT_MAX_DENOMINATOR;\n  const tolerance = options.tolerance ?? 1e-9;\n  if (Number.isInteger(x)) return new Fraction(x, 1);\n  const guess = Fraction.fromNumber(x, BigInt(maxDenominator));\n  if (guess.denominator <= BigInt(maxDenominator) && within(guess, x, tolerance)) return guess;\n  for (let d = 1; d <= maxDenominator; d++) {\n    const n = Math.round(x * d);\n    // A safe-integer n/d is the same correctly rounded quotient as the reduced\n    // fraction's, so a miss is decided on doubles and no Fraction is built for it\n    // (the clean-prefactor rule asks this 43,200 times for one miss).\n    if (Number.isSafeInteger(n) && !(Math.abs(n / d - x) <= tolerance * Math.abs(x))) continue;\n    const candidate = new Fraction(n, d);\n    if (within(candidate, x, tolerance)) return candidate;\n  }\n  return undefined;\n}\n\n/** The double a fraction stands for (numerator over denominator, one rounding). @internal */\nexport function fractionToNumber(f: Fraction): number {\n  return Number(f.numerator) / Number(f.denominator);\n}\n\n/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */\nexport function formatRational(f: Fraction): string {\n  return f.denominator === 1n ? f.numerator.toString() : `${f.numerator}/${f.denominator}`;\n}\n"]}
+{"version":3,"file":"rational-exponent.js","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAU3C,SAAS,MAAM,CAAC,SAAmB,EAAE,CAAS,EAAE,SAAiB;IAC/D,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,OAAO,GAAuB,EAAE;IACrE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;IACzE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;IAC7D,IAAI,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,2EAA2E;QAC3E,8EAA8E;QAC9E,kEAAkE;QAClE,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3F,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IACxD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,gBAAgB,CAAC,CAAW;IAC1C,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED,0HAA0H;AAC1H,MAAM,UAAU,cAAc,CAAC,CAAW;IACxC,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC;AACtB,CAAC","sourcesContent":["/**\n * Exact rationals from doubles, for exponents and prefactors.\n *\n * A monomial exponent read from an AST literal (`0.5`, `0.3333333333333333`)\n * and a prefactor recovered by a fit are doubles that stand for small\n * rationals. This module turns one into a core `Fraction` when a rational\n * with a bounded denominator reproduces it to a stated relative tolerance,\n * and refuses otherwise, so an irrational is never approximated into a\n * rational and a rounding error never becomes a denominator of 10¹⁶.\n *\n * `Fraction.fromNumber(x, cap)` is asked first. Before `@danielsimonjr/mathts-core`\n * 0.18.1 it could return a denominator above its cap; the cap and the tolerance\n * are still checked here, which costs nothing and catches a regression. When that answer is refused, a bounded-denominator scan (the one\n * `dimensional/buckingham.ts` uses for dimension exponents) is the second\n * method, so a rational the continued fraction stepped past is still found.\n *\n * @module composition/rational-exponent\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\n\n/** The denominator cap the Buckingham enumerator uses for exponents. @internal */\nexport const DEFAULT_MAX_DENOMINATOR = 720;\n\n/** Options of {@link rationalize}. @internal */\nexport interface RationalizeOptions {\n  /** Largest denominator accepted (default {@link DEFAULT_MAX_DENOMINATOR}). */\n  readonly maxDenominator?: number;\n  /** Relative tolerance `|n/d − x| ≤ tolerance·|x|` (default 1e-9); for `x = 0` the match is exact. */\n  readonly tolerance?: number;\n}\n\nfunction within(candidate: Fraction, x: number, tolerance: number): boolean {\n  const value = fractionToNumber(candidate);\n  if (x === 0) return value === 0;\n  return Math.abs(value - x) <= tolerance * Math.abs(x);\n}\n\n/**\n * The rational with denominator ≤ `maxDenominator` that reproduces `x` to\n * the tolerance, or `undefined` when there is none.\n *\n * @internal\n */\nexport function rationalize(x: number, options: RationalizeOptions = {}): Fraction | undefined {\n  if (!Number.isFinite(x)) return undefined;\n  const maxDenominator = options.maxDenominator ?? DEFAULT_MAX_DENOMINATOR;\n  const tolerance = options.tolerance ?? 1e-9;\n  if (Number.isInteger(x)) return new Fraction(x, 1);\n  const guess = Fraction.fromNumber(x, BigInt(maxDenominator));\n  if (guess.denominator <= BigInt(maxDenominator) && within(guess, x, tolerance)) return guess;\n  for (let d = 1; d <= maxDenominator; d++) {\n    const n = Math.round(x * d);\n    // A safe-integer n/d is the same correctly rounded quotient as the reduced\n    // fraction's, so a miss is decided on doubles and no Fraction is built for it\n    // (the clean-prefactor rule asks this 43,200 times for one miss).\n    if (Number.isSafeInteger(n) && !(Math.abs(n / d - x) <= tolerance * Math.abs(x))) continue;\n    const candidate = new Fraction(n, d);\n    if (within(candidate, x, tolerance)) return candidate;\n  }\n  return undefined;\n}\n\n/** The double a fraction stands for, MathTS `Fraction#toNumber`. @internal */\nexport function fractionToNumber(f: Fraction): number {\n  return f.toNumber();\n}\n\n/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator; MathTS `Fraction#toString`. @internal */\nexport function formatRational(f: Fraction): string {\n  return f.toString();\n}\n"]}

package/dist/composition/representative-values.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"representative-values.d.ts","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,qEAAqE;AACrE,MAAM,WAAW,mBAAmB;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,mBAAmB,GAAG,MAAM,CAS9D;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAC1C,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CA0DpC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,GACX,mBAAmB,GAAG,SAAS,CAEjC"}
+{"version":3,"file":"representative-values.d.ts","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,qEAAqE;AACrE,MAAM,WAAW,mBAAmB;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,mBAAmB,GAAG,MAAM,CAS9D;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAC1C,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAiEpC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,GACX,mBAAmB,GAAG,SAAS,CAEjC"}

package/dist/composition/representative-values.js

@@ -99,6 +99,12 @@ export const REPRESENTATIVE_VALUES = {
         source: 'BE-26 DNA H-bond proton-tunneling distance ~1 Å (Löwdin 1963)',
     },
     'planck-length': { value: 1.616e-35, source: 'ℓ_P = √(ℏG/c³)' },
+    // The Hubble distance is a definite cosmological scale, not a generic length: c over the
+    // hubble-rate row above (a test pins the two rows together, so one cannot move alone).
+    'hubble-distance': {
+        value: 1.363e26,
+        source: 'D_H = c/H0 = 2.998e8 m/s / 2.2e-18 s^-1 ≈ 1.363e26 m, with H0 ≈ 67 km/s/Mpc (Planck 2018), the hubble-rate row',
+    },
     // Canonical-graph atomic length scales — sourced so the gate compares real
     // magnitudes instead of falling back to the {mass: M_sun} anchor, which makes
     // a 1/mass quantity like the Compton wavelength absurdly small (~10⁻⁷³ m) and

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;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"]}
+{"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,yFAAyF;IACzF,uFAAuF;IACvF,iBAAiB,EAAE;QACjB,KAAK,EAAE,QAAQ;QACf,MAAM,EACJ,gHAAgH;KACnH;IACD,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  // The Hubble distance is a definite cosmological scale, not a generic length: c over the\n  // hubble-rate row above (a test pins the two rows together, so one cannot move alone).\n  'hubble-distance': {\n    value: 1.363e26,\n    source:\n      'D_H = c/H0 = 2.998e8 m/s / 2.2e-18 s^-1 ≈ 1.363e26 m, with H0 ≈ 67 km/s/Mpc (Planck 2018), the hubble-rate row',\n  },\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

@@ -30,6 +30,15 @@
  */
 import type { BridgeEdge } from './edge.js';
 import type { QuantityIdentification } from './compose.js';
+/**
+ * Source values, plus a dimensionless group the edge multiplies when the
+ * ground truth names it. The group is not a source: Buckingham cannot see
+ * it, and a missing group is the unset coefficient, not a missing input.
+ * Exported for the own-equation magnitudes (`own-equation-magnitude.ts`),
+ * which evaluate an edge the same way.
+ * @internal
+ */
+export declare function evaluationInputs(edge: BridgeEdge, values: ReadonlyMap<string, number>): Record<string, number>;
 /** Outcome of retrodicting one node. @public */
 export type RetrodictionOutcome = 'consistent' | 'inconsistent' | 'single' | 'unrecoverable';
 /** One derivation's recovered value for a masked node. @public */
@@ -94,6 +103,12 @@ export interface RetrodictionReport {
     /** The headline gate: no inconsistent node was found. */
     readonly allConsistent: boolean;
 }
+/**
+ * True when the error says the edge does not fire here (or at all, for an unset coefficient).
+ * Exported so the own-equation magnitudes read an edge's refusal by this one rule.
+ * @internal
+ */
+export declare function refusesThePoint(err: unknown): boolean;
 /**
  * Monotone forward EVALUATION: propagate values from `groundTruth` through
  * the graph (domain-checked; identifications supply identified names;

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;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"}
+{"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;AAK3D;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAS9G;AAED,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;AAWD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAErD;AAED;;;;;;;;;;;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"}