universal-physics-tensor 0.47.1 → 1.0.2

package/dist/atlas/chain-pipeline.js

@@ -0,0 +1,176 @@
+/**
+ * Internal bridge-discovery pipeline.
+ *
+ * Seeds, then seed-filtered symbolic enumeration, the Buckingham filter,
+ * the structural classifier, the regime join gate, the chain order,
+ * and the proof-target stub.
+ * A confirmation reports the catalog id. A restatement reports the
+ * pre-declared canonical equation. A regime mismatch is recorded and
+ * is not a stub. Any other survivor is a statement skeleton. Nothing
+ * is written into the catalog.
+ *
+ * No command calls this. `discovery.ts` and the probe are not inputs.
+ *
+ * @module atlas/chain-pipeline
+ */
+import { DIMENSIONLESS } from '../dimensional/types.js';
+import { equals } from '../dimensional/algebra.js';
+import { CONSTANTS } from '../dimensional/symbolic-constants.js';
+import { enumerateCompositions } from '../composition/enumerate.js';
+import { buckinghamFilter } from '../composition/buckingham-filter.js';
+import { matchChain } from '../composition/chain-match.js';
+import { compareChainEdgeIds, orderChainCandidates, } from '../composition/chain-candidate.js';
+import { joinRegimeMismatch, } from '../composition/chain-regime.js';
+import { bridgeSeedKeys, physjsTheorem } from './physjs-ref.js';
+import { emitProofTarget } from './proof-target.js';
+function isNumericName(name) {
+    return /^\d+(\.\d+)?$/.test(name);
+}
+function isDimensionlessConstant(name) {
+    if (/^\d*pi$/.test(name))
+        return true;
+    const registered = CONSTANTS[name];
+    return registered !== undefined && equals(registered.dim, DIMENSIONLESS);
+}
+function collectSymbols(expr, out) {
+    switch (expr.kind) {
+        case 'symbol':
+            out.set(expr.name, expr.dim);
+            return;
+        case 'op':
+            for (const arg of expr.args)
+                collectSymbols(arg, out);
+            return;
+        case 'integral':
+            collectSymbols(expr.over, out);
+            collectSymbols(expr.integrand, out);
+            return;
+        case 'derivative':
+            collectSymbols(expr.of, out);
+            collectSymbols(expr.wrt, out);
+            return;
+        case 'transcendental':
+        case 'abs':
+        case 'dirac-delta':
+            collectSymbols(expr.arg, out);
+            return;
+        default:
+            return;
+    }
+}
+/** Dimensioned leaves of the composed formula, excluding the target name. */
+function governingOf(expr, targetName) {
+    const dims = new Map();
+    collectSymbols(expr, dims);
+    const vars = [];
+    for (const [name, dim] of dims) {
+        if (name === targetName)
+            continue;
+        if (isNumericName(name) || isDimensionlessConstant(name))
+            continue;
+        vars.push({ name, dim });
+    }
+    vars.sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
+    return vars;
+}
+function toCandidate(classification, filter) {
+    const theorem = filter.theorem ?? undefined;
+    const carried = theorem === undefined ? {} : { theorem };
+    if (classification.kind === 'confirmation') {
+        return {
+            kind: 'confirmation',
+            edgeIds: classification.edgeIds,
+            catalogId: classification.catalogId,
+            ...carried,
+        };
+    }
+    if (classification.kind === 'restatement') {
+        return {
+            kind: 'restatement',
+            edgeIds: classification.edgeIds,
+            canonicalId: classification.canonicalId,
+            restatesBridge: classification.restatesBridge,
+            ...carried,
+        };
+    }
+    const kind = filter.theorem === 'PhysJS.Dimensional.monomial_form'
+        ? 'unique-monomial'
+        : 'unfixed-shape';
+    return {
+        kind,
+        edgeIds: classification.edgeIds,
+        id: classification.id,
+        ...carried,
+    };
+}
+function theoremsFor(edgeIds) {
+    return edgeIds.map((id) => {
+        const name = physjsTheorem(id);
+        if (name === undefined) {
+            throw new Error(`chain pipeline: manifest copy has no theorem for seed '${id}'`);
+        }
+        return name;
+    });
+}
+function emit(candidate) {
+    if (candidate.kind === 'confirmation' && candidate.catalogId !== undefined) {
+        return {
+            kind: 'confirmation',
+            catalogId: candidate.catalogId,
+            edgeIds: candidate.edgeIds,
+        };
+    }
+    if (candidate.kind === 'restatement' &&
+        candidate.canonicalId !== undefined &&
+        candidate.restatesBridge !== undefined) {
+        return {
+            kind: 'restatement',
+            canonicalId: candidate.canonicalId,
+            restatesBridge: candidate.restatesBridge,
+            edgeIds: candidate.edgeIds,
+        };
+    }
+    const id = candidate.id ?? `chain-${candidate.edgeIds.join('-')}`;
+    return {
+        kind: 'stub',
+        id,
+        edgeIds: candidate.edgeIds,
+        text: emitProofTarget({ ...candidate, id }, theoremsFor(candidate.edgeIds)),
+    };
+}
+/**
+ * Run the pipeline on `edges`.
+ *
+ * A manifest key whose derived kind is not `bridge` is not a premise.
+ * A chain the Buckingham filter drops is absent. A confirmation or a
+ * restatement is not sent to the regime gate. Any other mismatch is
+ * `rejected: regime mismatch` and is not a stub. The catalog array is
+ * not modified.
+ *
+ * @internal
+ */
+export function runChainPipeline(edges) {
+    const seedIds = new Set(bridgeSeedKeys());
+    const report = enumerateCompositions(edges, { seedIds });
+    const candidates = [];
+    const rejections = [];
+    for (const target of report.proofTargets) {
+        const filtered = buckinghamFilter({ name: target.second.target.name, dim: target.second.target.dim }, governingOf(target.expr, target.second.target.name));
+        if (filtered === undefined)
+            continue;
+        const classification = matchChain(target.expr, [target.first.id, target.second.id]);
+        if (classification.kind === 'confirmation' || classification.kind === 'restatement') {
+            candidates.push(toCandidate(classification, filtered));
+            continue;
+        }
+        const mismatch = joinRegimeMismatch(target.first, target.second);
+        if (mismatch !== undefined) {
+            rejections.push(mismatch);
+            continue;
+        }
+        candidates.push(toCandidate(classification, filtered));
+    }
+    const orderedRejections = [...rejections].sort((a, b) => compareChainEdgeIds(a.edgeIds, b.edgeIds));
+    return [...orderChainCandidates(candidates).map(emit), ...orderedRejections];
+}
+//# sourceMappingURL=chain-pipeline.js.map

package/dist/atlas/chain-pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-pipeline.js","sourceRoot":"","sources":["../../src/atlas/chain-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AAEjE,OAAO,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACpE,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AAEvE,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EACL,mBAAmB,EACnB,oBAAoB,GAErB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,kBAAkB,GAEnB,MAAM,gCAAgC,CAAC;AAExC,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAgCpD,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,uBAAuB,CAAC,IAAY;IAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,cAAc,CAAC,IAAc,EAAE,GAA2B;IACjE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO;QACT,KAAK,IAAI;YACP,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI;gBAAE,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACtD,OAAO;QACT,KAAK,UAAU;YACb,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YACpC,OAAO;QACT,KAAK,YAAY;YACf,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC7B,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,OAAO;QACT,KAAK,gBAAgB,CAAC;QACtB,KAAK,KAAK,CAAC;QACX,KAAK,aAAa;YAChB,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,OAAO;QACT;YACE,OAAO;IACX,CAAC;AACH,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAAC,IAAc,EAAE,UAAkB;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC1C,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAuC,EAAE,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,UAAU;YAAE,SAAS;QAClC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,uBAAuB,CAAC,IAAI,CAAC;YAAE,SAAS;QACnE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,cAAmC,EACnC,MAA8B;IAE9B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,SAAS,CAAC;IAC5C,MAAM,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;IACzD,IAAI,cAAc,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAC3C,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,cAAc,CAAC,OAAO;YAC/B,SAAS,EAAE,cAAc,CAAC,SAAS;YACnC,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,IAAI,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAC1C,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,OAAO,EAAE,cAAc,CAAC,OAAO;YAC/B,WAAW,EAAE,cAAc,CAAC,WAAW;YACvC,cAAc,EAAE,cAAc,CAAC,cAAc;YAC7C,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,KAAK,kCAAkC;QAChE,CAAC,CAAC,iBAAiB;QACnB,CAAC,CAAC,eAAe,CAAC;IACpB,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,cAAc,CAAC,OAAO;QAC/B,EAAE,EAAE,cAAc,CAAC,EAAE;QACrB,GAAG,OAAO;KACX,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,OAA0B;IAC7C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACxB,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,0DAA0D,EAAE,GAAG,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,IAAI,CAAC,SAAyB;IACrC,IAAI,SAAS,CAAC,IAAI,KAAK,cAAc,IAAI,SAAS,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QAC3E,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,SAAS,EAAE,SAAS,CAAC,SAAS;YAC9B,OAAO,EAAE,SAAS,CAAC,OAAO;SAC3B,CAAC;IACJ,CAAC;IACD,IACE,SAAS,CAAC,IAAI,KAAK,aAAa;QAChC,SAAS,CAAC,WAAW,KAAK,SAAS;QACnC,SAAS,CAAC,cAAc,KAAK,SAAS,EACtC,CAAC;QACD,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,WAAW,EAAE,SAAS,CAAC,WAAW;YAClC,cAAc,EAAE,SAAS,CAAC,cAAc;YACxC,OAAO,EAAE,SAAS,CAAC,OAAO;SAC3B,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,IAAI,SAAS,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAClE,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,EAAE;QACF,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,IAAI,EAAE,eAAe,CAAC,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;KAC5E,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IACzD,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,MAAM,UAAU,GAA0B,EAAE,CAAC;IAC7C,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,gBAAgB,CAC/B,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAClE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CACpD,CAAC;QACF,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QACrC,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,IAAI,cAAc,CAAC,IAAI,KAAK,cAAc,IAAI,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACpF,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACtD,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAC1C,CAAC;IACF,OAAO,CAAC,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,iBAAiB,CAAC,CAAC;AAC/E,CAAC"}

package/dist/atlas/composition-table.d.ts

@@ -1,55 +1,20 @@
 /**
- * The composition table for `RelationType` — a literal 8×8 matrix.
- *
- * `composeRelation(first, second)` answers: if one bridge asserts `first` and a
- * second bridge asserts `second`, what relation does the chain assert? The
- * argument order is the `First ∘ Second` column order of design note
- * `docs/planning/Atlas-Phase-1-Design.md` §2.1.
- *
- * **The table is a deliberate UNDER-approximation of Blueprint v2 §4.2.** Every
- * cell not named in §2.1 is `'no-composite-claim'`, because a wrong composite
- * type is a false physical claim while silence is only silence. Eight of the
- * sixty-four cells are defined; the remaining fifty-six are silent, and the
- * reasons for the notable silences are §2.2.
- *
- * Two cells the implementation plan asserts are NOT defined here, on the
- * authority of the design note (§0 and §2.2 item 5):
- *
- * - `exact-equivalence ∘ approximation`, either order. An exact equivalence
- *   contributes `IDENTITY_BOUND` only *in the norm a given bridge states* (see
- *   `./error-algebra.ts`), and no field in Sprint 1 records a norm, so
- *   norm-compatibility cannot be checked. A `norm?` field unblocks it in
- *   Phase 2.
- * - `structural-analogy ∘ structural-analogy`. Analogy is not transitive: the
- *   shared structure can dilute to nothing across a chain.
- *
- * Widening this table is a reviewed act — `tests/atlas/composition-table.test.ts`
- * pins the count of silent cells.
- *
- * Pure: no I/O, no registry reads, and no import from `src/composition/`.
+ * Re-export of the composition table. The table lives in
+ * `src/relations/composition-table.ts`. These consts are the same bindings.
  *
  * @module atlas/composition-table
  */
-import type { RelationType } from './types.js';
-/** What `composeRelation` returns when the chain asserts nothing. @public */
-export type NoCompositeClaim = 'no-composite-claim';
-/** The result of composing two relations. @public */
-export type CompositionResult = RelationType | NoCompositeClaim;
+import { composeRelation as composeRelationValue } from '../relations/composition-table.js';
 /** @public */
-export declare const NO_COMPOSITE_CLAIM: NoCompositeClaim;
-/**
- * Every row of every column, written out. `Record<RelationType, …>` makes the
- * exhaustiveness structural: a ninth `RelationType` member fails to compile
- * here rather than silently acquiring a row of `'no-composite-claim'`.
- *
- * @public
- */
-export declare const COMPOSITION_TABLE: Readonly<Record<RelationType, Readonly<Record<RelationType, CompositionResult>>>>;
+export declare const NO_COMPOSITE_CLAIM: "no-composite-claim";
 /**
- * The relation a chain of two bridges asserts, or `'no-composite-claim'` when
- * this sprint declines to assert one. A table lookup — no rules, no inference.
- *
  * @public
  */
-export declare function composeRelation(first: RelationType, second: RelationType): CompositionResult;
+export declare const COMPOSITION_TABLE: Readonly<Record<import("../relations/types.js").RelationType, Readonly<Record<import("../relations/types.js").RelationType, import("../relations/composition-table.js").CompositionResult>>>>;
+/** @public */
+export declare const composeRelation: typeof composeRelationValue;
+/** @public */
+export type NoCompositeClaim = import('../relations/composition-table.js').NoCompositeClaim;
+/** @public */
+export type CompositionResult = import('../relations/composition-table.js').CompositionResult;
 //# sourceMappingURL=composition-table.d.ts.map

package/dist/atlas/composition-table.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"composition-table.d.ts","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,6EAA6E;AAC7E,MAAM,MAAM,gBAAgB,GAAG,oBAAoB,CAAC;AAEpD,qDAAqD;AACrD,MAAM,MAAM,iBAAiB,GAAG,YAAY,GAAG,gBAAgB,CAAC;AAEhE,cAAc;AACd,eAAO,MAAM,kBAAkB,EAAE,gBAAuC,CAAC;AAEzE;;;;;;GAMG;AACH,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CACtC,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAkFxE,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,YAAY,GACnB,iBAAiB,CAEnB"}
+{"version":3,"file":"composition-table.d.ts","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAEL,eAAe,IAAI,oBAAoB,EAExC,MAAM,mCAAmC,CAAC;AAE3C,cAAc;AACd,eAAO,MAAM,kBAAkB,sBAAwB,CAAC;AAExD;;GAEG;AACH,eAAO,MAAM,iBAAiB,+LAAwB,CAAC;AAEvD,cAAc;AACd,eAAO,MAAM,eAAe,6BAAuB,CAAC;AAEpD,cAAc;AACd,MAAM,MAAM,gBAAgB,GAAG,OAAO,mCAAmC,EAAE,gBAAgB,CAAC;AAE5F,cAAc;AACd,MAAM,MAAM,iBAAiB,GAAG,OAAO,mCAAmC,EAAE,iBAAiB,CAAC"}

package/dist/atlas/composition-table.js

@@ -1,133 +1,16 @@
 /**
- * The composition table for `RelationType` — a literal 8×8 matrix.
- *
- * `composeRelation(first, second)` answers: if one bridge asserts `first` and a
- * second bridge asserts `second`, what relation does the chain assert? The
- * argument order is the `First ∘ Second` column order of design note
- * `docs/planning/Atlas-Phase-1-Design.md` §2.1.
- *
- * **The table is a deliberate UNDER-approximation of Blueprint v2 §4.2.** Every
- * cell not named in §2.1 is `'no-composite-claim'`, because a wrong composite
- * type is a false physical claim while silence is only silence. Eight of the
- * sixty-four cells are defined; the remaining fifty-six are silent, and the
- * reasons for the notable silences are §2.2.
- *
- * Two cells the implementation plan asserts are NOT defined here, on the
- * authority of the design note (§0 and §2.2 item 5):
- *
- * - `exact-equivalence ∘ approximation`, either order. An exact equivalence
- *   contributes `IDENTITY_BOUND` only *in the norm a given bridge states* (see
- *   `./error-algebra.ts`), and no field in Sprint 1 records a norm, so
- *   norm-compatibility cannot be checked. A `norm?` field unblocks it in
- *   Phase 2.
- * - `structural-analogy ∘ structural-analogy`. Analogy is not transitive: the
- *   shared structure can dilute to nothing across a chain.
- *
- * Widening this table is a reviewed act — `tests/atlas/composition-table.test.ts`
- * pins the count of silent cells.
- *
- * Pure: no I/O, no registry reads, and no import from `src/composition/`.
+ * Re-export of the composition table. The table lives in
+ * `src/relations/composition-table.ts`. These consts are the same bindings.
  *
  * @module atlas/composition-table
  */
+import { COMPOSITION_TABLE as compositionTableValue, composeRelation as composeRelationValue, NO_COMPOSITE_CLAIM as noCompositeClaimValue, } from '../relations/composition-table.js';
 /** @public */
-export const NO_COMPOSITE_CLAIM = 'no-composite-claim';
+export const NO_COMPOSITE_CLAIM = noCompositeClaimValue;
 /**
- * Every row of every column, written out. `Record<RelationType, …>` makes the
- * exhaustiveness structural: a ninth `RelationType` member fails to compile
- * here rather than silently acquiring a row of `'no-composite-claim'`.
- *
- * @public
- */
-export const COMPOSITION_TABLE = {
-    derivation: {
-        derivation: 'derivation',
-        'exact-equivalence': 'derivation',
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    'exact-equivalence': {
-        derivation: 'derivation',
-        'exact-equivalence': 'exact-equivalence',
-        restriction: 'restriction',
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    restriction: {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': 'restriction',
-        restriction: 'restriction',
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    approximation: {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': NO_COMPOSITE_CLAIM,
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    'coarse-graining': {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': NO_COMPOSITE_CLAIM,
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': 'coarse-graining',
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    'analytic-continuation': {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': NO_COMPOSITE_CLAIM,
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    'structural-analogy': {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': NO_COMPOSITE_CLAIM,
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-    'deformation-quantization': {
-        derivation: NO_COMPOSITE_CLAIM,
-        'exact-equivalence': NO_COMPOSITE_CLAIM,
-        restriction: NO_COMPOSITE_CLAIM,
-        approximation: NO_COMPOSITE_CLAIM,
-        'coarse-graining': NO_COMPOSITE_CLAIM,
-        'analytic-continuation': NO_COMPOSITE_CLAIM,
-        'structural-analogy': NO_COMPOSITE_CLAIM,
-        'deformation-quantization': NO_COMPOSITE_CLAIM,
-    },
-};
-/**
- * The relation a chain of two bridges asserts, or `'no-composite-claim'` when
- * this sprint declines to assert one. A table lookup — no rules, no inference.
- *
  * @public
  */
-export function composeRelation(first, second) {
-    return COMPOSITION_TABLE[first][second];
-}
+export const COMPOSITION_TABLE = compositionTableValue;
+/** @public */
+export const composeRelation = composeRelationValue;
 //# sourceMappingURL=composition-table.js.map

package/dist/atlas/composition-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"composition-table.js","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAUH,cAAc;AACd,MAAM,CAAC,MAAM,kBAAkB,GAAqB,oBAAoB,CAAC;AAEzE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAE1B;IACF,UAAU,EAAE;QACV,UAAU,EAAE,YAAY;QACxB,mBAAmB,EAAE,YAAY;QACjC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,mBAAmB,EAAE;QACnB,UAAU,EAAE,YAAY;QACxB,mBAAmB,EAAE,mBAAmB;QACxC,WAAW,EAAE,aAAa;QAC1B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,WAAW,EAAE;QACX,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,aAAa;QAClC,WAAW,EAAE,aAAa;QAC1B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,aAAa,EAAE;QACb,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,kBAAkB;QACvC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,iBAAiB,EAAE;QACjB,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,kBAAkB;QACvC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,iBAAiB;QACpC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,uBAAuB,EAAE;QACvB,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,kBAAkB;QACvC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,oBAAoB,EAAE;QACpB,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,kBAAkB;QACvC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;IACD,0BAA0B,EAAE;QAC1B,UAAU,EAAE,kBAAkB;QAC9B,mBAAmB,EAAE,kBAAkB;QACvC,WAAW,EAAE,kBAAkB;QAC/B,aAAa,EAAE,kBAAkB;QACjC,iBAAiB,EAAE,kBAAkB;QACrC,uBAAuB,EAAE,kBAAkB;QAC3C,oBAAoB,EAAE,kBAAkB;QACxC,0BAA0B,EAAE,kBAAkB;KAC/C;CACF,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAmB,EACnB,MAAoB;IAEpB,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;AAC1C,CAAC"}
+{"version":3,"file":"composition-table.js","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,iBAAiB,IAAI,qBAAqB,EAC1C,eAAe,IAAI,oBAAoB,EACvC,kBAAkB,IAAI,qBAAqB,GAC5C,MAAM,mCAAmC,CAAC;AAE3C,cAAc;AACd,MAAM,CAAC,MAAM,kBAAkB,GAAG,qBAAqB,CAAC;AAExD;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAEvD,cAAc;AACd,MAAM,CAAC,MAAM,eAAe,GAAG,oBAAoB,CAAC"}

package/dist/atlas/conventions.d.ts

@@ -1,63 +1,9 @@
 /**
- * Atlas Phase 1 — convention comparison.
- *
- * `Conventions` (`src/atlas/types.ts`) records the sign and unit choices a
- * record depends on. Two records that disagree on one of those choices are not
- * directly comparable, and this module says WHICH keys disagree.
- *
- * **`undefined` is "unknown", never "mismatch", and that asymmetry is the
- * whole design.** A record that declares nothing about the metric signature
- * has not chosen `'+---'`; it has not said. Reporting the absence as a
- * disagreement would manufacture conflicts out of missing data — and because
- * almost every record in the repo declares nothing today, it would manufacture
- * them at scale. The same reasoning that makes design note §3 require a
- * NON-EMPTY `conventions` before `convention-checked` can be derived applies
- * in the mirror here: absence earns neither a tag nor an accusation.
- *
- * A mismatch is therefore reported only when BOTH sides declare the key and
- * the declared values differ.
+ * Re-export of the convention comparison. The implementation lives in
+ * `src/relations/conventions.ts`.
  *
  * @module atlas/conventions
  */
-import type { Conventions } from './types.js';
-/** The keys `checkConventions` compares. @internal */
-export type ConventionKey = keyof Conventions;
-/**
- * The convention keys on which `a` and `b` DECLARE different values.
- *
- * Returns an empty list when they agree, when either side is absent, and when
- * neither declares a key in common.
- *
- * ⚠ **An empty list is NOT a statement that the two are compatible** — it means
- * no DECLARED pair disagrees. Eve (E1, 2026-09-21) flagged that this conflates
- * the safe case with the dangerous one: record A declaring `metricSignature:
- * '-+++'` while B simply never declared it returns `[]`, exactly like genuine
- * agreement, and a caller printing nothing leads a reader to infer "checked, no
- * conflict". Silence is not agreement. Use {@link unknownConventionKeys} to
- * surface that case, and prefer reporting the two together.
- *
- * @param a - one record's conventions, or `undefined` when it declares none.
- * @param b - the other record's conventions, or `undefined`.
- * @returns the mismatched keys, in `Conventions` declaration order.
- *
- * @internal
- */
-export declare function checkConventions(a: Conventions | undefined, b: Conventions | undefined): readonly ConventionKey[];
-/**
- * The convention keys where exactly ONE side declares a value — the cases
- * {@link checkConventions} deliberately does not call mismatches.
- *
- * This exists because "no declared pair disagrees" and "these two are
- * compatible" are different claims, and only the first is checkable from the
- * data. A key listed here is a question, not a conflict: the records MIGHT use
- * opposite sign conventions and one simply never said. Reporting it separately
- * lets a reader distinguish *verified agreement* from *nobody wrote it down*,
- * which is the distinction an empty mismatch list destroys.
- *
- * Both sides absent is NOT unknown — it is simply a key nobody uses, so it is
- * omitted. Only an asymmetric declaration is reported.
- *
- * @internal
- */
-export declare function unknownConventionKeys(a: Conventions | undefined, b: Conventions | undefined): readonly ConventionKey[];
+export { checkConventions, unknownConventionKeys } from '../relations/conventions.js';
+export type { ConventionKey } from '../relations/conventions.js';
 //# sourceMappingURL=conventions.d.ts.map

package/dist/atlas/conventions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"conventions.d.ts","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,sDAAsD;AACtD,MAAM,MAAM,aAAa,GAAG,MAAM,WAAW,CAAC;AAgB9C;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,gBAAgB,CAC9B,CAAC,EAAE,WAAW,GAAG,SAAS,EAC1B,CAAC,EAAE,WAAW,GAAG,SAAS,GACzB,SAAS,aAAa,EAAE,CAS1B;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,WAAW,GAAG,SAAS,EAC1B,CAAC,EAAE,WAAW,GAAG,SAAS,GACzB,SAAS,aAAa,EAAE,CAS1B"}
+{"version":3,"file":"conventions.d.ts","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACtF,YAAY,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC"}

package/dist/atlas/conventions.js

@@ -1,93 +1,8 @@
 /**
- * Atlas Phase 1 — convention comparison.
- *
- * `Conventions` (`src/atlas/types.ts`) records the sign and unit choices a
- * record depends on. Two records that disagree on one of those choices are not
- * directly comparable, and this module says WHICH keys disagree.
- *
- * **`undefined` is "unknown", never "mismatch", and that asymmetry is the
- * whole design.** A record that declares nothing about the metric signature
- * has not chosen `'+---'`; it has not said. Reporting the absence as a
- * disagreement would manufacture conflicts out of missing data — and because
- * almost every record in the repo declares nothing today, it would manufacture
- * them at scale. The same reasoning that makes design note §3 require a
- * NON-EMPTY `conventions` before `convention-checked` can be derived applies
- * in the mirror here: absence earns neither a tag nor an accusation.
- *
- * A mismatch is therefore reported only when BOTH sides declare the key and
- * the declared values differ.
+ * Re-export of the convention comparison. The implementation lives in
+ * `src/relations/conventions.ts`.
  *
  * @module atlas/conventions
  */
-/**
- * Every key of `Conventions`, as values. Written out rather than derived,
- * because a type has no runtime extent; `tests/atlas/conventions.test.ts`
- * pins this list against the interface so a new field cannot be added to
- * `Conventions` and silently skipped by the comparison.
- */
-const CONVENTION_KEYS = [
-    'heatWorkSign',
-    'metricSignature',
-    'fourierNormalization',
-    'unitSystem',
-    'capacitorChargeSign',
-];
-/**
- * The convention keys on which `a` and `b` DECLARE different values.
- *
- * Returns an empty list when they agree, when either side is absent, and when
- * neither declares a key in common.
- *
- * ⚠ **An empty list is NOT a statement that the two are compatible** — it means
- * no DECLARED pair disagrees. Eve (E1, 2026-09-21) flagged that this conflates
- * the safe case with the dangerous one: record A declaring `metricSignature:
- * '-+++'` while B simply never declared it returns `[]`, exactly like genuine
- * agreement, and a caller printing nothing leads a reader to infer "checked, no
- * conflict". Silence is not agreement. Use {@link unknownConventionKeys} to
- * surface that case, and prefer reporting the two together.
- *
- * @param a - one record's conventions, or `undefined` when it declares none.
- * @param b - the other record's conventions, or `undefined`.
- * @returns the mismatched keys, in `Conventions` declaration order.
- *
- * @internal
- */
-export function checkConventions(a, b) {
-    if (a === undefined || b === undefined)
-        return [];
-    return CONVENTION_KEYS.filter((k) => {
-        const av = a[k];
-        const bv = b[k];
-        // Either side silent ⇒ unknown, not disagreement.
-        if (av === undefined || bv === undefined)
-            return false;
-        return av !== bv;
-    });
-}
-/**
- * The convention keys where exactly ONE side declares a value — the cases
- * {@link checkConventions} deliberately does not call mismatches.
- *
- * This exists because "no declared pair disagrees" and "these two are
- * compatible" are different claims, and only the first is checkable from the
- * data. A key listed here is a question, not a conflict: the records MIGHT use
- * opposite sign conventions and one simply never said. Reporting it separately
- * lets a reader distinguish *verified agreement* from *nobody wrote it down*,
- * which is the distinction an empty mismatch list destroys.
- *
- * Both sides absent is NOT unknown — it is simply a key nobody uses, so it is
- * omitted. Only an asymmetric declaration is reported.
- *
- * @internal
- */
-export function unknownConventionKeys(a, b) {
-    const av = a ?? {};
-    const bv = b ?? {};
-    return CONVENTION_KEYS.filter((k) => {
-        const x = av[k];
-        const y = bv[k];
-        // Exactly one declared: the asymmetric case. Neither declared ⇒ not a question.
-        return (x === undefined) !== (y === undefined);
-    });
-}
+export { checkConventions, unknownConventionKeys } from '../relations/conventions.js';
 //# sourceMappingURL=conventions.js.map

package/dist/atlas/conventions.js.map

@@ -1 +1 @@
-{"version":3,"file":"conventions.js","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH;;;;;GAKG;AACH,MAAM,eAAe,GAA6B;IAChD,cAAc;IACd,iBAAiB;IACjB,sBAAsB;IACtB,YAAY;IACZ,qBAAqB;CACtB,CAAC;AAEF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAA0B,EAC1B,CAA0B;IAE1B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAClD,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,kDAAkD;QAClD,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACvD,OAAO,EAAE,KAAK,EAAE,CAAC;IACnB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,qBAAqB,CACnC,CAA0B,EAC1B,CAA0B;IAE1B,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IACnB,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,gFAAgF;QAChF,OAAO,CAAC,CAAC,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"conventions.js","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC"}