universal-physics-tensor 11.0.0 → 12.0.0

package/dist/cli/commands/discover.js

@@ -23,7 +23,7 @@ const FLAGS = [
     {
         name: '--derive',
         valueStyle: 'none',
-        description: 'For each promising identification, print the one algebraic relation it implies. That relation is not a bridge.',
+        description: 'For each promising identification (either tier), print the one algebraic relation it implies, and say when the identification had no magnitude evidence. That relation is not a bridge.',
     },
     {
         name: '--show-adjudicated',
@@ -33,7 +33,7 @@ const FLAGS = [
     {
         name: '--require-falsifier',
         valueStyle: 'none',
-        description: 'Hide promising rows that no independent falsifier ran on and survived.',
+        description: 'Hide promising rows (either tier) that no independent falsifier ran on and survived, counted per tier.',
     },
     JSON_FLAG,
 ];
@@ -42,13 +42,24 @@ const HELP = `upt discover [--source=catalog|canonical|both]
         VET the link candidates through the inference suite: hypothesise
         each identification a≡b and test whether it merges disconnected
         physics, unlocks quantities, and stays numerically consistent.
-        Ranks promising / inert / contradictory.
+        Ranks promising / promising, magnitude unchecked / inert / contradictory.
+        A row that merges, unlocks and survives every falsifier that ran is
+        'promising' only when the magnitude falsifier ran on it and could have
+        failed (both endpoints have a representative magnitude, and the ratio
+        is not fixed by the graph at every anchor); otherwise it is 'promising,
+        magnitude unchecked' (promising-unchecked in --json). The two tiers are
+        counted and listed apart and never added.
         --source=canonical runs the funnel on the standard-physics L-layer
         ALONE (bridges excluded) — new candidates from established physics,
         and a self-consistency check (expect 0 contradictory).
-        --derive emits, for each 'promising' identification, the ONE algebraic
-        relation it implies (monomial elimination) as an UNADJUDICATED, math-only
-        proposal — NOT a bridge (Part-VI §XXVII-B). Pairs with --source=canonical.
+        --derive emits, for each promising identification of either tier, the ONE
+        algebraic relation it implies (monomial elimination) as an UNADJUDICATED,
+        math-only proposal — NOT a bridge (Part-VI §XXVII-B), and says when the
+        identification had no magnitude evidence. Pairs with --source=canonical.
+        A magnitude comes from the sourced table, else a constant the graph
+        fixes, else the quantity's own equation evaluated from the table and
+        the constants (used only at a propagated σ of at most one decade),
+        else the anchor; the MAGNITUDE-CLASH list marks the last two.
         --max-orders=N tunes the magnitude-clash threshold (default ${DISCOVER_MAX_ORDERS_DEFAULT}); looser N
         keeps more candidates 'promising', tighter N falsifies more as clashes.
         --anchor=k=v[,k2=v2] overrides the numeric anchor (default mass=M_sun)
@@ -57,20 +68,21 @@ const HELP = `upt discover [--source=catalog|canonical|both]
         kelvin: an energy is k_B T, and any other dimension is an error.
         Candidates a physicist has already adjudicated
         (${ADJUDICATION_URLS})
-        fold out of the PROMISING list by default (decoy/entailed verdicts only —
+        fold out of the two PROMISING lists by default (decoy/entailed verdicts only —
         review memory, not a re-litigation prompt); --show-adjudicated lists them
         again with their recorded verdict.
-        Each PROMISING row states its readiness dimension by dimension —
+        Each row of either PROMISING list states its readiness dimension by dimension —
         structure, kind, which independent falsifiers (magnitude, axis,
         consequence) ran and survived or abstained — and what would make it
         testable: the identity premise, the missing magnitudes and regimes,
         and the observation that would test it. An abstention is a missing
-        test, never a pass. --require-falsifier hides promising rows that no
-        independent falsifier ran on and survived, counts them, and lists the
-        encoded bridges that already carry a falsifier (a confrontation, a
-        counterexample, or a regime inequality).`;
+        test, never a pass. --require-falsifier hides promising rows (either
+        tier) that no independent falsifier ran on and survived, counts them per
+        tier, and lists the encoded bridges that already carry a falsifier (a
+        confrontation, a counterexample, or a regime inequality).`;
 const EPISTEMICS = '⚠ a REVIEW SURFACE: `promising` means "worth a physicist\'s minute", not "true".\n' +
-    '  Each candidate hypothesises an identification a≡b and tests its consequences.';
+    '  Each candidate hypothesises an identification a≡b and tests its consequences.\n' +
+    '  `promising-unchecked` is the same structure with no magnitude evidence; the two are never added.';
 const DERIVE_EPISTEMICS = '⚠ Each is the ALGEBRAIC CONSEQUENCE of an unadjudicated identification — NOT a new\n' +
     '  relation and NOT a bridge. No mechanism asserted. Promotion to the catalog needs\n' +
     '  adversarial + literature review (Part-VI §XXVII-B). The enumerator proposes; humans dispose.';
@@ -121,6 +133,9 @@ function deriveReport(api, ranked, label, anchorLine, out) {
         out(`      ${p.formulaLatex}      ${p.dimensionalSignature}${approx}`);
         out(`      from: ${p.derivedFrom.identification.a} ≟ ${p.derivedFrom.identification.b}` +
             `  (${p.derivedFrom.sourceEquationIds[0]} = ${p.derivedFrom.sourceEquationIds[1]}); solved for ${p.derivedFrom.solvedFor}`);
+        if (!p.derivedFrom.identification.magnitudeEvidence) {
+            out('      magnitude: no evidence — the identification is promising, magnitude unchecked (the magnitude falsifier never tested it)');
+        }
         if (p.alsoDerivableFrom && p.alsoDerivableFrom.length) {
             out(`      also derivable from: ${p.alsoDerivableFrom.join('; ')}`);
         }
@@ -158,7 +173,7 @@ function summarizeAdjudications(candidates) {
 /** The reconciling line printed under PROMISING when some of it carries a
  *  recorded verdict — so the folded/shorter list never looks inconsistent
  *  against the funnel line's raw promising count. */
-function adjudicationSummaryLine(promising, promisingCount) {
+function adjudicationSummaryLine(promising, promisingCount, tierLabel) {
     const adjudicated = promising.filter((r) => r.adjudication);
     const counts = { genuine: 0, decoy: 0, entailed: 0, deferred: 0 };
     let folded = 0;
@@ -175,7 +190,7 @@ function adjudicationSummaryLine(promising, promisingCount) {
     const verb = total === 1 ? 'carries' : 'carry';
     const noun = total === 1 ? 'a recorded verdict' : 'recorded verdicts';
     const foldNote = folded === total ? '— folded' : folded === 0 ? '— shown below' : `— ${folded} folded`;
-    return `  adjudicated: ${total} of the ${promisingCount} promising ${verb} ${noun} (${parts.join(', ')}) ${foldNote}; --show-adjudicated to list`;
+    return `  adjudicated: ${total} of the ${promisingCount} ${tierLabel} ${verb} ${noun} (${parts.join(', ')}) ${foldNote}; --show-adjudicated to list`;
 }
 /** Encoded bridges that already carry a falsifier. Not discovery rows. */
 function encodedFalsifiers(api) {
@@ -198,15 +213,24 @@ function encodedFalsifiers(api) {
     }
     return lines;
 }
-/** How far the `promising` set is from evidence, counted from candidate fields. */
-function readinessOf(api, candidates) {
-    const p = candidates.filter((c) => c.verdict === 'promising');
+/** The two promising tiers, in print order, with the label each is printed under. */
+const TIERS = [
+    { verdict: 'promising', label: 'promising', heading: 'PROMISING (merges disconnected physics, unlocks quantities, stays consistent, and the magnitude falsifier ran and survived):' },
+    {
+        verdict: 'promising-unchecked',
+        label: 'promising, magnitude unchecked',
+        heading: 'PROMISING, MAGNITUDE UNCHECKED (the same structure; the magnitude falsifier abstained or its pass is fixed by the graph at every anchor, so it never tested the row):',
+    },
+];
+/** How far one promising tier is from evidence, counted from candidate fields. */
+function readinessOf(api, candidates, verdict) {
+    const p = candidates.filter((c) => c.verdict === verdict);
     const g = p.map((c) => api.describeGrounding(c, c.consequence?.signal));
     return {
-        promising: p.length,
+        count: p.length,
         mechanismTested: g.filter((x) => x.mechanismTested).length,
         dataTested: g.filter((x) => x.dataTested).length,
-        withoutMagnitudeEvidence: p.filter((c) => !c.magnitudeChecked || c.magnitudeAnchorInvariant === true).length,
+        withoutMagnitudeEvidence: p.filter((c) => !api.hasMagnitudeEvidence(c)).length,
         axisUnresolved: p.filter((c) => !c.axisChecked).length,
         entailedConsequence: p.filter((c) => c.consequence?.signal === 'entailed').length,
     };
@@ -234,7 +258,7 @@ async function run(ctx) {
             }));
         const result = requireFalsifier && !isDerive
             ? mapped.filter((c) => !('readiness' in c) ||
-                c.verdict !== 'promising' ||
+                !api.isPromisingTier(c.verdict) ||
                 c.readiness.falsifiers.survived.length > 0)
             : mapped;
         const envelope = {
@@ -248,7 +272,10 @@ async function run(ctx) {
             ...(isDerive
                 ? {}
                 : {
-                    readiness: readinessOf(api, withConsequence),
+                    readiness: {
+                        promising: readinessOf(api, withConsequence, 'promising'),
+                        promisingUnchecked: readinessOf(api, withConsequence, 'promising-unchecked'),
+                    },
                     adjudicationSummary: summarizeAdjudications(withConsequence),
                 }),
         };
@@ -269,20 +296,18 @@ async function run(ctx) {
         return 0;
     }
     const by = (v) => withConsequence.filter((r) => r.verdict === v);
-    // Q1: within PROMISING, spend the physicist's first minute on consequence-
-    // bearing / magnitude-backed rows before inconclusive + no-magnitude coincidences.
+    // Q1: within each PROMISING tier, spend the physicist's first minute on consequence-bearing
+    // rows before inconclusive coincidences. The magnitude evidence is the tier itself.
     const consRank = (s) => s === 'entailed' ? 0 : s === 'novel-consequence' ? 1 : 2;
-    const promising = [...by('promising')].sort((a, b) => {
+    const tierRows = (verdict) => [...by(verdict)].sort((a, b) => {
         const ca = consRank(a.consequence?.signal);
         const cb = consRank(b.consequence?.signal);
         if (ca !== cb)
             return ca - cb;
-        const magA = a.magnitudeChecked && a.magnitudeAnchorInvariant !== true ? 0 : 1;
-        const magB = b.magnitudeChecked && b.magnitudeAnchorInvariant !== true ? 0 : 1;
-        if (magA !== magB)
-            return magA - magB;
         return b.score - a.score || a.a.localeCompare(b.a) || a.b.localeCompare(b.b);
     });
+    const tiers = TIERS.map((t) => ({ ...t, rows: tierRows(t.verdict), readiness: readinessOf(api, withConsequence, t.verdict) }));
+    const [promising, unchecked] = tiers;
     const inert = by('inert');
     const contra = by('contradictory');
     const clash = by('magnitude-clash');
@@ -291,69 +316,88 @@ async function run(ctx) {
     out(`  ${groundTruthLine(anchor)}`);
     out('⚠ a REVIEW SURFACE: `promising` means "worth a physicist\'s minute", not "true".');
     out('  Each candidate hypothesises an identification a≡b and tests its consequences.\n');
-    out(`  funnel:  ${withConsequence.length} candidates  →  ${promising.length} promising  ` +
+    // The two tiers are two counts, never one sum (AGENTS law 4).
+    out(`  funnel:  ${withConsequence.length} candidates  →  ${promising.rows.length} promising  ` +
+        `·  ${unchecked.rows.length} promising, magnitude unchecked  ` +
         `·  ${inert.length} inert  ·  ${clash.length} magnitude-clash  ` +
         `·  ${contra.length} contradictory (numerically falsified)  ·  ${axisClash.length} axis-clash`);
-    const rd = readinessOf(api, withConsequence);
-    out(`  readiness of the ${rd.promising} promising: ${rd.mechanismTested} mechanism-tested · ` +
-        `${rd.dataTested} data-tested · ${rd.withoutMagnitudeEvidence} without magnitude evidence · ` +
-        `${rd.axisUnresolved} with axis unresolved · ${rd.entailedConsequence} with an entailed consequence`);
+    for (const t of tiers) {
+        const rd = t.readiness;
+        out(`  readiness of the ${rd.count} ${t.label}: ${rd.mechanismTested} mechanism-tested · ` +
+            `${rd.dataTested} data-tested · ${rd.withoutMagnitudeEvidence} without magnitude evidence · ` +
+            `${rd.axisUnresolved} with axis unresolved · ${rd.entailedConsequence} with an entailed consequence`);
+    }
     out('  promising ≠ evidence: promotion to a bridge needs a mechanism and a falsifiable prediction.\n');
     const requireFalsifier = args.flags.has('require-falsifier');
     const untested = (r) => api.describeReadiness(r, r.consequence?.signal).falsifiers.survived.length === 0;
     if (requireFalsifier) {
-        out(`  --require-falsifier: ${promising.filter(untested).length} of the ${promising.length} promising hidden — ` +
-            'no independent falsifier ran and survived (connectivity alone is not evidence)\n');
+        out(`  --require-falsifier: ` +
+            tiers.map((t) => `${t.rows.filter(untested).length} of the ${t.rows.length} ${t.label}`).join(' and ') +
+            ' hidden — no independent falsifier ran and survived (connectivity alone is not evidence)\n');
         const encoded = encodedFalsifiers(api);
         out(`  encoded falsifiers already on the records (${encoded.length}; these are not discovery rows):`);
         for (const line of encoded)
             out(`    ${line}`);
         out('');
     }
-    if (promising.length) {
-        out('  PROMISING (merges disconnected physics, unlocks quantities, stays consistent):');
-        for (const r of promising) {
+    const printRow = (r) => {
+        out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]  score ${r.score}`);
+        out(`        unlocks: ${r.unlocksFromAnchor.join(', ') || '—'}`);
+        if (r.consequence) {
+            out(`        [consequence: ${r.consequence.signal}]`);
+        }
+        const g = api.describeGrounding(r, r.consequence?.signal);
+        out(`        [grounding — passed: ${g.passed.join(', ') || '—'}` +
+            ` · gaps: ${g.gaps.join(', ') || '—'} · ceiling: no mechanism/data test]`);
+        const rd = api.describeReadiness(r, r.consequence?.signal);
+        const f = rd.falsifiers;
+        out(`        [readiness — structure: ${rd.structure.mergesComponents ? 'merges components' : 'no merge'}, ` +
+            `unlocks ${rd.structure.unlocks} · kind: ${rd.kind} · independent falsifiers survived: ` +
+            `${f.survived.join(', ') || 'none'}${f.abstained.length ? ` (abstained: ${f.abstained.join(', ')})` : ''}` +
+            ' · mechanism: none · data: none]');
+        const needs = [
+            ...(rd.needs.magnitudeFor.length ? [`needs a representative magnitude for: ${rd.needs.magnitudeFor.join(', ')}`] : []),
+            ...rd.needs.regimeFor.map((u) => `needs a stated ${u.axis} regime for: ${u.endpoints.join(', ')}`),
+            ...(rd.needs.derivableConsequence ? ['needs a consequence that re-derives a known law'] : []),
+        ];
+        out(`        [to make it testable — premise: ${rd.needs.premise}${needs.map((n) => ` · ${n}`).join('')}]`);
+        out(`        [observation: ${rd.observation}]`);
+        if (r.adjudication) {
+            out(`        [adjudicated: ${r.adjudication.verdict} — ${r.adjudication.grounds}]`);
+        }
+    };
+    for (const t of tiers) {
+        if (t !== promising)
+            out('');
+        if (t.rows.length === 0) {
+            out(t === promising
+                ? '  no candidate is `promising` (with magnitude evidence) from the anchor above.'
+                : '  no candidate is `promising, magnitude unchecked` from the anchor above.');
+            continue;
+        }
+        out(`  ${t.heading}`);
+        for (const r of t.rows) {
             if (r.adjudication && foldsOut(r.adjudication.verdict) && !showAdjudicated)
                 continue;
             if (requireFalsifier && untested(r))
                 continue;
-            out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]  score ${r.score}`);
-            out(`        unlocks: ${r.unlocksFromAnchor.join(', ') || '—'}`);
-            if (r.consequence) {
-                out(`        [consequence: ${r.consequence.signal}]`);
-            }
-            const g = api.describeGrounding(r, r.consequence?.signal);
-            out(`        [grounding — passed: ${g.passed.join(', ') || '—'}` +
-                ` · gaps: ${g.gaps.join(', ') || '—'} · ceiling: no mechanism/data test]`);
-            const rd = api.describeReadiness(r, r.consequence?.signal);
-            const f = rd.falsifiers;
-            out(`        [readiness — structure: ${rd.structure.mergesComponents ? 'merges components' : 'no merge'}, ` +
-                `unlocks ${rd.structure.unlocks} · kind: ${rd.kind} · independent falsifiers survived: ` +
-                `${f.survived.join(', ') || 'none'}${f.abstained.length ? ` (abstained: ${f.abstained.join(', ')})` : ''}` +
-                ' · mechanism: none · data: none]');
-            const needs = [
-                ...(rd.needs.magnitudeFor.length ? [`needs a representative magnitude for: ${rd.needs.magnitudeFor.join(', ')}`] : []),
-                ...rd.needs.regimeFor.map((u) => `needs a stated ${u.axis} regime for: ${u.endpoints.join(', ')}`),
-                ...(rd.needs.derivableConsequence ? ['needs a consequence that re-derives a known law'] : []),
-            ];
-            out(`        [to make it testable — premise: ${rd.needs.premise}${needs.map((n) => ` · ${n}`).join('')}]`);
-            out(`        [observation: ${rd.observation}]`);
-            if (r.adjudication) {
-                out(`        [adjudicated: ${r.adjudication.verdict} — ${r.adjudication.grounds}]`);
-            }
+            printRow(r);
         }
-        if (promising.some((r) => r.adjudication)) {
-            out(adjudicationSummaryLine(promising, promising.length));
+        if (t.rows.some((r) => r.adjudication)) {
+            out(adjudicationSummaryLine(t.rows, t.rows.length, t.label));
         }
     }
-    else {
-        out('  no candidate is `promising` from the anchor above.');
-    }
     if (clash.length) {
         out(`\n  MAGNITUDE-CLASH (representative values differ by > N orders — a falsifier; p is the falsifier's strength ` +
             `at the values' stated σ, 2Φ(−orders/√(σa²+σb²)), not a credibility score):`);
         for (const r of clash) {
-            const basis = r.magnitudeUsedAnchor ? '  (anchor-derived)' : '';
+            // Where each magnitude came from when it was not the sourced table: the quantity's own
+            // equation (not anchor-derived), or the anchor.
+            const bases = [
+                ...((r.magnitudeDerived ?? []).length > 0 ? [`${r.magnitudeDerived.join(', ')} from its own equation`] : []),
+                ...(r.magnitudeUsedAnchor ? ['anchor-derived'] : []),
+            ];
+            const basis = bases.length > 0 ? `  (${bases.join('; ')})` : '';
             // A p that underflows a double is not zero: it is below the smallest normal double.
             const p = r.magnitudeP;
             const strength = p === undefined || p === null ? '' : p === 0 ? ', p < 1e-300' : `, p = ${api.formatQuantity(p, 3)}`;
@@ -380,7 +424,8 @@ async function run(ctx) {
             out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} ${r.axisClashes.join('; ')}`);
         }
     }
-    out('\n  (magnitude gate abstains where a representative value is unknown; weak priors on dimension.)');
+    out('\n  (magnitude gate abstains where a representative value is unknown, and such a row is at most ' +
+        "'promising, magnitude unchecked'; weak priors on dimension.)");
     out(`  (inspect one candidate: upt ground --source=${source} <a> <b>, with the same --anchor/--max-orders)`);
     return 0;
 }
@@ -389,7 +434,7 @@ export const command = {
     aliases: ['discovery'],
     flags: FLAGS,
     help: commandHelp(HELP, FLAGS),
-    summary: 'Vet quantity identifications and rank them promising, inert, or contradictory.',
+    summary: 'Vet quantity identifications and rank them promising (two tiers: magnitude checked or unchecked), inert, or contradictory.',
     example: 'upt discover --source=canonical',
     group: 'discovery',
     run,

package/dist/cli/commands/discover.js.map

@@ -1 +1 @@
-{"version":3,"file":"discover.js","sourceRoot":"","sources":["../../../src/cli/commands/discover.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,eAAe,EAAiC,MAAM,eAAe,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAI1D,OAAO,EAAE,2BAA2B,EAAE,MAAM,wBAAwB,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAa7D,MAAM,KAAK,GAAe;IACxB,UAAU,CAAC,SAAS,EAAE,+EAA+E,CAAC;IACtG;QACE,IAAI,EAAE,cAAc;QACpB,UAAU,EAAE,UAAU;QACtB,WAAW,EAAE,uEAAuE;QACpF,YAAY,EAAE,2BAA2B;KAC1C;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,IAAI;QAChB,WAAW,EAAE,gDAAgD;QAC7D,YAAY,EAAE,YAAY;KAC3B;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,gHAAgH;KAC9H;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,iFAAiF;KAC/F;IACD;QACE,IAAI,EAAE,qBAAqB;QAC3B,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,wEAAwE;KACtF;IACD,SAAS;CACV,CAAC;AAEF,MAAM,iBAAiB,GAAG,sBAAsB,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AAEtE,MAAM,IAAI,GAAG;;;;;;;;;;;sEAWyD,2BAA2B;;;;;;;WAOtF,iBAAiB;;;;;;;;;;;;iDAYqB,CAAC;AAElD,MAAM,UAAU,GACd,oFAAoF;IACpF,iFAAiF,CAAC;AAEpF,MAAM,iBAAiB,GACrB,sFAAsF;IACtF,sFAAsF;IACtF,gGAAgG,CAAC;AAEnG,6EAA6E;AAE7E;;;;;GAKG;AACH,MAAM,eAAe,GAAgE;IACnF,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,yBAAyB,EAAE;CAC/D,CAAC;AACF,SAAS,YAAY,CACnB,GAAsB,EACtB,MAAkC,EAClC,KAAa,EACb,UAAkB,EAClB,GAA4B;IAE5B,MAAM,SAAS,GAAG,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;IACpD,GAAG,CAAC,iFAAiF,KAAK,GAAG,CAAC,CAAC;IAC/F,GAAG,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;IACvB,GAAG,CAAC,iBAAiB,GAAG,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,GAAG,CAAC,qFAAqF,CAAC,CAAC;QAC3F,OAAO;IACT,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,GAAG,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC;QAC5F,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3F,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,kCAAkC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC;QAClF,CAAC;aAAM,CAAC;YACN,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzF,MAAM,EAAE,GAAG,SAAS;qBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,MAAM,GAAG,CAAC;qBAChF,IAAI,CAAC,IAAI,CAAC,CAAC;gBACd,MAAM,GAAG,OAAO,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YAChF,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,yFAAyF;gBACzF,mGAAmG;gBACnG,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC;oBAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,GAAG,0CAA0C,CAAC,CAAC,OAAO,GAAG,CAAC;YAClE,CAAC;QACH,CAAC;QACD,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjB,GAAG,CAAC,SAAS,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC,oBAAoB,GAAG,MAAM,EAAE,CAAC,CAAC;QACvE,GAAG,CACD,eAAe,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE;YACjF,MAAM,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAC7H,CAAC;QACF,IAAI,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;YACtD,GAAG,CAAC,8BAA8B,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QACtC,GAAG,CACD,CAAC,CAAC,QAAQ,KAAK,WAAW;YACxB,CAAC,CAAC,wCAAwC,CAAC,CAAC,cAAc,CAAC,EAAE,wBAAwB,CAAC,CAAC,OAAO,yBAAyB;YACvH,CAAC,CAAC,sDAAsD,CAAC,CAAC,OAAO,4BAA4B,CAChG,CAAC;QACF,GAAG,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1C,GAAG,CACD,8BAA8B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACnI,CAAC;QACF,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACtE,GAAG,CACD,0BAA0B,CAAC,CAAC,cAAc,CAAC,EAAE,IAAI,MAAM,MAAM,CAAC,CAAC,cAAc,CAAC,UAAU,+BAA+B;YACrH,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,cAAc,CAAC,sBAAsB,mBAAmB,YAAY,IAAI;YAC/F,iDAAiD,CACpD,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,EAAE,CAAC,CAAC;AACV,CAAC;AAED;;iEAEiE;AACjE,SAAS,QAAQ,CAAC,OAA4B;IAC5C,OAAO,OAAO,KAAK,OAAO,IAAI,OAAO,KAAK,UAAU,CAAC;AACvD,CAAC;AAED;wEACwE;AACxE,SAAS,sBAAsB,CAC7B,UAAyC;IAEzC,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAC7E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,YAAY;YAAE,SAAS;QAC9B,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;IACpC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;qDAEqD;AACrD,SAAS,uBAAuB,CAAC,SAAwC,EAAE,cAAsB;IAC/F,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAClE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,YAAa,CAAC,OAAO,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACZ,IAAI,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IACD,MAAM,KAAK,GAAI,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAW;SAClE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;IACjC,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;IAC/C,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC;IACtE,MAAM,QAAQ,GAAG,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,MAAM,SAAS,CAAC;IACvG,OAAO,kBAAkB,KAAK,WAAW,cAAc,cAAc,IAAI,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,8BAA8B,CAAC;AACpJ,CAAC;AAWD,0EAA0E;AAC1E,SAAS,iBAAiB,CAAC,GAAsB;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC;YAC1C,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;gBAAE,SAAS;YACrC,MAAM,IAAI,GAAG;gBACX,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,kBAAkB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC1D,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,oBAAoB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;aACtE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,mFAAmF;AACnF,SAAS,WAAW,CAAC,GAAsB,EAAE,UAA8C;IACzF,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC;IAC9D,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC;IACxE,OAAO;QACL,SAAS,EAAE,CAAC,CAAC,MAAM;QACnB,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,MAAM;QAC1D,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM;QAChD,wBAAwB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI,CAAC,CAAC,MAAM;QAC5G,cAAc,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM;QACtD,mBAAmB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM;KAClF,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,GAAG,CAAC,GAAe;IAChC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAC/B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAE,EAA2B,CAAC,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC9F,MAAM,eAAe,GAAuC,QAAQ;QAClE,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAE3D,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,QAAQ;YACrB,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9F,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1B,GAAG,CAAC;gBACJ,SAAS,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC;gBAC1D,SAAS,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC;aAC3D,CAAC,CAAC,CAAC;QACR,MAAM,MAAM,GACV,gBAAgB,IAAI,CAAC,QAAQ;YAC3B,CAAC,CAAC,MAAM,CAAC,MAAM,CACX,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;gBACnB,CAAC,CAAC,OAAO,KAAK,WAAW;gBACzB,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAC7C;YACH,CAAC,CAAC,MAAM,CAAC;QACb,MAAM,QAAQ,GAAG;YACf,OAAO,EAAE,UAAU;YACnB,MAAM;YACN,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE;YAC/B,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE;YACpB,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU;YACrD,MAAM;YACN,GAAG,CAAC,gBAAgB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvF,GAAG,CAAC,QAAQ;gBACV,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,SAAS,EAAE,WAAW,CAAC,GAAG,EAAE,eAAe,CAAC;oBAC5C,mBAAmB,EAAE,sBAAsB,CAAC,eAAe,CAAC;iBAC7D,CAAC;SACP,CAAC;QACF,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,oBAAoB,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAClG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpG,CAAC;QACD,GAAG,CAAC,yBAAyB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,QAAQ,EAAE,CAAC;QACb,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;IACzE,2EAA2E;IAC3E,mFAAmF;IACnF,MAAM,QAAQ,GAAG,CAAC,CAAgC,EAAU,EAAE,CAC5D,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnD,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,IAAI,GAAG,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC;QACtC,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;IACnC,GAAG,CAAC,8EAA8E,KAAK,GAAG,CAAC,CAAC;IAC5F,GAAG,CAAC,KAAK,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpC,GAAG,CAAC,kFAAkF,CAAC,CAAC;IACxF,GAAG,CAAC,mFAAmF,CAAC,CAAC;IACzF,GAAG,CACD,cAAc,eAAe,CAAC,MAAM,mBAAmB,SAAS,CAAC,MAAM,cAAc;QACnF,MAAM,KAAK,CAAC,MAAM,cAAc,KAAK,CAAC,MAAM,oBAAoB;QAChE,MAAM,MAAM,CAAC,MAAM,8CAA8C,SAAS,CAAC,MAAM,aAAa,CACjG,CAAC;IACF,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC;IAC7C,GAAG,CACD,sBAAsB,EAAE,CAAC,SAAS,eAAe,EAAE,CAAC,eAAe,sBAAsB;QACvF,GAAG,EAAE,CAAC,UAAU,kBAAkB,EAAE,CAAC,wBAAwB,gCAAgC;QAC7F,GAAG,EAAE,CAAC,cAAc,2BAA2B,EAAE,CAAC,mBAAmB,+BAA+B,CACvG,CAAC;IACF,GAAG,CAAC,iGAAiG,CAAC,CAAC;IACvG,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,CAAC,CAA0B,EAAE,EAAE,CAC9C,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACnF,IAAI,gBAAgB,EAAE,CAAC;QACrB,GAAG,CACD,0BAA0B,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,WAAW,SAAS,CAAC,MAAM,sBAAsB;YAC1G,kFAAkF,CACrF,CAAC;QACF,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACvC,GAAG,CAAC,gDAAgD,OAAO,CAAC,MAAM,kCAAkC,CAAC,CAAC;QACtG,KAAK,MAAM,IAAI,IAAI,OAAO;YAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QAC/C,GAAG,CAAC,EAAE,CAAC,CAAC;IACV,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACrB,GAAG,CAAC,kFAAkF,CAAC,CAAC;QACxF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,YAAY,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe;gBAAE,SAAS;YACrF,IAAI,gBAAgB,IAAI,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC9C,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1E,GAAG,CAAC,oBAAoB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;YACjE,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAClB,GAAG,CAAC,yBAAyB,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YACxD,CAAC;YACD,MAAM,CAAC,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YAC1D,GAAG,CACD,gCAAgC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE;gBAC1D,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,qCAAqC,CAC5E,CAAC;YACF,MAAM,EAAE,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YAC3D,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC;YACxB,GAAG,CACD,mCAAmC,EAAE,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,IAAI;gBACrG,WAAW,EAAE,CAAC,SAAS,CAAC,OAAO,YAAY,EAAE,CAAC,IAAI,sCAAsC;gBACxF,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC1G,kCAAkC,CACrC,CAAC;YACF,MAAM,KAAK,GAAG;gBACZ,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,yCAAyC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtH,GAAG,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,iDAAiD,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aAC9F,CAAC;YACF,GAAG,CAAC,2CAA2C,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAC3G,GAAG,CAAC,yBAAyB,EAAE,CAAC,WAAW,GAAG,CAAC,CAAC;YAChD,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACnB,GAAG,CAAC,yBAAyB,CAAC,CAAC,YAAY,CAAC,OAAO,MAAM,CAAC,CAAC,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;QACD,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,uBAAuB,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,sDAAsD,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,GAAG,CACD,+GAA+G;YAC7G,4EAA4E,CAC/E,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,oFAAoF;YACpF,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;YACvB,MAAM,QAAQ,GACZ,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACtG,yEAAyE;YACzE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,WAAY,EAAE,CAAC,CAAC,gBAAgB,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;QACzH,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClD,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpB,GAAG,CAAC,iFAAiF,CAAC,CAAC;QACvF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClB,GAAG,CAAC,sEAAsE,CAAC,CAAC;QAC5E,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtG,CAAC;IACH,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACrB,GAAG,CAAC,+FAA+F,CAAC,CAAC;QACrG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,GAAG,CAAC,kGAAkG,CAAC,CAAC;IACxG,GAAG,CAAC,iDAAiD,MAAM,gDAAgD,CAAC,CAAC;IAC7G,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,CAAC,MAAM,OAAO,GAAY;IAC9B,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,CAAC,WAAW,CAAC;IACtB,KAAK,EAAE,KAAK;IACZ,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC;IAC9B,OAAO,EAAE,gFAAgF;IACzF,OAAO,EAAE,iCAAiC;IAC1C,KAAK,EAAE,WAAW;IAClB,GAAG;CACJ,CAAC;AAEF,eAAe,CAAC,OAAO,CAAC,CAAC","sourcesContent":["/**\n * `upt discover` — vet the link candidates through the inference suite, and\n * (with `--derive`) emit the algebraic identity-consequence proposals.\n * Transposed verbatim from bin/upt.mjs's `parseDiscoveryOpts()`/`discoverCmd()`/\n * `deriveCmd()` (lines 592-713), plus `--json`. `parseDiscoveryOpts` itself\n * moved to `_discovery-opts.ts` so `map`'s `--proposed` overlay can share it.\n */\nimport type { FlagSpec } from '../args.js';\nimport { registerCommand, type Command, type CommandCtx } from '../command.js';\nimport { commandHelp, JSON_FLAG, sourceFlag } from '../flag-help.js';\nimport { resolveGraph, groundTruthAnchor, groundTruthLine } from '../graphs.js';\nimport { emitJson } from '../output.js';\nimport { parseDiscoveryOpts } from './_discovery-opts.js';\nimport type { VettedCandidate } from '../../composition/discovery.js';\nimport type { AnnotatedCandidate } from '../../composition/adjudication.js';\nimport type { AdjudicationVerdict } from '../../bridges/catalog-types.js';\nimport { DISCOVER_MAX_ORDERS_DEFAULT } from '../library-defaults.js';\nimport { adjudicationSourceUrls } from '../published-url.js';\nimport type { ConsequenceSignal, ConsequenceEvidence } from '../../composition/consequence.js';\n\n/** `annotated` (adjudication layer) composed with the consequence layer —\n *  both are `VettedCandidate & {...}` intersections, so a candidate carries\n *  both `adjudication?` and `consequence?` after composition. */\ntype FullyAnnotatedCandidate = AnnotatedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\nconst FLAGS: FlagSpec[] = [\n  sourceFlag('catalog', 'Which graph to read: catalog, canonical, or both. canonical excludes bridges.'),\n  {\n    name: '--max-orders',\n    valueStyle: 'attached',\n    description: 'Magnitude-clash threshold. A larger value keeps more pairs promising.',\n    defaultValue: DISCOVER_MAX_ORDERS_DEFAULT,\n  },\n  {\n    name: '--anchor',\n    valueStyle: 'attached',\n    repeatable: true,\n    description: 'Override a numeric anchor as k=v or k=v,k2=v2.',\n    defaultValue: 'mass=M_sun',\n  },\n  {\n    name: '--derive',\n    valueStyle: 'none',\n    description: 'For each promising identification, print the one algebraic relation it implies. That relation is not a bridge.',\n  },\n  {\n    name: '--show-adjudicated',\n    valueStyle: 'none',\n    description: 'List candidates a physicist has already adjudicated, with the recorded verdict.',\n  },\n  {\n    name: '--require-falsifier',\n    valueStyle: 'none',\n    description: 'Hide promising rows that no independent falsifier ran on and survived.',\n  },\n  JSON_FLAG,\n];\n\nconst ADJUDICATION_URLS = adjudicationSourceUrls().join('\\n        ');\n\nconst HELP = `upt discover [--source=catalog|canonical|both]\n        VET the link candidates through the inference suite: hypothesise\n        each identification a≡b and test whether it merges disconnected\n        physics, unlocks quantities, and stays numerically consistent.\n        Ranks promising / inert / contradictory.\n        --source=canonical runs the funnel on the standard-physics L-layer\n        ALONE (bridges excluded) — new candidates from established physics,\n        and a self-consistency check (expect 0 contradictory).\n        --derive emits, for each 'promising' identification, the ONE algebraic\n        relation it implies (monomial elimination) as an UNADJUDICATED, math-only\n        proposal — NOT a bridge (Part-VI §XXVII-B). Pairs with --source=canonical.\n        --max-orders=N tunes the magnitude-clash threshold (default ${DISCOVER_MAX_ORDERS_DEFAULT}); looser N\n        keeps more candidates 'promising', tighter N falsifies more as clashes.\n        --anchor=k=v[,k2=v2] overrides the numeric anchor (default mass=M_sun)\n        for the consistency/closure check. Both reshape the candidate pool that\n        --derive consumes. T, temperature, temp, and T_K on an anchor are\n        kelvin: an energy is k_B T, and any other dimension is an error.\n        Candidates a physicist has already adjudicated\n        (${ADJUDICATION_URLS})\n        fold out of the PROMISING list by default (decoy/entailed verdicts only —\n        review memory, not a re-litigation prompt); --show-adjudicated lists them\n        again with their recorded verdict.\n        Each PROMISING row states its readiness dimension by dimension —\n        structure, kind, which independent falsifiers (magnitude, axis,\n        consequence) ran and survived or abstained — and what would make it\n        testable: the identity premise, the missing magnitudes and regimes,\n        and the observation that would test it. An abstention is a missing\n        test, never a pass. --require-falsifier hides promising rows that no\n        independent falsifier ran on and survived, counts them, and lists the\n        encoded bridges that already carry a falsifier (a confrontation, a\n        counterexample, or a regime inequality).`;\n\nconst EPISTEMICS =\n  '⚠ a REVIEW SURFACE: `promising` means \"worth a physicist\\'s minute\", not \"true\".\\n' +\n  '  Each candidate hypothesises an identification a≡b and tests its consequences.';\n\nconst DERIVE_EPISTEMICS =\n  '⚠ Each is the ALGEBRAIC CONSEQUENCE of an unadjudicated identification — NOT a new\\n' +\n  '  relation and NOT a bridge. No mechanism asserted. Promotion to the catalog needs\\n' +\n  '  adversarial + literature review (Part-VI §XXVII-B). The enumerator proposes; humans dispose.';\n\n// ── discover --derive (identity-consequence proposals) ────────────────────\n\n/**\n * Sample values for GENERIC quantities, which the representative-value table\n * leaves out on purpose. A proposal is evaluated only when every free input\n * has a sourced sample: this command once put 300 into every input, a Hubble\n * rate of 300 s⁻¹ among them (persona finding D5).\n */\nconst GENERIC_SAMPLES: Readonly<Record<string, { value: number; source: string }>> = {\n  temperature: { value: 300, source: 'room temperature, 300 K' },\n};\nfunction deriveReport(\n  api: CommandCtx['api'],\n  ranked: readonly VettedCandidate[],\n  label: string,\n  anchorLine: string,\n  out: (line?: string) => void\n): void {\n  const proposals = api.deriveProposedBridges(ranked);\n  out(`\\nDerived identity-consequence PROPOSALS — UNADJUDICATED, math-only  [source: ${label}]`);\n  out(`  ${anchorLine}`);\n  out(DERIVE_EPISTEMICS + '\\n');\n  if (!proposals.length) {\n    out('  no admissible proposal (need two fully-quantitative, monomial canonical targets).');\n    return;\n  }\n  for (const p of proposals) {\n    let approx = '';\n    const governing = p.governing || [];\n    const sampleOf = (name: string) => api.REPRESENTATIVE_VALUES[name] ?? GENERIC_SAMPLES[name];\n    const missing = governing.filter((g) => sampleOf(g.name) === undefined).map((g) => g.name);\n    if (missing.length > 0) {\n      approx = `  (no sourced sample value for ${missing.join(', ')}; not evaluated)`;\n    } else {\n      try {\n        const vals = Object.fromEntries(governing.map((g) => [g.name, sampleOf(g.name)!.value]));\n        const at = governing\n          .map((g) => `${g.name}=${sampleOf(g.name)!.value} [${sampleOf(g.name)!.source}]`)\n          .join(', ');\n        approx = `  ≈ ${api.formatQuantity(p.evaluate(vals))}${at ? ` (${at})` : ''}`;\n      } catch (e) {\n        // A proposal that cannot be evaluated at its samples says so and why; it is not shown as\n        // though it had no sample. Only an `Error` is a refusal of the formula: anything else is a defect.\n        if (!(e instanceof Error)) throw e;\n        approx = `  (not evaluated at the sample values: ${e.message})`;\n      }\n    }\n    out(`  ${p.id}`);\n    out(`      ${p.formulaLatex}      ${p.dimensionalSignature}${approx}`);\n    out(\n      `      from: ${p.derivedFrom.identification.a} ≟ ${p.derivedFrom.identification.b}` +\n        `  (${p.derivedFrom.sourceEquationIds[0]} = ${p.derivedFrom.sourceEquationIds[1]}); solved for ${p.derivedFrom.solvedFor}`\n    );\n    if (p.alsoDerivableFrom && p.alsoDerivableFrom.length) {\n      out(`      also derivable from: ${p.alsoDerivableFrom.join('; ')}`);\n    }\n    const c = api.describeDerivedClaim(p);\n    out(\n      c.relation === 'known-law'\n        ? `      status: known law — re-derives ${c.canonicalMatch.id}; the identification ${c.premise} is still unadjudicated`\n        : `      status: conditional identity — holds only if ${c.premise} (unadjudicated); untested`,\n    );\n    out(`      meaning: ${c.symbol.meaning}`);\n    out(\n      `      assumptions carried: ${c.assumptions.map((a) => `${a.equation}: ${a.assumptions.join(', ') || 'none stated'}`).join('; ')}`,\n    );\n    const governingSet = `{${p.governing.map((g) => g.name).join(', ')}}`;\n    out(\n      `      canonical match: ${c.canonicalMatch.id ?? 'none'} — ${c.canonicalMatch.sameTarget} registry equation(s) target ` +\n        `${p.target.name}, ${c.canonicalMatch.sameTargetAndGoverning} with governing ${governingSet}; ` +\n        'scope: this registry only, not physics at large',\n    );\n  }\n  out('');\n}\n\n/** Verdicts that fold a candidate out of the printed PROMISING list by\n *  default — review memory, not news. `deferred`/`genuine` stay listed\n *  (see the module-level docstring on `AdjudicationVerdict`). */\nfunction foldsOut(verdict: AdjudicationVerdict): boolean {\n  return verdict === 'decoy' || verdict === 'entailed';\n}\n\n/** Tally an annotated candidate set's recorded verdicts, for `--json`'s\n *  `adjudicationSummary` (over ALL candidates, every funnel bucket). */\nfunction summarizeAdjudications(\n  candidates: readonly AnnotatedCandidate[]\n): { total: number; genuine: number; decoy: number; entailed: number; deferred: number } {\n  const summary = { total: 0, genuine: 0, decoy: 0, entailed: 0, deferred: 0 };\n  for (const c of candidates) {\n    if (!c.adjudication) continue;\n    summary.total++;\n    summary[c.adjudication.verdict]++;\n  }\n  return summary;\n}\n\n/** The reconciling line printed under PROMISING when some of it carries a\n *  recorded verdict — so the folded/shorter list never looks inconsistent\n *  against the funnel line's raw promising count. */\nfunction adjudicationSummaryLine(promising: readonly AnnotatedCandidate[], promisingCount: number): string {\n  const adjudicated = promising.filter((r) => r.adjudication);\n  const counts = { genuine: 0, decoy: 0, entailed: 0, deferred: 0 };\n  let folded = 0;\n  for (const r of adjudicated) {\n    const v = r.adjudication!.verdict;\n    counts[v]++;\n    if (foldsOut(v)) folded++;\n  }\n  const parts = (['decoy', 'entailed', 'deferred', 'genuine'] as const)\n    .filter((v) => counts[v] > 0)\n    .map((v) => `${counts[v]} ${v}`);\n  const total = adjudicated.length;\n  const verb = total === 1 ? 'carries' : 'carry';\n  const noun = total === 1 ? 'a recorded verdict' : 'recorded verdicts';\n  const foldNote = folded === total ? '— folded' : folded === 0 ? '— shown below' : `— ${folded} folded`;\n  return `  adjudicated: ${total} of the ${promisingCount} promising ${verb} ${noun} (${parts.join(', ')}) ${foldNote}; --show-adjudicated to list`;\n}\n\ninterface Readiness {\n  promising: number;\n  mechanismTested: number;\n  dataTested: number;\n  withoutMagnitudeEvidence: number;\n  axisUnresolved: number;\n  entailedConsequence: number;\n}\n\n/** Encoded bridges that already carry a falsifier. Not discovery rows. */\nfunction encodedFalsifiers(api: CommandCtx['api']): readonly string[] {\n  const lines: string[] = [];\n  for (const id of [...api.CONFRONTATIONS.keys()].sort((a, b) => a - b)) {\n    lines.push(`be-${id} (confrontation)`);\n  }\n  for (const f of api.ATLAS_FAMILIES) {\n    for (const b of f.bridges) {\n      const cx = b.counterexamples.length;\n      const ineq = b.regime.inequalities.length;\n      if (cx === 0 && ineq === 0) continue;\n      const bits = [\n        cx > 0 ? `${cx} counterexample${cx === 1 ? '' : 's'}` : '',\n        ineq > 0 ? `${ineq} regime inequalit${ineq === 1 ? 'y' : 'ies'}` : '',\n      ].filter((s) => s !== '');\n      lines.push(`${b.id} (${bits.join(', ')})`);\n    }\n  }\n  return lines;\n}\n\n/** How far the `promising` set is from evidence, counted from candidate fields. */\nfunction readinessOf(api: CommandCtx['api'], candidates: readonly FullyAnnotatedCandidate[]): Readiness {\n  const p = candidates.filter((c) => c.verdict === 'promising');\n  const g = p.map((c) => api.describeGrounding(c, c.consequence?.signal));\n  return {\n    promising: p.length,\n    mechanismTested: g.filter((x) => x.mechanismTested).length,\n    dataTested: g.filter((x) => x.dataTested).length,\n    withoutMagnitudeEvidence: p.filter((c) => !c.magnitudeChecked || c.magnitudeAnchorInvariant === true).length,\n    axisUnresolved: p.filter((c) => !c.axisChecked).length,\n    entailedConsequence: p.filter((c) => c.consequence?.signal === 'entailed').length,\n  };\n}\n\nasync function run(ctx: CommandCtx): Promise<number> {\n  const { args, api, out } = ctx;\n  const { graph, label, source } = resolveGraph(api, args.flags);\n  const opts = parseDiscoveryOpts(api, args.flags);\n  const anchor = groundTruthAnchor(api, opts);\n  const ranked = api.rankDiscoveries(graph, opts);\n  const isDerive = args.flags.has('derive');\n  const annotated = isDerive ? ([] as AnnotatedCandidate[]) : api.annotateAdjudications(ranked);\n  const withConsequence: readonly FullyAnnotatedCandidate[] = isDerive\n    ? []\n    : api.annotateConsequences(annotated);\n  const showAdjudicated = args.flags.has('show-adjudicated');\n\n  if (args.flags.has('json')) {\n    const requireFalsifier = args.flags.has('require-falsifier');\n    const mapped = isDerive\n      ? api.deriveProposedBridges(ranked).map((p) => ({ ...p, claim: api.describeDerivedClaim(p) }))\n      : withConsequence.map((c) => ({\n          ...c,\n          grounding: api.describeGrounding(c, c.consequence?.signal),\n          readiness: api.describeReadiness(c, c.consequence?.signal),\n        }));\n    const result =\n      requireFalsifier && !isDerive\n        ? mapped.filter(\n            (c) =>\n              !('readiness' in c) ||\n              c.verdict !== 'promising' ||\n              c.readiness.falsifiers.survived.length > 0,\n          )\n        : mapped;\n    const envelope = {\n      command: 'discover',\n      source,\n      anchor: { groundTruth: anchor },\n      options: { ...opts },\n      epistemics: isDerive ? DERIVE_EPISTEMICS : EPISTEMICS,\n      result,\n      ...(requireFalsifier && !isDerive ? { encodedFalsifiers: encodedFalsifiers(api) } : {}),\n      ...(isDerive\n        ? {}\n        : {\n            readiness: readinessOf(api, withConsequence),\n            adjudicationSummary: summarizeAdjudications(withConsequence),\n          }),\n    };\n    emitJson(envelope, ctx.write);\n    return 0;\n  }\n\n  if (Object.keys(opts).length) {\n    const bits: string[] = [];\n    if (opts.maxOrdersOfMagnitude !== undefined) bits.push(`max-orders=${opts.maxOrdersOfMagnitude}`);\n    if (opts.groundTruth) {\n      bits.push(`anchor={${Object.entries(opts.groundTruth).map(([k, v]) => `${k}=${v}`).join(', ')}}`);\n    }\n    out(`  [discovery options: ${bits.join('; ')}]`);\n  }\n\n  if (isDerive) {\n    deriveReport(api, ranked, label, groundTruthLine(anchor), out);\n    return 0;\n  }\n\n  const by = (v: string) => withConsequence.filter((r) => r.verdict === v);\n  // Q1: within PROMISING, spend the physicist's first minute on consequence-\n  // bearing / magnitude-backed rows before inconclusive + no-magnitude coincidences.\n  const consRank = (s: ConsequenceSignal | undefined): number =>\n    s === 'entailed' ? 0 : s === 'novel-consequence' ? 1 : 2;\n  const promising = [...by('promising')].sort((a, b) => {\n    const ca = consRank(a.consequence?.signal);\n    const cb = consRank(b.consequence?.signal);\n    if (ca !== cb) return ca - cb;\n    const magA = a.magnitudeChecked && a.magnitudeAnchorInvariant !== true ? 0 : 1;\n    const magB = b.magnitudeChecked && b.magnitudeAnchorInvariant !== true ? 0 : 1;\n    if (magA !== magB) return magA - magB;\n    return b.score - a.score || a.a.localeCompare(b.a) || a.b.localeCompare(b.b);\n  });\n  const inert = by('inert');\n  const contra = by('contradictory');\n  const clash = by('magnitude-clash');\n  const axisClash = by('axis-clash');\n  out(`\\nDiscovery — link candidates VETTED through the inference suite  [source: ${label}]`);\n  out(`  ${groundTruthLine(anchor)}`);\n  out('⚠ a REVIEW SURFACE: `promising` means \"worth a physicist\\'s minute\", not \"true\".');\n  out('  Each candidate hypothesises an identification a≡b and tests its consequences.\\n');\n  out(\n    `  funnel:  ${withConsequence.length} candidates  →  ${promising.length} promising  ` +\n      `·  ${inert.length} inert  ·  ${clash.length} magnitude-clash  ` +\n      `·  ${contra.length} contradictory (numerically falsified)  ·  ${axisClash.length} axis-clash`\n  );\n  const rd = readinessOf(api, withConsequence);\n  out(\n    `  readiness of the ${rd.promising} promising: ${rd.mechanismTested} mechanism-tested · ` +\n      `${rd.dataTested} data-tested · ${rd.withoutMagnitudeEvidence} without magnitude evidence · ` +\n      `${rd.axisUnresolved} with axis unresolved · ${rd.entailedConsequence} with an entailed consequence`,\n  );\n  out('  promising ≠ evidence: promotion to a bridge needs a mechanism and a falsifiable prediction.\\n');\n  const requireFalsifier = args.flags.has('require-falsifier');\n  const untested = (r: FullyAnnotatedCandidate) =>\n    api.describeReadiness(r, r.consequence?.signal).falsifiers.survived.length === 0;\n  if (requireFalsifier) {\n    out(\n      `  --require-falsifier: ${promising.filter(untested).length} of the ${promising.length} promising hidden — ` +\n        'no independent falsifier ran and survived (connectivity alone is not evidence)\\n',\n    );\n    const encoded = encodedFalsifiers(api);\n    out(`  encoded falsifiers already on the records (${encoded.length}; these are not discovery rows):`);\n    for (const line of encoded) out(`    ${line}`);\n    out('');\n  }\n  if (promising.length) {\n    out('  PROMISING (merges disconnected physics, unlocks quantities, stays consistent):');\n    for (const r of promising) {\n      if (r.adjudication && foldsOut(r.adjudication.verdict) && !showAdjudicated) continue;\n      if (requireFalsifier && untested(r)) continue;\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]  score ${r.score}`);\n      out(`        unlocks: ${r.unlocksFromAnchor.join(', ') || '—'}`);\n      if (r.consequence) {\n        out(`        [consequence: ${r.consequence.signal}]`);\n      }\n      const g = api.describeGrounding(r, r.consequence?.signal);\n      out(\n        `        [grounding — passed: ${g.passed.join(', ') || '—'}` +\n          ` · gaps: ${g.gaps.join(', ') || '—'} · ceiling: no mechanism/data test]`,\n      );\n      const rd = api.describeReadiness(r, r.consequence?.signal);\n      const f = rd.falsifiers;\n      out(\n        `        [readiness — structure: ${rd.structure.mergesComponents ? 'merges components' : 'no merge'}, ` +\n          `unlocks ${rd.structure.unlocks} · kind: ${rd.kind} · independent falsifiers survived: ` +\n          `${f.survived.join(', ') || 'none'}${f.abstained.length ? ` (abstained: ${f.abstained.join(', ')})` : ''}` +\n          ' · mechanism: none · data: none]',\n      );\n      const needs = [\n        ...(rd.needs.magnitudeFor.length ? [`needs a representative magnitude for: ${rd.needs.magnitudeFor.join(', ')}`] : []),\n        ...rd.needs.regimeFor.map((u) => `needs a stated ${u.axis} regime for: ${u.endpoints.join(', ')}`),\n        ...(rd.needs.derivableConsequence ? ['needs a consequence that re-derives a known law'] : []),\n      ];\n      out(`        [to make it testable — premise: ${rd.needs.premise}${needs.map((n) => ` · ${n}`).join('')}]`);\n      out(`        [observation: ${rd.observation}]`);\n      if (r.adjudication) {\n        out(`        [adjudicated: ${r.adjudication.verdict} — ${r.adjudication.grounds}]`);\n      }\n    }\n    if (promising.some((r) => r.adjudication)) {\n      out(adjudicationSummaryLine(promising, promising.length));\n    }\n  } else {\n    out('  no candidate is `promising` from the anchor above.');\n  }\n  if (clash.length) {\n    out(\n      `\\n  MAGNITUDE-CLASH (representative values differ by > N orders — a falsifier; p is the falsifier's strength ` +\n        `at the values' stated σ, 2Φ(−orders/√(σa²+σb²)), not a credibility score):`,\n    );\n    for (const r of clash) {\n      const basis = r.magnitudeUsedAnchor ? '  (anchor-derived)' : '';\n      // A p that underflows a double is not zero: it is below the smallest normal double.\n      const p = r.magnitudeP;\n      const strength =\n        p === undefined || p === null ? '' : p === 0 ? ', p < 1e-300' : `, p = ${api.formatQuantity(p, 3)}`;\n      // A magnitude estimate is a statistic: three digits, marked approximate.\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} ~${api.formatQuantity(r.ordersApart!, 3)} orders apart${strength}${basis}`);\n    }\n  }\n  const subsumed = inert.filter((r) => r.subsuming);\n  if (subsumed.length) {\n    out(`\\n  SUBSUMING (generic ≟ specialization — tautological, barred from promising):`);\n    for (const r of subsumed) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]`);\n    }\n  }\n  if (contra.length) {\n    out(`\\n  CONTRADICTORY (the identification falsifies itself numerically):`);\n    for (const r of contra) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} disagreeing node(s): ${r.inconsistentNodes.join(', ')}`);\n    }\n  }\n  if (axisClash.length) {\n    out(`\\n  AXIS-CLASH (stated scale/force labels differ: a regime-label prior, not a physical test):`);\n    for (const r of axisClash) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} ${r.axisClashes.join('; ')}`);\n    }\n  }\n  out('\\n  (magnitude gate abstains where a representative value is unknown; weak priors on dimension.)');\n  out(`  (inspect one candidate: upt ground --source=${source} <a> <b>, with the same --anchor/--max-orders)`);\n  return 0;\n}\n\nexport const command: Command = {\n  name: 'discover',\n  aliases: ['discovery'],\n  flags: FLAGS,\n  help: commandHelp(HELP, FLAGS),\n  summary: 'Vet quantity identifications and rank them promising, inert, or contradictory.',\n  example: 'upt discover --source=canonical',\n  group: 'discovery',\n  run,\n};\n\nregisterCommand(command);\n"]}
+{"version":3,"file":"discover.js","sourceRoot":"","sources":["../../../src/cli/commands/discover.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,eAAe,EAAiC,MAAM,eAAe,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAI1D,OAAO,EAAE,2BAA2B,EAAE,MAAM,wBAAwB,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAa7D,MAAM,KAAK,GAAe;IACxB,UAAU,CAAC,SAAS,EAAE,+EAA+E,CAAC;IACtG;QACE,IAAI,EAAE,cAAc;QACpB,UAAU,EAAE,UAAU;QACtB,WAAW,EAAE,uEAAuE;QACpF,YAAY,EAAE,2BAA2B;KAC1C;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,IAAI;QAChB,WAAW,EAAE,gDAAgD;QAC7D,YAAY,EAAE,YAAY;KAC3B;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,MAAM;QAClB,WAAW,EACT,yLAAyL;KAC5L;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,iFAAiF;KAC/F;IACD;QACE,IAAI,EAAE,qBAAqB;QAC3B,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,wGAAwG;KACtH;IACD,SAAS;CACV,CAAC;AAEF,MAAM,iBAAiB,GAAG,sBAAsB,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AAEtE,MAAM,IAAI,GAAG;;;;;;;;;;;;;;;;;;;;;;sEAsByD,2BAA2B;;;;;;;WAOtF,iBAAiB;;;;;;;;;;;;kEAYsC,CAAC;AAEnE,MAAM,UAAU,GACd,oFAAoF;IACpF,mFAAmF;IACnF,oGAAoG,CAAC;AAEvG,MAAM,iBAAiB,GACrB,sFAAsF;IACtF,sFAAsF;IACtF,gGAAgG,CAAC;AAEnG,6EAA6E;AAE7E;;;;;GAKG;AACH,MAAM,eAAe,GAAgE;IACnF,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,yBAAyB,EAAE;CAC/D,CAAC;AACF,SAAS,YAAY,CACnB,GAAsB,EACtB,MAAkC,EAClC,KAAa,EACb,UAAkB,EAClB,GAA4B;IAE5B,MAAM,SAAS,GAAG,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;IACpD,GAAG,CAAC,iFAAiF,KAAK,GAAG,CAAC,CAAC;IAC/F,GAAG,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;IACvB,GAAG,CAAC,iBAAiB,GAAG,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,GAAG,CAAC,qFAAqF,CAAC,CAAC;QAC3F,OAAO;IACT,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,GAAG,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC;QAC5F,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3F,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,kCAAkC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC;QAClF,CAAC;aAAM,CAAC;YACN,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzF,MAAM,EAAE,GAAG,SAAS;qBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,MAAM,GAAG,CAAC;qBAChF,IAAI,CAAC,IAAI,CAAC,CAAC;gBACd,MAAM,GAAG,OAAO,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YAChF,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,yFAAyF;gBACzF,mGAAmG;gBACnG,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC;oBAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,GAAG,0CAA0C,CAAC,CAAC,OAAO,GAAG,CAAC;YAClE,CAAC;QACH,CAAC;QACD,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjB,GAAG,CAAC,SAAS,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC,oBAAoB,GAAG,MAAM,EAAE,CAAC,CAAC;QACvE,GAAG,CACD,eAAe,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE;YACjF,MAAM,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAC7H,CAAC;QACF,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,iBAAiB,EAAE,CAAC;YACpD,GAAG,CAAC,+HAA+H,CAAC,CAAC;QACvI,CAAC;QACD,IAAI,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;YACtD,GAAG,CAAC,8BAA8B,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QACtC,GAAG,CACD,CAAC,CAAC,QAAQ,KAAK,WAAW;YACxB,CAAC,CAAC,wCAAwC,CAAC,CAAC,cAAc,CAAC,EAAE,wBAAwB,CAAC,CAAC,OAAO,yBAAyB;YACvH,CAAC,CAAC,sDAAsD,CAAC,CAAC,OAAO,4BAA4B,CAChG,CAAC;QACF,GAAG,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1C,GAAG,CACD,8BAA8B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACnI,CAAC;QACF,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACtE,GAAG,CACD,0BAA0B,CAAC,CAAC,cAAc,CAAC,EAAE,IAAI,MAAM,MAAM,CAAC,CAAC,cAAc,CAAC,UAAU,+BAA+B;YACrH,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,cAAc,CAAC,sBAAsB,mBAAmB,YAAY,IAAI;YAC/F,iDAAiD,CACpD,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,EAAE,CAAC,CAAC;AACV,CAAC;AAED;;iEAEiE;AACjE,SAAS,QAAQ,CAAC,OAA4B;IAC5C,OAAO,OAAO,KAAK,OAAO,IAAI,OAAO,KAAK,UAAU,CAAC;AACvD,CAAC;AAED;wEACwE;AACxE,SAAS,sBAAsB,CAC7B,UAAyC;IAEzC,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAC7E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,YAAY;YAAE,SAAS;QAC9B,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;IACpC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;qDAEqD;AACrD,SAAS,uBAAuB,CAAC,SAAwC,EAAE,cAAsB,EAAE,SAAiB;IAClH,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAClE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,YAAa,CAAC,OAAO,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACZ,IAAI,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IACD,MAAM,KAAK,GAAI,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAW;SAClE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;IACjC,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;IAC/C,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC;IACtE,MAAM,QAAQ,GAAG,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,MAAM,SAAS,CAAC;IACvG,OAAO,kBAAkB,KAAK,WAAW,cAAc,IAAI,SAAS,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,8BAA8B,CAAC;AACvJ,CAAC;AAYD,0EAA0E;AAC1E,SAAS,iBAAiB,CAAC,GAAsB;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC;YAC1C,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;gBAAE,SAAS;YACrC,MAAM,IAAI,GAAG;gBACX,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,kBAAkB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC1D,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,oBAAoB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;aACtE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qFAAqF;AACrF,MAAM,KAAK,GAAG;IACZ,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,8HAA8H,EAAE;IACrL;QACE,OAAO,EAAE,qBAAqB;QAC9B,KAAK,EAAE,gCAAgC;QACvC,OAAO,EACL,uKAAuK;KAC1K;CACoG,CAAC;AAExG,kFAAkF;AAClF,SAAS,WAAW,CAClB,GAAsB,EACtB,UAA8C,EAC9C,OAAmC;IAEnC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IAC1D,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC;IACxE,OAAO;QACL,KAAK,EAAE,CAAC,CAAC,MAAM;QACf,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,MAAM;QAC1D,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM;QAChD,wBAAwB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;QAC9E,cAAc,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM;QACtD,mBAAmB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM;KAClF,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,GAAG,CAAC,GAAe;IAChC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAC/B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAE,EAA2B,CAAC,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC9F,MAAM,eAAe,GAAuC,QAAQ;QAClE,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAE3D,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,QAAQ;YACrB,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9F,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1B,GAAG,CAAC;gBACJ,SAAS,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC;gBAC1D,SAAS,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC;aAC3D,CAAC,CAAC,CAAC;QACR,MAAM,MAAM,GACV,gBAAgB,IAAI,CAAC,QAAQ;YAC3B,CAAC,CAAC,MAAM,CAAC,MAAM,CACX,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;gBACnB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC;gBAC/B,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAC7C;YACH,CAAC,CAAC,MAAM,CAAC;QACb,MAAM,QAAQ,GAAG;YACf,OAAO,EAAE,UAAU;YACnB,MAAM;YACN,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE;YAC/B,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE;YACpB,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU;YACrD,MAAM;YACN,GAAG,CAAC,gBAAgB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvF,GAAG,CAAC,QAAQ;gBACV,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,SAAS,EAAE;wBACT,SAAS,EAAE,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,WAAW,CAAC;wBACzD,kBAAkB,EAAE,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,qBAAqB,CAAC;qBAC7E;oBACD,mBAAmB,EAAE,sBAAsB,CAAC,eAAe,CAAC;iBAC7D,CAAC;SACP,CAAC;QACF,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,oBAAoB,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAClG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpG,CAAC;QACD,GAAG,CAAC,yBAAyB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,QAAQ,EAAE,CAAC;QACb,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;IACzE,4FAA4F;IAC5F,oFAAoF;IACpF,MAAM,QAAQ,GAAG,CAAC,CAAgC,EAAU,EAAE,CAC5D,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,CAAC,OAAmC,EAAE,EAAE,CACvD,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC9B,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IACL,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/H,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC;IACrC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;IACnC,GAAG,CAAC,8EAA8E,KAAK,GAAG,CAAC,CAAC;IAC5F,GAAG,CAAC,KAAK,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpC,GAAG,CAAC,kFAAkF,CAAC,CAAC;IACxF,GAAG,CAAC,mFAAmF,CAAC,CAAC;IACzF,8DAA8D;IAC9D,GAAG,CACD,cAAc,eAAe,CAAC,MAAM,mBAAmB,SAAU,CAAC,IAAI,CAAC,MAAM,cAAc;QACzF,MAAM,SAAU,CAAC,IAAI,CAAC,MAAM,mCAAmC;QAC/D,MAAM,KAAK,CAAC,MAAM,cAAc,KAAK,CAAC,MAAM,oBAAoB;QAChE,MAAM,MAAM,CAAC,MAAM,8CAA8C,SAAS,CAAC,MAAM,aAAa,CACjG,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC;QACvB,GAAG,CACD,sBAAsB,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC,eAAe,sBAAsB;YACpF,GAAG,EAAE,CAAC,UAAU,kBAAkB,EAAE,CAAC,wBAAwB,gCAAgC;YAC7F,GAAG,EAAE,CAAC,cAAc,2BAA2B,EAAE,CAAC,mBAAmB,+BAA+B,CACvG,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,iGAAiG,CAAC,CAAC;IACvG,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,CAAC,CAA0B,EAAE,EAAE,CAC9C,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACnF,IAAI,gBAAgB,EAAE,CAAC;QACrB,GAAG,CACD,yBAAyB;YACvB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACtG,4FAA4F,CAC/F,CAAC;QACF,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACvC,GAAG,CAAC,gDAAgD,OAAO,CAAC,MAAM,kCAAkC,CAAC,CAAC;QACtG,KAAK,MAAM,IAAI,IAAI,OAAO;YAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QAC/C,GAAG,CAAC,EAAE,CAAC,CAAC;IACV,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAA0B,EAAQ,EAAE;QACpD,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC1E,GAAG,CAAC,oBAAoB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QACjE,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAClB,GAAG,CAAC,yBAAyB,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1D,GAAG,CACD,gCAAgC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE;YAC1D,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,qCAAqC,CAC5E,CAAC;QACF,MAAM,EAAE,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC;QACxB,GAAG,CACD,mCAAmC,EAAE,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,IAAI;YACrG,WAAW,EAAE,CAAC,SAAS,CAAC,OAAO,YAAY,EAAE,CAAC,IAAI,sCAAsC;YACxF,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1G,kCAAkC,CACrC,CAAC;QACF,MAAM,KAAK,GAAG;YACZ,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,yCAAyC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtH,GAAG,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,iDAAiD,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9F,CAAC;QACF,GAAG,CAAC,2CAA2C,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC3G,GAAG,CAAC,yBAAyB,EAAE,CAAC,WAAW,GAAG,CAAC,CAAC;QAChD,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YACnB,GAAG,CAAC,yBAAyB,CAAC,CAAC,YAAY,CAAC,OAAO,MAAM,CAAC,CAAC,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC;QACtF,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS;YAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,GAAG,CACD,CAAC,KAAK,SAAS;gBACb,CAAC,CAAC,gFAAgF;gBAClF,CAAC,CAAC,2EAA2E,CAChF,CAAC;YACF,SAAS;QACX,CAAC;QACD,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,YAAY,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe;gBAAE,SAAS;YACrF,IAAI,gBAAgB,IAAI,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC9C,QAAQ,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;YACvC,GAAG,CAAC,uBAAuB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,GAAG,CACD,+GAA+G;YAC7G,4EAA4E,CAC/E,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,uFAAuF;YACvF,gDAAgD;YAChD,MAAM,KAAK,GAAG;gBACZ,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,gBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7G,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aACrD,CAAC;YACF,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,oFAAoF;YACpF,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;YACvB,MAAM,QAAQ,GACZ,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACtG,yEAAyE;YACzE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,WAAY,EAAE,CAAC,CAAC,gBAAgB,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;QACzH,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClD,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpB,GAAG,CAAC,iFAAiF,CAAC,CAAC;QACvF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClB,GAAG,CAAC,sEAAsE,CAAC,CAAC;QAC5E,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtG,CAAC;IACH,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACrB,GAAG,CAAC,+FAA+F,CAAC,CAAC;QACrG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,GAAG,CACD,kGAAkG;QAChG,8DAA8D,CACjE,CAAC;IACF,GAAG,CAAC,iDAAiD,MAAM,gDAAgD,CAAC,CAAC;IAC7G,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,CAAC,MAAM,OAAO,GAAY;IAC9B,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,CAAC,WAAW,CAAC;IACtB,KAAK,EAAE,KAAK;IACZ,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC;IAC9B,OAAO,EAAE,4HAA4H;IACrI,OAAO,EAAE,iCAAiC;IAC1C,KAAK,EAAE,WAAW;IAClB,GAAG;CACJ,CAAC;AAEF,eAAe,CAAC,OAAO,CAAC,CAAC","sourcesContent":["/**\n * `upt discover` — vet the link candidates through the inference suite, and\n * (with `--derive`) emit the algebraic identity-consequence proposals.\n * Transposed verbatim from bin/upt.mjs's `parseDiscoveryOpts()`/`discoverCmd()`/\n * `deriveCmd()` (lines 592-713), plus `--json`. `parseDiscoveryOpts` itself\n * moved to `_discovery-opts.ts` so `map`'s `--proposed` overlay can share it.\n */\nimport type { FlagSpec } from '../args.js';\nimport { registerCommand, type Command, type CommandCtx } from '../command.js';\nimport { commandHelp, JSON_FLAG, sourceFlag } from '../flag-help.js';\nimport { resolveGraph, groundTruthAnchor, groundTruthLine } from '../graphs.js';\nimport { emitJson } from '../output.js';\nimport { parseDiscoveryOpts } from './_discovery-opts.js';\nimport type { VettedCandidate } from '../../composition/discovery.js';\nimport type { AnnotatedCandidate } from '../../composition/adjudication.js';\nimport type { AdjudicationVerdict } from '../../bridges/catalog-types.js';\nimport { DISCOVER_MAX_ORDERS_DEFAULT } from '../library-defaults.js';\nimport { adjudicationSourceUrls } from '../published-url.js';\nimport type { ConsequenceSignal, ConsequenceEvidence } from '../../composition/consequence.js';\n\n/** `annotated` (adjudication layer) composed with the consequence layer —\n *  both are `VettedCandidate & {...}` intersections, so a candidate carries\n *  both `adjudication?` and `consequence?` after composition. */\ntype FullyAnnotatedCandidate = AnnotatedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\nconst FLAGS: FlagSpec[] = [\n  sourceFlag('catalog', 'Which graph to read: catalog, canonical, or both. canonical excludes bridges.'),\n  {\n    name: '--max-orders',\n    valueStyle: 'attached',\n    description: 'Magnitude-clash threshold. A larger value keeps more pairs promising.',\n    defaultValue: DISCOVER_MAX_ORDERS_DEFAULT,\n  },\n  {\n    name: '--anchor',\n    valueStyle: 'attached',\n    repeatable: true,\n    description: 'Override a numeric anchor as k=v or k=v,k2=v2.',\n    defaultValue: 'mass=M_sun',\n  },\n  {\n    name: '--derive',\n    valueStyle: 'none',\n    description:\n      'For each promising identification (either tier), print the one algebraic relation it implies, and say when the identification had no magnitude evidence. That relation is not a bridge.',\n  },\n  {\n    name: '--show-adjudicated',\n    valueStyle: 'none',\n    description: 'List candidates a physicist has already adjudicated, with the recorded verdict.',\n  },\n  {\n    name: '--require-falsifier',\n    valueStyle: 'none',\n    description: 'Hide promising rows (either tier) that no independent falsifier ran on and survived, counted per tier.',\n  },\n  JSON_FLAG,\n];\n\nconst ADJUDICATION_URLS = adjudicationSourceUrls().join('\\n        ');\n\nconst HELP = `upt discover [--source=catalog|canonical|both]\n        VET the link candidates through the inference suite: hypothesise\n        each identification a≡b and test whether it merges disconnected\n        physics, unlocks quantities, and stays numerically consistent.\n        Ranks promising / promising, magnitude unchecked / inert / contradictory.\n        A row that merges, unlocks and survives every falsifier that ran is\n        'promising' only when the magnitude falsifier ran on it and could have\n        failed (both endpoints have a representative magnitude, and the ratio\n        is not fixed by the graph at every anchor); otherwise it is 'promising,\n        magnitude unchecked' (promising-unchecked in --json). The two tiers are\n        counted and listed apart and never added.\n        --source=canonical runs the funnel on the standard-physics L-layer\n        ALONE (bridges excluded) — new candidates from established physics,\n        and a self-consistency check (expect 0 contradictory).\n        --derive emits, for each promising identification of either tier, the ONE\n        algebraic relation it implies (monomial elimination) as an UNADJUDICATED,\n        math-only proposal — NOT a bridge (Part-VI §XXVII-B), and says when the\n        identification had no magnitude evidence. Pairs with --source=canonical.\n        A magnitude comes from the sourced table, else a constant the graph\n        fixes, else the quantity's own equation evaluated from the table and\n        the constants (used only at a propagated σ of at most one decade),\n        else the anchor; the MAGNITUDE-CLASH list marks the last two.\n        --max-orders=N tunes the magnitude-clash threshold (default ${DISCOVER_MAX_ORDERS_DEFAULT}); looser N\n        keeps more candidates 'promising', tighter N falsifies more as clashes.\n        --anchor=k=v[,k2=v2] overrides the numeric anchor (default mass=M_sun)\n        for the consistency/closure check. Both reshape the candidate pool that\n        --derive consumes. T, temperature, temp, and T_K on an anchor are\n        kelvin: an energy is k_B T, and any other dimension is an error.\n        Candidates a physicist has already adjudicated\n        (${ADJUDICATION_URLS})\n        fold out of the two PROMISING lists by default (decoy/entailed verdicts only —\n        review memory, not a re-litigation prompt); --show-adjudicated lists them\n        again with their recorded verdict.\n        Each row of either PROMISING list states its readiness dimension by dimension —\n        structure, kind, which independent falsifiers (magnitude, axis,\n        consequence) ran and survived or abstained — and what would make it\n        testable: the identity premise, the missing magnitudes and regimes,\n        and the observation that would test it. An abstention is a missing\n        test, never a pass. --require-falsifier hides promising rows (either\n        tier) that no independent falsifier ran on and survived, counts them per\n        tier, and lists the encoded bridges that already carry a falsifier (a\n        confrontation, a counterexample, or a regime inequality).`;\n\nconst EPISTEMICS =\n  '⚠ a REVIEW SURFACE: `promising` means \"worth a physicist\\'s minute\", not \"true\".\\n' +\n  '  Each candidate hypothesises an identification a≡b and tests its consequences.\\n' +\n  '  `promising-unchecked` is the same structure with no magnitude evidence; the two are never added.';\n\nconst DERIVE_EPISTEMICS =\n  '⚠ Each is the ALGEBRAIC CONSEQUENCE of an unadjudicated identification — NOT a new\\n' +\n  '  relation and NOT a bridge. No mechanism asserted. Promotion to the catalog needs\\n' +\n  '  adversarial + literature review (Part-VI §XXVII-B). The enumerator proposes; humans dispose.';\n\n// ── discover --derive (identity-consequence proposals) ────────────────────\n\n/**\n * Sample values for GENERIC quantities, which the representative-value table\n * leaves out on purpose. A proposal is evaluated only when every free input\n * has a sourced sample: this command once put 300 into every input, a Hubble\n * rate of 300 s⁻¹ among them (persona finding D5).\n */\nconst GENERIC_SAMPLES: Readonly<Record<string, { value: number; source: string }>> = {\n  temperature: { value: 300, source: 'room temperature, 300 K' },\n};\nfunction deriveReport(\n  api: CommandCtx['api'],\n  ranked: readonly VettedCandidate[],\n  label: string,\n  anchorLine: string,\n  out: (line?: string) => void\n): void {\n  const proposals = api.deriveProposedBridges(ranked);\n  out(`\\nDerived identity-consequence PROPOSALS — UNADJUDICATED, math-only  [source: ${label}]`);\n  out(`  ${anchorLine}`);\n  out(DERIVE_EPISTEMICS + '\\n');\n  if (!proposals.length) {\n    out('  no admissible proposal (need two fully-quantitative, monomial canonical targets).');\n    return;\n  }\n  for (const p of proposals) {\n    let approx = '';\n    const governing = p.governing || [];\n    const sampleOf = (name: string) => api.REPRESENTATIVE_VALUES[name] ?? GENERIC_SAMPLES[name];\n    const missing = governing.filter((g) => sampleOf(g.name) === undefined).map((g) => g.name);\n    if (missing.length > 0) {\n      approx = `  (no sourced sample value for ${missing.join(', ')}; not evaluated)`;\n    } else {\n      try {\n        const vals = Object.fromEntries(governing.map((g) => [g.name, sampleOf(g.name)!.value]));\n        const at = governing\n          .map((g) => `${g.name}=${sampleOf(g.name)!.value} [${sampleOf(g.name)!.source}]`)\n          .join(', ');\n        approx = `  ≈ ${api.formatQuantity(p.evaluate(vals))}${at ? ` (${at})` : ''}`;\n      } catch (e) {\n        // A proposal that cannot be evaluated at its samples says so and why; it is not shown as\n        // though it had no sample. Only an `Error` is a refusal of the formula: anything else is a defect.\n        if (!(e instanceof Error)) throw e;\n        approx = `  (not evaluated at the sample values: ${e.message})`;\n      }\n    }\n    out(`  ${p.id}`);\n    out(`      ${p.formulaLatex}      ${p.dimensionalSignature}${approx}`);\n    out(\n      `      from: ${p.derivedFrom.identification.a} ≟ ${p.derivedFrom.identification.b}` +\n        `  (${p.derivedFrom.sourceEquationIds[0]} = ${p.derivedFrom.sourceEquationIds[1]}); solved for ${p.derivedFrom.solvedFor}`\n    );\n    if (!p.derivedFrom.identification.magnitudeEvidence) {\n      out('      magnitude: no evidence — the identification is promising, magnitude unchecked (the magnitude falsifier never tested it)');\n    }\n    if (p.alsoDerivableFrom && p.alsoDerivableFrom.length) {\n      out(`      also derivable from: ${p.alsoDerivableFrom.join('; ')}`);\n    }\n    const c = api.describeDerivedClaim(p);\n    out(\n      c.relation === 'known-law'\n        ? `      status: known law — re-derives ${c.canonicalMatch.id}; the identification ${c.premise} is still unadjudicated`\n        : `      status: conditional identity — holds only if ${c.premise} (unadjudicated); untested`,\n    );\n    out(`      meaning: ${c.symbol.meaning}`);\n    out(\n      `      assumptions carried: ${c.assumptions.map((a) => `${a.equation}: ${a.assumptions.join(', ') || 'none stated'}`).join('; ')}`,\n    );\n    const governingSet = `{${p.governing.map((g) => g.name).join(', ')}}`;\n    out(\n      `      canonical match: ${c.canonicalMatch.id ?? 'none'} — ${c.canonicalMatch.sameTarget} registry equation(s) target ` +\n        `${p.target.name}, ${c.canonicalMatch.sameTargetAndGoverning} with governing ${governingSet}; ` +\n        'scope: this registry only, not physics at large',\n    );\n  }\n  out('');\n}\n\n/** Verdicts that fold a candidate out of the printed PROMISING list by\n *  default — review memory, not news. `deferred`/`genuine` stay listed\n *  (see the module-level docstring on `AdjudicationVerdict`). */\nfunction foldsOut(verdict: AdjudicationVerdict): boolean {\n  return verdict === 'decoy' || verdict === 'entailed';\n}\n\n/** Tally an annotated candidate set's recorded verdicts, for `--json`'s\n *  `adjudicationSummary` (over ALL candidates, every funnel bucket). */\nfunction summarizeAdjudications(\n  candidates: readonly AnnotatedCandidate[]\n): { total: number; genuine: number; decoy: number; entailed: number; deferred: number } {\n  const summary = { total: 0, genuine: 0, decoy: 0, entailed: 0, deferred: 0 };\n  for (const c of candidates) {\n    if (!c.adjudication) continue;\n    summary.total++;\n    summary[c.adjudication.verdict]++;\n  }\n  return summary;\n}\n\n/** The reconciling line printed under PROMISING when some of it carries a\n *  recorded verdict — so the folded/shorter list never looks inconsistent\n *  against the funnel line's raw promising count. */\nfunction adjudicationSummaryLine(promising: readonly AnnotatedCandidate[], promisingCount: number, tierLabel: string): string {\n  const adjudicated = promising.filter((r) => r.adjudication);\n  const counts = { genuine: 0, decoy: 0, entailed: 0, deferred: 0 };\n  let folded = 0;\n  for (const r of adjudicated) {\n    const v = r.adjudication!.verdict;\n    counts[v]++;\n    if (foldsOut(v)) folded++;\n  }\n  const parts = (['decoy', 'entailed', 'deferred', 'genuine'] as const)\n    .filter((v) => counts[v] > 0)\n    .map((v) => `${counts[v]} ${v}`);\n  const total = adjudicated.length;\n  const verb = total === 1 ? 'carries' : 'carry';\n  const noun = total === 1 ? 'a recorded verdict' : 'recorded verdicts';\n  const foldNote = folded === total ? '— folded' : folded === 0 ? '— shown below' : `— ${folded} folded`;\n  return `  adjudicated: ${total} of the ${promisingCount} ${tierLabel} ${verb} ${noun} (${parts.join(', ')}) ${foldNote}; --show-adjudicated to list`;\n}\n\n/** How far one promising tier is from evidence. */\ninterface Readiness {\n  count: number;\n  mechanismTested: number;\n  dataTested: number;\n  withoutMagnitudeEvidence: number;\n  axisUnresolved: number;\n  entailedConsequence: number;\n}\n\n/** Encoded bridges that already carry a falsifier. Not discovery rows. */\nfunction encodedFalsifiers(api: CommandCtx['api']): readonly string[] {\n  const lines: string[] = [];\n  for (const id of [...api.CONFRONTATIONS.keys()].sort((a, b) => a - b)) {\n    lines.push(`be-${id} (confrontation)`);\n  }\n  for (const f of api.ATLAS_FAMILIES) {\n    for (const b of f.bridges) {\n      const cx = b.counterexamples.length;\n      const ineq = b.regime.inequalities.length;\n      if (cx === 0 && ineq === 0) continue;\n      const bits = [\n        cx > 0 ? `${cx} counterexample${cx === 1 ? '' : 's'}` : '',\n        ineq > 0 ? `${ineq} regime inequalit${ineq === 1 ? 'y' : 'ies'}` : '',\n      ].filter((s) => s !== '');\n      lines.push(`${b.id} (${bits.join(', ')})`);\n    }\n  }\n  return lines;\n}\n\n/** The two promising tiers, in print order, with the label each is printed under. */\nconst TIERS = [\n  { verdict: 'promising', label: 'promising', heading: 'PROMISING (merges disconnected physics, unlocks quantities, stays consistent, and the magnitude falsifier ran and survived):' },\n  {\n    verdict: 'promising-unchecked',\n    label: 'promising, magnitude unchecked',\n    heading:\n      'PROMISING, MAGNITUDE UNCHECKED (the same structure; the magnitude falsifier abstained or its pass is fixed by the graph at every anchor, so it never tested the row):',\n  },\n] as const satisfies readonly { verdict: VettedCandidate['verdict']; label: string; heading: string }[];\n\n/** How far one promising tier is from evidence, counted from candidate fields. */\nfunction readinessOf(\n  api: CommandCtx['api'],\n  candidates: readonly FullyAnnotatedCandidate[],\n  verdict: VettedCandidate['verdict'],\n): Readiness {\n  const p = candidates.filter((c) => c.verdict === verdict);\n  const g = p.map((c) => api.describeGrounding(c, c.consequence?.signal));\n  return {\n    count: p.length,\n    mechanismTested: g.filter((x) => x.mechanismTested).length,\n    dataTested: g.filter((x) => x.dataTested).length,\n    withoutMagnitudeEvidence: p.filter((c) => !api.hasMagnitudeEvidence(c)).length,\n    axisUnresolved: p.filter((c) => !c.axisChecked).length,\n    entailedConsequence: p.filter((c) => c.consequence?.signal === 'entailed').length,\n  };\n}\n\nasync function run(ctx: CommandCtx): Promise<number> {\n  const { args, api, out } = ctx;\n  const { graph, label, source } = resolveGraph(api, args.flags);\n  const opts = parseDiscoveryOpts(api, args.flags);\n  const anchor = groundTruthAnchor(api, opts);\n  const ranked = api.rankDiscoveries(graph, opts);\n  const isDerive = args.flags.has('derive');\n  const annotated = isDerive ? ([] as AnnotatedCandidate[]) : api.annotateAdjudications(ranked);\n  const withConsequence: readonly FullyAnnotatedCandidate[] = isDerive\n    ? []\n    : api.annotateConsequences(annotated);\n  const showAdjudicated = args.flags.has('show-adjudicated');\n\n  if (args.flags.has('json')) {\n    const requireFalsifier = args.flags.has('require-falsifier');\n    const mapped = isDerive\n      ? api.deriveProposedBridges(ranked).map((p) => ({ ...p, claim: api.describeDerivedClaim(p) }))\n      : withConsequence.map((c) => ({\n          ...c,\n          grounding: api.describeGrounding(c, c.consequence?.signal),\n          readiness: api.describeReadiness(c, c.consequence?.signal),\n        }));\n    const result =\n      requireFalsifier && !isDerive\n        ? mapped.filter(\n            (c) =>\n              !('readiness' in c) ||\n              !api.isPromisingTier(c.verdict) ||\n              c.readiness.falsifiers.survived.length > 0,\n          )\n        : mapped;\n    const envelope = {\n      command: 'discover',\n      source,\n      anchor: { groundTruth: anchor },\n      options: { ...opts },\n      epistemics: isDerive ? DERIVE_EPISTEMICS : EPISTEMICS,\n      result,\n      ...(requireFalsifier && !isDerive ? { encodedFalsifiers: encodedFalsifiers(api) } : {}),\n      ...(isDerive\n        ? {}\n        : {\n            readiness: {\n              promising: readinessOf(api, withConsequence, 'promising'),\n              promisingUnchecked: readinessOf(api, withConsequence, 'promising-unchecked'),\n            },\n            adjudicationSummary: summarizeAdjudications(withConsequence),\n          }),\n    };\n    emitJson(envelope, ctx.write);\n    return 0;\n  }\n\n  if (Object.keys(opts).length) {\n    const bits: string[] = [];\n    if (opts.maxOrdersOfMagnitude !== undefined) bits.push(`max-orders=${opts.maxOrdersOfMagnitude}`);\n    if (opts.groundTruth) {\n      bits.push(`anchor={${Object.entries(opts.groundTruth).map(([k, v]) => `${k}=${v}`).join(', ')}}`);\n    }\n    out(`  [discovery options: ${bits.join('; ')}]`);\n  }\n\n  if (isDerive) {\n    deriveReport(api, ranked, label, groundTruthLine(anchor), out);\n    return 0;\n  }\n\n  const by = (v: string) => withConsequence.filter((r) => r.verdict === v);\n  // Q1: within each PROMISING tier, spend the physicist's first minute on consequence-bearing\n  // rows before inconclusive coincidences. The magnitude evidence is the tier itself.\n  const consRank = (s: ConsequenceSignal | undefined): number =>\n    s === 'entailed' ? 0 : s === 'novel-consequence' ? 1 : 2;\n  const tierRows = (verdict: VettedCandidate['verdict']) =>\n    [...by(verdict)].sort((a, b) => {\n      const ca = consRank(a.consequence?.signal);\n      const cb = consRank(b.consequence?.signal);\n      if (ca !== cb) return ca - cb;\n      return b.score - a.score || a.a.localeCompare(b.a) || a.b.localeCompare(b.b);\n    });\n  const tiers = TIERS.map((t) => ({ ...t, rows: tierRows(t.verdict), readiness: readinessOf(api, withConsequence, t.verdict) }));\n  const [promising, unchecked] = tiers;\n  const inert = by('inert');\n  const contra = by('contradictory');\n  const clash = by('magnitude-clash');\n  const axisClash = by('axis-clash');\n  out(`\\nDiscovery — link candidates VETTED through the inference suite  [source: ${label}]`);\n  out(`  ${groundTruthLine(anchor)}`);\n  out('⚠ a REVIEW SURFACE: `promising` means \"worth a physicist\\'s minute\", not \"true\".');\n  out('  Each candidate hypothesises an identification a≡b and tests its consequences.\\n');\n  // The two tiers are two counts, never one sum (AGENTS law 4).\n  out(\n    `  funnel:  ${withConsequence.length} candidates  →  ${promising!.rows.length} promising  ` +\n      `·  ${unchecked!.rows.length} promising, magnitude unchecked  ` +\n      `·  ${inert.length} inert  ·  ${clash.length} magnitude-clash  ` +\n      `·  ${contra.length} contradictory (numerically falsified)  ·  ${axisClash.length} axis-clash`\n  );\n  for (const t of tiers) {\n    const rd = t.readiness;\n    out(\n      `  readiness of the ${rd.count} ${t.label}: ${rd.mechanismTested} mechanism-tested · ` +\n        `${rd.dataTested} data-tested · ${rd.withoutMagnitudeEvidence} without magnitude evidence · ` +\n        `${rd.axisUnresolved} with axis unresolved · ${rd.entailedConsequence} with an entailed consequence`,\n    );\n  }\n  out('  promising ≠ evidence: promotion to a bridge needs a mechanism and a falsifiable prediction.\\n');\n  const requireFalsifier = args.flags.has('require-falsifier');\n  const untested = (r: FullyAnnotatedCandidate) =>\n    api.describeReadiness(r, r.consequence?.signal).falsifiers.survived.length === 0;\n  if (requireFalsifier) {\n    out(\n      `  --require-falsifier: ` +\n        tiers.map((t) => `${t.rows.filter(untested).length} of the ${t.rows.length} ${t.label}`).join(' and ') +\n        ' hidden — no independent falsifier ran and survived (connectivity alone is not evidence)\\n',\n    );\n    const encoded = encodedFalsifiers(api);\n    out(`  encoded falsifiers already on the records (${encoded.length}; these are not discovery rows):`);\n    for (const line of encoded) out(`    ${line}`);\n    out('');\n  }\n  const printRow = (r: FullyAnnotatedCandidate): void => {\n    out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]  score ${r.score}`);\n    out(`        unlocks: ${r.unlocksFromAnchor.join(', ') || '—'}`);\n    if (r.consequence) {\n      out(`        [consequence: ${r.consequence.signal}]`);\n    }\n    const g = api.describeGrounding(r, r.consequence?.signal);\n    out(\n      `        [grounding — passed: ${g.passed.join(', ') || '—'}` +\n        ` · gaps: ${g.gaps.join(', ') || '—'} · ceiling: no mechanism/data test]`,\n    );\n    const rd = api.describeReadiness(r, r.consequence?.signal);\n    const f = rd.falsifiers;\n    out(\n      `        [readiness — structure: ${rd.structure.mergesComponents ? 'merges components' : 'no merge'}, ` +\n        `unlocks ${rd.structure.unlocks} · kind: ${rd.kind} · independent falsifiers survived: ` +\n        `${f.survived.join(', ') || 'none'}${f.abstained.length ? ` (abstained: ${f.abstained.join(', ')})` : ''}` +\n        ' · mechanism: none · data: none]',\n    );\n    const needs = [\n      ...(rd.needs.magnitudeFor.length ? [`needs a representative magnitude for: ${rd.needs.magnitudeFor.join(', ')}`] : []),\n      ...rd.needs.regimeFor.map((u) => `needs a stated ${u.axis} regime for: ${u.endpoints.join(', ')}`),\n      ...(rd.needs.derivableConsequence ? ['needs a consequence that re-derives a known law'] : []),\n    ];\n    out(`        [to make it testable — premise: ${rd.needs.premise}${needs.map((n) => ` · ${n}`).join('')}]`);\n    out(`        [observation: ${rd.observation}]`);\n    if (r.adjudication) {\n      out(`        [adjudicated: ${r.adjudication.verdict} — ${r.adjudication.grounds}]`);\n    }\n  };\n  for (const t of tiers) {\n    if (t !== promising) out('');\n    if (t.rows.length === 0) {\n      out(\n        t === promising\n          ? '  no candidate is `promising` (with magnitude evidence) from the anchor above.'\n          : '  no candidate is `promising, magnitude unchecked` from the anchor above.',\n      );\n      continue;\n    }\n    out(`  ${t.heading}`);\n    for (const r of t.rows) {\n      if (r.adjudication && foldsOut(r.adjudication.verdict) && !showAdjudicated) continue;\n      if (requireFalsifier && untested(r)) continue;\n      printRow(r);\n    }\n    if (t.rows.some((r) => r.adjudication)) {\n      out(adjudicationSummaryLine(t.rows, t.rows.length, t.label));\n    }\n  }\n  if (clash.length) {\n    out(\n      `\\n  MAGNITUDE-CLASH (representative values differ by > N orders — a falsifier; p is the falsifier's strength ` +\n        `at the values' stated σ, 2Φ(−orders/√(σa²+σb²)), not a credibility score):`,\n    );\n    for (const r of clash) {\n      // Where each magnitude came from when it was not the sourced table: the quantity's own\n      // equation (not anchor-derived), or the anchor.\n      const bases = [\n        ...((r.magnitudeDerived ?? []).length > 0 ? [`${r.magnitudeDerived!.join(', ')} from its own equation`] : []),\n        ...(r.magnitudeUsedAnchor ? ['anchor-derived'] : []),\n      ];\n      const basis = bases.length > 0 ? `  (${bases.join('; ')})` : '';\n      // A p that underflows a double is not zero: it is below the smallest normal double.\n      const p = r.magnitudeP;\n      const strength =\n        p === undefined || p === null ? '' : p === 0 ? ', p < 1e-300' : `, p = ${api.formatQuantity(p, 3)}`;\n      // A magnitude estimate is a statistic: three digits, marked approximate.\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} ~${api.formatQuantity(r.ordersApart!, 3)} orders apart${strength}${basis}`);\n    }\n  }\n  const subsumed = inert.filter((r) => r.subsuming);\n  if (subsumed.length) {\n    out(`\\n  SUBSUMING (generic ≟ specialization — tautological, barred from promising):`);\n    for (const r of subsumed) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} [${r.dim}]`);\n    }\n  }\n  if (contra.length) {\n    out(`\\n  CONTRADICTORY (the identification falsifies itself numerically):`);\n    for (const r of contra) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} disagreeing node(s): ${r.inconsistentNodes.join(', ')}`);\n    }\n  }\n  if (axisClash.length) {\n    out(`\\n  AXIS-CLASH (stated scale/force labels differ: a regime-label prior, not a physical test):`);\n    for (const r of axisClash) {\n      out(`    ${(r.a + ' ≟ ' + r.b).padEnd(52)} ${r.axisClashes.join('; ')}`);\n    }\n  }\n  out(\n    '\\n  (magnitude gate abstains where a representative value is unknown, and such a row is at most ' +\n      \"'promising, magnitude unchecked'; weak priors on dimension.)\",\n  );\n  out(`  (inspect one candidate: upt ground --source=${source} <a> <b>, with the same --anchor/--max-orders)`);\n  return 0;\n}\n\nexport const command: Command = {\n  name: 'discover',\n  aliases: ['discovery'],\n  flags: FLAGS,\n  help: commandHelp(HELP, FLAGS),\n  summary: 'Vet quantity identifications and rank them promising (two tiers: magnitude checked or unchecked), inert, or contradictory.',\n  example: 'upt discover --source=canonical',\n  group: 'discovery',\n  run,\n};\n\nregisterCommand(command);\n"]}

package/dist/cli/commands/evaluate.js

@@ -40,8 +40,8 @@ const HELP = `upt evaluate <be-NN | case-id> key=value[unit] ...
         (temperature-change, dT) and a --sigma take the interval, with no offset.
         An undeclared key exits 1 instead of being ignored. A declared
         alternate (major_axis_m for a_m) is converted exactly and said so.
-        e.g.  upt evaluate be-63 mu_e=2   → Chandrasekhar mass ≈ 1.456 M_⊙
-              (ideal degenerate gas, with m_u and M_⊙ = 1.989e30 kg)
+        e.g.  upt evaluate be-63 mu_e=2   → Chandrasekhar mass ≈ 2.896e30 kg (≈ 1.456 M_⊙
+              with M_⊙ = 1.989e30 kg; ideal degenerate gas, with m_u)
               upt evaluate be-55 C=1      → quantum Hall σ_xy = e²/h in siemens (R_H = 1/σ_xy = h/e²,
                                             the von Klitzing constant)
         With no bridge id, lists the evaluable bridges and their declared inputs.