universal-physics-tensor 9.0.0 → 11.0.0

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": "11.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,25 +91,25 @@
   },
   "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",
-    "@danielsimonjr/mathts-expression": "^0.10.0",
-    "@danielsimonjr/mathts-functions": "^0.68.0",
-    "@danielsimonjr/mathts-matrix": "^0.7.6",
+    "@danielsimonjr/mathts-autograd": "^0.3.18",
+    "@danielsimonjr/mathts-core": "^0.18.1",
+    "@danielsimonjr/mathts-expression": "^0.10.2",
+    "@danielsimonjr/mathts-functions": "^0.68.5",
+    "@danielsimonjr/mathts-matrix": "^0.7.8",
     "@danielsimonjr/mathts-parallel": "^0.6.8",
-    "@danielsimonjr/mathts-tensor": "^0.2.22",
+    "@danielsimonjr/mathts-tensor": "^0.2.24",
     "@danielsimonjr/mathts-wasm": "^0.3.0",
     "@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"}

package/dist/bridges/registry.js

@@ -1,87 +0,0 @@
-/**
- * An empty registry. Tests use this. Production uses {@link registerBridge}.
- */
-export function createBridgeRegistry() {
-    const entries = new Map();
-    const rhs = new Map();
-    const evaluators = new Map();
-    const edges = [];
-    const edgeIds = new Set();
-    function numericId(parts) {
-        if (typeof parts.id === 'string') {
-            if (parts.id.startsWith('ab-')) {
-                throw new Error(`registerBridge rejects atlas id '${parts.id}'`);
-            }
-            throw new Error(`registerBridge rejects id '${parts.id}'`);
-        }
-        if (typeof parts.id === 'number')
-            return parts.id;
-        if (parts.entry !== undefined)
-            return parts.entry.id;
-        if (parts.evaluator !== undefined)
-            return parts.evaluator.bridgeId;
-        if (parts.edge !== undefined && parts.edge.beId !== null)
-            return parts.edge.beId;
-        return undefined;
-    }
-    return {
-        register(parts) {
-            const id = numericId(parts);
-            if (parts.entry !== undefined) {
-                if (id === undefined)
-                    throw new Error('registerBridge entry has no id');
-                const prev = entries.get(id);
-                if (prev === undefined)
-                    entries.set(id, parts.entry);
-                else if (prev !== parts.entry && JSON.stringify(prev) !== JSON.stringify(parts.entry)) {
-                    throw new Error(`registerBridge: bridge ${id} already has a different catalog entry`);
-                }
-            }
-            if (parts.rhs !== undefined) {
-                if (id === undefined)
-                    throw new Error('registerBridge rhs has no id');
-                const prev = rhs.get(id);
-                if (prev === undefined)
-                    rhs.set(id, parts.rhs);
-                else if (prev !== parts.rhs && JSON.stringify(prev) !== JSON.stringify(parts.rhs)) {
-                    throw new Error(`registerBridge: bridge ${id} already has a different right-hand side`);
-                }
-            }
-            if (parts.evaluator !== undefined) {
-                const bridgeId = parts.evaluator.bridgeId;
-                const prev = evaluators.get(bridgeId);
-                if (prev === undefined)
-                    evaluators.set(bridgeId, parts.evaluator);
-                else if (prev !== parts.evaluator) {
-                    throw new Error(`registerBridge: bridge ${bridgeId} already has an evaluator`);
-                }
-            }
-            if (parts.edge !== undefined && !edgeIds.has(parts.edge.id)) {
-                edgeIds.add(parts.edge.id);
-                edges.push(parts.edge);
-            }
-        },
-        equations() {
-            return [...entries.values()];
-        },
-        rhs() {
-            return new Map(rhs);
-        },
-        evaluators() {
-            return new Map(evaluators);
-        },
-        edges() {
-            return [...edges];
-        },
-    };
-}
-/** The production registry. Snapshots are taken by the modules that export them. */
-export const bridgeRegistry = createBridgeRegistry();
-/**
- * Register one bridge, or one part of one, on the production registry.
- * An id that starts with `ab-` throws.
- */
-export function registerBridge(parts) {
-    bridgeRegistry.register(parts);
-}
-//# sourceMappingURL=registry.js.map

package/dist/bridges/registry.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../src/bridges/registry.ts"],"names":[],"mappings":"AAqCA;;GAEG;AACH,MAAM,UAAU,oBAAoB;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC3D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyC,CAAC;IACpE,MAAM,KAAK,GAA4D,EAAE,CAAC;IAC1E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,SAAS,CAAC,KAAyB;QAC1C,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,oCAAoC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;YACnE,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ;YAAE,OAAO,KAAK,CAAC,EAAE,CAAC;QAClD,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACrD,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC;QACnE,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QACjF,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO;QACL,QAAQ,CAAC,KAAK;YACZ,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,EAAE,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;gBACxE,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7B,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;qBAChD,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;oBACtF,MAAM,IAAI,KAAK,CAAC,0BAA0B,EAAE,wCAAwC,CAAC,CAAC;gBACxF,CAAC;YACH,CAAC;YACD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;gBAC5B,IAAI,EAAE,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;gBACtE,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACzB,IAAI,IAAI,KAAK,SAAS;oBAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;qBAC1C,IAAI,IAAI,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClF,MAAM,IAAI,KAAK,CAAC,0BAA0B,EAAE,0CAA0C,CAAC,CAAC;gBAC1F,CAAC;YACH,CAAC;YACD,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC;gBAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtC,IAAI,IAAI,KAAK,SAAS;oBAAE,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;qBAC7D,IAAI,IAAI,KAAK,KAAK,CAAC,SAAS,EAAE,CAAC;oBAClC,MAAM,IAAI,KAAK,CAAC,0BAA0B,QAAQ,2BAA2B,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5D,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,SAAS;YACP,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,GAAG;YACD,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,UAAU;YACR,OAAO,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK;YACH,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;QACpB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,oFAAoF;AACpF,MAAM,CAAC,MAAM,cAAc,GAAG,oBAAoB,EAAE,CAAC;AAErD;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAyB;IACtD,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC"}

package/dist/cli/poster-source.d.ts

@@ -1,154 +0,0 @@
-/**
- * The POSTER source for the physics map — turn the Atlas Phase 3 poster index
- * (statements, derivations, associations) into {@link VizJunction}s, and check
- * that every id a derivation names actually resolves.
- *
- * ## The graph this draws is NOT the catalog graph
- *
- * In the catalog map, round nodes are *quantities* and box nodes are
- * *equations*. In the poster map, round nodes are **statements** — including
- * the five hidden supporting nodes (the action principle, Noether, the full
- * Maxwell system, the Lorentz group, the central limit theorem) — and box
- * nodes are **derivations**: many premises in, one conclusion out. That is the
- * whole reason a hidden node is visible at all: it is a node because something
- * names it, not because it can be evaluated (`atlas/statement.ts`, design note
- * §1, says `ast?` is optional for exactly these five).
- *
- * It also makes {@link validatePoster} able to FAIL. A hidden node that is
- * merely listed somewhere can never be contradicted; a hidden node that two
- * derivations take as a premise is contradicted the moment the registry stops
- * defining it. Design note §9 question 4 flags the named-but-not-evaluated test
- * as the likeliest vacuous pass in this sprint — the dangling-premise check is
- * the answer to it, and its own test breaks it deliberately to prove it bites.
- *
- * ## How a poster junction meets the map's filters
- *
- * Nothing here bypasses `buildVizModel`'s filtering: these junctions are handed
- * in as `opts.extraJunctions` and are judged by the same `judge` predicate as
- * every catalog edge (design note §6). Two consequences, both deliberate:
- *
- *  - A **derivation** junction carries its `relation`, because a `Derivation`
- *    HAS one. So `--relation=derivation` selects poster derivations on recorded
- *    metadata rather than dropping them as unaudited. Reporting a relation we
- *    hold would be the fabrication's mirror image: hiding evidence we have.
- *  - An **association** junction carries NO `relation`, because an
- *    `Association` makes no relation claim at all (`atlas/association.ts`). Any
- *    `--relation` filter therefore drops it into the legend's
- *    `droppedMissingMetadata` bucket — "nobody could put the question to it" —
- *    which is the correct reading, not an oversight.
- *  - NOTHING here carries a `beId`: the poster is not the bridge catalog. Every
- *    `--evidence` filter therefore drops the whole poster source as lacking
- *    metadata, and the legend says so out loud rather than rendering an empty
- *    map as an answer.
- *
- * Poster junctions never anchor a cluster: `componentsOf` keys `anchored` on
- * `'law' | 'established'` only. That is correct — the poster index is a map of
- * claims and their supports, not an assertion that any of them is textbook
- * physics — and it is recorded here because it is a decision, not an accident.
- *
- * Pure string/record production: no I/O, no registry reads beyond what the
- * caller passes in. Imports atlas LEAF modules only, never `atlas/index.ts`.
- * Lives in `cli` because it feeds `upt map` and imports the poster registries.
- *
- * @module cli/poster-source
- */
-import type { Association } from '../atlas/association.js';
-import type { Derivation, DerivationId } from '../atlas/derivation.js';
-import type { Statement, StatementId } from '../atlas/statement.js';
-import type { VizJunction } from '../composition/graph-viz.js';
-/**
- * The poster index as this module consumes it: the three registries, passed
- * in rather than imported, so the renderer and the validator are testable
- * against a fixture and cannot drift with the data.
- *
- * @internal
- */
-export interface PosterGraph {
-    readonly statements: readonly Statement[];
-    readonly derivations: readonly Derivation[];
-    readonly associations: readonly Association[];
-}
-/** An id a derivation names that the statement registry does not define. @internal */
-export interface DanglingPremise {
-    /** The derivation that names it. */
-    readonly derivation: DerivationId;
-    /** The unresolved statement id. */
-    readonly missing: StatementId;
-    /**
-     * Where it was named. Kept distinct because they are different defects: a
-     * dangling PREMISE means the derivation stands on nothing, a dangling
-     * CONCLUSION means it concludes nothing.
-     */
-    readonly role: 'premise' | 'conclusion';
-}
-/** What {@link validatePoster} found. @internal */
-export interface PosterValidation {
-    /** Every unresolved id, one row per (derivation, id, role). Empty ⇒ intact. */
-    readonly dangling: readonly DanglingPremise[];
-    /**
-     * Association endpoints that are not statement ids.
-     *
-     * SEPARATE from `dangling`, and not a failure: `Association.between` is a
-     * pair of NAMES, and the registry is explicitly a container of typed pairs
-     * that makes no claim. An endpoint naming something outside the statement
-     * registry is a resemblance recorded about something else, not a broken
-     * derivation. Folding the two together would let a real dangling premise
-     * hide inside a count of harmless rows.
-     */
-    readonly unresolvedAssociationEndpoints: readonly string[];
-    /** Statement ids defined but named by no derivation and no association. */
-    readonly orphanStatements: readonly StatementId[];
-}
-/**
- * Check every id the poster's derivations and associations name against the
- * statement registry.
- *
- * This is the hidden-node test's instrument. Remove `'statement-noether'` from
- * `graph.statements` and every derivation that takes it as a premise reports
- * here — which is what makes "the hidden nodes are named and linked" a claim
- * with a failure mode rather than a description of a list.
- *
- * @internal
- */
-export declare function validatePoster(graph: PosterGraph): PosterValidation;
-/**
- * Render the poster index as viz junctions: one box per derivation, one per
- * association, with statement ids as the round quantity nodes.
- *
- * Association ids are prefixed `assoc:` so an association and a derivation can
- * never collide on a junction id — `buildVizModel` throws on a duplicate, and
- * a thrown map is a worse diagnosis than a namespaced id.
- *
- * An association is drawn `a → b` because the renderer has only directed
- * edges. It is NOT a directed claim: the dashed style and the separate status
- * are what say so, and `Association` carries no relation to be read off it.
- *
- * @internal
- */
-export declare function posterJunctions(graph: PosterGraph): VizJunction[];
-/**
- * The poster index as this build knows it.
- *
- * ⚠ EMPTY IN THIS BUILD, and that is a recorded state rather than a mistake.
- * The sixteen entries, their derivations and their associations are the S3.3
- * deliverable (`src/atlas/poster/`), and `docs/planning/Atlas-Phase-3-Design.md`
- * §5 forbids inventing one to fill a gap: an invented entry is plausible and
- * uncheckable, which is the failure the whole design note exists to prevent.
- *
- * So the source exists, is wired, is filtered and is tested — against a fixture
- * in the tests and against this empty registry in the CLI — and it SAYS SO when
- * it renders nothing, per design note §6: *"A poster source that returns an
- * empty or partial graph must say why in the same way."* Point this at the real
- * registry when it lands; nothing else has to change.
- *
- * @internal
- */
-export declare const POSTER_GRAPH: PosterGraph;
-/**
- * One line saying what the poster source contributed and, when it contributed
- * nothing, WHY — so an empty map can never read as a complete answer.
- *
- * @internal
- */
-export declare function describePosterSource(graph: PosterGraph, validation: PosterValidation): string;
-//# sourceMappingURL=poster-source.d.ts.map

package/dist/cli/poster-source.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"poster-source.d.ts","sourceRoot":"","sources":["../../src/cli/poster-source.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACvE,OAAO,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE/D;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAC;IAC5C,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;CAC/C;AAED,sFAAsF;AACtF,MAAM,WAAW,eAAe;IAC9B,oCAAoC;IACpC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC;IAClC,mCAAmC;IACnC,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC;IAC9B;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,YAAY,CAAC;CACzC;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAC/B,+EAA+E;IAC/E,QAAQ,CAAC,QAAQ,EAAE,SAAS,eAAe,EAAE,CAAC;IAC9C;;;;;;;;;OASG;IACH,QAAQ,CAAC,8BAA8B,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3D,2EAA2E;IAC3E,QAAQ,CAAC,gBAAgB,EAAE,SAAS,WAAW,EAAE,CAAC;CACnD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,gBAAgB,CA6BnE;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,WAAW,EAAE,CAsBjE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,YAAY,EAAE,WAI1B,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,WAAW,EAClB,UAAU,EAAE,gBAAgB,GAC3B,MAAM,CA6BR"}

package/dist/cli/poster-source.js

@@ -1,184 +0,0 @@
-/**
- * The POSTER source for the physics map — turn the Atlas Phase 3 poster index
- * (statements, derivations, associations) into {@link VizJunction}s, and check
- * that every id a derivation names actually resolves.
- *
- * ## The graph this draws is NOT the catalog graph
- *
- * In the catalog map, round nodes are *quantities* and box nodes are
- * *equations*. In the poster map, round nodes are **statements** — including
- * the five hidden supporting nodes (the action principle, Noether, the full
- * Maxwell system, the Lorentz group, the central limit theorem) — and box
- * nodes are **derivations**: many premises in, one conclusion out. That is the
- * whole reason a hidden node is visible at all: it is a node because something
- * names it, not because it can be evaluated (`atlas/statement.ts`, design note
- * §1, says `ast?` is optional for exactly these five).
- *
- * It also makes {@link validatePoster} able to FAIL. A hidden node that is
- * merely listed somewhere can never be contradicted; a hidden node that two
- * derivations take as a premise is contradicted the moment the registry stops
- * defining it. Design note §9 question 4 flags the named-but-not-evaluated test
- * as the likeliest vacuous pass in this sprint — the dangling-premise check is
- * the answer to it, and its own test breaks it deliberately to prove it bites.
- *
- * ## How a poster junction meets the map's filters
- *
- * Nothing here bypasses `buildVizModel`'s filtering: these junctions are handed
- * in as `opts.extraJunctions` and are judged by the same `judge` predicate as
- * every catalog edge (design note §6). Two consequences, both deliberate:
- *
- *  - A **derivation** junction carries its `relation`, because a `Derivation`
- *    HAS one. So `--relation=derivation` selects poster derivations on recorded
- *    metadata rather than dropping them as unaudited. Reporting a relation we
- *    hold would be the fabrication's mirror image: hiding evidence we have.
- *  - An **association** junction carries NO `relation`, because an
- *    `Association` makes no relation claim at all (`atlas/association.ts`). Any
- *    `--relation` filter therefore drops it into the legend's
- *    `droppedMissingMetadata` bucket — "nobody could put the question to it" —
- *    which is the correct reading, not an oversight.
- *  - NOTHING here carries a `beId`: the poster is not the bridge catalog. Every
- *    `--evidence` filter therefore drops the whole poster source as lacking
- *    metadata, and the legend says so out loud rather than rendering an empty
- *    map as an answer.
- *
- * Poster junctions never anchor a cluster: `componentsOf` keys `anchored` on
- * `'law' | 'established'` only. That is correct — the poster index is a map of
- * claims and their supports, not an assertion that any of them is textbook
- * physics — and it is recorded here because it is a decision, not an accident.
- *
- * Pure string/record production: no I/O, no registry reads beyond what the
- * caller passes in. Imports atlas LEAF modules only, never `atlas/index.ts`.
- * Lives in `cli` because it feeds `upt map` and imports the poster registries.
- *
- * @module cli/poster-source
- */
-/**
- * Check every id the poster's derivations and associations name against the
- * statement registry.
- *
- * This is the hidden-node test's instrument. Remove `'statement-noether'` from
- * `graph.statements` and every derivation that takes it as a premise reports
- * here — which is what makes "the hidden nodes are named and linked" a claim
- * with a failure mode rather than a description of a list.
- *
- * @internal
- */
-export function validatePoster(graph) {
-    const known = new Set(graph.statements.map((s) => s.id));
-    const named = new Set();
-    const dangling = [];
-    for (const d of graph.derivations) {
-        for (const p of d.premises) {
-            named.add(p);
-            if (!known.has(p))
-                dangling.push({ derivation: d.id, missing: p, role: 'premise' });
-        }
-        named.add(d.conclusion);
-        if (!known.has(d.conclusion)) {
-            dangling.push({ derivation: d.id, missing: d.conclusion, role: 'conclusion' });
-        }
-    }
-    const unresolved = new Set();
-    for (const a of graph.associations) {
-        for (const end of a.between) {
-            named.add(end);
-            if (!known.has(end))
-                unresolved.add(end);
-        }
-    }
-    return {
-        dangling,
-        unresolvedAssociationEndpoints: [...unresolved].sort(),
-        orphanStatements: [...known].filter((id) => !named.has(id)).sort(),
-    };
-}
-/**
- * Render the poster index as viz junctions: one box per derivation, one per
- * association, with statement ids as the round quantity nodes.
- *
- * Association ids are prefixed `assoc:` so an association and a derivation can
- * never collide on a junction id — `buildVizModel` throws on a duplicate, and
- * a thrown map is a worse diagnosis than a namespaced id.
- *
- * An association is drawn `a → b` because the renderer has only directed
- * edges. It is NOT a directed claim: the dashed style and the separate status
- * are what say so, and `Association` carries no relation to be read off it.
- *
- * @internal
- */
-export function posterJunctions(graph) {
-    const out = graph.derivations.map((d) => ({
-        id: d.id,
-        label: d.id,
-        status: 'poster',
-        sources: [...d.premises],
-        target: d.conclusion,
-        // A Derivation HAS a relation; carrying it lets --relation select on
-        // recorded metadata instead of dropping the poster as unaudited.
-        relation: d.relation,
-    }));
-    for (const a of graph.associations) {
-        out.push({
-            id: `assoc:${a.id}`,
-            label: `${a.kind}: ${a.between[0]} ~ ${a.between[1]}`,
-            status: 'association',
-            sources: [a.between[0]],
-            target: a.between[1],
-            // No `relation` ON PURPOSE — see the module note.
-        });
-    }
-    return out;
-}
-/**
- * The poster index as this build knows it.
- *
- * ⚠ EMPTY IN THIS BUILD, and that is a recorded state rather than a mistake.
- * The sixteen entries, their derivations and their associations are the S3.3
- * deliverable (`src/atlas/poster/`), and `docs/planning/Atlas-Phase-3-Design.md`
- * §5 forbids inventing one to fill a gap: an invented entry is plausible and
- * uncheckable, which is the failure the whole design note exists to prevent.
- *
- * So the source exists, is wired, is filtered and is tested — against a fixture
- * in the tests and against this empty registry in the CLI — and it SAYS SO when
- * it renders nothing, per design note §6: *"A poster source that returns an
- * empty or partial graph must say why in the same way."* Point this at the real
- * registry when it lands; nothing else has to change.
- *
- * @internal
- */
-export const POSTER_GRAPH = {
-    statements: [],
-    derivations: [],
-    associations: [],
-};
-/**
- * One line saying what the poster source contributed and, when it contributed
- * nothing, WHY — so an empty map can never read as a complete answer.
- *
- * @internal
- */
-export function describePosterSource(graph, validation) {
-    if (graph.statements.length === 0 && graph.derivations.length === 0) {
-        return ('poster: EMPTY — the poster index (16 entries, their derivations and ' +
-            'associations) is not registered in this build. This is an unpopulated ' +
-            'registry, NOT a graph with nothing in it.');
-    }
-    const parts = [
-        `poster: ${graph.statements.length} statements, ` +
-            `${graph.derivations.length} derivations, ` +
-            `${graph.associations.length} associations`,
-    ];
-    if (validation.dangling.length > 0) {
-        parts.push(`⚠ ${validation.dangling.length} DANGLING ` +
-            `(${validation.dangling.map((d) => `${d.derivation}→${d.missing}`).join(', ')})`);
-    }
-    if (validation.unresolvedAssociationEndpoints.length > 0) {
-        parts.push(`${validation.unresolvedAssociationEndpoints.length} association endpoint(s) ` +
-            'outside the statement registry');
-    }
-    if (validation.orphanStatements.length > 0) {
-        parts.push(`${validation.orphanStatements.length} statement(s) named by nothing`);
-    }
-    return parts.join('; ');
-}
-//# sourceMappingURL=poster-source.js.map

package/dist/cli/poster-source.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"poster-source.js","sourceRoot":"","sources":["../../src/cli/poster-source.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAqDH;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAc,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAe,CAAC;IACrC,MAAM,QAAQ,GAAsB,EAAE,CAAC;IAEvC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACtF,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ;QACR,8BAA8B,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE;QACtD,gBAAgB,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;KACnE,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,eAAe,CAAC,KAAkB;IAChD,MAAM,GAAG,GAAkB,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACvD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,EAAE;QACX,MAAM,EAAE,QAAiB;QACzB,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;QACxB,MAAM,EAAE,CAAC,CAAC,UAAU;QACpB,qEAAqE;QACrE,iEAAiE;QACjE,QAAQ,EAAE,CAAC,CAAC,QAAQ;KACrB,CAAC,CAAC,CAAC;IACJ,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACnC,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE;YACnB,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACrD,MAAM,EAAE,aAAsB;YAC9B,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACpB,kDAAkD;SACnD,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,YAAY,GAAgB;IACvC,UAAU,EAAE,EAAE;IACd,WAAW,EAAE,EAAE;IACf,YAAY,EAAE,EAAE;CACjB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAkB,EAClB,UAA4B;IAE5B,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpE,OAAO,CACL,sEAAsE;YACtE,wEAAwE;YACxE,2CAA2C,CAC5C,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG;QACZ,WAAW,KAAK,CAAC,UAAU,CAAC,MAAM,eAAe;YAC/C,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,gBAAgB;YAC3C,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,eAAe;KAC9C,CAAC;IACF,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CACR,KAAK,UAAU,CAAC,QAAQ,CAAC,MAAM,YAAY;YACzC,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACnF,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,8BAA8B,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzD,KAAK,CAAC,IAAI,CACR,GAAG,UAAU,CAAC,8BAA8B,CAAC,MAAM,2BAA2B;YAC5E,gCAAgC,CACnC,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3C,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,gBAAgB,CAAC,MAAM,gCAAgC,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}