universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/bridge-analysis.js

@@ -24,14 +24,16 @@
  * @module composition/bridge-analysis
  */
 import { constantRecord } from '../dimensional/symbolic-constants.js';
+import { constantRatio, fixedPoint } from '../canonical/fixed-points.js';
+import { rationalize } from './rational-exponent.js';
 import { buckinghamPi, dimensionallyDetermines } from '../dimensional/buckingham.js';
 import { DIMENSIONLESS } from '../dimensional/types.js';
 import { equals, format } from '../dimensional/algebra.js';
 import { formulaShape } from './formula-shape.js';
 import { BRIDGE_EQUATIONS } from '../bridges/index.js';
-import { QUANTITY_IDENTIFICATIONS } from './compose.js';
 import { enumerateCompositions } from './enumerate.js';
 import { DATA_CONFRONTED_IDS } from '../bridges/confrontation-coverage.js';
+import { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';
 /** ℏ, c, G, k_B, e — the constants the audit/triage may invoke, from the registry. */
 // The constants a canonical or catalog relation bakes: a closure is searched over every subset.
 // `epsilon_0` and `m_e` joined on 2026-10-09, when the canonical entries that spelled them as
@@ -128,10 +130,8 @@ function makeInputs(e) {
         }
     };
     for (let j = 0; j < 3; j++) {
-        const magnitudes = {};
-        e.sources.forEach((s, i) => {
-            magnitudes[s.name] = Math.pow(1.6 + i, 1 + 0.27 * j);
-        });
+        // Source i takes (1.6 + i)^(1 + 0.27 j): this audit's own scheme, stated here.
+        const magnitudes = fixedPoint(e.sources.map((s) => s.name), 1 + 0.27 * j, { base: 1.6, step: 1 });
         // A negated source is tried only when the DOMAIN refuses the positive point (a carrier
         // charge that must be negative). A positive point the domain admits but the evaluator
         // cannot finish (an exponential that overflows, be-82) is a degenerate sample and not a
@@ -150,20 +150,91 @@ function makeInputs(e) {
     }
     return sets;
 }
-/** Recognizable dimensionless prefactors (small rationals, 1/nπ, √, π). */
-const CLEAN_PREFACTORS = [
-    1, 2, 3, 4, 0.5, 0.25, Math.log(2),
-    1 / (2 * Math.PI), 1 / (4 * Math.PI), 1 / (8 * Math.PI),
-    Math.sqrt(2 * Math.PI), Math.sqrt(Math.PI),
-    Math.PI, 2 * Math.PI, 4 * Math.PI, 6 * Math.PI, 1 / (6 * Math.PI),
-];
-const isCleanPrefactor = (p) => CLEAN_PREFACTORS.some((c) => Math.abs(Math.abs(p) - c) < 1e-3 * c);
+/** The denominator cap of a clean rational: the Buckingham enumerator's. */
+const CLEAN_MAX_DENOMINATOR = 720;
+/** The relative tolerance of a clean hit: the one the derivation fit uses. */
+const CLEAN_TOLERANCE = 1e-9;
+/** The (a, b) pairs of π^a · ln2^b, the simplest first. */
+const CLEAN_EXPONENT_PAIRS = (() => {
+    const pairs = [];
+    for (let a = -2; a <= 2; a++)
+        for (let b = -1; b <= 1; b++)
+            pairs.push([a, b]);
+    pairs.sort((x, y) => Math.abs(x[0]) + Math.abs(x[1]) - (Math.abs(y[0]) + Math.abs(y[1])) || Math.abs(x[0]) - Math.abs(y[0]));
+    return pairs;
+})();
+/** `π`, `π²`, `ln 2`, `(ln 2)²`, as a product string. */
+function symbolicFactor(a, b) {
+    const parts = [];
+    if (a === 1)
+        parts.push('π');
+    else if (a === 2)
+        parts.push('π²');
+    if (b === 1)
+        parts.push('ln 2');
+    else if (b === 2)
+        parts.push('(ln 2)²');
+    return parts.join(' ');
+}
+/** `r = p / (π^a · ln2^b)`, with `p = n/d`, as the exact form string. */
+function renderCleanForm(n, d, a, b, root) {
+    // Negative exponents put the symbol in the numerator.
+    const numSym = symbolicFactor(a < 0 ? -a : 0, b < 0 ? -b : 0);
+    const denSym = symbolicFactor(a > 0 ? a : 0, b > 0 ? b : 0);
+    const numParts = [...(n === 1n && numSym !== '' ? [] : [n.toString()]), ...(numSym === '' ? [] : [numSym])];
+    const denParts = [...(d === 1n ? [] : [d.toString()]), ...(denSym === '' ? [] : [denSym])];
+    // `2π` stays joined; a number before `ln 2` is spaced (`2 ln 2`), as `π ln 2` is.
+    const join = (parts) => parts.reduce((acc, part) => (acc === '' ? part : part.startsWith('ln') || part.startsWith('(ln') ? `${acc} ${part}` : acc + part), '');
+    const numerator = join(numParts);
+    if (denParts.length === 0)
+        return root ? (numerator === 'π' ? '√π' : /^[0-9]+$/.test(numerator) && numParts.length === 1 ? `√${numerator}` : `√(${numerator})`) : numerator;
+    const denominator = denParts.length === 1 ? denParts[0] : `(${join(denParts)})`;
+    const form = `${numerator}/${denominator}`;
+    return root ? `√(${form})` : form;
+}
+/**
+ * The exact form of a clean dimensionless prefactor, or `undefined` when
+ * the number is not one. A prefactor `r` is clean when `r = p / (π^a · ln2^b)`
+ * for `a ∈ −2..2`, `b ∈ −1..1` and a rational `p` with denominator at most
+ * 720, and numerator at most 720, that reproduces it to the relative 1e-9 the
+ * derivation fit uses; or
+ * when `r²` is, which names `√π`, `√(2π)` and their kin. The simplest
+ * `(a, b)` that fits is the one reported, so `2` is `2` and not `2π/π`.
+ * The rule replaces a list of seventeen constants matched at 1e-3; `9/8`
+ * (be-80) and `π/ln 2` (be-84) were not on it, and `π²/60`, the
+ * Stefan–Boltzmann closed form, is a hit under this rule.
+ *
+ * @internal
+ */
+export function cleanPrefactorForm(p) {
+    if (!Number.isFinite(p) || p === 0)
+        return undefined;
+    const sign = p < 0 ? '-' : '';
+    const r = Math.abs(p);
+    for (const root of [false, true]) {
+        const value = root ? r * r : r;
+        for (const [a, b] of CLEAN_EXPONENT_PAIRS) {
+            const scaled = value * Math.pow(Math.PI, a) * Math.pow(Math.LN2, b);
+            const q = rationalize(scaled, { maxDenominator: CLEAN_MAX_DENOMINATOR, tolerance: CLEAN_TOLERANCE });
+            // The cap bounds the numerator too. With it free, every integer-valued double
+            // (a G-closure of 3.6e21) is a rational over 1, and 21791/563 reproduced the
+            // BCS ratio 1.7639 to 1e-9 by chance: a small rational has a small numerator.
+            if (q !== undefined && (q.numerator < 0n ? -q.numerator : q.numerator) <= BigInt(CLEAN_MAX_DENOMINATOR)) {
+                return sign + renderCleanForm(q.numerator, q.denominator, a, b, root);
+            }
+        }
+    }
+    return undefined;
+}
+const isCleanPrefactor = (p) => cleanPrefactorForm(p) !== undefined;
 /**
  * A canonical closure more than ten times away from 1 is not a recovered
- * prefactor. Stefan–Boltzmann (≈0.1645) and Wien (≈1.265) stay inside that
- * window and keep the empirical/tuned mark. A G-closure of an atomic law
- * (10^21–10^25) does not. A recognized constant (2π, ln 2, 4π, 1/(6π), …)
- * stays even when it sits outside the window. The search includes ε₀, so the
+ * prefactor. Wien (≈1.265, 2π over the root of a transcendental equation)
+ * stays inside that window and keeps the empirical/tuned mark;
+ * Stefan–Boltzmann's π²/60 is a clean form under `cleanPrefactorForm`. A
+ * G-closure of an atomic law (10^21–10^25) does not pass. A recognized
+ * constant (2π, ln 2, 4π, 1/(6π), …) stays even when it sits outside the
+ * window. The search includes ε₀, so the
  * field energy density derives on {ε₀} with its sourced ½; the {ℏ, c, e}
  * stand-in it once closed on, μ0 rewritten through α, no longer arises, and
  * the guard that rejected it is gone (it changed no row of either graph).
@@ -216,16 +287,17 @@ export function attemptDerivation(e) {
                 cand *= Math.pow(i[name], exp);
             return e.evaluate(i) / cand;
         });
-        const mean = ratios.reduce((a, b) => a + b, 0) / ratios.length;
-        const cv = Math.sqrt(ratios.reduce((a, b) => a + (b - mean) ** 2, 0) / ratios.length) /
-            Math.abs(mean);
-        if (cv < 1e-9 && recoveredCanonicalPrefactor(e.id, mean)) {
+        // The coefficient of variation under 1e-9: this audit's own statistic and tolerance.
+        const decided = constantRatio(ratios, 1e-9, { statistic: 'cv' });
+        if (decided.constant && recoveredCanonicalPrefactor(e.id, decided.value)) {
+            const form = cleanPrefactorForm(decided.value);
             return {
                 status: 'derived',
                 subset: S.map((x) => x.name),
                 monomial: r.monomial,
-                prefactor: mean,
-                cleanPrefactor: isCleanPrefactor(mean),
+                prefactor: decided.value,
+                cleanPrefactor: form !== undefined,
+                ...(form === undefined ? {} : { prefactorForm: form }),
             };
         }
     }
@@ -327,17 +399,10 @@ export function bridgePriority(edges) {
 // ---------------------------------------------------------------------------
 // Catalog linkage map — how the equations connect via shared quantities.
 // ---------------------------------------------------------------------------
-/**
- * Quantity-name canonicalizer honoring `QUANTITY_IDENTIFICATIONS`: maps each
- * name to its identified representative (e.g. hawking-temperature →
- * temperature). The shared linkage substrate for `linkageMap` /
- * `proposeLinkCandidates`. NOTE: `anchoringDistance` deliberately does NOT
- * use this — it links on raw names (its distance-0/∞ contract is pinned).
- */
-function quantityCanonicalizer() {
-    const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));
-    return (n) => alias.get(n) ?? n;
-}
+// The quantity-name canonicalizer (`QUANTITY_IDENTIFICATIONS`) and the component partition are
+// `quantity-clusters.ts`, the one owner shared with the visual map and the discovery funnel.
+// NOTE: `anchoringDistance` deliberately does NOT canonicalize — it links on raw names (its
+// distance-0/∞ contract is pinned).
 /** An edge's distinct (canonical) quantity names — sources ∪ target. */
 function quantitiesOf(e, canon) {
     return [...new Set([...e.sources.map((s) => canon(s.name)), canon(e.target.name)])];
@@ -356,26 +421,9 @@ function quantitiesOf(e, canon) {
 function clusterMap(edges) {
     const statusOf = new Map(BRIDGE_EQUATIONS.map((b) => [b.id, b.status]));
     const canon = quantityCanonicalizer();
-    // Union-find over edges sharing a (canonical) quantity.
-    const parent = edges.map((_, i) => i);
-    const find = (x) => (parent[x] === x ? x : (parent[x] = find(parent[x])));
-    const union = (a, b) => { parent[find(a)] = find(b); };
-    const qToEdges = new Map();
-    edges.forEach((e, i) => {
-        for (const q of quantitiesOf(e, canon)) {
-            mapGetOrInsert(qToEdges, q, () => []).push(i);
-        }
-    });
-    for (const idxs of qToEdges.values()) {
-        for (let k = 1; k < idxs.length; k++)
-            union(idxs[0], idxs[k]);
-    }
-    const groups = new Map();
-    edges.forEach((_, i) => {
-        mapGetOrInsert(groups, find(i), () => []).push(i);
-    });
-    const clusters = [...groups.values()].map((idxs) => {
-        const es = idxs.map((i) => edges[i]);
+    // Edges sharing a (canonical) quantity are one cluster: the shared partition, already in
+    // the order this map always had (largest first, then by first edge id; input order inside).
+    const clusters = clusterBySharedKeys(edges, (e) => quantitiesOf(e, canon), (e) => e.id).map((es) => {
         const statusMix = {};
         const qcount = {};
         for (const e of es) {
@@ -392,7 +440,6 @@ function clusterMap(edges) {
             hubs: Object.entries(qcount).filter(([, c]) => c >= 2).map(([q]) => q).sort(),
         };
     });
-    clusters.sort((a, b) => b.size - a.size || a.edges[0].localeCompare(b.edges[0]));
     return {
         clusters,
         componentCount: clusters.length,

package/dist/composition/bridge-analysis.js.map

@@ -1 +1 @@
-{"version":3,"file":"bridge-analysis.js","sourceRoot":"","sources":["../../src/composition/bridge-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAErF,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAS3E,sFAAsF;AACtF,gGAAgG;AAChG,8FAA8F;AAC9F,iGAAiG;AACjG,gFAAgF;AAChF,MAAM,qBAAqB,GAA6B,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;IACnH,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAE,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,SAAS,aAAa,CAAI,GAAiB;IACzC,IAAI,GAAG,GAAU,CAAC,EAAE,CAAC,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,4BAA4B,GAChC,aAAa,CAAC,qBAAqB,CAAC,CAAC;AAEvC;;;;GAIG;AACH,SAAS,cAAc,CAAO,CAAY,EAAE,CAAI,EAAE,IAAa;IAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,CAAC,GAAG,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAGD,MAAM,MAAM,GAAG,CAAC,CAAa,EAAiC,EAAE;IAC9D,MAAM,OAAO,GAAG,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC;IACvC,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE;QAClD,oEAAoE;QACpE,8DAA8D;QAC9D,OAAO,EAAE,CAAC,CAAC,OAAO;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;KAC9C,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,IAAU,EAAU,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnF,MAAM,MAAM,GAAG,CAAC,CAAK,EAAE,GAAS,EAAW,EAAE,CAC3C,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC;AAExF;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAa;IAC9C,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,4BAA4B,EAAE,CAAC;QAC7C,MAAM,GAAG,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/B,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;YAAE,OAAO,YAAY,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,CAAa;IAC/B,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,MAAM,IAAI,GAAkC,EAAE,CAAC;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAA2B,EAAW,EAAE;QACxD,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,GAA2B,EAAW,EAAE;QACtD,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,UAAU,GAA2B,EAAE,CAAC;QAC9C,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,uFAAuF;QACvF,sFAAsF;QACtF,wFAAwF;QACxF,wFAAwF;QACxF,6CAA6C;QAC7C,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,UAAU,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAE,EAAE,CAAC,CAAC;aAC/D,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2EAA2E;AAC3E,MAAM,gBAAgB,GAAsB;IAC1C,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACvD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC1C,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;CAClE,CAAC;AACF,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAW,EAAE,CAC9C,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAErE;;;;;;;;;GASG;AACH,SAAS,2BAA2B,CAAC,EAAU,EAAE,SAAiB;IAChE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,gBAAgB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAChC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACtD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AAuBD;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAa;IAC7C,4EAA4E;IAC5E,wEAAwE;IACxE,iEAAiE;IACjE,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,iBAAiB,EAAE,CAAC;QAC/E,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;IACtC,CAAC;IACD,qEAAqE;IACrE,0EAA0E;IAC1E,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC;IACxE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,4BAA4B,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,SAAS;QAC5B,UAAU,GAAG,IAAI,CAAC;QAClB,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,MAAM,OAAO,GAAG,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBAC5C,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;gBAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,EAAE,GAAG,CAAC,CAAC;YACnF,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/D,MAAM,EAAE,GACN,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1E,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,IAAI,2BAA2B,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACzD,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC5B,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,SAAS,EAAE,IAAI;gBACf,cAAc,EAAE,gBAAgB,CAAC,IAAI,CAAC;aACvC,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;IAC1D,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CACxB,KAA4B,EAC5B,CAAa;IAEb,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACpC,cAAc,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjE,KAAK,MAAM,CAAC,IAAI,CAAC;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC;oBAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,UAAU,KAAK,aAAa;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAuBD,SAAS,SAAS,CAAC,CAAa;IAC9B,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;IAC/E,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC;IACzC,mEAAmE;IACnE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,WAAW,GAA8B;IAC7C,QAAQ,EAAE,CAAC;IACX,SAAS,EAAE,CAAC;IACZ,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;CACR,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA4B;IAE5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAC9C,CAAC;IACF,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,UAAU,KAAK,aAAa;YAAE,SAAS,CAAC,sBAAsB;QACpE,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,UAAU,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,IAAI,GACR,QAAQ,IAAI,CAAC,CAAC,KAAK,UAAU,IAAI,UAAU,IAAI,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,QAAQ,IAAI,CAAC,KAAK,UAAU;gBAC5B,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CAAC;QACV,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;YACpE,SAAS,EAAE,CAAC;YACZ,UAAU;YACV,SAAS;YACT,oBAAoB,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YACvE,IAAI;SACL,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;QACzB,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACnD,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU;QAC3B,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAC3B,CAAC;IACF,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,yEAAyE;AACzE,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,qBAAqB;IAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CACvD,CAAC;IACF,OAAO,CAAC,CAAS,EAAU,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClD,CAAC;AAED,wEAAwE;AACxE,SAAS,YAAY,CAAC,CAAa,EAAE,KAA4B;IAC/D,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AA8BD;;;;;;;;;;GAUG;AACH,SAAS,UAAU,CAAC,KAA4B;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAC9C,CAAC;IACF,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IAEtC,wDAAwD;IACxD,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACvC,cAAc,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAqB,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACnE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC;YACvE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC;gBAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3E,CAAC;QACD,OAAO;YACL,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC;YACxD,SAAS;YACT,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;SAC9E,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjF,OAAO;QACL,QAAQ;QACR,cAAc,EAAE,QAAQ,CAAC,MAAM;QAC/B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE;KAC9E,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAA4B;IACrD,OAAO;QACL,GAAG,UAAU,CAAC,KAAK,CAAC;QACpB,YAAY,EAAE,qBAAqB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM;KACtD,CAAC;AACJ,CAAC;AA2BD,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IACtD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA4B;IAChE,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,oDAAoD;IACjF,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,QAAQ;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAoB,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAC,iBAAiB;YACpE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC;gBAAE,SAAS,CAAC,8BAA8B;YACvE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAAE,SAAS;YACxC,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC;gBACD,CAAC;gBACD,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC;gBACf,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrD,QAAQ,EAAE,KAAK,KAAK,IAAI;gBACxB,WAAW,EAAE,KAAK;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC;QAC7C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CACzB,CAAC;IACF,OAAO,GAAG,CAAC;AACb,CAAC;AAyCD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAA4B;IAE5B,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,uDAAuD;IACpF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmB,CAAC;IAChD,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAErF,yEAAyE;IACzE,wEAAwE;IACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACzC,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,CAAS,EAAsB,EAAE,CACrD,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,wEAAwE;IACxE,0EAA0E;IAC1E,8BAA8B;IAC9B,MAAM,cAAc,GAAG,CAAC,CAAS,EAAsB,EAAE,CACvD,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3F,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,IAAI,GAA2B,IAAI,CAAC;QACxC,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YACzB,IAAI,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5J,CAAC;aAAM,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YAChC,IAAI,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5J,CAAC;QACD,IAAI,IAAI;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,UAAU,CAAC,IAAI,CACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC;QACxC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,CAAC;QAChD,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAC/C,CAAC;IAEF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAC/B,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAC9D,CAAC;IACF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAClE,OAAO;QACL,UAAU;QACV,aAAa,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM;QAC1D,gBAAgB,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,EAAE;QAC/C,kBAAkB,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;KAC5E,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Bridge-analysis — structural triage signals over the composition graph.\n *\n * INTERNAL (deliberately NOT on the public surface — not re-exported from\n * src/index.ts). A meta/analysis layer, like the catalog adjudicator, that\n * combines the dimensional engine with the graph to PRIORITIZE which\n * speculative bridges are closest to being DECIDABLE against established\n * physics — most anchored to the established core and most checkable.\n *\n * ⚠ This is a TRIAGE ranking (review/confrontation priority), NOT a\n * credibility ranking. The dimensional signals are orthogonal to whether a\n * bridge is true (see docs/research/Bridge-Equation-Dimensional-Audit.md:\n * the established Mercury perihelion is \"unclosable\"; the highly-speculative\n * Hawking-via-r_s derives cleanly). Do not prune, rank, or score the\n * catalog's credibility with this.\n *\n * Three engine signals + one catalog signal:\n *   - grounding   — does the equation re-derive as a recognized monomial\n *                   with a CLEAN dimensionless constant (ln2, 1/4π, √2π)?\n *   - complexity  — free dimensionless parameters (lower = more tractable).\n *   - anchoring   — graph distance to the established-confidence core.\n *   - status / data-confrontation — joined from the catalog (NOT engine).\n *\n * @module composition/bridge-analysis\n */\n\nimport { constantRecord } from '../dimensional/symbolic-constants.js';\nimport { buckinghamPi, dimensionallyDetermines } from '../dimensional/buckingham.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { BridgeEdge } from './edge.js';\nimport { formulaShape } from './formula-shape.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport { enumerateCompositions } from './enumerate.js';\nimport { DATA_CONFRONTED_IDS } from '../bridges/confrontation-coverage.js';\n\n/** A fundamental constant the derivation search may add (with SI value). */\ninterface NamedConstant {\n  readonly name: string;\n  readonly dim: Dimension;\n  readonly si: number;\n}\n\n/** ℏ, c, G, k_B, e — the constants the audit/triage may invoke, from the registry. */\n// The constants a canonical or catalog relation bakes: a closure is searched over every subset.\n// `epsilon_0` and `m_e` joined on 2026-10-09, when the canonical entries that spelled them as\n// governing inputs (`vacuum-permittivity`, `electron-mass`) started baking them like every other\n// constant; without them CE-plasma-frequency read as a reconstruction mismatch.\nconst FUNDAMENTAL_CONSTANTS: readonly NamedConstant[] = ['ℏ', 'c', 'G', 'k_B', 'e', 'epsilon_0', 'm_e'].map((name) => {\n  const record = constantRecord(name)!;\n  return { name, dim: record.dim, si: record.value };\n});\n\nfunction subsetsBySize<T>(arr: readonly T[]): T[][] {\n  let out: T[][] = [[]];\n  for (const x of arr) {\n    const n = out.length;\n    for (let i = 0; i < n; i++) out.push([...out[i], x]);\n  }\n  return out.sort((a, b) => a.length - b.length);\n}\n\n/**\n * All 2⁵ = 32 size-ordered subsets of `FUNDAMENTAL_CONSTANTS`, computed once.\n * `dimensionalFreedom` and `attemptDerivation` iterate these on every bridge,\n * and the set is invariant — consumers only read each subset (spread into a\n * `gov` list), never mutate it.\n */\nconst FUNDAMENTAL_CONSTANT_SUBSETS: readonly NamedConstant[][] =\n  subsetsBySize(FUNDAMENTAL_CONSTANTS);\n\n/**\n * Get `m[k]`, inserting `make()` first when absent — replaces the\n * `if (!m.has(k)) m.set(k, …); m.get(k)!` two-step (and its `!` assertion) with\n * one call that returns a non-null value.\n */\nfunction mapGetOrInsert<K, V>(m: Map<K, V>, k: K, make: () => V): V {\n  let v = m.get(k);\n  if (v === undefined) {\n    v = make();\n    m.set(k, v);\n  }\n  return v;\n}\n\ntype DV = { name: string; dim: Dimension };\nconst asVars = (e: BridgeEdge): { target: DV; sources: DV[] } => {\n  const factors = e.formulaFactors ?? {};\n  return {\n    target: { name: e.target.name, dim: e.target.dim },\n    // A dimensionless count is not a Buckingham governor. Folding it in\n    // makes the monomial non-unique and the audit leaves DERIVED.\n    sources: e.sources\n      .filter((s) => factors[s.name] === undefined)\n      .map((s) => ({ name: s.name, dim: s.dim })),\n  };\n};\n\nconst rankOf = (vars: DV[]): number => (vars.length ? buckinghamPi(vars).rank : 0);\nconst inSpan = (t: DV, gov: DV[]): boolean =>\n  gov.length === 0 ? buckinghamPi([t]).rank === 0 : rankOf([t, ...gov]) === rankOf(gov);\n\n/**\n * Free dimensionless parameters: minimal constant subset that puts the\n * target in span, then the leftover π-group count − 1. 0 = a single\n * dimensionless statement (monomial or decoy); k = monomial × F(k ratios).\n */\nexport function dimensionalFreedom(e: BridgeEdge): number {\n  const { target, sources } = asVars(e);\n  for (const S of FUNDAMENTAL_CONSTANT_SUBSETS) {\n    const gov = [...sources, ...S];\n    if (inSpan(target, gov)) return buckinghamPi([target, ...gov]).piGroupCount - 1;\n  }\n  return Infinity;\n}\n\n/**\n * Deterministic, domain-valid input sets with per-source variation.\n *\n * Each magnitude set is tried with every source positive first, then with\n * each single source negated: a domain that holds only for a negative input\n * (a signed charge, a potential below zero) once got positives only and was\n * reported `no-samples` (9.0.0 audit §4 Low). The first sign pattern the\n * domain admits is kept for that magnitude set, so a domain that admits the\n * positives is sampled exactly as before.\n */\nfunction makeInputs(e: BridgeEdge): Array<Record<string, number>> {\n  if (e.sources.length === 0) return [{}];\n  const sets: Array<Record<string, number>> = [];\n  const inDomain = (inp: Record<string, number>): boolean => {\n    try {\n      return e.domain.predicate(inp);\n    } catch {\n      return false;\n    }\n  };\n  const finite = (inp: Record<string, number>): boolean => {\n    try {\n      return Number.isFinite(e.evaluate(inp));\n    } catch {\n      return false;\n    }\n  };\n  for (let j = 0; j < 3; j++) {\n    const magnitudes: Record<string, number> = {};\n    e.sources.forEach((s, i) => {\n      magnitudes[s.name] = Math.pow(1.6 + i, 1 + 0.27 * j);\n    });\n    // A negated source is tried only when the DOMAIN refuses the positive point (a carrier\n    // charge that must be negative). A positive point the domain admits but the evaluator\n    // cannot finish (an exponential that overflows, be-82) is a degenerate sample and not a\n    // reason to look for a sign at which the function happens to be flat: a monomial fitted\n    // on a saturated regime is not a derivation.\n    if (inDomain(magnitudes)) {\n      if (finite(magnitudes)) sets.push(magnitudes);\n      continue;\n    }\n    const negated = e.sources\n      .map((s) => ({ ...magnitudes, [s.name]: -magnitudes[s.name]! }))\n      .find((inp) => inDomain(inp) && finite(inp));\n    if (negated !== undefined) sets.push(negated);\n  }\n  return sets;\n}\n\n/** Recognizable dimensionless prefactors (small rationals, 1/nπ, √, π). */\nconst CLEAN_PREFACTORS: readonly number[] = [\n  1, 2, 3, 4, 0.5, 0.25, Math.log(2),\n  1 / (2 * Math.PI), 1 / (4 * Math.PI), 1 / (8 * Math.PI),\n  Math.sqrt(2 * Math.PI), Math.sqrt(Math.PI),\n  Math.PI, 2 * Math.PI, 4 * Math.PI, 6 * Math.PI, 1 / (6 * Math.PI),\n];\nconst isCleanPrefactor = (p: number): boolean =>\n  CLEAN_PREFACTORS.some((c) => Math.abs(Math.abs(p) - c) < 1e-3 * c);\n\n/**\n * A canonical closure more than ten times away from 1 is not a recovered\n * prefactor. Stefan–Boltzmann (≈0.1645) and Wien (≈1.265) stay inside that\n * window and keep the empirical/tuned mark. A G-closure of an atomic law\n * (10^21–10^25) does not. A recognized constant (2π, ln 2, 4π, 1/(6π), …)\n * stays even when it sits outside the window. The search includes ε₀, so the\n * field energy density derives on {ε₀} with its sourced ½; the {ℏ, c, e}\n * stand-in it once closed on, μ0 rewritten through α, no longer arises, and\n * the guard that rejected it is gone (it changed no row of either graph).\n */\nfunction recoveredCanonicalPrefactor(id: string, prefactor: number): boolean {\n  if (!id.startsWith('CE-') || isCleanPrefactor(prefactor)) return true;\n  const mag = Math.abs(prefactor);\n  if (!(mag > 0) || !Number.isFinite(mag)) return false;\n  return Math.abs(Math.log10(mag)) <= 1;\n}\n\n/**\n * The outcome of trying to derive a bridge dimensionally + verify it.\n * `not-a-monomial` means the encoded formula adds dimensionful terms, so a\n * monomial reconstruction does not apply. It is not a failed reconstruction.\n */\ntype DerivationStatus =\n  | 'derived'\n  | 'decoy'\n  | 'open'\n  | 'no-samples'\n  | 'not-a-monomial'\n  | 'coefficient-unset';\ninterface DerivationResult {\n  readonly status: DerivationStatus;\n  readonly subset?: readonly string[];\n  readonly monomial?: Readonly<Record<string, number>>;\n  readonly prefactor?: number;\n  /** True when derived AND the prefactor is a recognizable constant. */\n  readonly cleanPrefactor?: boolean;\n}\n\n/**\n * Attempt to derive a bridge: the first constant-subset that dimensionally\n * closes the target AND reproduces the evaluator up to a constant ratio.\n */\nexport function attemptDerivation(e: BridgeEdge): DerivationResult {\n  // A sum of dimensionful terms is not a proportionality. The constant search\n  // below would report a decoy, or a derived constant, for a monomial the\n  // formula is not. Proof status is separate and is not read here.\n  if (e.symbolic !== undefined && formulaShape(e.symbolic) === 'dimensional-sum') {\n    return { status: 'not-a-monomial' };\n  }\n  // A missing coefficient is not the constant 1. The evaluator returns\n  // no number, so a ratio against that number is not a recovered prefactor.\n  if (e.coefficientUnset === true) return { status: 'coefficient-unset' };\n  const { target, sources } = asVars(e);\n  const inputs = makeInputs(e);\n  const need = e.sources.length === 0 ? 1 : 2;\n  let anyClosure = false;\n  for (const S of FUNDAMENTAL_CONSTANT_SUBSETS) {\n    const r = dimensionallyDetermines(target, [...sources, ...S]);\n    if (!r.determined) continue;\n    anyClosure = true;\n    if (inputs.length < need) continue;\n    const ratios = inputs.map((i) => {\n      let cand = 1;\n      const factors = e.formulaFactors ?? {};\n      for (const s of e.sources) {\n        if (factors[s.name] !== undefined) continue;\n        cand *= Math.pow(i[s.name], r.monomial![s.name] ?? 0);\n      }\n      for (const k of S) cand *= Math.pow(k.si, r.monomial![k.name] ?? 0);\n      for (const [name, exp] of Object.entries(factors)) cand *= Math.pow(i[name]!, exp);\n      return e.evaluate(i) / cand;\n    });\n    const mean = ratios.reduce((a, b) => a + b, 0) / ratios.length;\n    const cv =\n      Math.sqrt(ratios.reduce((a, b) => a + (b - mean) ** 2, 0) / ratios.length) /\n      Math.abs(mean);\n    if (cv < 1e-9 && recoveredCanonicalPrefactor(e.id, mean)) {\n      return {\n        status: 'derived',\n        subset: S.map((x) => x.name),\n        monomial: r.monomial,\n        prefactor: mean,\n        cleanPrefactor: isCleanPrefactor(mean),\n      };\n    }\n  }\n  if (inputs.length < need) return { status: 'no-samples' };\n  return { status: anyClosure ? 'decoy' : 'open' };\n}\n\n/**\n * Graph distance from a bridge's quantities to the established-confidence\n * core (BFS over quantity co-occurrence). 0 = shares a quantity with an\n * established edge; Infinity = structurally isolated from it. Read by\n * `bridgePriority` only; it was exported with no caller outside this file.\n */\nfunction anchoringDistance(\n  edges: readonly BridgeEdge[],\n  e: BridgeEdge,\n): number {\n  const adj = new Map<string, Set<string>>();\n  const link = (a: string, b: string) => {\n    mapGetOrInsert(adj, a, () => new Set<string>()).add(b);\n  };\n  const core = new Set<string>();\n  for (const edge of edges) {\n    const q = [...edge.sources.map((s) => s.name), edge.target.name];\n    for (const a of q) for (const b of q) if (a !== b) link(a, b);\n    if (edge.confidence === 'established') for (const n of q) core.add(n);\n  }\n  const distOf = new Map<string, number>();\n  const queue = [...core];\n  for (const c of core) distOf.set(c, 0);\n  while (queue.length) {\n    const x = queue.shift()!;\n    for (const y of adj.get(x) ?? []) {\n      if (!distOf.has(y)) {\n        distOf.set(y, distOf.get(x)! + 1);\n        queue.push(y);\n      }\n    }\n  }\n  const qs = [...e.sources.map((s) => s.name), e.target.name];\n  return Math.min(...qs.map((n) => (distOf.has(n) ? distOf.get(n)! : Infinity)));\n}\n\n/** How grounded the equation is, as a structural signal. */\ntype Grounding = 'grounded' | 'empirical' | 'decoy' | 'open';\n/** Review-priority tier (1 = highest structural decidability). */\ntype Tier = 1 | 2 | 3;\n\n/** One bridge's triage profile. */\ninterface BridgePriorityEntry {\n  readonly id: string;\n  readonly beId: number | null;\n  readonly status: string;\n  /** `grounded` (recognized monomial+clean constant) → `open` (multi-param). */\n  readonly grounding: Grounding;\n  /** Free dimensionless parameters (lower = more tractable). */\n  readonly complexity: number;\n  /** Graph distance to the established core (Infinity = isolated). */\n  readonly anchoring: number;\n  /** A committed data confrontation exists (catalog signal, NOT engine). */\n  readonly hasDataConfrontation: boolean;\n  readonly tier: Tier;\n}\n\nfunction grounding(e: BridgeEdge): Grounding {\n  const d = attemptDerivation(e);\n  if (d.status === 'derived') return d.cleanPrefactor ? 'grounded' : 'empirical';\n  if (d.status === 'decoy') return 'decoy';\n  // A dimensional sum has no recognized monomial. It is not a decoy.\n  return 'open';\n}\n\nconst GROUND_RANK: Record<Grounding, number> = {\n  grounded: 0,\n  empirical: 1,\n  decoy: 2,\n  open: 3,\n};\n\n/**\n * Triage the non-established bridges by structural decidability against the\n * established core. Returns profiles sorted best-first (Tier, then anchoring,\n * grounding, complexity). NOT a credibility ranking — see module docstring.\n */\nexport function bridgePriority(\n  edges: readonly BridgeEdge[],\n): BridgePriorityEntry[] {\n  const statusOf = new Map<number, string>(\n    BRIDGE_EQUATIONS.map((b) => [b.id, b.status]),\n  );\n  const entries: BridgePriorityEntry[] = [];\n  for (const e of edges) {\n    if (e.confidence === 'established') continue; // already in the core\n    const g = grounding(e);\n    const complexity = dimensionalFreedom(e);\n    const anchoring = anchoringDistance(edges, e);\n    const anchored = Number.isFinite(anchoring);\n    const tier: Tier =\n      anchored && (g === 'grounded' || complexity <= 1)\n        ? 1\n        : anchored || g === 'grounded'\n          ? 2\n          : 3;\n    entries.push({\n      id: e.id,\n      beId: e.beId,\n      status: e.beId == null ? 'law' : (statusOf.get(e.beId) ?? 'unknown'),\n      grounding: g,\n      complexity,\n      anchoring,\n      hasDataConfrontation: e.beId != null && DATA_CONFRONTED_IDS.has(e.beId),\n      tier,\n    });\n  }\n  entries.sort(\n    (a, b) =>\n      a.tier - b.tier ||\n      a.anchoring - b.anchoring ||\n      GROUND_RANK[a.grounding] - GROUND_RANK[b.grounding] ||\n      a.complexity - b.complexity ||\n      a.id.localeCompare(b.id),\n  );\n  return entries;\n}\n\n// ---------------------------------------------------------------------------\n// Catalog linkage map — how the equations connect via shared quantities.\n// ---------------------------------------------------------------------------\n\n/**\n * Quantity-name canonicalizer honoring `QUANTITY_IDENTIFICATIONS`: maps each\n * name to its identified representative (e.g. hawking-temperature →\n * temperature). The shared linkage substrate for `linkageMap` /\n * `proposeLinkCandidates`. NOTE: `anchoringDistance` deliberately does NOT\n * use this — it links on raw names (its distance-0/∞ contract is pinned).\n */\nfunction quantityCanonicalizer(): (n: string) => string {\n  const alias = new Map<string, string>(\n    QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]),\n  );\n  return (n: string): string => alias.get(n) ?? n;\n}\n\n/** An edge's distinct (canonical) quantity names — sources ∪ target. */\nfunction quantitiesOf(e: BridgeEdge, canon: (n: string) => string): string[] {\n  return [...new Set([...e.sources.map((s) => canon(s.name)), canon(e.target.name)])];\n}\n\n/** One connected cluster of equations linked by shared quantities. */\ninterface LinkageCluster {\n  /** Edge ids in this cluster. */\n  readonly edges: readonly string[];\n  readonly size: number;\n  /** Contains an established-confidence edge (anchored to known physics). */\n  readonly anchored: boolean;\n  /** Catalog-status histogram across the cluster's edges. */\n  readonly statusMix: Readonly<Record<string, number>>;\n  /** Quantities that appear in ≥2 of the cluster's edges (the link hubs). */\n  readonly hubs: readonly string[];\n}\n\n/** The catalog's linkage structure. */\ninterface LinkageMap {\n  /** Clusters, largest first. */\n  readonly clusters: readonly LinkageCluster[];\n  readonly componentCount: number;\n  /** Single-edge cluster ids (structurally isolated). */\n  readonly isolated: readonly string[];\n  /** Number of valid pairwise compositions over the edge set (directed links). */\n  readonly compositions: number;\n}\n\n/** The cluster structure WITHOUT the composition count — the cheap core every\n *  linkage consumer except `upt map`'s headline needs. */\ntype ClusterMap = Omit<LinkageMap, 'compositions'>;\n\n/**\n * The cluster structure of the catalog graph: connected components whose nodes\n * are edges and whose links are shared quantities (honoring\n * `QUANTITY_IDENTIFICATIONS`). Reveals a dominant anchored core hubbed on a few\n * quantities, plus thematic clusters and a long isolated tail. A descriptive\n * structural map, NOT a credibility signal (see bridgePriority's caveat).\n *\n * This is the cheap core: it does NOT run the O(E²) pairwise-composition count.\n * The candidate/connector proposers (which never read `.compositions`) call\n * this directly; `linkageMap` adds the count for `upt map`'s headline.\n */\nfunction clusterMap(edges: readonly BridgeEdge[]): ClusterMap {\n  const statusOf = new Map<number, string>(\n    BRIDGE_EQUATIONS.map((b) => [b.id, b.status]),\n  );\n  const canon = quantityCanonicalizer();\n\n  // Union-find over edges sharing a (canonical) quantity.\n  const parent = edges.map((_, i) => i);\n  const find = (x: number): number => (parent[x] === x ? x : (parent[x] = find(parent[x])));\n  const union = (a: number, b: number): void => { parent[find(a)] = find(b); };\n  const qToEdges = new Map<string, number[]>();\n  edges.forEach((e, i) => {\n    for (const q of quantitiesOf(e, canon)) {\n      mapGetOrInsert(qToEdges, q, () => []).push(i);\n    }\n  });\n  for (const idxs of qToEdges.values()) {\n    for (let k = 1; k < idxs.length; k++) union(idxs[0], idxs[k]);\n  }\n\n  const groups = new Map<number, number[]>();\n  edges.forEach((_, i) => {\n    mapGetOrInsert(groups, find(i), () => []).push(i);\n  });\n\n  const clusters: LinkageCluster[] = [...groups.values()].map((idxs) => {\n    const es = idxs.map((i) => edges[i]);\n    const statusMix: Record<string, number> = {};\n    const qcount: Record<string, number> = {};\n    for (const e of es) {\n      const s = e.beId == null ? 'law' : (statusOf.get(e.beId) ?? 'unknown');\n      statusMix[s] = (statusMix[s] ?? 0) + 1;\n      for (const q of quantitiesOf(e, canon)) qcount[q] = (qcount[q] ?? 0) + 1;\n    }\n    return {\n      edges: es.map((e) => e.id),\n      size: es.length,\n      anchored: es.some((e) => e.confidence === 'established'),\n      statusMix,\n      hubs: Object.entries(qcount).filter(([, c]) => c >= 2).map(([q]) => q).sort(),\n    };\n  });\n  clusters.sort((a, b) => b.size - a.size || a.edges[0].localeCompare(b.edges[0]));\n\n  return {\n    clusters,\n    componentCount: clusters.length,\n    isolated: clusters.filter((c) => c.size === 1).flatMap((c) => c.edges).sort(),\n  };\n}\n\n/**\n * The full linkage map: the {@link clusterMap} structure plus the (O(E²))\n * pairwise-composition count. Only `upt map`'s headline needs the count, so\n * everything else calls `clusterMap` directly. Internal — not on the public\n * surface (mirrors the rest of bridge-analysis).\n */\nexport function linkageMap(edges: readonly BridgeEdge[]): LinkageMap {\n  return {\n    ...clusterMap(edges),\n    compositions: enumerateCompositions(edges).all.length,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Link-candidate proposals — cross-cluster same-dimension quantity pairs.\n// ---------------------------------------------------------------------------\n\n/**\n * A candidate identification surfaced by the linkage map: two quantities in\n * DIFFERENT clusters with the SAME (non-dimensionless) dimension — a\n * potential \"missing link\" of the kind the Hawking-temperature ≡\n * temperature identification was.\n */\nexport interface LinkCandidate {\n  /** Quantity in cluster A. */\n  readonly a: string;\n  /** Quantity in cluster B (a ≠ b; different clusters). */\n  readonly b: string;\n  /** Shared SI dimension (formatted). */\n  readonly dim: string;\n  /** One side is in the anchored (known-physics) cluster. */\n  readonly touchesCore: boolean;\n  /** The names share a word token (same physical KIND, e.g. both `*-mass`). */\n  readonly sameKind: boolean;\n  /** The shared token, when `sameKind`. */\n  readonly sharedToken: string | null;\n}\n\nfunction sharedNameToken(a: string, b: string): string | null {\n  const tb = new Set(b.split('-'));\n  for (const t of a.split('-')) if (tb.has(t)) return t;\n  return null;\n}\n\n/**\n * Propose candidate cross-cluster identifications from the linkage map:\n * every pair of quantities in different clusters that share a\n * non-dimensionless dimension. ⚠ This is a coincidence-heavy REVIEW SURFACE\n * (same dimension is a weak signal — see the dimensional audit's decoy\n * finding), NOT a list of discovered bridges. Ranked: core-touching first,\n * then same-kind. The output's only path is human adjudication\n * (Part-VI §XXVII-B).\n *\n * Internal — not on the public surface.\n */\nexport function proposeLinkCandidates(edges: readonly BridgeEdge[]): LinkCandidate[] {\n  const m = clusterMap(edges); // clusters only — skips the O(E²) composition count\n  const canon = quantityCanonicalizer();\n  const edgeCluster = new Map<string, number>();\n  m.clusters.forEach((c, ci) => c.edges.forEach((id) => edgeCluster.set(id, ci)));\n\n  const qCluster = new Map<string, number>();\n  const qDim = new Map<string, Dimension>();\n  const qAnchored = new Map<string, boolean>();\n  for (const e of edges) {\n    const ci = edgeCluster.get(e.id)!;\n    const anchored = m.clusters[ci].anchored;\n    for (const s of [...e.sources, e.target]) {\n      const n = canon(s.name);\n      qCluster.set(n, ci);\n      qDim.set(n, s.dim);\n      if (anchored) qAnchored.set(n, true);\n    }\n  }\n\n  const names = [...qDim.keys()];\n  const out: LinkCandidate[] = [];\n  for (let i = 0; i < names.length; i++) {\n    for (let j = i + 1; j < names.length; j++) {\n      const a = names[i];\n      const b = names[j];\n      if (qCluster.get(a) === qCluster.get(b)) continue; // already linked\n      const da = qDim.get(a)!;\n      if (equals(da, DIMENSIONLESS)) continue; // dimensionless = too generic\n      if (!equals(da, qDim.get(b)!)) continue;\n      const token = sharedNameToken(a, b);\n      out.push({\n        a,\n        b,\n        dim: format(da),\n        touchesCore: !!(qAnchored.get(a) || qAnchored.get(b)),\n        sameKind: token !== null,\n        sharedToken: token,\n      });\n    }\n  }\n  out.sort(\n    (x, y) =>\n      Number(y.touchesCore) - Number(x.touchesCore) ||\n      Number(y.sameKind) - Number(x.sameKind) ||\n      x.a.localeCompare(y.a) ||\n      x.b.localeCompare(y.b),\n  );\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Orphan connectors — candidate identifications that pull an ISOLATED bridge\n// into the anchored core.\n// ---------------------------------------------------------------------------\n\n/**\n * A candidate identification with ONE endpoint on an isolated (single-edge)\n * bridge and the OTHER on an anchored-cluster bridge — accepting it would\n * connect orphaned physics to the established core.\n */\ninterface OrphanConnector {\n  /** The isolated bridge's edge id (the orphan). */\n  readonly orphanEdge: string;\n  /** The orphan-side quantity. */\n  readonly orphanQuantity: string;\n  /** The core-side quantity it shares a dimension with. */\n  readonly coreQuantity: string;\n  /** An anchored-cluster edge touching `coreQuantity`. */\n  readonly coreEdge: string;\n  /** Shared SI dimension (formatted). */\n  readonly dim: string;\n  /** The two names share a word token. A token is not a verdict. */\n  readonly sameKind: boolean;\n  /** The shared token, when `sameKind`. */\n  readonly sharedToken: string | null;\n}\n\n/** Orphan-connector report. */\ninterface OrphanConnectorReport {\n  /** Connectors, same-kind first then by orphan id. */\n  readonly connectors: readonly OrphanConnector[];\n  /** Of those, how many share a name token. A token is not a verdict. */\n  readonly sameKindCount: number;\n  /** Isolated bridges with ≥1 same-kind connector to the core, sorted. */\n  readonly connectedOrphans: readonly string[];\n  /** Isolated bridges with NO connector at all (truly unconnected), sorted. */\n  readonly unconnectedOrphans: readonly string[];\n}\n\n/**\n * Of the catalog's isolated bridges, which could connect to the anchored core\n * via a same-dimension quantity identification? This intersects\n * `proposeLinkCandidates` with the linkage map's isolated/anchored partition:\n * a connector is a cross-cluster candidate whose one side sits on an isolated\n * bridge and whose other side touches an anchored cluster. The same-kind\n * subset (shared name token) is the least-implausible set worth a physicist's\n * review — the structural frontier of the catalog (the 20 orphaned bridges).\n *\n * ⚠ Same dimension is a WEAK prior (the dimensional audit's decoy finding):\n * most connectors are coincidences (a Förster radius is not a Schwarzschild\n * radius). A REVIEW SURFACE only — Part-VI §XXVII-B. Internal.\n */\nexport function proposeOrphanConnectors(\n  edges: readonly BridgeEdge[],\n): OrphanConnectorReport {\n  const m = clusterMap(edges); // clusters/isolated only — skips the composition count\n  const isolated = new Set(m.isolated);\n  const edgeAnchored = new Map<string, boolean>();\n  m.clusters.forEach((c) => c.edges.forEach((id) => edgeAnchored.set(id, c.anchored)));\n\n  // quantity (raw name) → the edges touching it. Isolated bridges carry no\n  // registered identifications, so raw names suffice for the orphan side.\n  const qToEdges = new Map<string, string[]>();\n  for (const e of edges) {\n    for (const q of [...e.sources, e.target]) {\n      mapGetOrInsert(qToEdges, q.name, () => []).push(e.id);\n    }\n  }\n  const orphanEdgeOf = (q: string): string | undefined =>\n    (qToEdges.get(q) ?? []).find((id) => isolated.has(id));\n  // The core is an anchored cluster of more than one edge. An established\n  // bridge that is itself isolated is an orphan, not the core, so a pair of\n  // orphans is not a connector.\n  const anchoredEdgeOf = (q: string): string | undefined =>\n    (qToEdges.get(q) ?? []).find((id) => edgeAnchored.get(id) === true && !isolated.has(id));\n\n  const connectors: OrphanConnector[] = [];\n  for (const c of proposeLinkCandidates(edges)) {\n    const aOrphan = orphanEdgeOf(c.a);\n    const bOrphan = orphanEdgeOf(c.b);\n    const aAnchored = anchoredEdgeOf(c.a);\n    const bAnchored = anchoredEdgeOf(c.b);\n    let conn: OrphanConnector | null = null;\n    if (aOrphan && bAnchored) {\n      conn = { orphanEdge: aOrphan, orphanQuantity: c.a, coreQuantity: c.b, coreEdge: bAnchored, dim: c.dim, sameKind: c.sameKind, sharedToken: c.sharedToken };\n    } else if (bOrphan && aAnchored) {\n      conn = { orphanEdge: bOrphan, orphanQuantity: c.b, coreQuantity: c.a, coreEdge: aAnchored, dim: c.dim, sameKind: c.sameKind, sharedToken: c.sharedToken };\n    }\n    if (conn) connectors.push(conn);\n  }\n  connectors.sort(\n    (x, y) =>\n      Number(y.sameKind) - Number(x.sameKind) ||\n      x.orphanEdge.localeCompare(y.orphanEdge) ||\n      x.orphanQuantity.localeCompare(y.orphanQuantity) ||\n      x.coreQuantity.localeCompare(y.coreQuantity),\n  );\n\n  const connectedSameKind = new Set(\n    connectors.filter((c) => c.sameKind).map((c) => c.orphanEdge),\n  );\n  const anyConnector = new Set(connectors.map((c) => c.orphanEdge));\n  return {\n    connectors,\n    sameKindCount: connectors.filter((c) => c.sameKind).length,\n    connectedOrphans: [...connectedSameKind].sort(),\n    unconnectedOrphans: m.isolated.filter((id) => !anyConnector.has(id)).sort(),\n  };\n}\n"]}
+{"version":3,"file":"bridge-analysis.js","sourceRoot":"","sources":["../../src/composition/bridge-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,EAAkB,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAErF,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AASpF,sFAAsF;AACtF,gGAAgG;AAChG,8FAA8F;AAC9F,iGAAiG;AACjG,gFAAgF;AAChF,MAAM,qBAAqB,GAA6B,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;IACnH,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAE,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,SAAS,aAAa,CAAI,GAAiB;IACzC,IAAI,GAAG,GAAU,CAAC,EAAE,CAAC,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,4BAA4B,GAChC,aAAa,CAAC,qBAAqB,CAAC,CAAC;AAEvC;;;;GAIG;AACH,SAAS,cAAc,CAAO,CAAY,EAAE,CAAI,EAAE,IAAa;IAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,CAAC,GAAG,IAAI,EAAE,CAAC;QACX,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAGD,MAAM,MAAM,GAAG,CAAC,CAAa,EAAiC,EAAE;IAC9D,MAAM,OAAO,GAAG,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC;IACvC,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE;QAClD,oEAAoE;QACpE,8DAA8D;QAC9D,OAAO,EAAE,CAAC,CAAC,OAAO;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;KAC9C,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,IAAU,EAAU,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnF,MAAM,MAAM,GAAG,CAAC,CAAK,EAAE,GAAS,EAAW,EAAE,CAC3C,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC;AAExF;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAa;IAC9C,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,4BAA4B,EAAE,CAAC;QAC7C,MAAM,GAAG,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/B,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;YAAE,OAAO,YAAY,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,CAAa;IAC/B,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,MAAM,IAAI,GAAkC,EAAE,CAAC;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAA2B,EAAW,EAAE;QACxD,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,GAA2B,EAAW,EAAE;QACtD,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,+EAA+E;QAC/E,MAAM,UAAU,GAAG,UAAU,CAC3B,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAC5B,CAAC,GAAG,IAAI,GAAG,CAAC,EACZ,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CACvB,CAAC;QACF,uFAAuF;QACvF,sFAAsF;QACtF,wFAAwF;QACxF,wFAAwF;QACxF,6CAA6C;QAC7C,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,UAAU,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAE,EAAE,CAAC,CAAC;aAC/D,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,4EAA4E;AAC5E,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,8EAA8E;AAC9E,MAAM,eAAe,GAAG,IAAI,CAAC;AAC7B,2DAA2D;AAC3D,MAAM,oBAAoB,GAA2C,CAAC,GAAG,EAAE;IACzE,MAAM,KAAK,GAAuB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7H,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AAEL,yDAAyD;AACzD,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,CAAC,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACxB,IAAI,CAAC,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC3B,IAAI,CAAC,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,yEAAyE;AACzE,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,IAAa;IAChF,sDAAsD;IACtD,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5G,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3F,kFAAkF;IAClF,MAAM,IAAI,GAAG,CAAC,KAAwB,EAAU,EAAE,CAChD,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACzI,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5K,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;IACjF,MAAM,IAAI,GAAG,GAAG,SAAS,IAAI,WAAW,EAAE,CAAC;IAC3C,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC1C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACrD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,oBAAoB,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpE,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,cAAc,EAAE,qBAAqB,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC,CAAC;YACrG,8EAA8E;YAC9E,6EAA6E;YAC7E,8EAA8E;YAC9E,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBACxG,OAAO,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;AAErF;;;;;;;;;;;GAWG;AACH,SAAS,2BAA2B,CAAC,EAAU,EAAE,SAAiB;IAChE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,gBAAgB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAChC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACtD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AAyBD;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAa;IAC7C,4EAA4E;IAC5E,wEAAwE;IACxE,iEAAiE;IACjE,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,iBAAiB,EAAE,CAAC;QAC/E,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;IACtC,CAAC;IACD,qEAAqE;IACrE,0EAA0E;IAC1E,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC;IACxE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,4BAA4B,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,SAAS;QAC5B,UAAU,GAAG,IAAI,CAAC;QAClB,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,MAAM,OAAO,GAAG,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBAC5C,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;gBAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,EAAE,GAAG,CAAC,CAAC;YACnF,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,qFAAqF;QACrF,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,QAAQ,IAAI,2BAA2B,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzE,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC/C,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC5B,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,SAAS,EAAE,OAAO,CAAC,KAAK;gBACxB,cAAc,EAAE,IAAI,KAAK,SAAS;gBAClC,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aACvD,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;IAC1D,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CACxB,KAA4B,EAC5B,CAAa;IAEb,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACpC,cAAc,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjE,KAAK,MAAM,CAAC,IAAI,CAAC;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC;oBAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,UAAU,KAAK,aAAa;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAuBD,SAAS,SAAS,CAAC,CAAa;IAC9B,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;IAC/E,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC;IACzC,mEAAmE;IACnE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,WAAW,GAA8B;IAC7C,QAAQ,EAAE,CAAC;IACX,SAAS,EAAE,CAAC;IACZ,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;CACR,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA4B;IAE5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAC9C,CAAC;IACF,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,UAAU,KAAK,aAAa;YAAE,SAAS,CAAC,sBAAsB;QACpE,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,UAAU,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,IAAI,GACR,QAAQ,IAAI,CAAC,CAAC,KAAK,UAAU,IAAI,UAAU,IAAI,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,QAAQ,IAAI,CAAC,KAAK,UAAU;gBAC5B,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CAAC;QACV,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;YACpE,SAAS,EAAE,CAAC;YACZ,UAAU;YACV,SAAS;YACT,oBAAoB,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YACvE,IAAI;SACL,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;QACzB,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACnD,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU;QAC3B,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAC3B,CAAC;IACF,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,yEAAyE;AACzE,8EAA8E;AAE9E,+FAA+F;AAC/F,6FAA6F;AAC7F,4FAA4F;AAC5F,oCAAoC;AAEpC,wEAAwE;AACxE,SAAS,YAAY,CAAC,CAAa,EAAE,KAA4B;IAC/D,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AA8BD;;;;;;;;;;GAUG;AACH,SAAS,UAAU,CAAC,KAA4B;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAC9C,CAAC;IACF,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IAEtC,yFAAyF;IACzF,4FAA4F;IAC5F,MAAM,QAAQ,GAAqB,mBAAmB,CACpD,KAAK,EACL,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,EAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CACZ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACX,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC;YACvE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC;gBAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3E,CAAC;QACD,OAAO;YACL,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC;YACxD,SAAS;YACT,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;SAC9E,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,QAAQ;QACR,cAAc,EAAE,QAAQ,CAAC,MAAM;QAC/B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE;KAC9E,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAA4B;IACrD,OAAO;QACL,GAAG,UAAU,CAAC,KAAK,CAAC;QACpB,YAAY,EAAE,qBAAqB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM;KACtD,CAAC;AACJ,CAAC;AA2BD,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IACtD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA4B;IAChE,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,oDAAoD;IACjF,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,QAAQ;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAoB,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAC,iBAAiB;YACpE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YACxB,IAAI,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC;gBAAE,SAAS,CAAC,8BAA8B;YACvE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAAE,SAAS;YACxC,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC;gBACD,CAAC;gBACD,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC;gBACf,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrD,QAAQ,EAAE,KAAK,KAAK,IAAI;gBACxB,WAAW,EAAE,KAAK;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC;QAC7C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CACzB,CAAC;IACF,OAAO,GAAG,CAAC;AACb,CAAC;AAyCD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAA4B;IAE5B,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,uDAAuD;IACpF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmB,CAAC;IAChD,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAErF,yEAAyE;IACzE,wEAAwE;IACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACzC,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,CAAS,EAAsB,EAAE,CACrD,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,wEAAwE;IACxE,0EAA0E;IAC1E,8BAA8B;IAC9B,MAAM,cAAc,GAAG,CAAC,CAAS,EAAsB,EAAE,CACvD,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3F,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,IAAI,GAA2B,IAAI,CAAC;QACxC,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YACzB,IAAI,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5J,CAAC;aAAM,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YAChC,IAAI,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5J,CAAC;QACD,IAAI,IAAI;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,UAAU,CAAC,IAAI,CACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC;QACxC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,CAAC;QAChD,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAC/C,CAAC;IAEF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAC/B,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAC9D,CAAC;IACF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAClE,OAAO;QACL,UAAU;QACV,aAAa,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM;QAC1D,gBAAgB,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,EAAE;QAC/C,kBAAkB,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;KAC5E,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Bridge-analysis — structural triage signals over the composition graph.\n *\n * INTERNAL (deliberately NOT on the public surface — not re-exported from\n * src/index.ts). A meta/analysis layer, like the catalog adjudicator, that\n * combines the dimensional engine with the graph to PRIORITIZE which\n * speculative bridges are closest to being DECIDABLE against established\n * physics — most anchored to the established core and most checkable.\n *\n * ⚠ This is a TRIAGE ranking (review/confrontation priority), NOT a\n * credibility ranking. The dimensional signals are orthogonal to whether a\n * bridge is true (see docs/research/Bridge-Equation-Dimensional-Audit.md:\n * the established Mercury perihelion is \"unclosable\"; the highly-speculative\n * Hawking-via-r_s derives cleanly). Do not prune, rank, or score the\n * catalog's credibility with this.\n *\n * Three engine signals + one catalog signal:\n *   - grounding   — does the equation re-derive as a recognized monomial\n *                   with a CLEAN dimensionless constant (ln2, 1/4π, √2π)?\n *   - complexity  — free dimensionless parameters (lower = more tractable).\n *   - anchoring   — graph distance to the established-confidence core.\n *   - status / data-confrontation — joined from the catalog (NOT engine).\n *\n * @module composition/bridge-analysis\n */\n\nimport { constantRecord } from '../dimensional/symbolic-constants.js';\nimport { constantRatio, fixedPoint } from '../canonical/fixed-points.js';\nimport { formatRational, rationalize } from './rational-exponent.js';\nimport { buckinghamPi, dimensionallyDetermines } from '../dimensional/buckingham.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { BridgeEdge } from './edge.js';\nimport { formulaShape } from './formula-shape.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { enumerateCompositions } from './enumerate.js';\nimport { DATA_CONFRONTED_IDS } from '../bridges/confrontation-coverage.js';\nimport { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';\n\n/** A fundamental constant the derivation search may add (with SI value). */\ninterface NamedConstant {\n  readonly name: string;\n  readonly dim: Dimension;\n  readonly si: number;\n}\n\n/** ℏ, c, G, k_B, e — the constants the audit/triage may invoke, from the registry. */\n// The constants a canonical or catalog relation bakes: a closure is searched over every subset.\n// `epsilon_0` and `m_e` joined on 2026-10-09, when the canonical entries that spelled them as\n// governing inputs (`vacuum-permittivity`, `electron-mass`) started baking them like every other\n// constant; without them CE-plasma-frequency read as a reconstruction mismatch.\nconst FUNDAMENTAL_CONSTANTS: readonly NamedConstant[] = ['ℏ', 'c', 'G', 'k_B', 'e', 'epsilon_0', 'm_e'].map((name) => {\n  const record = constantRecord(name)!;\n  return { name, dim: record.dim, si: record.value };\n});\n\nfunction subsetsBySize<T>(arr: readonly T[]): T[][] {\n  let out: T[][] = [[]];\n  for (const x of arr) {\n    const n = out.length;\n    for (let i = 0; i < n; i++) out.push([...out[i], x]);\n  }\n  return out.sort((a, b) => a.length - b.length);\n}\n\n/**\n * All 2⁵ = 32 size-ordered subsets of `FUNDAMENTAL_CONSTANTS`, computed once.\n * `dimensionalFreedom` and `attemptDerivation` iterate these on every bridge,\n * and the set is invariant — consumers only read each subset (spread into a\n * `gov` list), never mutate it.\n */\nconst FUNDAMENTAL_CONSTANT_SUBSETS: readonly NamedConstant[][] =\n  subsetsBySize(FUNDAMENTAL_CONSTANTS);\n\n/**\n * Get `m[k]`, inserting `make()` first when absent — replaces the\n * `if (!m.has(k)) m.set(k, …); m.get(k)!` two-step (and its `!` assertion) with\n * one call that returns a non-null value.\n */\nfunction mapGetOrInsert<K, V>(m: Map<K, V>, k: K, make: () => V): V {\n  let v = m.get(k);\n  if (v === undefined) {\n    v = make();\n    m.set(k, v);\n  }\n  return v;\n}\n\ntype DV = { name: string; dim: Dimension };\nconst asVars = (e: BridgeEdge): { target: DV; sources: DV[] } => {\n  const factors = e.formulaFactors ?? {};\n  return {\n    target: { name: e.target.name, dim: e.target.dim },\n    // A dimensionless count is not a Buckingham governor. Folding it in\n    // makes the monomial non-unique and the audit leaves DERIVED.\n    sources: e.sources\n      .filter((s) => factors[s.name] === undefined)\n      .map((s) => ({ name: s.name, dim: s.dim })),\n  };\n};\n\nconst rankOf = (vars: DV[]): number => (vars.length ? buckinghamPi(vars).rank : 0);\nconst inSpan = (t: DV, gov: DV[]): boolean =>\n  gov.length === 0 ? buckinghamPi([t]).rank === 0 : rankOf([t, ...gov]) === rankOf(gov);\n\n/**\n * Free dimensionless parameters: minimal constant subset that puts the\n * target in span, then the leftover π-group count − 1. 0 = a single\n * dimensionless statement (monomial or decoy); k = monomial × F(k ratios).\n */\nexport function dimensionalFreedom(e: BridgeEdge): number {\n  const { target, sources } = asVars(e);\n  for (const S of FUNDAMENTAL_CONSTANT_SUBSETS) {\n    const gov = [...sources, ...S];\n    if (inSpan(target, gov)) return buckinghamPi([target, ...gov]).piGroupCount - 1;\n  }\n  return Infinity;\n}\n\n/**\n * Deterministic, domain-valid input sets with per-source variation.\n *\n * Each magnitude set is tried with every source positive first, then with\n * each single source negated: a domain that holds only for a negative input\n * (a signed charge, a potential below zero) once got positives only and was\n * reported `no-samples` (9.0.0 audit §4 Low). The first sign pattern the\n * domain admits is kept for that magnitude set, so a domain that admits the\n * positives is sampled exactly as before.\n */\nfunction makeInputs(e: BridgeEdge): Array<Record<string, number>> {\n  if (e.sources.length === 0) return [{}];\n  const sets: Array<Record<string, number>> = [];\n  const inDomain = (inp: Record<string, number>): boolean => {\n    try {\n      return e.domain.predicate(inp);\n    } catch {\n      return false;\n    }\n  };\n  const finite = (inp: Record<string, number>): boolean => {\n    try {\n      return Number.isFinite(e.evaluate(inp));\n    } catch {\n      return false;\n    }\n  };\n  for (let j = 0; j < 3; j++) {\n    // Source i takes (1.6 + i)^(1 + 0.27 j): this audit's own scheme, stated here.\n    const magnitudes = fixedPoint(\n      e.sources.map((s) => s.name),\n      1 + 0.27 * j,\n      { base: 1.6, step: 1 },\n    );\n    // A negated source is tried only when the DOMAIN refuses the positive point (a carrier\n    // charge that must be negative). A positive point the domain admits but the evaluator\n    // cannot finish (an exponential that overflows, be-82) is a degenerate sample and not a\n    // reason to look for a sign at which the function happens to be flat: a monomial fitted\n    // on a saturated regime is not a derivation.\n    if (inDomain(magnitudes)) {\n      if (finite(magnitudes)) sets.push(magnitudes);\n      continue;\n    }\n    const negated = e.sources\n      .map((s) => ({ ...magnitudes, [s.name]: -magnitudes[s.name]! }))\n      .find((inp) => inDomain(inp) && finite(inp));\n    if (negated !== undefined) sets.push(negated);\n  }\n  return sets;\n}\n\n/** The denominator cap of a clean rational: the Buckingham enumerator's. */\nconst CLEAN_MAX_DENOMINATOR = 720;\n/** The relative tolerance of a clean hit: the one the derivation fit uses. */\nconst CLEAN_TOLERANCE = 1e-9;\n/** The (a, b) pairs of π^a · ln2^b, the simplest first. */\nconst CLEAN_EXPONENT_PAIRS: readonly (readonly [number, number])[] = (() => {\n  const pairs: [number, number][] = [];\n  for (let a = -2; a <= 2; a++) for (let b = -1; b <= 1; b++) pairs.push([a, b]);\n  pairs.sort((x, y) => Math.abs(x[0]) + Math.abs(x[1]) - (Math.abs(y[0]) + Math.abs(y[1])) || Math.abs(x[0]) - Math.abs(y[0]));\n  return pairs;\n})();\n\n/** `π`, `π²`, `ln 2`, `(ln 2)²`, as a product string. */\nfunction symbolicFactor(a: number, b: number): string {\n  const parts: string[] = [];\n  if (a === 1) parts.push('π');\n  else if (a === 2) parts.push('π²');\n  if (b === 1) parts.push('ln 2');\n  else if (b === 2) parts.push('(ln 2)²');\n  return parts.join(' ');\n}\n\n/** `r = p / (π^a · ln2^b)`, with `p = n/d`, as the exact form string. */\nfunction renderCleanForm(n: bigint, d: bigint, a: number, b: number, root: boolean): string {\n  // Negative exponents put the symbol in the numerator.\n  const numSym = symbolicFactor(a < 0 ? -a : 0, b < 0 ? -b : 0);\n  const denSym = symbolicFactor(a > 0 ? a : 0, b > 0 ? b : 0);\n  const numParts = [...(n === 1n && numSym !== '' ? [] : [n.toString()]), ...(numSym === '' ? [] : [numSym])];\n  const denParts = [...(d === 1n ? [] : [d.toString()]), ...(denSym === '' ? [] : [denSym])];\n  // `2π` stays joined; a number before `ln 2` is spaced (`2 ln 2`), as `π ln 2` is.\n  const join = (parts: readonly string[]): string =>\n    parts.reduce((acc, part) => (acc === '' ? part : part.startsWith('ln') || part.startsWith('(ln') ? `${acc} ${part}` : acc + part), '');\n  const numerator = join(numParts);\n  if (denParts.length === 0) return root ? (numerator === 'π' ? '√π' : /^[0-9]+$/.test(numerator) && numParts.length === 1 ? `√${numerator}` : `√(${numerator})`) : numerator;\n  const denominator = denParts.length === 1 ? denParts[0]! : `(${join(denParts)})`;\n  const form = `${numerator}/${denominator}`;\n  return root ? `√(${form})` : form;\n}\n\n/**\n * The exact form of a clean dimensionless prefactor, or `undefined` when\n * the number is not one. A prefactor `r` is clean when `r = p / (π^a · ln2^b)`\n * for `a ∈ −2..2`, `b ∈ −1..1` and a rational `p` with denominator at most\n * 720, and numerator at most 720, that reproduces it to the relative 1e-9 the\n * derivation fit uses; or\n * when `r²` is, which names `√π`, `√(2π)` and their kin. The simplest\n * `(a, b)` that fits is the one reported, so `2` is `2` and not `2π/π`.\n * The rule replaces a list of seventeen constants matched at 1e-3; `9/8`\n * (be-80) and `π/ln 2` (be-84) were not on it, and `π²/60`, the\n * Stefan–Boltzmann closed form, is a hit under this rule.\n *\n * @internal\n */\nexport function cleanPrefactorForm(p: number): string | undefined {\n  if (!Number.isFinite(p) || p === 0) return undefined;\n  const sign = p < 0 ? '-' : '';\n  const r = Math.abs(p);\n  for (const root of [false, true]) {\n    const value = root ? r * r : r;\n    for (const [a, b] of CLEAN_EXPONENT_PAIRS) {\n      const scaled = value * Math.pow(Math.PI, a) * Math.pow(Math.LN2, b);\n      const q = rationalize(scaled, { maxDenominator: CLEAN_MAX_DENOMINATOR, tolerance: CLEAN_TOLERANCE });\n      // The cap bounds the numerator too. With it free, every integer-valued double\n      // (a G-closure of 3.6e21) is a rational over 1, and 21791/563 reproduced the\n      // BCS ratio 1.7639 to 1e-9 by chance: a small rational has a small numerator.\n      if (q !== undefined && (q.numerator < 0n ? -q.numerator : q.numerator) <= BigInt(CLEAN_MAX_DENOMINATOR)) {\n        return sign + renderCleanForm(q.numerator, q.denominator, a, b, root);\n      }\n    }\n  }\n  return undefined;\n}\n\nconst isCleanPrefactor = (p: number): boolean => cleanPrefactorForm(p) !== undefined;\n\n/**\n * A canonical closure more than ten times away from 1 is not a recovered\n * prefactor. Wien (≈1.265, 2π over the root of a transcendental equation)\n * stays inside that window and keeps the empirical/tuned mark;\n * Stefan–Boltzmann's π²/60 is a clean form under `cleanPrefactorForm`. A\n * G-closure of an atomic law (10^21–10^25) does not pass. A recognized\n * constant (2π, ln 2, 4π, 1/(6π), …) stays even when it sits outside the\n * window. The search includes ε₀, so the\n * field energy density derives on {ε₀} with its sourced ½; the {ℏ, c, e}\n * stand-in it once closed on, μ0 rewritten through α, no longer arises, and\n * the guard that rejected it is gone (it changed no row of either graph).\n */\nfunction recoveredCanonicalPrefactor(id: string, prefactor: number): boolean {\n  if (!id.startsWith('CE-') || isCleanPrefactor(prefactor)) return true;\n  const mag = Math.abs(prefactor);\n  if (!(mag > 0) || !Number.isFinite(mag)) return false;\n  return Math.abs(Math.log10(mag)) <= 1;\n}\n\n/**\n * The outcome of trying to derive a bridge dimensionally + verify it.\n * `not-a-monomial` means the encoded formula adds dimensionful terms, so a\n * monomial reconstruction does not apply. It is not a failed reconstruction.\n */\ntype DerivationStatus =\n  | 'derived'\n  | 'decoy'\n  | 'open'\n  | 'no-samples'\n  | 'not-a-monomial'\n  | 'coefficient-unset';\ninterface DerivationResult {\n  readonly status: DerivationStatus;\n  readonly subset?: readonly string[];\n  readonly monomial?: Readonly<Record<string, number>>;\n  readonly prefactor?: number;\n  /** True when derived AND the prefactor is a recognizable constant. */\n  readonly cleanPrefactor?: boolean;\n  /** The exact form of a clean prefactor (`9/8`, `π/ln 2`); absent when it is not clean. */\n  readonly prefactorForm?: string;\n}\n\n/**\n * Attempt to derive a bridge: the first constant-subset that dimensionally\n * closes the target AND reproduces the evaluator up to a constant ratio.\n */\nexport function attemptDerivation(e: BridgeEdge): DerivationResult {\n  // A sum of dimensionful terms is not a proportionality. The constant search\n  // below would report a decoy, or a derived constant, for a monomial the\n  // formula is not. Proof status is separate and is not read here.\n  if (e.symbolic !== undefined && formulaShape(e.symbolic) === 'dimensional-sum') {\n    return { status: 'not-a-monomial' };\n  }\n  // A missing coefficient is not the constant 1. The evaluator returns\n  // no number, so a ratio against that number is not a recovered prefactor.\n  if (e.coefficientUnset === true) return { status: 'coefficient-unset' };\n  const { target, sources } = asVars(e);\n  const inputs = makeInputs(e);\n  const need = e.sources.length === 0 ? 1 : 2;\n  let anyClosure = false;\n  for (const S of FUNDAMENTAL_CONSTANT_SUBSETS) {\n    const r = dimensionallyDetermines(target, [...sources, ...S]);\n    if (!r.determined) continue;\n    anyClosure = true;\n    if (inputs.length < need) continue;\n    const ratios = inputs.map((i) => {\n      let cand = 1;\n      const factors = e.formulaFactors ?? {};\n      for (const s of e.sources) {\n        if (factors[s.name] !== undefined) continue;\n        cand *= Math.pow(i[s.name], r.monomial![s.name] ?? 0);\n      }\n      for (const k of S) cand *= Math.pow(k.si, r.monomial![k.name] ?? 0);\n      for (const [name, exp] of Object.entries(factors)) cand *= Math.pow(i[name]!, exp);\n      return e.evaluate(i) / cand;\n    });\n    // The coefficient of variation under 1e-9: this audit's own statistic and tolerance.\n    const decided = constantRatio(ratios, 1e-9, { statistic: 'cv' });\n    if (decided.constant && recoveredCanonicalPrefactor(e.id, decided.value)) {\n      const form = cleanPrefactorForm(decided.value);\n      return {\n        status: 'derived',\n        subset: S.map((x) => x.name),\n        monomial: r.monomial,\n        prefactor: decided.value,\n        cleanPrefactor: form !== undefined,\n        ...(form === undefined ? {} : { prefactorForm: form }),\n      };\n    }\n  }\n  if (inputs.length < need) return { status: 'no-samples' };\n  return { status: anyClosure ? 'decoy' : 'open' };\n}\n\n/**\n * Graph distance from a bridge's quantities to the established-confidence\n * core (BFS over quantity co-occurrence). 0 = shares a quantity with an\n * established edge; Infinity = structurally isolated from it. Read by\n * `bridgePriority` only; it was exported with no caller outside this file.\n */\nfunction anchoringDistance(\n  edges: readonly BridgeEdge[],\n  e: BridgeEdge,\n): number {\n  const adj = new Map<string, Set<string>>();\n  const link = (a: string, b: string) => {\n    mapGetOrInsert(adj, a, () => new Set<string>()).add(b);\n  };\n  const core = new Set<string>();\n  for (const edge of edges) {\n    const q = [...edge.sources.map((s) => s.name), edge.target.name];\n    for (const a of q) for (const b of q) if (a !== b) link(a, b);\n    if (edge.confidence === 'established') for (const n of q) core.add(n);\n  }\n  const distOf = new Map<string, number>();\n  const queue = [...core];\n  for (const c of core) distOf.set(c, 0);\n  while (queue.length) {\n    const x = queue.shift()!;\n    for (const y of adj.get(x) ?? []) {\n      if (!distOf.has(y)) {\n        distOf.set(y, distOf.get(x)! + 1);\n        queue.push(y);\n      }\n    }\n  }\n  const qs = [...e.sources.map((s) => s.name), e.target.name];\n  return Math.min(...qs.map((n) => (distOf.has(n) ? distOf.get(n)! : Infinity)));\n}\n\n/** How grounded the equation is, as a structural signal. */\ntype Grounding = 'grounded' | 'empirical' | 'decoy' | 'open';\n/** Review-priority tier (1 = highest structural decidability). */\ntype Tier = 1 | 2 | 3;\n\n/** One bridge's triage profile. */\ninterface BridgePriorityEntry {\n  readonly id: string;\n  readonly beId: number | null;\n  readonly status: string;\n  /** `grounded` (recognized monomial+clean constant) → `open` (multi-param). */\n  readonly grounding: Grounding;\n  /** Free dimensionless parameters (lower = more tractable). */\n  readonly complexity: number;\n  /** Graph distance to the established core (Infinity = isolated). */\n  readonly anchoring: number;\n  /** A committed data confrontation exists (catalog signal, NOT engine). */\n  readonly hasDataConfrontation: boolean;\n  readonly tier: Tier;\n}\n\nfunction grounding(e: BridgeEdge): Grounding {\n  const d = attemptDerivation(e);\n  if (d.status === 'derived') return d.cleanPrefactor ? 'grounded' : 'empirical';\n  if (d.status === 'decoy') return 'decoy';\n  // A dimensional sum has no recognized monomial. It is not a decoy.\n  return 'open';\n}\n\nconst GROUND_RANK: Record<Grounding, number> = {\n  grounded: 0,\n  empirical: 1,\n  decoy: 2,\n  open: 3,\n};\n\n/**\n * Triage the non-established bridges by structural decidability against the\n * established core. Returns profiles sorted best-first (Tier, then anchoring,\n * grounding, complexity). NOT a credibility ranking — see module docstring.\n */\nexport function bridgePriority(\n  edges: readonly BridgeEdge[],\n): BridgePriorityEntry[] {\n  const statusOf = new Map<number, string>(\n    BRIDGE_EQUATIONS.map((b) => [b.id, b.status]),\n  );\n  const entries: BridgePriorityEntry[] = [];\n  for (const e of edges) {\n    if (e.confidence === 'established') continue; // already in the core\n    const g = grounding(e);\n    const complexity = dimensionalFreedom(e);\n    const anchoring = anchoringDistance(edges, e);\n    const anchored = Number.isFinite(anchoring);\n    const tier: Tier =\n      anchored && (g === 'grounded' || complexity <= 1)\n        ? 1\n        : anchored || g === 'grounded'\n          ? 2\n          : 3;\n    entries.push({\n      id: e.id,\n      beId: e.beId,\n      status: e.beId == null ? 'law' : (statusOf.get(e.beId) ?? 'unknown'),\n      grounding: g,\n      complexity,\n      anchoring,\n      hasDataConfrontation: e.beId != null && DATA_CONFRONTED_IDS.has(e.beId),\n      tier,\n    });\n  }\n  entries.sort(\n    (a, b) =>\n      a.tier - b.tier ||\n      a.anchoring - b.anchoring ||\n      GROUND_RANK[a.grounding] - GROUND_RANK[b.grounding] ||\n      a.complexity - b.complexity ||\n      a.id.localeCompare(b.id),\n  );\n  return entries;\n}\n\n// ---------------------------------------------------------------------------\n// Catalog linkage map — how the equations connect via shared quantities.\n// ---------------------------------------------------------------------------\n\n// The quantity-name canonicalizer (`QUANTITY_IDENTIFICATIONS`) and the component partition are\n// `quantity-clusters.ts`, the one owner shared with the visual map and the discovery funnel.\n// NOTE: `anchoringDistance` deliberately does NOT canonicalize — it links on raw names (its\n// distance-0/∞ contract is pinned).\n\n/** An edge's distinct (canonical) quantity names — sources ∪ target. */\nfunction quantitiesOf(e: BridgeEdge, canon: (n: string) => string): string[] {\n  return [...new Set([...e.sources.map((s) => canon(s.name)), canon(e.target.name)])];\n}\n\n/** One connected cluster of equations linked by shared quantities. */\ninterface LinkageCluster {\n  /** Edge ids in this cluster. */\n  readonly edges: readonly string[];\n  readonly size: number;\n  /** Contains an established-confidence edge (anchored to known physics). */\n  readonly anchored: boolean;\n  /** Catalog-status histogram across the cluster's edges. */\n  readonly statusMix: Readonly<Record<string, number>>;\n  /** Quantities that appear in ≥2 of the cluster's edges (the link hubs). */\n  readonly hubs: readonly string[];\n}\n\n/** The catalog's linkage structure. */\ninterface LinkageMap {\n  /** Clusters, largest first. */\n  readonly clusters: readonly LinkageCluster[];\n  readonly componentCount: number;\n  /** Single-edge cluster ids (structurally isolated). */\n  readonly isolated: readonly string[];\n  /** Number of valid pairwise compositions over the edge set (directed links). */\n  readonly compositions: number;\n}\n\n/** The cluster structure WITHOUT the composition count — the cheap core every\n *  linkage consumer except `upt map`'s headline needs. */\ntype ClusterMap = Omit<LinkageMap, 'compositions'>;\n\n/**\n * The cluster structure of the catalog graph: connected components whose nodes\n * are edges and whose links are shared quantities (honoring\n * `QUANTITY_IDENTIFICATIONS`). Reveals a dominant anchored core hubbed on a few\n * quantities, plus thematic clusters and a long isolated tail. A descriptive\n * structural map, NOT a credibility signal (see bridgePriority's caveat).\n *\n * This is the cheap core: it does NOT run the O(E²) pairwise-composition count.\n * The candidate/connector proposers (which never read `.compositions`) call\n * this directly; `linkageMap` adds the count for `upt map`'s headline.\n */\nfunction clusterMap(edges: readonly BridgeEdge[]): ClusterMap {\n  const statusOf = new Map<number, string>(\n    BRIDGE_EQUATIONS.map((b) => [b.id, b.status]),\n  );\n  const canon = quantityCanonicalizer();\n\n  // Edges sharing a (canonical) quantity are one cluster: the shared partition, already in\n  // the order this map always had (largest first, then by first edge id; input order inside).\n  const clusters: LinkageCluster[] = clusterBySharedKeys(\n    edges,\n    (e) => quantitiesOf(e, canon),\n    (e) => e.id,\n  ).map((es) => {\n    const statusMix: Record<string, number> = {};\n    const qcount: Record<string, number> = {};\n    for (const e of es) {\n      const s = e.beId == null ? 'law' : (statusOf.get(e.beId) ?? 'unknown');\n      statusMix[s] = (statusMix[s] ?? 0) + 1;\n      for (const q of quantitiesOf(e, canon)) qcount[q] = (qcount[q] ?? 0) + 1;\n    }\n    return {\n      edges: es.map((e) => e.id),\n      size: es.length,\n      anchored: es.some((e) => e.confidence === 'established'),\n      statusMix,\n      hubs: Object.entries(qcount).filter(([, c]) => c >= 2).map(([q]) => q).sort(),\n    };\n  });\n\n  return {\n    clusters,\n    componentCount: clusters.length,\n    isolated: clusters.filter((c) => c.size === 1).flatMap((c) => c.edges).sort(),\n  };\n}\n\n/**\n * The full linkage map: the {@link clusterMap} structure plus the (O(E²))\n * pairwise-composition count. Only `upt map`'s headline needs the count, so\n * everything else calls `clusterMap` directly. Internal — not on the public\n * surface (mirrors the rest of bridge-analysis).\n */\nexport function linkageMap(edges: readonly BridgeEdge[]): LinkageMap {\n  return {\n    ...clusterMap(edges),\n    compositions: enumerateCompositions(edges).all.length,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Link-candidate proposals — cross-cluster same-dimension quantity pairs.\n// ---------------------------------------------------------------------------\n\n/**\n * A candidate identification surfaced by the linkage map: two quantities in\n * DIFFERENT clusters with the SAME (non-dimensionless) dimension — a\n * potential \"missing link\" of the kind the Hawking-temperature ≡\n * temperature identification was.\n */\nexport interface LinkCandidate {\n  /** Quantity in cluster A. */\n  readonly a: string;\n  /** Quantity in cluster B (a ≠ b; different clusters). */\n  readonly b: string;\n  /** Shared SI dimension (formatted). */\n  readonly dim: string;\n  /** One side is in the anchored (known-physics) cluster. */\n  readonly touchesCore: boolean;\n  /** The names share a word token (same physical KIND, e.g. both `*-mass`). */\n  readonly sameKind: boolean;\n  /** The shared token, when `sameKind`. */\n  readonly sharedToken: string | null;\n}\n\nfunction sharedNameToken(a: string, b: string): string | null {\n  const tb = new Set(b.split('-'));\n  for (const t of a.split('-')) if (tb.has(t)) return t;\n  return null;\n}\n\n/**\n * Propose candidate cross-cluster identifications from the linkage map:\n * every pair of quantities in different clusters that share a\n * non-dimensionless dimension. ⚠ This is a coincidence-heavy REVIEW SURFACE\n * (same dimension is a weak signal — see the dimensional audit's decoy\n * finding), NOT a list of discovered bridges. Ranked: core-touching first,\n * then same-kind. The output's only path is human adjudication\n * (Part-VI §XXVII-B).\n *\n * Internal — not on the public surface.\n */\nexport function proposeLinkCandidates(edges: readonly BridgeEdge[]): LinkCandidate[] {\n  const m = clusterMap(edges); // clusters only — skips the O(E²) composition count\n  const canon = quantityCanonicalizer();\n  const edgeCluster = new Map<string, number>();\n  m.clusters.forEach((c, ci) => c.edges.forEach((id) => edgeCluster.set(id, ci)));\n\n  const qCluster = new Map<string, number>();\n  const qDim = new Map<string, Dimension>();\n  const qAnchored = new Map<string, boolean>();\n  for (const e of edges) {\n    const ci = edgeCluster.get(e.id)!;\n    const anchored = m.clusters[ci].anchored;\n    for (const s of [...e.sources, e.target]) {\n      const n = canon(s.name);\n      qCluster.set(n, ci);\n      qDim.set(n, s.dim);\n      if (anchored) qAnchored.set(n, true);\n    }\n  }\n\n  const names = [...qDim.keys()];\n  const out: LinkCandidate[] = [];\n  for (let i = 0; i < names.length; i++) {\n    for (let j = i + 1; j < names.length; j++) {\n      const a = names[i];\n      const b = names[j];\n      if (qCluster.get(a) === qCluster.get(b)) continue; // already linked\n      const da = qDim.get(a)!;\n      if (equals(da, DIMENSIONLESS)) continue; // dimensionless = too generic\n      if (!equals(da, qDim.get(b)!)) continue;\n      const token = sharedNameToken(a, b);\n      out.push({\n        a,\n        b,\n        dim: format(da),\n        touchesCore: !!(qAnchored.get(a) || qAnchored.get(b)),\n        sameKind: token !== null,\n        sharedToken: token,\n      });\n    }\n  }\n  out.sort(\n    (x, y) =>\n      Number(y.touchesCore) - Number(x.touchesCore) ||\n      Number(y.sameKind) - Number(x.sameKind) ||\n      x.a.localeCompare(y.a) ||\n      x.b.localeCompare(y.b),\n  );\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Orphan connectors — candidate identifications that pull an ISOLATED bridge\n// into the anchored core.\n// ---------------------------------------------------------------------------\n\n/**\n * A candidate identification with ONE endpoint on an isolated (single-edge)\n * bridge and the OTHER on an anchored-cluster bridge — accepting it would\n * connect orphaned physics to the established core.\n */\ninterface OrphanConnector {\n  /** The isolated bridge's edge id (the orphan). */\n  readonly orphanEdge: string;\n  /** The orphan-side quantity. */\n  readonly orphanQuantity: string;\n  /** The core-side quantity it shares a dimension with. */\n  readonly coreQuantity: string;\n  /** An anchored-cluster edge touching `coreQuantity`. */\n  readonly coreEdge: string;\n  /** Shared SI dimension (formatted). */\n  readonly dim: string;\n  /** The two names share a word token. A token is not a verdict. */\n  readonly sameKind: boolean;\n  /** The shared token, when `sameKind`. */\n  readonly sharedToken: string | null;\n}\n\n/** Orphan-connector report. */\ninterface OrphanConnectorReport {\n  /** Connectors, same-kind first then by orphan id. */\n  readonly connectors: readonly OrphanConnector[];\n  /** Of those, how many share a name token. A token is not a verdict. */\n  readonly sameKindCount: number;\n  /** Isolated bridges with ≥1 same-kind connector to the core, sorted. */\n  readonly connectedOrphans: readonly string[];\n  /** Isolated bridges with NO connector at all (truly unconnected), sorted. */\n  readonly unconnectedOrphans: readonly string[];\n}\n\n/**\n * Of the catalog's isolated bridges, which could connect to the anchored core\n * via a same-dimension quantity identification? This intersects\n * `proposeLinkCandidates` with the linkage map's isolated/anchored partition:\n * a connector is a cross-cluster candidate whose one side sits on an isolated\n * bridge and whose other side touches an anchored cluster. The same-kind\n * subset (shared name token) is the least-implausible set worth a physicist's\n * review — the structural frontier of the catalog (the 20 orphaned bridges).\n *\n * ⚠ Same dimension is a WEAK prior (the dimensional audit's decoy finding):\n * most connectors are coincidences (a Förster radius is not a Schwarzschild\n * radius). A REVIEW SURFACE only — Part-VI §XXVII-B. Internal.\n */\nexport function proposeOrphanConnectors(\n  edges: readonly BridgeEdge[],\n): OrphanConnectorReport {\n  const m = clusterMap(edges); // clusters/isolated only — skips the composition count\n  const isolated = new Set(m.isolated);\n  const edgeAnchored = new Map<string, boolean>();\n  m.clusters.forEach((c) => c.edges.forEach((id) => edgeAnchored.set(id, c.anchored)));\n\n  // quantity (raw name) → the edges touching it. Isolated bridges carry no\n  // registered identifications, so raw names suffice for the orphan side.\n  const qToEdges = new Map<string, string[]>();\n  for (const e of edges) {\n    for (const q of [...e.sources, e.target]) {\n      mapGetOrInsert(qToEdges, q.name, () => []).push(e.id);\n    }\n  }\n  const orphanEdgeOf = (q: string): string | undefined =>\n    (qToEdges.get(q) ?? []).find((id) => isolated.has(id));\n  // The core is an anchored cluster of more than one edge. An established\n  // bridge that is itself isolated is an orphan, not the core, so a pair of\n  // orphans is not a connector.\n  const anchoredEdgeOf = (q: string): string | undefined =>\n    (qToEdges.get(q) ?? []).find((id) => edgeAnchored.get(id) === true && !isolated.has(id));\n\n  const connectors: OrphanConnector[] = [];\n  for (const c of proposeLinkCandidates(edges)) {\n    const aOrphan = orphanEdgeOf(c.a);\n    const bOrphan = orphanEdgeOf(c.b);\n    const aAnchored = anchoredEdgeOf(c.a);\n    const bAnchored = anchoredEdgeOf(c.b);\n    let conn: OrphanConnector | null = null;\n    if (aOrphan && bAnchored) {\n      conn = { orphanEdge: aOrphan, orphanQuantity: c.a, coreQuantity: c.b, coreEdge: bAnchored, dim: c.dim, sameKind: c.sameKind, sharedToken: c.sharedToken };\n    } else if (bOrphan && aAnchored) {\n      conn = { orphanEdge: bOrphan, orphanQuantity: c.b, coreQuantity: c.a, coreEdge: aAnchored, dim: c.dim, sameKind: c.sameKind, sharedToken: c.sharedToken };\n    }\n    if (conn) connectors.push(conn);\n  }\n  connectors.sort(\n    (x, y) =>\n      Number(y.sameKind) - Number(x.sameKind) ||\n      x.orphanEdge.localeCompare(y.orphanEdge) ||\n      x.orphanQuantity.localeCompare(y.orphanQuantity) ||\n      x.coreQuantity.localeCompare(y.coreQuantity),\n  );\n\n  const connectedSameKind = new Set(\n    connectors.filter((c) => c.sameKind).map((c) => c.orphanEdge),\n  );\n  const anyConnector = new Set(connectors.map((c) => c.orphanEdge));\n  return {\n    connectors,\n    sameKindCount: connectors.filter((c) => c.sameKind).length,\n    connectedOrphans: [...connectedSameKind].sort(),\n    unconnectedOrphans: m.isolated.filter((id) => !anyConnector.has(id)).sort(),\n  };\n}\n"]}

package/dist/composition/canonical-compare.d.ts

@@ -24,6 +24,24 @@
  */
 import type { Dimension } from '../dimensional/types.js';
 import type { CanonicalEquation } from '../canonical/canonical-equation.js';
+/**
+ * Which exponent differs, when a formula differs in FORM from the canonical
+ * monomial (proposal 4): the fit of `log|yours/canonical|` on the logs of the
+ * variables over a full-rank design. `exponents` are the fitted powers,
+ * replaced by the small rational they stand for when one fits; `exact` is the
+ * rational spelled (`-1`, `1/2`, `0`) or the fitted decimal when none fits.
+ * `r2` is the fit's coefficient of determination: 1 means the ratio IS a
+ * monomial in these variables, below 1 it is not.
+ *
+ * @internal
+ */
+export interface ExponentDifference {
+    readonly exponents: Readonly<Record<string, number>>;
+    readonly exact: Readonly<Record<string, string>>;
+    readonly r2: number;
+    /** True when `r2` is 1 to within 1e-9: the difference is a monomial. */
+    readonly monomial: boolean;
+}
 /** How a user formula compares with one canonical equation. @internal */
 export interface CanonicalComparison {
     readonly id: string;
@@ -33,6 +51,8 @@ export interface CanonicalComparison {
     readonly ratio?: number;
     /** Why the prefactor is unchecked, or why no comparison was made. */
     readonly detail?: string;
+    /** For `form` only: which exponent differs, from a log-design fit. Absent when the fit could not run. */
+    readonly exponentDifference?: ExponentDifference;
     /** `[yours, canonical]` for each variable paired by dimension, not by name (persona finding N1). */
     readonly paired?: readonly (readonly [string, string])[];
     /**
@@ -60,6 +80,26 @@ export type ComparisonSource = string | {
     readonly name: string;
     readonly dim: Dimension;
 };
+/**
+ * Fit `log|ratio|` on the logs of the variables over a full-rank design: the
+ * base point of the comparison scheme, each variable doubled, each variable
+ * quadrupled, and all of them doubled together (2k + 2 rows for k variables,
+ * so a difference that is not a monomial has rows to fail on). The design's
+ * rank is checked before the fit. `undefined` when there is no variable, when
+ * the ratio is zero, negative or not finite at a point, or when the fit
+ * cannot run.
+ *
+ * @internal
+ */
+export declare function diagnoseExponentDifference(names: readonly string[], ratioAt: (point: Readonly<Record<string, number>>) => number): ExponentDifference | undefined;
+/**
+ * One line for an exponent difference: `yours/canonical ∝ mass^-1 (R² = 1):
+ * the difference is a monomial in these variables`. A rational exponent is
+ * braced (`speed^{1/2}`), a unit one is bare, a zero one is omitted.
+ *
+ * @internal
+ */
+export declare function describeExponentDifference(d: ExponentDifference): string;
 /** Compare a user expression against the canonical equations that share its target and source quantities. `evaluateUser` is called only for the user's expression; each canonical value comes from that entry's `scalarAst` or from its registry monomial. */
 export declare function compareWithCanonical(target: string, sources: readonly ComparisonSource[], evaluateUser: (values: Readonly<Record<string, number>>) => number, entries?: readonly CanonicalEquation[], constantOverrides?: Readonly<Record<string, number>>): CanonicalComparison[];
 /**

package/dist/composition/canonical-compare.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-compare.d.ts","sourceRoot":"","sources":["../../src/composition/canonical-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAiC5E,yEAAyE;AACzE,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,qBAAqB,GAAG,cAAc,CAAC;IACrF,mEAAmE;IACnE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,qEAAqE;IACrE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,oGAAoG;IACpG,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;IACzD;;;;OAIG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACvE;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,wGAAwG;AACxG,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAA;CAAE,CAAC;AA8R3F,8PAA8P;AAC9P,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,YAAY,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,EAClE,OAAO,GAAE,SAAS,iBAAiB,EAAwB,EAC3D,iBAAiB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACnD,mBAAmB,EAAE,CA4MvB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAsB,mBAAmB,CACvC,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,GAC7G,OAAO,CAAC,mBAAmB,EAAE,CAAC,CA2DhC;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,SAAS,mBAAmB,EAAE,GAAG,MAAM,EAAE,CAIhF;AAED,qFAAqF;AACrF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uGAAuG;IACvG,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,cAAc,CAAC;CACxC;AAED,qDAAqD;AACrD,UAAU,WAAW;IACnB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,QAAQ,CAAC,OAAO,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAA;KAAE,EAAE,CAAC;IAChF,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;CAChE;AAmCD;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAA;CAAE,GAAG,MAAM,CAAC,EAAE,EAClF,KAAK,GAAE,SAAS,WAAW,EAAkB,GAC5C,gBAAgB,EAAE,CAwBpB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,SAAS,mBAAmB,EAAE,EAC3C,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAA;CAAE,GAAG,MAAM,CAAC,EAAE,EAClF,KAAK,GAAE,SAAS,WAAW,EAAkB,GAC5C,MAAM,EAAE,CAWV;AAED,gDAAgD;AAChD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,mBAAmB,GAAG,MAAM,CAwBjE"}
+{"version":3,"file":"canonical-compare.d.ts","sourceRoot":"","sources":["../../src/composition/canonical-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAiC5E;;;;;;;;;;GAUG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACrD,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED,yEAAyE;AACzE,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,qBAAqB,GAAG,cAAc,CAAC;IACrF,mEAAmE;IACnE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,qEAAqE;IACrE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,yGAAyG;IACzG,QAAQ,CAAC,kBAAkB,CAAC,EAAE,kBAAkB,CAAC;IACjD,oGAAoG;IACpG,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;IACzD;;;;OAIG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACvE;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,wGAAwG;AACxG,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAA;CAAE,CAAC;AA0N3F;;;;;;;;;;GAUG;AACH,wBAAgB,0BAA0B,CACxC,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,OAAO,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAC3D,kBAAkB,GAAG,SAAS,CAoDhC;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,kBAAkB,GAAG,MAAM,CAcxE;AAuED,8PAA8P;AAC9P,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,YAAY,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,EAClE,OAAO,GAAE,SAAS,iBAAiB,EAAwB,EAC3D,iBAAiB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACnD,mBAAmB,EAAE,CAqNvB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAsB,mBAAmB,CACvC,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,EAC3C,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,GAC7G,OAAO,CAAC,mBAAmB,EAAE,CAAC,CA2DhC;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,SAAS,mBAAmB,EAAE,GAAG,MAAM,EAAE,CAIhF;AAED,qFAAqF;AACrF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uGAAuG;IACvG,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,cAAc,CAAC;CACxC;AAED,qDAAqD;AACrD,UAAU,WAAW;IACnB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,QAAQ,CAAC,OAAO,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAA;KAAE,EAAE,CAAC;IAChF,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;CAChE;AAmCD;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAA;CAAE,GAAG,MAAM,CAAC,EAAE,EAClF,KAAK,GAAE,SAAS,WAAW,EAAkB,GAC5C,gBAAgB,EAAE,CAwBpB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,SAAS,mBAAmB,EAAE,EAC3C,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,SAAS,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAA;CAAE,GAAG,MAAM,CAAC,EAAE,EAClF,KAAK,GAAE,SAAS,WAAW,EAAkB,GAC5C,MAAM,EAAE,CAWV;AAED,gDAAgD;AAChD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,mBAAmB,GAAG,MAAM,CAwBjE"}