universal-physics-tensor 10.0.0 → 12.0.0

package/data/bridge-catalog.schema.json

@@ -1,7 +1,7 @@
 {
   "$schema": "http://json-schema.org/draft-07/schema#",
   "title": "UPT Bridge Catalog Artifact",
-  "description": "The bridge catalog. data/bridge-catalog.json is the source; src/bridges/catalog-load.ts (and the dimension projection in src/dimensional/bridge-check.ts, through the same src/core/data-file.ts reader) validates it against this schema when it loads, with the keyword subset src/core/json-schema.ts reads, then derives each relation's confidence from its row and the sign clauses from the evaluator flags. type is required on every record. formalRef is derived from formalKey and is not stored. Every field declared here has a reader in src/; a field nothing reads is not declared.",
+  "description": "The bridge catalog. data/bridge-catalog.json is the source; src/bridges/catalog-load.ts (and the dimension projection in src/dimensional/bridge-check.ts, through the same src/core/data-file.ts reader) validates it against this schema when it loads, with the keyword subset src/core/json-schema.ts reads, then derives each relation's confidence from its row and the sign clauses from the evaluator flags. type is required on every record. formalRef is derived from formalKey and is not stored; theorem and proofStatus are its checked projections (catalogProofProblems). Every field declared here has a reader in src/; a field nothing reads is not declared.",
   "type": "object",
   "required": [
     "schemaVersion",
@@ -271,7 +271,8 @@
           "references",
           "dependencies",
           "known_issues",
-          "notes"
+          "notes",
+          "proofStatus"
         ],
         "additionalProperties": false,
         "properties": {
@@ -313,6 +314,14 @@
               "invalid"
             ]
           },
+          "proofStatus": {
+            "enum": [
+              "full",
+              "weak",
+              "pending"
+            ],
+            "description": "How far lean/ proves this record, best first: full (its Lean theorem is kind bridge and reviewed: it states the catalogued equation, and the catalog path passes it to deriveEvidence), weak (its theorem proves part of the equation: a derivation-step, limit, reduction, property or cross-check, or its row is unreviewed), pending (no Lean theorem; no formalKey). A projection of formalKey and formal/lean/manifest.json, checked by catalogProofProblems (src/atlas/catalog-formal-ref.ts) in tests/atlas/catalog-proof-status.test.ts and in the formalRef gate; it is never set by hand to anything else."
+          },
           "formula_latex": {
             "type": [
               "string",
@@ -421,7 +430,12 @@
           "formalKey": {
             "type": "string",
             "pattern": "^be-[a-z0-9-]+$",
-            "description": "The PhysJS manifest key. formalRef, its kind included, is read from that manifest entry. The catalog stores no kind of its own."
+            "description": "The key of this record's entry in formal/lean/manifest.json. formalRef, its kind included, is read from that manifest entry. The catalog stores no kind of its own."
+          },
+          "theorem": {
+            "type": "string",
+            "pattern": "^PhysJS(\\.[A-Za-z_][A-Za-z0-9_']*)+$",
+            "description": "The Lean theorem the manifest entry of formalKey names, declared in lean/ (formal/lean/theorem-files.json gives the file). Present exactly when formalKey is. catalogFormalRef refuses a record whose theorem is not the manifest's; tests/atlas/catalog-proof-status.test.ts checks every record."
           },
           "dimension": {
             "type": "object"
@@ -547,6 +561,34 @@
             "const": true,
             "description": "The row's adjudication is contested (recorded in the negative catalog's commentary); it stays out of the null-result list until a membership rejection or a confrontation adjudicates it."
           }
+        },
+        "if": {
+          "required": [
+            "formalKey"
+          ]
+        },
+        "then": {
+          "required": [
+            "theorem"
+          ],
+          "properties": {
+            "proofStatus": {
+              "enum": [
+                "full",
+                "weak"
+              ]
+            }
+          }
+        },
+        "else": {
+          "propertyNames": {
+            "pattern": "^(?!theorem$)"
+          },
+          "properties": {
+            "proofStatus": {
+              "const": "pending"
+            }
+          }
         }
       }
     },
@@ -565,7 +607,6 @@
           "sources",
           "aliases",
           "holds",
-          "domain",
           "citation"
         ],
         "additionalProperties": false,
@@ -618,9 +659,6 @@
             "type": "string",
             "minLength": 1
           },
-          "domain": {
-            "type": "string"
-          },
           "confidence": {
             "enum": [
               "established",

package/data/units.json

@@ -627,7 +627,8 @@
     },
     {
       "symbols": [
-        "arcsec"
+        "arcsec",
+        "arcsecond"
       ],
       "scale": "pi/648000",
       "dimension": {},
@@ -1058,33 +1059,13 @@
     }
   ],
   "refused": [
-    {
-      "symbol": "dB",
-      "reason": "dB is a logarithmic unit; give the quantity in its linear unit, or a reference level"
-    },
-    {
-      "symbol": "dBm",
-      "reason": "dBm is a logarithmic unit (decibels over 1 mW); give watts"
-    },
-    {
-      "symbol": "dBW",
-      "reason": "dBW is a logarithmic unit (decibels over 1 W); give watts"
-    },
-    {
-      "symbol": "Np",
-      "reason": "Np is a logarithmic unit (the neper); give the quantity in its linear unit, or a reference level"
-    },
-    {
-      "symbol": "Mach",
-      "reason": "Mach is a ratio to the local speed of sound; give m/s, or the ratio as a bare number"
-    },
-    {
-      "symbol": "mach",
-      "reason": "mach is a ratio to the local speed of sound; give m/s, or the ratio as a bare number"
-    },
     {
       "symbol": "ton",
       "reason": "'ton' is ambiguous: short ton (907.185 kg), long ton (1016.047 kg), or metric tonne (1000 kg); write tonne"
+    },
+    {
+      "symbol": "tons",
+      "reason": "'tons' is ambiguous: short ton (907.185 kg), long ton (1016.047 kg), or metric tonne (1000 kg); write tonne"
     }
   ],
   "prefixLetterUnits": {

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

@@ -1 +1 @@
-{"version":3,"file":"applicability.d.ts","sourceRoot":"","sources":["../../src/atlas/applicability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAG9C,qFAAqF;AACrF,MAAM,MAAM,qBAAqB,GAAG,UAAU,GAAG,UAAU,CAAC;AAE5D;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GAChC,2BAA2B,GAC3B,qBAAqB,GACrB,uBAAuB,GACvB,oBAAoB,GACpB,kBAAkB,GAClB,yBAAyB,GACzB,uBAAuB,CAAC;AAE5B,+EAA+E;AAC/E,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,IAAI,EAAE,wBAAwB,CAAC;IACxC,QAAQ,CAAC,QAAQ,EAAE,qBAAqB,CAAC;IACzC,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAkB;IACjC,6DAA6D;IAC7D,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;IACxB,yFAAyF;IACzF,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,iDAAiD;IACjD,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC;IAC1C,oDAAoD;IACpD,QAAQ,CAAC,qBAAqB,CAAC,EAAE,WAAW,CAAC;IAC7C,iCAAiC;IACjC,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,UAAU,EAAE,CAAC;IAC1C,kCAAkC;IAClC,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,CAAC;IACjC;;;OAGG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;CACnE;AAgMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,kBAAkB,GACxB,SAAS,oBAAoB,EAAE,CAkFjC;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,oBAAoB,EAAE,GACxC,SAAS,oBAAoB,EAAE,CAEjC"}
+{"version":3,"file":"applicability.d.ts","sourceRoot":"","sources":["../../src/atlas/applicability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAI9C,qFAAqF;AACrF,MAAM,MAAM,qBAAqB,GAAG,UAAU,GAAG,UAAU,CAAC;AAE5D;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GAChC,2BAA2B,GAC3B,qBAAqB,GACrB,uBAAuB,GACvB,oBAAoB,GACpB,kBAAkB,GAClB,yBAAyB,GACzB,uBAAuB,CAAC;AAE5B,+EAA+E;AAC/E,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,IAAI,EAAE,wBAAwB,CAAC;IACxC,QAAQ,CAAC,QAAQ,EAAE,qBAAqB,CAAC;IACzC,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAkB;IACjC,6DAA6D;IAC7D,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;IACxB,yFAAyF;IACzF,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,iDAAiD;IACjD,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC;IAC1C,oDAAoD;IACpD,QAAQ,CAAC,qBAAqB,CAAC,EAAE,WAAW,CAAC;IAC7C,iCAAiC;IACjC,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,UAAU,EAAE,CAAC;IAC1C,kCAAkC;IAClC,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,CAAC;IACjC;;;OAGG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;CACnE;AAwMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,kBAAkB,GACxB,SAAS,oBAAoB,EAAE,CAkFjC;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,oBAAoB,EAAE,GACxC,SAAS,oBAAoB,EAAE,CAEjC"}

package/dist/atlas/applicability.js

@@ -31,6 +31,7 @@
  */
 import { validate } from '../dimensional/validator.js';
 import { checkConventions, unknownConventionKeys } from './conventions.js';
+import { forEachScalarLeaf, isDecimalLiteral, literalValue as leafLiteral } from '../dimensional/ast-leaves.js';
 /**
  * Non-vanishing markers a side condition may use. Matched case-insensitively
  * against the side-condition prose.
@@ -55,14 +56,21 @@ const NONVANISHING_MARKERS = [
     '>0',
     'positive',
 ];
-/** Free symbol names appearing anywhere in a subtree. */
+/**
+ * The arms this checker descends into: every scalar child {@link childNodes} lists, and no
+ * tensor-product argument (a tensor node has no children here).
+ */
+const SCALAR_ARMS = {
+    transcendental: true,
+    abs: true,
+    diracDelta: true,
+    integral: 'all',
+    derivative: true,
+    variationalDerivative: true,
+};
+/** Symbol names (literals included, as a divisor's names always were) appearing anywhere in a subtree. */
 function symbolNames(node, into = new Set()) {
-    if (node.kind === 'symbol') {
-        into.add(node.name);
-        return into;
-    }
-    for (const child of childNodes(node))
-        symbolNames(child, into);
+    forEachScalarLeaf(node, (leaf) => into.add(leaf.name), SCALAR_ARMS);
     return into;
 }
 /**
@@ -96,17 +104,15 @@ function childNodes(node) {
 /**
  * The numeric value of a leaf that IS a literal, or `null`.
  *
- * Literals are `symbol` leaves whose `name` parses as a number — the same
- * convention `validator.ts` uses to recognise a literal exponent, so the two
- * cannot disagree about what a literal is.
+ * Literals are `symbol` leaves whose `name` is a decimal literal under the one
+ * rule (`isDecimalLiteral`, `dimensional/ast-leaves.ts`, the validator's), and
+ * whose value is finite.
  */
 function literalValue(node) {
-    if (node.kind !== 'symbol')
-        return null;
-    if (node.name.trim() === '')
+    if (node.kind !== 'symbol' || !isDecimalLiteral(node.name))
         return null;
-    const v = Number(node.name);
-    return Number.isFinite(v) ? v : null;
+    const v = leafLiteral(node);
+    return v !== undefined && Number.isFinite(v) ? v : null;
 }
 /** The word-like tokens of a side condition: runs of letters, digits and underscores, lower-cased. */
 function wordTokens(text) {

package/dist/atlas/applicability.js.map

@@ -1 +1 @@
-{"version":3,"file":"applicability.js","sourceRoot":"","sources":["../../src/atlas/applicability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAGvD,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AA6D3E;;;;;;;;;GASG;AACH,MAAM,oBAAoB,GAAsB;IAC9C,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,KAAK;IACL,SAAS;IACT,UAAU;IACV,UAAU;IACV,KAAK;IACL,IAAI;IACJ,UAAU;CACX,CAAC;AAEF,yDAAyD;AACzD,SAAS,WAAW,CAAC,IAAc,EAAE,IAAI,GAAgB,IAAI,GAAG,EAAE;IAChE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,CAAC;QAAE,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,IAAc;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,KAAK,UAAU;YACb,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,YAAY;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,aAAa;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,KAAK,wBAAwB;YAC3B,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,KAAK,gBAAgB;YACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,KAAK,KAAK;YACR,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,IAAc;IAClC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACxC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC;AAED,sGAAsG;AACtG,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,cAAiC;IAChE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAClC,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAC5B,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,uFAAuF;AACvF,SAAS,mBAAmB,CAAC,IAAc;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/D,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChC,CAAC;AAED,oEAAoE;AACpE,SAAS,QAAQ,CACf,IAAc,EACd,cAAiC,EACjC,IAAY,EACZ,GAA2B;IAE3B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC;oBACP,IAAI,EAAE,kBAAkB;oBACxB,QAAQ,EAAE,UAAU;oBACpB,MAAM,EAAE,4BAA4B;oBACpC,KAAK,EAAE,GAAG,IAAI,SAAS;iBACxB,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACxB,iEAAiE;gBACjE,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;gBACxC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;gBACrE,wEAAwE;gBACxE,wEAAwE;gBACxE,+DAA+D;gBAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC1E,GAAG,CAAC,IAAI,CAAC;wBACP,IAAI,EAAE,oBAAoB;wBAC1B,QAAQ,EAAE,UAAU;wBACpB,MAAM,EACJ,2BAA2B,OAAO,qCAAqC;4BACvE,uEAAuE;4BACvE,+BAA+B;wBACjC,KAAK,EAAE,GAAG,IAAI,SAAS;qBACxB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,+EAA+E;IAC/E,0CAA0C;IAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnD,GAAG,CAAC,IAAI,CAAC;wBACP,IAAI,EAAE,yBAAyB;wBAC/B,QAAQ,EAAE,UAAU;wBACpB,MAAM,EACJ,4CAA4C,CAAC,2BAA2B;4BACxE,sEAAsE;4BACtE,oEAAoE;wBACtE,KAAK,EAAE,GAAG,IAAI,QAAQ,CAAC,GAAG;qBAC3B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtF,CAAC;AACH,CAAC;AAED,kEAAkE;AAClE,SAAS,cAAc,CACrB,CAAS,EACT,CAAS,EACT,QAAgD;IAEhD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAyB;IAEzB,MAAM,GAAG,GAA2B,EAAE,CAAC;IAEvC,qDAAqD;IACrD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YAClC,sEAAsE;YACtE,sEAAsE;YACtE,MAAM,QAAQ,GACZ,CAAC,CAAC,CAAC,QAAQ,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;YAChE,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,2BAA2B;gBACjC,QAAQ;gBACR,MAAM,EAAE,CAAC,CAAC,IAAI;gBACd,KAAK,EAAE,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;aAClD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,MAAM,CAAC,iBAAiB,KAAK,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,2BAA2B;gBACjC,QAAQ,EAAE,UAAU;gBACpB,MAAM,EAAE,4DAA4D;aACrE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC3F,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,qBAAqB;YAC3B,QAAQ,EAAE,UAAU;YACpB,MAAM,EACJ,wDAAwD,GAAG,iBAAiB;gBAC5E,qEAAqE;YACvE,KAAK,EAAE,GAAG;SACX,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,qBAAqB,CACrC,KAAK,CAAC,kBAAkB,EACxB,KAAK,CAAC,qBAAqB,CAC5B,EAAE,CAAC;QACF,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,uBAAuB;YAC7B,QAAQ,EAAE,UAAU;YACpB,MAAM,EACJ,8BAA8B,GAAG,yCAAyC;gBAC1E,2DAA2D;YAC7D,KAAK,EAAE,GAAG;SACX,CAAC,CAAC;IACL,CAAC;IAED,mCAAmC;IACnC,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS;QAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,cAAc,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAEhF,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,eAAe,IAAI,EAAE,CAAC;IAC7C,MAAM,gBAAgB,GAAG,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,IAAI,gBAAgB,KAAK,SAAS;QAAE,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YACjD,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;gBAAE,SAAS;YAC7C,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,uBAAuB;gBAC7B,QAAQ,EAAE,UAAU;gBACpB,MAAM,EACJ,yBAAyB,CAAC,UAAU,CAAC,oCAAoC;oBACzE,yEAAyE;oBACzE,kBAAkB;gBACpB,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAyC;IAEzC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.1 — the applicability checker.\n *\n * Design note: `docs/planning/Atlas-Phase-4-Design.md` §1.\n *\n * **This module answers \"what about this bridge is not checked?\", and it\n * returns FINDINGS rather than a boolean.** A boolean would have to choose\n * between \"unchecked\" and \"wrong\", and those are the two states the module\n * exists to keep apart. Every finding therefore carries a\n * {@link ApplicabilitySeverity}:\n *\n *  - `'blocking'` — the data CONTRADICTS ITSELF. A dimensional failure, two\n *    records declaring opposite conventions, a literal zero divisor.\n *  - `'question'` — the data is SILENT. A divisor nobody guarded, a convention\n *    only one side declares, two premise models whose relationship is\n *    unrecorded.\n *\n * `src/atlas/conventions.ts` already argues this asymmetry at length for the\n * convention comparison: absence is not disagreement. The same reasoning\n * governs every rule here. Collapsing the two severities would report \"four\n * findings\" for a record whose only defect is that nobody wrote something\n * down, and would bury a genuine contradiction among them.\n *\n * **Nothing here mutates a record and nothing here is a verdict.** The checker\n * has no authority to promote or reject: it produces the list a reviewer reads.\n * That is the same firewall the rest of the repo keeps — no machine verdict\n * mutates a catalog.\n *\n * @module atlas/applicability\n * @internal\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { AtlasModel } from './model.js';\nimport type { Conventions } from './types.js';\nimport { checkConventions, unknownConventionKeys } from './conventions.js';\n\n/** Whether a finding is a contradiction in the data or a silence in it. @internal */\nexport type ApplicabilitySeverity = 'blocking' | 'question';\n\n/**\n * The rule that produced a finding. A closed union so a caller can filter by\n * rule without matching on prose.\n *\n * @internal\n */\nexport type ApplicabilityFindingKind =\n  | 'dimensional-inconsistency'\n  | 'convention-mismatch'\n  | 'convention-undeclared'\n  | 'division-unguarded'\n  | 'division-by-zero'\n  | 'squaring-adds-solutions'\n  | 'model-incompatibility';\n\n/** One thing a reviewer must resolve before believing the record. @internal */\nexport interface ApplicabilityFinding {\n  readonly kind: ApplicabilityFindingKind;\n  readonly severity: ApplicabilitySeverity;\n  /** Human-readable statement of what is unresolved. */\n  readonly detail: string;\n  /**\n   * Where it was found: an AST path (`'args[1]'`), a convention key, or a\n   * model id. Absent when the finding is about the record as a whole.\n   */\n  readonly where?: string;\n}\n\n/**\n * What the checker is given. Every field is optional EXCEPT the side\n * conditions, which are required so that \"this record states none\" is a\n * written choice (`[]`) rather than a forgotten argument — the same reasoning\n * that made `passingWitnessIds` required in `derive-evidence.ts`.\n *\n * @internal\n */\nexport interface ApplicabilityInput {\n  /** The transformation's AST, when the record encodes one. */\n  readonly ast?: ExprNode;\n  /** The record's stated side conditions, as free prose. REQUIRED; `[]` is a statement. */\n  readonly sideConditions: readonly string[];\n  /** The premise records' declared conventions. */\n  readonly premiseConventions?: Conventions;\n  /** The conclusion record's declared conventions. */\n  readonly conclusionConventions?: Conventions;\n  /** The premise models (many). */\n  readonly premises?: readonly AtlasModel[];\n  /** The conclusion model (one). */\n  readonly conclusion?: AtlasModel;\n  /**\n   * Family pairs already bridged, so a genuine cross-family step is not\n   * reported as unrecorded. Unordered: `['a','b']` covers `['b','a']`.\n   */\n  readonly declaredBridges?: readonly (readonly [string, string])[];\n}\n\n/**\n * Non-vanishing markers a side condition may use. Matched case-insensitively\n * against the side-condition prose.\n *\n * ⚠ **Shallow by design, and the asymmetry is the point** (design note §1.3).\n * A side condition is free text and no parser exists for it. The failure mode\n * is a FALSE QUESTION — a genuinely guarded divisor phrased in words this list\n * does not know — never a false clearance, because a divisor absent from the\n * prose cannot match any marker. The check over-asks rather than over-clears.\n */\nconst NONVANISHING_MARKERS: readonly string[] = [\n  '≠ 0',\n  '≠0',\n  '!= 0',\n  '!=0',\n  '<> 0',\n  '<>0',\n  'nonzero',\n  'non-zero',\n  'non zero',\n  '> 0',\n  '>0',\n  'positive',\n];\n\n/** Free symbol names appearing anywhere in a subtree. */\nfunction symbolNames(node: ExprNode, into: Set<string> = new Set()): Set<string> {\n  if (node.kind === 'symbol') {\n    into.add(node.name);\n    return into;\n  }\n  for (const child of childNodes(node)) symbolNames(child, into);\n  return into;\n}\n\n/**\n * The `ExprNode` children of a node, for the scalar grammar this checker\n * reasons about. Tensor and curvature node families have no children here and\n * return `[]`: the side-condition and squaring rules are statements about\n * scalar algebra, and silently descending into a tensor node would invite\n * findings whose `where` path means nothing to a reader.\n */\nfunction childNodes(node: ExprNode): readonly ExprNode[] {\n  switch (node.kind) {\n    case 'op':\n      return node.args;\n    case 'integral':\n      return [node.over, node.integrand, ...(node.lower ? [node.lower] : []),\n        ...(node.upper ? [node.upper] : [])];\n    case 'derivative':\n      return [node.of, node.wrt];\n    case 'dirac-delta':\n      return [node.arg];\n    case 'variational-derivative':\n      return [node.functional, node.field, node.over];\n    case 'transcendental':\n      return [node.arg];\n    case 'abs':\n      return [node.arg];\n    default:\n      return [];\n  }\n}\n\n/**\n * The numeric value of a leaf that IS a literal, or `null`.\n *\n * Literals are `symbol` leaves whose `name` parses as a number — the same\n * convention `validator.ts` uses to recognise a literal exponent, so the two\n * cannot disagree about what a literal is.\n */\nfunction literalValue(node: ExprNode): number | null {\n  if (node.kind !== 'symbol') return null;\n  if (node.name.trim() === '') return null;\n  const v = Number(node.name);\n  return Number.isFinite(v) ? v : null;\n}\n\n/** The word-like tokens of a side condition: runs of letters, digits and underscores, lower-cased. */\nfunction wordTokens(text: string): Set<string> {\n  return new Set(text.toLowerCase().match(/[\\p{L}\\p{N}_]+/gu) ?? []);\n}\n\n/**\n * Is `name` guarded as non-vanishing by any of the stated side conditions?\n *\n * The name must appear as a WHOLE token of the condition: `a` is not guarded\n * by \"the amplitude is positive\", although that sentence contains the letter\n * `a` beside a marker. A substring match cleared every one-letter divisor on\n * most prose; that was the audit's A14.\n */\nfunction isGuarded(name: string, sideConditions: readonly string[]): boolean {\n  const needle = name.toLowerCase();\n  return sideConditions.some((raw) => {\n    if (!wordTokens(raw).has(needle)) return false;\n    const s = raw.toLowerCase();\n    return NONVANISHING_MARKERS.some((m) => s.includes(m));\n  });\n}\n\n/** An even, integer literal exponent, or `null` when the exponent is anything else. */\nfunction evenLiteralExponent(node: ExprNode): number | null {\n  if (node.kind !== 'op' || node.op !== '^') return null;\n  const exp = node.args[1];\n  if (exp === undefined) return null;\n  const v = literalValue(exp);\n  if (v === null || !Number.isInteger(v) || v === 0) return null;\n  return v % 2 === 0 ? v : null;\n}\n\n/** Walk the AST, applying the side-condition and squaring rules. */\nfunction checkAst(\n  node: ExprNode,\n  sideConditions: readonly string[],\n  path: string,\n  out: ApplicabilityFinding[],\n): void {\n  if (node.kind === 'op' && node.op === '/') {\n    const divisor = node.args[1];\n    if (divisor !== undefined) {\n      const lit = literalValue(divisor);\n      if (lit === 0) {\n        out.push({\n          kind: 'division-by-zero',\n          severity: 'blocking',\n          detail: 'Division by the literal 0.',\n          where: `${path}args[1]`,\n        });\n      } else if (lit === null) {\n        // Not a literal: it needs a stated non-vanishing side condition.\n        const names = [...symbolNames(divisor)];\n        const unguarded = names.filter((n) => !isGuarded(n, sideConditions));\n        // Every name guarded ⇒ nothing to ask. A divisor with NO symbols and no\n        // literal value (a tensor leaf, say) is reported, because nothing about\n        // it can be checked and silence there would read as clearance.\n        if (names.length === 0 || unguarded.length > 0) {\n          const subject = names.length === 0 ? 'the divisor' : unguarded.join(', ');\n          out.push({\n            kind: 'division-unguarded',\n            severity: 'question',\n            detail:\n              `Division whose divisor (${subject}) has no stated non-vanishing side ` +\n              'condition. This is a question, not a defect: the divisor may well be ' +\n              'non-zero and simply unstated.',\n            where: `${path}args[1]`,\n          });\n        }\n      }\n    }\n  }\n\n  // Difference (or sum) of two equal even powers ⇒ the relation was obtained by\n  // squaring, which admits the sign-flipped branch. See design note §1.4 for why\n  // an isolated even power is NOT reported.\n  if (node.kind === 'op' && (node.op === '-' || node.op === '+')) {\n    const exps = node.args.map(evenLiteralExponent);\n    for (let i = 0; i < exps.length; i += 1) {\n      for (let j = i + 1; j < exps.length; j += 1) {\n        const a = exps[i];\n        if (a !== null && a !== undefined && a === exps[j]) {\n          out.push({\n            kind: 'squaring-adds-solutions',\n            severity: 'question',\n            detail:\n              `Two terms raised to the same even power (${a}) are equated. Raising a ` +\n              'relation to an even power admits the sign-flipped branch, so a side ' +\n              'condition fixing the sign is needed for the step to be reversible.',\n            where: `${path}args[${i}]`,\n          });\n        }\n      }\n    }\n  }\n\n  const children = childNodes(node);\n  for (let i = 0; i < children.length; i += 1) {\n    const child = children[i];\n    if (child !== undefined) checkAst(child, sideConditions, `${path}args[${i}].`, out);\n  }\n}\n\n/** Is this family pair recorded as already bridged? Unordered. */\nfunction bridgeDeclared(\n  a: string,\n  b: string,\n  declared: readonly (readonly [string, string])[],\n): boolean {\n  return declared.some(([x, y]) => (x === a && y === b) || (x === b && y === a));\n}\n\n/**\n * Every unresolved question and contradiction the checker can see in a record.\n *\n * An EMPTY result means \"no rule fired\", which is weaker than \"this bridge is\n * valid\" and must not be reported as the latter. The rules in hand cover\n * dimensions, declared conventions, division guards, even-power equating and\n * model families; a bridge can be wrong in ways none of them reaches.\n *\n * @param input - the record's checkable parts. `sideConditions` is required.\n * @returns findings in rule order (dimensions, conventions, AST, models);\n * never `null`, never throws on a malformed AST.\n * @internal\n */\nexport function checkApplicability(\n  input: ApplicabilityInput,\n): readonly ApplicabilityFinding[] {\n  const out: ApplicabilityFinding[] = [];\n\n  // 1. Dimensions — the existing validator, unchanged.\n  if (input.ast !== undefined) {\n    const result = validate(input.ast);\n    for (const v of result.violations) {\n      // A warning-severity violation does not make the record inconsistent;\n      // reporting it as blocking would contradict `validate`'s own verdict.\n      const severity: ApplicabilitySeverity =\n        (v.severity ?? 'error') === 'error' ? 'blocking' : 'question';\n      out.push({\n        kind: 'dimensional-inconsistency',\n        severity,\n        detail: v.note,\n        where: v.location === '' ? undefined : v.location,\n      });\n    }\n    if (result.inferredDimension === null && result.violations.length === 0) {\n      out.push({\n        kind: 'dimensional-inconsistency',\n        severity: 'blocking',\n        detail: 'No dimension could be inferred for the transformation AST.',\n      });\n    }\n  }\n\n  // 2. Conventions — mismatches block, asymmetric declarations are questions.\n  const mismatches = checkConventions(input.premiseConventions, input.conclusionConventions);\n  for (const key of mismatches) {\n    out.push({\n      kind: 'convention-mismatch',\n      severity: 'blocking',\n      detail:\n        `Premise and conclusion declare different values for '${key}'. Two records ` +\n        'that disagree on a sign or unit choice are not directly comparable.',\n      where: key,\n    });\n  }\n  for (const key of unknownConventionKeys(\n    input.premiseConventions,\n    input.conclusionConventions,\n  )) {\n    out.push({\n      kind: 'convention-undeclared',\n      severity: 'question',\n      detail:\n        `Exactly one side declares '${key}'. Silence is not agreement: the other ` +\n        'record may use the opposite choice and simply never said.',\n      where: key,\n    });\n  }\n\n  // 3. Side conditions over the AST.\n  if (input.ast !== undefined) checkAst(input.ast, input.sideConditions, '', out);\n\n  // 4. Model compatibility.\n  const premises = input.premises ?? [];\n  const declared = input.declaredBridges ?? [];\n  const conclusionFamily = input.conclusion?.family;\n  const families = new Set(premises.map((m) => m.family));\n  if (conclusionFamily !== undefined) families.add(conclusionFamily);\n  const familyList = [...families];\n  for (let i = 0; i < familyList.length; i += 1) {\n    for (let j = i + 1; j < familyList.length; j += 1) {\n      const a = familyList[i];\n      const b = familyList[j];\n      if (a === undefined || b === undefined) continue;\n      if (bridgeDeclared(a, b, declared)) continue;\n      out.push({\n        kind: 'model-incompatibility',\n        severity: 'question',\n        detail:\n          `Models span families '${a}' and '${b}' with no declared bridge between ` +\n          'them. An unrecorded cross-family step is exactly what the atlas exists ' +\n          'to make visible.',\n        where: `${a}|${b}`,\n      });\n    }\n  }\n\n  return out;\n}\n\n/**\n * The `'blocking'` subset of {@link checkApplicability}.\n *\n * Offered because the two severities are read by different callers — a report\n * shows both, a gate looks only at contradictions — and filtering on the\n * severity string at every call site is how one of them eventually filters on\n * the wrong one.\n *\n * @internal\n */\nexport function blockingFindings(\n  findings: readonly ApplicabilityFinding[],\n): readonly ApplicabilityFinding[] {\n  return findings.filter((f) => f.severity === 'blocking');\n}\n"]}
+{"version":3,"file":"applicability.js","sourceRoot":"","sources":["../../src/atlas/applicability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAGvD,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,YAAY,IAAI,WAAW,EAAqB,MAAM,8BAA8B,CAAC;AA6DnI;;;;;;;;;GASG;AACH,MAAM,oBAAoB,GAAsB;IAC9C,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,KAAK;IACL,SAAS;IACT,UAAU;IACV,UAAU;IACV,KAAK;IACL,IAAI;IACJ,UAAU;CACX,CAAC;AAEF;;;GAGG;AACH,MAAM,WAAW,GAAiB;IAChC,cAAc,EAAE,IAAI;IACpB,GAAG,EAAE,IAAI;IACT,UAAU,EAAE,IAAI;IAChB,QAAQ,EAAE,KAAK;IACf,UAAU,EAAE,IAAI;IAChB,qBAAqB,EAAE,IAAI;CAC5B,CAAC;AAEF,0GAA0G;AAC1G,SAAS,WAAW,CAAC,IAAc,EAAE,IAAI,GAAgB,IAAI,GAAG,EAAE;IAChE,iBAAiB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC;IACpE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,IAAc;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,KAAK,UAAU;YACb,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,YAAY;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,aAAa;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,KAAK,wBAAwB;YAC3B,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,KAAK,gBAAgB;YACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,KAAK,KAAK;YACR,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,IAAc;IAClC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxE,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC;AAED,sGAAsG;AACtG,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,cAAiC;IAChE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAClC,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAC5B,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,uFAAuF;AACvF,SAAS,mBAAmB,CAAC,IAAc;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/D,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChC,CAAC;AAED,oEAAoE;AACpE,SAAS,QAAQ,CACf,IAAc,EACd,cAAiC,EACjC,IAAY,EACZ,GAA2B;IAE3B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC;oBACP,IAAI,EAAE,kBAAkB;oBACxB,QAAQ,EAAE,UAAU;oBACpB,MAAM,EAAE,4BAA4B;oBACpC,KAAK,EAAE,GAAG,IAAI,SAAS;iBACxB,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACxB,iEAAiE;gBACjE,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;gBACxC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;gBACrE,wEAAwE;gBACxE,wEAAwE;gBACxE,+DAA+D;gBAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC1E,GAAG,CAAC,IAAI,CAAC;wBACP,IAAI,EAAE,oBAAoB;wBAC1B,QAAQ,EAAE,UAAU;wBACpB,MAAM,EACJ,2BAA2B,OAAO,qCAAqC;4BACvE,uEAAuE;4BACvE,+BAA+B;wBACjC,KAAK,EAAE,GAAG,IAAI,SAAS;qBACxB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,+EAA+E;IAC/E,0CAA0C;IAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnD,GAAG,CAAC,IAAI,CAAC;wBACP,IAAI,EAAE,yBAAyB;wBAC/B,QAAQ,EAAE,UAAU;wBACpB,MAAM,EACJ,4CAA4C,CAAC,2BAA2B;4BACxE,sEAAsE;4BACtE,oEAAoE;wBACtE,KAAK,EAAE,GAAG,IAAI,QAAQ,CAAC,GAAG;qBAC3B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtF,CAAC;AACH,CAAC;AAED,kEAAkE;AAClE,SAAS,cAAc,CACrB,CAAS,EACT,CAAS,EACT,QAAgD;IAEhD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAyB;IAEzB,MAAM,GAAG,GAA2B,EAAE,CAAC;IAEvC,qDAAqD;IACrD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YAClC,sEAAsE;YACtE,sEAAsE;YACtE,MAAM,QAAQ,GACZ,CAAC,CAAC,CAAC,QAAQ,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;YAChE,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,2BAA2B;gBACjC,QAAQ;gBACR,MAAM,EAAE,CAAC,CAAC,IAAI;gBACd,KAAK,EAAE,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;aAClD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,MAAM,CAAC,iBAAiB,KAAK,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,2BAA2B;gBACjC,QAAQ,EAAE,UAAU;gBACpB,MAAM,EAAE,4DAA4D;aACrE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC3F,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,qBAAqB;YAC3B,QAAQ,EAAE,UAAU;YACpB,MAAM,EACJ,wDAAwD,GAAG,iBAAiB;gBAC5E,qEAAqE;YACvE,KAAK,EAAE,GAAG;SACX,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,qBAAqB,CACrC,KAAK,CAAC,kBAAkB,EACxB,KAAK,CAAC,qBAAqB,CAC5B,EAAE,CAAC;QACF,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,uBAAuB;YAC7B,QAAQ,EAAE,UAAU;YACpB,MAAM,EACJ,8BAA8B,GAAG,yCAAyC;gBAC1E,2DAA2D;YAC7D,KAAK,EAAE,GAAG;SACX,CAAC,CAAC;IACL,CAAC;IAED,mCAAmC;IACnC,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS;QAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,cAAc,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAEhF,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,eAAe,IAAI,EAAE,CAAC;IAC7C,MAAM,gBAAgB,GAAG,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,IAAI,gBAAgB,KAAK,SAAS;QAAE,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YACjD,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;gBAAE,SAAS;YAC7C,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,uBAAuB;gBAC7B,QAAQ,EAAE,UAAU;gBACpB,MAAM,EACJ,yBAAyB,CAAC,UAAU,CAAC,oCAAoC;oBACzE,yEAAyE;oBACzE,kBAAkB;gBACpB,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAyC;IAEzC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.1 — the applicability checker.\n *\n * Design note: `docs/planning/Atlas-Phase-4-Design.md` §1.\n *\n * **This module answers \"what about this bridge is not checked?\", and it\n * returns FINDINGS rather than a boolean.** A boolean would have to choose\n * between \"unchecked\" and \"wrong\", and those are the two states the module\n * exists to keep apart. Every finding therefore carries a\n * {@link ApplicabilitySeverity}:\n *\n *  - `'blocking'` — the data CONTRADICTS ITSELF. A dimensional failure, two\n *    records declaring opposite conventions, a literal zero divisor.\n *  - `'question'` — the data is SILENT. A divisor nobody guarded, a convention\n *    only one side declares, two premise models whose relationship is\n *    unrecorded.\n *\n * `src/atlas/conventions.ts` already argues this asymmetry at length for the\n * convention comparison: absence is not disagreement. The same reasoning\n * governs every rule here. Collapsing the two severities would report \"four\n * findings\" for a record whose only defect is that nobody wrote something\n * down, and would bury a genuine contradiction among them.\n *\n * **Nothing here mutates a record and nothing here is a verdict.** The checker\n * has no authority to promote or reject: it produces the list a reviewer reads.\n * That is the same firewall the rest of the repo keeps — no machine verdict\n * mutates a catalog.\n *\n * @module atlas/applicability\n * @internal\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { AtlasModel } from './model.js';\nimport type { Conventions } from './types.js';\nimport { checkConventions, unknownConventionKeys } from './conventions.js';\nimport { forEachScalarLeaf, isDecimalLiteral, literalValue as leafLiteral, type LeafWalkArms } from '../dimensional/ast-leaves.js';\n\n/** Whether a finding is a contradiction in the data or a silence in it. @internal */\nexport type ApplicabilitySeverity = 'blocking' | 'question';\n\n/**\n * The rule that produced a finding. A closed union so a caller can filter by\n * rule without matching on prose.\n *\n * @internal\n */\nexport type ApplicabilityFindingKind =\n  | 'dimensional-inconsistency'\n  | 'convention-mismatch'\n  | 'convention-undeclared'\n  | 'division-unguarded'\n  | 'division-by-zero'\n  | 'squaring-adds-solutions'\n  | 'model-incompatibility';\n\n/** One thing a reviewer must resolve before believing the record. @internal */\nexport interface ApplicabilityFinding {\n  readonly kind: ApplicabilityFindingKind;\n  readonly severity: ApplicabilitySeverity;\n  /** Human-readable statement of what is unresolved. */\n  readonly detail: string;\n  /**\n   * Where it was found: an AST path (`'args[1]'`), a convention key, or a\n   * model id. Absent when the finding is about the record as a whole.\n   */\n  readonly where?: string;\n}\n\n/**\n * What the checker is given. Every field is optional EXCEPT the side\n * conditions, which are required so that \"this record states none\" is a\n * written choice (`[]`) rather than a forgotten argument — the same reasoning\n * that made `passingWitnessIds` required in `derive-evidence.ts`.\n *\n * @internal\n */\nexport interface ApplicabilityInput {\n  /** The transformation's AST, when the record encodes one. */\n  readonly ast?: ExprNode;\n  /** The record's stated side conditions, as free prose. REQUIRED; `[]` is a statement. */\n  readonly sideConditions: readonly string[];\n  /** The premise records' declared conventions. */\n  readonly premiseConventions?: Conventions;\n  /** The conclusion record's declared conventions. */\n  readonly conclusionConventions?: Conventions;\n  /** The premise models (many). */\n  readonly premises?: readonly AtlasModel[];\n  /** The conclusion model (one). */\n  readonly conclusion?: AtlasModel;\n  /**\n   * Family pairs already bridged, so a genuine cross-family step is not\n   * reported as unrecorded. Unordered: `['a','b']` covers `['b','a']`.\n   */\n  readonly declaredBridges?: readonly (readonly [string, string])[];\n}\n\n/**\n * Non-vanishing markers a side condition may use. Matched case-insensitively\n * against the side-condition prose.\n *\n * ⚠ **Shallow by design, and the asymmetry is the point** (design note §1.3).\n * A side condition is free text and no parser exists for it. The failure mode\n * is a FALSE QUESTION — a genuinely guarded divisor phrased in words this list\n * does not know — never a false clearance, because a divisor absent from the\n * prose cannot match any marker. The check over-asks rather than over-clears.\n */\nconst NONVANISHING_MARKERS: readonly string[] = [\n  '≠ 0',\n  '≠0',\n  '!= 0',\n  '!=0',\n  '<> 0',\n  '<>0',\n  'nonzero',\n  'non-zero',\n  'non zero',\n  '> 0',\n  '>0',\n  'positive',\n];\n\n/**\n * The arms this checker descends into: every scalar child {@link childNodes} lists, and no\n * tensor-product argument (a tensor node has no children here).\n */\nconst SCALAR_ARMS: LeafWalkArms = {\n  transcendental: true,\n  abs: true,\n  diracDelta: true,\n  integral: 'all',\n  derivative: true,\n  variationalDerivative: true,\n};\n\n/** Symbol names (literals included, as a divisor's names always were) appearing anywhere in a subtree. */\nfunction symbolNames(node: ExprNode, into: Set<string> = new Set()): Set<string> {\n  forEachScalarLeaf(node, (leaf) => into.add(leaf.name), SCALAR_ARMS);\n  return into;\n}\n\n/**\n * The `ExprNode` children of a node, for the scalar grammar this checker\n * reasons about. Tensor and curvature node families have no children here and\n * return `[]`: the side-condition and squaring rules are statements about\n * scalar algebra, and silently descending into a tensor node would invite\n * findings whose `where` path means nothing to a reader.\n */\nfunction childNodes(node: ExprNode): readonly ExprNode[] {\n  switch (node.kind) {\n    case 'op':\n      return node.args;\n    case 'integral':\n      return [node.over, node.integrand, ...(node.lower ? [node.lower] : []),\n        ...(node.upper ? [node.upper] : [])];\n    case 'derivative':\n      return [node.of, node.wrt];\n    case 'dirac-delta':\n      return [node.arg];\n    case 'variational-derivative':\n      return [node.functional, node.field, node.over];\n    case 'transcendental':\n      return [node.arg];\n    case 'abs':\n      return [node.arg];\n    default:\n      return [];\n  }\n}\n\n/**\n * The numeric value of a leaf that IS a literal, or `null`.\n *\n * Literals are `symbol` leaves whose `name` is a decimal literal under the one\n * rule (`isDecimalLiteral`, `dimensional/ast-leaves.ts`, the validator's), and\n * whose value is finite.\n */\nfunction literalValue(node: ExprNode): number | null {\n  if (node.kind !== 'symbol' || !isDecimalLiteral(node.name)) return null;\n  const v = leafLiteral(node);\n  return v !== undefined && Number.isFinite(v) ? v : null;\n}\n\n/** The word-like tokens of a side condition: runs of letters, digits and underscores, lower-cased. */\nfunction wordTokens(text: string): Set<string> {\n  return new Set(text.toLowerCase().match(/[\\p{L}\\p{N}_]+/gu) ?? []);\n}\n\n/**\n * Is `name` guarded as non-vanishing by any of the stated side conditions?\n *\n * The name must appear as a WHOLE token of the condition: `a` is not guarded\n * by \"the amplitude is positive\", although that sentence contains the letter\n * `a` beside a marker. A substring match cleared every one-letter divisor on\n * most prose; that was the audit's A14.\n */\nfunction isGuarded(name: string, sideConditions: readonly string[]): boolean {\n  const needle = name.toLowerCase();\n  return sideConditions.some((raw) => {\n    if (!wordTokens(raw).has(needle)) return false;\n    const s = raw.toLowerCase();\n    return NONVANISHING_MARKERS.some((m) => s.includes(m));\n  });\n}\n\n/** An even, integer literal exponent, or `null` when the exponent is anything else. */\nfunction evenLiteralExponent(node: ExprNode): number | null {\n  if (node.kind !== 'op' || node.op !== '^') return null;\n  const exp = node.args[1];\n  if (exp === undefined) return null;\n  const v = literalValue(exp);\n  if (v === null || !Number.isInteger(v) || v === 0) return null;\n  return v % 2 === 0 ? v : null;\n}\n\n/** Walk the AST, applying the side-condition and squaring rules. */\nfunction checkAst(\n  node: ExprNode,\n  sideConditions: readonly string[],\n  path: string,\n  out: ApplicabilityFinding[],\n): void {\n  if (node.kind === 'op' && node.op === '/') {\n    const divisor = node.args[1];\n    if (divisor !== undefined) {\n      const lit = literalValue(divisor);\n      if (lit === 0) {\n        out.push({\n          kind: 'division-by-zero',\n          severity: 'blocking',\n          detail: 'Division by the literal 0.',\n          where: `${path}args[1]`,\n        });\n      } else if (lit === null) {\n        // Not a literal: it needs a stated non-vanishing side condition.\n        const names = [...symbolNames(divisor)];\n        const unguarded = names.filter((n) => !isGuarded(n, sideConditions));\n        // Every name guarded ⇒ nothing to ask. A divisor with NO symbols and no\n        // literal value (a tensor leaf, say) is reported, because nothing about\n        // it can be checked and silence there would read as clearance.\n        if (names.length === 0 || unguarded.length > 0) {\n          const subject = names.length === 0 ? 'the divisor' : unguarded.join(', ');\n          out.push({\n            kind: 'division-unguarded',\n            severity: 'question',\n            detail:\n              `Division whose divisor (${subject}) has no stated non-vanishing side ` +\n              'condition. This is a question, not a defect: the divisor may well be ' +\n              'non-zero and simply unstated.',\n            where: `${path}args[1]`,\n          });\n        }\n      }\n    }\n  }\n\n  // Difference (or sum) of two equal even powers ⇒ the relation was obtained by\n  // squaring, which admits the sign-flipped branch. See design note §1.4 for why\n  // an isolated even power is NOT reported.\n  if (node.kind === 'op' && (node.op === '-' || node.op === '+')) {\n    const exps = node.args.map(evenLiteralExponent);\n    for (let i = 0; i < exps.length; i += 1) {\n      for (let j = i + 1; j < exps.length; j += 1) {\n        const a = exps[i];\n        if (a !== null && a !== undefined && a === exps[j]) {\n          out.push({\n            kind: 'squaring-adds-solutions',\n            severity: 'question',\n            detail:\n              `Two terms raised to the same even power (${a}) are equated. Raising a ` +\n              'relation to an even power admits the sign-flipped branch, so a side ' +\n              'condition fixing the sign is needed for the step to be reversible.',\n            where: `${path}args[${i}]`,\n          });\n        }\n      }\n    }\n  }\n\n  const children = childNodes(node);\n  for (let i = 0; i < children.length; i += 1) {\n    const child = children[i];\n    if (child !== undefined) checkAst(child, sideConditions, `${path}args[${i}].`, out);\n  }\n}\n\n/** Is this family pair recorded as already bridged? Unordered. */\nfunction bridgeDeclared(\n  a: string,\n  b: string,\n  declared: readonly (readonly [string, string])[],\n): boolean {\n  return declared.some(([x, y]) => (x === a && y === b) || (x === b && y === a));\n}\n\n/**\n * Every unresolved question and contradiction the checker can see in a record.\n *\n * An EMPTY result means \"no rule fired\", which is weaker than \"this bridge is\n * valid\" and must not be reported as the latter. The rules in hand cover\n * dimensions, declared conventions, division guards, even-power equating and\n * model families; a bridge can be wrong in ways none of them reaches.\n *\n * @param input - the record's checkable parts. `sideConditions` is required.\n * @returns findings in rule order (dimensions, conventions, AST, models);\n * never `null`, never throws on a malformed AST.\n * @internal\n */\nexport function checkApplicability(\n  input: ApplicabilityInput,\n): readonly ApplicabilityFinding[] {\n  const out: ApplicabilityFinding[] = [];\n\n  // 1. Dimensions — the existing validator, unchanged.\n  if (input.ast !== undefined) {\n    const result = validate(input.ast);\n    for (const v of result.violations) {\n      // A warning-severity violation does not make the record inconsistent;\n      // reporting it as blocking would contradict `validate`'s own verdict.\n      const severity: ApplicabilitySeverity =\n        (v.severity ?? 'error') === 'error' ? 'blocking' : 'question';\n      out.push({\n        kind: 'dimensional-inconsistency',\n        severity,\n        detail: v.note,\n        where: v.location === '' ? undefined : v.location,\n      });\n    }\n    if (result.inferredDimension === null && result.violations.length === 0) {\n      out.push({\n        kind: 'dimensional-inconsistency',\n        severity: 'blocking',\n        detail: 'No dimension could be inferred for the transformation AST.',\n      });\n    }\n  }\n\n  // 2. Conventions — mismatches block, asymmetric declarations are questions.\n  const mismatches = checkConventions(input.premiseConventions, input.conclusionConventions);\n  for (const key of mismatches) {\n    out.push({\n      kind: 'convention-mismatch',\n      severity: 'blocking',\n      detail:\n        `Premise and conclusion declare different values for '${key}'. Two records ` +\n        'that disagree on a sign or unit choice are not directly comparable.',\n      where: key,\n    });\n  }\n  for (const key of unknownConventionKeys(\n    input.premiseConventions,\n    input.conclusionConventions,\n  )) {\n    out.push({\n      kind: 'convention-undeclared',\n      severity: 'question',\n      detail:\n        `Exactly one side declares '${key}'. Silence is not agreement: the other ` +\n        'record may use the opposite choice and simply never said.',\n      where: key,\n    });\n  }\n\n  // 3. Side conditions over the AST.\n  if (input.ast !== undefined) checkAst(input.ast, input.sideConditions, '', out);\n\n  // 4. Model compatibility.\n  const premises = input.premises ?? [];\n  const declared = input.declaredBridges ?? [];\n  const conclusionFamily = input.conclusion?.family;\n  const families = new Set(premises.map((m) => m.family));\n  if (conclusionFamily !== undefined) families.add(conclusionFamily);\n  const familyList = [...families];\n  for (let i = 0; i < familyList.length; i += 1) {\n    for (let j = i + 1; j < familyList.length; j += 1) {\n      const a = familyList[i];\n      const b = familyList[j];\n      if (a === undefined || b === undefined) continue;\n      if (bridgeDeclared(a, b, declared)) continue;\n      out.push({\n        kind: 'model-incompatibility',\n        severity: 'question',\n        detail:\n          `Models span families '${a}' and '${b}' with no declared bridge between ` +\n          'them. An unrecorded cross-family step is exactly what the atlas exists ' +\n          'to make visible.',\n        where: `${a}|${b}`,\n      });\n    }\n  }\n\n  return out;\n}\n\n/**\n * The `'blocking'` subset of {@link checkApplicability}.\n *\n * Offered because the two severities are read by different callers — a report\n * shows both, a gate looks only at contradictions — and filtering on the\n * severity string at every call site is how one of them eventually filters on\n * the wrong one.\n *\n * @internal\n */\nexport function blockingFindings(\n  findings: readonly ApplicabilityFinding[],\n): readonly ApplicabilityFinding[] {\n  return findings.filter((f) => f.severity === 'blocking');\n}\n"]}

package/dist/atlas/benchmark/hybrid-retrieval.d.ts

@@ -62,7 +62,15 @@ export declare function queryInput(claim: string): string;
 export declare function stubVector(text: string): readonly number[];
 /** The stub embedder. It does not open a socket. @internal */
 export declare const stubEmbedder: Embedder;
-/** Cosine similarity. Unequal lengths are not a similarity. @internal */
+/**
+ * Cosine similarity, from MathTS core's `pairwiseDot` (pairwise summation over
+ * any `ArrayLike<number>`, the frozen `Float32Array` vectors included; the
+ * typed `dot` of the functions package takes a plain array or a `Float64Array`
+ * only, and routes the latter to an async path). The norms are the same dot
+ * product, so a vector against itself is exactly 1 (`√(x·x) = x`).
+ * Unequal lengths are not a similarity.
+ * @internal
+ */
 export declare function cosine(a: ArrayLike<number>, b: ArrayLike<number>): number;
 /**
  * Best cosine first. A tie breaks by record id, so the order does not depend

package/dist/atlas/benchmark/hybrid-retrieval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hybrid-retrieval.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/hybrid-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAmB,KAAK,YAAY,EAAE,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEzF,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,yGACsE,CAAC;AAEzG,iGAAiG;AACjG,eAAO,MAAM,sBAAsB,uBAAuB,CAAC;AAE3D;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC,4EAA4E;AAC5E,eAAO,MAAM,oBAAoB,qEAAqE,CAAC;AAEvG;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAC;AAEtC,0EAA0E;AAC1E,eAAO,MAAM,eAAe,6DAA6D,CAAC;AAE1F,kGAAkG;AAClG,eAAO,MAAM,aAAa,oKACyI,CAAC;AAEpK,QAAA,MAAM,WAAW;aACf,mBAAmB,EAAE,0BAA0B;aAC/C,iBAAiB,EAAE,wBAAwB;aAC3C,cAAc,EAAE,qCAAqC;aACrD,oBAAoB,EAClB,sFAAsF;aACxF,qBAAqB,EAAE,0BAA0B;CACzC,CAAC;AAEX,wEAAwE;AACxE,MAAM,MAAM,uBAAuB,GAAG,MAAM,OAAO,WAAW,CAAC;AAE/D,0FAA0F;AAC1F,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC;IACzC,YAAY,MAAM,EAAE,uBAAuB,EAAE,MAAM,CAAC,EAAE,MAAM,EAI3D;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,KAAK,OAAO,CAAC,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;AAE7F,6EAA6E;AAC7E,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAS1D;AAED,8DAA8D;AAC9D,eAAO,MAAM,YAAY,EAAE,QAAiE,CAAC;AAE7F,yEAAyE;AACzE,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAgBzE;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EACxB,OAAO,EAAE,SAAS;IAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,CAAA;CAAE,EAAE,GAC9E,MAAM,EAAE,CAKV;AAED,oGAAoG;AACpG,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,YAAY,CAM3D;AAED,kGAAkG;AAClG,wBAAgB,wBAAwB,IAAI,YAAY,EAAE,CAMzD;AAED,uHAAuH;AACvH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,WAAW,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC;CAC7E;AAED,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,OAAO,EAAE,qBAAqB,GAAG,QAAQ,CAiDvE;AAED,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,eAAe,GAAG,MAAM,GAAG,UAAU,CAAC;IAC3D,QAAQ,CAAC,QAAQ,EAAE,uBAAuB,GAAG,IAAI,CAAC;IAClD,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAC7C,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAsBD;;;;GAIG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE;IACzC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;CAC9B,GAAG,OAAO,CAAC,eAAe,CAAC,CAuC3B"}
+{"version":3,"file":"hybrid-retrieval.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/hybrid-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,OAAO,EAAmB,KAAK,YAAY,EAAE,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEzF,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,yGACsE,CAAC;AAEzG,iGAAiG;AACjG,eAAO,MAAM,sBAAsB,uBAAuB,CAAC;AAE3D;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC,4EAA4E;AAC5E,eAAO,MAAM,oBAAoB,qEAAqE,CAAC;AAEvG;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAC;AAEtC,0EAA0E;AAC1E,eAAO,MAAM,eAAe,6DAA6D,CAAC;AAE1F,kGAAkG;AAClG,eAAO,MAAM,aAAa,oKACyI,CAAC;AAEpK,QAAA,MAAM,WAAW;aACf,mBAAmB,EAAE,0BAA0B;aAC/C,iBAAiB,EAAE,wBAAwB;aAC3C,cAAc,EAAE,qCAAqC;aACrD,oBAAoB,EAClB,sFAAsF;aACxF,qBAAqB,EAAE,0BAA0B;CACzC,CAAC;AAEX,wEAAwE;AACxE,MAAM,MAAM,uBAAuB,GAAG,MAAM,OAAO,WAAW,CAAC;AAE/D,0FAA0F;AAC1F,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC;IACzC,YAAY,MAAM,EAAE,uBAAuB,EAAE,MAAM,CAAC,EAAE,MAAM,EAI3D;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,KAAK,OAAO,CAAC,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;AAE7F,6EAA6E;AAC7E,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAS1D;AAED,8DAA8D;AAC9D,eAAO,MAAM,YAAY,EAAE,QAAiE,CAAC;AAE7F;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAQzE;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EACxB,OAAO,EAAE,SAAS;IAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,CAAA;CAAE,EAAE,GAC9E,MAAM,EAAE,CAKV;AAED,oGAAoG;AACpG,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,YAAY,CAM3D;AAED,kGAAkG;AAClG,wBAAgB,wBAAwB,IAAI,YAAY,EAAE,CAMzD;AAED,uHAAuH;AACvH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,WAAW,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC;CAC7E;AAED,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,OAAO,EAAE,qBAAqB,GAAG,QAAQ,CAiDvE;AAED,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,eAAe,GAAG,MAAM,GAAG,UAAU,CAAC;IAC3D,QAAQ,CAAC,QAAQ,EAAE,uBAAuB,GAAG,IAAI,CAAC;IAClD,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAC7C,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAsBD;;;;GAIG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE;IACzC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;CAC9B,GAAG,OAAO,CAAC,eAAe,CAAC,CAuC3B"}

package/dist/atlas/benchmark/hybrid-retrieval.js

@@ -12,6 +12,8 @@
  * @module atlas/benchmark/hybrid-retrieval
  * @internal
  */
+import { pairwiseDot } from '@danielsimonjr/mathts-core';
+import { compareCodepoint } from '../../core/compare.js';
 import { CANONICAL_EQUATIONS } from '../../canonical/registry.js';
 import { rankByStructure } from './baselines.js';
 /** The instruction line registered with the embedding condition. @internal */
@@ -74,24 +76,24 @@ export function stubVector(text) {
 }
 /** The stub embedder. It does not open a socket. @internal */
 export const stubEmbedder = async (texts) => texts.map((text) => stubVector(text));
-/** Cosine similarity. Unequal lengths are not a similarity. @internal */
+/**
+ * Cosine similarity, from MathTS core's `pairwiseDot` (pairwise summation over
+ * any `ArrayLike<number>`, the frozen `Float32Array` vectors included; the
+ * typed `dot` of the functions package takes a plain array or a `Float64Array`
+ * only, and routes the latter to an async path). The norms are the same dot
+ * product, so a vector against itself is exactly 1 (`√(x·x) = x`).
+ * Unequal lengths are not a similarity.
+ * @internal
+ */
 export function cosine(a, b) {
     if (a.length !== b.length) {
         throw new EmbeddingUnavailable('reply-not-a-vector');
     }
-    let dot = 0;
-    let na = 0;
-    let nb = 0;
-    for (let i = 0; i < a.length; i++) {
-        const x = a[i];
-        const y = b[i];
-        dot += x * y;
-        na += x * x;
-        nb += y * y;
-    }
+    const na = pairwiseDot(a, a);
+    const nb = pairwiseDot(b, b);
     if (na === 0 || nb === 0)
         return 0;
-    return dot / Math.sqrt(na * nb);
+    return pairwiseDot(a, b) / Math.sqrt(na * nb);
 }
 /**
  * Best cosine first. A tie breaks by record id, so the order does not depend
@@ -101,7 +103,7 @@ export function cosine(a, b) {
 export function rankByCosine(query, records) {
     return records
         .map((r) => ({ id: r.id, s: cosine(query, r.vector) }))
-        .sort((a, b) => (b.s !== a.s ? b.s - a.s : a.id < b.id ? -1 : a.id > b.id ? 1 : 0))
+        .sort((a, b) => (b.s !== a.s ? b.s - a.s : compareCodepoint(a.id, b.id)))
         .map((x) => x.id);
 }
 /** Decode a little-endian float32 vector stored as base64, the frozen file's encoding. @internal */

package/dist/atlas/benchmark/hybrid-retrieval.js.map

@@ -1 +1 @@
-{"version":3,"file":"hybrid-retrieval.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/hybrid-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAClE,OAAO,EAAE,eAAe,EAA0C,MAAM,gBAAgB,CAAC;AAEzF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,qBAAqB,GAChC,sGAAsG,CAAC;AAEzG,iGAAiG;AACjG,MAAM,CAAC,MAAM,sBAAsB,GAAG,oBAAoB,CAAC;AAE3D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC,4EAA4E;AAC5E,MAAM,CAAC,MAAM,oBAAoB,GAAG,kEAAkE,CAAC;AAEvG;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAEtC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,eAAe,GAAG,0DAA0D,CAAC;AAE1F,kGAAkG;AAClG,MAAM,CAAC,MAAM,aAAa,GACxB,iKAAiK,CAAC;AAEpK,MAAM,WAAW,GAAG;IAClB,mBAAmB,EAAE,0BAA0B;IAC/C,iBAAiB,EAAE,wBAAwB;IAC3C,cAAc,EAAE,qCAAqC;IACrD,oBAAoB,EAClB,sFAAsF;IACxF,qBAAqB,EAAE,0BAA0B;CACzC,CAAC;AAKX,0FAA0F;AAC1F,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IACpC,MAAM,CAA0B;IACzC,YAAY,MAA+B,EAAE,MAAe;QAC1D,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC;QACzF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAKD,6EAA6E;AAC7E,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,OAAO,aAAa,qBAAqB,YAAY,KAAK,EAAE,CAAC;AAC/D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,GAAG,IAAI,IAAI,CAAC;QACZ,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC;IACD,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;AACzB,CAAC;AAED,8DAA8D;AAC9D,MAAM,CAAC,MAAM,YAAY,GAAa,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAE7F,yEAAyE;AACzE,MAAM,UAAU,MAAM,CAAC,CAAoB,EAAE,CAAoB;IAC/D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAChB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACZ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IACD,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAClC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAwB,EACxB,OAA+E;IAE/E,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;SACtD,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,oGAAoG;AACpG,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC7C,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;AACrG,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,wBAAwB;IACtC,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5C,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,GAAG,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,aAAa,EAAE;QACnD,GAAG,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,SAAS,EAAE,CAAC;KAC1E,CAAC,CAAC,CAAC;AACN,CAAC;AAWD,4EAA4E;AAC5E,MAAM,UAAU,cAAc,CAAC,OAA8B;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,sBAAsB,CAAC;IACtD,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,kBAAkB,CAAC;IAChE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,iBAAiB,CAAC;IACzD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;IAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChD,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;QACrB,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,CAAC;YACH,IAAI,QAAkB,CAAC;YACvB,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,SAAS,CAAC,GAAG,IAAI,YAAY,EAAE;oBAC9C,MAAM,EAAE,MAAM;oBACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;oBAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;oBAClD,MAAM,EAAE,UAAU,CAAC,MAAM;iBAC1B,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,UAAU,CAAC,MAAM,CAAC,OAAO;oBAAE,MAAM,IAAI,oBAAoB,CAAC,qBAAqB,CAAC,CAAC;gBACrF,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;YACtD,CAAC;YACD,2FAA2F;YAC3F,IAAI,QAAQ,CAAC,MAAM,KAAK,GAAG;gBAAE,MAAM,IAAI,oBAAoB,CAAC,iBAAiB,CAAC,CAAC;YAC/E,wEAAwE;YACxE,iEAAiE;YACjE,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAAE,MAAM,IAAI,oBAAoB,CAAC,cAAc,EAAE,UAAU,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9F,IAAI,IAAa,CAAC;YAClB,IAAI,CAAC;gBACH,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC;YAAC,MAAM,CAAC;gBACP,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;YACvD,CAAC;YACD,MAAM,UAAU,GAAI,IAAiC,CAAC,UAAU,CAAC;YACjE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;gBACrE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;YACvD,CAAC;YACD,MAAM,OAAO,GAAe,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACxH,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;gBACvD,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAWD,SAAS,OAAO,CAAC,IAAY,EAAE,KAAqB;IAClD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC1C,OAAO,GAAG,IAAI,+HAA+H,CAAC;AAChJ,CAAC;AAED,qGAAqG;AACrG,SAAS,WAAW,CAAC,KAAqB,EAAE,MAA+B;IACzE,OAAO,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,cAAc,CAAC,KAAqB,EAAE,QAA2B,EAAE,MAA+B;IACzG,OAAO;QACL,UAAU,EAAE,UAAU;QACtB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,IAAI;QACf,QAAQ;QACR,IAAI,EAAE,OAAO,CAAC,0DAA0D,WAAW,CAAC,MAAM,CAAC,6BAA6B,EAAE,KAAK,CAAC;KACjI,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAKpC;IACC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO;YACL,UAAU,EAAE,eAAe;YAC3B,QAAQ,EAAE,IAAI;YACd,SAAS,EAAE,IAAI;YACf,QAAQ;YACR,IAAI,EAAE,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC;SAC3C,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1F,IAAI,OAAuC,CAAC;IAC5C,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,oBAAoB;YAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrG,MAAM,KAAK,CAAC;IACd,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;QAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,oBAAoB,CAAC,CAAC;IACxG,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,YAAY,CAC5B,OAAO,CAAC,CAAC,CAAE,EACX,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,CAAE,EAAE,CAAC,CAAC,CACrF,CAAC;QACF,OAAO;YACL,UAAU,EAAE,MAAM;YAClB,QAAQ,EAAE,IAAI;YACd,SAAS;YACT,QAAQ;YACR,IAAI,EAAE,OAAO,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACzC,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,oBAAoB;YAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrG,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["/**\n * Optional embedding retrieval. An embedder proposes an order. `rankByStructure`\n * decides what is accepted. Cosine similarity does not enter that score.\n *\n * The Ollama implementation speaks HTTP to a local process. Nothing here\n * imports an embedding library, and nothing calls out of process unless a\n * caller asks for embeddings and supplies that implementation.\n *\n * The query form is the one registered in pre-registration Amendment 11.\n * Corpus records are embedded as their text, with no instruction prefix.\n *\n * @module atlas/benchmark/hybrid-retrieval\n * @internal\n */\n\nimport { CANONICAL_EQUATIONS } from '../../canonical/registry.js';\nimport { rankByStructure, type CorpusRecord, type RetrievalQuery } from './baselines.js';\n\n/** The instruction line registered with the embedding condition. @internal */\nexport const EMBEDDING_INSTRUCTION =\n  'Given a physics claim, retrieve the established physical relation that the claim restates or misuses';\n\n/** qwen3-embedding:4b, the model the design names. The package does not install it. @internal */\nexport const OLLAMA_EMBEDDING_MODEL = 'qwen3-embedding:4b';\n\n/**\n * Length stored in the frozen vector file\n * `docs/research/criterion3/embeddings/qwen3-embedding-4b.json`.\n * A live reply of another length is not that file's vector.\n * @internal\n */\nexport const FROZEN_VECTOR_DIMS = 2560;\n\n/** SHA-256 of that frozen file, as registered in Amendment 11. @internal */\nexport const FROZEN_VECTOR_SHA256 = '8fd79d2c6aaaf95c67f9a29ceb5fe4b88b42970c8e514d98c72c00a2c519cbdc';\n\n/**\n * How long a local Ollama call may run before it counts as not finishing.\n * The design names that outcome and does not name a duration.\n * @internal\n */\nexport const OLLAMA_TIMEOUT_MS = 5000;\n\n/** What the caller hears when embeddings were not asked for. @internal */\nexport const ATLAS_ONLY_NOTE = 'Embeddings were not requested. This is the atlas search.';\n\n/** What the caller hears when an embedding order was computed and then not accepted. @internal */\nexport const PROPOSAL_NOTE =\n  'The embedding order is a proposal, not evidence and not an acceptance. The atlas search accepted a separate order. Cosine similarity does not enter that score.';\n\nconst REASON_TEXT = {\n  'process-not-there': 'the process is not there',\n  'model-not-there': 'the model is not there',\n  'server-error': 'the server answered an error status',\n  'reply-not-a-vector':\n    'the reply is not a vector, or its length is not the length stored in the frozen file',\n  'call-did-not-finish': 'the call does not finish',\n} as const;\n\n/** Why an embedding request fell back to the atlas search. @internal */\nexport type EmbeddingFallbackReason = keyof typeof REASON_TEXT;\n\n/** An embedding request that cannot be used. The atlas search still answers. @internal */\nexport class EmbeddingUnavailable extends Error {\n  readonly reason: EmbeddingFallbackReason;\n  constructor(reason: EmbeddingFallbackReason, detail?: string) {\n    super(detail === undefined ? REASON_TEXT[reason] : `${REASON_TEXT[reason]} (${detail})`);\n    this.name = 'EmbeddingUnavailable';\n    this.reason = reason;\n  }\n}\n\n/** One vector per string, every vector the same length. @internal */\nexport type Embedder = (texts: readonly string[]) => Promise<readonly (readonly number[])[]>;\n\n/** `Instruct: …` newline `Query: …`, the registered query form. @internal */\nexport function queryInput(claim: string): string {\n  return `Instruct: ${EMBEDDING_INSTRUCTION}\\nQuery: ${claim}`;\n}\n\n/**\n * A pure function of the text. The same text is the same vector.\n * `v = [sum of char codes, sum of (index+1) times char code]`.\n * @internal\n */\nexport function stubVector(text: string): readonly number[] {\n  let sum = 0;\n  let weighted = 0;\n  for (let i = 0; i < text.length; i++) {\n    const code = text.charCodeAt(i);\n    sum += code;\n    weighted += (i + 1) * code;\n  }\n  return [sum, weighted];\n}\n\n/** The stub embedder. It does not open a socket. @internal */\nexport const stubEmbedder: Embedder = async (texts) => texts.map((text) => stubVector(text));\n\n/** Cosine similarity. Unequal lengths are not a similarity. @internal */\nexport function cosine(a: ArrayLike<number>, b: ArrayLike<number>): number {\n  if (a.length !== b.length) {\n    throw new EmbeddingUnavailable('reply-not-a-vector');\n  }\n  let dot = 0;\n  let na = 0;\n  let nb = 0;\n  for (let i = 0; i < a.length; i++) {\n    const x = a[i]!;\n    const y = b[i]!;\n    dot += x * y;\n    na += x * x;\n    nb += y * y;\n  }\n  if (na === 0 || nb === 0) return 0;\n  return dot / Math.sqrt(na * nb);\n}\n\n/**\n * Best cosine first. A tie breaks by record id, so the order does not depend\n * on which vector was computed last.\n * @internal\n */\nexport function rankByCosine(\n  query: ArrayLike<number>,\n  records: readonly { readonly id: string; readonly vector: ArrayLike<number> }[],\n): string[] {\n  return records\n    .map((r) => ({ id: r.id, s: cosine(query, r.vector) }))\n    .sort((a, b) => (b.s !== a.s ? b.s - a.s : a.id < b.id ? -1 : a.id > b.id ? 1 : 0))\n    .map((x) => x.id);\n}\n\n/** Decode a little-endian float32 vector stored as base64, the frozen file's encoding. @internal */\nexport function decodeFloat32(encoded: string): Float32Array {\n  const bytes = Buffer.from(encoded, 'base64');\n  if (bytes.byteLength === 0 || bytes.byteLength % 4 !== 0) {\n    throw new EmbeddingUnavailable('reply-not-a-vector');\n  }\n  return new Float32Array(bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength));\n}\n\n/** The live canonical registry as retrieval records. Text is the name and the latex. @internal */\nexport function canonicalRetrievalCorpus(): CorpusRecord[] {\n  return CANONICAL_EQUATIONS.map((equation) => ({\n    id: equation.id,\n    text: `${equation.name}. ${equation.formula_latex}`,\n    ...(equation.scalarAst === undefined ? {} : { expr: equation.scalarAst }),\n  }));\n}\n\n/** Where an Ollama embedder reaches the server, which model it asks for, and the vector width it expects. @internal */\nexport interface OllamaEmbedderOptions {\n  readonly baseUrl: string;\n  readonly model?: string;\n  readonly expectedDims?: number;\n  readonly timeoutMs?: number;\n  readonly fetchImpl?: (url: string, init?: RequestInit) => Promise<Response>;\n}\n\n/** A local Ollama embedder. Off unless a caller constructs it. @internal */\nexport function ollamaEmbedder(options: OllamaEmbedderOptions): Embedder {\n  const model = options.model ?? OLLAMA_EMBEDDING_MODEL;\n  const expectedDims = options.expectedDims ?? FROZEN_VECTOR_DIMS;\n  const timeoutMs = options.timeoutMs ?? OLLAMA_TIMEOUT_MS;\n  const fetchImpl = options.fetchImpl ?? fetch;\n  const base = options.baseUrl.replace(/\\/$/, '');\n  return async (texts) => {\n    const controller = new AbortController();\n    const timer = setTimeout(() => controller.abort(), timeoutMs);\n    try {\n      let response: Response;\n      try {\n        response = await fetchImpl(`${base}/api/embed`, {\n          method: 'POST',\n          headers: { 'content-type': 'application/json' },\n          body: JSON.stringify({ model, input: [...texts] }),\n          signal: controller.signal,\n        });\n      } catch {\n        if (controller.signal.aborted) throw new EmbeddingUnavailable('call-did-not-finish');\n        throw new EmbeddingUnavailable('process-not-there');\n      }\n      // Ollama answers an unknown model with 404; the status is the signal, not the body's text.\n      if (response.status === 404) throw new EmbeddingUnavailable('model-not-there');\n      // Any other error status is the server refusing the call: not an absent\n      // model, and not a reply whose shape was read and found wanting.\n      if (!response.ok) throw new EmbeddingUnavailable('server-error', `status ${response.status}`);\n      let body: unknown;\n      try {\n        body = await response.json();\n      } catch {\n        throw new EmbeddingUnavailable('reply-not-a-vector');\n      }\n      const embeddings = (body as { embeddings?: unknown }).embeddings;\n      if (!Array.isArray(embeddings) || embeddings.length !== texts.length) {\n        throw new EmbeddingUnavailable('reply-not-a-vector');\n      }\n      const vectors: number[][] = [];\n      for (const row of embeddings) {\n        if (!Array.isArray(row) || row.length !== expectedDims || row.some((x) => typeof x !== 'number' || !Number.isFinite(x))) {\n          throw new EmbeddingUnavailable('reply-not-a-vector');\n        }\n        vectors.push(row);\n      }\n      return vectors;\n    } finally {\n      clearTimeout(timer);\n    }\n  };\n}\n\n/** Both orders, kept apart. `accepted` is always `rankByStructure`. @internal */\nexport interface HybridRetrieval {\n  readonly embeddings: 'not-requested' | 'used' | 'fallback';\n  readonly fallback: EmbeddingFallbackReason | null;\n  readonly proposals: readonly string[] | null;\n  readonly accepted: readonly string[];\n  readonly note: string;\n}\n\nfunction noteFor(base: string, query: RetrievalQuery): string {\n  if (query.expr !== undefined) return base;\n  return `${base} The claim has no expression, so nothing is accepted: the atlas search ranks by structure, and a text claim has none to rank.`;\n}\n\n/** The atlas acceptance: by structure when the query has an expression; nothing for a text claim. */\nfunction acceptedFor(query: RetrievalQuery, corpus: readonly CorpusRecord[]): readonly string[] {\n  return query.expr === undefined ? [] : rankByStructure(query, corpus);\n}\n\nfunction fallbackResult(query: RetrievalQuery, accepted: readonly string[], reason: EmbeddingFallbackReason): HybridRetrieval {\n  return {\n    embeddings: 'fallback',\n    fallback: reason,\n    proposals: null,\n    accepted,\n    note: noteFor(`Embeddings were requested, but they could not be used: ${REASON_TEXT[reason]}. This is the atlas search.`, query),\n  };\n}\n\n/**\n * Atlas search, optionally after an embedding proposal. A fallback is the\n * atlas answer plus a named reason. It does not throw.\n * @internal\n */\nexport async function retrieveHybrid(args: {\n  readonly query: RetrievalQuery;\n  readonly corpus: readonly CorpusRecord[];\n  readonly embeddings?: boolean;\n  readonly embedder?: Embedder;\n}): Promise<HybridRetrieval> {\n  const accepted = acceptedFor(args.query, args.corpus);\n  if (args.embeddings !== true) {\n    return {\n      embeddings: 'not-requested',\n      fallback: null,\n      proposals: null,\n      accepted,\n      note: noteFor(ATLAS_ONLY_NOTE, args.query),\n    };\n  }\n  if (args.embedder === undefined) {\n    return fallbackResult(args.query, accepted, 'process-not-there');\n  }\n  const inputs = [queryInput(args.query.text), ...args.corpus.map((record) => record.text)];\n  let vectors: readonly (readonly number[])[];\n  try {\n    vectors = await args.embedder(inputs);\n  } catch (error) {\n    if (error instanceof EmbeddingUnavailable) return fallbackResult(args.query, accepted, error.reason);\n    throw error;\n  }\n  if (vectors.length !== inputs.length) return fallbackResult(args.query, accepted, 'reply-not-a-vector');\n  try {\n    const proposals = rankByCosine(\n      vectors[0]!,\n      args.corpus.map((record, index) => ({ id: record.id, vector: vectors[index + 1]! })),\n    );\n    return {\n      embeddings: 'used',\n      fallback: null,\n      proposals,\n      accepted,\n      note: noteFor(PROPOSAL_NOTE, args.query),\n    };\n  } catch (error) {\n    if (error instanceof EmbeddingUnavailable) return fallbackResult(args.query, accepted, error.reason);\n    throw error;\n  }\n}\n"]}
+{"version":3,"file":"hybrid-retrieval.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/hybrid-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAClE,OAAO,EAAE,eAAe,EAA0C,MAAM,gBAAgB,CAAC;AAEzF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,qBAAqB,GAChC,sGAAsG,CAAC;AAEzG,iGAAiG;AACjG,MAAM,CAAC,MAAM,sBAAsB,GAAG,oBAAoB,CAAC;AAE3D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC,4EAA4E;AAC5E,MAAM,CAAC,MAAM,oBAAoB,GAAG,kEAAkE,CAAC;AAEvG;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAEtC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,eAAe,GAAG,0DAA0D,CAAC;AAE1F,kGAAkG;AAClG,MAAM,CAAC,MAAM,aAAa,GACxB,iKAAiK,CAAC;AAEpK,MAAM,WAAW,GAAG;IAClB,mBAAmB,EAAE,0BAA0B;IAC/C,iBAAiB,EAAE,wBAAwB;IAC3C,cAAc,EAAE,qCAAqC;IACrD,oBAAoB,EAClB,sFAAsF;IACxF,qBAAqB,EAAE,0BAA0B;CACzC,CAAC;AAKX,0FAA0F;AAC1F,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IACpC,MAAM,CAA0B;IACzC,YAAY,MAA+B,EAAE,MAAe;QAC1D,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC;QACzF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAKD,6EAA6E;AAC7E,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,OAAO,aAAa,qBAAqB,YAAY,KAAK,EAAE,CAAC;AAC/D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,GAAG,IAAI,IAAI,CAAC;QACZ,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC;IACD,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;AACzB,CAAC;AAED,8DAA8D;AAC9D,MAAM,CAAC,MAAM,YAAY,GAAa,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAE7F;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAC,CAAoB,EAAE,CAAoB;IAC/D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAwB,EACxB,OAA+E;IAE/E,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;SACtD,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,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACxE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED,oGAAoG;AACpG,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC7C,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;AACrG,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,wBAAwB;IACtC,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5C,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,GAAG,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,aAAa,EAAE;QACnD,GAAG,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,SAAS,EAAE,CAAC;KAC1E,CAAC,CAAC,CAAC;AACN,CAAC;AAWD,4EAA4E;AAC5E,MAAM,UAAU,cAAc,CAAC,OAA8B;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,sBAAsB,CAAC;IACtD,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,kBAAkB,CAAC;IAChE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,iBAAiB,CAAC;IACzD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;IAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChD,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;QACrB,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,CAAC;YACH,IAAI,QAAkB,CAAC;YACvB,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,SAAS,CAAC,GAAG,IAAI,YAAY,EAAE;oBAC9C,MAAM,EAAE,MAAM;oBACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;oBAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;oBAClD,MAAM,EAAE,UAAU,CAAC,MAAM;iBAC1B,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,UAAU,CAAC,MAAM,CAAC,OAAO;oBAAE,MAAM,IAAI,oBAAoB,CAAC,qBAAqB,CAAC,CAAC;gBACrF,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;YACtD,CAAC;YACD,2FAA2F;YAC3F,IAAI,QAAQ,CAAC,MAAM,KAAK,GAAG;gBAAE,MAAM,IAAI,oBAAoB,CAAC,iBAAiB,CAAC,CAAC;YAC/E,wEAAwE;YACxE,iEAAiE;YACjE,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAAE,MAAM,IAAI,oBAAoB,CAAC,cAAc,EAAE,UAAU,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9F,IAAI,IAAa,CAAC;YAClB,IAAI,CAAC;gBACH,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC;YAAC,MAAM,CAAC;gBACP,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;YACvD,CAAC;YACD,MAAM,UAAU,GAAI,IAAiC,CAAC,UAAU,CAAC;YACjE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;gBACrE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;YACvD,CAAC;YACD,MAAM,OAAO,GAAe,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACxH,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;gBACvD,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAWD,SAAS,OAAO,CAAC,IAAY,EAAE,KAAqB;IAClD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC1C,OAAO,GAAG,IAAI,+HAA+H,CAAC;AAChJ,CAAC;AAED,qGAAqG;AACrG,SAAS,WAAW,CAAC,KAAqB,EAAE,MAA+B;IACzE,OAAO,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,cAAc,CAAC,KAAqB,EAAE,QAA2B,EAAE,MAA+B;IACzG,OAAO;QACL,UAAU,EAAE,UAAU;QACtB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,IAAI;QACf,QAAQ;QACR,IAAI,EAAE,OAAO,CAAC,0DAA0D,WAAW,CAAC,MAAM,CAAC,6BAA6B,EAAE,KAAK,CAAC;KACjI,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAKpC;IACC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO;YACL,UAAU,EAAE,eAAe;YAC3B,QAAQ,EAAE,IAAI;YACd,SAAS,EAAE,IAAI;YACf,QAAQ;YACR,IAAI,EAAE,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC;SAC3C,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1F,IAAI,OAAuC,CAAC;IAC5C,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,oBAAoB;YAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrG,MAAM,KAAK,CAAC;IACd,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;QAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,oBAAoB,CAAC,CAAC;IACxG,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,YAAY,CAC5B,OAAO,CAAC,CAAC,CAAE,EACX,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,CAAE,EAAE,CAAC,CAAC,CACrF,CAAC;QACF,OAAO;YACL,UAAU,EAAE,MAAM;YAClB,QAAQ,EAAE,IAAI;YACd,SAAS;YACT,QAAQ;YACR,IAAI,EAAE,OAAO,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACzC,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,oBAAoB;YAAE,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrG,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["/**\n * Optional embedding retrieval. An embedder proposes an order. `rankByStructure`\n * decides what is accepted. Cosine similarity does not enter that score.\n *\n * The Ollama implementation speaks HTTP to a local process. Nothing here\n * imports an embedding library, and nothing calls out of process unless a\n * caller asks for embeddings and supplies that implementation.\n *\n * The query form is the one registered in pre-registration Amendment 11.\n * Corpus records are embedded as their text, with no instruction prefix.\n *\n * @module atlas/benchmark/hybrid-retrieval\n * @internal\n */\n\nimport { pairwiseDot } from '@danielsimonjr/mathts-core';\nimport { compareCodepoint } from '../../core/compare.js';\nimport { CANONICAL_EQUATIONS } from '../../canonical/registry.js';\nimport { rankByStructure, type CorpusRecord, type RetrievalQuery } from './baselines.js';\n\n/** The instruction line registered with the embedding condition. @internal */\nexport const EMBEDDING_INSTRUCTION =\n  'Given a physics claim, retrieve the established physical relation that the claim restates or misuses';\n\n/** qwen3-embedding:4b, the model the design names. The package does not install it. @internal */\nexport const OLLAMA_EMBEDDING_MODEL = 'qwen3-embedding:4b';\n\n/**\n * Length stored in the frozen vector file\n * `docs/research/criterion3/embeddings/qwen3-embedding-4b.json`.\n * A live reply of another length is not that file's vector.\n * @internal\n */\nexport const FROZEN_VECTOR_DIMS = 2560;\n\n/** SHA-256 of that frozen file, as registered in Amendment 11. @internal */\nexport const FROZEN_VECTOR_SHA256 = '8fd79d2c6aaaf95c67f9a29ceb5fe4b88b42970c8e514d98c72c00a2c519cbdc';\n\n/**\n * How long a local Ollama call may run before it counts as not finishing.\n * The design names that outcome and does not name a duration.\n * @internal\n */\nexport const OLLAMA_TIMEOUT_MS = 5000;\n\n/** What the caller hears when embeddings were not asked for. @internal */\nexport const ATLAS_ONLY_NOTE = 'Embeddings were not requested. This is the atlas search.';\n\n/** What the caller hears when an embedding order was computed and then not accepted. @internal */\nexport const PROPOSAL_NOTE =\n  'The embedding order is a proposal, not evidence and not an acceptance. The atlas search accepted a separate order. Cosine similarity does not enter that score.';\n\nconst REASON_TEXT = {\n  'process-not-there': 'the process is not there',\n  'model-not-there': 'the model is not there',\n  'server-error': 'the server answered an error status',\n  'reply-not-a-vector':\n    'the reply is not a vector, or its length is not the length stored in the frozen file',\n  'call-did-not-finish': 'the call does not finish',\n} as const;\n\n/** Why an embedding request fell back to the atlas search. @internal */\nexport type EmbeddingFallbackReason = keyof typeof REASON_TEXT;\n\n/** An embedding request that cannot be used. The atlas search still answers. @internal */\nexport class EmbeddingUnavailable extends Error {\n  readonly reason: EmbeddingFallbackReason;\n  constructor(reason: EmbeddingFallbackReason, detail?: string) {\n    super(detail === undefined ? REASON_TEXT[reason] : `${REASON_TEXT[reason]} (${detail})`);\n    this.name = 'EmbeddingUnavailable';\n    this.reason = reason;\n  }\n}\n\n/** One vector per string, every vector the same length. @internal */\nexport type Embedder = (texts: readonly string[]) => Promise<readonly (readonly number[])[]>;\n\n/** `Instruct: …` newline `Query: …`, the registered query form. @internal */\nexport function queryInput(claim: string): string {\n  return `Instruct: ${EMBEDDING_INSTRUCTION}\\nQuery: ${claim}`;\n}\n\n/**\n * A pure function of the text. The same text is the same vector.\n * `v = [sum of char codes, sum of (index+1) times char code]`.\n * @internal\n */\nexport function stubVector(text: string): readonly number[] {\n  let sum = 0;\n  let weighted = 0;\n  for (let i = 0; i < text.length; i++) {\n    const code = text.charCodeAt(i);\n    sum += code;\n    weighted += (i + 1) * code;\n  }\n  return [sum, weighted];\n}\n\n/** The stub embedder. It does not open a socket. @internal */\nexport const stubEmbedder: Embedder = async (texts) => texts.map((text) => stubVector(text));\n\n/**\n * Cosine similarity, from MathTS core's `pairwiseDot` (pairwise summation over\n * any `ArrayLike<number>`, the frozen `Float32Array` vectors included; the\n * typed `dot` of the functions package takes a plain array or a `Float64Array`\n * only, and routes the latter to an async path). The norms are the same dot\n * product, so a vector against itself is exactly 1 (`√(x·x) = x`).\n * Unequal lengths are not a similarity.\n * @internal\n */\nexport function cosine(a: ArrayLike<number>, b: ArrayLike<number>): number {\n  if (a.length !== b.length) {\n    throw new EmbeddingUnavailable('reply-not-a-vector');\n  }\n  const na = pairwiseDot(a, a);\n  const nb = pairwiseDot(b, b);\n  if (na === 0 || nb === 0) return 0;\n  return pairwiseDot(a, b) / Math.sqrt(na * nb);\n}\n\n/**\n * Best cosine first. A tie breaks by record id, so the order does not depend\n * on which vector was computed last.\n * @internal\n */\nexport function rankByCosine(\n  query: ArrayLike<number>,\n  records: readonly { readonly id: string; readonly vector: ArrayLike<number> }[],\n): string[] {\n  return records\n    .map((r) => ({ id: r.id, s: cosine(query, r.vector) }))\n    .sort((a, b) => (b.s !== a.s ? b.s - a.s : compareCodepoint(a.id, b.id)))\n    .map((x) => x.id);\n}\n\n/** Decode a little-endian float32 vector stored as base64, the frozen file's encoding. @internal */\nexport function decodeFloat32(encoded: string): Float32Array {\n  const bytes = Buffer.from(encoded, 'base64');\n  if (bytes.byteLength === 0 || bytes.byteLength % 4 !== 0) {\n    throw new EmbeddingUnavailable('reply-not-a-vector');\n  }\n  return new Float32Array(bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength));\n}\n\n/** The live canonical registry as retrieval records. Text is the name and the latex. @internal */\nexport function canonicalRetrievalCorpus(): CorpusRecord[] {\n  return CANONICAL_EQUATIONS.map((equation) => ({\n    id: equation.id,\n    text: `${equation.name}. ${equation.formula_latex}`,\n    ...(equation.scalarAst === undefined ? {} : { expr: equation.scalarAst }),\n  }));\n}\n\n/** Where an Ollama embedder reaches the server, which model it asks for, and the vector width it expects. @internal */\nexport interface OllamaEmbedderOptions {\n  readonly baseUrl: string;\n  readonly model?: string;\n  readonly expectedDims?: number;\n  readonly timeoutMs?: number;\n  readonly fetchImpl?: (url: string, init?: RequestInit) => Promise<Response>;\n}\n\n/** A local Ollama embedder. Off unless a caller constructs it. @internal */\nexport function ollamaEmbedder(options: OllamaEmbedderOptions): Embedder {\n  const model = options.model ?? OLLAMA_EMBEDDING_MODEL;\n  const expectedDims = options.expectedDims ?? FROZEN_VECTOR_DIMS;\n  const timeoutMs = options.timeoutMs ?? OLLAMA_TIMEOUT_MS;\n  const fetchImpl = options.fetchImpl ?? fetch;\n  const base = options.baseUrl.replace(/\\/$/, '');\n  return async (texts) => {\n    const controller = new AbortController();\n    const timer = setTimeout(() => controller.abort(), timeoutMs);\n    try {\n      let response: Response;\n      try {\n        response = await fetchImpl(`${base}/api/embed`, {\n          method: 'POST',\n          headers: { 'content-type': 'application/json' },\n          body: JSON.stringify({ model, input: [...texts] }),\n          signal: controller.signal,\n        });\n      } catch {\n        if (controller.signal.aborted) throw new EmbeddingUnavailable('call-did-not-finish');\n        throw new EmbeddingUnavailable('process-not-there');\n      }\n      // Ollama answers an unknown model with 404; the status is the signal, not the body's text.\n      if (response.status === 404) throw new EmbeddingUnavailable('model-not-there');\n      // Any other error status is the server refusing the call: not an absent\n      // model, and not a reply whose shape was read and found wanting.\n      if (!response.ok) throw new EmbeddingUnavailable('server-error', `status ${response.status}`);\n      let body: unknown;\n      try {\n        body = await response.json();\n      } catch {\n        throw new EmbeddingUnavailable('reply-not-a-vector');\n      }\n      const embeddings = (body as { embeddings?: unknown }).embeddings;\n      if (!Array.isArray(embeddings) || embeddings.length !== texts.length) {\n        throw new EmbeddingUnavailable('reply-not-a-vector');\n      }\n      const vectors: number[][] = [];\n      for (const row of embeddings) {\n        if (!Array.isArray(row) || row.length !== expectedDims || row.some((x) => typeof x !== 'number' || !Number.isFinite(x))) {\n          throw new EmbeddingUnavailable('reply-not-a-vector');\n        }\n        vectors.push(row);\n      }\n      return vectors;\n    } finally {\n      clearTimeout(timer);\n    }\n  };\n}\n\n/** Both orders, kept apart. `accepted` is always `rankByStructure`. @internal */\nexport interface HybridRetrieval {\n  readonly embeddings: 'not-requested' | 'used' | 'fallback';\n  readonly fallback: EmbeddingFallbackReason | null;\n  readonly proposals: readonly string[] | null;\n  readonly accepted: readonly string[];\n  readonly note: string;\n}\n\nfunction noteFor(base: string, query: RetrievalQuery): string {\n  if (query.expr !== undefined) return base;\n  return `${base} The claim has no expression, so nothing is accepted: the atlas search ranks by structure, and a text claim has none to rank.`;\n}\n\n/** The atlas acceptance: by structure when the query has an expression; nothing for a text claim. */\nfunction acceptedFor(query: RetrievalQuery, corpus: readonly CorpusRecord[]): readonly string[] {\n  return query.expr === undefined ? [] : rankByStructure(query, corpus);\n}\n\nfunction fallbackResult(query: RetrievalQuery, accepted: readonly string[], reason: EmbeddingFallbackReason): HybridRetrieval {\n  return {\n    embeddings: 'fallback',\n    fallback: reason,\n    proposals: null,\n    accepted,\n    note: noteFor(`Embeddings were requested, but they could not be used: ${REASON_TEXT[reason]}. This is the atlas search.`, query),\n  };\n}\n\n/**\n * Atlas search, optionally after an embedding proposal. A fallback is the\n * atlas answer plus a named reason. It does not throw.\n * @internal\n */\nexport async function retrieveHybrid(args: {\n  readonly query: RetrievalQuery;\n  readonly corpus: readonly CorpusRecord[];\n  readonly embeddings?: boolean;\n  readonly embedder?: Embedder;\n}): Promise<HybridRetrieval> {\n  const accepted = acceptedFor(args.query, args.corpus);\n  if (args.embeddings !== true) {\n    return {\n      embeddings: 'not-requested',\n      fallback: null,\n      proposals: null,\n      accepted,\n      note: noteFor(ATLAS_ONLY_NOTE, args.query),\n    };\n  }\n  if (args.embedder === undefined) {\n    return fallbackResult(args.query, accepted, 'process-not-there');\n  }\n  const inputs = [queryInput(args.query.text), ...args.corpus.map((record) => record.text)];\n  let vectors: readonly (readonly number[])[];\n  try {\n    vectors = await args.embedder(inputs);\n  } catch (error) {\n    if (error instanceof EmbeddingUnavailable) return fallbackResult(args.query, accepted, error.reason);\n    throw error;\n  }\n  if (vectors.length !== inputs.length) return fallbackResult(args.query, accepted, 'reply-not-a-vector');\n  try {\n    const proposals = rankByCosine(\n      vectors[0]!,\n      args.corpus.map((record, index) => ({ id: record.id, vector: vectors[index + 1]! })),\n    );\n    return {\n      embeddings: 'used',\n      fallback: null,\n      proposals,\n      accepted,\n      note: noteFor(PROPOSAL_NOTE, args.query),\n    };\n  } catch (error) {\n    if (error instanceof EmbeddingUnavailable) return fallbackResult(args.query, accepted, error.reason);\n    throw error;\n  }\n}\n"]}

package/dist/atlas/benchmark/loader.js

@@ -16,7 +16,7 @@
  * @module atlas/benchmark/loader
  * @internal
  */
-import { readFileSync } from 'node:fs';
+import { readJsonFile } from '../../core/data-file.js';
 import { join } from 'node:path';
 import { HELD_OUT_FAMILY } from './types.js';
 /**
@@ -69,7 +69,7 @@ export class BenchmarkAdmissionError extends Error {
     }
 }
 function readItems(file) {
-    const parsed = JSON.parse(readFileSync(file, 'utf-8'));
+    const parsed = readJsonFile(file);
     if (!Array.isArray(parsed))
         throw new Error(`${file}: expected a JSON array of items`);
     return parsed;

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

@@ -1 +1 @@
-{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAS7C;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,KAA+B,EAAE,MAAe;IAC5E,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,OAAe,EAAQ,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,cAAc,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,iBAAiB,CAAC;QAC1D,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YAC/B,CAAC,CAAC,eAAe,IAAI,CAAC,UAAU,eAAe,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,kBAAkB,MAAM,GAAG,CAAC,CAAC;QAC7G,CAAC;QACD,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAI,MAAM,IAAI,IAAI,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;YAC5C,CAAC,CAAC,yFAAyF,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,EAAE,CAAC;YACtE,CAAC,CAAC,sCAAsC,eAAe,yBAAyB,IAAI,CAAC,MAAM,eAAe,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC3H,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,CAAC,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE;YAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAClF,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAC3B,QAAQ;IAA7B,YAAqB,QAAgC;QACnD,KAAK,CACH,uCAAuC,QAAQ;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;aACnC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChB,CAAC;wBALiB,QAAQ;IAM7B,CAAC;CACF;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAY,CAAC;IAClE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,kCAAkC,CAAC,CAAC;IACvF,OAAO,MAAyB,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,YAAoB;IAClD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,YAAoB;IACtD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Atlas Phase 5, S5.1 — load and validate benchmark items.\n *\n * Design note: `docs/planning/Atlas-Phase-5-Design.md` §0, §2.\n *\n * This module reads the PUBLIC half of a benchmark directory and nothing else.\n * The answers live in a sibling half that no `src/` file may read;\n * `tests/atlas/benchmark.test.ts` holds the import guard, with a positive\n * control proving the guard can fire.\n *\n * **The loader enforces the one part of the independence rule that code CAN\n * enforce: a frozen item whose `authorship` is not `'independent'` is refused.**\n * Whether the author really was independent is a fact about people, recorded in\n * the pre-registration note and checked by review.\n *\n * @module atlas/benchmark/loader\n * @internal\n */\n\nimport { readFileSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { HELD_OUT_FAMILY } from './types.js';\nimport type { BenchmarkItem } from './types.js';\n\n/** One reason an item set is not admissible. @internal */\nexport interface ItemProblem {\n  readonly id: string;\n  readonly problem: string;\n}\n\n/**\n * Validate an item set against the schema and the rules that make it a benchmark.\n *\n * @param items - the items, as parsed.\n * @param frozen - true for the frozen set (authorship must be `'independent'`),\n * false for the contested staging area (authorship must be `'contested-draft'`).\n * @returns every problem found; empty means admissible. Never throws, so a\n * caller sees ALL problems at once rather than the first.\n * @internal\n */\nexport function validateItems(items: readonly BenchmarkItem[], frozen: boolean): ItemProblem[] {\n  const problems: ItemProblem[] = [];\n  const seen = new Set<string>();\n  for (const item of items) {\n    const p = (problem: string): void => {\n      problems.push({ id: item.id, problem });\n    };\n    if (seen.has(item.id)) p('duplicate id');\n    seen.add(item.id);\n\n    const wanted = frozen ? 'independent' : 'contested-draft';\n    if (item.authorship !== wanted) {\n      p(`authorship '${item.authorship}' where the ${frozen ? 'frozen' : 'contested'} set requires '${wanted}'`);\n    }\n    // The answer lives in the scorer half. A public item that carries it would\n    // hand the key to any condition that reads the public file.\n    if ('kind' in item || 'failureKind' in item) {\n      p('the public half carries the answer (kind/failureKind); it belongs in scorer/labels.json');\n    }\n    if ((item.family === HELD_OUT_FAMILY) !== (item.split === 'held-out')) {\n      p(`the held-out split is exactly the '${HELD_OUT_FAMILY}' family; got family '${item.family}' in split '${item.split}'`);\n    }\n    if (item.premises.length === 0) p('no premises');\n    if (item.source.trim() === '') p('no source');\n  }\n  return problems;\n}\n\n/** Thrown when a benchmark directory holds an inadmissible item set. @internal */\nexport class BenchmarkAdmissionError extends Error {\n  constructor(readonly problems: readonly ItemProblem[]) {\n    super(\n      `benchmark items are not admissible: ${problems\n        .map((p) => `${p.id}: ${p.problem}`)\n        .join('; ')}`,\n    );\n  }\n}\n\nfunction readItems(file: string): BenchmarkItem[] {\n  const parsed = JSON.parse(readFileSync(file, 'utf-8')) as unknown;\n  if (!Array.isArray(parsed)) throw new Error(`${file}: expected a JSON array of items`);\n  return parsed as BenchmarkItem[];\n}\n\n/**\n * Load the FROZEN items from `<benchmarkDir>/public/items.json`.\n *\n * @throws BenchmarkAdmissionError when any item is inadmissible — a frozen set\n * with one contested draft in it is not a smaller benchmark, it is a broken one.\n * @internal\n */\nexport function loadFrozenItems(benchmarkDir: string): BenchmarkItem[] {\n  const items = readItems(join(benchmarkDir, 'public', 'items.json'));\n  const problems = validateItems(items, true);\n  if (problems.length > 0) throw new BenchmarkAdmissionError(problems);\n  return items;\n}\n\n/**\n * Load the CONTESTED drafts from `<benchmarkDir>/contested/items.json`. These are\n * never scored; they wait for an independent author to accept or rewrite them.\n *\n * @internal\n */\nexport function loadContestedDrafts(benchmarkDir: string): BenchmarkItem[] {\n  const items = readItems(join(benchmarkDir, 'contested', 'items.json'));\n  const problems = validateItems(items, false);\n  if (problems.length > 0) throw new BenchmarkAdmissionError(problems);\n  return items;\n}\n"]}
+{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAS7C;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,KAA+B,EAAE,MAAe;IAC5E,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,OAAe,EAAQ,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,cAAc,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,iBAAiB,CAAC;QAC1D,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YAC/B,CAAC,CAAC,eAAe,IAAI,CAAC,UAAU,eAAe,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,kBAAkB,MAAM,GAAG,CAAC,CAAC;QAC7G,CAAC;QACD,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAI,MAAM,IAAI,IAAI,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;YAC5C,CAAC,CAAC,yFAAyF,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,EAAE,CAAC;YACtE,CAAC,CAAC,sCAAsC,eAAe,yBAAyB,IAAI,CAAC,MAAM,eAAe,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC3H,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,CAAC,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE;YAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAClF,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAC3B,QAAQ;IAA7B,YAAqB,QAAgC;QACnD,KAAK,CACH,uCAAuC,QAAQ;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;aACnC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChB,CAAC;wBALiB,QAAQ;IAM7B,CAAC;CACF;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,kCAAkC,CAAC,CAAC;IACvF,OAAO,MAAyB,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,YAAoB;IAClD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,YAAoB;IACtD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Atlas Phase 5, S5.1 — load and validate benchmark items.\n *\n * Design note: `docs/planning/Atlas-Phase-5-Design.md` §0, §2.\n *\n * This module reads the PUBLIC half of a benchmark directory and nothing else.\n * The answers live in a sibling half that no `src/` file may read;\n * `tests/atlas/benchmark.test.ts` holds the import guard, with a positive\n * control proving the guard can fire.\n *\n * **The loader enforces the one part of the independence rule that code CAN\n * enforce: a frozen item whose `authorship` is not `'independent'` is refused.**\n * Whether the author really was independent is a fact about people, recorded in\n * the pre-registration note and checked by review.\n *\n * @module atlas/benchmark/loader\n * @internal\n */\n\nimport { readJsonFile } from '../../core/data-file.js';\nimport { join } from 'node:path';\nimport { HELD_OUT_FAMILY } from './types.js';\nimport type { BenchmarkItem } from './types.js';\n\n/** One reason an item set is not admissible. @internal */\nexport interface ItemProblem {\n  readonly id: string;\n  readonly problem: string;\n}\n\n/**\n * Validate an item set against the schema and the rules that make it a benchmark.\n *\n * @param items - the items, as parsed.\n * @param frozen - true for the frozen set (authorship must be `'independent'`),\n * false for the contested staging area (authorship must be `'contested-draft'`).\n * @returns every problem found; empty means admissible. Never throws, so a\n * caller sees ALL problems at once rather than the first.\n * @internal\n */\nexport function validateItems(items: readonly BenchmarkItem[], frozen: boolean): ItemProblem[] {\n  const problems: ItemProblem[] = [];\n  const seen = new Set<string>();\n  for (const item of items) {\n    const p = (problem: string): void => {\n      problems.push({ id: item.id, problem });\n    };\n    if (seen.has(item.id)) p('duplicate id');\n    seen.add(item.id);\n\n    const wanted = frozen ? 'independent' : 'contested-draft';\n    if (item.authorship !== wanted) {\n      p(`authorship '${item.authorship}' where the ${frozen ? 'frozen' : 'contested'} set requires '${wanted}'`);\n    }\n    // The answer lives in the scorer half. A public item that carries it would\n    // hand the key to any condition that reads the public file.\n    if ('kind' in item || 'failureKind' in item) {\n      p('the public half carries the answer (kind/failureKind); it belongs in scorer/labels.json');\n    }\n    if ((item.family === HELD_OUT_FAMILY) !== (item.split === 'held-out')) {\n      p(`the held-out split is exactly the '${HELD_OUT_FAMILY}' family; got family '${item.family}' in split '${item.split}'`);\n    }\n    if (item.premises.length === 0) p('no premises');\n    if (item.source.trim() === '') p('no source');\n  }\n  return problems;\n}\n\n/** Thrown when a benchmark directory holds an inadmissible item set. @internal */\nexport class BenchmarkAdmissionError extends Error {\n  constructor(readonly problems: readonly ItemProblem[]) {\n    super(\n      `benchmark items are not admissible: ${problems\n        .map((p) => `${p.id}: ${p.problem}`)\n        .join('; ')}`,\n    );\n  }\n}\n\nfunction readItems(file: string): BenchmarkItem[] {\n  const parsed = readJsonFile(file);\n  if (!Array.isArray(parsed)) throw new Error(`${file}: expected a JSON array of items`);\n  return parsed as BenchmarkItem[];\n}\n\n/**\n * Load the FROZEN items from `<benchmarkDir>/public/items.json`.\n *\n * @throws BenchmarkAdmissionError when any item is inadmissible — a frozen set\n * with one contested draft in it is not a smaller benchmark, it is a broken one.\n * @internal\n */\nexport function loadFrozenItems(benchmarkDir: string): BenchmarkItem[] {\n  const items = readItems(join(benchmarkDir, 'public', 'items.json'));\n  const problems = validateItems(items, true);\n  if (problems.length > 0) throw new BenchmarkAdmissionError(problems);\n  return items;\n}\n\n/**\n * Load the CONTESTED drafts from `<benchmarkDir>/contested/items.json`. These are\n * never scored; they wait for an independent author to accept or rewrite them.\n *\n * @internal\n */\nexport function loadContestedDrafts(benchmarkDir: string): BenchmarkItem[] {\n  const items = readItems(join(benchmarkDir, 'contested', 'items.json'));\n  const problems = validateItems(items, false);\n  if (problems.length > 0) throw new BenchmarkAdmissionError(problems);\n  return items;\n}\n"]}

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

@@ -13,8 +13,8 @@
  * @module atlas/benchmark/stats
  * @internal
  */
-/** The two-sided 95% normal quantile. @internal */
-export declare const Z95 = 1.959963984540054;
+/** The two-sided 95% normal quantile, MathTS `normalQuantile(0.975)` (1.959963984540054). @internal */
+export declare const Z95: number;
 /** A closed interval. @internal */
 export interface Interval {
     readonly lower: number;

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

@@ -1 +1 @@
-{"version":3,"file":"stats.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/stats.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,mDAAmD;AACnD,eAAO,MAAM,GAAG,oBAAoB,CAAC;AAErC,mCAAmC;AACnC,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,SAAM,GAAG,QAAQ,CAgB9E;AAED,wGAAwG;AACxG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wDAAwD;AACxD,MAAM,WAAW,aAAa;IAC5B,qIAAqI;IACrI,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,yEAAyE;IACzE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AASD;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,aAAa,CAQzD;AAED;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,SAAM,GAAG,QAAQ,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAuB1G;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,CAsB1E;AAED,0EAA0E;AAC1E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,6FAA6F;IAC7F,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,eAAe,SAAM,GAAG,WAAW,CAgBjF"}
+{"version":3,"file":"stats.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/stats.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,uGAAuG;AACvG,eAAO,MAAM,GAAG,EAAE,MAA8B,CAAC;AAEjD,mCAAmC;AACnC,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,SAAM,GAAG,QAAQ,CAgB9E;AAED,wGAAwG;AACxG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wDAAwD;AACxD,MAAM,WAAW,aAAa;IAC5B,qIAAqI;IACrI,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,yEAAyE;IACzE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,aAAa,CAQzD;AAED;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,SAAM,GAAG,QAAQ,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAuB1G;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,CAsB1E;AAED,0EAA0E;AAC1E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,6FAA6F;IAC7F,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,eAAe,SAAM,GAAG,WAAW,CAgBjF"}