universal-physics-tensor 10.0.0 → 11.0.0

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

@@ -0,0 +1,17 @@
+/**
+ * The two-sided tail of Student's t, computed directly.
+ *
+ * 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.
+ *
+ * @internal
+ */
+/**
+ * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `I_{ν/(ν+t²)}(ν/2, 1/2)`.
+ * `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;
+//# sourceMappingURL=t-tail.d.ts.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,32 @@
+/**
+ * The two-sided tail of Student's t, computed directly.
+ *
+ * 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.
+ *
+ * @internal
+ */
+import { betainc } from '@danielsimonjr/mathts-functions';
+/**
+ * P(|T_ν| ≥ |t|) for Student's t with ν degrees of freedom: `I_{ν/(ν+t²)}(ν/2, 1/2)`.
+ * `t = 0` is 1, an infinite `t` is 0. @throws RangeError when ν is not positive. @internal
+ */
+export function studentTwoSidedP(t, df) {
+    if (!(df > 0))
+        throw new RangeError('studentTwoSidedP: degrees of freedom must be positive');
+    if (Number.isNaN(t))
+        throw new RangeError('studentTwoSidedP: t is NaN');
+    if (t === 0)
+        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));
+}
+//# sourceMappingURL=t-tail.js.map

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

@@ -0,0 +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"]}

package/dist/composition/probe/types.d.ts

@@ -65,7 +65,10 @@ export interface IdentifiabilityAssessment {
         readonly status: 'identifiable' | 'partially-identifiable' | 'non-identifiable' | 'unknown';
         readonly rank?: number;
         readonly nParameters?: number;
+        /** The rank of the log-design over the exploratory rows: what the rows can identify, not how many there are. */
         readonly nIndependentObservations?: number;
+        /** The raw exploratory row count, under its own name. */
+        readonly nObservations?: number;
         readonly reasons: readonly string[];
     };
 }

package/dist/composition/probe/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAEnE,sDAAsD;AACtD,eAAO,MAAM,cAAc,MAAM,CAAC;AAClC,iDAAiD;AACjD,eAAO,MAAM,oBAAoB,MAAiB,CAAC;AAEnD,iGAAiG;AACjG,MAAM,MAAM,oBAAoB,GAC5B,WAAW,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,mBAAmB,GAC5E,wBAAwB,GAAG,wBAAwB,GAAG,UAAU,GAAG,WAAW,GAC9E,kBAAkB,GAAG,uBAAuB,CAAC;AAEjD,+EAA+E;AAC/E,MAAM,MAAM,YAAY,GACpB,YAAY,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,eAAe,GACzE,oBAAoB,GAAG,2BAA2B,GAAG,yBAAyB,GAC9E,sBAAsB,GAAG,yBAAyB,CAAC;AAEvD,wDAAwD;AACxD,MAAM,MAAM,UAAU,GAClB,UAAU,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,SAAS,GAAG,gBAAgB,CAAC;AAEzF,kEAAkE;AAClE,MAAM,MAAM,eAAe,GACvB,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,GACrE,QAAQ,GAAG,QAAQ,GAAG,gBAAgB,GAAG,UAAU,GAAG,QAAQ,CAAC;AAEnE,kFAAkF;AAClF,MAAM,MAAM,WAAW,GACnB,iBAAiB,GAAG,oBAAoB,GAAG,sBAAsB,GAAG,oBAAoB,CAAC;AAE7F,uFAAuF;AACvF,MAAM,MAAM,gBAAgB,GACxB,iBAAiB,GAAG,iBAAiB,GAAG,kBAAkB,GAAG,YAAY,GACzE,cAAc,GAAG,WAAW,GAAG,uBAAuB,GAAG,kBAAkB,GAC3E,uBAAuB,CAAC;AAE5B,4FAA4F;AAC5F,MAAM,MAAM,eAAe,GACvB,qBAAqB,GAAG,eAAe,GAAG,mBAAmB,GAAG,mBAAmB,GACnF,qBAAqB,GAAG,kBAAkB,GAAG,yBAAyB,GACtE,oBAAoB,GAAG,kBAAkB,GAAG,OAAO,CAAC;AAExD,2FAA2F;AAC3F,MAAM,MAAM,mBAAmB,GAAG,kBAAkB,GAAG,YAAY,CAAC;AAEpE,yEAAyE;AACzE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACzC,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;CACxC;AAED,kDAAkD;AAClD,eAAO,MAAM,qBAAqB,EAAE,YASnC,CAAC;AAEF,wFAAwF;AACxF,eAAO,MAAM,mBAAmB,OAAO,CAAC;AAExC,qEAAqE;AACrE,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED,iEAAiE;AACjE,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED,sFAAsF;AACtF,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;IACnC,oEAAoE;IACpE,QAAQ,CAAC,KAAK,CAAC,EAAE,qBAAqB,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,UAAU,CAAC,EAAE;QACpB,QAAQ,CAAC,MAAM,EAAE,cAAc,GAAG,wBAAwB,GAAG,kBAAkB,GAAG,SAAS,CAAC;QAC5F,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,wBAAwB,CAAC,EAAE,MAAM,CAAC;QAC3C,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;KACrC,CAAC;CACH;AAED,+DAA+D;AAC/D,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,6DAA6D;AAC7D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED,kGAAkG;AAClG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACxD,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,QAAQ,CAAC,eAAe,EAAE,yBAAyB,CAAC;IACpD,QAAQ,CAAC,aAAa,EAAE,uBAAuB,CAAC;IAChD,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB,GAAG,UAAU,GAAG,SAAS,CAAC;CAC3F;AAED,yDAAyD;AACzD,MAAM,MAAM,oBAAoB,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC/D;IAAE,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACzF;IAAE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjE,yFAAyF;AACzF,MAAM,MAAM,kBAAkB,GAC1B;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAA;CAAE,GAC/D;IACE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,qBAAqB,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,qBAAqB,CAAC;CAC7C,CAAC;AAEN,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,MAAM,CAAC;IAC7C,QAAQ,CAAC,EAAE,EAAE,oBAAoB,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,gFAAgF;AAChF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACtC;AAED,kEAAkE;AAClE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED,wFAAwF;AACxF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,aAAa,EAAE,SAAS,WAAW,EAAE,CAAC;IAC/C,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,CAAC;IAC3C,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,kFAAkF;AAClF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,CAAC;IAC3C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,cAAc,CAAC,EAAE;QACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;KAClD,CAAC;IACF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,4EAA4E;AAC5E,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;CAC7D;AAED,6DAA6D;AAC7D,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,gEAAgE;AAChE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,iEAAiE;AACjE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,kBAAkB,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACnE,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,QAAQ,CAAC,WAAW,EAAE,sBAAsB,CAAC;IAC7C,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC;IACvC,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;CAC1D;AAED,mEAAmE;AACnE,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;CACzB;AAED,gEAAgE;AAChE,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAE9D,uFAAuF;AACvF,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,SAAS,cAAc,EAAE,CAAC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,sDAAsD;AACtD,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,EAAE,WAAW,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,sBAAsB,CAAC;IACxC,QAAQ,CAAC,SAAS,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACtD,QAAQ,CAAC,WAAW,CAAC,EAAE,YAAY,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC;IAChC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAClC,yEAAyE;IACzE,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC3C,4DAA4D;IAC5D,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,qBAAqB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpD;AAED,gEAAgE;AAChE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,gDAAgD;AAChD,MAAM,MAAM,oBAAoB,GAC5B,aAAa,GACb,YAAY,GACZ,QAAQ,CAAC;AAEb,sDAAsD;AACtD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,OAAO,EAAE,oBAAoB,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,cAAc,CAAC;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,0FAA0F;AAC1F,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,GAAG,EAAE,qBAAqB,CAAC;IACpC,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC;IACpC,QAAQ,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,qEAAqE;AACrE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,mFAAmF;AACnF,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,GAAG,aAAa,GAAG,SAAS,GAAG,gBAAgB,CAAC;IACrF,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,8DAA8D;AAC9D,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,WAAW,EAAE,kBAAkB,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,kBAAkB,CAAC;IACvC,QAAQ,CAAC,WAAW,EAAE,kBAAkB,CAAC;IACzC,QAAQ,CAAC,cAAc,EAAE,kBAAkB,CAAC;IAC5C,QAAQ,CAAC,iBAAiB,EAAE,kBAAkB,CAAC;CAChD"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAEnE,sDAAsD;AACtD,eAAO,MAAM,cAAc,MAAM,CAAC;AAClC,iDAAiD;AACjD,eAAO,MAAM,oBAAoB,MAAiB,CAAC;AAEnD,iGAAiG;AACjG,MAAM,MAAM,oBAAoB,GAC5B,WAAW,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,mBAAmB,GAC5E,wBAAwB,GAAG,wBAAwB,GAAG,UAAU,GAAG,WAAW,GAC9E,kBAAkB,GAAG,uBAAuB,CAAC;AAEjD,+EAA+E;AAC/E,MAAM,MAAM,YAAY,GACpB,YAAY,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,eAAe,GACzE,oBAAoB,GAAG,2BAA2B,GAAG,yBAAyB,GAC9E,sBAAsB,GAAG,yBAAyB,CAAC;AAEvD,wDAAwD;AACxD,MAAM,MAAM,UAAU,GAClB,UAAU,GAAG,oBAAoB,GAAG,iBAAiB,GAAG,SAAS,GAAG,gBAAgB,CAAC;AAEzF,kEAAkE;AAClE,MAAM,MAAM,eAAe,GACvB,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,GACrE,QAAQ,GAAG,QAAQ,GAAG,gBAAgB,GAAG,UAAU,GAAG,QAAQ,CAAC;AAEnE,kFAAkF;AAClF,MAAM,MAAM,WAAW,GACnB,iBAAiB,GAAG,oBAAoB,GAAG,sBAAsB,GAAG,oBAAoB,CAAC;AAE7F,uFAAuF;AACvF,MAAM,MAAM,gBAAgB,GACxB,iBAAiB,GAAG,iBAAiB,GAAG,kBAAkB,GAAG,YAAY,GACzE,cAAc,GAAG,WAAW,GAAG,uBAAuB,GAAG,kBAAkB,GAC3E,uBAAuB,CAAC;AAE5B,4FAA4F;AAC5F,MAAM,MAAM,eAAe,GACvB,qBAAqB,GAAG,eAAe,GAAG,mBAAmB,GAAG,mBAAmB,GACnF,qBAAqB,GAAG,kBAAkB,GAAG,yBAAyB,GACtE,oBAAoB,GAAG,kBAAkB,GAAG,OAAO,CAAC;AAExD,2FAA2F;AAC3F,MAAM,MAAM,mBAAmB,GAAG,kBAAkB,GAAG,YAAY,CAAC;AAEpE,yEAAyE;AACzE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACzC,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;CACxC;AAED,kDAAkD;AAClD,eAAO,MAAM,qBAAqB,EAAE,YASnC,CAAC;AAEF,wFAAwF;AACxF,eAAO,MAAM,mBAAmB,OAAO,CAAC;AAExC,qEAAqE;AACrE,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED,iEAAiE;AACjE,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED,sFAAsF;AACtF,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;IACnC,oEAAoE;IACpE,QAAQ,CAAC,KAAK,CAAC,EAAE,qBAAqB,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,UAAU,CAAC,EAAE;QACpB,QAAQ,CAAC,MAAM,EAAE,cAAc,GAAG,wBAAwB,GAAG,kBAAkB,GAAG,SAAS,CAAC;QAC5F,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAC9B,gHAAgH;QAChH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,MAAM,CAAC;QAC3C,yDAAyD;QACzD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;QAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;KACrC,CAAC;CACH;AAED,+DAA+D;AAC/D,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,6DAA6D;AAC7D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED,kGAAkG;AAClG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACxD,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,QAAQ,CAAC,eAAe,EAAE,yBAAyB,CAAC;IACpD,QAAQ,CAAC,aAAa,EAAE,uBAAuB,CAAC;IAChD,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB,GAAG,UAAU,GAAG,SAAS,CAAC;CAC3F;AAED,yDAAyD;AACzD,MAAM,MAAM,oBAAoB,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC/D;IAAE,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACzF;IAAE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjE,yFAAyF;AACzF,MAAM,MAAM,kBAAkB,GAC1B;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAA;CAAE,GAC/D;IACE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,qBAAqB,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,qBAAqB,CAAC;CAC7C,CAAC;AAEN,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,MAAM,CAAC;IAC7C,QAAQ,CAAC,EAAE,EAAE,oBAAoB,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,gFAAgF;AAChF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACtC;AAED,kEAAkE;AAClE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED,wFAAwF;AACxF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,aAAa,EAAE,SAAS,WAAW,EAAE,CAAC;IAC/C,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,CAAC;IAC3C,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,kFAAkF;AAClF,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,CAAC;IAC3C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,cAAc,CAAC,EAAE;QACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;KAClD,CAAC;IACF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,4EAA4E;AAC5E,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;CAC7D;AAED,6DAA6D;AAC7D,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,gEAAgE;AAChE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,iEAAiE;AACjE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,kBAAkB,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACnE,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,QAAQ,CAAC,WAAW,EAAE,sBAAsB,CAAC;IAC7C,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC;IACvC,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;CAC1D;AAED,mEAAmE;AACnE,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;CACzB;AAED,gEAAgE;AAChE,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAE9D,uFAAuF;AACvF,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,SAAS,cAAc,EAAE,CAAC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,sDAAsD;AACtD,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,EAAE,WAAW,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,sBAAsB,CAAC;IACxC,QAAQ,CAAC,SAAS,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACtD,QAAQ,CAAC,WAAW,CAAC,EAAE,YAAY,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC;IAChC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAClC,yEAAyE;IACzE,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC3C,4DAA4D;IAC5D,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,qBAAqB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpD;AAED,gEAAgE;AAChE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,gDAAgD;AAChD,MAAM,MAAM,oBAAoB,GAC5B,aAAa,GACb,YAAY,GACZ,QAAQ,CAAC;AAEb,sDAAsD;AACtD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,OAAO,EAAE,oBAAoB,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,cAAc,CAAC;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,0FAA0F;AAC1F,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,GAAG,EAAE,qBAAqB,CAAC;IACpC,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC;IACpC,QAAQ,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,qEAAqE;AACrE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,mFAAmF;AACnF,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,GAAG,aAAa,GAAG,SAAS,GAAG,gBAAgB,CAAC;IACrF,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,8DAA8D;AAC9D,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,WAAW,EAAE,kBAAkB,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,kBAAkB,CAAC;IACvC,QAAQ,CAAC,WAAW,EAAE,kBAAkB,CAAC;IACzC,QAAQ,CAAC,cAAc,EAAE,kBAAkB,CAAC;IAC5C,QAAQ,CAAC,iBAAiB,EAAE,kBAAkB,CAAC;CAChD"}

package/dist/composition/probe/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/composition/probe/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH,sDAAsD;AACtD,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC;AAClC,iDAAiD;AACjD,MAAM,CAAC,MAAM,oBAAoB,GAAG,cAAc,CAAC;AAsDnD,kDAAkD;AAClD,MAAM,CAAC,MAAM,qBAAqB,GAAiB;IACjD,aAAa,EAAE,IAAI;IACnB,WAAW,EAAE,CAAC;IACd,YAAY,EAAE,EAAE;IAChB,kBAAkB,EAAE,CAAC;IACrB,cAAc,EAAE,KAAK;IACrB,cAAc,EAAE,IAAI;IACpB,sBAAsB,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI;IACzC,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF,wFAAwF;AACxF,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC","sourcesContent":["/**\n * Product B (expression / residual search) experimental types.\n * Orthogonal to Product A quantity identification (`discovery.ts`).\n * Not re-exported from `src/index.ts`.\n *\n * @module composition/probe/types\n */\n\nimport type { Dimension } from '../../dimensional/types.js';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type { IdentifiabilityResult } from '../identifiability.js';\n\n/** Experimental probe JSON schema major. @internal */\nexport const SCHEMA_VERSION = '0';\n/** Alias of {@link SCHEMA_VERSION}. @internal */\nexport const PROBE_SCHEMA_VERSION = SCHEMA_VERSION;\n\n/** Conservative Product B candidate lifecycle. Orthogonal to `AdjudicationVerdict`. @internal */\nexport type ProbeCandidateStatus =\n  | 'generated' | 'structurally-valid' | 'empirically-fit' | 'heldout-supported'\n  | 'falsification-survivor' | 'expert-review-required' | 'rejected' | 'falsified'\n  | 'equivalent-known' | 'insufficient-evidence';\n\n/** Kind of a named scientific relation this overlay may point at. @internal */\nexport type RelationKind =\n  | 'definition' | 'canonical-equation' | 'bridge-equation' | 'approximation'\n  | 'effective-relation' | 'phenomenological-relation' | 'computational-predicate'\n  | 'candidate-hypothesis' | 'quantity-identification';\n\n/** Audit completeness of a metadata claim. @internal */\nexport type AuditState =\n  | 'verified' | 'partially-verified' | 'not-yet-audited' | 'unknown' | 'not-applicable';\n\n/** Mathematical meaning of a residual / discrepancy. @internal */\nexport type DiscrepancyKind =\n  | 'additive' | 'relative' | 'log-ratio' | 'standardized' | 'likelihood'\n  | 'vector' | 'tensor' | 'distributional' | 'operator' | 'custom';\n\n/** How a dataset may be used. Holdout must not influence generation. @internal */\nexport type DatasetRole =\n  | 'exploratory-fit' | 'validation-holdout' | 'external-replication' | 'falsification-only';\n\n/** Why a bounded search terminated. `no-credible-candidate` is a success. @internal */\nexport type SearchStopReason =\n  | 'exhausted-space' | 'candidate-limit' | 'evaluation-limit' | 'time-limit'\n  | 'memory-limit' | 'cancelled' | 'sufficient-candidates' | 'non-identifiable'\n  | 'no-credible-candidate';\n\n/** Typed frontier gap. `relation-link` wraps Product A; residual is Product B. @internal */\nexport type FrontierGapKind =\n  | 'prediction-residual' | 'relation-link' | 'regime-transition' | 'parameter-tension'\n  | 'assumption-conflict' | 'missing-operator' | 'unexplained-observation'\n  | 'model-disagreement' | 'causal-mechanism' | 'other';\n\n/** Graph-structural vs parametric (Jacobian / design-matrix) identifiability. @internal */\nexport type IdentifiabilityKind = 'graph-structural' | 'parametric';\n\n/** Hard caps on a Product B search. No search is unbounded. @internal */\nexport interface SearchBudget {\n  readonly maxCandidates: number;\n  readonly maxAstDepth: number;\n  readonly maxOperators: number;\n  readonly maxDerivativeOrder: number;\n  readonly maxEvaluations: number;\n  readonly maxWallClockMs: number;\n  readonly maxResidentMemoryBytes?: number;\n  readonly maxExternalProcesses?: number;\n}\n\n/** Default native-enumerator budget. @internal */\nexport const DEFAULT_SEARCH_BUDGET: SearchBudget = {\n  maxCandidates: 1000,\n  maxAstDepth: 6,\n  maxOperators: 12,\n  maxDerivativeOrder: 2,\n  maxEvaluations: 10000,\n  maxWallClockMs: 5000,\n  maxResidentMemoryBytes: 256 * 1024 * 1024,\n  maxExternalProcesses: 1,\n};\n\n/** Relative holdout RMSE cap a candidate must meet when a run states none. @internal */\nexport const DEFAULT_HOLDOUT_TOL = 0.15;\n\n/** Explicit residual semantics for a run or correction. @internal */\nexport interface DiscrepancyDefinition {\n  readonly kind: DiscrepancyKind;\n  readonly observableIds: readonly string[];\n  readonly covarianceRef?: string;\n  readonly implementationRef?: string;\n}\n\n/** Pointer at an existing relation; not a registry. @internal */\nexport interface ScientificRelationRef {\n  readonly kind: RelationKind;\n  readonly id: string;\n}\n\n/** Identifiability of a gap — two different questions; do not translate. @internal */\nexport interface IdentifiabilityAssessment {\n  readonly kind: IdentifiabilityKind;\n  /** Product A / relation-link: reuse `classifyIdentifiability()`. */\n  readonly graph?: IdentifiabilityResult;\n  /** Product B: Jacobian / design-matrix rank vs locked observations. */\n  readonly parametric?: {\n    readonly status: 'identifiable' | 'partially-identifiable' | 'non-identifiable' | 'unknown';\n    readonly rank?: number;\n    readonly nParameters?: number;\n    readonly nIndependentObservations?: number;\n    readonly reasons: readonly string[];\n  };\n}\n\n/** Whether an expensive search is even warranted. @internal */\nexport interface SearchabilityAssessment {\n  readonly searchable: boolean;\n  readonly reasons: readonly string[];\n}\n\n/** Human-readable gap evidence with source ids. @internal */\nexport interface GapEvidence {\n  readonly summary: string;\n  readonly sourceIds: readonly string[];\n}\n\n/** Typed scientific gap (`fg-*`). Most `relation-link` / regime gaps wrap Product A. @internal */\nexport interface FrontierGap {\n  readonly id: string;\n  readonly kind: FrontierGapKind;\n  readonly participants: readonly ScientificRelationRef[];\n  readonly observations: readonly string[];\n  readonly regimes: readonly string[];\n  readonly assumptions: readonly string[];\n  readonly constraints: readonly string[];\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly evidence: GapEvidence;\n  readonly identifiability: IdentifiabilityAssessment;\n  readonly searchability: SearchabilityAssessment;\n  readonly status: 'identified' | 'searchable' | 'underdetermined' | 'resolved' | 'retired';\n}\n\n/** How a probe candidate entered the store. @internal */\nexport type ProbeCandidateOrigin =\n  | { readonly kind: 'grammar-enumerator'; readonly runId: string }\n  | { readonly kind: 'external-backend'; readonly backendId: string; readonly runId: string }\n  | { readonly kind: 'human-authored'; readonly source: string };\n\n/** Discriminated candidate payload. Identifications stay `VettedCandidate`. @internal */\nexport type ProbeCandidateBody =\n  | { readonly kind: 'scalar-expr'; readonly expression: ExprNode }\n  | {\n      readonly kind: 'correction';\n      readonly baselineRef: ScientificRelationRef;\n      readonly correction: ExprNode;\n      readonly discrepancy: DiscrepancyDefinition;\n    };\n\n/** Append-only status transition. Reloading uses last `to`. @internal */\nexport interface StatusEvent {\n  readonly at: string;\n  readonly from: ProbeCandidateStatus | 'none';\n  readonly to: ProbeCandidateStatus;\n  readonly reason: string;\n  readonly runId: string;\n}\n\n/** Cheap-to-strong fingerprint layers for equivalence / rejection. @internal */\nexport interface CandidateFingerprint {\n  readonly syntaxHash: string;\n  readonly canonicalAstHash: string;\n  readonly dimensionalSignature: string;\n  readonly regimeSignature: string;\n  readonly assumptionSignature: string;\n}\n\n/** Parsimony / complexity of a candidate expression. @internal */\nexport interface ComplexityMetrics {\n  readonly astNodes: number;\n  readonly operators: number;\n  readonly freeParameters: number;\n  readonly derivativeOrder: number;\n  readonly tensorRank?: number;\n  readonly descriptionLength?: number;\n}\n\n/** Persisted Product B candidate (`h-*`). Status is the last history `to`. @internal */\nexport interface ProbeCandidateRecord {\n  readonly id: string;\n  readonly gapId: string;\n  readonly body: ProbeCandidateBody;\n  readonly origin: ProbeCandidateOrigin;\n  readonly assumptions: readonly string[];\n  readonly status: ProbeCandidateStatus;\n  readonly statusHistory: readonly StatusEvent[];\n  readonly evaluations: readonly string[];\n  readonly fingerprint: CandidateFingerprint;\n  readonly complexity: ComplexityMetrics;\n  readonly schemaVersion: string;\n}\n\n/** Negative-result memory keyed by fingerprint + evaluation context. @internal */\nexport interface ProbeRejectionRecord {\n  readonly fingerprint: CandidateFingerprint;\n  readonly reason: string;\n  readonly counterexample?: {\n    readonly predicted: number;\n    readonly expected: number;\n    readonly tolerance: number;\n    readonly point: Readonly<Record<string, number>>;\n  };\n  readonly context: string;\n  readonly timestamp: string;\n}\n\n/** Untrusted worker identity. Capabilities are opaque strings. @internal */\nexport interface DiscoveryBackendDescriptor {\n  readonly protocolVersion: string;\n  readonly backendId: string;\n  readonly backendVersion: string;\n  readonly capabilities: readonly string[];\n  readonly deterministic: 'yes' | 'seeded' | 'no' | 'unknown';\n}\n\n/** Host environment captured in a run manifest. @internal */\nexport interface EnvironmentFingerprint {\n  readonly node: string;\n  readonly platform: string;\n  readonly arch: string;\n}\n\n/** Declared source of non-bitwise reproducibility. @internal */\nexport interface NondeterminismSource {\n  readonly kind: string;\n  readonly detail: string;\n}\n\n/** Reproducible Product B search artifact (`dr-*`). @internal */\nexport interface DiscoveryRunManifest {\n  readonly schemaVersion: string;\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problemHash: string;\n  readonly datasetHashes: readonly string[];\n  readonly backendDescriptors: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds: Readonly<Record<string, string | number>>;\n  readonly tolerances: Readonly<Record<string, number>>;\n  readonly environment: EnvironmentFingerprint;\n  readonly searchBudget: SearchBudget;\n  readonly startedAt: string;\n  readonly completedAt?: string;\n  readonly stopReason?: SearchStopReason;\n  readonly nondeterminism: readonly NondeterminismSource[];\n}\n\n/** Named SI-dimensioned variable in a search problem. @internal */\nexport interface DimensionalVariableRef {\n  readonly name: string;\n  readonly dim: Dimension;\n}\n\n/** One numeric observation keyed by variable name. @internal */\nexport type ObservationRow = Readonly<Record<string, number>>;\n\n/** In-memory probe dataset. Not a rewrite of `upt confront` observations. @internal */\nexport interface ProbeDataset {\n  readonly id: string;\n  readonly role: DatasetRole;\n  readonly rows: readonly ObservationRow[];\n  readonly observable: string;\n  readonly sigma?: number;\n  readonly schemaVersion: string;\n}\n\n/** Inputs to a bounded Product B search. @internal */\nexport interface SearchProblem {\n  readonly gap: FrontierGap;\n  readonly target: DimensionalVariableRef;\n  readonly governing: readonly DimensionalVariableRef[];\n  readonly exploratory?: ProbeDataset;\n  readonly holdout?: ProbeDataset;\n  readonly baseline?: ExprNode;\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly assumptions?: readonly string[];\n  readonly regimeSignature?: string;\n  /** Declared limits; failed limits are fatal only in a claimed domain. */\n  readonly limits?: readonly DeclaredLimit[];\n  /** Regime the candidate claims, used for limit fatality. */\n  readonly claimedRegimes?: Readonly<Record<string, string>>;\n  readonly observationalBoundIds?: readonly string[];\n}\n\n/** Named regime restriction a candidate may claim. @internal */\nexport interface DeclaredLimit {\n  readonly id: string;\n  readonly regime: Readonly<Record<string, string>>;\n  readonly description?: string;\n}\n\n/** One falsification battery name. @internal */\nexport type FalsificationBattery =\n  | 'dimensional'\n  | 'finiteness'\n  | 'limits';\n\n/** Outcome of one falsification battery. @internal */\nexport interface FalsificationRecord {\n  readonly battery: FalsificationBattery;\n  readonly outcome: 'pass' | 'fail' | 'inconclusive';\n  readonly detail: string;\n}\n\n/** Optional overlay metadata — not a registry, not imported by `canonical/`. @internal */\nexport interface ScientificRelationRecord {\n  readonly ref: ScientificRelationRef;\n  readonly evidence?: EvidenceProfile;\n  readonly audit?: AuditState;\n  readonly notes?: string;\n}\n\n/** Pareto scores on [0, 1]; not a single magic ranking. @internal */\nexport interface ScoreVector {\n  readonly validity: number;\n  readonly empirical: number;\n  readonly parsimony: number;\n  readonly corpusDistance: number;\n  readonly robustness: number;\n}\n\n/** One evidence axis. Never a substitute for a quantitative residual. @internal */\nexport interface EvidenceAssessment {\n  readonly state: 'supported' | 'mixed' | 'unsupported' | 'unknown' | 'not-applicable';\n  readonly rationale?: string;\n  readonly sourceIds?: readonly string[];\n}\n\n/** Vector evidence profile for overlay metadata. @internal */\nexport interface EvidenceProfile {\n  readonly theoretical: EvidenceAssessment;\n  readonly empirical: EvidenceAssessment;\n  readonly replication: EvidenceAssessment;\n  readonly regimeCoverage: EvidenceAssessment;\n  readonly provenanceQuality: EvidenceAssessment;\n}\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/composition/probe/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH,sDAAsD;AACtD,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC;AAClC,iDAAiD;AACjD,MAAM,CAAC,MAAM,oBAAoB,GAAG,cAAc,CAAC;AAsDnD,kDAAkD;AAClD,MAAM,CAAC,MAAM,qBAAqB,GAAiB;IACjD,aAAa,EAAE,IAAI;IACnB,WAAW,EAAE,CAAC;IACd,YAAY,EAAE,EAAE;IAChB,kBAAkB,EAAE,CAAC;IACrB,cAAc,EAAE,KAAK;IACrB,cAAc,EAAE,IAAI;IACpB,sBAAsB,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI;IACzC,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF,wFAAwF;AACxF,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC","sourcesContent":["/**\n * Product B (expression / residual search) experimental types.\n * Orthogonal to Product A quantity identification (`discovery.ts`).\n * Not re-exported from `src/index.ts`.\n *\n * @module composition/probe/types\n */\n\nimport type { Dimension } from '../../dimensional/types.js';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type { IdentifiabilityResult } from '../identifiability.js';\n\n/** Experimental probe JSON schema major. @internal */\nexport const SCHEMA_VERSION = '0';\n/** Alias of {@link SCHEMA_VERSION}. @internal */\nexport const PROBE_SCHEMA_VERSION = SCHEMA_VERSION;\n\n/** Conservative Product B candidate lifecycle. Orthogonal to `AdjudicationVerdict`. @internal */\nexport type ProbeCandidateStatus =\n  | 'generated' | 'structurally-valid' | 'empirically-fit' | 'heldout-supported'\n  | 'falsification-survivor' | 'expert-review-required' | 'rejected' | 'falsified'\n  | 'equivalent-known' | 'insufficient-evidence';\n\n/** Kind of a named scientific relation this overlay may point at. @internal */\nexport type RelationKind =\n  | 'definition' | 'canonical-equation' | 'bridge-equation' | 'approximation'\n  | 'effective-relation' | 'phenomenological-relation' | 'computational-predicate'\n  | 'candidate-hypothesis' | 'quantity-identification';\n\n/** Audit completeness of a metadata claim. @internal */\nexport type AuditState =\n  | 'verified' | 'partially-verified' | 'not-yet-audited' | 'unknown' | 'not-applicable';\n\n/** Mathematical meaning of a residual / discrepancy. @internal */\nexport type DiscrepancyKind =\n  | 'additive' | 'relative' | 'log-ratio' | 'standardized' | 'likelihood'\n  | 'vector' | 'tensor' | 'distributional' | 'operator' | 'custom';\n\n/** How a dataset may be used. Holdout must not influence generation. @internal */\nexport type DatasetRole =\n  | 'exploratory-fit' | 'validation-holdout' | 'external-replication' | 'falsification-only';\n\n/** Why a bounded search terminated. `no-credible-candidate` is a success. @internal */\nexport type SearchStopReason =\n  | 'exhausted-space' | 'candidate-limit' | 'evaluation-limit' | 'time-limit'\n  | 'memory-limit' | 'cancelled' | 'sufficient-candidates' | 'non-identifiable'\n  | 'no-credible-candidate';\n\n/** Typed frontier gap. `relation-link` wraps Product A; residual is Product B. @internal */\nexport type FrontierGapKind =\n  | 'prediction-residual' | 'relation-link' | 'regime-transition' | 'parameter-tension'\n  | 'assumption-conflict' | 'missing-operator' | 'unexplained-observation'\n  | 'model-disagreement' | 'causal-mechanism' | 'other';\n\n/** Graph-structural vs parametric (Jacobian / design-matrix) identifiability. @internal */\nexport type IdentifiabilityKind = 'graph-structural' | 'parametric';\n\n/** Hard caps on a Product B search. No search is unbounded. @internal */\nexport interface SearchBudget {\n  readonly maxCandidates: number;\n  readonly maxAstDepth: number;\n  readonly maxOperators: number;\n  readonly maxDerivativeOrder: number;\n  readonly maxEvaluations: number;\n  readonly maxWallClockMs: number;\n  readonly maxResidentMemoryBytes?: number;\n  readonly maxExternalProcesses?: number;\n}\n\n/** Default native-enumerator budget. @internal */\nexport const DEFAULT_SEARCH_BUDGET: SearchBudget = {\n  maxCandidates: 1000,\n  maxAstDepth: 6,\n  maxOperators: 12,\n  maxDerivativeOrder: 2,\n  maxEvaluations: 10000,\n  maxWallClockMs: 5000,\n  maxResidentMemoryBytes: 256 * 1024 * 1024,\n  maxExternalProcesses: 1,\n};\n\n/** Relative holdout RMSE cap a candidate must meet when a run states none. @internal */\nexport const DEFAULT_HOLDOUT_TOL = 0.15;\n\n/** Explicit residual semantics for a run or correction. @internal */\nexport interface DiscrepancyDefinition {\n  readonly kind: DiscrepancyKind;\n  readonly observableIds: readonly string[];\n  readonly covarianceRef?: string;\n  readonly implementationRef?: string;\n}\n\n/** Pointer at an existing relation; not a registry. @internal */\nexport interface ScientificRelationRef {\n  readonly kind: RelationKind;\n  readonly id: string;\n}\n\n/** Identifiability of a gap — two different questions; do not translate. @internal */\nexport interface IdentifiabilityAssessment {\n  readonly kind: IdentifiabilityKind;\n  /** Product A / relation-link: reuse `classifyIdentifiability()`. */\n  readonly graph?: IdentifiabilityResult;\n  /** Product B: Jacobian / design-matrix rank vs locked observations. */\n  readonly parametric?: {\n    readonly status: 'identifiable' | 'partially-identifiable' | 'non-identifiable' | 'unknown';\n    readonly rank?: number;\n    readonly nParameters?: number;\n    /** The rank of the log-design over the exploratory rows: what the rows can identify, not how many there are. */\n    readonly nIndependentObservations?: number;\n    /** The raw exploratory row count, under its own name. */\n    readonly nObservations?: number;\n    readonly reasons: readonly string[];\n  };\n}\n\n/** Whether an expensive search is even warranted. @internal */\nexport interface SearchabilityAssessment {\n  readonly searchable: boolean;\n  readonly reasons: readonly string[];\n}\n\n/** Human-readable gap evidence with source ids. @internal */\nexport interface GapEvidence {\n  readonly summary: string;\n  readonly sourceIds: readonly string[];\n}\n\n/** Typed scientific gap (`fg-*`). Most `relation-link` / regime gaps wrap Product A. @internal */\nexport interface FrontierGap {\n  readonly id: string;\n  readonly kind: FrontierGapKind;\n  readonly participants: readonly ScientificRelationRef[];\n  readonly observations: readonly string[];\n  readonly regimes: readonly string[];\n  readonly assumptions: readonly string[];\n  readonly constraints: readonly string[];\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly evidence: GapEvidence;\n  readonly identifiability: IdentifiabilityAssessment;\n  readonly searchability: SearchabilityAssessment;\n  readonly status: 'identified' | 'searchable' | 'underdetermined' | 'resolved' | 'retired';\n}\n\n/** How a probe candidate entered the store. @internal */\nexport type ProbeCandidateOrigin =\n  | { readonly kind: 'grammar-enumerator'; readonly runId: string }\n  | { readonly kind: 'external-backend'; readonly backendId: string; readonly runId: string }\n  | { readonly kind: 'human-authored'; readonly source: string };\n\n/** Discriminated candidate payload. Identifications stay `VettedCandidate`. @internal */\nexport type ProbeCandidateBody =\n  | { readonly kind: 'scalar-expr'; readonly expression: ExprNode }\n  | {\n      readonly kind: 'correction';\n      readonly baselineRef: ScientificRelationRef;\n      readonly correction: ExprNode;\n      readonly discrepancy: DiscrepancyDefinition;\n    };\n\n/** Append-only status transition. Reloading uses last `to`. @internal */\nexport interface StatusEvent {\n  readonly at: string;\n  readonly from: ProbeCandidateStatus | 'none';\n  readonly to: ProbeCandidateStatus;\n  readonly reason: string;\n  readonly runId: string;\n}\n\n/** Cheap-to-strong fingerprint layers for equivalence / rejection. @internal */\nexport interface CandidateFingerprint {\n  readonly syntaxHash: string;\n  readonly canonicalAstHash: string;\n  readonly dimensionalSignature: string;\n  readonly regimeSignature: string;\n  readonly assumptionSignature: string;\n}\n\n/** Parsimony / complexity of a candidate expression. @internal */\nexport interface ComplexityMetrics {\n  readonly astNodes: number;\n  readonly operators: number;\n  readonly freeParameters: number;\n  readonly derivativeOrder: number;\n  readonly tensorRank?: number;\n  readonly descriptionLength?: number;\n}\n\n/** Persisted Product B candidate (`h-*`). Status is the last history `to`. @internal */\nexport interface ProbeCandidateRecord {\n  readonly id: string;\n  readonly gapId: string;\n  readonly body: ProbeCandidateBody;\n  readonly origin: ProbeCandidateOrigin;\n  readonly assumptions: readonly string[];\n  readonly status: ProbeCandidateStatus;\n  readonly statusHistory: readonly StatusEvent[];\n  readonly evaluations: readonly string[];\n  readonly fingerprint: CandidateFingerprint;\n  readonly complexity: ComplexityMetrics;\n  readonly schemaVersion: string;\n}\n\n/** Negative-result memory keyed by fingerprint + evaluation context. @internal */\nexport interface ProbeRejectionRecord {\n  readonly fingerprint: CandidateFingerprint;\n  readonly reason: string;\n  readonly counterexample?: {\n    readonly predicted: number;\n    readonly expected: number;\n    readonly tolerance: number;\n    readonly point: Readonly<Record<string, number>>;\n  };\n  readonly context: string;\n  readonly timestamp: string;\n}\n\n/** Untrusted worker identity. Capabilities are opaque strings. @internal */\nexport interface DiscoveryBackendDescriptor {\n  readonly protocolVersion: string;\n  readonly backendId: string;\n  readonly backendVersion: string;\n  readonly capabilities: readonly string[];\n  readonly deterministic: 'yes' | 'seeded' | 'no' | 'unknown';\n}\n\n/** Host environment captured in a run manifest. @internal */\nexport interface EnvironmentFingerprint {\n  readonly node: string;\n  readonly platform: string;\n  readonly arch: string;\n}\n\n/** Declared source of non-bitwise reproducibility. @internal */\nexport interface NondeterminismSource {\n  readonly kind: string;\n  readonly detail: string;\n}\n\n/** Reproducible Product B search artifact (`dr-*`). @internal */\nexport interface DiscoveryRunManifest {\n  readonly schemaVersion: string;\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problemHash: string;\n  readonly datasetHashes: readonly string[];\n  readonly backendDescriptors: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds: Readonly<Record<string, string | number>>;\n  readonly tolerances: Readonly<Record<string, number>>;\n  readonly environment: EnvironmentFingerprint;\n  readonly searchBudget: SearchBudget;\n  readonly startedAt: string;\n  readonly completedAt?: string;\n  readonly stopReason?: SearchStopReason;\n  readonly nondeterminism: readonly NondeterminismSource[];\n}\n\n/** Named SI-dimensioned variable in a search problem. @internal */\nexport interface DimensionalVariableRef {\n  readonly name: string;\n  readonly dim: Dimension;\n}\n\n/** One numeric observation keyed by variable name. @internal */\nexport type ObservationRow = Readonly<Record<string, number>>;\n\n/** In-memory probe dataset. Not a rewrite of `upt confront` observations. @internal */\nexport interface ProbeDataset {\n  readonly id: string;\n  readonly role: DatasetRole;\n  readonly rows: readonly ObservationRow[];\n  readonly observable: string;\n  readonly sigma?: number;\n  readonly schemaVersion: string;\n}\n\n/** Inputs to a bounded Product B search. @internal */\nexport interface SearchProblem {\n  readonly gap: FrontierGap;\n  readonly target: DimensionalVariableRef;\n  readonly governing: readonly DimensionalVariableRef[];\n  readonly exploratory?: ProbeDataset;\n  readonly holdout?: ProbeDataset;\n  readonly baseline?: ExprNode;\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly assumptions?: readonly string[];\n  readonly regimeSignature?: string;\n  /** Declared limits; failed limits are fatal only in a claimed domain. */\n  readonly limits?: readonly DeclaredLimit[];\n  /** Regime the candidate claims, used for limit fatality. */\n  readonly claimedRegimes?: Readonly<Record<string, string>>;\n  readonly observationalBoundIds?: readonly string[];\n}\n\n/** Named regime restriction a candidate may claim. @internal */\nexport interface DeclaredLimit {\n  readonly id: string;\n  readonly regime: Readonly<Record<string, string>>;\n  readonly description?: string;\n}\n\n/** One falsification battery name. @internal */\nexport type FalsificationBattery =\n  | 'dimensional'\n  | 'finiteness'\n  | 'limits';\n\n/** Outcome of one falsification battery. @internal */\nexport interface FalsificationRecord {\n  readonly battery: FalsificationBattery;\n  readonly outcome: 'pass' | 'fail' | 'inconclusive';\n  readonly detail: string;\n}\n\n/** Optional overlay metadata — not a registry, not imported by `canonical/`. @internal */\nexport interface ScientificRelationRecord {\n  readonly ref: ScientificRelationRef;\n  readonly evidence?: EvidenceProfile;\n  readonly audit?: AuditState;\n  readonly notes?: string;\n}\n\n/** Pareto scores on [0, 1]; not a single magic ranking. @internal */\nexport interface ScoreVector {\n  readonly validity: number;\n  readonly empirical: number;\n  readonly parsimony: number;\n  readonly corpusDistance: number;\n  readonly robustness: number;\n}\n\n/** One evidence axis. Never a substitute for a quantitative residual. @internal */\nexport interface EvidenceAssessment {\n  readonly state: 'supported' | 'mixed' | 'unsupported' | 'unknown' | 'not-applicable';\n  readonly rationale?: string;\n  readonly sourceIds?: readonly string[];\n}\n\n/** Vector evidence profile for overlay metadata. @internal */\nexport interface EvidenceProfile {\n  readonly theoretical: EvidenceAssessment;\n  readonly empirical: EvidenceAssessment;\n  readonly replication: EvidenceAssessment;\n  readonly regimeCoverage: EvidenceAssessment;\n  readonly provenanceQuality: EvidenceAssessment;\n}\n"]}

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

@@ -30,17 +30,24 @@
  *
  * @module composition/proposed-bridges
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
 import type { ExprNode } from '../dimensional/validator.js';
 import type { Dimension } from '../dimensional/types.js';
 import type { DimensionalVariable } from '../dimensional/buckingham.js';
 import type { BridgeEquationStatus } from '../bridges/index.js';
 import type { KnownIssue } from '../bridges/index.js';
 import type { VettedCandidate } from './discovery.js';
-/** A flat monomial: leaf name → its dimension and (signed, possibly rational)
- *  exponent. `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. */
-type Mono = Map<string, {
+/**
+ * A flat monomial: leaf name → its dimension and signed exact exponent.
+ * `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. The exponent is a core
+ * `Fraction`, so solving for a cubed leaf carries `1/3`, not
+ * `0.3333333333333333`, and a cancellation is an exact zero.
+ *
+ * @internal
+ */
+export type Mono = Map<string, {
     dim: Dimension;
-    exp: number;
+    exp: Fraction;
 }>;
 /** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */
 export declare class NotAMonomialError extends Error {
@@ -55,7 +62,15 @@ export declare class NotAMonomialError extends Error {
  */
 export declare function toMonomial(ast: ExprNode): Mono;
 /** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =
- *  positive exponents, denominator = negative). Zero exponents drop out.
+ *  positive exponents, denominator = negative). Zero exponents drop out. The
+ *  exponent literal is the double built from the fraction (`1/3` is written
+ *  `0.3333333333333333`), so one rational is always one spelling.
+ *
+ *  This is not merged with `monomialToExpr` (composition/probe/generator.ts),
+ *  which writes one product with negative exponents in code-unit name order;
+ *  this one orders names by `localeCompare` and splits a quotient. The
+ *  proposals' printed formulas and the IC dedup key read this tree, so one
+ *  builder would move them. Both build each factor with `symbolPower`.
  *  @internal */
 export declare function fromMonomial(m: Mono): ExprNode;
 /**
@@ -98,6 +113,21 @@ export interface ProposedBridge {
      *  free `governing` leaves (e.g. `{ T: 300 }`). */
     evaluate(values: Readonly<Record<string, number>>): number;
 }
+/** One leaf of a monomial with its exact exponent. @internal */
+export interface MonoLeaf {
+    readonly name: string;
+    readonly dim: Dimension;
+    readonly exp: Fraction;
+}
+/** The LaTeX of a monomial, exponents rendered from their fractions (`y^{1/3}`). @internal */
+export declare function latexFromMono(m: Mono): string;
+/**
+ * Isolate `solveFor` from `m1 = m2`: `solveFor^e = m1 / (m2 without solveFor)`,
+ * every exponent divided by `e`, exactly. `m2` must hold `solveFor`.
+ *
+ * @internal
+ */
+export declare function isolateLeaf(m1: Mono, m2: Mono, solveFor: MonoLeaf): Mono;
 /**
  * An admissible source for the elimination: a target name backed by a flat
  * monomial `scalarAst` whose prefactor is a closed constant. Canonical equations
@@ -144,11 +174,12 @@ export declare function resolveSources(name: string): EquationSource[];
 export declare function deriveProposedBridges(candidates?: readonly VettedCandidate[]): readonly ProposedBridge[];
 /**
  * Collapse proposals that derive the SAME relation — equal `normalForm` (up to
- * dimensionless constants) AND equal target dimension — into the first, recording
- * the others' identifications in `alsoDerivableFrom`. Distinct stubs do NOT
- * collapse (e.g. Landauer's dropped `ln2` vs an operator stub hash differently),
- * so this only merges genuine structural twins that a wider candidate scope can
- * produce (Design §9 #2). Deterministic: input order is preserved.
+ * dimensionless constants) of the exact monomial AND equal target dimension —
+ * into the first, recording the others' identifications in
+ * `alsoDerivableFrom`. Distinct stubs do NOT collapse (e.g. Landauer's dropped
+ * `ln2` vs an operator stub hash differently), so this only merges genuine
+ * structural twins that a wider candidate scope can produce (Design §9 #2).
+ * Deterministic: input order is preserved.
  *
  * @internal
  */

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,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;AAOtD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAMtD;gEACgE;AAChE,KAAK,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAEzD,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;;gBAEgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,QAAQ,CAmB9C;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;AAyED;;;;;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;AAkFD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,SAAS,cAAc,EAAE,GACnC,SAAS,cAAc,EAAE,CAyB3B;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;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"}

package/dist/composition/proposed-bridges.js

@@ -30,19 +30,26 @@
  *
  * @module composition/proposed-bridges
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
 import { validate } from '../dimensional/validator.js';
-import { sym } from '../dimensional/ast-builders.js';
+import { sym, symbolPower } from '../dimensional/ast-builders.js';
 import { DIMENSIONLESS } from '../dimensional/types.js';
 import { equals, format } from '../dimensional/algebra.js';
 import { canonicalByTarget, canonicalById } from '../canonical/registry.js';
 import { BRIDGE_EQUATIONS } from '../bridges/index.js';
 import { catalogIdNumber } from '../bridges/catalog-load.js';
 import { normalForm } from '../canonical/normal-form.js';
-import { CONSTANTS } from '../dimensional/symbolic-constants.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 { CANONICAL_GRAPH } from './canonical-graph.js';
 import { CATALOG_GRAPH } from './catalog-graph.js';
+import { rationalExponentOf } from './formula-shape.js';
+import { equalUpToConstant } from './algebraic-equivalence.js';
+import { formatRational, fractionToNumber } from './rational-exponent.js';
+const ONE = new Fraction(1);
+const MINUS_ONE = new Fraction(-1);
 /** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */
 export class NotAMonomialError extends Error {
     constructor(message) {
@@ -54,13 +61,13 @@ function mergeInto(into, from, scale) {
     for (const [name, { dim, exp }] of from) {
         const cur = into.get(name);
         if (cur === undefined) {
-            into.set(name, { dim, exp: exp * scale });
+            into.set(name, { dim, exp: exp.multiply(scale) });
         }
         else {
             if (!equals(cur.dim, dim)) {
                 throw new NotAMonomialError(`leaf '${name}' appears with inconsistent dimensions`);
             }
-            cur.exp += exp * scale;
+            cur.exp = cur.exp.add(exp.multiply(scale));
         }
     }
 }
@@ -75,19 +82,19 @@ export function toMonomial(ast) {
     const out = new Map();
     switch (ast.kind) {
         case 'symbol':
-            out.set(ast.name, { dim: ast.dim, exp: 1 });
+            out.set(ast.name, { dim: ast.dim, exp: ONE });
             return out;
         case 'op':
             switch (ast.op) {
                 case '*':
                     for (const a of ast.args)
-                        mergeInto(out, toMonomial(a), 1);
+                        mergeInto(out, toMonomial(a), ONE);
                     return out;
                 case '/': {
                     const [num, ...dens] = ast.args;
-                    mergeInto(out, toMonomial(num), 1);
+                    mergeInto(out, toMonomial(num), ONE);
                     for (const d of dens)
-                        mergeInto(out, toMonomial(d), -1);
+                        mergeInto(out, toMonomial(d), MINUS_ONE);
                     return out;
                 }
                 case '^': {
@@ -95,8 +102,8 @@ export function toMonomial(ast) {
                     if (expNode.kind !== 'symbol') {
                         throw new NotAMonomialError('non-literal exponent');
                     }
-                    const n = Number(expNode.name);
-                    if (!Number.isFinite(n)) {
+                    const n = rationalExponentOf(expNode.name);
+                    if (n === undefined) {
                         throw new NotAMonomialError(`non-numeric exponent '${expNode.name}'`);
                     }
                     mergeInto(out, toMonomial(base), n);
@@ -110,21 +117,27 @@ export function toMonomial(ast) {
     }
 }
 /** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =
- *  positive exponents, denominator = negative). Zero exponents drop out.
+ *  positive exponents, denominator = negative). Zero exponents drop out. The
+ *  exponent literal is the double built from the fraction (`1/3` is written
+ *  `0.3333333333333333`), so one rational is always one spelling.
+ *
+ *  This is not merged with `monomialToExpr` (composition/probe/generator.ts),
+ *  which writes one product with negative exponents in code-unit name order;
+ *  this one orders names by `localeCompare` and splits a quotient. The
+ *  proposals' printed formulas and the IC dedup key read this tree, so one
+ *  builder would move them. Both build each factor with `symbolPower`.
  *  @internal */
 export function fromMonomial(m) {
-    const factor = (name, dim, e) => e === 1
-        ? sym(name, dim)
-        : { kind: 'op', op: '^', args: [sym(name, dim), sym(String(e), DIMENSIONLESS)] };
+    const factor = (name, dim, e) => symbolPower(sym(name, dim), fractionToNumber(e));
     const num = [];
     const den = [];
     for (const [name, { dim, exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {
-        if (exp === 0)
+        if (exp.isZero())
             continue;
-        if (exp > 0)
+        if (exp.numerator > 0n)
             num.push(factor(name, dim, exp));
         else
-            den.push(factor(name, dim, -exp));
+            den.push(factor(name, dim, exp.abs()));
     }
     const product = (xs) => xs.length === 1 ? xs[0] : { kind: 'op', op: '*', args: xs };
     const numerator = num.length === 0 ? sym('1', DIMENSIONLESS) : product(num);
@@ -132,7 +145,7 @@ export function fromMonomial(m) {
         return numerator;
     return { kind: 'op', op: '/', args: [numerator, product(den)] };
 }
-const isConstant = (name) => Object.prototype.hasOwnProperty.call(CONSTANTS, name);
+const isConstant = isRegisteredConstant;
 /** The single non-constant leaf of a monomial, or null if 0 or >1. */
 function uniqueNonConstantLeaf(m) {
     const free = [...m].filter(([name]) => !isConstant(name));
@@ -141,18 +154,38 @@ function uniqueNonConstantLeaf(m) {
     const [name, { dim, exp }] = free[0];
     return { name, dim, exp };
 }
-function latexFromMono(m) {
+/** The LaTeX of a monomial, exponents rendered from their fractions (`y^{1/3}`). @internal */
+export function latexFromMono(m) {
     const num = [];
     const den = [];
     for (const [name, { exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {
-        if (exp === 0)
+        if (exp.isZero())
             continue;
-        const tok = Math.abs(exp) === 1 ? name : `${name}^{${Math.abs(exp)}}`;
-        (exp > 0 ? num : den).push(tok);
+        const magnitude = exp.abs();
+        const tok = magnitude.equals(ONE) ? name : `${name}^{${formatRational(magnitude)}}`;
+        (exp.numerator > 0n ? num : den).push(tok);
     }
     const n = num.join(' \\cdot ') || '1';
     return den.length ? `\\frac{${n}}{${den.join(' \\cdot ')}}` : n;
 }
+/**
+ * Isolate `solveFor` from `m1 = m2`: `solveFor^e = m1 / (m2 without solveFor)`,
+ * every exponent divided by `e`, exactly. `m2` must hold `solveFor`.
+ *
+ * @internal
+ */
+export function isolateLeaf(m1, m2, solveFor) {
+    const result = new Map();
+    mergeInto(result, m1, ONE);
+    const m2NoSolve = new Map(m2);
+    m2NoSolve.delete(solveFor.name);
+    mergeInto(result, m2NoSolve, MINUS_ONE);
+    if (!solveFor.exp.equals(ONE)) {
+        for (const v of result.values())
+            v.exp = v.exp.divide(solveFor.exp);
+    }
+    return result;
+}
 // ── leaf-name canonicalization ──────────────────────────────────────────────
 // A canonical equation's `scalarAst` uses private symbols (`T`) while its
 // `dimensional.governing` and the whole composition graph (and bridge `symbolic`
@@ -160,14 +193,10 @@ function latexFromMono(m) {
 // governing names lets a derivation from a canonical equation and one from a
 // bridge edge of the SAME physics collapse under `dedupByNormalForm`.
 function collectLeafDims(ast, into) {
-    if (ast.kind === 'symbol') {
-        if (!into.has(ast.name))
-            into.set(ast.name, ast.dim);
-    }
-    else if (ast.kind === 'op') {
-        for (const a of ast.args)
-            collectLeafDims(a, into);
-    }
+    forEachScalarLeaf(ast, (leaf) => {
+        if (!into.has(leaf.name))
+            into.set(leaf.name, leaf.dim);
+    }, {});
 }
 /** Map each non-constant `scalarAst` leaf to the governing quantity of equal
  *  dimension, when that match is unique (else leave it — never guess). */
@@ -177,7 +206,7 @@ function leafCanonMap(scalarAst, governing) {
     const govFree = governing.filter((g) => !isConstant(g.name));
     const map = new Map();
     for (const [leaf, dim] of leaves) {
-        if (isConstant(leaf) || Number.isFinite(Number(leaf)))
+        if (isConstant(leaf) || isDecimalLiteral(leaf))
             continue;
         if (govFree.some((g) => g.name === leaf))
             continue; // already a graph name
@@ -190,14 +219,10 @@ function leafCanonMap(scalarAst, governing) {
 function renameLeaves(ast, map) {
     if (map.size === 0)
         return ast;
-    if (ast.kind === 'symbol') {
-        const r = map.get(ast.name);
-        return r ? { ...ast, name: r } : ast;
-    }
-    if (ast.kind === 'op') {
-        return { ...ast, args: ast.args.map((a) => renameLeaves(a, map)) };
-    }
-    return ast;
+    return mapScalarLeaves(ast, (leaf) => {
+        const r = map.get(leaf.name);
+        return r ? { ...leaf, name: r } : leaf;
+    }, {});
 }
 /** True if the monomial carries a dimensionless leaf that is neither a known
  *  constant, a numeric literal, NOR a declared input quantity — i.e. an
@@ -207,7 +232,7 @@ function hasNonConstantStub(m, inputs) {
     for (const [name, { dim }] of m) {
         if (equals(dim, DIMENSIONLESS) &&
             !isConstant(name) &&
-            !Number.isFinite(Number(name)) &&
+            !isDecimalLiteral(name) &&
             !inputs.has(name)) {
             return true;
         }
@@ -327,15 +352,7 @@ function derivePair(cand, t0, t1, E1, E2) {
     if (m1.has(solveFor.name))
         return null; // degenerate overlap (Design §5.2)
     // Isolate solveFor from `m1 = m2`:  solveFor^e = m1 / (m2 without solveFor).
-    const result = new Map();
-    mergeInto(result, m1, 1);
-    const m2NoSolve = new Map(m2);
-    m2NoSolve.delete(solveFor.name);
-    mergeInto(result, m2NoSolve, -1);
-    if (solveFor.exp !== 1) {
-        for (const v of result.values())
-            v.exp /= solveFor.exp;
-    }
+    const result = isolateLeaf(m1, m2, solveFor);
     const scalarAst = fromMonomial(result);
     const dim = validate(scalarAst).inferredDimension;
     if (!dim || !equals(dim, solveFor.dim))
@@ -376,13 +393,31 @@ function disambiguateIds(proposals) {
         ? { ...p, id: `${p.id}--${p.derivedFrom.sourceEquationIds.join('+')}` }
         : p);
 }
+/**
+ * The hash a proposal dedupes under: `normalForm` of its monomial rebuilt
+ * from the exact exponents (so `0.3333333333333333` and
+ * `0.33333333333333337` are one `1/3`), or of the AST itself when it is not
+ * a monomial.
+ */
+function dedupKey(p) {
+    let canonical = p.scalarAst;
+    try {
+        canonical = fromMonomial(toMonomial(p.scalarAst));
+    }
+    catch (err) {
+        if (!(err instanceof NotAMonomialError))
+            throw err;
+    }
+    return `${normalForm(canonical)}::${p.dimensionalSignature}`;
+}
 /**
  * Collapse proposals that derive the SAME relation — equal `normalForm` (up to
- * dimensionless constants) AND equal target dimension — into the first, recording
- * the others' identifications in `alsoDerivableFrom`. Distinct stubs do NOT
- * collapse (e.g. Landauer's dropped `ln2` vs an operator stub hash differently),
- * so this only merges genuine structural twins that a wider candidate scope can
- * produce (Design §9 #2). Deterministic: input order is preserved.
+ * dimensionless constants) of the exact monomial AND equal target dimension —
+ * into the first, recording the others' identifications in
+ * `alsoDerivableFrom`. Distinct stubs do NOT collapse (e.g. Landauer's dropped
+ * `ln2` vs an operator stub hash differently), so this only merges genuine
+ * structural twins that a wider candidate scope can produce (Design §9 #2).
+ * Deterministic: input order is preserved.
  *
  * @internal
  */
@@ -391,7 +426,17 @@ export function dedupByNormalForm(proposals) {
     const order = [];
     const extras = new Map();
     for (const p of proposals) {
-        const key = `${normalForm(p.scalarAst)}::${p.dimensionalSignature}`;
+        let key = dedupKey(p);
+        // On a hash miss, the algebraic step: a kept proposal of the same dimension
+        // that is this one up to a constant owns the key (`a/(b/c)` for `a·c/b`).
+        if (!byKey.has(key)) {
+            const twin = order.find((k) => {
+                const candidate = byKey.get(k);
+                return candidate.dimensionalSignature === p.dimensionalSignature && equalUpToConstant(candidate.scalarAst, p.scalarAst).equal;
+            });
+            if (twin !== undefined)
+                key = twin;
+        }
         const kept = byKey.get(key);
         if (kept === undefined) {
             byKey.set(key, p);