universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/grounding.js

@@ -1,3 +1,4 @@
+import { hasMagnitudeEvidence } from './discovery.js';
 /**
  * Derive the grounding ledger from a candidate's existing falsifier results.
  * `consequence` is the optional consequence-annotation signal (from
@@ -18,15 +19,23 @@ export function describeGrounding(c, consequence) {
     if (c.numericallyConsistent)
         passed.push('numerical-consistency');
     // Magnitude gate: ran only when both endpoints had a representative value.
-    // An anchor-invariant ratio is fixed by the graph at every anchor, so its
-    // agreement is an identity, not a survived test (persona finding L3).
-    if (c.magnitudeChecked && c.magnitudeAnchorInvariant === true) {
+    // A clash is the gate FIRING: its failure is the magnitude-clash verdict, not a
+    // grounding line (as for numerical consistency above), so it is neither passed
+    // nor a gap. An anchor-invariant ratio is fixed by the graph at every anchor, so
+    // its agreement is an identity, not a survived test (persona finding L3).
+    if (c.verdict === 'magnitude-clash') {
+        // the verdict states it
+    }
+    else if (c.magnitudeChecked && c.magnitudeAnchorInvariant === true) {
         gaps.push('magnitude (anchor-invariant: the graph fixes this ratio at every anchor, so the match is an identity, not evidence)');
     }
     else if (c.magnitudeChecked) {
         const parts = [];
         if (c.ordersApart != null)
             parts.push(`${c.ordersApart.toFixed(1)} orders`);
+        // A magnitude from the quantity's own equation is not anchor-derived: say which, and where from.
+        if ((c.magnitudeDerived ?? []).length > 0)
+            parts.push(`${c.magnitudeDerived.join(', ')} from its own equation`);
         if (c.magnitudeUsedAnchor)
             parts.push('anchor-derived');
         passed.push(parts.length ? `magnitude (${parts.join(', ')})` : 'magnitude');
@@ -62,10 +71,13 @@ export function describeGrounding(c, consequence) {
 export function describeReadiness(c, consequence) {
     const survived = [];
     const abstained = [];
-    if (c.magnitudeChecked && c.magnitudeAnchorInvariant !== true)
-        survived.push('magnitude');
-    else
-        abstained.push('magnitude');
+    // A magnitude clash is the falsifier firing: it neither survived nor abstained.
+    if (c.verdict !== 'magnitude-clash') {
+        if (hasMagnitudeEvidence(c))
+            survived.push('magnitude');
+        else
+            abstained.push('magnitude');
+    }
     if (c.axisChecked && c.axisClashes.length === 0)
         survived.push('axis');
     else if (!c.axisChecked)

package/dist/composition/grounding.js.map

@@ -1 +1 @@
-{"version":3,"file":"grounding.js","sourceRoot":"","sources":["../../src/composition/grounding.ts"],"names":[],"mappings":"AA2DA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,CAAkB,EAClB,WAA+B;IAE/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,6EAA6E;IAC7E,8EAA8E;IAC9E,8EAA8E;IAC9E,IAAI,CAAC,CAAC,qBAAqB;QAAE,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAElE,2EAA2E;IAC3E,0EAA0E;IAC1E,sEAAsE;IACtE,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI,EAAE,CAAC;QAC9D,IAAI,CAAC,IAAI,CACP,qHAAqH,CACtH,CAAC;IACJ,CAAC;SAAM,IAAI,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,WAAW,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5E,IAAI,CAAC,CAAC,mBAAmB;YAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IAC9E,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACnD,CAAC;IAED,+EAA+E;IAC/E,8EAA8E;IAC9E,4EAA4E;IAC5E,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;IAClD,CAAC;SAAM,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACnD,CAAC;IAED,0EAA0E;IAC1E,8EAA8E;IAC9E,6EAA6E;IAC7E,gFAAgF;IAChF,IAAI,WAAW,KAAK,UAAU;QAAE,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;SAChE,IAAI,WAAW,KAAK,mBAAmB;QAAE,IAAI,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;SACzF,IAAI,WAAW,KAAK,cAAc;QAAE,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAEhF,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AA0CD;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAkB,EAAE,WAA+B;IACnF,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI;QAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;QACrF,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACjC,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAClE,IAAI,CAAC,CAAC,CAAC,WAAW;QAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,WAAW,KAAK,UAAU;QAAE,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;;QACxD,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC;IACzD,OAAO;QACL,SAAS,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,EAAE;QACxF,IAAI;QACJ,UAAU,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE;QACnC,eAAe,EAAE,KAAK;QACtB,UAAU,EAAE,KAAK;QACjB,KAAK,EAAE;YACL,OAAO,EACL,IAAI,KAAK,WAAW;gBAClB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,iEAAiE;gBACpF,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kDAAkD,CAAC,CAAC,GAAG,EAAE;YAChF,YAAY,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC;YACvE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAClH,oBAAoB,EAAE,WAAW,KAAK,UAAU;SACjD;QACD,WAAW,EACT,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,6EAA6E;YACtG,kFAAkF;KACrF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * PI-instrument Phase 1 — the epistemic-grounding ledger. A pure, derived view\n * over a `VettedCandidate`'s already-computed falsifier results: which gates RAN\n * a real comparison and the candidate SURVIVED (`passed`), which could not test\n * it or produced an unadjudicated result (`gaps`), and the honest ceiling — no\n * mechanism test (axis-compatibility is a proxy, not a mechanism test) and no\n * data confrontation. Annotation-only: it changes no verdict, score, or count.\n *\n * The ledger's job is to expose WEAKNESS so a PI knows how much weight a verdict\n * bears. A gate lands in `passed` ONLY if it ran a real comparison and the\n * candidate survived; anything untestable (an abstained gate) or unadjudicated\n * (a novel machine-derived consequence) is a `gap`, never a strength. There is\n * deliberately NO single \"tier\": magnitude (numeric) and axis (regime) are\n * orthogonal evidence and must not collapse into one rank a PI could misread as\n * credibility.\n *\n * @module composition/grounding\n */\nimport type { VettedCandidate } from './discovery.js';\nimport type { ConsequenceSignal } from './consequence.js';\n\n/** The epistemic-grounding ledger for one discovery candidate. @public */\nexport interface CandidateGrounding {\n  /** Gates that ran a real comparison AND the candidate survived. */\n  readonly passed: readonly string[];\n  /** Gates that could NOT test the candidate, or produced an unadjudicated result. */\n  readonly gaps: readonly string[];\n  /**\n   * Honest ceiling — no mechanism test has run. This is PERMANENT for a\n   * dimensional discovery candidate, not a placeholder: axis-compatibility is a\n   * regime PROXY, and `entailed` (the strongest available signal — the\n   * consequence re-derives a known canonical law) is a structural-consequence\n   * check, not a mechanism test. A dedicated mechanism-proxy gate was assessed\n   * 2026-07-04 and found NOT buildable without fabricating coupling physics the\n   * catalog does not have (Phase 2 grounding; see the PI-instrument Phase 2\n   * not-build note). Real mechanism lives in the ESTABLISHED-bridge world\n   * (`upt confront`), not in candidate space. The field stays for honesty (the\n   * ceiling is never a silent omission) and for the constructive path: growing\n   * the canonical registry so `entailed` stops abstaining.\n   */\n  readonly mechanismTested: false;\n  /**\n   * Honest ceiling — this candidate is not confronted with real data. This is\n   * PERMANENT for a dimensional discovery candidate, not a placeholder: a\n   * cross-cluster dimensional identification is a coincidence review surface\n   * (0/8 ever adjudicated genuine) with no implied observable to measure. Data\n   * confrontation lives in the ESTABLISHED-bridge world (`upt confront`), which\n   * the evidence-spine work grows. The scientific loop is closed not by\n   * confronting candidates but by the FIREWALL: a candidate must graduate to an\n   * established bridge (human review + citation) before it can be data-tested.\n   * A propose→confront loop over candidates was assessed 2026-07-04 (PI-instrument\n   * Phase 3) and found to have no confrontable target — the honest boundary is\n   * that candidates are unconfrontable until promoted. The field stays for\n   * honesty and flips only for a candidate that is `entailed` into (or graduates\n   * to) a data-confronted relation.\n   */\n  readonly dataTested: false;\n}\n\n/**\n * Derive the grounding ledger from a candidate's existing falsifier results.\n * `consequence` is the optional consequence-annotation signal (from\n * `annotateConsequences`); omit it when the consequence layer did not run.\n *\n * Designed for `promising` candidates (the ones a PI reviews), but honest for\n * any candidate: it never reports a gate as `passed` unless it actually ran and\n * the candidate survived it.\n *\n * @public\n */\nexport function describeGrounding(\n  c: VettedCandidate,\n  consequence?: ConsequenceSignal,\n): CandidateGrounding {\n  const passed: string[] = [];\n  const gaps: string[] = [];\n\n  // Numerical-consistency: the retrodiction filter always runs. It is `passed`\n  // only when the candidate is actually consistent (a contradictory candidate's\n  // failure is its verdict, not a grounding line — this view is for survivors).\n  if (c.numericallyConsistent) passed.push('numerical-consistency');\n\n  // Magnitude gate: ran only when both endpoints had a representative value.\n  // An anchor-invariant ratio is fixed by the graph at every anchor, so its\n  // agreement is an identity, not a survived test (persona finding L3).\n  if (c.magnitudeChecked && c.magnitudeAnchorInvariant === true) {\n    gaps.push(\n      'magnitude (anchor-invariant: the graph fixes this ratio at every anchor, so the match is an identity, not evidence)',\n    );\n  } else if (c.magnitudeChecked) {\n    const parts: string[] = [];\n    if (c.ordersApart != null) parts.push(`${c.ordersApart.toFixed(1)} orders`);\n    if (c.magnitudeUsedAnchor) parts.push('anchor-derived');\n    passed.push(parts.length ? `magnitude (${parts.join(', ')})` : 'magnitude');\n  } else {\n    gaps.push('magnitude (no representative value)');\n  }\n\n  // Axis-compatibility: honestly PARTIAL — \"≥1 regime axis resolved and agreed\",\n  // never \"fully axis-checked\". Cleared only when an axis was resolved AND none\n  // clashed. (A clash is the axis-clash verdict, not a survivor's grounding.)\n  if (c.axisChecked && c.axisClashes.length === 0) {\n    passed.push('axis-compatible (≥1 regime axis)');\n  } else if (!c.axisChecked) {\n    gaps.push('axis (regime attributes unresolved)');\n  }\n\n  // Consequence: ONLY `entailed` clears (the consequence re-derives a known\n  // canonical law — a real check against standard physics). `novel-consequence`\n  // is an UNADJUDICATED machine-surfaced relation — a weakness to investigate,\n  // not a passed test. `inconclusive` means the consequence layer could not test.\n  if (consequence === 'entailed') passed.push('consequence: entailed');\n  else if (consequence === 'novel-consequence') gaps.push('consequence: novel (unadjudicated)');\n  else if (consequence === 'inconclusive') gaps.push('consequence: inconclusive');\n\n  return { passed, gaps, mechanismTested: false, dataTested: false };\n}\n\n/** An independent falsifier: a gate that can reject an identification the anchored graph cannot. */\nexport type IndependentFalsifier = 'magnitude' | 'axis' | 'consequence';\n\n/**\n * How far one candidate is from being a testable claim, dimension by dimension.\n * Deliberately NOT a score: the dimensions are orthogonal and are never summed.\n * @internal\n */\nexport interface CandidateReadiness {\n  /** Connectivity. It makes a candidate worth a look; it is never evidence. */\n  readonly structure: { readonly mergesComponents: boolean; readonly unlocks: number };\n  /** `same-kind`: the names share a kind token. `dimension-only`: nothing but the dimension is shared. */\n  readonly kind: 'same-kind' | 'dimension-only';\n  /**\n   * Independent falsifiers that ran and the candidate survived, and those that\n   * abstained. An abstention is a missing test, never a pass. Numerical\n   * consistency is not listed: it runs from a single anchor and cannot reach\n   * the quantities an identification unlocks.\n   */\n  readonly falsifiers: {\n    readonly survived: readonly IndependentFalsifier[];\n    readonly abstained: readonly IndependentFalsifier[];\n  };\n  readonly mechanismTested: false;\n  readonly dataTested: false;\n  /** What would make the identification testable, each item derived from why a gate abstained. */\n  readonly needs: {\n    /** The premise every literal identification a≡b rests on. */\n    readonly premise: string;\n    /** Endpoints that need a representative magnitude for the magnitude falsifier to run. */\n    readonly magnitudeFor: readonly string[];\n    /** Axes and endpoints that need a stated regime for the axis falsifier to run. */\n    readonly regimeFor: readonly { readonly axis: string; readonly endpoints: readonly string[] }[];\n    /** The consequence check could not re-derive a known law. */\n    readonly derivableConsequence: boolean;\n  };\n  /** The independent observation that would test the premise. */\n  readonly observation: string;\n}\n\n/**\n * Derive a candidate's readiness from its falsifier fields.\n * @internal\n */\nexport function describeReadiness(c: VettedCandidate, consequence?: ConsequenceSignal): CandidateReadiness {\n  const survived: IndependentFalsifier[] = [];\n  const abstained: IndependentFalsifier[] = [];\n  if (c.magnitudeChecked && c.magnitudeAnchorInvariant !== true) survived.push('magnitude');\n  else abstained.push('magnitude');\n  if (c.axisChecked && c.axisClashes.length === 0) survived.push('axis');\n  else if (!c.axisChecked) abstained.push('axis');\n  if (consequence === 'entailed') survived.push('consequence');\n  else abstained.push('consequence');\n  const kind = c.sameKind ? 'same-kind' : 'dimension-only';\n  return {\n    structure: { mergesComponents: c.mergesComponents, unlocks: c.unlocksFromAnchor.length },\n    kind,\n    falsifiers: { survived, abstained },\n    mechanismTested: false,\n    dataTested: false,\n    needs: {\n      premise:\n        kind === 'same-kind'\n          ? `${c.a} and ${c.b} are the same physical quantity, not two quantities of one kind`\n          : `${c.a} and ${c.b} are the same physical quantity, not only both ${c.dim}`,\n      magnitudeFor: c.magnitudeChecked ? [] : [...(c.magnitudeMissing ?? [])],\n      regimeFor: c.axisChecked ? [] : (c.axisUnstated ?? []).map((u) => ({ axis: u.axis, endpoints: [...u.endpoints] })),\n      derivableConsequence: consequence !== 'entailed',\n    },\n    observation:\n      `measure ${c.a} and ${c.b} in one system that defines both: the identification predicts equal values ` +\n      'within uncertainty. If no system defines both, it has no observable content yet.',\n  };\n}\n"]}
+{"version":3,"file":"grounding.js","sourceRoot":"","sources":["../../src/composition/grounding.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAyCtD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,CAAkB,EAClB,WAA+B;IAE/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,6EAA6E;IAC7E,8EAA8E;IAC9E,8EAA8E;IAC9E,IAAI,CAAC,CAAC,qBAAqB;QAAE,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAElE,2EAA2E;IAC3E,gFAAgF;IAChF,+EAA+E;IAC/E,iFAAiF;IACjF,0EAA0E;IAC1E,IAAI,CAAC,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;QACpC,wBAAwB;IAC1B,CAAC;SAAM,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,wBAAwB,KAAK,IAAI,EAAE,CAAC;QACrE,IAAI,CAAC,IAAI,CACP,qHAAqH,CACtH,CAAC;IACJ,CAAC;SAAM,IAAI,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,WAAW,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5E,iGAAiG;QACjG,IAAI,CAAC,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,gBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjH,IAAI,CAAC,CAAC,mBAAmB;YAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IAC9E,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACnD,CAAC;IAED,+EAA+E;IAC/E,8EAA8E;IAC9E,4EAA4E;IAC5E,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;IAClD,CAAC;SAAM,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACnD,CAAC;IAED,0EAA0E;IAC1E,8EAA8E;IAC9E,6EAA6E;IAC7E,gFAAgF;IAChF,IAAI,WAAW,KAAK,UAAU;QAAE,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;SAChE,IAAI,WAAW,KAAK,mBAAmB;QAAE,IAAI,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;SACzF,IAAI,WAAW,KAAK,cAAc;QAAE,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAEhF,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AA0CD;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAkB,EAAE,WAA+B;IACnF,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,gFAAgF;IAChF,IAAI,CAAC,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;QACpC,IAAI,oBAAoB,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;YACnD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAClE,IAAI,CAAC,CAAC,CAAC,WAAW;QAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,WAAW,KAAK,UAAU;QAAE,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;;QACxD,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC;IACzD,OAAO;QACL,SAAS,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,EAAE;QACxF,IAAI;QACJ,UAAU,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE;QACnC,eAAe,EAAE,KAAK;QACtB,UAAU,EAAE,KAAK;QACjB,KAAK,EAAE;YACL,OAAO,EACL,IAAI,KAAK,WAAW;gBAClB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,iEAAiE;gBACpF,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kDAAkD,CAAC,CAAC,GAAG,EAAE;YAChF,YAAY,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC;YACvE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAClH,oBAAoB,EAAE,WAAW,KAAK,UAAU;SACjD;QACD,WAAW,EACT,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,6EAA6E;YACtG,kFAAkF;KACrF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * PI-instrument Phase 1 — the epistemic-grounding ledger. A pure, derived view\n * over a `VettedCandidate`'s already-computed falsifier results: which gates RAN\n * a real comparison and the candidate SURVIVED (`passed`), which could not test\n * it or produced an unadjudicated result (`gaps`), and the honest ceiling — no\n * mechanism test (axis-compatibility is a proxy, not a mechanism test) and no\n * data confrontation. Annotation-only: it changes no verdict, score, or count.\n *\n * The ledger's job is to expose WEAKNESS so a PI knows how much weight a verdict\n * bears. A gate lands in `passed` ONLY if it ran a real comparison and the\n * candidate survived; anything untestable (an abstained gate) or unadjudicated\n * (a novel machine-derived consequence) is a `gap`, never a strength. There is\n * deliberately NO single \"tier\": magnitude (numeric) and axis (regime) are\n * orthogonal evidence and must not collapse into one rank a PI could misread as\n * credibility.\n *\n * @module composition/grounding\n */\nimport type { VettedCandidate } from './discovery.js';\nimport { hasMagnitudeEvidence } from './discovery.js';\nimport type { ConsequenceSignal } from './consequence.js';\n\n/** The epistemic-grounding ledger for one discovery candidate. @public */\nexport interface CandidateGrounding {\n  /** Gates that ran a real comparison AND the candidate survived. */\n  readonly passed: readonly string[];\n  /** Gates that could NOT test the candidate, or produced an unadjudicated result. */\n  readonly gaps: readonly string[];\n  /**\n   * Honest ceiling — no mechanism test has run. This is PERMANENT for a\n   * dimensional discovery candidate, not a placeholder: axis-compatibility is a\n   * regime PROXY, and `entailed` (the strongest available signal — the\n   * consequence re-derives a known canonical law) is a structural-consequence\n   * check, not a mechanism test. A dedicated mechanism-proxy gate was assessed\n   * 2026-07-04 and found NOT buildable without fabricating coupling physics the\n   * catalog does not have (Phase 2 grounding; see the PI-instrument Phase 2\n   * not-build note). Real mechanism lives in the ESTABLISHED-bridge world\n   * (`upt confront`), not in candidate space. The field stays for honesty (the\n   * ceiling is never a silent omission) and for the constructive path: growing\n   * the canonical registry so `entailed` stops abstaining.\n   */\n  readonly mechanismTested: false;\n  /**\n   * Honest ceiling — this candidate is not confronted with real data. This is\n   * PERMANENT for a dimensional discovery candidate, not a placeholder: a\n   * cross-cluster dimensional identification is a coincidence review surface\n   * (0/8 ever adjudicated genuine) with no implied observable to measure. Data\n   * confrontation lives in the ESTABLISHED-bridge world (`upt confront`), which\n   * the evidence-spine work grows. The scientific loop is closed not by\n   * confronting candidates but by the FIREWALL: a candidate must graduate to an\n   * established bridge (human review + citation) before it can be data-tested.\n   * A propose→confront loop over candidates was assessed 2026-07-04 (PI-instrument\n   * Phase 3) and found to have no confrontable target — the honest boundary is\n   * that candidates are unconfrontable until promoted. The field stays for\n   * honesty and flips only for a candidate that is `entailed` into (or graduates\n   * to) a data-confronted relation.\n   */\n  readonly dataTested: false;\n}\n\n/**\n * Derive the grounding ledger from a candidate's existing falsifier results.\n * `consequence` is the optional consequence-annotation signal (from\n * `annotateConsequences`); omit it when the consequence layer did not run.\n *\n * Designed for `promising` candidates (the ones a PI reviews), but honest for\n * any candidate: it never reports a gate as `passed` unless it actually ran and\n * the candidate survived it.\n *\n * @public\n */\nexport function describeGrounding(\n  c: VettedCandidate,\n  consequence?: ConsequenceSignal,\n): CandidateGrounding {\n  const passed: string[] = [];\n  const gaps: string[] = [];\n\n  // Numerical-consistency: the retrodiction filter always runs. It is `passed`\n  // only when the candidate is actually consistent (a contradictory candidate's\n  // failure is its verdict, not a grounding line — this view is for survivors).\n  if (c.numericallyConsistent) passed.push('numerical-consistency');\n\n  // Magnitude gate: ran only when both endpoints had a representative value.\n  // A clash is the gate FIRING: its failure is the magnitude-clash verdict, not a\n  // grounding line (as for numerical consistency above), so it is neither passed\n  // nor a gap. An anchor-invariant ratio is fixed by the graph at every anchor, so\n  // its agreement is an identity, not a survived test (persona finding L3).\n  if (c.verdict === 'magnitude-clash') {\n    // the verdict states it\n  } else if (c.magnitudeChecked && c.magnitudeAnchorInvariant === true) {\n    gaps.push(\n      'magnitude (anchor-invariant: the graph fixes this ratio at every anchor, so the match is an identity, not evidence)',\n    );\n  } else if (c.magnitudeChecked) {\n    const parts: string[] = [];\n    if (c.ordersApart != null) parts.push(`${c.ordersApart.toFixed(1)} orders`);\n    // A magnitude from the quantity's own equation is not anchor-derived: say which, and where from.\n    if ((c.magnitudeDerived ?? []).length > 0) parts.push(`${c.magnitudeDerived!.join(', ')} from its own equation`);\n    if (c.magnitudeUsedAnchor) parts.push('anchor-derived');\n    passed.push(parts.length ? `magnitude (${parts.join(', ')})` : 'magnitude');\n  } else {\n    gaps.push('magnitude (no representative value)');\n  }\n\n  // Axis-compatibility: honestly PARTIAL — \"≥1 regime axis resolved and agreed\",\n  // never \"fully axis-checked\". Cleared only when an axis was resolved AND none\n  // clashed. (A clash is the axis-clash verdict, not a survivor's grounding.)\n  if (c.axisChecked && c.axisClashes.length === 0) {\n    passed.push('axis-compatible (≥1 regime axis)');\n  } else if (!c.axisChecked) {\n    gaps.push('axis (regime attributes unresolved)');\n  }\n\n  // Consequence: ONLY `entailed` clears (the consequence re-derives a known\n  // canonical law — a real check against standard physics). `novel-consequence`\n  // is an UNADJUDICATED machine-surfaced relation — a weakness to investigate,\n  // not a passed test. `inconclusive` means the consequence layer could not test.\n  if (consequence === 'entailed') passed.push('consequence: entailed');\n  else if (consequence === 'novel-consequence') gaps.push('consequence: novel (unadjudicated)');\n  else if (consequence === 'inconclusive') gaps.push('consequence: inconclusive');\n\n  return { passed, gaps, mechanismTested: false, dataTested: false };\n}\n\n/** An independent falsifier: a gate that can reject an identification the anchored graph cannot. */\nexport type IndependentFalsifier = 'magnitude' | 'axis' | 'consequence';\n\n/**\n * How far one candidate is from being a testable claim, dimension by dimension.\n * Deliberately NOT a score: the dimensions are orthogonal and are never summed.\n * @internal\n */\nexport interface CandidateReadiness {\n  /** Connectivity. It makes a candidate worth a look; it is never evidence. */\n  readonly structure: { readonly mergesComponents: boolean; readonly unlocks: number };\n  /** `same-kind`: the names share a kind token. `dimension-only`: nothing but the dimension is shared. */\n  readonly kind: 'same-kind' | 'dimension-only';\n  /**\n   * Independent falsifiers that ran and the candidate survived, and those that\n   * abstained. An abstention is a missing test, never a pass. Numerical\n   * consistency is not listed: it runs from a single anchor and cannot reach\n   * the quantities an identification unlocks.\n   */\n  readonly falsifiers: {\n    readonly survived: readonly IndependentFalsifier[];\n    readonly abstained: readonly IndependentFalsifier[];\n  };\n  readonly mechanismTested: false;\n  readonly dataTested: false;\n  /** What would make the identification testable, each item derived from why a gate abstained. */\n  readonly needs: {\n    /** The premise every literal identification a≡b rests on. */\n    readonly premise: string;\n    /** Endpoints that need a representative magnitude for the magnitude falsifier to run. */\n    readonly magnitudeFor: readonly string[];\n    /** Axes and endpoints that need a stated regime for the axis falsifier to run. */\n    readonly regimeFor: readonly { readonly axis: string; readonly endpoints: readonly string[] }[];\n    /** The consequence check could not re-derive a known law. */\n    readonly derivableConsequence: boolean;\n  };\n  /** The independent observation that would test the premise. */\n  readonly observation: string;\n}\n\n/**\n * Derive a candidate's readiness from its falsifier fields.\n * @internal\n */\nexport function describeReadiness(c: VettedCandidate, consequence?: ConsequenceSignal): CandidateReadiness {\n  const survived: IndependentFalsifier[] = [];\n  const abstained: IndependentFalsifier[] = [];\n  // A magnitude clash is the falsifier firing: it neither survived nor abstained.\n  if (c.verdict !== 'magnitude-clash') {\n    if (hasMagnitudeEvidence(c)) survived.push('magnitude');\n    else abstained.push('magnitude');\n  }\n  if (c.axisChecked && c.axisClashes.length === 0) survived.push('axis');\n  else if (!c.axisChecked) abstained.push('axis');\n  if (consequence === 'entailed') survived.push('consequence');\n  else abstained.push('consequence');\n  const kind = c.sameKind ? 'same-kind' : 'dimension-only';\n  return {\n    structure: { mergesComponents: c.mergesComponents, unlocks: c.unlocksFromAnchor.length },\n    kind,\n    falsifiers: { survived, abstained },\n    mechanismTested: false,\n    dataTested: false,\n    needs: {\n      premise:\n        kind === 'same-kind'\n          ? `${c.a} and ${c.b} are the same physical quantity, not two quantities of one kind`\n          : `${c.a} and ${c.b} are the same physical quantity, not only both ${c.dim}`,\n      magnitudeFor: c.magnitudeChecked ? [] : [...(c.magnitudeMissing ?? [])],\n      regimeFor: c.axisChecked ? [] : (c.axisUnstated ?? []).map((u) => ({ axis: u.axis, endpoints: [...u.endpoints] })),\n      derivableConsequence: consequence !== 'entailed',\n    },\n    observation:\n      `measure ${c.a} and ${c.b} in one system that defines both: the identification predicts equal values ` +\n      'within uncertainty. If no system defines both, it has no observable content yet.',\n  };\n}\n"]}

package/dist/composition/identifiability.d.ts

@@ -21,12 +21,28 @@
  * resulting nonlinear system has a unique numeric solution (undecidable
  * in general for closed-form evaluators). "Independent derivation" means
  * a structurally distinct edge, NOT a provably-independent formula — two
- * edges encoding the same relation are counted as two (an honest
- * over-count). The classifier PROPOSES; humans filter (Part-VI §XXVII-B),
- * exactly as `enumerateCompositions` does.
+ * edges encoding the same relation are counted as two by the forward
+ * count (an honest over-count, kept as `surplusConstraints`). The
+ * classifier PROPOSES; humans filter (Part-VI §XXVII-B), exactly as
+ * `enumerateCompositions` does.
+ *
+ * TWO INSTRUMENTS, TWO FIELDS. The forward closure fires an edge only when
+ * every source is known, so it never reads a law in reverse. The MONOMIAL
+ * edges (a `symbolic` product of powers, or a canonical equation with a
+ * stated monomial) are also a linear system in log space: `y = C Π xᵢ^aᵢ`
+ * is the row `log y − Σ aᵢ log xᵢ = log C`. Stacked with a unit row per
+ * known quantity, the exact null space (MathTS `rationalNullspace`) says
+ * which quantities are DETERMINED (their column is zero in every basis
+ * vector) whichever way the laws are read, and `distinct rows − rank` is
+ * the number of independent consistency checks, where a restated monomial
+ * is one row, not two. {@link identifiabilityByRank} is that instrument;
+ * {@link classifyIdentifiability} reports both, `determinable` being their
+ * union, and names every law the rank read in reverse, because a validity
+ * domain is stated on the sources and a caller may refuse the inversion.
  *
  * @module composition/identifiability
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
 import type { BridgeEdge } from './edge.js';
 import type { QuantityIdentification } from './compose.js';
 /** The four-way structural-identifiability verdict. @public */
@@ -42,6 +58,34 @@ export interface IdentifiabilityOptions {
      */
     readonly identifications?: readonly QuantityIdentification[];
 }
+/**
+ * What the log-space rank says about one known set, over the monomial edges
+ * of the graph. See the module docs: this is the second instrument beside
+ * the forward closure, and its numbers are not the closure's.
+ *
+ * @public
+ */
+export interface RankIdentifiability {
+    /** Every quantity whose column is zero in every null-space basis vector, sorted. */
+    readonly determined: readonly string[];
+    /** The quantities the rank determines that the forward closure does not, sorted. */
+    readonly determinedByRankOnly: readonly string[];
+    /**
+     * Independent consistency checks the system carries: distinct rows
+     * (a restated monomial is one row) minus the rank. Zero when every row
+     * is needed to determine what it determines.
+     */
+    readonly surplusChecks: number;
+    /**
+     * Ids of the monomial edges the rank read against their direction: a
+     * source of the edge is determined, and not by the forward closure over
+     * the monomial edges. A caller whose validity domain is stated on the
+     * sources may refuse these.
+     */
+    readonly usedInReverse: readonly string[];
+    /** Ids of the edges that contributed a row (a readable monomial, target not among its sources). */
+    readonly monomialEdges: readonly string[];
+}
 /** The result of classifying one target against one known set. @public */
 export interface IdentifiabilityResult {
     /** The target quantity name that was classified. */
@@ -70,8 +114,14 @@ export interface IdentifiabilityResult {
      * moves the target toward determined. Empty when determinable.
      */
     readonly blockingFrontier: readonly string[];
-    /** Every quantity determinable from the known set (the forward closure). */
+    /**
+     * Every quantity determinable from the known set: the forward closure
+     * united with what the log-space rank determines through the monomial
+     * edges (`rank.determined`), sorted.
+     */
     readonly determinable: readonly string[];
+    /** The rank instrument's own report for this known set. */
+    readonly rank: RankIdentifiability;
 }
 /**
  * The monotone forward closure: the least set ⊇ `knownNames` closed under
@@ -84,6 +134,43 @@ export interface IdentifiabilityResult {
  * @public
  */
 export declare function forwardClosure(edges: readonly BridgeEdge[], knownNames: readonly string[], identifications?: readonly QuantityIdentification[]): Set<string>;
+/**
+ * The exact exponents of an edge's monomial over its SOURCE names, or
+ * undefined when it is not one. Internal: a `Fraction` is not a root type.
+ * @internal
+ */
+export type EdgeMonomialReader = (edge: BridgeEdge) => ReadonlyMap<string, Fraction> | undefined;
+/**
+ * The exact exponents of `edge`'s target over its source names, read from
+ * its `symbolic` form, or, for a canonical edge with no symbolic form, from
+ * the equation's stated monomial and `formulaFactors`. A leaf that is not a
+ * source (a constant, a literal, a held stub) is part of the prefactor and
+ * contributes no column. Undefined when the form is not a monomial, when an
+ * exponent is not a small rational, or when the target is among the sources.
+ *
+ * @internal
+ */
+export declare function edgeMonomial(edge: BridgeEdge): ReadonlyMap<string, Fraction> | undefined;
+/**
+ * {@link identifiabilityByRank} with the monomial reader chosen by the
+ * caller (the default is {@link edgeMonomial}). A custom reader's index and
+ * results are cached beside the default's, never in its place.
+ *
+ * @internal
+ */
+export declare function identifiabilityByRankWith(edges: readonly BridgeEdge[], knownNames: readonly string[], reader: EdgeMonomialReader, opts?: IdentifiabilityOptions): RankIdentifiability;
+/**
+ * The log-space rank: which quantities the monomial edges determine from
+ * `knownNames`, whichever direction each law is read, how many independent
+ * consistency checks the system carries, and which laws were read in
+ * reverse. Identifications stay directed, as in {@link forwardClosure}: a
+ * name they reach joins the known rows, and the system is solved again
+ * until nothing new is determined. Non-monomial edges contribute nothing
+ * here; the forward closure is their instrument.
+ *
+ * @public
+ */
+export declare function identifiabilityByRank(edges: readonly BridgeEdge[], knownNames: readonly string[], opts?: IdentifiabilityOptions): RankIdentifiability;
 /**
  * Classify the structural identifiability of `targetName` given
  * `knownNames` over `edges`. See the module docs and

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

@@ -1 +1 @@
-{"version":3,"file":"identifiability.d.ts","sourceRoot":"","sources":["../../src/composition/identifiability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,+DAA+D;AAC/D,MAAM,MAAM,sBAAsB,GAC9B,OAAO,GACP,kBAAkB,GAClB,oBAAoB,GACpB,iBAAiB,CAAC;AAEtB,0CAA0C;AAC1C,MAAM,WAAW,sBAAsB;IACrC;;;;;;OAMG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAED,0EAA0E;AAC1E,MAAM,WAAW,qBAAqB;IACpC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,4EAA4E;IAC5E,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1C;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,eAAe,GAAE,SAAS,sBAAsB,EAA6B,GAC5E,GAAG,CAAC,MAAM,CAAC,CAoBb;AAyBD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,UAAU,EAAE,MAAM,EAClB,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,CAyDvB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,EAAE,CAKzB"}
+{"version":3,"file":"identifiability.d.ts","sourceRoot":"","sources":["../../src/composition/identifiability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAM3D,+DAA+D;AAC/D,MAAM,MAAM,sBAAsB,GAC9B,OAAO,GACP,kBAAkB,GAClB,oBAAoB,GACpB,iBAAiB,CAAC;AAEtB,0CAA0C;AAC1C,MAAM,WAAW,sBAAsB;IACrC;;;;;;OAMG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAED;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,oFAAoF;IACpF,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,oFAAoF;IACpF,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;IACjD;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;;;;;OAKG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,mGAAmG;IACnG,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;CAC3C;AAED,0EAA0E;AAC1E,MAAM,WAAW,qBAAqB;IACpC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;CACpC;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,eAAe,GAAE,SAAS,sBAAsB,EAA6B,GAC5E,GAAG,CAAC,MAAM,CAAC,CAoBb;AAMD;;;;GAIG;AACH,MAAM,MAAM,kBAAkB,GAAG,CAAC,IAAI,EAAE,UAAU,KAAK,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAAC;AAEjG;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAsBxF;AA4OD;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,MAAM,EAAE,kBAAkB,EAC1B,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAErB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAErB;AAsFD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,UAAU,EAAE,MAAM,EAClB,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,CAmFvB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,EAAE,CAKzB"}