universal-physics-tensor 9.0.0 → 10.0.0

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

@@ -1 +1 @@
-{"version":3,"file":"composition-table.js","sourceRoot":"","sources":["../../src/relations/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAUH,yGAAyG;AACzG,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,+FAA+F;QAC/F,mBAAmB,EAAE,eAAe;QACpC,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/relations/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAUH,yGAAyG;AACzG,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,+FAA+F;QAC/F,mBAAmB,EAAE,eAAe;QACpC,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","sourcesContent":["/**\n * The composition table for `RelationType` — a literal 8×8 matrix.\n *\n * `composeRelation(first, second)` answers: if one bridge asserts `first` and a\n * second bridge asserts `second`, what relation does the chain assert? The\n * argument order is the `First ∘ Second` column order of design note\n * `docs/planning/Atlas-Phase-1-Design.md` §2.1.\n *\n * **The table is a deliberate UNDER-approximation of Blueprint v2 §4.2.** Every\n * cell not named in §2.1 is `'no-composite-claim'`, because a wrong composite\n * type is a false physical claim while silence is only silence. Nine of the\n * sixty-four cells are defined; the remaining fifty-five are silent, and the\n * reasons for the notable silences are §2.2.\n *\n * The ninth cell, `approximation ∘ exact-equivalence = approximation`, is the\n * reviewed widening of `docs/planning/ADR-transported-norm-composition.md`. The\n * table stays a pure function of relation types: the cell says what a route\n * WOULD assert, and `boundPath` (`src/atlas/path-bound.ts`) decides whether a\n * given route carries a bound, which it does only when the exact bridge declares\n * a norm transport from the norm the approximation states.\n *\n * Two cells the implementation plan asserts are NOT defined here, on the\n * authority of the design note (§0 and §2.2 item 5):\n *\n * - `exact-equivalence ∘ approximation`. An exact equivalence contributes\n *   `IDENTITY_BOUND` only *in the norm a given bridge states* (see\n *   `src/atlas/error-algebra.ts`); with the exact edge first, that norm would have to be\n *   pulled back through the map, which the ADR leaves undefined (its §3).\n * - `structural-analogy ∘ structural-analogy`. Analogy is not transitive: the\n *   shared structure can dilute to nothing across a chain.\n *\n * Widening this table is a reviewed act — `tests/atlas/composition-table.test.ts`\n * pins the count of silent cells.\n *\n * Pure: no I/O, no registry reads, and no import from `src/composition/`.\n *\n * @module relations/composition-table\n */\n\nimport type { RelationType } from './types.js';\n\n/** What `composeRelation` returns when the chain asserts nothing. @public */\nexport type NoCompositeClaim = 'no-composite-claim';\n\n/** The result of composing two relations. @public */\nexport type CompositionResult = RelationType | NoCompositeClaim;\n\n/** The `'no-composite-claim'` value `composeRelation` returns when the chain asserts nothing. @public */\nexport const NO_COMPOSITE_CLAIM: NoCompositeClaim = 'no-composite-claim';\n\n/**\n * Every row of every column, written out. `Record<RelationType, …>` makes the\n * exhaustiveness structural: a ninth `RelationType` member fails to compile\n * here rather than silently acquiring a row of `'no-composite-claim'`.\n *\n * @public\n */\nexport const COMPOSITION_TABLE: Readonly<\n  Record<RelationType, Readonly<Record<RelationType, CompositionResult>>>\n> = {\n  derivation: {\n    derivation: 'derivation',\n    'exact-equivalence': 'derivation',\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  'exact-equivalence': {\n    derivation: 'derivation',\n    'exact-equivalence': 'exact-equivalence',\n    restriction: 'restriction',\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  restriction: {\n    derivation: NO_COMPOSITE_CLAIM,\n    'exact-equivalence': 'restriction',\n    restriction: 'restriction',\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  approximation: {\n    derivation: NO_COMPOSITE_CLAIM,\n    // Licensed per route by a declared norm transport on the exact bridge; see the module comment.\n    'exact-equivalence': 'approximation',\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  'coarse-graining': {\n    derivation: NO_COMPOSITE_CLAIM,\n    'exact-equivalence': NO_COMPOSITE_CLAIM,\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': 'coarse-graining',\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  'analytic-continuation': {\n    derivation: NO_COMPOSITE_CLAIM,\n    'exact-equivalence': NO_COMPOSITE_CLAIM,\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  'structural-analogy': {\n    derivation: NO_COMPOSITE_CLAIM,\n    'exact-equivalence': NO_COMPOSITE_CLAIM,\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n  'deformation-quantization': {\n    derivation: NO_COMPOSITE_CLAIM,\n    'exact-equivalence': NO_COMPOSITE_CLAIM,\n    restriction: NO_COMPOSITE_CLAIM,\n    approximation: NO_COMPOSITE_CLAIM,\n    'coarse-graining': NO_COMPOSITE_CLAIM,\n    'analytic-continuation': NO_COMPOSITE_CLAIM,\n    'structural-analogy': NO_COMPOSITE_CLAIM,\n    'deformation-quantization': NO_COMPOSITE_CLAIM,\n  },\n};\n\n/**\n * The relation a chain of two bridges asserts, or `'no-composite-claim'` when\n * this sprint declines to assert one. A table lookup — no rules, no inference.\n *\n * @public\n */\nexport function composeRelation(\n  first: RelationType,\n  second: RelationType,\n): CompositionResult {\n  return COMPOSITION_TABLE[first][second];\n}\n"]}

package/dist/relations/conventions.js.map

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

package/dist/relations/domain-regimes.js.map

@@ -1 +1 @@
-{"version":3,"file":"domain-regimes.js","sourceRoot":"","sources":["../../src/relations/domain-regimes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAGhE,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC;AAClE,CAAC;AAED,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,CAAU,EAAE,CAAC;IACrE,oBAAoB,CAAC;QACnB,IAAI;QACJ,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;KAC/D,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"domain-regimes.js","sourceRoot":"","sources":["../../src/relations/domain-regimes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAGhE,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC;AAClE,CAAC;AAED,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,CAAU,EAAE,CAAC;IACrE,oBAAoB,CAAC;QACnB,IAAI;QACJ,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;KAC/D,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Domains whose inequality list is empty.\n *\n * Plasma, piezoelectricity, and Tolman are names a caller can survey. No\n * bound is written down here: a plasma-β, a piezoelectric inequality, and a\n * Tolman gradient are not catalog statements. The command reports the empty\n * list as vacuous. Input guards on an evaluator are not this registration.\n *\n * @module relations/domain-regimes\n */\n\nimport { registerRegimeDomain } from './regime-registration.js';\nimport type { Regime } from './types.js';\n\nfunction vacuous(name: string): Regime {\n  return { family: name, inequalities: [], groupDefinitions: {} };\n}\n\nfor (const name of ['plasma', 'piezoelectricity', 'tolman'] as const) {\n  registerRegimeDomain({\n    name,\n    records: [{ id: name, kind: 'domain', regime: vacuous(name) }],\n  });\n}\n"]}

package/dist/relations/regime-registration.js.map

@@ -1 +1 @@
-{"version":3,"file":"regime-registration.js","sourceRoot":"","sources":["../../src/relations/regime-registration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAkBH,MAAM,aAAa,GAA+B,EAAE,CAAC;AAErD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,YAAsC;IACzE,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,MAAM,IAAI,KAAK,CAAC,WAAW,YAAY,CAAC,IAAI,yBAAyB,CAAC,CAAC;IACzE,CAAC;IACD,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,yBAAyB;IACvC,OAAO,aAAa,CAAC;AACvB,CAAC"}
+{"version":3,"file":"regime-registration.js","sourceRoot":"","sources":["../../src/relations/regime-registration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAkBH,MAAM,aAAa,GAA+B,EAAE,CAAC;AAErD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,YAAsC;IACzE,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,MAAM,IAAI,KAAK,CAAC,WAAW,YAAY,CAAC,IAAI,yBAAyB,CAAC,CAAC;IACzE,CAAC;IACD,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,yBAAyB;IACvC,OAAO,aAAa,CAAC;AACvB,CAAC","sourcesContent":["/**\n * Names `upt regime` can survey that are not atlas families.\n *\n * An atlas family is models, bridges, and rejections. A domain module adds a\n * name and the records that carry inequalities, and does not construct those.\n * This is not `src/core/regime-registry.ts`, which stores tensor-cell regimes.\n *\n * @module relations/regime-registration\n */\n\nimport type { Regime } from './types.js';\n\n/** One record a domain registration surveys. @internal */\nexport interface RegimeDomainRecord {\n  readonly id: string;\n  readonly kind: 'domain';\n  readonly regime: Regime;\n  readonly sideConditions?: readonly string[];\n}\n\n/** A name plus the records whose inequalities the command evaluates. @internal */\nexport interface RegimeDomainRegistration {\n  readonly name: string;\n  readonly records: readonly RegimeDomainRecord[];\n}\n\nconst registrations: RegimeDomainRegistration[] = [];\n\n/**\n * Add a domain. A second registration of the same name is a programming error:\n * the command would otherwise survey one and hide the other.\n *\n * @internal\n */\nexport function registerRegimeDomain(registration: RegimeDomainRegistration): void {\n  if (registrations.some((existing) => existing.name === registration.name)) {\n    throw new Error(`regime '${registration.name}' is already registered`);\n  }\n  registrations.push(registration);\n}\n\n/** Domain registrations, in the order they were added. @internal */\nexport function domainRegimeRegistrations(): readonly RegimeDomainRegistration[] {\n  return registrations;\n}\n"]}

package/dist/relations/regime-vocabularies.js.map

@@ -1 +1 @@
-{"version":3,"file":"regime-vocabularies.js","sourceRoot":"","sources":["../../src/relations/regime-vocabularies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}
+{"version":3,"file":"regime-vocabularies.js","sourceRoot":"","sources":["../../src/relations/regime-vocabularies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG","sourcesContent":["/**\n * Names for the three regime vocabularies. They are not one type, and\n * nothing here converts a value from one into another. The join gate does\n * not import this module.\n *\n * - Tensor-cell registry: `defineRegime` in `src/core/regime-registry.ts`.\n *   A named value on a scale, force, symmetry, information, topology, or\n *   dimension axis, with provenance.\n * - π-group regime: `regimeHolds` and `regimeOverlap` in `src/relations/regime.ts`.\n *   Inequalities on Buckingham groups. `regimeHolds` is tri-state.\n * - Quantity attributes: `regimesDiffer` in `src/composition/quantity.ts`,\n *   gated by `GATE_AXES` in `src/composition/axes.ts`. Scale and force on a\n *   quantity. That module is not imported: this layer importing composition\n *   is an upward edge.\n *\n * @module relations/regime-vocabularies\n */\n\nimport type { RegimeValueBase } from '../core/regime-registry.js';\nimport type { Regime } from './types.js';\n\n/**\n * The value `defineRegime` returns. `src/relations/` importing\n * `src/core/regime-registry.ts` is a downward edge.\n *\n * @internal\n */\nexport type TensorCellRegime = RegimeValueBase;\n\n/**\n * The inequalities `regimeHolds` checks.\n *\n * @internal\n */\nexport type PiGroupRegime = Regime;\n\n/**\n * The quantity-attribute vocabulary, named and not imported.\n * `regimesDiffer` stays in `src/composition/quantity.ts`.\n *\n * @internal\n */\nexport type QuantityAttributeRegime = never;\n"]}

package/dist/relations/regime.d.ts

@@ -57,15 +57,25 @@ export interface RegimeCheck {
     readonly violated: readonly RegimeInequality[];
     /** NOT checked: the π-group value was absent or non-finite. */
     readonly unchecked: readonly RegimeInequality[];
+    /**
+     * How many inequalities a finite value reached. `ok: true` with
+     * `checked: 0` is a VACUOUS pass: the regime states no inequality (the
+     * plasma, piezoelectricity and Tolman registrations), so nothing was
+     * checked and nothing held. That is a different fact from a pass over a
+     * non-empty list, and a coverage count must not add it (AGENTS law 4).
+     */
+    readonly checked: number;
 }
 /**
  * Check a regime against measured group values.
  *
  * A group with no supplied value, or a non-finite one, is UNCHECKED — not
  * violated and not satisfied. See {@link RegimeCheck} for why the distinction
- * is load-bearing. A regime with no inequalities returns `true`: there was
- * nothing to check and nothing went unchecked, so the claim "every inequality
- * was checked and satisfied" is vacuously true rather than unknown.
+ * is load-bearing. A regime with no inequalities returns `true` with
+ * `checked: 0`: there was nothing to check and nothing went unchecked, so the
+ * claim "every inequality was checked and satisfied" is vacuously true rather
+ * than unknown, and `checked` says that nothing was checked. A caller that
+ * counts coverage reads `checked`, never `ok` alone.
  *
  * A violation outranks an absence: once one inequality is CHECKED and fails,
  * the regime does not hold, whatever the unmeasured coordinates would say.
@@ -130,8 +140,6 @@ export declare function regimeOverlap(a: Regime, b: Regime): RegimeOverlap;
 export interface RegionSample {
     /** The π-group value at this cell, keyed by `PiGroup.formula`. */
     readonly point: Readonly<Record<string, number>>;
-    /** Ids of the records whose regime returned `true` here. */
-    readonly coveredBy: readonly string[];
 }
 /** A record carrying a regime — `AtlasModel` and `AtlasBridge` both fit. @internal */
 export interface RegimeBearing {
@@ -147,9 +155,11 @@ export interface RegimeBearing {
  * library invented, so "uncovered" would measure the guess rather than the
  * atlas. The caller states where it wants to know about.
  *
- * COVERED means some regime returned `true`. An `'unknown'` is NOT coverage,
- * by the same rule that makes {@link regimeHolds} tri-state: a regime whose
- * groups the sample axes never mention has not been shown to apply anywhere.
+ * COVERED means some regime returned `true` with at least one inequality
+ * checked. An `'unknown'` is NOT coverage, by the same rule that makes
+ * {@link regimeHolds} tri-state: a regime whose groups the sample axes never
+ * mention has not been shown to apply anywhere. Neither is a vacuous pass: a
+ * regime that states no inequality has checked nothing at the point.
  *
  * Records of another family are skipped, so a mixed list is safe to pass.
  *

package/dist/relations/regime.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"regime.d.ts","sourceRoot":"","sources":["../../src/relations/regime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAEjF,OAAO,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE3D;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,SAAS,mBAAmB,EAAE,EAC1C,mBAAmB,EAAE,SAAS,MAAM,EAAE,GACrC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAmBzB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,EAAE,OAAO,GAAG,SAAS,CAAC;IACjC,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,+DAA+D;IAC/D,QAAQ,CAAC,SAAS,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACjD;AAeD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAC5C,WAAW,CAab;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAsB7D;AAED;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,SAAS,MAAM,EAAE,GACzB,SAAS;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,EAAE,CAqB7E;AA8FD,4DAA4D;AAC5D,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAAC;AAE9D;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,aAAa,CAWjE;AAED,qFAAqF;AACrF,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjD,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED,sFAAsF;AACtF,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,SAAS,aAAa,EAAE,EAChC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,GACnD,SAAS,YAAY,EAAE,CAUzB"}
+{"version":3,"file":"regime.d.ts","sourceRoot":"","sources":["../../src/relations/regime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAEjF,OAAO,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE3D;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,SAAS,mBAAmB,EAAE,EAC1C,mBAAmB,EAAE,SAAS,MAAM,EAAE,GACrC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAmBzB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,EAAE,OAAO,GAAG,SAAS,CAAC;IACjC,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,+DAA+D;IAC/D,QAAQ,CAAC,SAAS,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAChD;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAeD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAC5C,WAAW,CAeb;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAsB7D;AAED;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,SAAS,MAAM,EAAE,GACzB,SAAS;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,EAAE,CAqB7E;AA8FD,4DAA4D;AAC5D,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAAC;AAE9D;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,aAAa,CAWjE;AAED,qFAAqF;AACrF,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAClD;AAED,sFAAsF;AACtF,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,SAAS,aAAa,EAAE,EAChC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,GACnD,SAAS,YAAY,EAAE,CAgBzB"}

package/dist/relations/regime.js

@@ -57,9 +57,11 @@ function satisfies(value, ineq) {
  *
  * A group with no supplied value, or a non-finite one, is UNCHECKED — not
  * violated and not satisfied. See {@link RegimeCheck} for why the distinction
- * is load-bearing. A regime with no inequalities returns `true`: there was
- * nothing to check and nothing went unchecked, so the claim "every inequality
- * was checked and satisfied" is vacuously true rather than unknown.
+ * is load-bearing. A regime with no inequalities returns `true` with
+ * `checked: 0`: there was nothing to check and nothing went unchecked, so the
+ * claim "every inequality was checked and satisfied" is vacuously true rather
+ * than unknown, and `checked` says that nothing was checked. A caller that
+ * counts coverage reads `checked`, never `ok` alone.
  *
  * A violation outranks an absence: once one inequality is CHECKED and fails,
  * the regime does not hold, whatever the unmeasured coordinates would say.
@@ -69,17 +71,19 @@ function satisfies(value, ineq) {
 export function regimeHolds(regime, groupValues) {
     const violated = [];
     const unchecked = [];
+    let checked = 0;
     for (const ineq of regime.inequalities) {
         const value = groupValues[ineq.group];
         if (typeof value !== 'number' || !Number.isFinite(value)) {
             unchecked.push(ineq);
+            continue;
         }
-        else if (!satisfies(value, ineq)) {
+        checked += 1;
+        if (!satisfies(value, ineq))
             violated.push(ineq);
-        }
     }
     const ok = violated.length > 0 ? false : unchecked.length > 0 ? 'unknown' : true;
-    return { ok, violated, unchecked };
+    return { ok, violated, unchecked, checked };
 }
 // ── Sprint 2: regime algebra and admission ──────────────────────────────────
 /**
@@ -268,9 +272,11 @@ export function regimeOverlap(a, b) {
  * library invented, so "uncovered" would measure the guess rather than the
  * atlas. The caller states where it wants to know about.
  *
- * COVERED means some regime returned `true`. An `'unknown'` is NOT coverage,
- * by the same rule that makes {@link regimeHolds} tri-state: a regime whose
- * groups the sample axes never mention has not been shown to apply anywhere.
+ * COVERED means some regime returned `true` with at least one inequality
+ * checked. An `'unknown'` is NOT coverage, by the same rule that makes
+ * {@link regimeHolds} tri-state: a regime whose groups the sample axes never
+ * mention has not been shown to apply anywhere. Neither is a vacuous pass: a
+ * regime that states no inequality has checked nothing at the point.
  *
  * Records of another family are skipped, so a mixed list is safe to pass.
  *
@@ -280,11 +286,17 @@ export function uncoveredRegions(family, models, samples) {
     const inFamily = models.filter((m) => m.regime.family === family);
     const uncovered = [];
     for (const point of gridPoints(samples)) {
-        const coveredBy = inFamily
-            .filter((m) => regimeHolds(m.regime, point).ok === true)
-            .map((m) => m.id);
-        if (coveredBy.length === 0)
-            uncovered.push({ point, coveredBy });
+        // `checked > 0`: a regime with no inequality passes vacuously and has shown
+        // nothing about this point, so it covers nothing (the rule in `regimeHolds`'s
+        // doc comment: coverage reads `checked`, never `ok` alone).
+        const covered = inFamily.some((m) => {
+            const check = regimeHolds(m.regime, point);
+            return check.ok === true && check.checked > 0;
+        });
+        // An uncovered cell is covered by nothing, by definition; the sample
+        // carries the point and no list that could only ever be empty.
+        if (!covered)
+            uncovered.push({ point });
     }
     return uncovered;
 }

package/dist/relations/regime.js.map

@@ -1 +1 @@
-{"version":3,"file":"regime.js","sourceRoot":"","sources":["../../src/relations/regime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAGxD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,UAA0C,EAC1C,mBAAsC;IAEtC,MAAM,SAAS,GAA0B;QACvC,GAAG,UAAU;QACb,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC;KACrE,CAAC;IACF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,sBAAsB,MAAM,kCAAkC,CAAC,CAAC;IAClF,CAAC;IACD,4EAA4E;IAC5E,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CACb,sBAAsB,MAAM,gDAAgD;YAC1E,8BAA8B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,QAAQ;QAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;IACpF,OAAO,MAAM,CAAC;AAChB,CAAC;AAuCD,SAAS,SAAS,CAAC,KAAa,EAAE,IAAsB;IACtD,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,GAAG;YACN,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QAC7B,KAAK,GAAG;YACN,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;IAC/B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CACzB,MAAc,EACd,WAA6C;IAE7C,MAAM,QAAQ,GAAuB,EAAE,CAAC;IACxC,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACzD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;aAAM,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;IACjF,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACrC,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CACb,uCAAuC,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,MAAM,MAAM;YACpE,oDAAoD,CACvD,CAAC;IACJ,CAAC;IACD,MAAM,gBAAgB,GAA4B,EAAE,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC;IAC5E,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAC/D,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,6CAA6C,CAC9E,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IACD,OAAO;QACL,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,YAAY,CAAC;QACpD,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAA0B;IAE1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAA+C,CAAC;IACpE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;YACpE,MAAM,GAAG,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnD,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9E,SAAS;YACX,CAAC;YACD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAc;IACvC,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;SACnC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;SAC9B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAChD,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;SACtC,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,CAAU,EAAE,CAAU;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAUD,SAAS,YAAY;IACnB,OAAO,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AACrE,CAAC;AAED,8CAA8C;AAC9C,SAAS,MAAM,CAAC,EAAiB,EAAE,IAAsB;IACvD,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,GAAG,CAAC;QACT,KAAK,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;gBACzD,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;gBACnB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,GAAG,CAAC;QACT,KAAK,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;gBACzD,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;gBACnB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAED,sEAAsE;AACtE,SAAS,WAAW,CAAC,MAAc;IACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,EAAE,GAAG,YAAY,EAAE,CAAC;YACpB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,EAAiB;IAChC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAgB,EAAE,CAAgB;IAC5D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAChC,OAAO;QACL,EAAE;QACF,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QAC9D,EAAE;QACF,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,oDAAoD;AACpD,SAAS,QAAQ,CAAC,KAAoB,EAAE,KAAoB;IAC1D,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,IAAI,GACR,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,IAAI,GACR,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,IAAI,IAAI,CAAC;AACtB,CAAC;AAKD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7D,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;IACnF,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;IAC5E,OAAO,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7C,CAAC;AAgBD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,MAAgC,EAChC,OAAoD;IAEpD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAClE,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,MAAM,SAAS,GAAG,QAAQ;aACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;aACvD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kFAAkF;AAClF,SAAS,UAAU,CACjB,OAAoD;IAEpD,IAAI,MAAM,GAA6B,CAAC,EAAE,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,GAA6B,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"regime.js","sourceRoot":"","sources":["../../src/relations/regime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAGxD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,UAA0C,EAC1C,mBAAsC;IAEtC,MAAM,SAAS,GAA0B;QACvC,GAAG,UAAU;QACb,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC;KACrE,CAAC;IACF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,sBAAsB,MAAM,kCAAkC,CAAC,CAAC;IAClF,CAAC;IACD,4EAA4E;IAC5E,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CACb,sBAAsB,MAAM,gDAAgD;YAC1E,8BAA8B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,QAAQ;QAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;IACpF,OAAO,MAAM,CAAC;AAChB,CAAC;AA+CD,SAAS,SAAS,CAAC,KAAa,EAAE,IAAsB;IACtD,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,GAAG;YACN,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QAC7B,KAAK,GAAG;YACN,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;IAC/B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,WAAW,CACzB,MAAc,EACd,WAA6C;IAE7C,MAAM,QAAQ,GAAuB,EAAE,CAAC;IACxC,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACzD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,OAAO,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IACD,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;IACjF,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAC9C,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CACb,uCAAuC,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,MAAM,MAAM;YACpE,oDAAoD,CACvD,CAAC;IACJ,CAAC;IACD,MAAM,gBAAgB,GAA4B,EAAE,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC;IAC5E,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAC/D,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,6CAA6C,CAC9E,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IACD,OAAO;QACL,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,YAAY,CAAC;QACpD,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAA0B;IAE1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAA+C,CAAC;IACpE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;YACpE,MAAM,GAAG,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnD,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9E,SAAS;YACX,CAAC;YACD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAc;IACvC,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;SACnC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;SAC9B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAChD,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;SACtC,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,CAAU,EAAE,CAAU;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAUD,SAAS,YAAY;IACnB,OAAO,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AACrE,CAAC;AAED,8CAA8C;AAC9C,SAAS,MAAM,CAAC,EAAiB,EAAE,IAAsB;IACvD,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,GAAG,CAAC;QACT,KAAK,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;gBACzD,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;gBACnB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,GAAG,CAAC;QACT,KAAK,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;gBACzD,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;gBACnB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAED,sEAAsE;AACtE,SAAS,WAAW,CAAC,MAAc;IACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,EAAE,GAAG,YAAY,EAAE,CAAC;YACpB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,EAAiB;IAChC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAgB,EAAE,CAAgB;IAC5D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAChC,OAAO;QACL,EAAE;QACF,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QAC9D,EAAE;QACF,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,oDAAoD;AACpD,SAAS,QAAQ,CAAC,KAAoB,EAAE,KAAoB;IAC1D,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,IAAI,GACR,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,IAAI,GACR,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,IAAI,IAAI,CAAC;AACtB,CAAC;AAKD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7D,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;IACnF,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;IAC5E,OAAO,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7C,CAAC;AAcD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,MAAgC,EAChC,OAAoD;IAEpD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAClE,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,4EAA4E;QAC5E,8EAA8E;QAC9E,4DAA4D;QAC5D,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YAClC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC3C,OAAO,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QACH,qEAAqE;QACrE,+DAA+D;QAC/D,IAAI,CAAC,OAAO;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kFAAkF;AAClF,SAAS,UAAU,CACjB,OAAoD;IAEpD,IAAI,MAAM,GAA6B,CAAC,EAAE,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,GAA6B,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["/**\n * Regime derivation — π-groups as the coordinates a regime is written in.\n *\n * Dimensionless inputs are passed INTO `buckinghamPi` as zero-dimension\n * variables and come back as their own trivial groups, keyed by their own\n * names in `PiGroup.formula`. Nothing is synthesized here. (Measured in\n * design note §10 Q1 by executing `buckinghamPi`; the implementation plan's\n * \"plus one trivial group per dimensionless input\" would double-add.)\n *\n * `admitApproximation` stays in `src/atlas/regime.ts`: it is generic over\n * `AtlasBridge`, and moving it would drag that record into this vocabulary.\n *\n * @module relations/regime\n */\n\nimport { buckinghamPi } from '../dimensional/buckingham.js';\nimport type { DimensionalVariable, PiGroup } from '../dimensional/buckingham.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport type { Regime, RegimeInequality } from './types.js';\n\n/**\n * Derive the regime coordinates of a family, keyed by `PiGroup.formula`.\n *\n * A dimensionally-independent set has no groups and yields an empty record.\n *\n * @internal\n */\nexport function deriveRegimeGroups(\n  family: string,\n  parameters: readonly DimensionalVariable[],\n  dimensionlessInputs: readonly string[],\n): Record<string, PiGroup> {\n  const variables: DimensionalVariable[] = [\n    ...parameters,\n    ...dimensionlessInputs.map((name) => ({ name, dim: DIMENSIONLESS })),\n  ];\n  if (variables.length === 0) {\n    throw new Error(`deriveRegimeGroups(${family}) requires at least one variable`);\n  }\n  // buckinghamPi rejects duplicate names itself; the message is clearer here.\n  const names = variables.map((v) => v.name);\n  if (new Set(names).size !== names.length) {\n    throw new Error(\n      `deriveRegimeGroups(${family}) requires unique names across parameters and ` +\n        `dimensionless inputs; got [${names.join(', ')}]`,\n    );\n  }\n  const groups: Record<string, PiGroup> = {};\n  for (const group of buckinghamPi(variables).piGroups) groups[group.formula] = group;\n  return groups;\n}\n\n/**\n * Result of {@link regimeHolds} — TRI-STATE, not a boolean.\n *\n * Design note §1, Adam A2 RED #2. The first draft of this rule returned a\n * boolean and folded \"could not check\" into one of the two answers. Both\n * foldings are wrong in a way that is invisible at the call site:\n *\n *   - Folding absence into `true` is a SILENT PASS. A caller who supplies\n *     `{ Ma: 0.1 }` and never computes `Re` gets a confident \"the regime\n *     holds\" while `Re = 50` grossly violates it. The omission of the very\n *     data that would reveal the violation is what produces the pass.\n *   - Folding absence into `false` reports a VIOLATION that was never\n *     observed, which is a different false claim and destroys the caller's\n *     ability to tell \"I measured this and it failed\" from \"I never measured\n *     this\". Only the first licenses saying the regime is violated.\n *\n * So `ok` carries three answers and the two failure sets are kept apart.\n *\n * @public\n */\nexport interface RegimeCheck {\n  /**\n   * `true` — every inequality was CHECKED and satisfied.\n   * `false` — at least one was checked and VIOLATED.\n   * `'unknown'` — nothing was violated, but at least one could NOT be checked.\n   *\n   * `'unknown'` is a failure to confirm validity, NEVER validity. A caller\n   * asking \"may I use this model here?\" must test `=== true`; `!== false` is\n   * the silent pass this type exists to prevent.\n   */\n  readonly ok: boolean | 'unknown';\n  /** CHECKED and violated — carried whole so the caller can name them. */\n  readonly violated: readonly RegimeInequality[];\n  /** NOT checked: the π-group value was absent or non-finite. */\n  readonly unchecked: readonly RegimeInequality[];\n  /**\n   * How many inequalities a finite value reached. `ok: true` with\n   * `checked: 0` is a VACUOUS pass: the regime states no inequality (the\n   * plasma, piezoelectricity and Tolman registrations), so nothing was\n   * checked and nothing held. That is a different fact from a pass over a\n   * non-empty list, and a coverage count must not add it (AGENTS law 4).\n   */\n  readonly checked: number;\n}\n\nfunction satisfies(value: number, ineq: RegimeInequality): boolean {\n  switch (ineq.op) {\n    case '<':\n      return value < ineq.bound;\n    case '<=':\n      return value <= ineq.bound;\n    case '>':\n      return value > ineq.bound;\n    case '>=':\n      return value >= ineq.bound;\n  }\n}\n\n/**\n * Check a regime against measured group values.\n *\n * A group with no supplied value, or a non-finite one, is UNCHECKED — not\n * violated and not satisfied. See {@link RegimeCheck} for why the distinction\n * is load-bearing. A regime with no inequalities returns `true` with\n * `checked: 0`: there was nothing to check and nothing went unchecked, so the\n * claim \"every inequality was checked and satisfied\" is vacuously true rather\n * than unknown, and `checked` says that nothing was checked. A caller that\n * counts coverage reads `checked`, never `ok` alone.\n *\n * A violation outranks an absence: once one inequality is CHECKED and fails,\n * the regime does not hold, whatever the unmeasured coordinates would say.\n *\n * @public\n */\nexport function regimeHolds(\n  regime: Regime,\n  groupValues: Readonly<Record<string, number>>,\n): RegimeCheck {\n  const violated: RegimeInequality[] = [];\n  const unchecked: RegimeInequality[] = [];\n  let checked = 0;\n  for (const ineq of regime.inequalities) {\n    const value = groupValues[ineq.group];\n    if (typeof value !== 'number' || !Number.isFinite(value)) {\n      unchecked.push(ineq);\n      continue;\n    }\n    checked += 1;\n    if (!satisfies(value, ineq)) violated.push(ineq);\n  }\n  const ok = violated.length > 0 ? false : unchecked.length > 0 ? 'unknown' : true;\n  return { ok, violated, unchecked, checked };\n}\n\n// ── Sprint 2: regime algebra and admission ──────────────────────────────────\n\n/**\n * Merge two regimes into the regime that holds where BOTH hold.\n *\n * The conjunction is the whole operation: an inequality from either side is an\n * inequality of the intersection, so the list is concatenated rather than\n * reduced. No attempt is made to simplify `x < 1` and `x < 2` into one\n * inequality — the redundant one is still true, and a simplifier that dropped\n * the wrong one would be a silent change of claim.\n *\n * `groupDefinitions` are merged and CHECKED, not overwritten. Two regimes that\n * key the same `PiGroup.formula` to different exponent vectors are not\n * traceable to one dimension matrix, and quietly keeping one would hand the\n * caller a regime whose group definitions no longer describe its inequalities.\n *\n * @throws Error if the families differ, or if a shared group name carries\n *   conflicting definitions.\n * @internal\n */\nexport function intersectRegimes(a: Regime, b: Regime): Regime {\n  if (a.family !== b.family) {\n    throw new Error(\n      `intersectRegimes: families differ ('${a.family}' vs '${b.family}'); ` +\n        'a regime is stated in the groups of its own family',\n    );\n  }\n  const groupDefinitions: Record<string, PiGroup> = { ...a.groupDefinitions };\n  for (const [name, group] of Object.entries(b.groupDefinitions)) {\n    const existing = groupDefinitions[name];\n    if (existing !== undefined && !samePiGroup(existing, group)) {\n      throw new Error(\n        `intersectRegimes: group '${name}' is defined differently in the two regimes`,\n      );\n    }\n    groupDefinitions[name] = group;\n  }\n  return {\n    family: a.family,\n    inequalities: [...a.inequalities, ...b.inequalities],\n    groupDefinitions,\n  };\n}\n\n/**\n * Group names whose π-groups differ across `regimes`. The path command leaves\n * those names unchecked on every step that defines them. It does not call\n * {@link intersectRegimes}: that function still throws when the families differ.\n *\n * The same key with the same exponent vector is not a collision. A zero\n * exponent is ignored, matching `--at` derivation.\n *\n * @internal\n */\nexport function collidingRegimeGroups(\n  regimes: readonly Regime[],\n): readonly { readonly group: string; readonly families: readonly string[] }[] {\n  const seen = new Map<string, { sig: string; families: string[] }>();\n  const collisions = new Map<string, string[]>();\n  for (const regime of regimes) {\n    for (const [name, group] of Object.entries(regime.groupDefinitions)) {\n      const sig = exponentSignature(group);\n      const prev = seen.get(name);\n      if (prev === undefined) {\n        seen.set(name, { sig, families: [regime.family] });\n        continue;\n      }\n      if (prev.sig === sig) {\n        if (!prev.families.includes(regime.family)) prev.families.push(regime.family);\n        continue;\n      }\n      const families = collisions.get(name) ?? [...prev.families];\n      if (!families.includes(regime.family)) families.push(regime.family);\n      collisions.set(name, families);\n    }\n  }\n  return [...collisions.entries()].map(([group, families]) => ({ group, families }));\n}\n\nfunction exponentSignature(group: PiGroup): string {\n  return Object.entries(group.exponents)\n    .filter(([, exp]) => exp !== 0)\n    .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n    .map(([name, exp]) => `${name}:${exp}`)\n    .join(',');\n}\n\nfunction samePiGroup(x: PiGroup, y: PiGroup): boolean {\n  const names = new Set([...Object.keys(x.exponents), ...Object.keys(y.exponents)]);\n  for (const name of names) {\n    if ((x.exponents[name] ?? 0) !== (y.exponents[name] ?? 0)) return false;\n  }\n  return true;\n}\n\n/** A closed-or-open interval on one π-group. Unbounded ends are ±Infinity. */\ninterface GroupInterval {\n  lo: number;\n  loOpen: boolean;\n  hi: number;\n  hiOpen: boolean;\n}\n\nfunction fullInterval(): GroupInterval {\n  return { lo: -Infinity, loOpen: true, hi: Infinity, hiOpen: true };\n}\n\n/** Narrow `iv` in place by one inequality. */\nfunction narrow(iv: GroupInterval, ineq: RegimeInequality): void {\n  switch (ineq.op) {\n    case '<':\n    case '<=': {\n      const open = ineq.op === '<';\n      if (ineq.bound < iv.hi || (ineq.bound === iv.hi && open)) {\n        iv.hi = ineq.bound;\n        iv.hiOpen = open;\n      }\n      return;\n    }\n    case '>':\n    case '>=': {\n      const open = ineq.op === '>';\n      if (ineq.bound > iv.lo || (ineq.bound === iv.lo && open)) {\n        iv.lo = ineq.bound;\n        iv.loOpen = open;\n      }\n      return;\n    }\n  }\n}\n\n/** The per-group intervals the inequalities of a regime carve out. */\nfunction intervalsOf(regime: Regime): Map<string, GroupInterval> {\n  const out = new Map<string, GroupInterval>();\n  for (const ineq of regime.inequalities) {\n    let iv = out.get(ineq.group);\n    if (iv === undefined) {\n      iv = fullInterval();\n      out.set(ineq.group, iv);\n    }\n    narrow(iv, ineq);\n  }\n  return out;\n}\n\nfunction isEmpty(iv: GroupInterval): boolean {\n  if (iv.lo > iv.hi) return true;\n  return iv.lo === iv.hi && (iv.loOpen || iv.hiOpen);\n}\n\nfunction intersectIntervals(x: GroupInterval, y: GroupInterval): GroupInterval {\n  const lo = Math.max(x.lo, y.lo);\n  const hi = Math.min(x.hi, y.hi);\n  return {\n    lo,\n    loOpen: (x.lo === lo && x.loOpen) || (y.lo === lo && y.loOpen),\n    hi,\n    hiOpen: (x.hi === hi && x.hiOpen) || (y.hi === hi && y.hiOpen),\n  };\n}\n\n/** Is every point of `inner` a point of `outer`? */\nfunction contains(outer: GroupInterval, inner: GroupInterval): boolean {\n  if (isEmpty(inner)) return true;\n  const loOk =\n    outer.lo < inner.lo || (outer.lo === inner.lo && (!outer.loOpen || inner.loOpen));\n  const hiOk =\n    outer.hi > inner.hi || (outer.hi === inner.hi && (!outer.hiOpen || inner.hiOpen));\n  return loOk && hiOk;\n}\n\n/** How two regimes sit relative to each other. @internal */\nexport type RegimeOverlap = 'disjoint' | 'overlap' | 'nested';\n\n/**\n * Classify two regimes on the group names they SHARE.\n *\n * Shared names only, and that restriction is the whole subtlety. A group one\n * regime constrains and the other says nothing about cannot separate them:\n * silence is not a constraint, so treating the unconstrained side as empty\n * would report `'disjoint'` for two regimes that genuinely overlap. The answer\n * is therefore about the shared coordinates, and says nothing about the\n * private ones.\n *\n * - `'disjoint'` — some shared group has intervals that cannot both hold.\n * - `'nested'` — the shared box of one regime contains the other (equal boxes,\n *   and the no-shared-group case, are nested: each contains the other).\n * - `'overlap'` — they meet, and neither contains the other.\n *\n * @internal\n */\nexport function regimeOverlap(a: Regime, b: Regime): RegimeOverlap {\n  const ia = intervalsOf(a);\n  const ib = intervalsOf(b);\n  const shared = [...ia.keys()].filter((name) => ib.has(name));\n\n  for (const name of shared) {\n    if (isEmpty(intersectIntervals(ia.get(name)!, ib.get(name)!))) return 'disjoint';\n  }\n  const aInB = shared.every((name) => contains(ib.get(name)!, ia.get(name)!));\n  const bInA = shared.every((name) => contains(ia.get(name)!, ib.get(name)!));\n  return aInB || bInA ? 'nested' : 'overlap';\n}\n\n/** One grid cell of a sampled group box, and the regimes that cover it. @internal */\nexport interface RegionSample {\n  /** The π-group value at this cell, keyed by `PiGroup.formula`. */\n  readonly point: Readonly<Record<string, number>>;\n}\n\n/** A record carrying a regime — `AtlasModel` and `AtlasBridge` both fit. @internal */\nexport interface RegimeBearing {\n  readonly id: string;\n  readonly regime: Regime;\n}\n\n/**\n * Grid-sample a group box and list the cells no regime covers.\n *\n * `samples` IS the box: one explicit axis of values per π-group name. The box\n * is not derived from the bounds the regimes themselves carry, and that is\n * deliberate — a synthesized box would report coverage against an extent this\n * library invented, so \"uncovered\" would measure the guess rather than the\n * atlas. The caller states where it wants to know about.\n *\n * COVERED means some regime returned `true` with at least one inequality\n * checked. An `'unknown'` is NOT coverage, by the same rule that makes\n * {@link regimeHolds} tri-state: a regime whose groups the sample axes never\n * mention has not been shown to apply anywhere. Neither is a vacuous pass: a\n * regime that states no inequality has checked nothing at the point.\n *\n * Records of another family are skipped, so a mixed list is safe to pass.\n *\n * @internal\n */\nexport function uncoveredRegions(\n  family: string,\n  models: readonly RegimeBearing[],\n  samples: Readonly<Record<string, readonly number[]>>,\n): readonly RegionSample[] {\n  const inFamily = models.filter((m) => m.regime.family === family);\n  const uncovered: RegionSample[] = [];\n  for (const point of gridPoints(samples)) {\n    // `checked > 0`: a regime with no inequality passes vacuously and has shown\n    // nothing about this point, so it covers nothing (the rule in `regimeHolds`'s\n    // doc comment: coverage reads `checked`, never `ok` alone).\n    const covered = inFamily.some((m) => {\n      const check = regimeHolds(m.regime, point);\n      return check.ok === true && check.checked > 0;\n    });\n    // An uncovered cell is covered by nothing, by definition; the sample\n    // carries the point and no list that could only ever be empty.\n    if (!covered) uncovered.push({ point });\n  }\n  return uncovered;\n}\n\n/** Cartesian product of the named axes. An axis with no values yields nothing. */\nfunction gridPoints(\n  samples: Readonly<Record<string, readonly number[]>>,\n): readonly Record<string, number>[] {\n  let points: Record<string, number>[] = [{}];\n  for (const [group, axis] of Object.entries(samples)) {\n    const next: Record<string, number>[] = [];\n    for (const base of points) {\n      for (const value of axis) next.push({ ...base, [group]: value });\n    }\n    points = next;\n  }\n  return points;\n}\n"]}

package/dist/relations/types.d.ts

@@ -17,9 +17,11 @@ export type EvidenceTag = 'proposed' | 'reviewed' | 'dimension-checked' | 'conve
  *
  * Lives HERE, not in `coverage.ts` (which re-exports it), because
  * `tests/atlas/derived-tag-literals.test.ts` allows the literals
- * `'formally-proved'` and `'symbolically-checked'` under `src/atlas/` in
- * exactly two files: this one and `derive-evidence.ts`. A tag that can only be
- * DERIVED must not be spellable anywhere a record could hand-set it.
+ * `'formally-proved'` and `'symbolically-checked'` under `src/atlas/` and
+ * `src/relations/` in exactly three files: this one (`src/relations/types.ts`,
+ * where the union and the tag list are declared), `src/atlas/types.ts`, and
+ * `src/atlas/derive-evidence.ts`. A tag that can only be DERIVED must not be
+ * spellable anywhere a record could hand-set it.
  *
  * @internal
  */
@@ -32,12 +34,23 @@ export declare const ALL_EVIDENCE_TAGS: readonly ["proposed", "reviewed", "dimen
  * - `'back-translation'` — a reviewer who had not seen the source translated
  *   the formal statement back to prose and it matched.
  * - `'sanity-lemmas'` — the statement was instantiated on known cases in
- *   `tests/atlas/formal-sanity.test.ts`.
+ *   `tests/atlas/formal-sanity.test.ts`. A PhysJS reference carries it only
+ *   when its key is in `PHYSJS_SANITY_LEMMA_KEYS` and its manifest row is
+ *   also reviewed (below).
+ * - `'reviewed-manifest'` — the manifest row (key, theorem, kind, covers
+ *   line, proof status, axioms, nested statements) was read against the
+ *   bridge it keys and pinned by its hash in `src/atlas/physjs-reviewed.ts`;
+ *   `physjsFormalRef` recomputes the hash and emits this value only on a
+ *   match. The statement was not instantiated on a known case.
  * - `'unreviewed'` — recorded, not checked. **Earns no tag, by construction.**
+ *   A PhysJS key whose row is not in the reviewed table, or that is ahead of
+ *   the catalog, derives this value.
+ *
+ * No value here is hand-set on a record: `physjsFormalRef` derives it.
  *
  * @internal
  */
-export type FormalFidelity = 'two-formalizers' | 'back-translation' | 'sanity-lemmas' | 'unreviewed';
+export type FormalFidelity = 'two-formalizers' | 'back-translation' | 'sanity-lemmas' | 'reviewed-manifest' | 'unreviewed';
 /**
  * What a formal reference certifies.
  *

package/dist/relations/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/relations/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAE5D,qFAAqF;AACrF,MAAM,MAAM,YAAY,GACpB,YAAY,GACZ,mBAAmB,GACnB,aAAa,GACb,eAAe,GACf,iBAAiB,GACjB,uBAAuB,GACvB,oBAAoB,GACpB,0BAA0B,CAAC;AAE/B,yFAAyF;AACzF,MAAM,MAAM,WAAW,GACnB,UAAU,GACV,UAAU,GACV,mBAAmB,GACnB,oBAAoB,GACpB,sBAAsB,GACtB,uBAAuB,GACvB,iBAAiB,GACjB,0BAA0B,GAC1B,6BAA6B,GAC7B,uBAAuB,GACvB,cAAc,GACd,YAAY,CAAC;AAEjB;;;;;;;;;;GAUG;AACH,eAAO,MAAM,iBAAiB,oQAaa,CAAC;AAE5C;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,cAAc,GACtB,iBAAiB,GACjB,kBAAkB,GAClB,eAAe,GACf,YAAY,CAAC;AAEjB;;;;;;;;GAQG;AACH,eAAO,MAAM,gBAAgB,YAAI,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,CAAU,CAAC;AAExH;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE9D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,eAAe,GAAG,cAAc,GAAG,OAAO,CAAC;IAC5D,sEAAsE;IACtE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,uEAAuE;IACvE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,oEAAoE;IACpE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,uEAAuE;AACvE,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,qDAAqD;IACrD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,8EAA8E;AAC9E,MAAM,WAAW,MAAM;IACrB,uBAAuB;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACnD,6EAA6E;IAC7E,QAAQ,CAAC,gBAAgB,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CAC9D;AAED,4EAA4E;AAC5E,MAAM,WAAW,kBAAkB;IACjC,yDAAyD;IACzD,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,6BAA6B;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,kDAAkD;IAClD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,oFAAoF;IACpF,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,OAAO,CAAC;IACxF;;;;;;;;;;;;;OAaG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC;IACxE;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,aAAa,GAAG,uBAAuB,CAAC;IAChE,wBAAwB;IACxB,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,cAAc,EAAE,cAAc,CAAC;IACxC;;;;;;;;;OASG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;CAC/C;AAED,6EAA6E;AAC7E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,eAAe;IACf,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,gBAAgB,GACxB;IAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GAChE;IACE,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;IACnC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,sFAAsF;IACtF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GACjE;IACE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC;CACpC,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IACjC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,wEAAwE;IACxE,QAAQ,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC;CACrC,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GAC3E;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GACxE;IAAE,QAAQ,CAAC,IAAI,EAAE,0BAA0B,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnF;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,iDAAiD;IACjD,QAAQ,CAAC,YAAY,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC;IACtC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3C,QAAQ,CAAC,oBAAoB,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,MAAM,CAAC;IAC/D,QAAQ,CAAC,UAAU,CAAC,EAAE,IAAI,GAAG,UAAU,GAAG,SAAS,CAAC;IACpD,QAAQ,CAAC,mBAAmB,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC;CAC1C"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/relations/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAE5D,qFAAqF;AACrF,MAAM,MAAM,YAAY,GACpB,YAAY,GACZ,mBAAmB,GACnB,aAAa,GACb,eAAe,GACf,iBAAiB,GACjB,uBAAuB,GACvB,oBAAoB,GACpB,0BAA0B,CAAC;AAE/B,yFAAyF;AACzF,MAAM,MAAM,WAAW,GACnB,UAAU,GACV,UAAU,GACV,mBAAmB,GACnB,oBAAoB,GACpB,sBAAsB,GACtB,uBAAuB,GACvB,iBAAiB,GACjB,0BAA0B,GAC1B,6BAA6B,GAC7B,uBAAuB,GACvB,cAAc,GACd,YAAY,CAAC;AAEjB;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,iBAAiB,oQAaa,CAAC;AAE5C;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,MAAM,cAAc,GACtB,iBAAiB,GACjB,kBAAkB,GAClB,eAAe,GACf,mBAAmB,GACnB,YAAY,CAAC;AAEjB;;;;;;;;GAQG;AACH,eAAO,MAAM,gBAAgB,YAAI,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,CAAU,CAAC;AAExH;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE9D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,eAAe,GAAG,cAAc,GAAG,OAAO,CAAC;IAC5D,sEAAsE;IACtE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,uEAAuE;IACvE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,oEAAoE;IACpE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,uEAAuE;AACvE,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,qDAAqD;IACrD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,8EAA8E;AAC9E,MAAM,WAAW,MAAM;IACrB,uBAAuB;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACnD,6EAA6E;IAC7E,QAAQ,CAAC,gBAAgB,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CAC9D;AAED,4EAA4E;AAC5E,MAAM,WAAW,kBAAkB;IACjC,yDAAyD;IACzD,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,6BAA6B;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,kDAAkD;IAClD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,oFAAoF;IACpF,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,OAAO,CAAC;IACxF;;;;;;;;;;;;;OAaG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC;IACxE;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,aAAa,GAAG,uBAAuB,CAAC;IAChE,wBAAwB;IACxB,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,cAAc,EAAE,cAAc,CAAC;IACxC;;;;;;;;;OASG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;CAC/C;AAED,6EAA6E;AAC7E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,eAAe;IACf,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,gBAAgB,GACxB;IAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GAChE;IACE,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;IACnC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,sFAAsF;IACtF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GACjE;IACE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC;CACpC,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IACjC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,wEAAwE;IACxE,QAAQ,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC;CACrC,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GAC3E;IAAE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GACxE;IAAE,QAAQ,CAAC,IAAI,EAAE,0BAA0B,CAAC;IAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnF;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,iDAAiD;IACjD,QAAQ,CAAC,YAAY,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC;IACtC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3C,QAAQ,CAAC,oBAAoB,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,MAAM,CAAC;IAC/D,QAAQ,CAAC,UAAU,CAAC,EAAE,IAAI,GAAG,UAAU,GAAG,SAAS,CAAC;IACpD,QAAQ,CAAC,mBAAmB,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC;CAC1C"}

package/dist/relations/types.js

@@ -12,9 +12,11 @@
  *
  * Lives HERE, not in `coverage.ts` (which re-exports it), because
  * `tests/atlas/derived-tag-literals.test.ts` allows the literals
- * `'formally-proved'` and `'symbolically-checked'` under `src/atlas/` in
- * exactly two files: this one and `derive-evidence.ts`. A tag that can only be
- * DERIVED must not be spellable anywhere a record could hand-set it.
+ * `'formally-proved'` and `'symbolically-checked'` under `src/atlas/` and
+ * `src/relations/` in exactly three files: this one (`src/relations/types.ts`,
+ * where the union and the tag list are declared), `src/atlas/types.ts`, and
+ * `src/atlas/derive-evidence.ts`. A tag that can only be DERIVED must not be
+ * spellable anywhere a record could hand-set it.
  *
  * @internal
  */

package/dist/relations/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/relations/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA8BH;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,UAAU;IACV,UAAU;IACV,mBAAmB;IACnB,oBAAoB;IACpB,sBAAsB;IACtB,uBAAuB;IACvB,iBAAiB;IACjB,0BAA0B;IAC1B,6BAA6B;IAC7B,uBAAuB;IACvB,cAAc;IACd,YAAY;CAC6B,CAAC;AAqB5C;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,CAAU,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/relations/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA8BH;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,UAAU;IACV,UAAU;IACV,mBAAmB;IACnB,oBAAoB;IACpB,sBAAsB;IACtB,uBAAuB;IACvB,iBAAiB;IACjB,0BAA0B;IAC1B,6BAA6B;IAC7B,uBAAuB;IACvB,cAAc;IACd,YAAY;CAC6B,CAAC;AAiC5C;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,CAAU,CAAC","sourcesContent":["/**\n * Shared relation vocabulary.\n *\n * Objects and morphisms are `./category.ts`. Composition delegates to\n * `composeRelation`. `src/atlas/types.ts` re-exports these names, so the\n * public `atlas` namespace and the atlas subpath are unchanged.\n *\n * @module relations/types\n */\n\nimport type { PiGroup } from '../dimensional/buckingham.js';\n\n/** The relation a bridge asserts between its premises and its conclusion. @public */\nexport type RelationType =\n  | 'derivation'\n  | 'exact-equivalence'\n  | 'restriction'\n  | 'approximation'\n  | 'coarse-graining'\n  | 'analytic-continuation'\n  | 'structural-analogy'\n  | 'deformation-quantization';\n\n/** What kind of support a record carries. Carried only if its witness passes. @public */\nexport type EvidenceTag =\n  | 'proposed'\n  | 'reviewed'\n  | 'dimension-checked'\n  | 'convention-checked'\n  | 'symbolically-checked'\n  | 'numerically-supported'\n  | 'formally-proved'\n  | 'formally-proved-property'\n  | 'formally-proved-cross-check'\n  | 'empirically-supported'\n  | 'contradicted'\n  | 'unresolved';\n\n/**\n * Every `EvidenceTag`, in declaration order, so a report can name all of them.\n *\n * Lives HERE, not in `coverage.ts` (which re-exports it), because\n * `tests/atlas/derived-tag-literals.test.ts` allows the literals\n * `'formally-proved'` and `'symbolically-checked'` under `src/atlas/` and\n * `src/relations/` in exactly three files: this one (`src/relations/types.ts`,\n * where the union and the tag list are declared), `src/atlas/types.ts`, and\n * `src/atlas/derive-evidence.ts`. A tag that can only be DERIVED must not be\n * spellable anywhere a record could hand-set it.\n *\n * @internal\n */\nexport const ALL_EVIDENCE_TAGS = [\n  'proposed',\n  'reviewed',\n  'dimension-checked',\n  'convention-checked',\n  'symbolically-checked',\n  'numerically-supported',\n  'formally-proved',\n  'formally-proved-property',\n  'formally-proved-cross-check',\n  'empirically-supported',\n  'contradicted',\n  'unresolved',\n] as const satisfies readonly EvidenceTag[];\n\n/**\n * How a formal reference's statement was checked against the physics it claims\n * to state (Phase 4 design note §3).\n *\n * - `'two-formalizers'` — two people formalized it independently and agreed.\n * - `'back-translation'` — a reviewer who had not seen the source translated\n *   the formal statement back to prose and it matched.\n * - `'sanity-lemmas'` — the statement was instantiated on known cases in\n *   `tests/atlas/formal-sanity.test.ts`. A PhysJS reference carries it only\n *   when its key is in `PHYSJS_SANITY_LEMMA_KEYS` and its manifest row is\n *   also reviewed (below).\n * - `'reviewed-manifest'` — the manifest row (key, theorem, kind, covers\n *   line, proof status, axioms, nested statements) was read against the\n *   bridge it keys and pinned by its hash in `src/atlas/physjs-reviewed.ts`;\n *   `physjsFormalRef` recomputes the hash and emits this value only on a\n *   match. The statement was not instantiated on a known case.\n * - `'unreviewed'` — recorded, not checked. **Earns no tag, by construction.**\n *   A PhysJS key whose row is not in the reviewed table, or that is ahead of\n *   the catalog, derives this value.\n *\n * No value here is hand-set on a record: `physjsFormalRef` derives it.\n *\n * @internal\n */\nexport type FormalFidelity =\n  | 'two-formalizers'\n  | 'back-translation'\n  | 'sanity-lemmas'\n  | 'reviewed-manifest'\n  | 'unreviewed';\n\n/**\n * What a formal reference certifies.\n *\n * `'bridge'` is the only kind that derives `formally-proved`. `'property'`\n * and `'cross-check'` derive their own labels. A reduction, a limit, and a\n * derivation-step are recorded and derive neither.\n *\n * @internal\n */\nexport const FORMAL_REF_KINDS = ['bridge', 'property', 'cross-check', 'reduction', 'limit', 'derivation-step'] as const;\n\n/**\n * One of {@link FORMAL_REF_KINDS}. A PhysJS reference takes the `kind` its\n * manifest entry records.\n *\n * @internal\n */\nexport type FormalRefKind = (typeof FORMAL_REF_KINDS)[number];\n\n/**\n * A machine-checked counterpart of a record's claim in a proof assistant.\n *\n * A proof of the WRONG statement proves nothing about the physics, so the\n * reference carries its `fidelity` — how anyone knows the formal statement says\n * what the bridge says. `formally-proved` is derived from `kind` and `fidelity`\n * and never set. A property and a cross-check are shown under their own labels\n * and are not a proved bridge.\n *\n * @internal\n */\nexport interface FormalRef {\n  readonly system: 'lean4-physlib' | 'lean4-physjs' | 'other';\n  /** The formal statement's name or text, as it appears in `system`. */\n  readonly statement: string;\n  /** The library version or commit the statement was checked against. */\n  readonly version: string;\n  /** Axioms the proof depends on beyond the system's core. */\n  readonly axioms: readonly string[];\n  readonly fidelity: FormalFidelity;\n  readonly kind: FormalRefKind;\n  /** Permalink to the theorem's source file at `version`'s commit. */\n  readonly url: string;\n  /**\n   * What the statement certifies, and the limit of that certification.\n   * A reviewed reference's line contains `covers its statement only`.\n   */\n  readonly covers: string;\n}\n\n/** Whether the limit a bridge takes is regular or singular. @public */\nexport type LimitCharacter = 'regular' | 'singular' | 'unknown';\n\n/**\n * One inequality on a regime coordinate. The coordinate is either a π-group\n * `buckinghamPi` produced from the family's dimensioned parameters (keyed by\n * `PiGroup.formula`), or a dimensionless INPUT of the model (an initial datum\n * such as θ0, a wavenumber-lattice product qa) declared as a\n * `DimensionalVariable` with the zero dimension, which is its own trivial\n * group. Derived quantities such as ζ = ½ (m k / b²)^(−½) are NOT groups:\n * write the inequality on the group (`m k / b² > 1/4`) and record the display\n * alias in `alias`.\n *\n * @public\n */\nexport interface RegimeInequality {\n  /** `PiGroup.formula`, or the dimensionless input's name. */\n  readonly group: string;\n  readonly op: '<' | '<=' | '>' | '>=';\n  readonly bound: number;\n  /** `'ζ < 1'` — for display only, never evaluated. */\n  readonly alias?: string;\n}\n\n/** Where in parameter space a model or bridge is claimed to apply. @public */\nexport interface Regime {\n  /** `'oscillators'`. */\n  readonly family: string;\n  readonly inequalities: readonly RegimeInequality[];\n  /** Traceability back to the dimension matrix, keyed by `PiGroup.formula`. */\n  readonly groupDefinitions: Readonly<Record<string, PiGroup>>;\n}\n\n/** A Lipschitz-plus-offset error bound with a mandatory horizon. @public */\nexport interface ApproximationBound {\n  /** Lipschitz constant of the map, in the stated norm. */\n  readonly K: number;\n  /**\n   * Uniform error, same norm: the SUPREMUM OF THE BOUND OVER THE WHOLE\n   * DECLARED DOMAIN (`domain` / `parameterRange`), never a sample of it at\n   * one convenient fixture point.\n   *\n   * A parameter-dependent bound evaluated at a fixture is not a bound on the\n   * domain it claims: the record would read as covering every admissible\n   * parameter while holding only at the one point it was measured. When the\n   * supremum is approached but not attained at an open edge of the domain,\n   * `delta` is that supremum, and `deltaAt` is what a caller uses to get the\n   * tighter value at its own point.\n   */\n  readonly delta: number;\n  /**\n   * `'relative period error, normalized by the value of the reduced model'`,\n   * `'sup |x − x_reduced| for t ≥ 5 m/b'`, …\n   *\n   * A RELATIVE norm divides |exact − reduced| by the REDUCED model's value, and\n   * says so in this string. The other reading, by the exact value, gives a\n   * different number: at x = ck/ω₀ = 1 the non-relativistic kinetic frequency\n   * exceeds the exact Klein–Gordon one by 20.7% of the exact value, and by\n   * 17.2% of its own value. `tests/atlas/relative-norm-convention.test.ts` recomputes\n   * every relative `delta` from closed-form physics and pins the convention.\n   */\n  readonly norm: string;\n  /** Where the bound holds. */\n  readonly domain: string;\n  /** MANDATORY prose horizon: `'t ≪ 16 T0/θ0²'`. */\n  readonly horizon: string;\n  /** MANDATORY machine form of `horizon`: true while the bound is claimed to hold. */\n  readonly horizonHolds: (t: number, params: Readonly<Record<string, number>>) => boolean;\n  /**\n   * MACHINE FORM OF `delta`, mirroring what `horizonHolds` is to `horizon`:\n   * the bound AT A POINT of the declared domain, in the same norm.\n   *\n   * `horizon` had a machine counterpart and `delta` had none, so an\n   * implementer holding a correct parameter-dependent bound could only freeze\n   * it at a single point and hope the reader noticed. `deltaAt` is where that\n   * dependence goes; `delta` stays the supremum over the domain, and\n   * `deltaAt(p) <= delta` for every admissible `p`.\n   *\n   * Optional on the interface so a genuinely constant bound need not restate\n   * itself, and so `coarse-graining` bounds are unaffected; MANDATORY for an\n   * `approximation`, enforced at admission by `admitApproximation`.\n   */\n  readonly deltaAt?: (params: Readonly<Record<string, number>>) => number;\n  /**\n   * What `deltaAt` rests on. `'closed-form'`: it returns the EXACT error in\n   * closed form, so it is a proven bound, holding with equality. `'numerically-\n   * supported'`: a formula that witnesses support numerically but no proof\n   * covers. `upt path` prints a point bound only when every step is closed-form.\n   */\n  readonly deltaAtBasis?: 'closed-form' | 'numerically-supported';\n  /** `'θ0 ≤ 0.5 rad'`. */\n  readonly parameterRange?: string;\n  readonly limitCharacter: LimitCharacter;\n  /**\n   * What the error is uniform in.\n   *\n   * `null` means NOT YET ANALYSED. That is a legitimate recorded state:\n   * `makeApproximation` accepts it, and the check lives at use (`boundPath`),\n   * not at construction. An empty array means the same thing — a universal\n   * over nothing must not count as analysed. A non-empty array names the\n   * scopes the error is uniform in. A variable a side condition says the\n   * error is NOT uniform in is not listed.\n   */\n  readonly uniformity: readonly string[] | null;\n}\n\n/** A case a bridge does NOT cover, and the witness that shows it. @public */\nexport interface Counterexample {\n  readonly description: string;\n  /** `'W2b'`. */\n  readonly witness: string;\n}\n\n/**\n * The relation a record asserts, as a DISCRIMINATED UNION over `RelationType`.\n *\n * This is the Phase 1 overlay (design note §1.2, \"One overlay, not two\"). Its\n * purpose is to move `AtlasBridge`'s two CONDITIONAL requirements — written\n * there only as doc comments — into the type system:\n *\n *   - `approximation` REQUIRES `bound`, and `ApproximationBound` itself\n *     mandates `horizon` + `horizonHolds`. So an approximation without a\n *     machine horizon is a COMPILE error, not a runtime one.\n *   - `exact-equivalence` REQUIRES `inverse`.\n *\n * Deliberately conservative elsewhere. The design note §2.2 names the fields\n * the other members WOULD need (an analyticity domain, a checkable\n * `preserves` set, an ħ-order) and records that none of them exists before\n * Phase 2. Inventing them here would encode claims the data cannot support,\n * so every other member carries only `transformation`.\n *\n * @internal\n */\nexport type RelationContract =\n  | { readonly type: 'derivation'; readonly transformation: string }\n  | {\n      readonly type: 'exact-equivalence';\n      readonly transformation: string;\n      /** REQUIRED: `'x = x0 u, t = τ/ω0'`. An equivalence without an inverse is not one. */\n      readonly inverse: string;\n    }\n  | { readonly type: 'restriction'; readonly transformation: string }\n  | {\n      readonly type: 'approximation';\n      readonly transformation: string;\n      /** REQUIRED, and mandates its own machine horizon. */\n      readonly bound: ApproximationBound;\n    }\n  | {\n      readonly type: 'coarse-graining';\n      readonly transformation: string;\n      /** Optional: errors accumulate through `composeBounds` when present. */\n      readonly bound?: ApproximationBound;\n    }\n  | { readonly type: 'analytic-continuation'; readonly transformation: string }\n  | { readonly type: 'structural-analogy'; readonly transformation: string }\n  | { readonly type: 'deformation-quantization'; readonly transformation: string };\n\n/**\n * Sign and unit choices a record depends on. Every field is optional, and a\n * field is only meaningful when the record actually depends on that choice.\n *\n * Non-emptiness matters downstream: design note §3 requires `conventions` to\n * declare AT LEAST ONE field before `convention-checked` can be derived,\n * because `[].every(…)` is vacuously true and would hand out a free tag.\n *\n * @internal\n */\nexport interface Conventions {\n  /** First law as `dU = Q − W` or `dU = Q + W`. */\n  readonly heatWorkSign?: 'Q-W' | 'Q+W';\n  readonly metricSignature?: '-+++' | '+---';\n  readonly fourierNormalization?: 'unitary' | 'physics' | 'none';\n  readonly unitSystem?: 'SI' | 'gaussian' | 'natural';\n  readonly capacitorChargeSign?: '+' | '-';\n}\n\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "universal-physics-tensor",
-  "version": "9.0.0",
+  "version": "10.0.0",
   "description": "Computational framework for exploring unified physics through tensor formalism",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
@@ -29,11 +29,6 @@
       "default": "./dist/atlas/index.js"
     }
   },
-  "directories": {
-    "doc": "docs",
-    "example": "examples",
-    "test": "tests"
-  },
   "scripts": {
     "prepare": "git config core.hooksPath .githooks || exit 0",
     "build": "tsc",
@@ -50,7 +45,7 @@
     "test:watch": "vitest",
     "prepublishOnly": "npm run validate",
     "bench": "vitest bench",
-    "bench:ci": "vitest bench --reporter=verbose",
+    "bench:ci": "vitest bench --run --outputJson bench/results.json",
     "docs:deps": "bun tools/create-dependency-graph/create-dependency-graph.ts --root=. --include-tests",
     "physjs:table": "bun scripts/generate-physjs-table.ts",
     "docs:cli": "bun scripts/cli-reference.ts",
@@ -61,12 +56,13 @@
     "atlas:c3-export": "bun tools/criterion3-export/export.ts",
     "atlas:c3-labels": "bun tools/criterion3-study/labels.ts",
     "atlas:c3-run": "bun tools/criterion3-study/run.ts",
-    "catalog:json": "npm run build && node scripts/emit-catalog-json.mjs",
+    "catalog:json": "npm run build && node scripts/check-catalog-json.mjs",
     "atlas:json": "npm run build && node scripts/emit-atlas-json.mjs",
     "atlas:witness-results": "npm run build && node scripts/emit-witness-results.mjs",
     "atlas:study": "npm run build && node scripts/run-atlas-study.mjs",
-    "typecheck": "tsc --noEmit && tsc -p tsconfig.tests.json",
-    "validate": "npm run build && npm run typecheck && npm test && npm run audit:plans && npm run package:check",
+    "typecheck": "tsc --noEmit && npm run typecheck:tests",
+    "typecheck:tests": "tsc -p tsconfig.tests.json",
+    "validate": "npm run build && npm run smoke && npm run typecheck:tests && vitest run && npm run audit:plans && npm run package:check",
     "package:check": "node scripts/package-smoke.mjs"
   },
   "files": [
@@ -95,12 +91,12 @@
   },
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/danielsimonjr/universal-physics-tensor.git"
+    "url": "git+https://github.com/danielsimonjr/Universal-Physics-Tensor.git"
   },
   "bugs": {
-    "url": "https://github.com/danielsimonjr/universal-physics-tensor/issues"
+    "url": "https://github.com/danielsimonjr/Universal-Physics-Tensor/issues"
   },
-  "homepage": "https://github.com/danielsimonjr/universal-physics-tensor#readme",
+  "homepage": "https://github.com/danielsimonjr/Universal-Physics-Tensor#readme",
   "dependencies": {
     "@danielsimonjr/mathts-autograd": "^0.3.16",
     "@danielsimonjr/mathts-core": "^0.16.0",
@@ -113,7 +109,7 @@
     "@danielsimonjr/mathts-workerpool": "^0.2.6"
   },
   "devDependencies": {
-    "@types/node": "^26.0.0",
+    "@types/node": "^22.0.0",
     "@vitest/coverage-v8": "^4.1.7",
     "@viz-js/viz": "^3.28.0",
     "fast-check": "^4.8.0",

package/dist/bridges/registry.d.ts

@@ -1,60 +0,0 @@
-/**
- * One registration for a catalog bridge.
- *
- * The catalog array, the right-hand side map, the evaluator map, and the
- * edge list are projections of this registry. A second `BRIDGE_EQUATIONS`
- * literal is a scan hit. An `ab-*` id is an atlas model and is rejected.
- *
- * @module bridges/registry
- */
-import type { ExprNode } from '../dimensional/validator.js';
-/** The fields a registration may carry. Each projection reads one of them. */
-export interface BridgeRegistration {
-    /** Numeric catalog id, when the other parts do not already carry it. */
-    readonly id?: number | string;
-    /** Catalog row. `id` is the catalog id. */
-    readonly entry?: {
-        readonly id: number;
-    };
-    /** Encoded right-hand side. Absent when the bridge has no AST. */
-    readonly rhs?: ExprNode;
-    /** Id-keyed evaluator. */
-    readonly evaluator?: {
-        readonly bridgeId: number;
-    };
-    /**
-     * Composition edge. `beId: null` stays on the edge list. The edge `id`
-     * is what a second registration of the same edge matches.
-     */
-    readonly edge?: {
-        readonly id: string;
-        readonly beId: number | null;
-    };
-}
-/** The four projections, in registration order. */
-export interface BridgeRegistry {
-    register(parts: BridgeRegistration): void;
-    equations(): {
-        readonly id: number;
-    }[];
-    rhs(): ReadonlyMap<number, ExprNode>;
-    evaluators(): ReadonlyMap<number, {
-        readonly bridgeId: number;
-    }>;
-    edges(): {
-        readonly id: string;
-        readonly beId: number | null;
-    }[];
-}
-/**
- * An empty registry. Tests use this. Production uses {@link registerBridge}.
- */
-export declare function createBridgeRegistry(): BridgeRegistry;
-/** The production registry. Snapshots are taken by the modules that export them. */
-export declare const bridgeRegistry: BridgeRegistry;
-/**
- * Register one bridge, or one part of one, on the production registry.
- * An id that starts with `ab-` throws.
- */
-export declare function registerBridge(parts: BridgeRegistration): void;
-//# sourceMappingURL=registry.d.ts.map

package/dist/bridges/registry.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/bridges/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,8EAA8E;AAC9E,MAAM,WAAW,kBAAkB;IACjC,wEAAwE;IACxE,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,2CAA2C;IAC3C,QAAQ,CAAC,KAAK,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;IACzC,kEAAkE;IAClE,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;IACxB,0BAA0B;IAC1B,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACnD;;;OAGG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;CACvE;AAED,mDAAmD;AACnD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,KAAK,EAAE,kBAAkB,GAAG,IAAI,CAAC;IAC1C,SAAS,IAAI;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACvC,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACrC,UAAU,IAAI,WAAW,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACjE,KAAK,IAAI;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,EAAE,CAAC;CAClE;AAED;;GAEG;AACH,wBAAgB,oBAAoB,IAAI,cAAc,CAkErD;AAED,oFAAoF;AACpF,eAAO,MAAM,cAAc,gBAAyB,CAAC;AAErD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,kBAAkB,GAAG,IAAI,CAE9D"}