universal-physics-tensor 0.45.2 → 0.46.0

package/dist/atlas/association.js

@@ -0,0 +1,112 @@
+/**
+ * Atlas Phase 1 — the association registry.
+ *
+ * An `Association` records that two things SHARE something: a constant, a
+ * symbol, a structure, or a line of historical influence. That is the whole of
+ * its meaning. It asserts **no relation** between the two, makes **no
+ * composite claim**, and is explicitly NOT a graph edge — design note §5: *"No
+ * `Association` semantics beyond a registry of typed pairs — the registry is a
+ * container in Sprint 1, and it makes no composite claims."*
+ *
+ * The distinction is the point. `CATALOG_GRAPH` edges are claims that one
+ * quantity DETERMINES another. An association is the opposite epistemic act:
+ * it is where the atlas writes down a resemblance it has already decided is
+ * NOT a link, so the resemblance stops being re-surfaced as if it were fresh.
+ * An association that also appeared as an edge would be a contradiction, and
+ * `tests/atlas/association.test.ts` pins that it never does.
+ *
+ * **The seed is the `'decoy'` half of the adjudication ledger.** A `decoy`
+ * verdict means a physicist looked at `a ≟ b` and found a coincidence with no
+ * mechanism — precisely a shared appearance with no relation behind it. Every
+ * `'decoy'` row in `ADJUDICATIONS` (`src/composition/adjudication.ts`) gets
+ * one entry here, id-linked, with its `grounds` copied VERBATIM as the `note`.
+ *
+ * **No new physics is added by this module**, and two deliberate choices keep
+ * it that way:
+ *
+ *   - `note` is the adjudicator's own prose, never a restatement. Verbatimness
+ *     is pinned by test against the live ledger, so a re-worded ledger entry
+ *     fails rather than silently diverging from its copy here.
+ *   - `kind` is assigned MECHANICALLY, not per pair. Every seed is
+ *     `'shared-structure'` because every one of them reached the ledger the
+ *     same way: the identification funnel pairs quantities that share a
+ *     dimensional signature. Choosing a different `kind` per row would be a
+ *     fresh physics judgement about each pair, which is exactly the claim this
+ *     registry exists not to make.
+ *
+ * **Why the seed is written out rather than derived from `ADJUDICATIONS` at
+ * import time.** `src/composition/` may import atlas TYPES only, never the
+ * barrel, because a value import in the other direction closes a cycle
+ * `docs:deps` reports (`compose.ts` already imports `atlas/composition-table`).
+ * An `atlas → composition/adjudication → discovery → …` value import risks the
+ * same cycle from the other side. So this module stays a leaf, and the
+ * drift protection moves into the test, which is free to import both.
+ *
+ * @module atlas/association
+ */
+/**
+ * The seeded registry: one entry per `'decoy'` adjudication, in ledger order.
+ *
+ * Kept in step with `ADJUDICATIONS` by
+ * `tests/atlas/association.test.ts`, which re-derives this array from the live
+ * ledger and deep-equals it. Adding a `'decoy'` verdict without adding its
+ * association here fails that test.
+ *
+ * @internal
+ */
+export const ASSOCIATIONS = [
+    {
+        id: 'erasure-energy~photon-energy',
+        kind: 'shared-structure',
+        between: ['erasure-energy', 'photon-energy'],
+        note: "Dimensional coincidence; no mechanism. Landauer's k_B·T·ln2 is a statistical lower bound on heat dissipated to a reservoir; equating it to a single photon's hν has no universal mechanism — it rewrites thermal energy in frequency units.",
+        citation: 'docs/research/proposed-equations-adjudication.md',
+    },
+    {
+        id: 'dark-fermion-mass~erasure-energy',
+        kind: 'shared-structure',
+        between: ['dark-fermion-mass', 'erasure-energy'],
+        note: 'Dimensional coincidence; no mechanism. A speculative hidden-sector mass m = gv set equal to a context-dependent erasure energy — no model links a particle mass to an arbitrary processor\'s temperature.',
+        citation: 'docs/research/proposed-equations-adjudication.md',
+    },
+    {
+        id: 'dark-fermion-mass~rest-energy',
+        kind: 'shared-structure',
+        between: ['dark-fermion-mass', 'rest-energy'],
+        note: 'Trivial/definitional. m = vg/c² re-expresses the dark-fermion mass via E=mc² instead of via Landauer (cf. PE-2) — a definitional application, not a new bridge.',
+        citation: 'docs/research/proposed-equations-adjudication.md',
+    },
+    {
+        id: 'hubble-distance~peak-wavelength',
+        kind: 'shared-structure',
+        between: ['hubble-distance', 'peak-wavelength'],
+        note: 'Dimensional coincidence; no mechanism. A blackbody peak wavelength equated with the cosmological horizon — disparate domains, no mechanism; numerically off by ~10²⁹ for the CMB. The clearest "coincidence, not physics" case.',
+        citation: 'docs/research/proposed-equations-adjudication.md',
+    },
+    {
+        id: 'coarsening-length~quantum-correlation-length',
+        kind: 'shared-structure',
+        between: ['coarsening-length', 'quantum-correlation-length'],
+        note: 'Non-equilibrium vs equilibrium length; unanimous. A coarsening length is a non-equilibrium domain size formed by quenching through a critical point; the quantum correlation length ξ is an equilibrium static property at it. Different processes — not the same length.',
+        citation: 'docs/research/orphan-connector-adjudication.md',
+    },
+    {
+        id: 'effective-mass~tunneling-mass',
+        kind: 'shared-structure',
+        between: ['effective-mass', 'tunneling-mass'],
+        note: 'Different particles/Hamiltonians; unanimous. A proton\'s inertia in a specific biomolecular potential vs. an emergent electronic quasiparticle\'s effective mass in a strongly-correlated metal. Different particles, different Hamiltonians, unrelated scales.',
+        citation: 'docs/research/orphan-connector-adjudication.md',
+    },
+    {
+        id: 'decoherence-rate~mutation-rate',
+        kind: 'shared-structure',
+        between: ['decoherence-rate', 'mutation-rate'],
+        note: 'Same units, no shared meaning; unanimous. A decoherence rate (loss of quantum phase to the environment) vs. a mutation rate (frequency of a permanent, classical change to a DNA sequence). Same units, no shared physical meaning — decoherence may precede a mutation, but they are not one quantity.',
+        citation: 'docs/research/orphan-connector-adjudication.md',
+    },
+];
+/** Look up an association by its `candidateId`-shaped key. @internal */
+export function associationFor(id) {
+    return ASSOCIATIONS.find((a) => a.id === id);
+}
+//# sourceMappingURL=association.js.map

package/dist/atlas/association.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"association.js","sourceRoot":"","sources":["../../src/atlas/association.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAwCH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,YAAY,GAA2B;IAClD;QACE,EAAE,EAAE,8BAA8B;QAClC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,gBAAgB,EAAE,eAAe,CAAC;QAC5C,IAAI,EACF,6OAA6O;QAC/O,QAAQ,EAAE,kDAAkD;KAC7D;IACD;QACE,EAAE,EAAE,kCAAkC;QACtC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,mBAAmB,EAAE,gBAAgB,CAAC;QAChD,IAAI,EACF,2MAA2M;QAC7M,QAAQ,EAAE,kDAAkD;KAC7D;IACD;QACE,EAAE,EAAE,+BAA+B;QACnC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,mBAAmB,EAAE,aAAa,CAAC;QAC7C,IAAI,EACF,iKAAiK;QACnK,QAAQ,EAAE,kDAAkD;KAC7D;IACD;QACE,EAAE,EAAE,iCAAiC;QACrC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;QAC/C,IAAI,EACF,iOAAiO;QACnO,QAAQ,EAAE,kDAAkD;KAC7D;IACD;QACE,EAAE,EAAE,8CAA8C;QAClD,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,mBAAmB,EAAE,4BAA4B,CAAC;QAC5D,IAAI,EACF,2QAA2Q;QAC7Q,QAAQ,EAAE,gDAAgD;KAC3D;IACD;QACE,EAAE,EAAE,+BAA+B;QACnC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,gBAAgB,EAAE,gBAAgB,CAAC;QAC7C,IAAI,EACF,iQAAiQ;QACnQ,QAAQ,EAAE,gDAAgD;KAC3D;IACD;QACE,EAAE,EAAE,gCAAgC;QACpC,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,kBAAkB,EAAE,eAAe,CAAC;QAC9C,IAAI,EACF,ySAAyS;QAC3S,QAAQ,EAAE,gDAAgD;KAC3D;CACF,CAAC;AAEF,wEAAwE;AACxE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAC/C,CAAC"}

package/dist/atlas/benchmark/backend-shapes.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Atlas Phase 5, S5.3 — request and response SHAPES for the out-of-process
+ * conditions (embeddings, LLMs).
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Only the shapes and a strict response parser live here. The process plumbing
+ * is the probe's existing NDJSON worker protocol
+ * (`src/composition/probe/backend-protocol.ts`): argv spawn, no shell, timeout,
+ * schema-validated output. **A malformed response is an ERROR, never a
+ * default:** an outcome that defaulted to `'abstain'` would credit a broken
+ * worker with the benchmark's preferred behaviour.
+ *
+ * @module atlas/benchmark/backend-shapes
+ * @internal
+ */
+import type { RelationType } from '../types.js';
+/** What an out-of-process condition is asked. @internal */
+export interface BenchmarkBackendRequest {
+    readonly itemId: string;
+    /** `classify`: judge the claim. `retrieve`: rank `corpusIds` for it. */
+    readonly task: 'classify' | 'retrieve';
+    readonly premises: readonly string[];
+    readonly conclusion: string;
+    readonly claimedRelation: RelationType;
+    /** Required for `retrieve`: the records to rank. */
+    readonly corpusIds?: readonly string[];
+    readonly budgetMs: number;
+}
+/** What it answers. Exactly one of `outcome` or `ranking`, matching the task. @internal */
+export interface BenchmarkBackendResponse {
+    readonly itemId: string;
+    readonly outcome?: 'accept' | 'reject' | 'abstain';
+    readonly ranking?: readonly string[];
+}
+/** A response that failed validation, with every reason. @internal */
+export interface BackendShapeError {
+    readonly error: string;
+}
+/**
+ * Validate one parsed response against the request it answers.
+ *
+ * @returns the response, or an error naming every problem. Never throws.
+ * @internal
+ */
+export declare function parseBackendResponse(request: BenchmarkBackendRequest, value: unknown): BenchmarkBackendResponse | BackendShapeError;
+//# sourceMappingURL=backend-shapes.d.ts.map

package/dist/atlas/benchmark/backend-shapes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backend-shapes.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/backend-shapes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,2DAA2D;AAC3D,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wEAAwE;IACxE,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAAC;IACvC,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,eAAe,EAAE,YAAY,CAAC;IACvC,oDAAoD;IACpD,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,2FAA2F;AAC3F,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;IACnD,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAED,sEAAsE;AACtE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAID;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,uBAAuB,EAChC,KAAK,EAAE,OAAO,GACb,wBAAwB,GAAG,iBAAiB,CAwB9C"}

package/dist/atlas/benchmark/backend-shapes.js

@@ -0,0 +1,58 @@
+/**
+ * Atlas Phase 5, S5.3 — request and response SHAPES for the out-of-process
+ * conditions (embeddings, LLMs).
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Only the shapes and a strict response parser live here. The process plumbing
+ * is the probe's existing NDJSON worker protocol
+ * (`src/composition/probe/backend-protocol.ts`): argv spawn, no shell, timeout,
+ * schema-validated output. **A malformed response is an ERROR, never a
+ * default:** an outcome that defaulted to `'abstain'` would credit a broken
+ * worker with the benchmark's preferred behaviour.
+ *
+ * @module atlas/benchmark/backend-shapes
+ * @internal
+ */
+const OUTCOMES = new Set(['accept', 'reject', 'abstain']);
+/**
+ * Validate one parsed response against the request it answers.
+ *
+ * @returns the response, or an error naming every problem. Never throws.
+ * @internal
+ */
+export function parseBackendResponse(request, value) {
+    const problems = [];
+    if (value === null || typeof value !== 'object')
+        return { error: 'response is not an object' };
+    const v = value;
+    if (v['itemId'] !== request.itemId)
+        problems.push(`itemId ${String(v['itemId'])} ≠ ${request.itemId}`);
+    if (request.task === 'classify') {
+        if (typeof v['outcome'] !== 'string' || !OUTCOMES.has(v['outcome'])) {
+            problems.push('classify needs outcome ∈ {accept, reject, abstain}');
+        }
+        if (v['ranking'] !== undefined)
+            problems.push('classify must not carry a ranking');
+    }
+    else {
+        const r = v['ranking'];
+        if (!Array.isArray(r) || !r.every((x) => typeof x === 'string')) {
+            problems.push('retrieve needs ranking: string[]');
+        }
+        else {
+            const allowed = new Set(request.corpusIds ?? []);
+            const unknown = r.filter((x) => !allowed.has(x));
+            if (unknown.length > 0)
+                problems.push(`ranking names ids outside the corpus: ${unknown.join(', ')}`);
+            if (new Set(r).size !== r.length)
+                problems.push('ranking repeats an id');
+        }
+        if (v['outcome'] !== undefined)
+            problems.push('retrieve must not carry an outcome');
+    }
+    if (problems.length > 0)
+        return { error: problems.join('; ') };
+    return v;
+}
+//# sourceMappingURL=backend-shapes.js.map

package/dist/atlas/benchmark/backend-shapes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backend-shapes.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/backend-shapes.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AA6BH,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAgC,EAChC,KAAc;IAEd,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,KAAK,EAAE,2BAA2B,EAAE,CAAC;IAC/F,MAAM,CAAC,GAAG,KAAgC,CAAC;IAC3C,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM;QAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACvG,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;YACpE,QAAQ,CAAC,IAAI,CAAC,oDAAoD,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,SAAS;YAAE,QAAQ,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YAChE,QAAQ,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;YAC3D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,yCAAyC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrG,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM;gBAAE,QAAQ,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,SAAS;YAAE,QAAQ,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;IACtF,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC/D,OAAO,CAAwC,CAAC;AAClD,CAAC"}

package/dist/atlas/benchmark/baselines.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Atlas Phase 5, S5.3 — the deterministic, in-tree BASELINE conditions and the
+ * recall-at-depth-k scorer.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Each baseline ranks a reference corpus against a query. The pre-registered
+ * criterion is recall at depth 10 against embeddings, so a baseline is scored by
+ * whether the correct reference lands in its top k. Three baselines, in rising
+ * order of structure:
+ *
+ * - **text retrieval** — Jaccard overlap of lower-cased word tokens;
+ * - **symbol matching** — Jaccard overlap of the expression's symbol names;
+ * - **typed structural search** — exact agreement of the leakage key
+ *   (dimension-renamed normal form), then symbol overlap as the tie-break.
+ *
+ * **Every ranking is fully deterministic:** ties break on the reference id, so a
+ * rerun can never reorder a tie and move a result across the depth cut.
+ *
+ * Embeddings and LLM conditions run OUT OF PROCESS; `backend-shapes.ts` holds
+ * only their request and response shapes.
+ *
+ * @module atlas/benchmark/baselines
+ * @internal
+ */
+import type { ExprNode } from '../../dimensional/ast-types.js';
+/** One record a baseline can retrieve. @internal */
+export interface CorpusRecord {
+    readonly id: string;
+    readonly text: string;
+    readonly expr?: ExprNode;
+}
+/** A query: an item's text and, when it has one, its expression. @internal */
+export interface RetrievalQuery {
+    readonly text: string;
+    readonly expr?: ExprNode;
+}
+/** A ranking: reference ids, best first. @internal */
+export type Ranking = readonly string[];
+/** Baseline 1: text retrieval by word-token overlap. @internal */
+export declare function rankByTextOverlap(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/** Baseline 2: symbol matching by overlap of expression symbol names. @internal */
+export declare function rankBySymbolOverlap(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/**
+ * Baseline 3: typed structural search. A record whose leakage key equals the
+ * query's scores above every record that does not; symbol overlap orders within
+ * each tier. A query or record with no expression scores zero structurally.
+ *
+ * @internal
+ */
+export declare function rankByStructure(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/**
+ * Recall at depth k: the fraction of queries for which AT LEAST ONE correct
+ * reference appears in the top k of its ranking.
+ *
+ * A query with no ranking counts as a MISS, never as absent from the
+ * denominator: dropping it would raise recall by failing to answer. A query with
+ * no correct reference in `truth` is an error in the answer key, and throws.
+ *
+ * @throws Error if `truth` lists no correct reference for some query.
+ * @internal
+ */
+export declare function recallAtK(rankings: ReadonlyMap<string, Ranking>, truth: ReadonlyMap<string, readonly string[]>, k?: number): number;
+//# sourceMappingURL=baselines.d.ts.map

package/dist/atlas/benchmark/baselines.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baselines.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/baselines.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAG/D,oDAAoD;AACpD,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CAC1B;AAED,8EAA8E;AAC9E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CAC1B;AAED,sDAAsD;AACtD,MAAM,MAAM,OAAO,GAAG,SAAS,MAAM,EAAE,CAAC;AAqCxC,kEAAkE;AAClE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAGjG;AAED,mFAAmF;AACnF,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAGnG;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAO/F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,EACtC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,EAC7C,CAAC,SAAK,GACL,MAAM,CASR"}

package/dist/atlas/benchmark/baselines.js

@@ -0,0 +1,112 @@
+/**
+ * Atlas Phase 5, S5.3 — the deterministic, in-tree BASELINE conditions and the
+ * recall-at-depth-k scorer.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Each baseline ranks a reference corpus against a query. The pre-registered
+ * criterion is recall at depth 10 against embeddings, so a baseline is scored by
+ * whether the correct reference lands in its top k. Three baselines, in rising
+ * order of structure:
+ *
+ * - **text retrieval** — Jaccard overlap of lower-cased word tokens;
+ * - **symbol matching** — Jaccard overlap of the expression's symbol names;
+ * - **typed structural search** — exact agreement of the leakage key
+ *   (dimension-renamed normal form), then symbol overlap as the tie-break.
+ *
+ * **Every ranking is fully deterministic:** ties break on the reference id, so a
+ * rerun can never reorder a tie and move a result across the depth cut.
+ *
+ * Embeddings and LLM conditions run OUT OF PROCESS; `backend-shapes.ts` holds
+ * only their request and response shapes.
+ *
+ * @module atlas/benchmark/baselines
+ * @internal
+ */
+import { leakageKey } from './leakage.js';
+const tokens = (text) => new Set(text
+    .toLowerCase()
+    .split(/[^\p{L}\p{N}]+/u)
+    .filter((t) => t.length > 0));
+const jaccard = (a, b) => {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let inter = 0;
+    for (const x of a)
+        if (b.has(x))
+            inter++;
+    return inter / (a.size + b.size - inter);
+};
+function symbolNames(node, out = new Set()) {
+    if (node === undefined)
+        return out;
+    if (node.kind === 'symbol') {
+        // Numeric literals are not symbols a reader would match on.
+        if (!Number.isFinite(Number(node.name)))
+            out.add(node.name);
+        return out;
+    }
+    if (node.kind === 'op')
+        for (const a of node.args)
+            symbolNames(a, out);
+    else if (node.kind === 'transcendental' || node.kind === 'abs')
+        symbolNames(node.arg, out);
+    return out;
+}
+/** Rank by descending score, ties broken by ascending id — never by input order. */
+function rankBy(corpus, score) {
+    return corpus
+        .map((r) => ({ id: r.id, s: score(r) }))
+        .sort((a, b) => (b.s !== a.s ? b.s - a.s : a.id < b.id ? -1 : a.id > b.id ? 1 : 0))
+        .map((x) => x.id);
+}
+/** Baseline 1: text retrieval by word-token overlap. @internal */
+export function rankByTextOverlap(query, corpus) {
+    const q = tokens(query.text);
+    return rankBy(corpus, (r) => jaccard(q, tokens(r.text)));
+}
+/** Baseline 2: symbol matching by overlap of expression symbol names. @internal */
+export function rankBySymbolOverlap(query, corpus) {
+    const q = symbolNames(query.expr);
+    return rankBy(corpus, (r) => jaccard(q, symbolNames(r.expr)));
+}
+/**
+ * Baseline 3: typed structural search. A record whose leakage key equals the
+ * query's scores above every record that does not; symbol overlap orders within
+ * each tier. A query or record with no expression scores zero structurally.
+ *
+ * @internal
+ */
+export function rankByStructure(query, corpus) {
+    const qKey = query.expr === undefined ? undefined : leakageKey(query.expr);
+    const qSyms = symbolNames(query.expr);
+    return rankBy(corpus, (r) => {
+        const structural = qKey !== undefined && r.expr !== undefined && leakageKey(r.expr) === qKey ? 1 : 0;
+        return 2 * structural + jaccard(qSyms, symbolNames(r.expr));
+    });
+}
+/**
+ * Recall at depth k: the fraction of queries for which AT LEAST ONE correct
+ * reference appears in the top k of its ranking.
+ *
+ * A query with no ranking counts as a MISS, never as absent from the
+ * denominator: dropping it would raise recall by failing to answer. A query with
+ * no correct reference in `truth` is an error in the answer key, and throws.
+ *
+ * @throws Error if `truth` lists no correct reference for some query.
+ * @internal
+ */
+export function recallAtK(rankings, truth, k = 10) {
+    if (truth.size === 0)
+        return Number.NaN;
+    let hits = 0;
+    for (const [queryId, correct] of truth) {
+        if (correct.length === 0)
+            throw new Error(`recallAtK: no correct reference for ${queryId}`);
+        const top = (rankings.get(queryId) ?? []).slice(0, k);
+        if (correct.some((c) => top.includes(c)))
+            hits++;
+    }
+    return hits / truth.size;
+}
+//# sourceMappingURL=baselines.js.map

package/dist/atlas/benchmark/baselines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"baselines.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/baselines.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAkB1C,MAAM,MAAM,GAAG,CAAC,IAAY,EAAe,EAAE,CAC3C,IAAI,GAAG,CACL,IAAI;KACD,WAAW,EAAE;KACb,KAAK,CAAC,iBAAiB,CAAC;KACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;AAEJ,MAAM,OAAO,GAAG,CAAC,CAAsB,EAAE,CAAsB,EAAU,EAAE;IACzE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IACzC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAC3C,CAAC,CAAC;AAEF,SAAS,WAAW,CAAC,IAA0B,EAAE,GAAG,GAAG,IAAI,GAAG,EAAU;IACtE,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACnC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,4DAA4D;QAC5D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SAClE,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,oFAAoF;AACpF,SAAS,MAAM,CAAC,MAA+B,EAAE,KAAkC;IACjF,OAAO,MAAM;SACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,iBAAiB,CAAC,KAAqB,EAAE,MAA+B;IACtF,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,mBAAmB,CAAC,KAAqB,EAAE,MAA+B;IACxF,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAqB,EAAE,MAA+B;IACpF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,UAAU,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrG,OAAO,CAAC,GAAG,UAAU,GAAG,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CACvB,QAAsC,EACtC,KAA6C,EAC7C,CAAC,GAAG,EAAE;IAEN,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,OAAO,EAAE,CAAC,CAAC;QAC5F,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,IAAI,EAAE,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AAC3B,CAAC"}

package/dist/atlas/benchmark/leakage.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Atlas Phase 5, S5.1 — leakage checks for the invalid-bridge benchmark.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §3.
+ *
+ * ## Why not `normalForm` directly
+ *
+ * The plan said renamed-variable variants "are detected as the same item by
+ * normal form". `normalForm` keys symbols by NAME, so `x/t` and `y/s` do not
+ * collide (measured). {@link leakageKey} therefore renames every DIMENSIONED
+ * symbol to its dimension signature first. That over-merges genuinely different
+ * quantities of one dimension, which is the SAFE direction for leakage: a false
+ * collision is flagged and reviewed, a missed one contaminates the study.
+ *
+ * @module atlas/benchmark/leakage
+ * @internal
+ */
+import type { ExprNode } from '../../dimensional/ast-types.js';
+import type { BenchmarkItem } from './types.js';
+/**
+ * The key under which two items count as the same claim: the normal form of the
+ * expression after renaming dimensioned symbols by dimension.
+ *
+ * @internal
+ */
+export declare function leakageKey(expr: ExprNode): string;
+/** A pair of items that share a leakage key. @internal */
+export interface LeakageCollision {
+    readonly key: string;
+    readonly ids: readonly string[];
+    /** The splits the colliding items sit in. More than one ⇒ LEAKAGE. */
+    readonly splits: readonly string[];
+}
+/**
+ * Group items by leakage key and report every group whose members span MORE THAN
+ * ONE split. Such a group means the held-out split contains a claim the
+ * in-distribution split already shows, under the same or different names.
+ *
+ * @internal
+ */
+export declare function findCrossSplitLeakage(items: readonly BenchmarkItem[]): LeakageCollision[];
+/** A renamed-variable variant that violates the same-split or same-key rule. @internal */
+export interface VariantProblem {
+    readonly id: string;
+    readonly of: string;
+    readonly problem: 'missing-original' | 'different-split' | 'not-same-claim';
+}
+/**
+ * Check every `renamedVariant` link: the original exists, sits in the SAME split,
+ * and genuinely has the same leakage key (a "variant" that is a different claim
+ * is mislabelled, and the label would hide a real item).
+ *
+ * @internal
+ */
+export declare function checkRenamedVariants(items: readonly BenchmarkItem[]): VariantProblem[];
+//# sourceMappingURL=leakage.d.ts.map

package/dist/atlas/benchmark/leakage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leakage.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/leakage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAE/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AA2BhD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAED,0DAA0D;AAC1D,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAczF;AAED,0FAA0F;AAC1F,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,kBAAkB,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;CAC7E;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,cAAc,EAAE,CAetF"}

package/dist/atlas/benchmark/leakage.js

@@ -0,0 +1,100 @@
+/**
+ * Atlas Phase 5, S5.1 — leakage checks for the invalid-bridge benchmark.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §3.
+ *
+ * ## Why not `normalForm` directly
+ *
+ * The plan said renamed-variable variants "are detected as the same item by
+ * normal form". `normalForm` keys symbols by NAME, so `x/t` and `y/s` do not
+ * collide (measured). {@link leakageKey} therefore renames every DIMENSIONED
+ * symbol to its dimension signature first. That over-merges genuinely different
+ * quantities of one dimension, which is the SAFE direction for leakage: a false
+ * collision is flagged and reviewed, a missed one contaminates the study.
+ *
+ * @module atlas/benchmark/leakage
+ * @internal
+ */
+import { normalForm } from '../../canonical/normal-form.js';
+const isDimensionless = (d) => d.L === 0 && d.M === 0 && d.T === 0 && d.I === 0 && d.Theta === 0 && d.N === 0 && d.J === 0;
+const dimensionName = (d) => `dim[${d.L},${d.M},${d.T},${d.I},${d.Theta},${d.N},${d.J}]`;
+/**
+ * Rename every dimensioned symbol leaf to its dimension signature. Dimensionless
+ * leaves keep their names: `normalForm` already drops recognised constants and
+ * tags unknown dimensionless stubs, and a numeric literal must stay a literal.
+ */
+function renameByDimension(node) {
+    if (node.kind === 'symbol') {
+        return isDimensionless(node.dim) ? node : { ...node, name: dimensionName(node.dim) };
+    }
+    if (node.kind === 'op')
+        return { ...node, args: node.args.map(renameByDimension) };
+    if (node.kind === 'transcendental' || node.kind === 'abs') {
+        return { ...node, arg: renameByDimension(node.arg) };
+    }
+    // Other arms (integral, derivative, tensor nodes) are compared as normalForm
+    // compares them — structurally, names included. Stated, not hidden: a renamed
+    // variant INSIDE an integral is not caught by this key.
+    return node;
+}
+/**
+ * The key under which two items count as the same claim: the normal form of the
+ * expression after renaming dimensioned symbols by dimension.
+ *
+ * @internal
+ */
+export function leakageKey(expr) {
+    return normalForm(renameByDimension(expr));
+}
+/**
+ * Group items by leakage key and report every group whose members span MORE THAN
+ * ONE split. Such a group means the held-out split contains a claim the
+ * in-distribution split already shows, under the same or different names.
+ *
+ * @internal
+ */
+export function findCrossSplitLeakage(items) {
+    const groups = new Map();
+    for (const item of items) {
+        const key = leakageKey(item.expr);
+        const bucket = groups.get(key);
+        if (bucket === undefined)
+            groups.set(key, [item]);
+        else
+            bucket.push(item);
+    }
+    const out = [];
+    for (const [key, bucket] of groups) {
+        const splits = [...new Set(bucket.map((i) => i.split))].sort();
+        if (splits.length > 1)
+            out.push({ key, ids: bucket.map((i) => i.id), splits });
+    }
+    return out;
+}
+/**
+ * Check every `renamedVariant` link: the original exists, sits in the SAME split,
+ * and genuinely has the same leakage key (a "variant" that is a different claim
+ * is mislabelled, and the label would hide a real item).
+ *
+ * @internal
+ */
+export function checkRenamedVariants(items) {
+    const byId = new Map(items.map((i) => [i.id, i]));
+    const out = [];
+    for (const item of items) {
+        if (item.renamedVariant === undefined)
+            continue;
+        const original = byId.get(item.renamedVariant);
+        if (original === undefined) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'missing-original' });
+        }
+        else if (original.split !== item.split) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'different-split' });
+        }
+        else if (leakageKey(original.expr) !== leakageKey(item.expr)) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'not-same-claim' });
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=leakage.js.map

package/dist/atlas/benchmark/leakage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leakage.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/leakage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAK5D,MAAM,eAAe,GAAG,CAAC,CAAY,EAAW,EAAE,CAChD,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE9F,MAAM,aAAa,GAAG,CAAC,CAAY,EAAU,EAAE,CAC7C,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AAE9D;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,OAAO,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACvF,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,CAAC;IACnF,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1D,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACvD,CAAC;IACD,6EAA6E;IAC7E,8EAA8E;IAC9E,wDAAwD;IACxD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,OAAO,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7C,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA+B;IACnE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;;YAC7C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAA+B;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS;YAAE,SAAS;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAClF,CAAC;aAAM,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC;QACjF,CAAC;aAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/atlas/benchmark/loader.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Atlas Phase 5, S5.1 — load and validate benchmark items.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §0, §2.
+ *
+ * This module reads the PUBLIC half of a benchmark directory and nothing else.
+ * The answers live in a sibling half that no `src/` file may read;
+ * `tests/atlas/benchmark.test.ts` holds the import guard, with a positive
+ * control proving the guard can fire.
+ *
+ * **The loader enforces the one part of the independence rule that code CAN
+ * enforce: a frozen item whose `authorship` is not `'independent'` is refused.**
+ * Whether the author really was independent is a fact about people, recorded in
+ * the pre-registration note and checked by review.
+ *
+ * @module atlas/benchmark/loader
+ * @internal
+ */
+import type { BenchmarkItem } from './types.js';
+/** One reason an item set is not admissible. @internal */
+export interface ItemProblem {
+    readonly id: string;
+    readonly problem: string;
+}
+/**
+ * Validate an item set against the schema and the rules that make it a benchmark.
+ *
+ * @param items - the items, as parsed.
+ * @param frozen - true for the frozen set (authorship must be `'independent'`),
+ * false for the contested staging area (authorship must be `'contested-draft'`).
+ * @returns every problem found; empty means admissible. Never throws, so a
+ * caller sees ALL problems at once rather than the first.
+ * @internal
+ */
+export declare function validateItems(items: readonly BenchmarkItem[], frozen: boolean): ItemProblem[];
+/** Thrown when a benchmark directory holds an inadmissible item set. @internal */
+export declare class BenchmarkAdmissionError extends Error {
+    readonly problems: readonly ItemProblem[];
+    constructor(problems: readonly ItemProblem[]);
+}
+/**
+ * Load the FROZEN items from `<benchmarkDir>/public/items.json`.
+ *
+ * @throws BenchmarkAdmissionError when any item is inadmissible — a frozen set
+ * with one contested draft in it is not a smaller benchmark, it is a broken one.
+ * @internal
+ */
+export declare function loadFrozenItems(benchmarkDir: string): BenchmarkItem[];
+/**
+ * Load the CONTESTED drafts from `<benchmarkDir>/contested/items.json`. These are
+ * never scored; they wait for an independent author to accept or rewrite them.
+ *
+ * @internal
+ */
+export declare function loadContestedDrafts(benchmarkDir: string): BenchmarkItem[];
+//# sourceMappingURL=loader.d.ts.map