@cubingcenter/scrambler 0.7.0 → 0.8.0

package/dist/puzzles/cube4/reduction/hc-pdb.js

@@ -163,30 +163,48 @@ export function generateHcPdb(onProgress) {
 }
 /** Number of reachable states (BFS orbit size). Fixed by the move set. */
 export const HC_REACHABLE = 58800;
-/** Build the dense index + unpacked distances from nibble-packed BFS output. */
+/** Build the compact coordinate list + unpacked distances from the packed PDB. */
 export function buildHcDense(packed) {
-    const index = new Int32Array(HC_PDB_STATES).fill(-1);
     let count = 0;
     for (let c = 0; c < HC_PDB_STATES; c++) {
         if (hcPdbDistance(packed, c) !== 0x0f)
-            index[c] = count++;
+            count++;
     }
+    const coordinates = new Uint32Array(count);
     const distances = new Uint8Array(count).fill(0x0f);
+    let denseIndex = 0;
     for (let c = 0; c < HC_PDB_STATES; c++) {
-        const di = index[c];
-        if (di >= 0)
-            distances[di] = hcPdbDistance(packed, c);
+        const distance = hcPdbDistance(packed, c);
+        if (distance === 0x0f)
+            continue;
+        coordinates[denseIndex] = c;
+        distances[denseIndex] = distance;
+        denseIndex++;
+    }
+    return { coordinates, moves: new Int32Array(0), distances, reachableCount: count };
+}
+/** Full HC coordinate -> dense index, or -1 when it is unreachable. */
+export function hcDenseIndex(dense, coordinate) {
+    let low = 0;
+    let high = dense.coordinates.length - 1;
+    while (low <= high) {
+        const middle = (low + high) >>> 1;
+        const value = dense.coordinates[middle];
+        if (value === coordinate)
+            return middle;
+        if (value < coordinate)
+            low = middle + 1;
+        else
+            high = middle - 1;
     }
-    return { index, moves: new Int32Array(0), distances, reachableCount: count };
+    return -1;
 }
 /** Dense transition table: for each reachable state and move, dense index (or -1). */
 export function generateHcDenseMoves(dense) {
     const maps = getHcPdbMoveMaps();
     const moves = new Int32Array(dense.reachableCount * HC_PDB_MOVES.length).fill(-1);
-    for (let c = 0; c < HC_PDB_STATES; c++) {
-        const di = dense.index[c];
-        if (di < 0)
-            continue;
+    for (let di = 0; di < dense.coordinates.length; di++) {
+        const c = dense.coordinates[di];
         const mask = hcUnrank(c);
         for (let m = 0; m < HC_PDB_MOVES.length; m++) {
             const base = m * 24;
@@ -195,7 +213,7 @@ export function generateHcDenseMoves(dense) {
                 if (mask & (1 << maps[base + i]))
                     nmask |= 1 << i;
             }
-            moves[di * HC_PDB_MOVES.length + m] = dense.index[hcRank(nmask)];
+            moves[di * HC_PDB_MOVES.length + m] = hcDenseIndex(dense, hcRank(nmask));
         }
     }
     return moves;

package/dist/puzzles/cube4/reduction/node-loader.d.ts

@@ -1,12 +1,21 @@
 /**
  * Node loader for the cube4 reduction tables (the committed .bin files).
- * The manifests are per-phase (`center1-manifest.json`, ...).
+ * The manifests are per-phase (`center1-manifest.json`, ...) plus the shared
+ * `hc-manifest.json`, which also seals the optional `c3_pair_dist.bin`.
+ *
+ * Every .bin read is verified: sha256 checksum AND expected byte length
+ * (derived from the manifest `range` + the known packing of each table).
+ * All integrity errors name the file and the expected/actual sizes so a
+ * corrupted download fails loudly instead of silently producing divergent
+ * scrambles. browser-loader.ts performs the identical checks.
  */
 import type { Center1Tables } from "./center1.js";
 import type { Center2Tables } from "./center2.js";
 import type { Center3Tables } from "./center3.js";
 import type { Edge3Tables } from "./edge3.js";
 import { type HcDenseTables } from "./hc-pdb.js";
+/** Estimated committed table bytes per solver instance (excludes JS objects). */
+export declare function estimateCube4ReductionTableBytes(tables: Cube4ReductionTables): number;
 export interface Cube4ReductionTables {
     center1: Center1Tables;
     center2: Center2Tables;

package/dist/puzzles/cube4/reduction/node-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"node-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube4/reduction/node-loader.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAG9C,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAE/D,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,aAAa,CAAC;IACvB,OAAO,EAAE,aAAa,CAAC;IACvB,OAAO,EAAE,aAAa,CAAC;IACvB,KAAK,EAAE,WAAW,CAAC;IACnB,0EAA0E;IAC1E,EAAE,CAAC,EAAE,aAAa,CAAC;IACnB,4DAA4D;IAC5D,UAAU,CAAC,EAAE,UAAU,CAAC;CACzB;AA2ID,oFAAoF;AACpF,wBAAgB,wBAAwB,IAAI,oBAAoB,CAgB/D"}
+{"version":3,"file":"node-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube4/reduction/node-loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAG9C,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAI/D,iFAAiF;AACjF,wBAAgB,gCAAgC,CAAC,MAAM,EAAE,oBAAoB,GAAG,MAAM,CAgBrF;AAYD,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,aAAa,CAAC;IACvB,OAAO,EAAE,aAAa,CAAC;IACvB,OAAO,EAAE,aAAa,CAAC;IACvB,KAAK,EAAE,WAAW,CAAC;IACnB,0EAA0E;IAC1E,EAAE,CAAC,EAAE,aAAa,CAAC;IACnB,4DAA4D;IAC5D,UAAU,CAAC,EAAE,UAAU,CAAC;CACzB;AAuPD,oFAAoF;AACpF,wBAAgB,wBAAwB,IAAI,oBAAoB,CAqB/D"}

package/dist/puzzles/cube4/reduction/node-loader.js

@@ -1,14 +1,52 @@
 /**
  * Node loader for the cube4 reduction tables (the committed .bin files).
- * The manifests are per-phase (`center1-manifest.json`, ...).
+ * The manifests are per-phase (`center1-manifest.json`, ...) plus the shared
+ * `hc-manifest.json`, which also seals the optional `c3_pair_dist.bin`.
+ *
+ * Every .bin read is verified: sha256 checksum AND expected byte length
+ * (derived from the manifest `range` + the known packing of each table).
+ * All integrity errors name the file and the expected/actual sizes so a
+ * corrupted download fails loudly instead of silently producing divergent
+ * scrambles. browser-loader.ts performs the identical checks.
  */
 import { existsSync, readFileSync } from "node:fs";
 import { createRequire } from "node:module";
 import path from "node:path";
 import { createHash } from "node:crypto";
+import { CENTER3_STATES } from "./center3.js";
 import { edge3DistanceLookup } from "./edge3.js";
 import { buildHcDense } from "./hc-pdb.js";
+const TABLE_MEMORY_BUDGET_BYTES = 150 * 1024 * 1024;
+/** Estimated committed table bytes per solver instance (excludes JS objects). */
+export function estimateCube4ReductionTableBytes(tables) {
+    return (tables.center1.distance.byteLength +
+        tables.center1.moveMaps.byteLength +
+        tables.center2.ctMove.byteLength +
+        tables.center2.rlMove.byteLength +
+        tables.center2.pruning.byteLength +
+        (tables.center2.pruningWide?.byteLength ?? 0) +
+        tables.center3.moveTable.byteLength +
+        tables.center3.pruning.byteLength +
+        tables.edge3.distances.byteLength +
+        (tables.hc?.moves.byteLength ?? 0) +
+        (tables.hc?.distances.byteLength ?? 0) +
+        (tables.hc?.coordinates.byteLength ?? 0) +
+        (tables.c3PairDist?.byteLength ?? 0));
+}
+function assertCube4ReductionTableBudget(tables) {
+    const bytes = estimateCube4ReductionTableBytes(tables);
+    if (bytes > TABLE_MEMORY_BUDGET_BYTES) {
+        throw new Error(`Cube4 reduction tables use ${(bytes / (1024 * 1024)).toFixed(1)} MiB, above the ` +
+            `${(TABLE_MEMORY_BUDGET_BYTES / (1024 * 1024)).toFixed(0)} MiB table budget.`);
+    }
+}
 const GENERATED_DIRECTORY = "puzzles/cube4/reduction/generated";
+/**
+ * Byte length of `c3_pair_dist.bin`: CENTER3_STATES x 144 nibble entries
+ * (index = ct3 * 144 + f * 12 + h, see phase3-search.ts), nibble-packed.
+ * The same constant is enforced in browser-loader.ts.
+ */
+const C3_PAIR_DIST_BYTES = (CENTER3_STATES * 144) / 2;
 function resolveGeneratedAssetDirectory() {
     const envDirectory = process.env.CUBINGCENTER_SCRAMBLER_TABLES_DIR;
     if (envDirectory && existsSync(path.join(envDirectory, "center1-manifest.json"))) {
@@ -41,25 +79,97 @@ function getAssetDirectoryCandidates() {
 function sha256(buffer) {
     return createHash("sha256").update(buffer).digest("hex");
 }
-function readChecked(file, expectedChecksum) {
-    const buffer = readFileSync(file);
-    if (sha256(buffer) !== expectedChecksum) {
-        throw new Error(`Table checksum mismatch: ${file}`);
+function readManifest(file) {
+    let text;
+    try {
+        text = readFileSync(file, "utf8");
+    }
+    catch (error) {
+        if (error.code === "ENOENT") {
+            throw new Error(`Table manifest missing: ${file} — run pnpm cube4:center1:tables etc. to regenerate the tables.`);
+        }
+        throw error;
+    }
+    try {
+        return JSON.parse(text);
+    }
+    catch (error) {
+        // Always name the file: a bare JSON.parse error is unactionable.
+        throw new Error(`Invalid table manifest JSON: ${file}: ${error instanceof Error ? error.message : String(error)}`);
+    }
+}
+function requireEntry(manifest, manifestPath, label) {
+    const entry = manifest[label];
+    if (!entry || typeof entry.file !== "string" || typeof entry.checksum !== "string") {
+        throw new Error(`Invalid table manifest ${manifestPath}: entry "${label}" must declare { file, checksum } — ` +
+            "run pnpm cube4:hc:tables etc. to regenerate the manifest.");
+    }
+    return entry;
+}
+/**
+ * Expected byte length of a table file from its manifest entry.
+ * `packing` matches how each table is serialized (see the load* functions).
+ */
+function expectedBytes(entry, packing) {
+    if (typeof entry.bytes === "number")
+        return entry.bytes;
+    if (typeof entry.range !== "number")
+        return undefined;
+    if (packing === "byte")
+        return entry.range;
+    if (packing === "nibble")
+        return Math.ceil(entry.range / 2);
+    return entry.range * 4;
+}
+function readChecked(file, expectedChecksum, expectedLength) {
+    let buffer;
+    try {
+        buffer = readFileSync(file);
+    }
+    catch (error) {
+        if (error.code === "ENOENT") {
+            throw new Error(`Table file missing: ${file}` +
+                (expectedLength !== undefined ? ` (expected ${expectedLength} bytes)` : "") +
+                " — run pnpm cube4:center1:tables etc. to regenerate the tables.");
+        }
+        throw error;
+    }
+    if (expectedLength !== undefined && buffer.length !== expectedLength) {
+        throw new Error(`Table size mismatch: ${file} (expected ${expectedLength} bytes, got ${buffer.length})`);
+    }
+    const actual = sha256(buffer);
+    if (actual !== expectedChecksum) {
+        throw new Error(`Table checksum mismatch: ${file} (expected sha256 ${expectedChecksum}, got ${actual}, ${buffer.length} bytes)`);
     }
     return buffer;
 }
+function readCheckedEntry(file, entry, packing) {
+    return readChecked(file, entry.checksum, expectedBytes(entry, packing));
+}
 function readInt32(buffer) {
     return new Int32Array(buffer.buffer.slice(buffer.byteOffset, buffer.byteOffset + buffer.byteLength));
 }
 function loadCenter1(assetDirectory) {
-    const manifest = JSON.parse(readFileSync(path.join(assetDirectory, "center1-manifest.json"), "utf8"));
+    const manifestPath = path.join(assetDirectory, "center1-manifest.json");
+    const manifest = readManifest(manifestPath);
+    const distanceTable = requireEntry(manifest, manifestPath, "distanceTable");
+    const moveMaps = requireEntry(manifest, manifestPath, "moveMaps");
     return {
-        distance: new Uint8Array(readChecked(path.join(assetDirectory, manifest.distanceTable.file), manifest.distanceTable.checksum)),
-        moveMaps: readInt32(readChecked(path.join(assetDirectory, manifest.moveMaps.file), manifest.moveMaps.checksum))
+        distance: new Uint8Array(readCheckedEntry(path.join(assetDirectory, distanceTable.file), distanceTable, "nibble")),
+        moveMaps: readInt32(readCheckedEntry(path.join(assetDirectory, moveMaps.file), moveMaps, "int32"))
     };
 }
 function loadCenter2(assetDirectory) {
-    const manifest = JSON.parse(readFileSync(path.join(assetDirectory, "center2-manifest.json"), "utf8"));
+    const manifestPath = path.join(assetDirectory, "center2-manifest.json");
+    const manifest = readManifest(manifestPath);
+    const ctMove = requireEntry(manifest, manifestPath, "ctMove");
+    const rlMove = requireEntry(manifest, manifestPath, "rlMove");
+    const pruningTable = requireEntry(manifest, manifestPath, "pruningTable");
+    // Tolerates older assets without the wide table (wide searches throw
+    // a clear error only when actually requested).
+    const pruningWideEntry = manifest.pruningWideTable
+        ? requireEntry(manifest, manifestPath, "pruningWideTable")
+        : undefined;
     function unpackPruning(buffer) {
         const pruning = new Uint8Array(450450);
         for (let i = 0; i < 450450; i++) {
@@ -68,53 +178,73 @@ function loadCenter2(assetDirectory) {
         }
         return pruning;
     }
-    const pruningBuffer = readChecked(path.join(assetDirectory, manifest.pruningTable.file), manifest.pruningTable.checksum);
+    const pruningBuffer = readCheckedEntry(path.join(assetDirectory, pruningTable.file), pruningTable, "nibble");
     const tables = {
-        ctMove: readInt32(readChecked(path.join(assetDirectory, manifest.ctMove.file), manifest.ctMove.checksum)),
-        rlMove: readInt32(readChecked(path.join(assetDirectory, manifest.rlMove.file), manifest.rlMove.checksum)),
+        ctMove: readInt32(readCheckedEntry(path.join(assetDirectory, ctMove.file), ctMove, "int32")),
+        rlMove: readInt32(readCheckedEntry(path.join(assetDirectory, rlMove.file), rlMove, "int32")),
         pruning: unpackPruning(pruningBuffer)
     };
-    // Tolerates older assets without the wide table (wide searches throw
-    // a clear error only when actually requested).
-    if (manifest.pruningWideTable) {
-        const wideBuffer = readChecked(path.join(assetDirectory, manifest.pruningWideTable.file), manifest.pruningWideTable.checksum);
+    if (pruningWideEntry) {
+        const wideBuffer = readCheckedEntry(path.join(assetDirectory, pruningWideEntry.file), pruningWideEntry, "nibble");
         tables.pruningWide = unpackPruning(wideBuffer);
     }
     return tables;
 }
 function loadCenter3(assetDirectory) {
-    const manifest = JSON.parse(readFileSync(path.join(assetDirectory, "center3-manifest.json"), "utf8"));
+    const manifestPath = path.join(assetDirectory, "center3-manifest.json");
+    const manifest = readManifest(manifestPath);
+    const moveTable = requireEntry(manifest, manifestPath, "moveTable");
+    const pruningTable = requireEntry(manifest, manifestPath, "pruningTable");
     return {
-        moveTable: readInt32(readChecked(path.join(assetDirectory, manifest.moveTable.file), manifest.moveTable.checksum)),
-        pruning: new Uint8Array(readChecked(path.join(assetDirectory, manifest.pruningTable.file), manifest.pruningTable.checksum))
+        moveTable: readInt32(readCheckedEntry(path.join(assetDirectory, moveTable.file), moveTable, "int32")),
+        pruning: new Uint8Array(readCheckedEntry(path.join(assetDirectory, pruningTable.file), pruningTable, "byte"))
     };
 }
 function loadEdge3(assetDirectory) {
-    const manifest = JSON.parse(readFileSync(path.join(assetDirectory, "edge3-manifest.json"), "utf8"));
+    const manifestPath = path.join(assetDirectory, "edge3-manifest.json");
+    const manifest = readManifest(manifestPath);
+    const distances = requireEntry(manifest, manifestPath, "distances");
+    // `range` here already counts packed nibble BYTES (classCount / 2), unlike
+    // the other manifests — derive the length from classCount instead.
+    const classCount = manifest.classCount;
+    const length = typeof classCount === "number" ? Math.ceil(classCount / 2) : expectedBytes(distances, "byte");
     // Keep the nibble-packed distances as-is (15.5MB instead of 31MB): every
     // reader (phase3 getPrun, solve.ts, edge3DistanceLookup) handles both
     // formats, and the smaller working set halves edge-table DRAM traffic.
-    const distances = new Uint8Array(readChecked(path.join(assetDirectory, manifest.distances.file), manifest.distances.checksum));
-    return { distances, distanceOfEdge: edge3DistanceLookup(distances) };
+    const buffer = readChecked(path.join(assetDirectory, distances.file), distances.checksum, length);
+    const table = new Uint8Array(buffer);
+    return { distances: table, distanceOfEdge: edge3DistanceLookup(table) };
 }
-function loadHc(assetDirectory) {
+function loadHc(assetDirectory, manifest) {
     const manifestPath = path.join(assetDirectory, "hc-manifest.json");
-    if (!existsSync(manifestPath))
-        return undefined;
-    const manifest = JSON.parse(readFileSync(manifestPath, "utf8"));
-    const packed = new Uint8Array(readChecked(path.join(assetDirectory, manifest.distances.file), manifest.distances.checksum));
+    const distances = requireEntry(manifest, manifestPath, "distances");
+    const packed = new Uint8Array(readCheckedEntry(path.join(assetDirectory, distances.file), distances, "nibble"));
     const dense = buildHcDense(packed);
-    if (manifest.moveTable) {
-        const moveBuffer = readChecked(path.join(assetDirectory, manifest.moveTable.file), manifest.moveTable.checksum);
+    if (manifest.moveTable !== undefined) {
+        const moveTable = requireEntry(manifest, manifestPath, "moveTable");
+        const moveBuffer = readCheckedEntry(path.join(assetDirectory, moveTable.file), moveTable, "int32");
         dense.moves = new Int32Array(moveBuffer.buffer.slice(moveBuffer.byteOffset, moveBuffer.byteOffset + moveBuffer.byteLength));
     }
     return dense;
 }
-function loadC3Pair(assetDirectory) {
+function loadC3Pair(assetDirectory, hcManifest) {
     const filePath = path.join(assetDirectory, "c3_pair_dist.bin");
-    if (!existsSync(filePath))
+    const manifestPath = path.join(assetDirectory, "hc-manifest.json");
+    if (!hcManifest || hcManifest.c3PairDist === undefined) {
+        // Optional table: absent = not deployed (fine). Present but unsealed =
+        // the historical silent-corruption hole — refuse to load it unchecked.
+        if (existsSync(filePath)) {
+            throw new Error(`${filePath} exists but ${manifestPath} has no "c3PairDist" checksum entry — refusing to load it ` +
+                "unchecked. Regenerate the manifest: pnpm cube4:hc:tables.");
+        }
         return undefined;
-    return new Uint8Array(readFileSync(filePath));
+    }
+    const checked = requireEntry(hcManifest, manifestPath, "c3PairDist");
+    if (typeof checked.bytes === "number" && checked.bytes !== C3_PAIR_DIST_BYTES) {
+        throw new Error(`Invalid table manifest ${manifestPath}: c3PairDist.bytes is ${checked.bytes}, expected ` +
+            `${C3_PAIR_DIST_BYTES} — run pnpm cube4:hc:tables to regenerate it.`);
+    }
+    return new Uint8Array(readChecked(path.join(assetDirectory, checked.file), checked.checksum, C3_PAIR_DIST_BYTES));
 }
 /** Load all cube4 reduction tables (throws if the generated assets are missing). */
 export function loadCube4ReductionTables() {
@@ -128,11 +258,15 @@ export function loadCube4ReductionTables() {
         center3: loadCenter3(assetDirectory),
         edge3: loadEdge3(assetDirectory)
     };
-    const hc = loadHc(assetDirectory);
-    if (hc)
-        tables.hc = hc;
-    const c3Pair = loadC3Pair(assetDirectory);
+    // Shared manifest for the two optional PDB tables; absent = not deployed.
+    const hcManifestPath = path.join(assetDirectory, "hc-manifest.json");
+    const hcManifest = existsSync(hcManifestPath) ? readManifest(hcManifestPath) : undefined;
+    if (hcManifest) {
+        tables.hc = loadHc(assetDirectory, hcManifest);
+    }
+    const c3Pair = loadC3Pair(assetDirectory, hcManifest);
     if (c3Pair)
         tables.c3PairDist = c3Pair;
+    assertCube4ReductionTableBudget(tables);
     return tables;
 }

package/dist/puzzles/cube4/reduction/pair-transversal.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Phase-2 wing-transversal pruning (two-pair PDB).
+ *
+ * A phase-2 goal is only usable when the wings are "transversal": every
+ * pair has exactly one wing in the second-half positions
+ * (`PAIRING_SECOND_HALVES`). Only ~0.1-0.25% of center goals pass, so the
+ * phase-2 search used to enumerate millions of center goals to find the
+ * transversal ones. This table bounds how many phase-2 moves two given pairs
+ * need to become transversal, so the search can prune branches that cannot
+ * end transversal within the remaining depth.
+ *
+ * State: the unordered positions of the two wings of pair X and of pair Y
+ * (276 × 276 index; overlapping positions are unreachable). The predicate
+ * only depends on positions, so ONE table serves every pair-of-pairs.
+ * Exact BFS distances under the given phase-2 move prefix (the search set),
+ * hence admissible; generated at runtime (76,176 bytes, a few ms).
+ */
+export declare const PAIR_STATES = 276;
+/** Unordered position pair (a != b) → 0..275, as a flat 24×24 table. */
+export declare const PAIR_INDEX: Uint16Array;
+/**
+ * Wing position maps: `posMove[m * 24 + p]` = where the wing at position p
+ * goes under CENTER2_MOVES[m] (inverse of the `wp` gather maps).
+ */
+export declare function getWingPositionMoves(): Uint8Array;
+/** Two-pair transversal distances under the first `moveCount` CENTER2_MOVES. */
+export declare function getTransversalPairPdb(moveCount: number): Uint8Array;
+//# sourceMappingURL=pair-transversal.d.ts.map

package/dist/puzzles/cube4/reduction/pair-transversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pair-transversal.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube4/reduction/pair-transversal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAKH,eAAO,MAAM,WAAW,MAAM,CAAC;AAE/B,wEAAwE;AACxE,eAAO,MAAM,UAAU,EAAE,WAWrB,CAAC;AAeL;;;GAGG;AACH,wBAAgB,oBAAoB,IAAI,UAAU,CASjD;AAKD,gFAAgF;AAChF,wBAAgB,qBAAqB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,CAsCnE"}

package/dist/puzzles/cube4/reduction/pair-transversal.js

@@ -0,0 +1,107 @@
+/**
+ * Phase-2 wing-transversal pruning (two-pair PDB).
+ *
+ * A phase-2 goal is only usable when the wings are "transversal": every
+ * pair has exactly one wing in the second-half positions
+ * (`PAIRING_SECOND_HALVES`). Only ~0.1-0.25% of center goals pass, so the
+ * phase-2 search used to enumerate millions of center goals to find the
+ * transversal ones. This table bounds how many phase-2 moves two given pairs
+ * need to become transversal, so the search can prune branches that cannot
+ * end transversal within the remaining depth.
+ *
+ * State: the unordered positions of the two wings of pair X and of pair Y
+ * (276 × 276 index; overlapping positions are unreachable). The predicate
+ * only depends on positions, so ONE table serves every pair-of-pairs.
+ * Exact BFS distances under the given phase-2 move prefix (the search set),
+ * hence admissible; generated at runtime (76,176 bytes, a few ms).
+ */
+import { CENTER2_MOVES, getWingMoveMaps } from "./center2.js";
+import { PAIRING_SECOND_HALVES } from "./pairing-coordinate.js";
+export const PAIR_STATES = 276;
+/** Unordered position pair (a != b) → 0..275, as a flat 24×24 table. */
+export const PAIR_INDEX = (() => {
+    const index = new Uint16Array(24 * 24).fill(0xffff);
+    let k = 0;
+    for (let a = 0; a < 24; a++) {
+        for (let b = a + 1; b < 24; b++) {
+            index[a * 24 + b] = k;
+            index[b * 24 + a] = k;
+            k++;
+        }
+    }
+    return index;
+})();
+const PAIR_A = new Uint8Array(PAIR_STATES);
+const PAIR_B = new Uint8Array(PAIR_STATES);
+for (let a = 0; a < 24; a++) {
+    for (let b = a + 1; b < 24; b++) {
+        const k = PAIR_INDEX[a * 24 + b];
+        PAIR_A[k] = a;
+        PAIR_B[k] = b;
+    }
+}
+const IS_SECOND = new Uint8Array(24);
+for (const p of PAIRING_SECOND_HALVES)
+    IS_SECOND[p] = 1;
+/**
+ * Wing position maps: `posMove[m * 24 + p]` = where the wing at position p
+ * goes under CENTER2_MOVES[m] (inverse of the `wp` gather maps).
+ */
+export function getWingPositionMoves() {
+    if (cachedPosMove)
+        return cachedPosMove;
+    const gather = getWingMoveMaps();
+    const posMove = new Uint8Array(CENTER2_MOVES.length * 24);
+    for (let m = 0; m < CENTER2_MOVES.length; m++) {
+        for (let i = 0; i < 24; i++)
+            posMove[m * 24 + gather[m * 24 + i]] = i;
+    }
+    cachedPosMove = posMove;
+    return posMove;
+}
+let cachedPosMove;
+const cache = new Map();
+/** Two-pair transversal distances under the first `moveCount` CENTER2_MOVES. */
+export function getTransversalPairPdb(moveCount) {
+    const hit = cache.get(moveCount);
+    if (hit)
+        return hit;
+    const posMove = getWingPositionMoves();
+    const n = PAIR_STATES * PAIR_STATES;
+    const dist = new Uint8Array(n).fill(0xff);
+    const queue = new Int32Array(n);
+    let tail = 0;
+    for (let x = 0; x < PAIR_STATES; x++) {
+        if (IS_SECOND[PAIR_A[x]] === IS_SECOND[PAIR_B[x]])
+            continue;
+        for (let y = 0; y < PAIR_STATES; y++) {
+            if (IS_SECOND[PAIR_A[y]] === IS_SECOND[PAIR_B[y]])
+                continue;
+            const ya = PAIR_A[y];
+            const yb = PAIR_B[y];
+            if (ya === PAIR_A[x] || ya === PAIR_B[x] || yb === PAIR_A[x] || yb === PAIR_B[x])
+                continue;
+            const s = x * PAIR_STATES + y;
+            dist[s] = 0;
+            queue[tail++] = s;
+        }
+    }
+    for (let head = 0; head < tail; head++) {
+        const s = queue[head];
+        const x = (s / PAIR_STATES) | 0;
+        const y = s - x * PAIR_STATES;
+        const d = dist[s] + 1;
+        for (let m = 0; m < moveCount; m++) {
+            const row = m * 24;
+            const nx = PAIR_INDEX[posMove[row + PAIR_A[x]] * 24 + posMove[row + PAIR_B[x]]];
+            const ny = PAIR_INDEX[posMove[row + PAIR_A[y]] * 24 + posMove[row + PAIR_B[y]]];
+            const t = nx * PAIR_STATES + ny;
+            if (dist[t] === 0xff) {
+                dist[t] = d;
+                queue[tail++] = t;
+            }
+        }
+    }
+    cache.set(moveCount, dist);
+    return dist;
+}

package/dist/puzzles/cube4/reduction/phase3-search.d.ts

@@ -41,30 +41,28 @@ export declare class FastPhase3Solver {
     private readonly tempep;
     private readonly moveLog;
     private readonly sym;
-    /** Transposition Table size: 2^21 = 2,097,152 entries (24 MB in RAM).
-     *  NOTE: doubling to 4M was tried and reverted (-0.07% nodes on the
-     *  corpus — the 2M working set already captures the hit locality). */
+    /** Transposition Table size: 2^20 = 1,048,576 entries (12 MiB per solve).
+     * The previous 2M table used 24 MiB per process, plus a separate 8 MiB
+     * generation array. The compact 1M table leaves room for concurrent
+     * solvers under the 150 MiB reduction-table budget. */
     private static readonly TT_SIZE;
     private static readonly TT_MASK;
-    private static readonly tt;
-    private static epoch;
-    /**
-     * Per-slot exact-length-call tag (8 MB transient). TT pruning stays
-     * epoch-scoped (unchanged traversal), but threshold proofs only trust
-     * same-call hits: a hit from another call may have validated under a
-     * different candidate, so it still prunes yet marks the proof dirty.
-     */
-    private static readonly ttGen;
-    private static callSeq;
+    private readonly tt;
+    private static readonly CALL_ID_LIMIT;
+    private callSeq;
     private callId;
-    /** Reset the per-attempt cumulative node counter. */
+    private contextCenter3;
+    private contextEdge3;
+    /** Reset this solver's cumulative node counter (legacy method name). */
     resetEpochNodes(): void;
-    static nextEpoch(): void;
-    /** Fresh per-call id for TT-generation tagging (epoch wrap resets it). */
-    private static nextCallId;
+    clearTranspositionTable(): void;
+    private setTableContext;
+    /** Fresh per-call id for TT-generation tagging. */
+    private nextCallId;
     constructor();
+    private ensureDepth;
     private nodeCount;
-    /** Cumulative nodes across calls (reset per attempt via resetEpochNodes). */
+    /** Cumulative nodes across calls (reset per solve generation). */
     epochNodes: number;
     /**
      * Proof bookkeeping for IDA* threshold propagation (reset per exact-length
@@ -76,9 +74,8 @@ export declare class FastPhase3Solver {
      * - `sawGoal`: a goal was reached (even if the validator rejected it —
      *   a nearby length may still validate, so only step L+1).
      * - `ttTouched`: a transposition-table hit from ANOTHER exact-length call
-     *   skipped a subtree (same-call hits replay this call's own exhausted
-     *   subtree and stay clean; other calls may validate under a different
-     *   candidate, so their stored proof does not transfer).
+     *   skipped a subtree, and the hit was not certified goal-free across
+     *   candidate validators.
      * Bound-based axis skips need no flag: the skipped siblings are
      * same-face turns, so noteExcess records their triangle-inequality bound.
      */
@@ -87,22 +84,27 @@ export declare class FastPhase3Solver {
     private sawGoal;
     private ttTouched;
     private minExcess;
-    private getPrun;
+    /**
+     * Root-length coverage of the tightest TT hit this call (depth +
+     * storedDepth): the pruned subtree proves no goal at or below that root
+     * length under the call's predicate. `Number.MAX_SAFE_INTEGER` when no hit
+     * pruned anything. Feeds `validatedThrough`.
+     */
+    private ttCoverage;
     /**
      * Recursive IDA* worker on table transitions with Transposition Table pruning.
      */
     search(eplast: Uint8Array, ct: number, prun: number, maxl: number, lm: number, depth: number, center3Tables: Center3Tables, edge3Distances: Uint8Array, maxNodes?: number, collect?: Phase3SolutionValidator, hc?: HcDenseTables, hcCoord?: number, c3PairDist?: Uint8Array): boolean;
     /**
-     * Record an IDA* bound prune: the child at `depth + 1` needs at least
-     * `childBound` more moves, so no solution exists through this branch
-     * below root threshold `depth + 1 + childBound`. When a bound-based axis
-     * skip also fires, the skipped siblings are same-face turns (verified:
-     * every non-empty skipAxis3 run under m < 14 is a same-base triple),
-     * hence at most 1 legal move apart — their bound is at least
+     * Record an IDA* bound prune (inlined at the four gate sites): the child at
+     * `depth + 1` needs at least `childBound` more moves, so no solution exists
+     * through this branch below root threshold `depth + 1 + childBound`. When a
+     * bound-based axis skip also fires, the skipped siblings are same-face turns
+     * (verified: every non-empty skipAxis3 run under m < 14 is a same-base
+     * triple), hence at most 1 legal move apart — their bound is at least
      * `childBound - 1` by the triangle inequality on the exact PDBs, so the
      * recorded excess `depth + childBound` stays a true lower bound.
      */
-    private noteExcess;
     /**
      * Search for a phase-3 solution with exact target length (first found).
      */
@@ -127,6 +129,7 @@ export declare class FastPhase3Solver {
     solveLengthProven(edge: Uint8Array, ct3: number, edist: number, length3: number, center3Tables: Center3Tables, edge3Distances: Uint8Array, maxNodes: number | undefined, limit: number | undefined, validate: (moves: Cube4Move[]) => boolean, hc?: HcDenseTables, hcCoord?: number, c3PairDist?: Uint8Array): {
         moves: Cube4Move[] | null;
         provenThrough: number;
+        validatedThrough: number;
         nodesUsed: number;
     };
 }
@@ -144,5 +147,5 @@ export declare function resetProofStats(): void;
 /**
  * Solve Phase 3 with iterative deepening on a single Phase3Start.
  */
-export declare function solvePhase3(start: Phase3Start, center3Tables: Center3Tables, edge3Tables: Edge3Tables, maxLength?: number): Promise<Phase3Result | null>;
+export declare function solvePhase3(start: Phase3Start, center3Tables: Center3Tables, edge3Tables: Edge3Tables, maxLength?: number, maxNodes?: number): Promise<Phase3Result | null>;
 //# sourceMappingURL=phase3-search.d.ts.map

package/dist/puzzles/cube4/reduction/phase3-search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"phase3-search.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube4/reduction/phase3-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAiB,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AACjE,OAAO,EAIL,KAAK,WAAW,EAEjB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAE/D,+DAA+D;AAC/D,eAAO,MAAM,YAAY,EAAE,SAAS,SAAS,EAA+B,CAAC;AAa7E,eAAO,MAAM,KAAK,EAAE,OAAO,EAAE,EAAgE,CAAC;AAO9F,eAAO,MAAM,SAAS,EAAE,MAAM,EAA2B,CAAC;AAkD1D,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,uBAAuB;IACtC,mEAAmE;IACnE,KAAK,EAAE,MAAM,CAAC;IACd,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,CAAC;CAC3C;AAED,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAW;IACnC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAEhC;;0EAEsE;IACtE,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAW;IAC1C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAgC;IAC/D,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAiD;IAC3E,OAAO,CAAC,MAAM,CAAC,KAAK,CAAK;IACzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAA6C;IAC1E,OAAO,CAAC,MAAM,CAAC,OAAO,CAAK;IAC3B,OAAO,CAAC,MAAM,CAAK;IAEnB,qDAAqD;IAC9C,eAAe,IAAI,IAAI;WAIhB,SAAS,IAAI,IAAI;IAU/B,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,UAAU;;IAgBzB,OAAO,CAAC,SAAS,CAAK;IACtB,6EAA6E;IACtE,UAAU,SAAK;IAEtB;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAK;IAEtB,OAAO,CAAC,OAAO;IAMf;;OAEG;IACI,MAAM,CACX,MAAM,EAAE,UAAU,EAClB,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,SAAQ,EAChB,OAAO,CAAC,EAAE,uBAAuB,EACjC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,OAAO;IAyKV;;;;;;;;;OASG;IACH,OAAO,CAAC,UAAU;IAKlB;;OAEG;IACI,WAAW,CAChB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,SAAQ,EAChB,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,SAAS,EAAE,GAAG,IAAI;IAyBrB;;;;;;;OAOG;IACI,gBAAgB,CACrB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,oBAAQ,EAChB,KAAK,oBAAK,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,EACzC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,SAAS,EAAE,GAAG,IAAI;IAOrB;;;;;;;OAOG;IACI,iBAAiB,CACtB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,oBAAQ,EAChB,KAAK,oBAAK,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,EACzC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB;QAAE,KAAK,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;CAyE3E;AAED,4EAA4E;AAC5E,eAAO,MAAM,UAAU;;;;;;;;CAQtB,CAAC;AAEF,wBAAgB,eAAe,IAAI,IAAI,CAQtC;AAID;;GAEG;AACH,wBAAsB,WAAW,CAC/B,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,aAAa,EAC5B,WAAW,EAAE,WAAW,EACxB,SAAS,SAAK,GACb,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAmC9B"}
+{"version":3,"file":"phase3-search.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube4/reduction/phase3-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAiB,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AACjE,OAAO,EAIL,KAAK,WAAW,EAEjB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAE/D,+DAA+D;AAC/D,eAAO,MAAM,YAAY,EAAE,SAAS,SAAS,EAA+B,CAAC;AAa7E,eAAO,MAAM,KAAK,EAAE,OAAO,EAAE,EAAgE,CAAC;AAO9F,eAAO,MAAM,SAAS,EAAE,MAAM,EAA2B,CAAC;AA6D1D,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,uBAAuB;IACtC,mEAAmE;IACnE,KAAK,EAAE,MAAM,CAAC;IACd,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,CAAC;CAC3C;AAED,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAW;IACnC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAEhC;;;2DAGuD;IACvD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAW;IAC1C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAgC;IAC/D,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAiD;IAGpE,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAW;IAChD,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,cAAc,CAA4B;IAClD,OAAO,CAAC,YAAY,CAAyB;IAE7C,wEAAwE;IACjE,eAAe,IAAI,IAAI;IAIvB,uBAAuB,IAAI,IAAI;IAKtC,OAAO,CAAC,eAAe;IAOvB,mDAAmD;IACnD,OAAO,CAAC,UAAU;;IAiBlB,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,SAAS,CAAK;IACtB,kEAAkE;IAC3D,UAAU,SAAK;IAEtB;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAK;IACtB;;;;;OAKG;IACH,OAAO,CAAC,UAAU,CAA2B;IAE7C;;OAEG;IACI,MAAM,CACX,MAAM,EAAE,UAAU,EAClB,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,SAAQ,EAChB,OAAO,CAAC,EAAE,uBAAuB,EACjC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,OAAO;IA6NV;;;;;;;;;OASG;IAEH;;OAEG;IACI,WAAW,CAChB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,SAAQ,EAChB,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,SAAS,EAAE,GAAG,IAAI;IA4BrB;;;;;;;OAOG;IACI,gBAAgB,CACrB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,oBAAQ,EAChB,KAAK,oBAAK,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,EACzC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB,SAAS,EAAE,GAAG,IAAI;IAOrB;;;;;;;OAOG;IACI,iBAAiB,CACtB,IAAI,EAAE,UAAU,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,aAAa,EAC5B,cAAc,EAAE,UAAU,EAC1B,QAAQ,oBAAQ,EAChB,KAAK,oBAAK,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,OAAO,EACzC,EAAE,CAAC,EAAE,aAAa,EAClB,OAAO,SAAK,EACZ,UAAU,CAAC,EAAE,UAAU,GACtB;QAAE,KAAK,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;CAiGrG;AAED,4EAA4E;AAC5E,eAAO,MAAM,UAAU;;;;;;;;CAQtB,CAAC;AAEF,wBAAgB,eAAe,IAAI,IAAI,CAQtC;AAED;;GAEG;AACH,wBAAsB,WAAW,CAC/B,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,aAAa,EAC5B,WAAW,EAAE,WAAW,EACxB,SAAS,SAAK,EACd,QAAQ,SAAS,GAChB,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAqC9B"}