universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/consequence.js.map

@@ -1 +1 @@
-{"version":3,"file":"consequence.js","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAwB/D,uDAAuD;AACvD,SAAS,aAAa,CAAC,CAA8B,EAAE,CAA8B;IACnF,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAoF,EACpF,SAAS,GAAiC,mBAAmB;IAE7D,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,cAAc,GAAkB,IAAI,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,SAAS;YAAE,SAAS;QAC5B,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAClE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;YAAE,SAAS;QAC3E,IAAI,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;YAC3C,cAAc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,uEAAuE;YAC/F,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB;QACzD,QAAQ,EAAE;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI;YAC5B,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAChD,iBAAiB,EAAE,SAAS;YAC5B,cAAc;YACd,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAAC,iBAAiB;SAC1D;KACF,CAAC;AACJ,CAAC;AA8BD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAoF,EACpF,SAAS,GAA6B,mBAAmB;IAEzD,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC;IAC9E,uEAAuE;IACvE,4EAA4E;IAC5E,2EAA2E;IAC3E,sEAAsE;IACtE,oDAAoD;IACpD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,iBAAiB;SAC9B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAG,IAAI,EAAE,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;IAE1E,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9G,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACrG,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,SAAU,CAAC,KAAK,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,OAAO,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,sBAAsB;QACtD,MAAM,EAAE,KAAK;QACb,MAAM,EAAE;YACN,IAAI,EAAE,SAAS;YACf,YAAY,EAAE,MAAM;YACpB,OAAO,EACL,GAAG,SAAS,WAAW,SAAS,OAAO,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,SAAS,aAAa;gBAC1H,GAAG,UAAU,WAAW,WAAW,KAAK,OAAO,gBAAgB,cAAc,CAAC,GAAG,UAAU;gBAC3F,OAAO,WAAW,wBAAwB,SAAS,EAAE;SACxD;QACD,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtF,cAAc,EAAE;YACd,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,IAAI;YACrB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,sBAAsB,EAAE,OAAO,CAAC,MAAM;YACtC,KAAK,EAAE,6BAA6B;SACrC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAwB;IAOxB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAEnD,2EAA2E;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0E,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,+FAA+F;YAC/F,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU;gBAAE,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC;QACzD,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,CAAC,OAAO,KAAK,WAAW;YAAE,OAAO,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAsB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC;QACpE,OAAO,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Consequence propagation — the machine pre-classifier for the human\n * adjudication ledger. A POST-PASS annotation over ranked candidates (mirrors\n * `annotateAdjudications`): reuse `deriveProposedBridges` to derive each\n * promising candidate's monomial consequence, then compare its `normalForm`\n * against the canonical registry (SAME target AND SAME governing set) to label\n * it `entailed` (re-derives known physics), `novel-consequence` (valid, no\n * match), or `inconclusive` (no monomial consequence). Annotation-only: never\n * mutates the catalog/graph, never re-orders or re-scores, never writes to\n * ADJUDICATIONS. The underlying ProposedBridge stays `status:'unadjudicated'`.\n *\n * @module composition/consequence\n */\nimport type { VettedCandidate } from './discovery.js';\nimport type { ProposedBridge } from './proposed-bridges.js';\nimport { deriveProposedBridges } from './proposed-bridges.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\n\n/** @public */\nexport type ConsequenceSignal = 'entailed' | 'novel-consequence' | 'inconclusive';\n\n/** @public */\nexport interface ConsequenceEvidence {\n  readonly target: string;\n  readonly governing: readonly string[];\n  readonly derivedNormalForm: string;\n  /** The id of the canonical equation whose normalForm matched, or null. */\n  readonly canonicalMatch: string | null;\n  readonly sourceEquationIds: readonly [string, string];\n}\n\n/** @public */\nexport type ConsequenceAnnotatedCandidate = VettedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\n/** Governing-name set equality (order-insensitive). */\nfunction sameGoverning(a: readonly { name: string }[], b: readonly { name: string }[]): boolean {\n  if (a.length !== b.length) return false;\n  const sa = new Set(a.map((g) => g.name));\n  return b.every((g) => sa.has(g.name));\n}\n\n/**\n * Classify ONE derived proposal against the canonical registry.\n * `entailed` iff some canonical equation with a `scalarAst` has the SAME target\n * name AND SAME governing set AND a matching `normalForm`. Otherwise\n * `novel-consequence`. There is NO contradiction signal — a differing normalForm\n * for the same target is NOT a contradiction (design r2: E=mc² vs E=hf).\n * @public\n */\nexport function classifyProposal(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): { readonly signal: Exclude<ConsequenceSignal, 'inconclusive'>; readonly evidence: ConsequenceEvidence } {\n  const derivedNF = normalForm(proposal.scalarAst);\n  let canonicalMatch: string | null = null;\n  for (const ce of canonical) {\n    if (!ce.scalarAst) continue;\n    if (ce.dimensional.target.name !== proposal.target.name) continue;\n    if (!sameGoverning(ce.dimensional.governing, proposal.governing)) continue;\n    if (normalForm(ce.scalarAst) === derivedNF) {\n      canonicalMatch = ce.id; // CanonicalEquation.id is a top-level `readonly id: string` (verified)\n      break;\n    }\n  }\n  return {\n    signal: canonicalMatch ? 'entailed' : 'novel-consequence',\n    evidence: {\n      target: proposal.target.name,\n      governing: proposal.governing.map((g) => g.name),\n      derivedNormalForm: derivedNF,\n      canonicalMatch,\n      sourceEquationIds: proposal.derivedFrom.sourceEquationIds,\n    },\n  };\n}\n\n/**\n * What a derived proposal claims, in a form that travels with it: the premise,\n * whether it is a known law or a conditional identity, what the solved-for\n * symbol means, the source equations' assumptions, and the exact scope of the\n * canonical-match check.\n * @internal\n */\nexport interface DerivedClaim {\n  /** The unadjudicated identification the relation rests on. */\n  readonly premise: string;\n  /** `known-law`: re-derives a registry equation. `conditional-identity`: holds only if the premise does. */\n  readonly relation: 'known-law' | 'conditional-identity';\n  /** No derived proposal has been confronted with a measurement. */\n  readonly tested: false;\n  readonly symbol: { readonly name: string; readonly fromEquation: string; readonly meaning: string };\n  readonly assumptions: readonly { readonly equation: string; readonly assumptions: readonly string[] }[];\n  readonly canonicalMatch: {\n    readonly id: string | null;\n    readonly sameTarget: number;\n    readonly sameTargetAndGoverning: number;\n    readonly scope: 'the canonical registry only';\n  };\n}\n\ntype ClaimEquation = Pick<CanonicalEquation, 'id' | 'name' | 'assumptions' | 'scalarAst'> & {\n  readonly dimensional: Pick<CanonicalEquation['dimensional'], 'target' | 'governing'>;\n};\n\n/**\n * Describe the claim a derived proposal makes. Pure; the proposal is unchanged.\n * @internal\n */\nexport function describeDerivedClaim(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly ClaimEquation[] = CANONICAL_EQUATIONS,\n): DerivedClaim {\n  const { identification, sourceEquationIds, solvedFor } = proposal.derivedFrom;\n  // `deriveProposedBridges` resolves the first source id for the smaller\n  // endpoint name and the second for the larger, so each id's target is known\n  // even when the source is a catalog bridge the canonical registry does not\n  // hold (then `canonical.find` is undefined; the sentence once printed\n  // \"equals ? (undefined)\" there, 9.0.0 audit §7 T1).\n  const [t0, t1] = [identification.a, identification.b].sort();\n  const endpointOf = (id: string): string => (id === sourceEquationIds[0] ? t0 : t1);\n  const sources = sourceEquationIds\n    .map((id) => canonical.find((e) => e.id === id))\n    .filter((e): e is ClaimEquation => e !== undefined);\n  const home = sources.find((e) => e.dimensional.governing.some((g) => g.name === solvedFor)) ?? sources[0];\n  const homeId = home?.id ?? sourceEquationIds[0];\n  const otherId = sourceEquationIds.find((id) => id !== homeId) ?? sourceEquationIds[1];\n  const other = sources.find((e) => e.id === otherId);\n  const homeTarget = home?.dimensional.target.name ?? endpointOf(homeId);\n  const otherTarget = other?.dimensional.target.name ?? endpointOf(otherId);\n\n  const derivedNF = normalForm(proposal.scalarAst);\n  const sameTarget = canonical.filter((e) => e.scalarAst && e.dimensional.target.name === proposal.target.name);\n  const sameGov = sameTarget.filter((e) => sameGoverning(e.dimensional.governing, proposal.governing));\n  const match = sameGov.find((e) => normalForm(e.scalarAst!) === derivedNF);\n\n  return {\n    premise: `${identification.a} ≡ ${identification.b}`,\n    relation: match ? 'known-law' : 'conditional-identity',\n    tested: false,\n    symbol: {\n      name: solvedFor,\n      fromEquation: homeId,\n      meaning:\n        `${solvedFor} is the ${solvedFor} of ${homeId}${home !== undefined ? ` (${home.name})` : ''}: the ${solvedFor} for which ` +\n        `${homeTarget} equals ${otherTarget} (${otherId}) — an equal-${identification.dim} scale; ` +\n        `the ${otherTarget} side is not given a ${solvedFor}`,\n    },\n    assumptions: sources.map((e) => ({ equation: e.id, assumptions: [...e.assumptions] })),\n    canonicalMatch: {\n      id: match?.id ?? null,\n      sameTarget: sameTarget.length,\n      sameTargetAndGoverning: sameGov.length,\n      scope: 'the canonical registry only',\n    },\n  };\n}\n\n/**\n * Annotate ranked candidates with their consequence signal. Order-preserving,\n * 1:1 with the input; only `promising` candidates are classified (they are the\n * only ones `deriveProposedBridges` processes). A promising candidate with no\n * derived proposal is `inconclusive`. Generic over the input candidate type so\n * it composes with other post-pass annotators (e.g. `annotateAdjudications`)\n * without forgetting fields the caller already attached.\n * @public\n */\nexport function annotateConsequences<T extends VettedCandidate>(\n  candidates: readonly T[],\n): readonly (T & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n})[] {\n  const promising = candidates.filter((c) => c.verdict === 'promising');\n  const proposals = deriveProposedBridges(promising);\n\n  // Group proposals + their classification by the sorted candidate-pair key.\n  const byPair = new Map<string, { signal: ConsequenceSignal; evidence: ConsequenceEvidence[] }>();\n  for (const p of proposals) {\n    const key = [p.derivedFrom.identification.a, p.derivedFrom.identification.b].sort().join('~');\n    const cls = classifyProposal(p);\n    const cur = byPair.get(key);\n    if (!cur) {\n      byPair.set(key, { signal: cls.signal, evidence: [cls.evidence] });\n    } else {\n      cur.evidence.push(cls.evidence);\n      // entailed dominates novel: if ANY consequence re-derives known physics, the pair is entailed.\n      if (cls.signal === 'entailed') cur.signal = 'entailed';\n    }\n  }\n\n  return candidates.map((c) => {\n    if (c.verdict !== 'promising') return c;\n    const key = [c.a, c.b].sort().join('~');\n    const hit = byPair.get(key);\n    const signal: ConsequenceSignal = hit ? hit.signal : 'inconclusive';\n    return { ...c, consequence: { signal, evidence: hit?.evidence ?? [] } };\n  });\n}\n"]}
+{"version":3,"file":"consequence.js","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAiC/D,uDAAuD;AACvD,SAAS,aAAa,CAAC,CAA8B,EAAE,CAA8B;IACnF,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAoF,EACpF,SAAS,GAAiC,mBAAmB;IAE7D,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,cAAc,GAAkB,IAAI,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,SAAS;YAAE,SAAS;QAC5B,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAClE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;YAAE,SAAS;QAC3E,IAAI,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;YAC3C,cAAc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,uEAAuE;YAC/F,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB;QACzD,QAAQ,EAAE;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI;YAC5B,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAChD,iBAAiB,EAAE,SAAS;YAC5B,cAAc;YACd,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAAC,iBAAiB;SAC1D;KACF,CAAC;AACJ,CAAC;AA8BD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAoF,EACpF,SAAS,GAA6B,mBAAmB;IAEzD,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC;IAC9E,uEAAuE;IACvE,4EAA4E;IAC5E,2EAA2E;IAC3E,sEAAsE;IACtE,oDAAoD;IACpD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,iBAAiB;SAC9B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAG,IAAI,EAAE,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;IAE1E,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9G,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACrG,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,SAAU,CAAC,KAAK,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,OAAO,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,sBAAsB;QACtD,MAAM,EAAE,KAAK;QACb,MAAM,EAAE;YACN,IAAI,EAAE,SAAS;YACf,YAAY,EAAE,MAAM;YACpB,OAAO,EACL,GAAG,SAAS,WAAW,SAAS,OAAO,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,SAAS,aAAa;gBAC1H,GAAG,UAAU,WAAW,WAAW,KAAK,OAAO,gBAAgB,cAAc,CAAC,GAAG,UAAU;gBAC3F,OAAO,WAAW,wBAAwB,SAAS,EAAE;SACxD;QACD,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtF,cAAc,EAAE;YACd,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,IAAI;YACrB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,sBAAsB,EAAE,OAAO,CAAC,MAAM;YACtC,KAAK,EAAE,6BAA6B;SACrC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAwB;IAOxB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAEnD,2EAA2E;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0E,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,+FAA+F;YAC/F,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU;gBAAE,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC;QACzD,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAsB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC;QACpE,OAAO,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Consequence propagation — the machine pre-classifier for the human\n * adjudication ledger. A POST-PASS annotation over ranked candidates (mirrors\n * `annotateAdjudications`): reuse `deriveProposedBridges` to derive each\n * promising candidate's monomial consequence, then compare its `normalForm`\n * against the canonical registry (SAME target AND SAME governing set) to label\n * it `entailed` (re-derives known physics), `novel-consequence` (valid, no\n * match), or `inconclusive` (no monomial consequence). Annotation-only: never\n * mutates the catalog/graph, never re-orders or re-scores, never writes to\n * ADJUDICATIONS. The underlying ProposedBridge stays `status:'unadjudicated'`.\n *\n * @module composition/consequence\n */\nimport type { VettedCandidate } from './discovery.js';\nimport { isPromisingTier } from './discovery.js';\nimport type { ProposedBridge } from './proposed-bridges.js';\nimport { deriveProposedBridges } from './proposed-bridges.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\n\n/**\n * The consequence signal of a promising candidate: entailed, novel-consequence or inconclusive.\n * @public\n */\nexport type ConsequenceSignal = 'entailed' | 'novel-consequence' | 'inconclusive';\n\n/**\n * The evidence behind one consequence signal: the derived claim and any canonical match.\n * @public\n */\nexport interface ConsequenceEvidence {\n  readonly target: string;\n  readonly governing: readonly string[];\n  readonly derivedNormalForm: string;\n  /** The id of the canonical equation whose normalForm matched, or null. */\n  readonly canonicalMatch: string | null;\n  readonly sourceEquationIds: readonly [string, string];\n}\n\n/**\n * A vetted candidate, plus its optional consequence signal and evidence.\n * @public\n */\nexport type ConsequenceAnnotatedCandidate = VettedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\n/** Governing-name set equality (order-insensitive). */\nfunction sameGoverning(a: readonly { name: string }[], b: readonly { name: string }[]): boolean {\n  if (a.length !== b.length) return false;\n  const sa = new Set(a.map((g) => g.name));\n  return b.every((g) => sa.has(g.name));\n}\n\n/**\n * Classify ONE derived proposal against the canonical registry.\n * `entailed` iff some canonical equation with a `scalarAst` has the SAME target\n * name AND SAME governing set AND a matching `normalForm`. Otherwise\n * `novel-consequence`. There is NO contradiction signal — a differing normalForm\n * for the same target is NOT a contradiction (design r2: E=mc² vs E=hf).\n * @public\n */\nexport function classifyProposal(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): { readonly signal: Exclude<ConsequenceSignal, 'inconclusive'>; readonly evidence: ConsequenceEvidence } {\n  const derivedNF = normalForm(proposal.scalarAst);\n  let canonicalMatch: string | null = null;\n  for (const ce of canonical) {\n    if (!ce.scalarAst) continue;\n    if (ce.dimensional.target.name !== proposal.target.name) continue;\n    if (!sameGoverning(ce.dimensional.governing, proposal.governing)) continue;\n    if (normalForm(ce.scalarAst) === derivedNF) {\n      canonicalMatch = ce.id; // CanonicalEquation.id is a top-level `readonly id: string` (verified)\n      break;\n    }\n  }\n  return {\n    signal: canonicalMatch ? 'entailed' : 'novel-consequence',\n    evidence: {\n      target: proposal.target.name,\n      governing: proposal.governing.map((g) => g.name),\n      derivedNormalForm: derivedNF,\n      canonicalMatch,\n      sourceEquationIds: proposal.derivedFrom.sourceEquationIds,\n    },\n  };\n}\n\n/**\n * What a derived proposal claims, in a form that travels with it: the premise,\n * whether it is a known law or a conditional identity, what the solved-for\n * symbol means, the source equations' assumptions, and the exact scope of the\n * canonical-match check.\n * @internal\n */\nexport interface DerivedClaim {\n  /** The unadjudicated identification the relation rests on. */\n  readonly premise: string;\n  /** `known-law`: re-derives a registry equation. `conditional-identity`: holds only if the premise does. */\n  readonly relation: 'known-law' | 'conditional-identity';\n  /** No derived proposal has been confronted with a measurement. */\n  readonly tested: false;\n  readonly symbol: { readonly name: string; readonly fromEquation: string; readonly meaning: string };\n  readonly assumptions: readonly { readonly equation: string; readonly assumptions: readonly string[] }[];\n  readonly canonicalMatch: {\n    readonly id: string | null;\n    readonly sameTarget: number;\n    readonly sameTargetAndGoverning: number;\n    readonly scope: 'the canonical registry only';\n  };\n}\n\ntype ClaimEquation = Pick<CanonicalEquation, 'id' | 'name' | 'assumptions' | 'scalarAst'> & {\n  readonly dimensional: Pick<CanonicalEquation['dimensional'], 'target' | 'governing'>;\n};\n\n/**\n * Describe the claim a derived proposal makes. Pure; the proposal is unchanged.\n * @internal\n */\nexport function describeDerivedClaim(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly ClaimEquation[] = CANONICAL_EQUATIONS,\n): DerivedClaim {\n  const { identification, sourceEquationIds, solvedFor } = proposal.derivedFrom;\n  // `deriveProposedBridges` resolves the first source id for the smaller\n  // endpoint name and the second for the larger, so each id's target is known\n  // even when the source is a catalog bridge the canonical registry does not\n  // hold (then `canonical.find` is undefined; the sentence once printed\n  // \"equals ? (undefined)\" there, 9.0.0 audit §7 T1).\n  const [t0, t1] = [identification.a, identification.b].sort();\n  const endpointOf = (id: string): string => (id === sourceEquationIds[0] ? t0 : t1);\n  const sources = sourceEquationIds\n    .map((id) => canonical.find((e) => e.id === id))\n    .filter((e): e is ClaimEquation => e !== undefined);\n  const home = sources.find((e) => e.dimensional.governing.some((g) => g.name === solvedFor)) ?? sources[0];\n  const homeId = home?.id ?? sourceEquationIds[0];\n  const otherId = sourceEquationIds.find((id) => id !== homeId) ?? sourceEquationIds[1];\n  const other = sources.find((e) => e.id === otherId);\n  const homeTarget = home?.dimensional.target.name ?? endpointOf(homeId);\n  const otherTarget = other?.dimensional.target.name ?? endpointOf(otherId);\n\n  const derivedNF = normalForm(proposal.scalarAst);\n  const sameTarget = canonical.filter((e) => e.scalarAst && e.dimensional.target.name === proposal.target.name);\n  const sameGov = sameTarget.filter((e) => sameGoverning(e.dimensional.governing, proposal.governing));\n  const match = sameGov.find((e) => normalForm(e.scalarAst!) === derivedNF);\n\n  return {\n    premise: `${identification.a} ≡ ${identification.b}`,\n    relation: match ? 'known-law' : 'conditional-identity',\n    tested: false,\n    symbol: {\n      name: solvedFor,\n      fromEquation: homeId,\n      meaning:\n        `${solvedFor} is the ${solvedFor} of ${homeId}${home !== undefined ? ` (${home.name})` : ''}: the ${solvedFor} for which ` +\n        `${homeTarget} equals ${otherTarget} (${otherId}) — an equal-${identification.dim} scale; ` +\n        `the ${otherTarget} side is not given a ${solvedFor}`,\n    },\n    assumptions: sources.map((e) => ({ equation: e.id, assumptions: [...e.assumptions] })),\n    canonicalMatch: {\n      id: match?.id ?? null,\n      sameTarget: sameTarget.length,\n      sameTargetAndGoverning: sameGov.length,\n      scope: 'the canonical registry only',\n    },\n  };\n}\n\n/**\n * Annotate ranked candidates with their consequence signal. Order-preserving,\n * 1:1 with the input; only candidates in a promising tier (`promising` or\n * `promising-unchecked`) are classified (they are the only ones\n * `deriveProposedBridges` processes). A promising candidate with no\n * derived proposal is `inconclusive`. Generic over the input candidate type so\n * it composes with other post-pass annotators (e.g. `annotateAdjudications`)\n * without forgetting fields the caller already attached.\n * @public\n */\nexport function annotateConsequences<T extends VettedCandidate>(\n  candidates: readonly T[],\n): readonly (T & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n})[] {\n  const promising = candidates.filter((c) => isPromisingTier(c.verdict));\n  const proposals = deriveProposedBridges(promising);\n\n  // Group proposals + their classification by the sorted candidate-pair key.\n  const byPair = new Map<string, { signal: ConsequenceSignal; evidence: ConsequenceEvidence[] }>();\n  for (const p of proposals) {\n    const key = [p.derivedFrom.identification.a, p.derivedFrom.identification.b].sort().join('~');\n    const cls = classifyProposal(p);\n    const cur = byPair.get(key);\n    if (!cur) {\n      byPair.set(key, { signal: cls.signal, evidence: [cls.evidence] });\n    } else {\n      cur.evidence.push(cls.evidence);\n      // entailed dominates novel: if ANY consequence re-derives known physics, the pair is entailed.\n      if (cls.signal === 'entailed') cur.signal = 'entailed';\n    }\n  }\n\n  return candidates.map((c) => {\n    if (!isPromisingTier(c.verdict)) return c;\n    const key = [c.a, c.b].sort().join('~');\n    const hit = byPair.get(key);\n    const signal: ConsequenceSignal = hit ? hit.signal : 'inconclusive';\n    return { ...c, consequence: { signal, evidence: hit?.evidence ?? [] } };\n  });\n}\n"]}

package/dist/composition/discovery.d.ts

@@ -38,6 +38,7 @@ import type { QuantityIdentification } from './compose.js';
 import type { RegimeAttributes } from './quantity.js';
 import type { LinkCandidate } from './bridge-analysis.js';
 import type { RepresentativeValue } from './representative-values.js';
+import type { DerivedMagnitudes } from './own-equation-magnitude.js';
 /** The canonical quantity→attributes map (registry nodes + per-equation stamps).
  *  Exported for the axis-discrimination audit. @internal */
 export declare const REGISTRY_ATTRIBUTES_BY_NAME: ReadonlyMap<string, RegimeAttributes>;
@@ -79,10 +80,27 @@ export interface VettedCandidate {
      * value (the gate abstained — see `magnitudeChecked`).
      */
     readonly ordersApart: number | null;
+    /**
+     * The calibrated STRENGTH of the magnitude falsifier against the two values' stated
+     * uncertainties: `2·Φ(−ordersApart / √(σ_a² + σ_b²))`, with σ in decades per representative
+     * value (`sigmaDecades`, default one decade: the table's "good to about one order"; an
+     * anchor-derived value takes the default; a value from the quantity's own equation, its
+     * propagated σ), through MathTS `normalCDF` of the negative
+     * argument so a far tail is not rounded to 0 by `1 − cdf`. It is reported BESIDE the verdict
+     * and changes no verdict: the clash threshold stays `ordersApart > maxOrders`. A small p says
+     * the two magnitudes are hard to reconcile at their stated precision; 2.9 decades at σ = 1
+     * is p ≈ 0.040, no longer a clean pass, while 3.1 decades stays a clash. NOT a credibility
+     * score: it says nothing about whether the identification is true. `null` when the gate
+     * abstained. Optional on the type; the funnel always sets it.
+     */
+    readonly magnitudeP?: number | null;
     /** Both endpoints had a representative value, so the magnitude gate ran. */
     readonly magnitudeChecked: boolean;
     /** The magnitude gate read at least one endpoint value from the graph at
-     *  the anchor (no static table entry) rather than the sourced table. */
+     *  the anchor (no static table entry) rather than the sourced table. A value
+     *  the graph computes from registered constants alone, with no anchor input
+     *  (the target of a source-less equation), is a constant and is not
+     *  anchor-derived. */
     readonly magnitudeUsedAnchor: boolean;
     /**
      * The magnitude comparison used an anchor-derived value, and the ratio of the
@@ -93,17 +111,30 @@ export interface VettedCandidate {
      * the temperature to the Hawking temperature of the anchor mass M, and then
      * the thermal wavelength is exactly 4π ℓ_P for EVERY M. Its anchor-derived
      * magnitude is not a representative magnitude of the quantity at all.
-     * A quantity whose value really is a constant belongs in the
-     * representative-value table, where it is not anchor-derived.
+     * A quantity whose value really is a constant is not anchor-derived: the
+     * sourced table states it, or the graph computes it from registered constants
+     * with no anchor input (`DiscoveryContext.constantValues`), and the probe does
+     * not withhold a comparison of two such values, which can fail by the clash
+     * threshold.
      * A clash stays a clash (the graph itself fixes the two apart); only a pass is
      * withheld, in `describeGrounding`. Optional on the type so hand-built
      * candidates need not state it; the funnel always sets it.
      */
     readonly magnitudeAnchorInvariant?: boolean;
     /**
-     * The endpoints with no representative magnitude (neither in the sourced
-     * table nor valued at the anchor) — why the magnitude gate abstained. Empty
-     * when it ran. Optional on the type; the funnel always sets it.
+     * The endpoints whose magnitude the gate took from the quantity's own equation
+     * (`own-equation-magnitude.ts`): no table value and no no-anchor constant, but
+     * an edge into it whose every source the table or the constants value, at a
+     * propagated σ within one decade. Such a value is not anchor-derived. Empty
+     * when neither endpoint's magnitude came from there. Optional on the type; the
+     * funnel always sets it.
+     */
+    readonly magnitudeDerived?: readonly string[];
+    /**
+     * The endpoints with no representative magnitude (not in the sourced table,
+     * not a no-anchor constant, not derived from their own equation, not valued
+     * at the anchor) — why the magnitude gate abstained. Empty when it ran.
+     * Optional on the type; the funnel always sets it.
      */
     readonly magnitudeMissing?: readonly string[];
     /**
@@ -132,11 +163,18 @@ export interface VettedCandidate {
      *                       compares catalog labels and runs no computation, so
      *                       it is never counted or described as a falsification.
      * - `promising`       — consistent AND connects disconnected physics AND
-     *                       unlocks ≥1 quantity. Worth physicist review.
+     *                       unlocks ≥1 quantity, AND the magnitude falsifier ran
+     *                       and could have failed ({@link hasMagnitudeEvidence}).
+     *                       Worth physicist review.
+     * - `promising-unchecked` — the same structure, but the magnitude falsifier
+     *                       never tested it: it abstained (an endpoint has no
+     *                       representative magnitude) or its pass is anchor-invariant
+     *                       and so could not fail. A separate count, never added to
+     *                       `promising` (AGENTS law 4).
      * - `inert`           — consistent but structurally/numerically idle (a
      *                       dimensional coincidence with no consequence).
      */
-    readonly verdict: 'promising' | 'inert' | 'contradictory' | 'magnitude-clash' | 'axis-clash';
+    readonly verdict: 'promising' | 'promising-unchecked' | 'inert' | 'contradictory' | 'magnitude-clash' | 'axis-clash';
     /** Composite ranking score (higher = more worth review). */
     readonly score: number;
     /**
@@ -164,6 +202,23 @@ export interface VettedCandidate {
      *  (weak name-based prior; informational). */
     readonly touchesCanonical: boolean;
 }
+/**
+ * Whether the magnitude falsifier ran on a candidate AND could have failed: both endpoints had a
+ * representative magnitude (`magnitudeChecked`) and the comparison is not anchor-invariant. An
+ * anchor-invariant pass is fixed by the graph at every anchor, so it cannot fail and is not a
+ * check (AGENTS law 2). The one owner of this predicate: the verdict split between `promising`
+ * and `promising-unchecked`, the CLI readiness count and the grounding ledger all read it.
+ * @internal
+ */
+export declare function hasMagnitudeEvidence(c: Pick<VettedCandidate, 'magnitudeChecked' | 'magnitudeAnchorInvariant'>): boolean;
+/**
+ * Whether a verdict is one of the two promising tiers, `promising` (with magnitude evidence) or
+ * `promising-unchecked` (without): the structural set the consequence and proposal layers
+ * process, so splitting the tiers loses no proposal. A selector, never a count: the two tiers are
+ * reported apart and never added (AGENTS law 4).
+ * @internal
+ */
+export declare function isPromisingTier(verdict: VettedCandidate['verdict']): boolean;
 /** Options for the discovery loop. @internal */
 export interface DiscoveryOptions {
     /**
@@ -230,6 +285,19 @@ export interface DiscoveryContext {
     readonly attributesByName: ReadonlyMap<string, RegimeAttributes>;
     /** `forwardEvaluate(edges, groundTruth, baseIdents)` — anchor magnitudes. */
     readonly anchorValues: ReadonlyMap<string, number>;
+    /**
+     * `forwardEvaluate(edges, {}, baseIdents)` — the values the graph fixes with NO anchor input:
+     * the targets of source-less equations (an all-constant right-hand side such as the Rydberg
+     * energy or the Planck length) and whatever they alone determine. Such a value is a constant,
+     * not an anchor-derived magnitude, so the magnitude gate reads it as `fromAnchor: false`.
+     */
+    readonly constantValues: ReadonlyMap<string, number>;
+    /**
+     * The magnitudes the graph derives from the sourced table and the constants alone, never from
+     * the anchor (`deriveOwnEquationMagnitudes`), with every refusal and its reason: a σ above one
+     * decade, two disagreeing edges, or a σ that could not be measured.
+     */
+    readonly derivedMagnitudes: DerivedMagnitudes;
     /** The same evaluation with every anchor input times {@link ANCHOR_PROBE_FACTOR}. */
     readonly anchorValuesProbe: ReadonlyMap<string, number>;
     /** `quantityComponents(edges, baseIdents)` — base component roots. */
@@ -247,6 +315,56 @@ export interface DiscoveryContext {
 /** Resolve options and compute the candidate-invariant discovery state once.
  *  @internal */
 export declare function buildDiscoveryContext(edges: readonly BridgeEdge[], opts: DiscoveryOptions): DiscoveryContext;
+/** One endpoint's magnitude for the gate: its value, where it came from, and its σ in decades. */
+interface GateMagnitude {
+    readonly value: number;
+    readonly fromAnchor: boolean;
+    /** Derived from the quantity's own equation (`ctx.derivedMagnitudes`). */
+    readonly fromOwnEquation: boolean;
+    readonly sigmaDecades: number;
+}
+/** What the magnitude gate found for one candidate. @internal */
+export interface MagnitudeGate {
+    /** The two magnitudes, when both were found (the gate ran). */
+    readonly a: GateMagnitude | undefined;
+    readonly b: GateMagnitude | undefined;
+    readonly checked: boolean;
+    readonly usedAnchor: boolean;
+    /** `|log10|a| − log10|b||`, or null when the gate abstained. */
+    readonly ordersApart: number | null;
+    /** The verdict: `ordersApart > maxOrders`. */
+    readonly clash: boolean;
+    /** The calibrated strength `2·Φ(−orders/√(σ_a² + σ_b²))`, or null when the gate abstained. */
+    readonly p: number | null;
+    /** The endpoints with no magnitude (why the gate abstained); empty when it ran. */
+    readonly missing: readonly string[];
+    /** The endpoints whose magnitude came from their own equation, in candidate order. */
+    readonly derived: readonly string[];
+}
+/**
+ * The two-sided tail of a gap of `orders` decades between two values whose log10 carry
+ * standard deviations `sigmaA` and `sigmaB` decades: `2·Φ(−orders/√(σ_a² + σ_b²))`, through the
+ * NEGATIVE argument (`1 − Φ` rounds a far tail to 0; the lower tail is accurate). A strength of
+ * the falsifier, not a credibility score.
+ *
+ * @internal
+ */
+export declare function magnitudeStrength(orders: number, sigmaA: number, sigmaB: number): number;
+/**
+ * The magnitude gate: an INDEPENDENT falsifier the single-anchor graph cannot make. It runs only
+ * when both endpoints have a representative value and abstains (never false-rejects) otherwise.
+ * A value comes from the sourced static table first; else from the value the graph fixes with NO
+ * anchor input (a constant computed from registered constants alone, `ctx.constantValues`: not
+ * anchor-derived); else from the quantity's own equation evaluated from the table and the
+ * constants (`ctx.derivedMagnitudes`, at its propagated σ, never above one decade: not
+ * anchor-derived); else — for graph-derived quantities the table omits by design
+ * (schwarzschild-radius, thermal-de-broglie-wavelength) — from the quantity's value AT THE
+ * REGISTERED ANCHOR, a definite magnitude for this run. The constant and the anchor value take the
+ * default σ of one decade. The verdict is `ordersApart > ctx.maxOrders`; `p` is reported beside it.
+ *
+ * @internal
+ */
+export declare function magnitudeGate(candidate: LinkCandidate, ctx: DiscoveryContext): MagnitudeGate;
 /**
  * Vet one link candidate by hypothesizing the identification a≡b and
  * measuring its structural and numerical consequences. See module docs.
@@ -265,11 +383,13 @@ export declare function vetLinkCandidate(edges: readonly BridgeEdge[], candidate
 export declare function vetInContext(edges: readonly BridgeEdge[], candidate: LinkCandidate, ctx: DiscoveryContext): VettedCandidate;
 /**
  * Run the full discovery funnel: propose cross-cluster candidates, vet each
- * against the inference suite, and rank — `promising` first, then by score.
+ * against the inference suite, and rank — `promising` first, then `promising-unchecked`, then
+ * the rest, and by score within a verdict.
  * The output is the physicist's worklist (vetted, provenance-traced), not a
  * list of discoveries.
  *
  * @public
  */
 export declare function rankDiscoveries(edges: readonly BridgeEdge[], opts?: DiscoveryOptions): VettedCandidate[];
+export {};
 //# sourceMappingURL=discovery.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAkCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA6BlB;AA8DD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CA+MjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}
+{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAK1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAMtE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAQrE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;;0BAIsB;IACtB,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;;;;OAiBG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;;;;OAOG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,qBAAqB,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IACrH,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,IAAI,CAAC,eAAe,EAAE,kBAAkB,GAAG,0BAA0B,CAAC,GACxE,OAAO,CAET;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,GAAG,OAAO,CAE5E;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAyCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD;;;;;OAKG;IACH,QAAQ,CAAC,cAAc,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrD;;;;OAIG;IACH,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;IAC9C,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CAqClB;AA8DD,kGAAkG;AAClG,UAAU,aAAa;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAa;IAC5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,gEAAgE;IAChE,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,8FAA8F;IAC9F,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,sFAAsF;IACtF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AASD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAExF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,aAAa,EAAE,GAAG,EAAE,gBAAgB,GAAG,aAAa,CAqD5F;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CAqLjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAoBnB"}

package/dist/composition/discovery.js

@@ -38,12 +38,15 @@ import { GATE_AXES } from './axes.js';
 import { classifyIdentifiability, forwardClosure } from './identifiability.js';
 import { retrodict, retrodictNode, forwardEvaluate } from './retrodiction.js';
 import { proposeLinkCandidates } from './bridge-analysis.js';
+import { clusterBySharedKeys } from './quantity-clusters.js';
+import { normalCDF } from '@danielsimonjr/mathts-functions';
 import { M_SUN_KG } from '../core/constants.js';
-import { REPRESENTATIVE_VALUES } from './representative-values.js';
+import { DEFAULT_SIGMA_DECADES, REPRESENTATIVE_VALUES, sigmaDecadesOf } from './representative-values.js';
 import { conventionScaleToSI } from '../dimensional/unit-convention.js';
 import { allQuantities } from './quantities.js';
 import { CANONICAL_EQUATIONS } from '../canonical/registry.js';
 import { format } from '../dimensional/algebra.js';
+import { deriveOwnEquationMagnitudes } from './own-equation-magnitude.js';
 // ── registry-only attribute lookup (D1 axis gate; Option-A resolution) ─────
 // Built from the centralized `Quantity` nodes ONLY (never canonical
 // per-equation stamps — audit adjudication F1). Names that aren't a
@@ -80,37 +83,64 @@ const CANONICAL_QUANTITY_NAMES = (() => {
     }
     return s;
 })();
-/** Union-find over quantity names; merges each edge's endpoints and every
- *  identification's from↔to. Returns name → component-root. */
+/**
+ * Whether the magnitude falsifier ran on a candidate AND could have failed: both endpoints had a
+ * representative magnitude (`magnitudeChecked`) and the comparison is not anchor-invariant. An
+ * anchor-invariant pass is fixed by the graph at every anchor, so it cannot fail and is not a
+ * check (AGENTS law 2). The one owner of this predicate: the verdict split between `promising`
+ * and `promising-unchecked`, the CLI readiness count and the grounding ledger all read it.
+ * @internal
+ */
+export function hasMagnitudeEvidence(c) {
+    return c.magnitudeChecked && c.magnitudeAnchorInvariant !== true;
+}
+/**
+ * Whether a verdict is one of the two promising tiers, `promising` (with magnitude evidence) or
+ * `promising-unchecked` (without): the structural set the consequence and proposal layers
+ * process, so splitting the tiers loses no proposal. A selector, never a count: the two tiers are
+ * reported apart and never added (AGENTS law 4).
+ * @internal
+ */
+export function isPromisingTier(verdict) {
+    return verdict === 'promising' || verdict === 'promising-unchecked';
+}
+/**
+ * The component partition of quantity names: names in one equation are one component, and so
+ * are the two sides of every identification. The shared partition of `quantity-clusters.ts`
+ * (a name is an item; its keys are the equations and identifications it appears in). Returns
+ * name → a representative of its component (its first name), read only for equality.
+ *
+ * An equation with no source (an all-constant right-hand side, `CE-bohr-radius`) registers its
+ * target under its own key, so the target is a component member of its own and an identification
+ * touching it can merge components (the owner's decision of 2026-10-16, option 1). Before it, the
+ * union-find this replaced registered a name only when it took part in a union, so the target of
+ * every source-less equation (eight on the canonical graph) was absent from the map and no
+ * identification touching it merged anything.
+ */
 function quantityComponents(edges, idents) {
-    const parent = new Map();
-    const find = (x) => {
-        if (!parent.has(x))
-            parent.set(x, x);
-        let r = x;
-        while (parent.get(r) !== r)
-            r = parent.get(r);
-        let cur = x;
-        while (parent.get(cur) !== r) {
-            const next = parent.get(cur);
-            parent.set(cur, r);
-            cur = next;
-        }
-        return r;
-    };
-    const union = (a, b) => {
-        parent.set(find(a), find(b));
+    const keysByName = new Map();
+    const tag = (name, key) => {
+        const keys = keysByName.get(name);
+        if (keys === undefined)
+            keysByName.set(name, [key]);
+        else
+            keys.push(key);
     };
-    for (const e of edges) {
-        const names = [...e.sources.map((s) => s.name), e.target.name];
-        for (let i = 1; i < names.length; i++)
-            union(names[0], names[i]);
-    }
-    for (const id of idents)
-        union(id.from, id.to);
+    edges.forEach((e, i) => {
+        for (const s of e.sources)
+            tag(s.name, `edge:${i}`);
+        tag(e.target.name, `edge:${i}`);
+    });
+    idents.forEach((id, i) => {
+        tag(id.from, `ident:${i}`);
+        tag(id.to, `ident:${i}`);
+    });
+    const names = [...keysByName.keys()];
     const roots = new Map();
-    for (const name of parent.keys())
-        roots.set(name, find(name));
+    for (const cluster of clusterBySharedKeys(names, (name) => keysByName.get(name) ?? [], (name) => name)) {
+        for (const name of cluster)
+            roots.set(name, cluster[0]);
+    }
     return roots;
 }
 /**
@@ -161,16 +191,24 @@ export function buildDiscoveryContext(edges, opts) {
     const groundTruth = opts.groundTruth ?? ANCHOR_DEFAULT;
     const anchor = Object.keys(groundTruth);
     const baseReport = retrodict(edges, groundTruth, { identifications: baseIdents });
+    const repVals = opts.representativeValues ?? REPRESENTATIVE_VALUES;
+    const constantValues = forwardEvaluate(edges, {}, baseIdents);
     return {
         baseIdents,
         groundTruth,
         anchor,
-        repVals: opts.representativeValues ?? REPRESENTATIVE_VALUES,
+        repVals,
         maxOrders: opts.maxOrdersOfMagnitude ?? DEFAULT_MAX_ORDERS_OF_MAGNITUDE,
         attributesByName: opts.quantityAttributes ?? REGISTRY_ATTRIBUTES_BY_NAME,
         // Candidate-invariant: the anchor's forward evaluation, the base component
         // partition, and the base forward closure all depend only on (edges, opts).
         anchorValues: forwardEvaluate(edges, groundTruth, baseIdents),
+        constantValues,
+        derivedMagnitudes: deriveOwnEquationMagnitudes(edges, {
+            representativeValues: repVals,
+            constantValues,
+            identifications: baseIdents,
+        }),
         anchorValuesProbe: forwardEvaluate(edges, Object.fromEntries(Object.entries(groundTruth).map(([k, v]) => [k, v * ANCHOR_PROBE_FACTOR])), baseIdents),
         comps: quantityComponents(edges, baseIdents),
         closureBase: forwardClosure(edges, anchor, baseIdents),
@@ -231,54 +269,116 @@ function newInconsistencies(edges, groundTruth, anchor, candidate, withHyp, base
     }
     return nodes;
 }
+/** MathTS `normalCDF`, read back as the number it is. */
+function phi(z) {
+    const v = normalCDF(z);
+    if (typeof v !== 'number')
+        throw new TypeError('normalCDF did not return a number for a number argument');
+    return v;
+}
 /**
- * Vet one link candidate by hypothesizing the identification a≡b and
- * measuring its structural and numerical consequences. See module docs.
+ * The two-sided tail of a gap of `orders` decades between two values whose log10 carry
+ * standard deviations `sigmaA` and `sigmaB` decades: `2·Φ(−orders/√(σ_a² + σ_b²))`, through the
+ * NEGATIVE argument (`1 − Φ` rounds a far tail to 0; the lower tail is accurate). A strength of
+ * the falsifier, not a credibility score.
  *
  * @internal
  */
-export function vetLinkCandidate(edges, candidate, opts = {}) {
-    return vetInContext(edges, candidate, buildDiscoveryContext(edges, opts));
+export function magnitudeStrength(orders, sigmaA, sigmaB) {
+    return 2 * phi(-orders / Math.sqrt(sigmaA * sigmaA + sigmaB * sigmaB));
 }
 /**
- * The per-candidate vetting body, given pre-computed candidate-invariant
- * `ctx`. The hypothesis-augmented closure is per-candidate. Retrodiction is
- * per-candidate only when an endpoint is already in the anchor closure;
- * otherwise the identification cannot fire and the base report stands.
+ * The magnitude gate: an INDEPENDENT falsifier the single-anchor graph cannot make. It runs only
+ * when both endpoints have a representative value and abstains (never false-rejects) otherwise.
+ * A value comes from the sourced static table first; else from the value the graph fixes with NO
+ * anchor input (a constant computed from registered constants alone, `ctx.constantValues`: not
+ * anchor-derived); else from the quantity's own equation evaluated from the table and the
+ * constants (`ctx.derivedMagnitudes`, at its propagated σ, never above one decade: not
+ * anchor-derived); else — for graph-derived quantities the table omits by design
+ * (schwarzschild-radius, thermal-de-broglie-wavelength) — from the quantity's value AT THE
+ * REGISTERED ANCHOR, a definite magnitude for this run. The constant and the anchor value take the
+ * default σ of one decade. The verdict is `ordersApart > ctx.maxOrders`; `p` is reported beside it.
  *
  * @internal
  */
-export function vetInContext(edges, candidate, ctx) {
-    const { baseIdents, groundTruth, anchor, repVals, maxOrders, anchorValues, anchorValuesProbe, comps, closureBase, attributesByName, baseInconsistentNodes, } = ctx;
-    // Magnitude gate: an INDEPENDENT falsifier the single-anchor graph can't make.
-    // Only fires when both endpoints have a representative value; abstains (and
-    // never false-rejects) otherwise. A value comes from the sourced static table
-    // first, else — for graph-derived quantities the table omits by design
-    // (schwarzschild-radius, thermal-de-broglie-wavelength) — from the quantity's
-    // value AT THE REGISTERED ANCHOR, which is a definite magnitude for this run.
+export function magnitudeGate(candidate, ctx) {
     const magnitudeOf = (name) => {
-        const rv = repVals[name];
+        const rv = ctx.repVals[name];
         // Both paths apply the same finite-and-nonzero gate: a 0/∞/NaN magnitude
         // would make log10 blow up (log10(0) = -∞), spoofing or silently disabling
         // the falsifier. Symmetric validation across the table and anchor sources.
-        if (rv !== undefined && Number.isFinite(rv.value) && rv.value !== 0)
-            return { value: rv.value, fromAnchor: false };
-        const av = anchorValues.get(name);
+        if (rv !== undefined && Number.isFinite(rv.value) && rv.value !== 0) {
+            return { value: rv.value, fromAnchor: false, fromOwnEquation: false, sigmaDecades: sigmaDecadesOf(rv) };
+        }
+        // A value the graph fixes with no anchor input is a constant: comparing it can fail by the
+        // clash threshold at every anchor, so it is not anchor-derived and the invariance probe does
+        // not withhold it. Only a value that needs the anchor is `fromAnchor`.
+        const cv = ctx.constantValues.get(name);
+        if (cv !== undefined) {
+            const value = cv * conventionScaleToSI(name);
+            if (Number.isFinite(value) && value !== 0) {
+                return { value, fromAnchor: false, fromOwnEquation: false, sigmaDecades: DEFAULT_SIGMA_DECADES };
+            }
+        }
+        // The quantity's own equation, from the table and the constants alone (already in SI, and
+        // already refused when its σ is above one decade): not anchor-derived either.
+        const dv = ctx.derivedMagnitudes.values.get(name);
+        if (dv !== undefined) {
+            return { value: dv.value, fromAnchor: false, fromOwnEquation: true, sigmaDecades: dv.sigmaDecades };
+        }
+        const av = ctx.anchorValues.get(name);
         if (av !== undefined) {
             const value = av * conventionScaleToSI(name);
-            if (Number.isFinite(value) && value !== 0)
-                return { value, fromAnchor: true };
+            if (Number.isFinite(value) && value !== 0) {
+                return { value, fromAnchor: true, fromOwnEquation: false, sigmaDecades: DEFAULT_SIGMA_DECADES };
+            }
         }
         return undefined;
     };
-    const va = magnitudeOf(candidate.a);
-    const vb = magnitudeOf(candidate.b);
-    const magnitudeChecked = va !== undefined && vb !== undefined;
-    const magnitudeUsedAnchor = magnitudeChecked && (va.fromAnchor || vb.fromAnchor);
-    const ordersApart = magnitudeChecked
-        ? Math.abs(Math.log10(Math.abs(va.value)) - Math.log10(Math.abs(vb.value)))
-        : null;
-    const magnitudeClash = ordersApart !== null && ordersApart > maxOrders;
+    const a = magnitudeOf(candidate.a);
+    const b = magnitudeOf(candidate.b);
+    const checked = a !== undefined && b !== undefined;
+    const ordersApart = checked ? Math.abs(Math.log10(Math.abs(a.value)) - Math.log10(Math.abs(b.value))) : null;
+    return {
+        a,
+        b,
+        checked,
+        usedAnchor: checked && (a.fromAnchor || b.fromAnchor),
+        ordersApart,
+        clash: ordersApart !== null && ordersApart > ctx.maxOrders,
+        p: checked && ordersApart !== null ? magnitudeStrength(ordersApart, a.sigmaDecades, b.sigmaDecades) : null,
+        missing: [a === undefined ? candidate.a : null, b === undefined ? candidate.b : null].filter((e) => e !== null),
+        derived: [a?.fromOwnEquation === true ? candidate.a : null, b?.fromOwnEquation === true ? candidate.b : null].filter((e) => e !== null),
+    };
+}
+/**
+ * Vet one link candidate by hypothesizing the identification a≡b and
+ * measuring its structural and numerical consequences. See module docs.
+ *
+ * @internal
+ */
+export function vetLinkCandidate(edges, candidate, opts = {}) {
+    return vetInContext(edges, candidate, buildDiscoveryContext(edges, opts));
+}
+/**
+ * The per-candidate vetting body, given pre-computed candidate-invariant
+ * `ctx`. The hypothesis-augmented closure is per-candidate. Retrodiction is
+ * per-candidate only when an endpoint is already in the anchor closure;
+ * otherwise the identification cannot fire and the base report stands.
+ *
+ * @internal
+ */
+export function vetInContext(edges, candidate, ctx) {
+    const { baseIdents, groundTruth, anchor, anchorValuesProbe, comps, closureBase, attributesByName, baseInconsistentNodes, } = ctx;
+    // Magnitude gate: an INDEPENDENT falsifier the single-anchor graph can't make
+    // (`magnitudeGate`): the verdict is the hard threshold, `p` its calibrated strength.
+    const gate = magnitudeGate(candidate, ctx);
+    const va = gate.a;
+    const vb = gate.b;
+    const magnitudeChecked = gate.checked;
+    const magnitudeUsedAnchor = gate.usedAnchor;
+    const ordersApart = gate.ordersApart;
+    const magnitudeClash = gate.clash;
     // Anchor-invariance probe: re-read each anchor-derived magnitude at the
     // rescaled anchor. A table value is a constant and does not move.
     const probeOf = (name, m) => {
@@ -380,7 +480,7 @@ export function vetInContext(edges, candidate, ctx) {
     else if (axisClash)
         verdict = 'axis-clash';
     else if (mergesComponents && unlocksFromAnchor.length > 0 && !subsuming)
-        verdict = 'promising';
+        verdict = hasMagnitudeEvidence({ magnitudeChecked, magnitudeAnchorInvariant }) ? 'promising' : 'promising-unchecked';
     else
         verdict = 'inert';
     // Score: all falsifications sink to the bottom; a subsuming (tautological)
@@ -413,10 +513,12 @@ export function vetInContext(edges, candidate, ctx) {
         numericallyConsistent,
         inconsistentNodes,
         ordersApart,
+        magnitudeP: gate.p,
         magnitudeChecked,
         magnitudeUsedAnchor,
         magnitudeAnchorInvariant,
-        magnitudeMissing: [va === undefined ? candidate.a : null, vb === undefined ? candidate.b : null].filter((e) => e !== null),
+        magnitudeDerived: gate.derived,
+        magnitudeMissing: gate.missing,
         axisUnstated,
         subsuming,
         verdict,
@@ -429,7 +531,8 @@ export function vetInContext(edges, candidate, ctx) {
 }
 /**
  * Run the full discovery funnel: propose cross-cluster candidates, vet each
- * against the inference suite, and rank — `promising` first, then by score.
+ * against the inference suite, and rank — `promising` first, then `promising-unchecked`, then
+ * the rest, and by score within a verdict.
  * The output is the physicist's worklist (vetted, provenance-traced), not a
  * list of discoveries.
  *
@@ -438,10 +541,11 @@ export function vetInContext(edges, candidate, ctx) {
 export function rankDiscoveries(edges, opts = {}) {
     const VERDICT_RANK = {
         promising: 0,
-        inert: 1,
-        'magnitude-clash': 2,
-        contradictory: 3,
-        'axis-clash': 4,
+        'promising-unchecked': 1,
+        inert: 2,
+        'magnitude-clash': 3,
+        contradictory: 4,
+        'axis-clash': 5,
     };
     const ctx = buildDiscoveryContext(edges, opts);
     const candidates = proposeLinkCandidates(edges);