universal-physics-tensor 9.0.0 → 11.0.0

package/dist/composition/adjudication.js.map

@@ -1 +1 @@
-{"version":3,"file":"adjudication.js","sourceRoot":"","sources":["../../src/composition/adjudication.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAG3D;8EAC8E;AAC9E,MAAM,IAAI,GAAG,uBAAuB,CAAC;AAErC;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,8DAA8D,CAAC,OAAO,CAAC,IAAI,CAC5E,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACrD,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,QAAQ,GAAwB,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AAE5F;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,aAAa,GAAmC,aAAa,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;IACrG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,cAAc,GAAG,CAAC,OAAO,+CAA+C,CAAC,CAAC;IAChJ,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC;QAC9F,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,gCAAgC,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC,CAAC;AAEH,MAAM,KAAK,GAA6C,IAAI,GAAG,CAC7D,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CACpC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,UAAU,eAAe,CAC7B,CAAS,EACT,CAAS;IAET,OAAO,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC;AAaD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAsC;IAEtC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"adjudication.js","sourceRoot":"","sources":["../../src/composition/adjudication.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAG3D;8EAC8E;AAC9E,MAAM,IAAI,GAAG,uBAAuB,CAAC;AAErC;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,8DAA8D,CAAC,OAAO,CAAC,IAAI,CAC5E,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACrD,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,QAAQ,GAAwB,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AAE5F;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,aAAa,GAAmC,aAAa,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;IACrG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,cAAc,GAAG,CAAC,OAAO,+CAA+C,CAAC,CAAC;IAChJ,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC;QAC9F,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,gCAAgC,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC,CAAC;AAEH,MAAM,KAAK,GAA6C,IAAI,GAAG,CAC7D,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CACpC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,UAAU,eAAe,CAC7B,CAAS,EACT,CAAS;IAET,OAAO,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC;AAaD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAsC;IAEtC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Adjudication ledger for machine-surfaced discovery candidates.\n *\n * Human verdicts on identification hypotheses (`a ≟ b`) are REVIEW MEMORY:\n * once a physicist has disposed of a candidate, the funnel must not\n * re-surface it as fresh. Verdicts NEVER mutate the catalog or graphs\n * (the epistemic firewall) — they annotate discovery output only.\n *\n * Keyed by the order-normalized quantity-name pair. Proposed equations\n * (`upt discover --derive`) inherit the verdict of the identification they\n * were derived from (`derivedFrom.identification`).\n *\n * @module composition/adjudication\n */\n\nimport type { VettedCandidate } from './discovery.js';\nimport { bridgeCatalog } from '../bridges/catalog-load.js';\nimport type { CatalogAdjudication } from '../bridges/catalog-types.js';\n\n/** Quantity names are ASCII kebab-case slugs; enforced so `~` cannot collide\n *  (Adam/Eve vet r1: guard the character-set assumption, don't assume it). */\nconst SLUG = /^[a-z0-9][a-z0-9-]*$/u;\n\n/**\n * Stable identity for an identification hypothesis: the two quantity names,\n * sorted, joined with `~`. Deliberately excludes score/verdict/dimension so\n * ids survive funnel-internal changes. NOT rename-proof: a quantity rename\n * (alias disposition) must update `ADJUDICATIONS` in the SAME commit — the\n * calibration benchmark's seed-resolution test enforces this.\n *\n * @public\n */\nexport function candidateId(a: string, b: string): string {\n  if (!SLUG.test(a) || !SLUG.test(b)) {\n    throw new Error(\n      `candidateId: quantity names must be kebab-case slugs (got '${a}', '${b}')`,\n    );\n  }\n  return a <= b ? `${a}~${b}` : `${b}~${a}`;\n}\n\n/**\n * `candidateId` when both names are kebab-case slugs; otherwise `undefined`.\n * Graphs carry symbols that are not slugs (`A`, `impact_parameter`). Those\n * names are not ledger keys, and routing them through `candidateId` throws.\n * The ledger path keeps the throw. Callers that only need an id skip it.\n *\n * @internal\n */\nexport function candidateIdIfSlug(a: string, b: string): string | undefined {\n  if (!SLUG.test(a) || !SLUG.test(b)) return undefined;\n  return candidateId(a, b);\n}\n\nconst VERDICTS: ReadonlySet<string> = new Set(['genuine', 'decoy', 'entailed', 'deferred']);\n\n/**\n * The ledger: the `adjudications` block of `data/bridge-catalog.json`, read\n * once. Append-only by convention; a record is corrected there, never\n * silently removed. A record whose verdict is not one of the four, or whose\n * id is not a slug pair, is a defect in the file and refuses to load.\n *\n * @public\n */\nexport const ADJUDICATIONS: readonly CatalogAdjudication[] = bridgeCatalog().adjudications.map((row) => {\n  if (!VERDICTS.has(row.verdict)) throw new Error(`adjudication ${row.id}: verdict '${row.verdict}' is not genuine, decoy, entailed or deferred`);\n  const [a, b, extra] = row.id.split('~');\n  if (a === undefined || b === undefined || extra !== undefined || candidateId(a, b) !== row.id) {\n    throw new Error(`adjudication ${row.id}: id is not a sorted slug pair`);\n  }\n  return row;\n});\n\nconst BY_ID: ReadonlyMap<string, CatalogAdjudication> = new Map(\n  ADJUDICATIONS.map((a) => [a.id, a]),\n);\n\n/** Look up the verdict for an identification, order-insensitive. @public */\nexport function adjudicationFor(\n  a: string,\n  b: string,\n): CatalogAdjudication | undefined {\n  return BY_ID.get(candidateId(a, b));\n}\n\n/**\n * A `VettedCandidate` with its recorded verdict attached, when the ledger has\n * one for `a ≟ b`. The identification funnel (`rankDiscoveries`) never sees\n * this — annotation is a command-layer concern (the epistemic firewall).\n *\n * @public\n */\nexport type AnnotatedCandidate = VettedCandidate & {\n  readonly adjudication?: CatalogAdjudication;\n};\n\n/**\n * Attach each candidate's recorded verdict, if any. A pure map: preserves\n * order and length, and leaves candidates without a ledger entry untouched\n * (no `adjudication` key added).\n *\n * The discovery funnel's candidate pool is NOT guaranteed to be kebab-case\n * slugs (`candidates` command sources plain quantity names like `A` or\n * `impact_parameter` straight off `BridgeEdge`/canonical governing sets) —\n * `candidateId` intentionally THROWS on those (the `~`-collision guard, see\n * its docstring). A non-slug name can never be a ledger key (every\n * `ADJUDICATIONS` entry is a valid slug), so such candidates are\n * pre-filtered out of lookup rather than routed through the throwing path.\n *\n * @public\n */\nexport function annotateAdjudications(\n  candidates: readonly VettedCandidate[],\n): readonly AnnotatedCandidate[] {\n  return candidates.map((c) => {\n    if (!SLUG.test(c.a) || !SLUG.test(c.b)) return c;\n    const adjudication = adjudicationFor(c.a, c.b);\n    return adjudication ? { ...c, adjudication } : c;\n  });\n}\n"]}

package/dist/composition/algebraic-equivalence.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Equality of two scalar expressions up to a dimensionless constant, decided
+ * by MathTS `simplify` (proposal 2).
+ *
+ * `normalForm` is the cheap structural key: it flattens products and drops
+ * dimensionless constants, but `a/(b/c)` and `a·c/b`, or `a·a` and `a²`, hash
+ * differently, and a chain that recovers a known law in another spelling was
+ * filed as provisional. This module answers the question the hash cannot: it
+ * renders both sides to the gensym string `expr-simplify.ts` uses (one gensym
+ * per leaf NAME, shared by both sides, so the same leaf cancels; a
+ * dimensionless registered constant becomes its number, as the hash drops
+ * it), asks `simplify` for `(A)/(B)`, and reads a constant node as "equal up
+ * to that constant". Anything else, a symbol left over, an arm the renderer
+ * does not carry, a throw inside the simplifier, is NOT SHOWN EQUAL: a
+ * negative answer here is an absence of proof, never a proof of difference.
+ *
+ * MathTS `symbolicEqual` is not used. Before `@danielsimonjr/mathts-functions`
+ * 0.68.4 it passed an empty rule list and compared every pair false; from
+ * 0.68.4 it simplifies with the default rules, and it is the same simplifier
+ * this step calls, so it would be the same method, not a second one.
+ *
+ * The first use runs inside the one console-silencing window
+ * `mathts-quiet.ts` describes, as `mathts-scalar-symbols.ts` does for its
+ * first parse; every later call runs with the console untouched.
+ *
+ * @module composition/algebraic-equivalence
+ */
+import type { ExprNode } from '../dimensional/validator.js';
+/** The outcome: equal with the constant `A/B`, or not shown equal. @internal */
+export type AlgebraicEquivalence = {
+    readonly equal: true;
+    readonly constant: number;
+} | {
+    readonly equal: false;
+};
+/**
+ * Whether `a` and `b` are equal up to a dimensionless constant, and that
+ * constant (`a/b`). See the module docs for what a negative answer means.
+ *
+ * @internal
+ */
+export declare function equalUpToConstant(a: ExprNode, b: ExprNode): AlgebraicEquivalence;
+//# sourceMappingURL=algebraic-equivalence.d.ts.map

package/dist/composition/algebraic-equivalence.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algebraic-equivalence.d.ts","sourceRoot":"","sources":["../../src/composition/algebraic-equivalence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAQ5D,gFAAgF;AAChF,MAAM,MAAM,oBAAoB,GAAG;IAAE,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;CAAE,CAAC;AAuEnH;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,oBAAoB,CAqBhF"}

package/dist/composition/algebraic-equivalence.js

@@ -0,0 +1,115 @@
+/**
+ * Equality of two scalar expressions up to a dimensionless constant, decided
+ * by MathTS `simplify` (proposal 2).
+ *
+ * `normalForm` is the cheap structural key: it flattens products and drops
+ * dimensionless constants, but `a/(b/c)` and `a·c/b`, or `a·a` and `a²`, hash
+ * differently, and a chain that recovers a known law in another spelling was
+ * filed as provisional. This module answers the question the hash cannot: it
+ * renders both sides to the gensym string `expr-simplify.ts` uses (one gensym
+ * per leaf NAME, shared by both sides, so the same leaf cancels; a
+ * dimensionless registered constant becomes its number, as the hash drops
+ * it), asks `simplify` for `(A)/(B)`, and reads a constant node as "equal up
+ * to that constant". Anything else, a symbol left over, an arm the renderer
+ * does not carry, a throw inside the simplifier, is NOT SHOWN EQUAL: a
+ * negative answer here is an absence of proof, never a proof of difference.
+ *
+ * MathTS `symbolicEqual` is not used. Before `@danielsimonjr/mathts-functions`
+ * 0.68.4 it passed an empty rule list and compared every pair false; from
+ * 0.68.4 it simplifies with the default rules, and it is the same simplifier
+ * this step calls, so it would be the same method, not a second one.
+ *
+ * The first use runs inside the one console-silencing window
+ * `mathts-quiet.ts` describes, as `mathts-scalar-symbols.ts` does for its
+ * first parse; every later call runs with the console untouched.
+ *
+ * @module composition/algebraic-equivalence
+ */
+import { parse as mathtsParse, simplify as mathtsSimplify } from '@danielsimonjr/mathts-functions';
+import { mapScalarLeaves } from '../dimensional/ast-leaves.js';
+import { equals } from '../dimensional/algebra.js';
+import { DIMENSIONLESS } from '../dimensional/types.js';
+import { CONSTANTS, isRegisteredConstant, piMultipleValue } from '../dimensional/symbolic-constants.js';
+import { renderGensym } from './expr-simplify.js';
+import { quietlySync } from './mathts-quiet.js';
+const NOT_EQUAL = { equal: false };
+let cached;
+/**
+ * `simplify ∘ parse`, bound once, after a smoke test that it CANCELS
+ * (`(g0*g1)/(g1*g0)` must come back as the constant 1). A simplifier that
+ * fails the smoke is `null`, and every answer is then "not shown equal".
+ */
+function simplifier() {
+    if (cached !== undefined)
+        return cached;
+    cached = quietlySync(() => {
+        try {
+            const run = (text) => mathtsSimplify(mathtsParse(text));
+            const smoke = run('(g0*g1)/(g1*g0)');
+            return isConstant(smoke) && smoke.value === 1 ? run : null;
+        }
+        catch {
+            return null;
+        }
+    });
+    return cached;
+}
+/** A finite numeric constant node. */
+function isConstant(node) {
+    return ((node.isConstantNode === true || node.type === 'ConstantNode') &&
+        typeof node.value === 'number' &&
+        Number.isFinite(node.value));
+}
+/**
+ * The number a dimensionless leaf stands for when `normalForm` would drop it
+ * as a constant: a registered dimensionless constant, a spelled multiple of
+ * π, or BE-16's `ln_2_constant`. Undefined for every other leaf.
+ */
+function droppableConstantValue(name) {
+    if (name === 'ln_2_constant')
+        return Math.LN2;
+    if (isRegisteredConstant(name)) {
+        const c = CONSTANTS[name];
+        return equals(c.dim, DIMENSIONLESS) ? c.value : undefined;
+    }
+    return piMultipleValue(name);
+}
+/** Dimensionless named constants become literals, so the ratio of two forms that differ by one is a number. */
+function constantsAsLiterals(expr) {
+    return mapScalarLeaves(expr, (leaf) => {
+        const value = droppableConstantValue(leaf.name);
+        return value === undefined ? leaf : { kind: 'symbol', name: String(value), dim: DIMENSIONLESS };
+    }, {});
+}
+/**
+ * Whether `a` and `b` are equal up to a dimensionless constant, and that
+ * constant (`a/b`). See the module docs for what a negative answer means.
+ *
+ * @internal
+ */
+export function equalUpToConstant(a, b) {
+    const run = simplifier();
+    if (run === null)
+        return NOT_EQUAL;
+    const gensymOf = new Map();
+    const meta = new Map();
+    let text;
+    try {
+        // One gensym table for both sides: the same leaf name is the same symbol.
+        const left = renderGensym(constantsAsLiterals(a), gensymOf, meta);
+        const right = renderGensym(constantsAsLiterals(b), gensymOf, meta);
+        text = `(${left})/(${right})`;
+    }
+    catch {
+        return NOT_EQUAL; // an arm the renderer does not carry
+    }
+    let node;
+    try {
+        node = run(text);
+    }
+    catch {
+        return NOT_EQUAL; // the simplifier threw: not shown equal
+    }
+    return isConstant(node) ? { equal: true, constant: node.value } : NOT_EQUAL;
+}
+//# sourceMappingURL=algebraic-equivalence.js.map

package/dist/composition/algebraic-equivalence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"algebraic-equivalence.js","sourceRoot":"","sources":["../../src/composition/algebraic-equivalence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,QAAQ,IAAI,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAEnG,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AACxG,OAAO,EAAE,YAAY,EAAiB,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAgBhD,MAAM,SAAS,GAAyB,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAEzD,IAAI,MAAqC,CAAC;AAE1C;;;;GAIG;AACH,SAAS,UAAU;IACjB,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE;QACxB,IAAI,CAAC;YACH,MAAM,GAAG,GAAe,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,WAAW,CAAC,IAAI,CAAC,CAAwB,CAAC;YAC3F,MAAM,KAAK,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC;YACrC,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7D,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sCAAsC;AACtC,SAAS,UAAU,CAAC,IAAc;IAChC,OAAO,CACL,CAAC,IAAI,CAAC,cAAc,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,CAAC;QAC9D,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ;QAC9B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAC5B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,sBAAsB,CAAC,IAAY;IAC1C,IAAI,IAAI,KAAK,eAAe;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC9C,IAAI,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAE,CAAC;QAC3B,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,+GAA+G;AAC/G,SAAS,mBAAmB,CAAC,IAAc;IACzC,OAAO,eAAe,CACpB,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE;QACP,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;IAClG,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACxD,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;IACzB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,IAAY,CAAC;IACjB,IAAI,CAAC;QACH,0EAA0E;QAC1E,MAAM,IAAI,GAAG,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,GAAG,IAAI,IAAI,MAAM,KAAK,GAAG,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC,CAAC,qCAAqC;IACzD,CAAC;IACD,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC,CAAC,wCAAwC;IAC5D,CAAC;IACD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AAC9E,CAAC","sourcesContent":["/**\n * Equality of two scalar expressions up to a dimensionless constant, decided\n * by MathTS `simplify` (proposal 2).\n *\n * `normalForm` is the cheap structural key: it flattens products and drops\n * dimensionless constants, but `a/(b/c)` and `a·c/b`, or `a·a` and `a²`, hash\n * differently, and a chain that recovers a known law in another spelling was\n * filed as provisional. This module answers the question the hash cannot: it\n * renders both sides to the gensym string `expr-simplify.ts` uses (one gensym\n * per leaf NAME, shared by both sides, so the same leaf cancels; a\n * dimensionless registered constant becomes its number, as the hash drops\n * it), asks `simplify` for `(A)/(B)`, and reads a constant node as \"equal up\n * to that constant\". Anything else, a symbol left over, an arm the renderer\n * does not carry, a throw inside the simplifier, is NOT SHOWN EQUAL: a\n * negative answer here is an absence of proof, never a proof of difference.\n *\n * MathTS `symbolicEqual` is not used. Before `@danielsimonjr/mathts-functions`\n * 0.68.4 it passed an empty rule list and compared every pair false; from\n * 0.68.4 it simplifies with the default rules, and it is the same simplifier\n * this step calls, so it would be the same method, not a second one.\n *\n * The first use runs inside the one console-silencing window\n * `mathts-quiet.ts` describes, as `mathts-scalar-symbols.ts` does for its\n * first parse; every later call runs with the console untouched.\n *\n * @module composition/algebraic-equivalence\n */\n\nimport { parse as mathtsParse, simplify as mathtsSimplify } from '@danielsimonjr/mathts-functions';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { mapScalarLeaves } from '../dimensional/ast-leaves.js';\nimport { equals } from '../dimensional/algebra.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { CONSTANTS, isRegisteredConstant, piMultipleValue } from '../dimensional/symbolic-constants.js';\nimport { renderGensym, type LeafMeta } from './expr-simplify.js';\nimport { quietlySync } from './mathts-quiet.js';\n\n/** The outcome: equal with the constant `A/B`, or not shown equal. @internal */\nexport type AlgebraicEquivalence = { readonly equal: true; readonly constant: number } | { readonly equal: false };\n\n/** The bits of a simplified MathTS node this module reads. */\ninterface MathNode {\n  readonly type?: string;\n  readonly isConstantNode?: boolean;\n  readonly value?: unknown;\n}\n\ninterface Simplifier {\n  (text: string): MathNode;\n}\n\nconst NOT_EQUAL: AlgebraicEquivalence = { equal: false };\n\nlet cached: Simplifier | null | undefined;\n\n/**\n * `simplify ∘ parse`, bound once, after a smoke test that it CANCELS\n * (`(g0*g1)/(g1*g0)` must come back as the constant 1). A simplifier that\n * fails the smoke is `null`, and every answer is then \"not shown equal\".\n */\nfunction simplifier(): Simplifier | null {\n  if (cached !== undefined) return cached;\n  cached = quietlySync(() => {\n    try {\n      const run: Simplifier = (text) => mathtsSimplify(mathtsParse(text)) as unknown as MathNode;\n      const smoke = run('(g0*g1)/(g1*g0)');\n      return isConstant(smoke) && smoke.value === 1 ? run : null;\n    } catch {\n      return null;\n    }\n  });\n  return cached;\n}\n\n/** A finite numeric constant node. */\nfunction isConstant(node: MathNode): node is MathNode & { readonly value: number } {\n  return (\n    (node.isConstantNode === true || node.type === 'ConstantNode') &&\n    typeof node.value === 'number' &&\n    Number.isFinite(node.value)\n  );\n}\n\n/**\n * The number a dimensionless leaf stands for when `normalForm` would drop it\n * as a constant: a registered dimensionless constant, a spelled multiple of\n * π, or BE-16's `ln_2_constant`. Undefined for every other leaf.\n */\nfunction droppableConstantValue(name: string): number | undefined {\n  if (name === 'ln_2_constant') return Math.LN2;\n  if (isRegisteredConstant(name)) {\n    const c = CONSTANTS[name]!;\n    return equals(c.dim, DIMENSIONLESS) ? c.value : undefined;\n  }\n  return piMultipleValue(name);\n}\n\n/** Dimensionless named constants become literals, so the ratio of two forms that differ by one is a number. */\nfunction constantsAsLiterals(expr: ExprNode): ExprNode {\n  return mapScalarLeaves(\n    expr,\n    (leaf) => {\n      const value = droppableConstantValue(leaf.name);\n      return value === undefined ? leaf : { kind: 'symbol', name: String(value), dim: DIMENSIONLESS };\n    },\n    {},\n  );\n}\n\n/**\n * Whether `a` and `b` are equal up to a dimensionless constant, and that\n * constant (`a/b`). See the module docs for what a negative answer means.\n *\n * @internal\n */\nexport function equalUpToConstant(a: ExprNode, b: ExprNode): AlgebraicEquivalence {\n  const run = simplifier();\n  if (run === null) return NOT_EQUAL;\n  const gensymOf = new Map<string, string>();\n  const meta = new Map<string, LeafMeta>();\n  let text: string;\n  try {\n    // One gensym table for both sides: the same leaf name is the same symbol.\n    const left = renderGensym(constantsAsLiterals(a), gensymOf, meta);\n    const right = renderGensym(constantsAsLiterals(b), gensymOf, meta);\n    text = `(${left})/(${right})`;\n  } catch {\n    return NOT_EQUAL; // an arm the renderer does not carry\n  }\n  let node: MathNode;\n  try {\n    node = run(text);\n  } catch {\n    return NOT_EQUAL; // the simplifier threw: not shown equal\n  }\n  return isConstant(node) ? { equal: true, constant: node.value } : NOT_EQUAL;\n}\n"]}

package/dist/composition/aliases.js.map

@@ -1 +1 @@
-{"version":3,"file":"aliases.js","sourceRoot":"","sources":["../../src/composition/aliases.ts"],"names":[],"mappings":"AAWA,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,mBAAmB,GAEpB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,UAAU,GAInB;IACF,QAAQ,EAAE,cAAc;IACxB,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CACrG;IAED,gBAAgB,EAAE,iBAAiB;CACpC,CAAC;AAEF,+FAA+F;AAC/F,MAAM,UAAU,gBAAgB,CAC9B,KAA4B,EAC5B,MAAc;IAEd,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS;YAAE,SAAS;QAClE,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YACzD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ;oBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;;oBAC3D,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,SAAS;QAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC;YACxE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAE,CAAC;AAClB,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AAE9D;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,KAAuB;IACtE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAwC,EACxC,UAA+B;IAE/B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAA2B,EAAE,GAAG,KAAK,EAAE,CAAC;IACjD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChD,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAE,CAAC;gBACxB,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;AAC7B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAAwB,EACxB,WAAgC,EAChC,MAA+C;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACjC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;gBAAE,SAAS;YAC3D,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC1D,IAAI,YAAY,KAAK,IAAI;gBAAE,MAAM,YAAY,CAAC;QAChD,CAAC;QACD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC"}
+{"version":3,"file":"aliases.js","sourceRoot":"","sources":["../../src/composition/aliases.ts"],"names":[],"mappings":"AAWA,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,mBAAmB,GAEpB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,UAAU,GAInB;IACF,QAAQ,EAAE,cAAc;IACxB,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CACrG;IAED,gBAAgB,EAAE,iBAAiB;CACpC,CAAC;AAEF,+FAA+F;AAC/F,MAAM,UAAU,gBAAgB,CAC9B,KAA4B,EAC5B,MAAc;IAEd,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS;YAAE,SAAS;QAClE,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YACzD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ;oBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;;oBAC3D,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,SAAS;QAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC;YACxE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAE,CAAC;AAClB,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AAE9D;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,KAAuB;IACtE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAwC,EACxC,UAA+B;IAE/B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAA2B,EAAE,GAAG,KAAK,EAAE,CAAC;IACjD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChD,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAE,CAAC;gBACxB,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;AAC7B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAAwB,EACxB,WAAgC,EAChC,MAA+C;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACjC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;gBAAE,SAAS;YAC3D,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC1D,IAAI,YAAY,KAAK,IAAI;gBAAE,MAAM,YAAY,CAAC;QAChD,CAAC;QACD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC","sourcesContent":["/**\n * One record of what a typed name means.\n *\n * An evaluator key (`I_W_per_m2`) and the graph source (`poynting-flux`)\n * are the edge's `aliases`. A shared hyphen token is not nearness.\n * Quantity synonyms, comparison targets, and structural-hash renames\n * live in {@link NAME_TABLE}. Spelling resolution is `resolveQuantityName`.\n *\n * @module composition/aliases\n */\nimport type { BridgeEdge } from './edge.js';\nimport {\n  DIMENSION_RENAMES,\n  SYNONYM_GROUPS,\n  synonymDisagreement,\n  type DimensionRename,\n} from '../dimensional/formula-names.js';\nimport { foldName } from '../dimensional/quantity-registry.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\n\n/**\n * The one name table.\n *\n * Synonym groups are {@link SYNONYM_GROUPS}: the same array, not a copy.\n * A comparison target is a name an entry answers to besides its frozen\n * target word, projected from each entry's `targetAliases`. `speed` answers for the sound-speed equation in a comparison\n * and is not a synonym of `sound-speed`. A dimension rename applies only\n * for that dimension, so a time coordinate named `T` stays `T`.\n * Spelling resolution is `resolveQuantityName`, not a second table.\n */\nexport const NAME_TABLE: {\n  readonly synonyms: readonly (readonly string[])[];\n  readonly canonicalTargets: Readonly<Record<string, readonly string[]>>;\n  readonly dimensionRenames: readonly DimensionRename[];\n} = {\n  synonyms: SYNONYM_GROUPS,\n  canonicalTargets: Object.fromEntries(\n    CANONICAL_EQUATIONS.flatMap((e) => (e.targetAliases === undefined ? [] : [[e.id, e.targetAliases]])),\n  ),\n\n  dimensionRenames: DIMENSION_RENAMES,\n};\n\n/** Alias key → source name, for edges whose target is `target`. Ambiguous keys are omitted. */\nexport function aliasesForTarget(\n  edges: readonly BridgeEdge[],\n  target: string,\n): ReadonlyMap<string, string> {\n  const map = new Map<string, string>();\n  const ambiguous = new Set<string>();\n  for (const e of edges) {\n    if (e.target.name !== target || e.aliases === undefined) continue;\n    for (const [quantity, keys] of Object.entries(e.aliases)) {\n      for (const key of keys) {\n        const prev = map.get(key);\n        if (prev !== undefined && prev !== quantity) ambiguous.add(key);\n        else map.set(key, quantity);\n      }\n    }\n  }\n  for (const key of ambiguous) map.delete(key);\n  return map;\n}\n\n/**\n * Optimal string alignment distance. An adjacent transposition is one edit,\n * so `lenght` and `length` are distance 1. Resolution accepts distance ≤ 1.\n * A longer cutoff, and containment, stay a suggestion rank.\n */\nexport function editDistance(a: string, b: string): number {\n  const m = a.length;\n  const n = b.length;\n  let prev2 = new Array<number>(n + 1).fill(0);\n  let prev = Array.from({ length: n + 1 }, (_, j) => j);\n  let curr = new Array<number>(n + 1);\n  for (let i = 1; i <= m; i++) {\n    curr[0] = i;\n    for (let j = 1; j <= n; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      curr[j] = Math.min(prev[j]! + 1, curr[j - 1]! + 1, prev[j - 1]! + cost);\n      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        curr[j] = Math.min(curr[j]!, prev2[j - 2]! + 1);\n      }\n    }\n    [prev2, prev, curr] = [prev, curr, prev2];\n  }\n  return prev[n]!;\n}\n\nconst fold = (s: string): string => foldName(s.toLowerCase());\n\n/**\n * Catalog names within one edit of `query`. A shared token such as\n * `length` is not an edit. Containment is not nearness.\n */\nexport function nearQuantityNames(query: string, names: Iterable<string>): string[] {\n  const needle = fold(query);\n  const hits: string[] = [];\n  for (const name of names) {\n    if (editDistance(needle, fold(name)) <= 1) hits.push(name);\n  }\n  hits.sort((a, b) => a.length - b.length || a.localeCompare(b));\n  return hits;\n}\n\n/**\n * Copy a synonym onto the other name when the graph has it and the user\n * named exactly one of the pair. Two explicit values stay as given.\n */\nexport function shareSynonyms(\n  known: string[] | Record<string, number>,\n  graphNames: ReadonlySet<string>,\n): string[] | Record<string, number> {\n  if (Array.isArray(known)) {\n    let out = known;\n    for (const group of NAME_TABLE.synonyms) {\n      const hit = group.filter((n) => out.includes(n));\n      if (hit.length === 0) continue;\n      const extra = group.filter((n) => graphNames.has(n) && !out.includes(n));\n      if (extra.length > 0) out = [...out, ...extra];\n    }\n    return out;\n  }\n  const out: Record<string, number> = { ...known };\n  let added = false;\n  for (const group of NAME_TABLE.synonyms) {\n    const hit = group.filter((n) => Object.hasOwn(known, n));\n    if (hit.length !== 1) continue;\n    const source = hit[0]!;\n    for (const n of group) {\n      if (graphNames.has(n) && !Object.hasOwn(out, n)) {\n        out[n] = known[source]!;\n        added = true;\n      }\n    }\n  }\n  return added ? out : known;\n}\n\n/**\n * One name per synonym group in a governing set.\n *\n * Copying the value onto the other name lets either spelling evaluate.\n * Both names are the same quantity, so Buckingham must see one of them.\n * The name that is a source of the target stays. The same number under\n * both spellings is that one input. Two different numbers are\n * {@link SynonymDisagreementError}: the report does not pick one.\n */\nexport function collapseSynonymGovernors(\n  names: readonly string[],\n  sourceNames: ReadonlySet<string>,\n  values: Readonly<Record<string, number>> | null,\n): string[] {\n  const drop = new Set<string>();\n  for (const group of NAME_TABLE.synonyms) {\n    const present = group.filter((n) => names.includes(n));\n    if (present.length < 2) continue;\n    if (values !== null) {\n      if (present.some((n) => values[n] === undefined)) continue;\n      const disagreement = synonymDisagreement(present, values);\n      if (disagreement !== null) throw disagreement;\n    }\n    const sources = present.filter((n) => sourceNames.has(n));\n    const keep = sources[0] ?? present[0]!;\n    for (const n of present) if (n !== keep) drop.add(n);\n  }\n  return names.filter((n) => !drop.has(n));\n}\n"]}

package/dist/composition/audit-coverage.d.ts

@@ -27,6 +27,8 @@
  *      signature (numerically computable + dimensionally encoded).
  *   - `encoded-only` — has a dimensional signature but no graph edge.
  *   - `thin` — no dimensional signature (catalogued by label/prose only).
+ *
+ * @internal
  */
 export type GroundingTier = 'data-confronted' | 'graph-computable' | 'encoded-only' | 'thin';
 /** One bridge's empirical-grounding profile. */

package/dist/composition/audit-coverage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"audit-coverage.d.ts","sourceRoot":"","sources":["../../src/composition/audit-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAMH;;;;;;;GAOG;AACH,MAAM,MAAM,aAAa,GACrB,iBAAiB,GACjB,kBAAkB,GAClB,cAAc,GACd,MAAM,CAAC;AAEX,gDAAgD;AAChD,UAAU,cAAc;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,kDAAkD;IAClD,QAAQ,CAAC,oBAAoB,EAAE,OAAO,CAAC;IACvC,0EAA0E;IAC1E,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,yDAAyD;IACzD,QAAQ,CAAC,2BAA2B,EAAE,OAAO,CAAC;IAC9C,4DAA4D;IAC5D,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;CAClC;AAED,wCAAwC;AACxC,UAAU,cAAc;IACtB,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,+BAA+B;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,mEAAmE;IACnE,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC;IAC1C,mDAAmD;IACnD,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,sEAAsE;IACtE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,IAAI,cAAc,CA6C9C"}
+{"version":3,"file":"audit-coverage.d.ts","sourceRoot":"","sources":["../../src/composition/audit-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAMH;;;;;;;;;GASG;AACH,MAAM,MAAM,aAAa,GACrB,iBAAiB,GACjB,kBAAkB,GAClB,cAAc,GACd,MAAM,CAAC;AAEX,gDAAgD;AAChD,UAAU,cAAc;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,kDAAkD;IAClD,QAAQ,CAAC,oBAAoB,EAAE,OAAO,CAAC;IACvC,0EAA0E;IAC1E,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,yDAAyD;IACzD,QAAQ,CAAC,2BAA2B,EAAE,OAAO,CAAC;IAC9C,4DAA4D;IAC5D,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;CAClC;AAED,wCAAwC;AACxC,UAAU,cAAc;IACtB,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,+BAA+B;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,mEAAmE;IACnE,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC;IAC1C,mDAAmD;IACnD,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,sEAAsE;IACtE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,IAAI,cAAc,CA6C9C"}

package/dist/composition/audit-coverage.js.map

@@ -1 +1 @@
-{"version":3,"file":"audit-coverage.js","sourceRoot":"","sources":["../../src/composition/audit-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AA+CnD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,OAAO,GAAqB,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC/D,MAAM,oBAAoB,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/D,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChD,MAAM,2BAA2B,GAAG,KAAK,CAAC,qBAAqB,KAAK,IAAI,CAAC;QAEzE,IAAI,IAAmB,CAAC;QACxB,IAAI,oBAAoB;YAAE,IAAI,GAAG,iBAAiB,CAAC;aAC9C,IAAI,YAAY,IAAI,2BAA2B;YAAE,IAAI,GAAG,kBAAkB,CAAC;aAC3E,IAAI,2BAA2B;YAAE,IAAI,GAAG,cAAc,CAAC;;YACvD,IAAI,GAAG,MAAM,CAAC;QAEnB,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,IAAI;YACJ,oBAAoB;YACpB,YAAY;YACZ,2BAA2B;YAC3B,aAAa,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM;YACtC,eAAe,EAAE,KAAK,CAAC,YAAY,CAAC,MAAM;SAC3C,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAkC;QAC5C,iBAAiB,EAAE,CAAC;QACpB,kBAAkB,EAAE,CAAC;QACrB,cAAc,EAAE,CAAC;QACjB,IAAI,EAAE,CAAC;KACR,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAE1C,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5C,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,MAAM;QACN,wBAAwB,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,MAAM;QAC/E,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,MAAM;QACpE,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KAC7F,CAAC;AACJ,CAAC"}
+{"version":3,"file":"audit-coverage.js","sourceRoot":"","sources":["../../src/composition/audit-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAiDnD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,OAAO,GAAqB,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC/D,MAAM,oBAAoB,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/D,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChD,MAAM,2BAA2B,GAAG,KAAK,CAAC,qBAAqB,KAAK,IAAI,CAAC;QAEzE,IAAI,IAAmB,CAAC;QACxB,IAAI,oBAAoB;YAAE,IAAI,GAAG,iBAAiB,CAAC;aAC9C,IAAI,YAAY,IAAI,2BAA2B;YAAE,IAAI,GAAG,kBAAkB,CAAC;aAC3E,IAAI,2BAA2B;YAAE,IAAI,GAAG,cAAc,CAAC;;YACvD,IAAI,GAAG,MAAM,CAAC;QAEnB,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,IAAI;YACJ,oBAAoB;YACpB,YAAY;YACZ,2BAA2B;YAC3B,aAAa,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM;YACtC,eAAe,EAAE,KAAK,CAAC,YAAY,CAAC,MAAM;SAC3C,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAkC;QAC5C,iBAAiB,EAAE,CAAC;QACpB,kBAAkB,EAAE,CAAC;QACrB,cAAc,EAAE,CAAC;QACjB,IAAI,EAAE,CAAC;KACR,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAE1C,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5C,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,MAAM;QACN,wBAAwB,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,MAAM;QAC/E,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,MAAM;QACpE,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KAC7F,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Empirical-spine coverage audit (Direction 4).\n *\n * \"Strengthen the empirical spine\" must NOT fabricate physics data, so the\n * responsible, composable deliverable is tooling that makes the spine's gaps\n * machine-visible: for each catalogued bridge, what grounding does it\n * actually have — a real-data confrontation, a computable graph edge, a\n * dimensional-signature encoding, or nothing but a status label? The report\n * tells the physicist-reviewer (CONTRIBUTING.md) exactly where the grounding\n * is thinnest, and lets the discovery loop prefer well-grounded bridges.\n *\n * This INVENTS nothing — every field is read from the catalog\n * (`BRIDGE_EQUATIONS`), the composition graph (`CATALOG_GRAPH`), and the\n * confrontation projection `DATA_CONFRONTED_IDS`.\n *\n * The `CATALOG_GRAPH` scan lives here, beside `catalog-graph.ts`.\n * `DATA_CONFRONTED_IDS` stays in `bridges/confrontation-coverage.ts`.\n *\n * INTERNAL — surfaced via `upt coverage`.\n *\n * @module composition/audit-coverage\n */\n\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { DATA_CONFRONTED_IDS } from '../bridges/confrontation-coverage.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\n\n/**\n * The grounding tier of one bridge, strongest first:\n *   - `data-confronted` — has a committed real-data confrontation.\n *   - `graph-computable` — has a composition-graph edge AND a dimensional\n *      signature (numerically computable + dimensionally encoded).\n *   - `encoded-only` — has a dimensional signature but no graph edge.\n *   - `thin` — no dimensional signature (catalogued by label/prose only).\n *\n * @internal\n */\nexport type GroundingTier =\n  | 'data-confronted'\n  | 'graph-computable'\n  | 'encoded-only'\n  | 'thin';\n\n/** One bridge's empirical-grounding profile. */\ninterface BridgeCoverage {\n  readonly id: number;\n  readonly status: string;\n  readonly tier: GroundingTier;\n  /** A committed real-data confrontation exists. */\n  readonly hasDataConfrontation: boolean;\n  /** A composition-graph edge (computable evaluator) exists for this id. */\n  readonly hasGraphEdge: boolean;\n  /** A dimensional signature is registered for this id. */\n  readonly dimensionalSignaturePresent: boolean;\n  /** Number of literature references in the catalog entry. */\n  readonly citationCount: number;\n  /** Number of recorded known issues. */\n  readonly knownIssueCount: number;\n}\n\n/** The catalog-wide coverage report. */\ninterface CoverageReport {\n  readonly bridges: readonly BridgeCoverage[];\n  readonly total: number;\n  /** Count by grounding tier. */\n  readonly byTier: Readonly<Record<GroundingTier, number>>;\n  /** Bridges with NO real-data confrontation (the empirical gap). */\n  readonly withoutDataConfrontation: number;\n  /** Bridges with NO literature reference at all. */\n  readonly withoutCitation: number;\n  /** Ids of the thinnest bridges (no dimensional signature), sorted. */\n  readonly thinBridges: readonly number[];\n}\n\n/**\n * Audit the catalog's empirical grounding. Reads `BRIDGE_EQUATIONS`, the\n * composition graph, and the data-confrontation registry; fabricates\n * nothing. See module docs.\n *\n * @internal\n */\nexport function auditCoverage(): CoverageReport {\n  const graphEdgeIds = new Set<number>();\n  for (const e of CATALOG_GRAPH) {\n    if (e.beId !== null) graphEdgeIds.add(e.beId);\n  }\n\n  const bridges: BridgeCoverage[] = BRIDGE_EQUATIONS.map((entry) => {\n    const hasDataConfrontation = DATA_CONFRONTED_IDS.has(entry.id);\n    const hasGraphEdge = graphEdgeIds.has(entry.id);\n    const dimensionalSignaturePresent = entry.dimensional_signature !== null;\n\n    let tier: GroundingTier;\n    if (hasDataConfrontation) tier = 'data-confronted';\n    else if (hasGraphEdge && dimensionalSignaturePresent) tier = 'graph-computable';\n    else if (dimensionalSignaturePresent) tier = 'encoded-only';\n    else tier = 'thin';\n\n    return {\n      id: entry.id,\n      status: entry.status,\n      tier,\n      hasDataConfrontation,\n      hasGraphEdge,\n      dimensionalSignaturePresent,\n      citationCount: entry.references.length,\n      knownIssueCount: entry.known_issues.length,\n    };\n  });\n\n  const byTier: Record<GroundingTier, number> = {\n    'data-confronted': 0,\n    'graph-computable': 0,\n    'encoded-only': 0,\n    thin: 0,\n  };\n  for (const b of bridges) byTier[b.tier]++;\n\n  return {\n    bridges: bridges.sort((a, b) => a.id - b.id),\n    total: bridges.length,\n    byTier,\n    withoutDataConfrontation: bridges.filter((b) => !b.hasDataConfrontation).length,\n    withoutCitation: bridges.filter((b) => b.citationCount === 0).length,\n    thinBridges: bridges.filter((b) => b.tier === 'thin').map((b) => b.id).sort((a, b) => a - b),\n  };\n}\n"]}

package/dist/composition/axes.d.ts

@@ -30,6 +30,12 @@ export type SymmetryAxis = 'poincare' | 'gauge' | 'conformal' | 'susy' | 'emerge
 export type TopologyAxis = 'trivial' | 'chern' | 'winding' | 'z2' | 'berry';
 /** Quantum statistics (the 7th axis — orthogonal to the other six). @internal */
 export type StatisticsAxis = 'bosonic' | 'fermionic' | 'anyonic' | 'parastatistic';
+/** The scale values, the one list the registry row and every typed consumer read. @internal */
+export declare const SCALE_AXIS_VALUES: readonly ScaleAxis[];
+/** The force values. @internal */
+export declare const FORCE_AXIS_VALUES: readonly ForceAxis[];
+/** The symmetry values. @internal */
+export declare const SYMMETRY_AXIS_VALUES: readonly SymmetryAxis[];
 /** A classification-axis specification. @internal */
 export interface AxisSpec {
     /** The axis key, matching the `RegimeAttributes` field name. */

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

@@ -1 +1 @@
-{"version":3,"file":"axes.d.ts","sourceRoot":"","sources":["../../src/composition/axes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,4CAA4C;AAC5C,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,YAAY,GAAG,WAAW,GAAG,cAAc,CAAC;AAChF,yCAAyC;AACzC,MAAM,MAAM,SAAS,GACjB,eAAe,GACf,iBAAiB,GACjB,MAAM,GACN,QAAQ,GACR,UAAU,CAAC;AACf,qCAAqC;AACrC,MAAM,MAAM,eAAe,GAAG,aAAa,GAAG,SAAS,GAAG,YAAY,GAAG,SAAS,CAAC;AACnF,gCAAgC;AAChC,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,GAAG,UAAU,CAAC;AACpF,6DAA6D;AAC7D,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,OAAO,CAAC;AAC5E,iFAAiF;AACjF,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,eAAe,CAAC;AAEnF,qDAAqD;AACrD,MAAM,WAAW,QAAQ;IACvB,gEAAgE;IAChE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mFAAmF;IACnF,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,IAAI,EAAE,SAAS,QAAQ,EAqCnC,CAAC;AAEF,6FAA6F;AAC7F,eAAO,MAAM,SAAS,EAAE,SAAS,MAAM,EAAmD,CAAC"}
+{"version":3,"file":"axes.d.ts","sourceRoot":"","sources":["../../src/composition/axes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,4CAA4C;AAC5C,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,YAAY,GAAG,WAAW,GAAG,cAAc,CAAC;AAChF,yCAAyC;AACzC,MAAM,MAAM,SAAS,GACjB,eAAe,GACf,iBAAiB,GACjB,MAAM,GACN,QAAQ,GACR,UAAU,CAAC;AACf,qCAAqC;AACrC,MAAM,MAAM,eAAe,GAAG,aAAa,GAAG,SAAS,GAAG,YAAY,GAAG,SAAS,CAAC;AACnF,gCAAgC;AAChC,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,GAAG,UAAU,CAAC;AACpF,6DAA6D;AAC7D,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,OAAO,CAAC;AAC5E,iFAAiF;AACjF,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,eAAe,CAAC;AAEnF,+FAA+F;AAC/F,eAAO,MAAM,iBAAiB,EAAE,SAAS,SAAS,EAA2D,CAAC;AAC9G,kCAAkC;AAClC,eAAO,MAAM,iBAAiB,EAAE,SAAS,SAAS,EAAuE,CAAC;AAG1H,qCAAqC;AACrC,eAAO,MAAM,oBAAoB,EAAE,SAAS,YAAY,EAA2D,CAAC;AAMpH,qDAAqD;AACrD,MAAM,WAAW,QAAQ;IACvB,gEAAgE;IAChE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mFAAmF;IACnF,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,IAAI,EAAE,SAAS,QAAQ,EAqCnC,CAAC;AAEF,6FAA6F;AAC7F,eAAO,MAAM,SAAS,EAAE,SAAS,MAAM,EAAmD,CAAC"}

package/dist/composition/axes.js

@@ -18,6 +18,18 @@
  *
  * @module composition/axes
  */
+/** The scale values, the one list the registry row and every typed consumer read. @internal */
+export const SCALE_AXIS_VALUES = ['quantum', 'mesoscopic', 'classical', 'cosmological'];
+/** The force values. @internal */
+export const FORCE_AXIS_VALUES = ['gravitational', 'electromagnetic', 'weak', 'strong', 'emergent'];
+/** The information-measure values; read by its `AXES` row alone, so not exported. */
+const INFORMATION_AXIS_VALUES = ['von-neumann', 'shannon', 'kolmogorov', 'discord'];
+/** The symmetry values. @internal */
+export const SYMMETRY_AXIS_VALUES = ['poincare', 'gauge', 'conformal', 'susy', 'emergent'];
+/** The topology values; read by its `AXES` row alone, so not exported. */
+const TOPOLOGY_AXIS_VALUES = ['trivial', 'chern', 'winding', 'z2', 'berry'];
+/** The statistics values; read by its `AXES` row alone, so not exported. */
+const STATISTICS_AXIS_VALUES = ['bosonic', 'fermionic', 'anyonic', 'parastatistic'];
 /**
  * The classification-axis registry. `gated` reflects measured discrimination:
  * scale/force fire on the current catalog; the rest abstain (too little attribute
@@ -28,37 +40,37 @@
 export const AXES = [
     {
         name: 'scale',
-        values: ['quantum', 'mesoscopic', 'classical', 'cosmological'],
+        values: SCALE_AXIS_VALUES,
         gated: true,
         description: 'Length/energy-scale regime (quantum → cosmological).',
     },
     {
         name: 'force',
-        values: ['gravitational', 'electromagnetic', 'weak', 'strong', 'emergent'],
+        values: FORCE_AXIS_VALUES,
         gated: true,
         description: 'Fundamental (or emergent effective) interaction.',
     },
     {
         name: 'information',
-        values: ['von-neumann', 'shannon', 'kolmogorov', 'discord'],
+        values: INFORMATION_AXIS_VALUES,
         gated: false,
         description: 'Information measure — authored, not gated (see discovery precision calibration).',
     },
     {
         name: 'symmetry',
-        values: ['poincare', 'gauge', 'conformal', 'susy', 'emergent'],
+        values: SYMMETRY_AXIS_VALUES,
         gated: false,
         description: 'Symmetry class — first-class attribute; ungated until coverage + audit earn it.',
     },
     {
         name: 'topology',
-        values: ['trivial', 'chern', 'winding', 'z2', 'berry'],
+        values: TOPOLOGY_AXIS_VALUES,
         gated: false,
         description: 'Topological invariant type — populates the rank-6 Topology axis; ungated until audit.',
     },
     {
         name: 'statistics',
-        values: ['bosonic', 'fermionic', 'anyonic', 'parastatistic'],
+        values: STATISTICS_AXIS_VALUES,
         gated: false,
         description: 'Quantum statistics (the 7th axis). NOTE: spin-statistics ties it to symmetry — the audit must confirm it discriminates independently before gating.',
     },

package/dist/composition/axes.js.map

@@ -1 +1 @@
-{"version":3,"file":"axes.js","sourceRoot":"","sources":["../../src/composition/axes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAmCH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,IAAI,GAAwB;IACvC;QACE,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,CAAC,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,CAAC;QAC9D,KAAK,EAAE,IAAI;QACX,WAAW,EAAE,sDAAsD;KACpE;IACD;QACE,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,CAAC,eAAe,EAAE,iBAAiB,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC;QAC1E,KAAK,EAAE,IAAI;QACX,WAAW,EAAE,kDAAkD;KAChE;IACD;QACE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,CAAC,aAAa,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC;QAC3D,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,kFAAkF;KAChG;IACD;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,CAAC;QAC9D,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,iFAAiF;KAC/F;IACD;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC;QACtD,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,uFAAuF;KACrG;IACD;QACE,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,CAAC,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,CAAC;QAC5D,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,qJAAqJ;KACnK;CACF,CAAC;AAEF,6FAA6F;AAC7F,MAAM,CAAC,MAAM,SAAS,GAAsB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC"}
+{"version":3,"file":"axes.js","sourceRoot":"","sources":["../../src/composition/axes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAoBH,+FAA+F;AAC/F,MAAM,CAAC,MAAM,iBAAiB,GAAyB,CAAC,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;AAC9G,kCAAkC;AAClC,MAAM,CAAC,MAAM,iBAAiB,GAAyB,CAAC,eAAe,EAAE,iBAAiB,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AAC1H,qFAAqF;AACrF,MAAM,uBAAuB,GAA+B,CAAC,aAAa,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;AAChH,qCAAqC;AACrC,MAAM,CAAC,MAAM,oBAAoB,GAA4B,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;AACpH,0EAA0E;AAC1E,MAAM,oBAAoB,GAA4B,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AACrG,4EAA4E;AAC5E,MAAM,sBAAsB,GAA8B,CAAC,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;AAiB/G;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,IAAI,GAAwB;IACvC;QACE,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,iBAAiB;QACzB,KAAK,EAAE,IAAI;QACX,WAAW,EAAE,sDAAsD;KACpE;IACD;QACE,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,iBAAiB;QACzB,KAAK,EAAE,IAAI;QACX,WAAW,EAAE,kDAAkD;KAChE;IACD;QACE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,uBAAuB;QAC/B,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,kFAAkF;KAChG;IACD;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,oBAAoB;QAC5B,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,iFAAiF;KAC/F;IACD;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,oBAAoB;QAC5B,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,uFAAuF;KACrG;IACD;QACE,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,sBAAsB;QAC9B,KAAK,EAAE,KAAK;QACZ,WAAW,EAAE,qJAAqJ;KACnK;CACF,CAAC;AAEF,6FAA6F;AAC7F,MAAM,CAAC,MAAM,SAAS,GAAsB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC","sourcesContent":["/**\n * The extensible tensor-axis registry — the single source for UPT's classification\n * axes (the regime/attribute layer the discovery funnel and quantities use).\n *\n * Each axis is BOTH a typed union (compile-time safety) AND an {@link AxisSpec}\n * registry entry (runtime — drives the discovery falsifier and the discrimination\n * audit). Adding an axis is one union + one registry line + tagging quantities;\n * enabling its falsifier gate is a one-line `gated: true` flip — but only after the\n * discrimination audit (`axis-audit.ts`) shows it actually fires. Rank grows on\n * measured physics, not vision — an axis that only ever abstains stays ungated.\n *\n * NOTE: the SI `Dimension` axis is deliberately NOT here — it is the complete 7-base\n * system in `dimensional/` (conflating it would break Buckingham-π). The tensor-config\n * types in `core/types.ts` (`PhysicalScale`/`Force`/… consumed by `UniversalTensor`)\n * are a separate concern; this registry is the discovery/attribute layer.\n *\n * Leaf module — no intra-`composition` imports (keeps the type-only cycle count at 0).\n *\n * @module composition/axes\n */\n\n/** Length/energy scale regime. @internal */\nexport type ScaleAxis = 'quantum' | 'mesoscopic' | 'classical' | 'cosmological';\n/** Fundamental interaction. @internal */\nexport type ForceAxis =\n  | 'gravitational'\n  | 'electromagnetic'\n  | 'weak'\n  | 'strong'\n  | 'emergent';\n/** Information measure. @internal */\nexport type InformationAxis = 'von-neumann' | 'shannon' | 'kolmogorov' | 'discord';\n/** Symmetry class. @internal */\nexport type SymmetryAxis = 'poincare' | 'gauge' | 'conformal' | 'susy' | 'emergent';\n/** Topological classification (invariant type). @internal */\nexport type TopologyAxis = 'trivial' | 'chern' | 'winding' | 'z2' | 'berry';\n/** Quantum statistics (the 7th axis — orthogonal to the other six). @internal */\nexport type StatisticsAxis = 'bosonic' | 'fermionic' | 'anyonic' | 'parastatistic';\n\n/** The scale values, the one list the registry row and every typed consumer read. @internal */\nexport const SCALE_AXIS_VALUES: readonly ScaleAxis[] = ['quantum', 'mesoscopic', 'classical', 'cosmological'];\n/** The force values. @internal */\nexport const FORCE_AXIS_VALUES: readonly ForceAxis[] = ['gravitational', 'electromagnetic', 'weak', 'strong', 'emergent'];\n/** The information-measure values; read by its `AXES` row alone, so not exported. */\nconst INFORMATION_AXIS_VALUES: readonly InformationAxis[] = ['von-neumann', 'shannon', 'kolmogorov', 'discord'];\n/** The symmetry values. @internal */\nexport const SYMMETRY_AXIS_VALUES: readonly SymmetryAxis[] = ['poincare', 'gauge', 'conformal', 'susy', 'emergent'];\n/** The topology values; read by its `AXES` row alone, so not exported. */\nconst TOPOLOGY_AXIS_VALUES: readonly TopologyAxis[] = ['trivial', 'chern', 'winding', 'z2', 'berry'];\n/** The statistics values; read by its `AXES` row alone, so not exported. */\nconst STATISTICS_AXIS_VALUES: readonly StatisticsAxis[] = ['bosonic', 'fermionic', 'anyonic', 'parastatistic'];\n\n/** A classification-axis specification. @internal */\nexport interface AxisSpec {\n  /** The axis key, matching the `RegimeAttributes` field name. */\n  readonly name: string;\n  /** The axis's allowed values at runtime (must equal the typed union's members). */\n  readonly values: readonly string[];\n  /**\n   * Whether the discovery axis-falsifier gates on this axis. Flipped to `true`\n   * ONLY when `auditAxisDiscrimination` shows the axis actually clashes on real\n   * candidates — never on vision alone.\n   */\n  readonly gated: boolean;\n  readonly description: string;\n}\n\n/**\n * The classification-axis registry. `gated` reflects measured discrimination:\n * scale/force fire on the current catalog; the rest abstain (too little attribute\n * coverage yet) and stay ungated until the branch expansion + audit earn them a gate.\n *\n * @internal\n */\nexport const AXES: readonly AxisSpec[] = [\n  {\n    name: 'scale',\n    values: SCALE_AXIS_VALUES,\n    gated: true,\n    description: 'Length/energy-scale regime (quantum → cosmological).',\n  },\n  {\n    name: 'force',\n    values: FORCE_AXIS_VALUES,\n    gated: true,\n    description: 'Fundamental (or emergent effective) interaction.',\n  },\n  {\n    name: 'information',\n    values: INFORMATION_AXIS_VALUES,\n    gated: false,\n    description: 'Information measure — authored, not gated (see discovery precision calibration).',\n  },\n  {\n    name: 'symmetry',\n    values: SYMMETRY_AXIS_VALUES,\n    gated: false,\n    description: 'Symmetry class — first-class attribute; ungated until coverage + audit earn it.',\n  },\n  {\n    name: 'topology',\n    values: TOPOLOGY_AXIS_VALUES,\n    gated: false,\n    description: 'Topological invariant type — populates the rank-6 Topology axis; ungated until audit.',\n  },\n  {\n    name: 'statistics',\n    values: STATISTICS_AXIS_VALUES,\n    gated: false,\n    description: 'Quantum statistics (the 7th axis). NOTE: spin-statistics ties it to symmetry — the audit must confirm it discriminates independently before gating.',\n  },\n];\n\n/** The axis names the discovery falsifier gates on (derived from the registry). @internal */\nexport const GATE_AXES: readonly string[] = AXES.filter((a) => a.gated).map((a) => a.name);\n"]}

package/dist/composition/axis-audit.d.ts

@@ -1,23 +1,36 @@
+import type { BridgeEdge } from './edge.js';
+import type { RegimeAttributes } from './quantity.js';
+import type { QuantityIdentification } from './compose.js';
+import type { DiscoveryOptions } from './discovery.js';
 /**
- * Axis-discrimination audit — the anti-inert-metadata gate for the extensible
- * axis registry (`axes.ts`).
- *
- * A classification axis is only load-bearing when it actually SEPARATES real
- * candidates. This audit runs the discovery link-candidate enumeration and, for
- * EVERY registry axis (gated or not), measures how often the axis FIRES (both
- * endpoints carry the attribute and they differ → an axis-clash), ABSTAINS (at
- * least one endpoint lacks the attribute), and is CHECKED (both carry it).
+ * The level at which an axis is `earned`: 0.05, the conventional two-sided level, fixed before
+ * any table was read. Six axes are audited at once, so a reader who wants a family-wise level
+ * divides by six (0.0083); the flag is per axis and says so here rather than hiding a
+ * correction. Small tables (about twenty magnitude clashes on the catalog) are why the test is
+ * exact and not a χ².
  *
- * Use: an axis stays `gated: false` in the registry until this audit shows it
- * fires; an axis that only ever abstains is inert and must not be gated. As the
- * catalog grows into new branches of physics, re-run this and flip the gates the
- * measurement earns. Rank grows on evidence, not vision.
+ * @internal
+ */
+export declare const AUDIT_ALPHA = 0.05;
+/**
+ * Fisher's exact evidence of one axis against the magnitude falsifier, over the candidates
+ * where BOTH gates ran (both endpoints carry the axis, and both have a magnitude).
  *
- * @module composition/axis-audit
+ * @internal
  */
-import type { BridgeEdge } from './edge.js';
-import type { RegimeAttributes } from './quantity.js';
-import type { QuantityIdentification } from './compose.js';
+export interface AxisEvidence {
+    /**
+     * `[[fires ∧ clash, fires ∧ no clash], [silent ∧ clash, silent ∧ no clash]]`: rows are the
+     * axis's verdict, columns the magnitude falsifier's.
+     */
+    readonly table: readonly [readonly [number, number], readonly [number, number]];
+    /** Sample odds ratio `ad/bc`, as MathTS reports it; `null` when a zero cell leaves it undefined. */
+    readonly oddsRatio: number | null;
+    /** Two-sided Fisher exact p; 1 when a margin is zero (only one table is possible). */
+    readonly pValue: number;
+    /** Candidates where both gates ran (the table's total). */
+    readonly n: number;
+}
 /** Per-axis discrimination measurement over the candidate funnel. @internal */
 export interface AxisDiscrimination {
     readonly axis: string;
@@ -32,15 +45,29 @@ export interface AxisDiscrimination {
     /** fires / checked (0 when nothing is checked). */
     readonly clashRate: number;
     /**
-     * A gate is EARNED when the axis fires at all. `false` here on an ungated axis
-     * = inert (do not gate); `false` on a gated axis = a regression to investigate.
+     * The registry's criterion: a gate is EARNED when the axis fires at all. `false` here on an
+     * ungated axis = inert (do not gate); `false` on a gated axis = a regression to investigate.
+     * Not changed by `evidence`.
      */
     readonly discriminates: boolean;
+    /** Fisher's exact test of the axis's fires against the magnitude falsifier's clashes. */
+    readonly evidence: AxisEvidence;
+    /**
+     * The axis's fires coincide with the independent falsifier's clashes more often than chance:
+     * `evidence.pValue < AUDIT_ALPHA` AND the association is positive (`a·d > b·c`; an axis whose
+     * fires avoid the clashes is not earned, however small its p). Reported beside
+     * `discriminates`; it changes no gate.
+     */
+    readonly earned: boolean;
 }
+/** The inputs of the magnitude gate an audit may override (a synthetic table for a test). @internal */
+export type AxisAuditOptions = Pick<DiscoveryOptions, 'representativeValues' | 'groundTruth' | 'maxOrdersOfMagnitude'>;
 /**
- * Audit every registry axis's discrimination over the discovery candidate funnel.
+ * Audit every registry axis's discrimination over the discovery candidate funnel, with Fisher
+ * evidence against the magnitude falsifier. The magnitude gate runs once per candidate from one
+ * discovery context (`buildDiscoveryContext`), not the whole funnel.
  *
  * @internal
  */
-export declare function auditAxisDiscrimination(edges: readonly BridgeEdge[], attributesByName?: ReadonlyMap<string, RegimeAttributes>, identifications?: readonly QuantityIdentification[]): AxisDiscrimination[];
+export declare function auditAxisDiscrimination(edges: readonly BridgeEdge[], attributesByName?: ReadonlyMap<string, RegimeAttributes>, identifications?: readonly QuantityIdentification[], options?: AxisAuditOptions): AxisDiscrimination[];
 //# sourceMappingURL=axis-audit.d.ts.map

package/dist/composition/axis-audit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"axis-audit.d.ts","sourceRoot":"","sources":["../../src/composition/axis-audit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAM3D,+EAA+E;AAC/E,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,gEAAgE;IAChE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wEAAwE;IACxE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,iFAAiF;IACjF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,gBAAgB,GAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAA+B,EACrF,eAAe,GAAE,SAAS,sBAAsB,EAA6B,GAC5E,kBAAkB,EAAE,CAkCtB"}
+{"version":3,"file":"axis-audit.d.ts","sourceRoot":"","sources":["../../src/composition/axis-audit.ts"],"names":[],"mappings":"AAyBA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAK3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAEvD;;;;;;;;GAQG;AACH,eAAO,MAAM,WAAW,OAAO,CAAC;AAEhC;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAChF,oGAAoG;IACpG,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,2DAA2D;IAC3D,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,+EAA+E;AAC/E,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,gEAAgE;IAChE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wEAAwE;IACxE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,iFAAiF;IACjF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;IAChC,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,uGAAuG;AACvG,MAAM,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,EAAE,sBAAsB,GAAG,aAAa,GAAG,sBAAsB,CAAC,CAAC;AAavH;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,gBAAgB,GAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAA+B,EACrF,eAAe,GAAE,SAAS,sBAAsB,EAA6B,EAC7E,OAAO,GAAE,gBAAqB,GAC7B,kBAAkB,EAAE,CAuDtB"}