@secondlayer/shared 11.7.1 → 11.8.0

package/dist/src/archive/semantic-digest-builder.js.map

@@ -1,11 +1,11 @@
 {
   "version": 3,
-  "sources": ["../src/archive/semantic-digest.ts", "../src/archive/semantic-digest-builder.ts"],
+  "sources": ["../src/archive/semantic-digest-builder.ts", "../src/archive/semantic-digest.ts"],
   "sourcesContent": [
-    "import { createHash } from \"node:crypto\";\n\n/**\n * v1 canonical byte encoding for chain identity — the shape that lets\n * independently-run runtimes agree on the same block.\n *\n * The exact-body digest (`sha256:parquet-object`) proves capture fidelity to one\n * source: replay the same bytes, get the same rows. It cannot prove two nodes\n * observed the same chain, because their Parquet encoders legally differ in\n * column padding, compression, JSON key order, and null placement — two\n * operators processing the same block can ship byte-different Parquets that\n * carry identical content.\n *\n * The semantic digest is the shape that lets independent runtimes agree. Every\n * value on a block/transaction/event is normalized into a canonical byte string\n * by rules that MUST NOT change without a version bump. Two v1 computations\n * over the same range agree, or one is wrong about the chain — never about\n * formatting.\n *\n * Encoding rules (v1):\n *   - Fields join with `\\x1f` (ASCII US, unit separator — cannot legally\n *     appear in any chain value; a printable delimiter risks collision with\n *     contract-emitted strings).\n *   - Null encodes as `\\x00` (single NUL). Distinct from empty string `\"\"`.\n *   - Integers encode as their base-10 string. bigint → decimal string.\n *   - JSON payload columns (function_args, event data) encode as canonical\n *     JSON: object keys sorted lexicographically, no whitespace, bigint →\n *     quoted decimal string, non-finite numbers rejected.\n *   - Field order per record type is fixed and never reordered.\n *   - Digest = sha256(bytes), lowercase hex.\n *\n * Rollup rules (v1) — order MUST match the archive's stream order or an\n * honest re-export will disagree with the manifest:\n *   - blocks:       (height asc)\n *   - transactions: (block_height asc, tx_index asc, tx_id asc)\n *   - events:       (block_height asc, event_index asc, tx_id asc)\n * Per-partition rollup is `sha256(concat(row_digest_bytes))` in stream order.\n *\n * Test vectors under `packages/shared/src/archive/__fixtures__/semantic-digest/`\n * pin the encoding. Any change to bytes must bump the spec version.\n */\n\nexport const SEMANTIC_DIGEST_SPEC_V1 = \"sha256:semantic-v1\" as const;\nexport type SemanticDigestSpec = typeof SEMANTIC_DIGEST_SPEC_V1;\n\nconst FIELD_SEP = \"\\x1f\";\nconst NULL_MARKER = \"\\x00\";\n\nconst textEncoder = new TextEncoder();\n\n/**\n * Stable JSON — sorted keys, no whitespace, bigint → decimal string. Distinct\n * from `JSON.stringify(x)` which respects insertion order and rejects bigints.\n * Also rejects non-finite numbers, since NaN/Infinity have no on-chain meaning\n * and would silently hash as `null` under `JSON.stringify`.\n */\nexport function canonicalJson(value: unknown): string {\n\tif (value === null) return \"null\";\n\tif (typeof value === \"string\" || typeof value === \"boolean\") {\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"canonicalJson: non-finite number\");\n\t\t}\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"bigint\") return JSON.stringify(value.toString());\n\tif (Array.isArray(value)) {\n\t\treturn `[${value.map((item) => canonicalJson(item)).join(\",\")}]`;\n\t}\n\tif (typeof value === \"object\") {\n\t\tconst object = value as Record<string, unknown>;\n\t\treturn `{${Object.keys(object)\n\t\t\t.sort()\n\t\t\t.map((key) => `${JSON.stringify(key)}:${canonicalJson(object[key])}`)\n\t\t\t.join(\",\")}}`;\n\t}\n\t// undefined / function / symbol — never present in decoded chain rows.\n\t// Fall through as null so tests catch unexpected shapes.\n\treturn \"null\";\n}\n\nfunction scalar(value: string | number | bigint | null | undefined): string {\n\tif (value === null || value === undefined) return NULL_MARKER;\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"semanticDigest: non-finite number\");\n\t\t}\n\t\tif (!Number.isInteger(value)) {\n\t\t\t// Chain heights, indexes, timestamps are all integer; a fractional\n\t\t\t// value here is a schema bug we want to surface loudly, not silently\n\t\t\t// serialize with float precision that varies by runtime.\n\t\t\tthrow new Error(`semanticDigest: non-integer scalar ${value}`);\n\t\t}\n\t\treturn String(value);\n\t}\n\tif (typeof value === \"bigint\") return value.toString();\n\treturn value;\n}\n\nfunction jsonScalar(value: unknown): string {\n\treturn value === null || value === undefined\n\t\t? NULL_MARKER\n\t\t: canonicalJson(value);\n}\n\nfunction sha256Hex(input: Uint8Array | string): string {\n\treturn createHash(\"sha256\").update(input).digest(\"hex\");\n}\n\nexport interface BlockDigestInput {\n\theight: number | bigint;\n\thash: string;\n\tparent_hash: string;\n\tburn_block_height: number | bigint;\n\tburn_block_hash: string | null;\n\tindex_block_hash: string | null;\n\ttimestamp: number | bigint;\n}\n\nexport interface TransactionDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\ttx_index: number;\n\ttype: string;\n\tsender: string;\n\tstatus: string;\n\tcontract_id: string | null;\n\tfunction_name: string | null;\n\tfunction_args: unknown;\n\traw_result: string | null;\n\traw_tx: string;\n}\n\nexport interface EventDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\tevent_index: number;\n\ttype: string;\n\tdata: unknown;\n}\n\nfunction encodeBlock(row: BlockDigestInput): string {\n\treturn [\n\t\tscalar(row.height),\n\t\tscalar(row.hash),\n\t\tscalar(row.parent_hash),\n\t\tscalar(row.burn_block_height),\n\t\tscalar(row.burn_block_hash),\n\t\tscalar(row.index_block_hash),\n\t\tscalar(row.timestamp),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeTransaction(row: TransactionDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.tx_index),\n\t\tscalar(row.type),\n\t\tscalar(row.sender),\n\t\tscalar(row.status),\n\t\tscalar(row.contract_id),\n\t\tscalar(row.function_name),\n\t\tjsonScalar(row.function_args),\n\t\tscalar(row.raw_result),\n\t\tscalar(row.raw_tx),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeEvent(row: EventDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.event_index),\n\t\tscalar(row.type),\n\t\tjsonScalar(row.data),\n\t].join(FIELD_SEP);\n}\n\n/**\n * v1 per-row digests. Each is `sha256(encoded_row_bytes)` in lowercase hex.\n * The encoded byte form is stable across runtimes; the sha256 is stable\n * across CPU architectures. Never mutate an encoder without a v-bump.\n */\nexport interface SemanticDigestV1 {\n\treadonly spec: SemanticDigestSpec;\n\treadonly encodeBlock: (row: BlockDigestInput) => string;\n\treadonly encodeTransaction: (row: TransactionDigestInput) => string;\n\treadonly encodeEvent: (row: EventDigestInput) => string;\n\treadonly block: (row: BlockDigestInput) => string;\n\treadonly transaction: (row: TransactionDigestInput) => string;\n\treadonly event: (row: EventDigestInput) => string;\n}\n\nexport interface SemanticDigestApi {\n\treadonly v1: SemanticDigestV1;\n}\n\nexport const semanticDigest: SemanticDigestApi = {\n\tv1: {\n\t\tspec: SEMANTIC_DIGEST_SPEC_V1,\n\t\tencodeBlock,\n\t\tencodeTransaction,\n\t\tencodeEvent,\n\t\tblock: (row: BlockDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeBlock(row))),\n\t\ttransaction: (row: TransactionDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeTransaction(row))),\n\t\tevent: (row: EventDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeEvent(row))),\n\t},\n};\n\n/**\n * Streaming rollup — feed rows one at a time in their declared order, read the\n * rolled digest at the end. Two callers passing the same rows in the same order\n * produce the same rollup, regardless of batching.\n *\n * The rollup composes: partition_digest = sha256(concat(row_digest_bytes)),\n * where each row_digest_bytes = sha256(encode(row)). This is why the streaming\n * implementation can be constant-memory — the outer sha256 accepts row digests\n * incrementally.\n */\nexport class SemanticDigestRollup {\n\tprivate readonly hasher = createHash(\"sha256\");\n\tprivate count = 0;\n\n\tstatic forDataset(\n\t\t_dataset: \"blocks\" | \"transactions\" | \"events\",\n\t): SemanticDigestRollup {\n\t\treturn new SemanticDigestRollup();\n\t}\n\n\tappendRowDigest(rowDigestHex: string): void {\n\t\tthis.hasher.update(Buffer.from(rowDigestHex, \"hex\"));\n\t\tthis.count += 1;\n\t}\n\n\trowCount(): number {\n\t\treturn this.count;\n\t}\n\n\t/** Empty rollups return `null`, not the sha256 of nothing, so an empty\n\t *  range never compares equal to another empty range on a different\n\t *  dataset. Callers assign `null` semantics deliberately. */\n\tdigest(): string | null {\n\t\treturn this.count === 0 ? null : this.hasher.copy().digest(\"hex\");\n\t}\n\n\tspec(): SemanticDigestSpec {\n\t\treturn SEMANTIC_DIGEST_SPEC_V1;\n\t}\n}\n\n/**\n * Per-partition digest record — the shape that lands in the snapshot manifest.\n * Complements the existing `sha256:parquet-object` per-partition digest by\n * proving semantic identity independent of file encoding.\n */\nexport interface PartitionSemanticDigest {\n\tdataset: \"blocks\" | \"transactions\" | \"events\";\n\tfrom_block: number;\n\tto_block: number;\n\trow_count: number;\n\tdigest: string | null;\n\tdigest_spec: SemanticDigestSpec;\n}\n",
-    "import { type Kysely, sql } from \"kysely\";\nimport type { Database } from \"../db/schema.ts\";\nimport {\n\ttype PartitionSemanticDigest,\n\tSEMANTIC_DIGEST_SPEC_V1,\n\tSemanticDigestRollup,\n\tsemanticDigest,\n} from \"./semantic-digest.ts\";\n\n/**\n * Compute per-partition semantic-v1 digests directly from a database — the same\n * bytes an exporter would produce, without writing Parquet. Callers: the CLI\n * verifier's `--semantic` pass, and (in future) the node replay auditor.\n *\n * SQL and ordering MUST match the archive exporter's stream (see\n * `packages/indexer/src/archive/export-snapshot.ts`). If either drifts, an\n * honest re-computation will disagree with the manifest even though both are\n * correct — and there is no way to tell which is wrong. Any change here needs\n * a matching change there.\n */\n\nexport type CanonicalDataset = \"blocks\" | \"transactions\" | \"events\";\n\nconst DEFAULT_BATCH_ROWS = 20_000;\n\ninterface StreamOptions {\n\tbatchRows?: number;\n}\n\nasync function* streamBlockDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\tlet last = fromBlock - 1;\n\twhile (true) {\n\t\tconst rows = await db\n\t\t\t.selectFrom(\"blocks\")\n\t\t\t.select([\n\t\t\t\t\"height\",\n\t\t\t\t\"hash\",\n\t\t\t\t\"parent_hash\",\n\t\t\t\t\"burn_block_height\",\n\t\t\t\t\"burn_block_hash\",\n\t\t\t\t\"index_block_hash\",\n\t\t\t\t\"timestamp\",\n\t\t\t])\n\t\t\t.where(\"canonical\", \"=\", true)\n\t\t\t.where(\"height\", \">\", last)\n\t\t\t.where(\"height\", \"<=\", toBlock)\n\t\t\t.orderBy(\"height\", \"asc\")\n\t\t\t.limit(batchRows)\n\t\t\t.execute();\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.block({\n\t\t\t\theight: Number(row.height),\n\t\t\t\thash: row.hash,\n\t\t\t\tparent_hash: row.parent_hash,\n\t\t\t\tburn_block_height: Number(row.burn_block_height),\n\t\t\t\tburn_block_hash: row.burn_block_hash ?? null,\n\t\t\t\tindex_block_hash: row.index_block_hash ?? null,\n\t\t\t\ttimestamp: Number(row.timestamp),\n\t\t\t});\n\t\t}\n\t\tlast = Number(rows[rows.length - 1]?.height);\n\t}\n}\n\nasync function* streamTransactionDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\ttype TxRow = {\n\t\ttx_id: string;\n\t\tblock_height: string | number;\n\t\ttx_index: number;\n\t\ttype: string;\n\t\tsender: string;\n\t\tstatus: string;\n\t\tcontract_id: string | null;\n\t\tfunction_name: string | null;\n\t\tfunction_args: unknown;\n\t\traw_result: string | null;\n\t\traw_tx: string;\n\t};\n\tlet cursor: { height: number; txIndex: number; txId: string } | null = null;\n\twhile (true) {\n\t\tconst result = await sql<TxRow>`\n\t\t\tSELECT t.tx_id, t.block_height, t.tx_index, t.type, t.sender, t.status,\n\t\t\t       t.contract_id, t.function_name, t.function_args, t.raw_result, t.raw_tx\n\t\t\t  FROM transactions t\n\t\t\t  JOIN blocks b ON b.height = t.block_height AND b.canonical = true\n\t\t\t WHERE t.block_height >= ${fromBlock} AND t.block_height <= ${toBlock}\n\t\t\t   AND (${cursor === null} OR (t.block_height, t.tx_index, t.tx_id) >\n\t\t\t        (${cursor?.height ?? 0}, ${cursor?.txIndex ?? 0}, ${cursor?.txId ?? \"\"}))\n\t\t\t ORDER BY t.block_height, t.tx_index, t.tx_id\n\t\t\t LIMIT ${batchRows}\n\t\t`.execute(db);\n\t\tconst rows: TxRow[] = result.rows;\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.transaction({\n\t\t\t\ttx_id: row.tx_id,\n\t\t\t\tblock_height: Number(row.block_height),\n\t\t\t\ttx_index: row.tx_index,\n\t\t\t\ttype: row.type,\n\t\t\t\tsender: row.sender,\n\t\t\t\tstatus: row.status,\n\t\t\t\tcontract_id: row.contract_id,\n\t\t\t\tfunction_name: row.function_name,\n\t\t\t\tfunction_args: row.function_args ?? null,\n\t\t\t\traw_result: row.raw_result,\n\t\t\t\traw_tx: row.raw_tx,\n\t\t\t});\n\t\t}\n\t\tconst tail = rows[rows.length - 1];\n\t\tif (tail) {\n\t\t\tcursor = {\n\t\t\t\theight: Number(tail.block_height),\n\t\t\t\ttxIndex: tail.tx_index,\n\t\t\t\ttxId: tail.tx_id,\n\t\t\t};\n\t\t}\n\t}\n}\n\nasync function* streamEventDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\ttype EventRow = {\n\t\ttx_id: string;\n\t\tblock_height: string | number;\n\t\tevent_index: number;\n\t\ttype: string;\n\t\tdata: unknown;\n\t};\n\tlet cursor: { height: number; eventIndex: number; txId: string } | null =\n\t\tnull;\n\twhile (true) {\n\t\tconst result = await sql<EventRow>`\n\t\t\tSELECT e.tx_id, e.block_height, e.event_index, e.type, e.data\n\t\t\t  FROM events e\n\t\t\t  JOIN blocks b ON b.height = e.block_height AND b.canonical = true\n\t\t\t WHERE e.block_height >= ${fromBlock} AND e.block_height <= ${toBlock}\n\t\t\t   AND (${cursor === null} OR (e.block_height, e.event_index, e.tx_id) >\n\t\t\t        (${cursor?.height ?? 0}, ${cursor?.eventIndex ?? 0}, ${cursor?.txId ?? \"\"}))\n\t\t\t ORDER BY e.block_height, e.event_index, e.tx_id\n\t\t\t LIMIT ${batchRows}\n\t\t`.execute(db);\n\t\tconst rows: EventRow[] = result.rows;\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.event({\n\t\t\t\ttx_id: row.tx_id,\n\t\t\t\tblock_height: Number(row.block_height),\n\t\t\t\tevent_index: row.event_index,\n\t\t\t\ttype: row.type,\n\t\t\t\tdata: row.data ?? null,\n\t\t\t});\n\t\t}\n\t\tconst tail = rows[rows.length - 1];\n\t\tif (tail) {\n\t\t\tcursor = {\n\t\t\t\theight: Number(tail.block_height),\n\t\t\t\teventIndex: tail.event_index,\n\t\t\t\ttxId: tail.tx_id,\n\t\t\t};\n\t\t}\n\t}\n}\n\nfunction digestStream(\n\tdb: Kysely<Database>,\n\tdataset: CanonicalDataset,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\tif (dataset === \"blocks\") {\n\t\treturn streamBlockDigests(db, fromBlock, toBlock, batchRows);\n\t}\n\tif (dataset === \"transactions\") {\n\t\treturn streamTransactionDigests(db, fromBlock, toBlock, batchRows);\n\t}\n\treturn streamEventDigests(db, fromBlock, toBlock, batchRows);\n}\n\n/**\n * Compute one partition's semantic-v1 digest. Empty ranges return `null` — an\n * empty range has no digest, distinct from \"digest of zero rows\" which would\n * compare equal across datasets.\n */\nexport async function computePartitionSemanticDigest(\n\tdb: Kysely<Database>,\n\tdataset: CanonicalDataset,\n\tfromBlock: number,\n\ttoBlock: number,\n\toptions: StreamOptions = {},\n): Promise<PartitionSemanticDigest> {\n\tconst rollup = SemanticDigestRollup.forDataset(dataset);\n\tfor await (const rowDigest of digestStream(\n\t\tdb,\n\t\tdataset,\n\t\tfromBlock,\n\t\ttoBlock,\n\t\toptions.batchRows ?? DEFAULT_BATCH_ROWS,\n\t)) {\n\t\trollup.appendRowDigest(rowDigest);\n\t}\n\treturn {\n\t\tdataset,\n\t\tfrom_block: fromBlock,\n\t\tto_block: toBlock,\n\t\trow_count: rollup.rowCount(),\n\t\tdigest: rollup.digest(),\n\t\tdigest_spec: SEMANTIC_DIGEST_SPEC_V1,\n\t};\n}\n\nexport type PartitionSemanticComparison = {\n\tdataset: CanonicalDataset;\n\tfrom_block: number;\n\tto_block: number;\n\tstatus: \"match\" | \"digest-mismatch\" | \"count-mismatch\" | \"missing-locally\";\n\texpected_digest: string | null;\n\tactual_digest: string | null;\n\texpected_rows: number;\n\tactual_rows: number;\n};\n\nexport function comparePartitionSemanticDigests(\n\tlocal: readonly PartitionSemanticDigest[],\n\treference: readonly PartitionSemanticDigest[],\n): PartitionSemanticComparison[] {\n\tconst localByKey = new Map(\n\t\tlocal.map((d) => [`${d.dataset}:${d.from_block}-${d.to_block}`, d]),\n\t);\n\treturn reference.map((expected) => {\n\t\tconst key = `${expected.dataset}:${expected.from_block}-${expected.to_block}`;\n\t\tconst actual = localByKey.get(key);\n\t\tconst base = {\n\t\t\tdataset: expected.dataset,\n\t\t\tfrom_block: expected.from_block,\n\t\t\tto_block: expected.to_block,\n\t\t\texpected_digest: expected.digest,\n\t\t\texpected_rows: expected.row_count,\n\t\t};\n\t\tif (!actual) {\n\t\t\treturn {\n\t\t\t\t...base,\n\t\t\t\tstatus: \"missing-locally\" as const,\n\t\t\t\tactual_digest: null,\n\t\t\t\tactual_rows: 0,\n\t\t\t};\n\t\t}\n\t\tconst status =\n\t\t\tactual.row_count !== expected.row_count\n\t\t\t\t? (\"count-mismatch\" as const)\n\t\t\t\t: actual.digest === expected.digest\n\t\t\t\t\t? (\"match\" as const)\n\t\t\t\t\t: (\"digest-mismatch\" as const);\n\t\treturn {\n\t\t\t...base,\n\t\t\tstatus,\n\t\t\tactual_digest: actual.digest,\n\t\t\tactual_rows: actual.row_count,\n\t\t};\n\t});\n}\n"
+    "import { type Kysely, sql } from \"kysely\";\nimport type { Database } from \"../db/schema.ts\";\nimport {\n\ttype PartitionSemanticDigest,\n\tSEMANTIC_DIGEST_SPEC_V1,\n\tSemanticDigestRollup,\n\tsemanticDigest,\n} from \"./semantic-digest.ts\";\n\n/**\n * Compute per-partition semantic-v1 digests directly from a database — the same\n * bytes an exporter would produce, without writing Parquet. Callers: the CLI\n * verifier's `--semantic` pass, and (in future) the node replay auditor.\n *\n * SQL and ordering MUST match the archive exporter's stream (see\n * `packages/indexer/src/archive/export-snapshot.ts`). If either drifts, an\n * honest re-computation will disagree with the manifest even though both are\n * correct — and there is no way to tell which is wrong. Any change here needs\n * a matching change there.\n */\n\nexport type CanonicalDataset = \"blocks\" | \"transactions\" | \"events\";\n\nconst DEFAULT_BATCH_ROWS = 20_000;\n\ninterface StreamOptions {\n\tbatchRows?: number;\n}\n\nasync function* streamBlockDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\tlet last = fromBlock - 1;\n\twhile (true) {\n\t\tconst rows = await db\n\t\t\t.selectFrom(\"blocks\")\n\t\t\t.select([\n\t\t\t\t\"height\",\n\t\t\t\t\"hash\",\n\t\t\t\t\"parent_hash\",\n\t\t\t\t\"burn_block_height\",\n\t\t\t\t\"burn_block_hash\",\n\t\t\t\t\"index_block_hash\",\n\t\t\t\t\"timestamp\",\n\t\t\t])\n\t\t\t.where(\"canonical\", \"=\", true)\n\t\t\t.where(\"height\", \">\", last)\n\t\t\t.where(\"height\", \"<=\", toBlock)\n\t\t\t.orderBy(\"height\", \"asc\")\n\t\t\t.limit(batchRows)\n\t\t\t.execute();\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.block({\n\t\t\t\theight: Number(row.height),\n\t\t\t\thash: row.hash,\n\t\t\t\tparent_hash: row.parent_hash,\n\t\t\t\tburn_block_height: Number(row.burn_block_height),\n\t\t\t\tburn_block_hash: row.burn_block_hash ?? null,\n\t\t\t\tindex_block_hash: row.index_block_hash ?? null,\n\t\t\t\ttimestamp: Number(row.timestamp),\n\t\t\t});\n\t\t}\n\t\tlast = Number(rows[rows.length - 1]?.height);\n\t}\n}\n\nasync function* streamTransactionDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\ttype TxRow = {\n\t\ttx_id: string;\n\t\tblock_height: string | number;\n\t\ttx_index: number;\n\t\ttype: string;\n\t\tsender: string;\n\t\tstatus: string;\n\t\tcontract_id: string | null;\n\t\tfunction_name: string | null;\n\t\tfunction_args: unknown;\n\t\traw_result: string | null;\n\t\traw_tx: string;\n\t};\n\tlet cursor: { height: number; txIndex: number; txId: string } | null = null;\n\twhile (true) {\n\t\tconst result = await sql<TxRow>`\n\t\t\tSELECT t.tx_id, t.block_height, t.tx_index, t.type, t.sender, t.status,\n\t\t\t       t.contract_id, t.function_name, t.function_args, t.raw_result, t.raw_tx\n\t\t\t  FROM transactions t\n\t\t\t  JOIN blocks b ON b.height = t.block_height AND b.canonical = true\n\t\t\t WHERE t.block_height >= ${fromBlock} AND t.block_height <= ${toBlock}\n\t\t\t   AND (${cursor === null} OR (t.block_height, t.tx_index, t.tx_id) >\n\t\t\t        (${cursor?.height ?? 0}, ${cursor?.txIndex ?? 0}, ${cursor?.txId ?? \"\"}))\n\t\t\t ORDER BY t.block_height, t.tx_index, t.tx_id\n\t\t\t LIMIT ${batchRows}\n\t\t`.execute(db);\n\t\tconst rows: TxRow[] = result.rows;\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.transaction({\n\t\t\t\ttx_id: row.tx_id,\n\t\t\t\tblock_height: Number(row.block_height),\n\t\t\t\ttx_index: row.tx_index,\n\t\t\t\ttype: row.type,\n\t\t\t\tsender: row.sender,\n\t\t\t\tstatus: row.status,\n\t\t\t\tcontract_id: row.contract_id,\n\t\t\t\tfunction_name: row.function_name,\n\t\t\t\tfunction_args: row.function_args ?? null,\n\t\t\t\traw_result: row.raw_result,\n\t\t\t\traw_tx: row.raw_tx,\n\t\t\t});\n\t\t}\n\t\tconst tail = rows[rows.length - 1];\n\t\tif (tail) {\n\t\t\tcursor = {\n\t\t\t\theight: Number(tail.block_height),\n\t\t\t\ttxIndex: tail.tx_index,\n\t\t\t\ttxId: tail.tx_id,\n\t\t\t};\n\t\t}\n\t}\n}\n\nasync function* streamEventDigests(\n\tdb: Kysely<Database>,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\ttype EventRow = {\n\t\ttx_id: string;\n\t\tblock_height: string | number;\n\t\tevent_index: number;\n\t\ttype: string;\n\t\tdata: unknown;\n\t};\n\tlet cursor: { height: number; eventIndex: number; txId: string } | null =\n\t\tnull;\n\twhile (true) {\n\t\tconst result = await sql<EventRow>`\n\t\t\tSELECT e.tx_id, e.block_height, e.event_index, e.type, e.data\n\t\t\t  FROM events e\n\t\t\t  JOIN blocks b ON b.height = e.block_height AND b.canonical = true\n\t\t\t WHERE e.block_height >= ${fromBlock} AND e.block_height <= ${toBlock}\n\t\t\t   AND (${cursor === null} OR (e.block_height, e.event_index, e.tx_id) >\n\t\t\t        (${cursor?.height ?? 0}, ${cursor?.eventIndex ?? 0}, ${cursor?.txId ?? \"\"}))\n\t\t\t ORDER BY e.block_height, e.event_index, e.tx_id\n\t\t\t LIMIT ${batchRows}\n\t\t`.execute(db);\n\t\tconst rows: EventRow[] = result.rows;\n\t\tif (rows.length === 0) return;\n\t\tfor (const row of rows) {\n\t\t\tyield semanticDigest.v1.event({\n\t\t\t\ttx_id: row.tx_id,\n\t\t\t\tblock_height: Number(row.block_height),\n\t\t\t\tevent_index: row.event_index,\n\t\t\t\ttype: row.type,\n\t\t\t\tdata: row.data ?? null,\n\t\t\t});\n\t\t}\n\t\tconst tail = rows[rows.length - 1];\n\t\tif (tail) {\n\t\t\tcursor = {\n\t\t\t\theight: Number(tail.block_height),\n\t\t\t\teventIndex: tail.event_index,\n\t\t\t\ttxId: tail.tx_id,\n\t\t\t};\n\t\t}\n\t}\n}\n\nfunction digestStream(\n\tdb: Kysely<Database>,\n\tdataset: CanonicalDataset,\n\tfromBlock: number,\n\ttoBlock: number,\n\tbatchRows: number,\n): AsyncGenerator<string> {\n\tif (dataset === \"blocks\") {\n\t\treturn streamBlockDigests(db, fromBlock, toBlock, batchRows);\n\t}\n\tif (dataset === \"transactions\") {\n\t\treturn streamTransactionDigests(db, fromBlock, toBlock, batchRows);\n\t}\n\treturn streamEventDigests(db, fromBlock, toBlock, batchRows);\n}\n\n/**\n * Compute one partition's semantic-v1 digest. Empty ranges return `null` — an\n * empty range has no digest, distinct from \"digest of zero rows\" which would\n * compare equal across datasets.\n */\nexport async function computePartitionSemanticDigest(\n\tdb: Kysely<Database>,\n\tdataset: CanonicalDataset,\n\tfromBlock: number,\n\ttoBlock: number,\n\toptions: StreamOptions = {},\n): Promise<PartitionSemanticDigest> {\n\tconst rollup = SemanticDigestRollup.forDataset(dataset);\n\tfor await (const rowDigest of digestStream(\n\t\tdb,\n\t\tdataset,\n\t\tfromBlock,\n\t\ttoBlock,\n\t\toptions.batchRows ?? DEFAULT_BATCH_ROWS,\n\t)) {\n\t\trollup.appendRowDigest(rowDigest);\n\t}\n\treturn {\n\t\tdataset,\n\t\tfrom_block: fromBlock,\n\t\tto_block: toBlock,\n\t\trow_count: rollup.rowCount(),\n\t\tdigest: rollup.digest(),\n\t\tdigest_spec: SEMANTIC_DIGEST_SPEC_V1,\n\t};\n}\n\nexport type PartitionSemanticComparison = {\n\tdataset: CanonicalDataset;\n\tfrom_block: number;\n\tto_block: number;\n\tstatus: \"match\" | \"digest-mismatch\" | \"count-mismatch\" | \"missing-locally\";\n\texpected_digest: string | null;\n\tactual_digest: string | null;\n\texpected_rows: number;\n\tactual_rows: number;\n};\n\nexport function comparePartitionSemanticDigests(\n\tlocal: readonly PartitionSemanticDigest[],\n\treference: readonly PartitionSemanticDigest[],\n): PartitionSemanticComparison[] {\n\tconst localByKey = new Map(\n\t\tlocal.map((d) => [`${d.dataset}:${d.from_block}-${d.to_block}`, d]),\n\t);\n\treturn reference.map((expected) => {\n\t\tconst key = `${expected.dataset}:${expected.from_block}-${expected.to_block}`;\n\t\tconst actual = localByKey.get(key);\n\t\tconst base = {\n\t\t\tdataset: expected.dataset,\n\t\t\tfrom_block: expected.from_block,\n\t\t\tto_block: expected.to_block,\n\t\t\texpected_digest: expected.digest,\n\t\t\texpected_rows: expected.row_count,\n\t\t};\n\t\tif (!actual) {\n\t\t\treturn {\n\t\t\t\t...base,\n\t\t\t\tstatus: \"missing-locally\" as const,\n\t\t\t\tactual_digest: null,\n\t\t\t\tactual_rows: 0,\n\t\t\t};\n\t\t}\n\t\tconst status =\n\t\t\tactual.row_count !== expected.row_count\n\t\t\t\t? (\"count-mismatch\" as const)\n\t\t\t\t: actual.digest === expected.digest\n\t\t\t\t\t? (\"match\" as const)\n\t\t\t\t\t: (\"digest-mismatch\" as const);\n\t\treturn {\n\t\t\t...base,\n\t\t\tstatus,\n\t\t\tactual_digest: actual.digest,\n\t\t\tactual_rows: actual.row_count,\n\t\t};\n\t});\n}\n",
+    "import { createHash } from \"node:crypto\";\n\n/**\n * v1 canonical byte encoding for chain identity — the shape that lets\n * independently-run runtimes agree on the same block.\n *\n * The exact-body digest (`sha256:parquet-object`) proves capture fidelity to one\n * source: replay the same bytes, get the same rows. It cannot prove two nodes\n * observed the same chain, because their Parquet encoders legally differ in\n * column padding, compression, JSON key order, and null placement — two\n * operators processing the same block can ship byte-different Parquets that\n * carry identical content.\n *\n * The semantic digest is the shape that lets independent runtimes agree. Every\n * value on a block/transaction/event is normalized into a canonical byte string\n * by rules that MUST NOT change without a version bump. Two v1 computations\n * over the same range agree, or one is wrong about the chain — never about\n * formatting.\n *\n * Encoding rules (v1):\n *   - Fields join with `\\x1f` (ASCII US, unit separator — cannot legally\n *     appear in any chain value; a printable delimiter risks collision with\n *     contract-emitted strings).\n *   - Null encodes as `\\x00` (single NUL). Distinct from empty string `\"\"`.\n *   - Integers encode as their base-10 string. bigint → decimal string.\n *   - JSON payload columns (function_args, event data) encode as canonical\n *     JSON: object keys sorted lexicographically, no whitespace, bigint →\n *     quoted decimal string, non-finite numbers rejected.\n *   - Field order per record type is fixed and never reordered.\n *   - Digest = sha256(bytes), lowercase hex.\n *\n * Rollup rules (v1) — order MUST match the archive's stream order or an\n * honest re-export will disagree with the manifest:\n *   - blocks:       (height asc)\n *   - transactions: (block_height asc, tx_index asc, tx_id asc)\n *   - events:       (block_height asc, event_index asc, tx_id asc)\n * Per-partition rollup is `sha256(concat(row_digest_bytes))` in stream order.\n *\n * Test vectors under `packages/shared/src/archive/__fixtures__/semantic-digest/`\n * pin the encoding. Any change to bytes must bump the spec version.\n */\n\nexport const SEMANTIC_DIGEST_SPEC_V1 = \"sha256:semantic-v1\" as const;\nexport type SemanticDigestSpec = typeof SEMANTIC_DIGEST_SPEC_V1;\n\nconst FIELD_SEP = \"\\x1f\";\nconst NULL_MARKER = \"\\x00\";\n\nconst textEncoder = new TextEncoder();\n\n/**\n * Stable JSON — sorted keys, no whitespace, bigint → decimal string. Distinct\n * from `JSON.stringify(x)` which respects insertion order and rejects bigints.\n * Also rejects non-finite numbers, since NaN/Infinity have no on-chain meaning\n * and would silently hash as `null` under `JSON.stringify`.\n */\nexport function canonicalJson(value: unknown): string {\n\tif (value === null) return \"null\";\n\tif (typeof value === \"string\" || typeof value === \"boolean\") {\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"canonicalJson: non-finite number\");\n\t\t}\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"bigint\") return JSON.stringify(value.toString());\n\tif (Array.isArray(value)) {\n\t\treturn `[${value.map((item) => canonicalJson(item)).join(\",\")}]`;\n\t}\n\tif (typeof value === \"object\") {\n\t\tconst object = value as Record<string, unknown>;\n\t\treturn `{${Object.keys(object)\n\t\t\t.sort()\n\t\t\t.map((key) => `${JSON.stringify(key)}:${canonicalJson(object[key])}`)\n\t\t\t.join(\",\")}}`;\n\t}\n\t// undefined / function / symbol — never present in decoded chain rows.\n\t// Fall through as null so tests catch unexpected shapes.\n\treturn \"null\";\n}\n\nfunction scalar(value: string | number | bigint | null | undefined): string {\n\tif (value === null || value === undefined) return NULL_MARKER;\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"semanticDigest: non-finite number\");\n\t\t}\n\t\tif (!Number.isInteger(value)) {\n\t\t\t// Chain heights, indexes, timestamps are all integer; a fractional\n\t\t\t// value here is a schema bug we want to surface loudly, not silently\n\t\t\t// serialize with float precision that varies by runtime.\n\t\t\tthrow new Error(`semanticDigest: non-integer scalar ${value}`);\n\t\t}\n\t\treturn String(value);\n\t}\n\tif (typeof value === \"bigint\") return value.toString();\n\treturn value;\n}\n\nfunction jsonScalar(value: unknown): string {\n\treturn value === null || value === undefined\n\t\t? NULL_MARKER\n\t\t: canonicalJson(value);\n}\n\nfunction sha256Hex(input: Uint8Array | string): string {\n\treturn createHash(\"sha256\").update(input).digest(\"hex\");\n}\n\nexport interface BlockDigestInput {\n\theight: number | bigint;\n\thash: string;\n\tparent_hash: string;\n\tburn_block_height: number | bigint;\n\tburn_block_hash: string | null;\n\tindex_block_hash: string | null;\n\ttimestamp: number | bigint;\n}\n\nexport interface TransactionDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\ttx_index: number;\n\ttype: string;\n\tsender: string;\n\tstatus: string;\n\tcontract_id: string | null;\n\tfunction_name: string | null;\n\tfunction_args: unknown;\n\traw_result: string | null;\n\traw_tx: string;\n}\n\nexport interface EventDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\tevent_index: number;\n\ttype: string;\n\tdata: unknown;\n}\n\nfunction encodeBlock(row: BlockDigestInput): string {\n\treturn [\n\t\tscalar(row.height),\n\t\tscalar(row.hash),\n\t\tscalar(row.parent_hash),\n\t\tscalar(row.burn_block_height),\n\t\tscalar(row.burn_block_hash),\n\t\tscalar(row.index_block_hash),\n\t\tscalar(row.timestamp),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeTransaction(row: TransactionDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.tx_index),\n\t\tscalar(row.type),\n\t\tscalar(row.sender),\n\t\tscalar(row.status),\n\t\tscalar(row.contract_id),\n\t\tscalar(row.function_name),\n\t\tjsonScalar(row.function_args),\n\t\tscalar(row.raw_result),\n\t\tscalar(row.raw_tx),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeEvent(row: EventDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.event_index),\n\t\tscalar(row.type),\n\t\tjsonScalar(row.data),\n\t].join(FIELD_SEP);\n}\n\n/**\n * v1 per-row digests. Each is `sha256(encoded_row_bytes)` in lowercase hex.\n * The encoded byte form is stable across runtimes; the sha256 is stable\n * across CPU architectures. Never mutate an encoder without a v-bump.\n */\nexport interface SemanticDigestV1 {\n\treadonly spec: SemanticDigestSpec;\n\treadonly encodeBlock: (row: BlockDigestInput) => string;\n\treadonly encodeTransaction: (row: TransactionDigestInput) => string;\n\treadonly encodeEvent: (row: EventDigestInput) => string;\n\treadonly block: (row: BlockDigestInput) => string;\n\treadonly transaction: (row: TransactionDigestInput) => string;\n\treadonly event: (row: EventDigestInput) => string;\n}\n\nexport interface SemanticDigestApi {\n\treadonly v1: SemanticDigestV1;\n}\n\nexport const semanticDigest: SemanticDigestApi = {\n\tv1: {\n\t\tspec: SEMANTIC_DIGEST_SPEC_V1,\n\t\tencodeBlock,\n\t\tencodeTransaction,\n\t\tencodeEvent,\n\t\tblock: (row: BlockDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeBlock(row))),\n\t\ttransaction: (row: TransactionDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeTransaction(row))),\n\t\tevent: (row: EventDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeEvent(row))),\n\t},\n};\n\n/**\n * Streaming rollup — feed rows one at a time in their declared order, read the\n * rolled digest at the end. Two callers passing the same rows in the same order\n * produce the same rollup, regardless of batching.\n *\n * The rollup composes: partition_digest = sha256(concat(row_digest_bytes)),\n * where each row_digest_bytes = sha256(encode(row)). This is why the streaming\n * implementation can be constant-memory — the outer sha256 accepts row digests\n * incrementally.\n */\nexport class SemanticDigestRollup {\n\tprivate readonly hasher = createHash(\"sha256\");\n\tprivate count = 0;\n\n\tstatic forDataset(\n\t\t_dataset: \"blocks\" | \"transactions\" | \"events\",\n\t): SemanticDigestRollup {\n\t\treturn new SemanticDigestRollup();\n\t}\n\n\tappendRowDigest(rowDigestHex: string): void {\n\t\tthis.hasher.update(Buffer.from(rowDigestHex, \"hex\"));\n\t\tthis.count += 1;\n\t}\n\n\trowCount(): number {\n\t\treturn this.count;\n\t}\n\n\t/** Empty rollups return `null`, not the sha256 of nothing, so an empty\n\t *  range never compares equal to another empty range on a different\n\t *  dataset. Callers assign `null` semantics deliberately. */\n\tdigest(): string | null {\n\t\treturn this.count === 0 ? null : this.hasher.copy().digest(\"hex\");\n\t}\n\n\tspec(): SemanticDigestSpec {\n\t\treturn SEMANTIC_DIGEST_SPEC_V1;\n\t}\n}\n\n/**\n * Per-partition digest record — the shape that lands in the snapshot manifest.\n * Complements the existing `sha256:parquet-object` per-partition digest by\n * proving semantic identity independent of file encoding.\n */\nexport interface PartitionSemanticDigest {\n\tdataset: \"blocks\" | \"transactions\" | \"events\";\n\tfrom_block: number;\n\tto_block: number;\n\trow_count: number;\n\tdigest: string | null;\n\tdigest_spec: SemanticDigestSpec;\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AA0CO,IAAM,0BAA0B;AAGvC,IAAM,YAAY;AAClB,IAAM,cAAc;AAEpB,IAAM,cAAc,IAAI;AAQjB,SAAS,aAAa,CAAC,OAAwB;AAAA,EACrD,IAAI,UAAU;AAAA,IAAM,OAAO;AAAA,EAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAAA,IAC5D,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,kCAAkC;AAAA,IACnD;AAAA,IACA,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,KAAK,UAAU,MAAM,SAAS,CAAC;AAAA,EACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;AAAA,IACzB,OAAO,IAAI,MAAM,IAAI,CAAC,SAAS,cAAc,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,EAC7D;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,MAAM,SAAS;AAAA,IACf,OAAO,IAAI,OAAO,KAAK,MAAM,EAC3B,KAAK,EACL,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,KAAK,cAAc,OAAO,IAAI,GAAG,EACnE,KAAK,GAAG;AAAA,EACX;AAAA,EAGA,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,OAA4D;AAAA,EAC3E,IAAI,UAAU,QAAQ,UAAU;AAAA,IAAW,OAAO;AAAA,EAClD,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,mCAAmC;AAAA,IACpD;AAAA,IACA,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAAA,MAI7B,MAAM,IAAI,MAAM,sCAAsC,OAAO;AAAA,IAC9D;AAAA,IACA,OAAO,OAAO,KAAK;AAAA,EACpB;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,MAAM,SAAS;AAAA,EACrD,OAAO;AAAA;AAGR,SAAS,UAAU,CAAC,OAAwB;AAAA,EAC3C,OAAO,UAAU,QAAQ,UAAU,YAChC,cACA,cAAc,KAAK;AAAA;AAGvB,SAAS,SAAS,CAAC,OAAoC;AAAA,EACtD,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAmCvD,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,iBAAiB;AAAA,IAC5B,OAAO,IAAI,eAAe;AAAA,IAC1B,OAAO,IAAI,gBAAgB;AAAA,IAC3B,OAAO,IAAI,SAAS;AAAA,EACrB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,iBAAiB,CAAC,KAAqC;AAAA,EAC/D,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,QAAQ;AAAA,IACnB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,aAAa;AAAA,IACxB,WAAW,IAAI,aAAa;AAAA,IAC5B,OAAO,IAAI,UAAU;AAAA,IACrB,OAAO,IAAI,MAAM;AAAA,EAClB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,IAAI;AAAA,IACf,WAAW,IAAI,IAAI;AAAA,EACpB,EAAE,KAAK,SAAS;AAAA;AAsBV,IAAM,iBAAoC;AAAA,EAChD,IAAI;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,IAC/C,aAAa,CAAC,QACb,UAAU,YAAY,OAAO,kBAAkB,GAAG,CAAC,CAAC;AAAA,IACrD,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,EAChD;AACD;AAAA;AAYO,MAAM,qBAAqB;AAAA,EAChB,SAAS,WAAW,QAAQ;AAAA,EACrC,QAAQ;AAAA,SAET,UAAU,CAChB,UACuB;AAAA,IACvB,OAAO,IAAI;AAAA;AAAA,EAGZ,eAAe,CAAC,cAA4B;AAAA,IAC3C,KAAK,OAAO,OAAO,OAAO,KAAK,cAAc,KAAK,CAAC;AAAA,IACnD,KAAK,SAAS;AAAA;AAAA,EAGf,QAAQ,GAAW;AAAA,IAClB,OAAO,KAAK;AAAA;AAAA,EAMb,MAAM,GAAkB;AAAA,IACvB,OAAO,KAAK,UAAU,IAAI,OAAO,KAAK,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAAA,EAGjE,IAAI,GAAuB;AAAA,IAC1B,OAAO;AAAA;AAET;;;AC9PA;AAuBA,IAAM,qBAAqB;AAM3B,gBAAgB,kBAAkB,CACjC,IACA,WACA,SACA,WACyB;AAAA,EACzB,IAAI,OAAO,YAAY;AAAA,EACvB,OAAO,MAAM;AAAA,IACZ,MAAM,OAAO,MAAM,GACjB,WAAW,QAAQ,EACnB,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC,EACA,MAAM,aAAa,KAAK,IAAI,EAC5B,MAAM,UAAU,KAAK,IAAI,EACzB,MAAM,UAAU,MAAM,OAAO,EAC7B,QAAQ,UAAU,KAAK,EACvB,MAAM,SAAS,EACf,QAAQ;AAAA,IACV,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,MAAM;AAAA,QAC7B,QAAQ,OAAO,IAAI,MAAM;AAAA,QACzB,MAAM,IAAI;AAAA,QACV,aAAa,IAAI;AAAA,QACjB,mBAAmB,OAAO,IAAI,iBAAiB;AAAA,QAC/C,iBAAiB,IAAI,mBAAmB;AAAA,QACxC,kBAAkB,IAAI,oBAAoB;AAAA,QAC1C,WAAW,OAAO,IAAI,SAAS;AAAA,MAChC,CAAC;AAAA,IACF;AAAA,IACA,OAAO,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM;AAAA,EAC5C;AAAA;AAGD,gBAAgB,wBAAwB,CACvC,IACA,WACA,SACA,WACyB;AAAA,EAczB,IAAI,SAAmE;AAAA,EACvE,OAAO,MAAM;AAAA,IACZ,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,8BAKO,mCAAmC;AAAA,aACpD,WAAW;AAAA,cACV,QAAQ,UAAU,MAAM,QAAQ,WAAW,MAAM,QAAQ,QAAQ;AAAA;AAAA,YAEnE;AAAA,IACR,QAAQ,EAAE;AAAA,IACZ,MAAM,OAAgB,OAAO;AAAA,IAC7B,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,YAAY;AAAA,QACnC,OAAO,IAAI;AAAA,QACX,cAAc,OAAO,IAAI,YAAY;AAAA,QACrC,UAAU,IAAI;AAAA,QACd,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,QACZ,QAAQ,IAAI;AAAA,QACZ,aAAa,IAAI;AAAA,QACjB,eAAe,IAAI;AAAA,QACnB,eAAe,IAAI,iBAAiB;AAAA,QACpC,YAAY,IAAI;AAAA,QAChB,QAAQ,IAAI;AAAA,MACb,CAAC;AAAA,IACF;AAAA,IACA,MAAM,OAAO,KAAK,KAAK,SAAS;AAAA,IAChC,IAAI,MAAM;AAAA,MACT,SAAS;AAAA,QACR,QAAQ,OAAO,KAAK,YAAY;AAAA,QAChC,SAAS,KAAK;AAAA,QACd,MAAM,KAAK;AAAA,MACZ;AAAA,IACD;AAAA,EACD;AAAA;AAGD,gBAAgB,kBAAkB,CACjC,IACA,WACA,SACA,WACyB;AAAA,EAQzB,IAAI,SACH;AAAA,EACD,OAAO,MAAM;AAAA,IACZ,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA,8BAIO,mCAAmC;AAAA,aACpD,WAAW;AAAA,cACV,QAAQ,UAAU,MAAM,QAAQ,cAAc,MAAM,QAAQ,QAAQ;AAAA;AAAA,YAEtE;AAAA,IACR,QAAQ,EAAE;AAAA,IACZ,MAAM,OAAmB,OAAO;AAAA,IAChC,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,MAAM;AAAA,QAC7B,OAAO,IAAI;AAAA,QACX,cAAc,OAAO,IAAI,YAAY;AAAA,QACrC,aAAa,IAAI;AAAA,QACjB,MAAM,IAAI;AAAA,QACV,MAAM,IAAI,QAAQ;AAAA,MACnB,CAAC;AAAA,IACF;AAAA,IACA,MAAM,OAAO,KAAK,KAAK,SAAS;AAAA,IAChC,IAAI,MAAM;AAAA,MACT,SAAS;AAAA,QACR,QAAQ,OAAO,KAAK,YAAY;AAAA,QAChC,YAAY,KAAK;AAAA,QACjB,MAAM,KAAK;AAAA,MACZ;AAAA,IACD;AAAA,EACD;AAAA;AAGD,SAAS,YAAY,CACpB,IACA,SACA,WACA,SACA,WACyB;AAAA,EACzB,IAAI,YAAY,UAAU;AAAA,IACzB,OAAO,mBAAmB,IAAI,WAAW,SAAS,SAAS;AAAA,EAC5D;AAAA,EACA,IAAI,YAAY,gBAAgB;AAAA,IAC/B,OAAO,yBAAyB,IAAI,WAAW,SAAS,SAAS;AAAA,EAClE;AAAA,EACA,OAAO,mBAAmB,IAAI,WAAW,SAAS,SAAS;AAAA;AAQ5D,eAAsB,8BAA8B,CACnD,IACA,SACA,WACA,SACA,UAAyB,CAAC,GACS;AAAA,EACnC,MAAM,SAAS,qBAAqB,WAAW,OAAO;AAAA,EACtD,iBAAiB,aAAa,aAC7B,IACA,SACA,WACA,SACA,QAAQ,aAAa,kBACtB,GAAG;AAAA,IACF,OAAO,gBAAgB,SAAS;AAAA,EACjC;AAAA,EACA,OAAO;AAAA,IACN;AAAA,IACA,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,WAAW,OAAO,SAAS;AAAA,IAC3B,QAAQ,OAAO,OAAO;AAAA,IACtB,aAAa;AAAA,EACd;AAAA;AAcM,SAAS,+BAA+B,CAC9C,OACA,WACgC;AAAA,EAChC,MAAM,aAAa,IAAI,IACtB,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC,CACnE;AAAA,EACA,OAAO,UAAU,IAAI,CAAC,aAAa;AAAA,IAClC,MAAM,MAAM,GAAG,SAAS,WAAW,SAAS,cAAc,SAAS;AAAA,IACnE,MAAM,SAAS,WAAW,IAAI,GAAG;AAAA,IACjC,MAAM,OAAO;AAAA,MACZ,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB,iBAAiB,SAAS;AAAA,MAC1B,eAAe,SAAS;AAAA,IACzB;AAAA,IACA,IAAI,CAAC,QAAQ;AAAA,MACZ,OAAO;AAAA,WACH;AAAA,QACH,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,aAAa;AAAA,MACd;AAAA,IACD;AAAA,IACA,MAAM,SACL,OAAO,cAAc,SAAS,YAC1B,mBACD,OAAO,WAAW,SAAS,SACzB,UACA;AAAA,IACN,OAAO;AAAA,SACH;AAAA,MACH;AAAA,MACA,eAAe,OAAO;AAAA,MACtB,aAAa,OAAO;AAAA,IACrB;AAAA,GACA;AAAA;",
-  "debugId": "DAABB1E8285EB5FE64756E2164756E21",
+  "mappings": ";AAAA;;;ACAA;AA0CO,IAAM,0BAA0B;AAGvC,IAAM,YAAY;AAClB,IAAM,cAAc;AAEpB,IAAM,cAAc,IAAI;AAQjB,SAAS,aAAa,CAAC,OAAwB;AAAA,EACrD,IAAI,UAAU;AAAA,IAAM,OAAO;AAAA,EAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAAA,IAC5D,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,kCAAkC;AAAA,IACnD;AAAA,IACA,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,KAAK,UAAU,MAAM,SAAS,CAAC;AAAA,EACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;AAAA,IACzB,OAAO,IAAI,MAAM,IAAI,CAAC,SAAS,cAAc,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,EAC7D;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,MAAM,SAAS;AAAA,IACf,OAAO,IAAI,OAAO,KAAK,MAAM,EAC3B,KAAK,EACL,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,KAAK,cAAc,OAAO,IAAI,GAAG,EACnE,KAAK,GAAG;AAAA,EACX;AAAA,EAGA,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,OAA4D;AAAA,EAC3E,IAAI,UAAU,QAAQ,UAAU;AAAA,IAAW,OAAO;AAAA,EAClD,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,mCAAmC;AAAA,IACpD;AAAA,IACA,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAAA,MAI7B,MAAM,IAAI,MAAM,sCAAsC,OAAO;AAAA,IAC9D;AAAA,IACA,OAAO,OAAO,KAAK;AAAA,EACpB;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,MAAM,SAAS;AAAA,EACrD,OAAO;AAAA;AAGR,SAAS,UAAU,CAAC,OAAwB;AAAA,EAC3C,OAAO,UAAU,QAAQ,UAAU,YAChC,cACA,cAAc,KAAK;AAAA;AAGvB,SAAS,SAAS,CAAC,OAAoC;AAAA,EACtD,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAmCvD,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,iBAAiB;AAAA,IAC5B,OAAO,IAAI,eAAe;AAAA,IAC1B,OAAO,IAAI,gBAAgB;AAAA,IAC3B,OAAO,IAAI,SAAS;AAAA,EACrB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,iBAAiB,CAAC,KAAqC;AAAA,EAC/D,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,QAAQ;AAAA,IACnB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,aAAa;AAAA,IACxB,WAAW,IAAI,aAAa;AAAA,IAC5B,OAAO,IAAI,UAAU;AAAA,IACrB,OAAO,IAAI,MAAM;AAAA,EAClB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,IAAI;AAAA,IACf,WAAW,IAAI,IAAI;AAAA,EACpB,EAAE,KAAK,SAAS;AAAA;AAsBV,IAAM,iBAAoC;AAAA,EAChD,IAAI;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,IAC/C,aAAa,CAAC,QACb,UAAU,YAAY,OAAO,kBAAkB,GAAG,CAAC,CAAC;AAAA,IACrD,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,EAChD;AACD;AAAA;AAYO,MAAM,qBAAqB;AAAA,EAChB,SAAS,WAAW,QAAQ;AAAA,EACrC,QAAQ;AAAA,SAET,UAAU,CAChB,UACuB;AAAA,IACvB,OAAO,IAAI;AAAA;AAAA,EAGZ,eAAe,CAAC,cAA4B;AAAA,IAC3C,KAAK,OAAO,OAAO,OAAO,KAAK,cAAc,KAAK,CAAC;AAAA,IACnD,KAAK,SAAS;AAAA;AAAA,EAGf,QAAQ,GAAW;AAAA,IAClB,OAAO,KAAK;AAAA;AAAA,EAMb,MAAM,GAAkB;AAAA,IACvB,OAAO,KAAK,UAAU,IAAI,OAAO,KAAK,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAAA,EAGjE,IAAI,GAAuB;AAAA,IAC1B,OAAO;AAAA;AAET;;;ADvOA,IAAM,qBAAqB;AAM3B,gBAAgB,kBAAkB,CACjC,IACA,WACA,SACA,WACyB;AAAA,EACzB,IAAI,OAAO,YAAY;AAAA,EACvB,OAAO,MAAM;AAAA,IACZ,MAAM,OAAO,MAAM,GACjB,WAAW,QAAQ,EACnB,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC,EACA,MAAM,aAAa,KAAK,IAAI,EAC5B,MAAM,UAAU,KAAK,IAAI,EACzB,MAAM,UAAU,MAAM,OAAO,EAC7B,QAAQ,UAAU,KAAK,EACvB,MAAM,SAAS,EACf,QAAQ;AAAA,IACV,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,MAAM;AAAA,QAC7B,QAAQ,OAAO,IAAI,MAAM;AAAA,QACzB,MAAM,IAAI;AAAA,QACV,aAAa,IAAI;AAAA,QACjB,mBAAmB,OAAO,IAAI,iBAAiB;AAAA,QAC/C,iBAAiB,IAAI,mBAAmB;AAAA,QACxC,kBAAkB,IAAI,oBAAoB;AAAA,QAC1C,WAAW,OAAO,IAAI,SAAS;AAAA,MAChC,CAAC;AAAA,IACF;AAAA,IACA,OAAO,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM;AAAA,EAC5C;AAAA;AAGD,gBAAgB,wBAAwB,CACvC,IACA,WACA,SACA,WACyB;AAAA,EAczB,IAAI,SAAmE;AAAA,EACvE,OAAO,MAAM;AAAA,IACZ,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,8BAKO,mCAAmC;AAAA,aACpD,WAAW;AAAA,cACV,QAAQ,UAAU,MAAM,QAAQ,WAAW,MAAM,QAAQ,QAAQ;AAAA;AAAA,YAEnE;AAAA,IACR,QAAQ,EAAE;AAAA,IACZ,MAAM,OAAgB,OAAO;AAAA,IAC7B,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,YAAY;AAAA,QACnC,OAAO,IAAI;AAAA,QACX,cAAc,OAAO,IAAI,YAAY;AAAA,QACrC,UAAU,IAAI;AAAA,QACd,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,QACZ,QAAQ,IAAI;AAAA,QACZ,aAAa,IAAI;AAAA,QACjB,eAAe,IAAI;AAAA,QACnB,eAAe,IAAI,iBAAiB;AAAA,QACpC,YAAY,IAAI;AAAA,QAChB,QAAQ,IAAI;AAAA,MACb,CAAC;AAAA,IACF;AAAA,IACA,MAAM,OAAO,KAAK,KAAK,SAAS;AAAA,IAChC,IAAI,MAAM;AAAA,MACT,SAAS;AAAA,QACR,QAAQ,OAAO,KAAK,YAAY;AAAA,QAChC,SAAS,KAAK;AAAA,QACd,MAAM,KAAK;AAAA,MACZ;AAAA,IACD;AAAA,EACD;AAAA;AAGD,gBAAgB,kBAAkB,CACjC,IACA,WACA,SACA,WACyB;AAAA,EAQzB,IAAI,SACH;AAAA,EACD,OAAO,MAAM;AAAA,IACZ,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA,8BAIO,mCAAmC;AAAA,aACpD,WAAW;AAAA,cACV,QAAQ,UAAU,MAAM,QAAQ,cAAc,MAAM,QAAQ,QAAQ;AAAA;AAAA,YAEtE;AAAA,IACR,QAAQ,EAAE;AAAA,IACZ,MAAM,OAAmB,OAAO;AAAA,IAChC,IAAI,KAAK,WAAW;AAAA,MAAG;AAAA,IACvB,WAAW,OAAO,MAAM;AAAA,MACvB,MAAM,eAAe,GAAG,MAAM;AAAA,QAC7B,OAAO,IAAI;AAAA,QACX,cAAc,OAAO,IAAI,YAAY;AAAA,QACrC,aAAa,IAAI;AAAA,QACjB,MAAM,IAAI;AAAA,QACV,MAAM,IAAI,QAAQ;AAAA,MACnB,CAAC;AAAA,IACF;AAAA,IACA,MAAM,OAAO,KAAK,KAAK,SAAS;AAAA,IAChC,IAAI,MAAM;AAAA,MACT,SAAS;AAAA,QACR,QAAQ,OAAO,KAAK,YAAY;AAAA,QAChC,YAAY,KAAK;AAAA,QACjB,MAAM,KAAK;AAAA,MACZ;AAAA,IACD;AAAA,EACD;AAAA;AAGD,SAAS,YAAY,CACpB,IACA,SACA,WACA,SACA,WACyB;AAAA,EACzB,IAAI,YAAY,UAAU;AAAA,IACzB,OAAO,mBAAmB,IAAI,WAAW,SAAS,SAAS;AAAA,EAC5D;AAAA,EACA,IAAI,YAAY,gBAAgB;AAAA,IAC/B,OAAO,yBAAyB,IAAI,WAAW,SAAS,SAAS;AAAA,EAClE;AAAA,EACA,OAAO,mBAAmB,IAAI,WAAW,SAAS,SAAS;AAAA;AAQ5D,eAAsB,8BAA8B,CACnD,IACA,SACA,WACA,SACA,UAAyB,CAAC,GACS;AAAA,EACnC,MAAM,SAAS,qBAAqB,WAAW,OAAO;AAAA,EACtD,iBAAiB,aAAa,aAC7B,IACA,SACA,WACA,SACA,QAAQ,aAAa,kBACtB,GAAG;AAAA,IACF,OAAO,gBAAgB,SAAS;AAAA,EACjC;AAAA,EACA,OAAO;AAAA,IACN;AAAA,IACA,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,WAAW,OAAO,SAAS;AAAA,IAC3B,QAAQ,OAAO,OAAO;AAAA,IACtB,aAAa;AAAA,EACd;AAAA;AAcM,SAAS,+BAA+B,CAC9C,OACA,WACgC;AAAA,EAChC,MAAM,aAAa,IAAI,IACtB,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC,CACnE;AAAA,EACA,OAAO,UAAU,IAAI,CAAC,aAAa;AAAA,IAClC,MAAM,MAAM,GAAG,SAAS,WAAW,SAAS,cAAc,SAAS;AAAA,IACnE,MAAM,SAAS,WAAW,IAAI,GAAG;AAAA,IACjC,MAAM,OAAO;AAAA,MACZ,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB,iBAAiB,SAAS;AAAA,MAC1B,eAAe,SAAS;AAAA,IACzB;AAAA,IACA,IAAI,CAAC,QAAQ;AAAA,MACZ,OAAO;AAAA,WACH;AAAA,QACH,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,aAAa;AAAA,MACd;AAAA,IACD;AAAA,IACA,MAAM,SACL,OAAO,cAAc,SAAS,YAC1B,mBACD,OAAO,WAAW,SAAS,SACzB,UACA;AAAA,IACN,OAAO;AAAA,SACH;AAAA,MACH;AAAA,MACA,eAAe,OAAO;AAAA,MACtB,aAAa,OAAO;AAAA,IACrB;AAAA,GACA;AAAA;",
+  "debugId": "0559E7178C9550A164756E2164756E21",
   "names": []
 }

package/dist/src/archive/semantic-digest.d.ts

@@ -128,4 +128,4 @@ interface PartitionSemanticDigest {
 	digest: string | null;
 	digest_spec: SemanticDigestSpec;
 }
-export { semanticDigest, canonicalJson, TransactionDigestInput, SemanticDigestV1, SemanticDigestSpec, SemanticDigestRollup, SemanticDigestApi, SEMANTIC_DIGEST_SPEC_V1, PartitionSemanticDigest, EventDigestInput, BlockDigestInput };
+export { BlockDigestInput, EventDigestInput, PartitionSemanticDigest, SEMANTIC_DIGEST_SPEC_V1, SemanticDigestApi, SemanticDigestRollup, SemanticDigestSpec, SemanticDigestV1, TransactionDigestInput, canonicalJson, semanticDigest };

package/dist/src/archive/semantic-digest.js

@@ -1,19 +1,3 @@
-import { createRequire } from "node:module";
-var __defProp = Object.defineProperty;
-var __returnValue = (v) => v;
-function __exportSetter(name, newValue) {
-  this[name] = __returnValue.bind(null, newValue);
-}
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, {
-      get: all[name],
-      enumerable: true,
-      configurable: true,
-      set: __exportSetter.bind(all, name)
-    });
-};
-
 // src/archive/semantic-digest.ts
 import { createHash } from "node:crypto";
 var SEMANTIC_DIGEST_SPEC_V1 = "sha256:semantic-v1";
@@ -133,11 +117,11 @@ class SemanticDigestRollup {
   }
 }
 export {
-  semanticDigest,
-  canonicalJson,
+  SEMANTIC_DIGEST_SPEC_V1,
   SemanticDigestRollup,
-  SEMANTIC_DIGEST_SPEC_V1
+  canonicalJson,
+  semanticDigest
 };
 
-//# debugId=85768A1D774EC06C64756E2164756E21
+//# debugId=875B24339EB4B9CB64756E2164756E21
 //# sourceMappingURL=semantic-digest.js.map

package/dist/src/archive/semantic-digest.js.map

@@ -4,7 +4,7 @@
   "sourcesContent": [
     "import { createHash } from \"node:crypto\";\n\n/**\n * v1 canonical byte encoding for chain identity — the shape that lets\n * independently-run runtimes agree on the same block.\n *\n * The exact-body digest (`sha256:parquet-object`) proves capture fidelity to one\n * source: replay the same bytes, get the same rows. It cannot prove two nodes\n * observed the same chain, because their Parquet encoders legally differ in\n * column padding, compression, JSON key order, and null placement — two\n * operators processing the same block can ship byte-different Parquets that\n * carry identical content.\n *\n * The semantic digest is the shape that lets independent runtimes agree. Every\n * value on a block/transaction/event is normalized into a canonical byte string\n * by rules that MUST NOT change without a version bump. Two v1 computations\n * over the same range agree, or one is wrong about the chain — never about\n * formatting.\n *\n * Encoding rules (v1):\n *   - Fields join with `\\x1f` (ASCII US, unit separator — cannot legally\n *     appear in any chain value; a printable delimiter risks collision with\n *     contract-emitted strings).\n *   - Null encodes as `\\x00` (single NUL). Distinct from empty string `\"\"`.\n *   - Integers encode as their base-10 string. bigint → decimal string.\n *   - JSON payload columns (function_args, event data) encode as canonical\n *     JSON: object keys sorted lexicographically, no whitespace, bigint →\n *     quoted decimal string, non-finite numbers rejected.\n *   - Field order per record type is fixed and never reordered.\n *   - Digest = sha256(bytes), lowercase hex.\n *\n * Rollup rules (v1) — order MUST match the archive's stream order or an\n * honest re-export will disagree with the manifest:\n *   - blocks:       (height asc)\n *   - transactions: (block_height asc, tx_index asc, tx_id asc)\n *   - events:       (block_height asc, event_index asc, tx_id asc)\n * Per-partition rollup is `sha256(concat(row_digest_bytes))` in stream order.\n *\n * Test vectors under `packages/shared/src/archive/__fixtures__/semantic-digest/`\n * pin the encoding. Any change to bytes must bump the spec version.\n */\n\nexport const SEMANTIC_DIGEST_SPEC_V1 = \"sha256:semantic-v1\" as const;\nexport type SemanticDigestSpec = typeof SEMANTIC_DIGEST_SPEC_V1;\n\nconst FIELD_SEP = \"\\x1f\";\nconst NULL_MARKER = \"\\x00\";\n\nconst textEncoder = new TextEncoder();\n\n/**\n * Stable JSON — sorted keys, no whitespace, bigint → decimal string. Distinct\n * from `JSON.stringify(x)` which respects insertion order and rejects bigints.\n * Also rejects non-finite numbers, since NaN/Infinity have no on-chain meaning\n * and would silently hash as `null` under `JSON.stringify`.\n */\nexport function canonicalJson(value: unknown): string {\n\tif (value === null) return \"null\";\n\tif (typeof value === \"string\" || typeof value === \"boolean\") {\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"canonicalJson: non-finite number\");\n\t\t}\n\t\treturn JSON.stringify(value);\n\t}\n\tif (typeof value === \"bigint\") return JSON.stringify(value.toString());\n\tif (Array.isArray(value)) {\n\t\treturn `[${value.map((item) => canonicalJson(item)).join(\",\")}]`;\n\t}\n\tif (typeof value === \"object\") {\n\t\tconst object = value as Record<string, unknown>;\n\t\treturn `{${Object.keys(object)\n\t\t\t.sort()\n\t\t\t.map((key) => `${JSON.stringify(key)}:${canonicalJson(object[key])}`)\n\t\t\t.join(\",\")}}`;\n\t}\n\t// undefined / function / symbol — never present in decoded chain rows.\n\t// Fall through as null so tests catch unexpected shapes.\n\treturn \"null\";\n}\n\nfunction scalar(value: string | number | bigint | null | undefined): string {\n\tif (value === null || value === undefined) return NULL_MARKER;\n\tif (typeof value === \"number\") {\n\t\tif (!Number.isFinite(value)) {\n\t\t\tthrow new Error(\"semanticDigest: non-finite number\");\n\t\t}\n\t\tif (!Number.isInteger(value)) {\n\t\t\t// Chain heights, indexes, timestamps are all integer; a fractional\n\t\t\t// value here is a schema bug we want to surface loudly, not silently\n\t\t\t// serialize with float precision that varies by runtime.\n\t\t\tthrow new Error(`semanticDigest: non-integer scalar ${value}`);\n\t\t}\n\t\treturn String(value);\n\t}\n\tif (typeof value === \"bigint\") return value.toString();\n\treturn value;\n}\n\nfunction jsonScalar(value: unknown): string {\n\treturn value === null || value === undefined\n\t\t? NULL_MARKER\n\t\t: canonicalJson(value);\n}\n\nfunction sha256Hex(input: Uint8Array | string): string {\n\treturn createHash(\"sha256\").update(input).digest(\"hex\");\n}\n\nexport interface BlockDigestInput {\n\theight: number | bigint;\n\thash: string;\n\tparent_hash: string;\n\tburn_block_height: number | bigint;\n\tburn_block_hash: string | null;\n\tindex_block_hash: string | null;\n\ttimestamp: number | bigint;\n}\n\nexport interface TransactionDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\ttx_index: number;\n\ttype: string;\n\tsender: string;\n\tstatus: string;\n\tcontract_id: string | null;\n\tfunction_name: string | null;\n\tfunction_args: unknown;\n\traw_result: string | null;\n\traw_tx: string;\n}\n\nexport interface EventDigestInput {\n\ttx_id: string;\n\tblock_height: number | bigint;\n\tevent_index: number;\n\ttype: string;\n\tdata: unknown;\n}\n\nfunction encodeBlock(row: BlockDigestInput): string {\n\treturn [\n\t\tscalar(row.height),\n\t\tscalar(row.hash),\n\t\tscalar(row.parent_hash),\n\t\tscalar(row.burn_block_height),\n\t\tscalar(row.burn_block_hash),\n\t\tscalar(row.index_block_hash),\n\t\tscalar(row.timestamp),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeTransaction(row: TransactionDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.tx_index),\n\t\tscalar(row.type),\n\t\tscalar(row.sender),\n\t\tscalar(row.status),\n\t\tscalar(row.contract_id),\n\t\tscalar(row.function_name),\n\t\tjsonScalar(row.function_args),\n\t\tscalar(row.raw_result),\n\t\tscalar(row.raw_tx),\n\t].join(FIELD_SEP);\n}\n\nfunction encodeEvent(row: EventDigestInput): string {\n\treturn [\n\t\tscalar(row.tx_id),\n\t\tscalar(row.block_height),\n\t\tscalar(row.event_index),\n\t\tscalar(row.type),\n\t\tjsonScalar(row.data),\n\t].join(FIELD_SEP);\n}\n\n/**\n * v1 per-row digests. Each is `sha256(encoded_row_bytes)` in lowercase hex.\n * The encoded byte form is stable across runtimes; the sha256 is stable\n * across CPU architectures. Never mutate an encoder without a v-bump.\n */\nexport interface SemanticDigestV1 {\n\treadonly spec: SemanticDigestSpec;\n\treadonly encodeBlock: (row: BlockDigestInput) => string;\n\treadonly encodeTransaction: (row: TransactionDigestInput) => string;\n\treadonly encodeEvent: (row: EventDigestInput) => string;\n\treadonly block: (row: BlockDigestInput) => string;\n\treadonly transaction: (row: TransactionDigestInput) => string;\n\treadonly event: (row: EventDigestInput) => string;\n}\n\nexport interface SemanticDigestApi {\n\treadonly v1: SemanticDigestV1;\n}\n\nexport const semanticDigest: SemanticDigestApi = {\n\tv1: {\n\t\tspec: SEMANTIC_DIGEST_SPEC_V1,\n\t\tencodeBlock,\n\t\tencodeTransaction,\n\t\tencodeEvent,\n\t\tblock: (row: BlockDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeBlock(row))),\n\t\ttransaction: (row: TransactionDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeTransaction(row))),\n\t\tevent: (row: EventDigestInput): string =>\n\t\t\tsha256Hex(textEncoder.encode(encodeEvent(row))),\n\t},\n};\n\n/**\n * Streaming rollup — feed rows one at a time in their declared order, read the\n * rolled digest at the end. Two callers passing the same rows in the same order\n * produce the same rollup, regardless of batching.\n *\n * The rollup composes: partition_digest = sha256(concat(row_digest_bytes)),\n * where each row_digest_bytes = sha256(encode(row)). This is why the streaming\n * implementation can be constant-memory — the outer sha256 accepts row digests\n * incrementally.\n */\nexport class SemanticDigestRollup {\n\tprivate readonly hasher = createHash(\"sha256\");\n\tprivate count = 0;\n\n\tstatic forDataset(\n\t\t_dataset: \"blocks\" | \"transactions\" | \"events\",\n\t): SemanticDigestRollup {\n\t\treturn new SemanticDigestRollup();\n\t}\n\n\tappendRowDigest(rowDigestHex: string): void {\n\t\tthis.hasher.update(Buffer.from(rowDigestHex, \"hex\"));\n\t\tthis.count += 1;\n\t}\n\n\trowCount(): number {\n\t\treturn this.count;\n\t}\n\n\t/** Empty rollups return `null`, not the sha256 of nothing, so an empty\n\t *  range never compares equal to another empty range on a different\n\t *  dataset. Callers assign `null` semantics deliberately. */\n\tdigest(): string | null {\n\t\treturn this.count === 0 ? null : this.hasher.copy().digest(\"hex\");\n\t}\n\n\tspec(): SemanticDigestSpec {\n\t\treturn SEMANTIC_DIGEST_SPEC_V1;\n\t}\n}\n\n/**\n * Per-partition digest record — the shape that lands in the snapshot manifest.\n * Complements the existing `sha256:parquet-object` per-partition digest by\n * proving semantic identity independent of file encoding.\n */\nexport interface PartitionSemanticDigest {\n\tdataset: \"blocks\" | \"transactions\" | \"events\";\n\tfrom_block: number;\n\tto_block: number;\n\trow_count: number;\n\tdigest: string | null;\n\tdigest_spec: SemanticDigestSpec;\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AA0CO,IAAM,0BAA0B;AAGvC,IAAM,YAAY;AAClB,IAAM,cAAc;AAEpB,IAAM,cAAc,IAAI;AAQjB,SAAS,aAAa,CAAC,OAAwB;AAAA,EACrD,IAAI,UAAU;AAAA,IAAM,OAAO;AAAA,EAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAAA,IAC5D,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,kCAAkC;AAAA,IACnD;AAAA,IACA,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,KAAK,UAAU,MAAM,SAAS,CAAC;AAAA,EACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;AAAA,IACzB,OAAO,IAAI,MAAM,IAAI,CAAC,SAAS,cAAc,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,EAC7D;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,MAAM,SAAS;AAAA,IACf,OAAO,IAAI,OAAO,KAAK,MAAM,EAC3B,KAAK,EACL,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,KAAK,cAAc,OAAO,IAAI,GAAG,EACnE,KAAK,GAAG;AAAA,EACX;AAAA,EAGA,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,OAA4D;AAAA,EAC3E,IAAI,UAAU,QAAQ,UAAU;AAAA,IAAW,OAAO;AAAA,EAClD,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,mCAAmC;AAAA,IACpD;AAAA,IACA,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAAA,MAI7B,MAAM,IAAI,MAAM,sCAAsC,OAAO;AAAA,IAC9D;AAAA,IACA,OAAO,OAAO,KAAK;AAAA,EACpB;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,MAAM,SAAS;AAAA,EACrD,OAAO;AAAA;AAGR,SAAS,UAAU,CAAC,OAAwB;AAAA,EAC3C,OAAO,UAAU,QAAQ,UAAU,YAChC,cACA,cAAc,KAAK;AAAA;AAGvB,SAAS,SAAS,CAAC,OAAoC;AAAA,EACtD,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAmCvD,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,iBAAiB;AAAA,IAC5B,OAAO,IAAI,eAAe;AAAA,IAC1B,OAAO,IAAI,gBAAgB;AAAA,IAC3B,OAAO,IAAI,SAAS;AAAA,EACrB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,iBAAiB,CAAC,KAAqC;AAAA,EAC/D,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,QAAQ;AAAA,IACnB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,aAAa;AAAA,IACxB,WAAW,IAAI,aAAa;AAAA,IAC5B,OAAO,IAAI,UAAU;AAAA,IACrB,OAAO,IAAI,MAAM;AAAA,EAClB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,IAAI;AAAA,IACf,WAAW,IAAI,IAAI;AAAA,EACpB,EAAE,KAAK,SAAS;AAAA;AAsBV,IAAM,iBAAoC;AAAA,EAChD,IAAI;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,IAC/C,aAAa,CAAC,QACb,UAAU,YAAY,OAAO,kBAAkB,GAAG,CAAC,CAAC;AAAA,IACrD,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,EAChD;AACD;AAAA;AAYO,MAAM,qBAAqB;AAAA,EAChB,SAAS,WAAW,QAAQ;AAAA,EACrC,QAAQ;AAAA,SAET,UAAU,CAChB,UACuB;AAAA,IACvB,OAAO,IAAI;AAAA;AAAA,EAGZ,eAAe,CAAC,cAA4B;AAAA,IAC3C,KAAK,OAAO,OAAO,OAAO,KAAK,cAAc,KAAK,CAAC;AAAA,IACnD,KAAK,SAAS;AAAA;AAAA,EAGf,QAAQ,GAAW;AAAA,IAClB,OAAO,KAAK;AAAA;AAAA,EAMb,MAAM,GAAkB;AAAA,IACvB,OAAO,KAAK,UAAU,IAAI,OAAO,KAAK,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAAA,EAGjE,IAAI,GAAuB;AAAA,IAC1B,OAAO;AAAA;AAET;",
-  "debugId": "85768A1D774EC06C64756E2164756E21",
+  "mappings": ";AAAA;AA0CO,IAAM,0BAA0B;AAGvC,IAAM,YAAY;AAClB,IAAM,cAAc;AAEpB,IAAM,cAAc,IAAI;AAQjB,SAAS,aAAa,CAAC,OAAwB;AAAA,EACrD,IAAI,UAAU;AAAA,IAAM,OAAO;AAAA,EAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAAA,IAC5D,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,kCAAkC;AAAA,IACnD;AAAA,IACA,OAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,KAAK,UAAU,MAAM,SAAS,CAAC;AAAA,EACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;AAAA,IACzB,OAAO,IAAI,MAAM,IAAI,CAAC,SAAS,cAAc,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,EAC7D;AAAA,EACA,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,MAAM,SAAS;AAAA,IACf,OAAO,IAAI,OAAO,KAAK,MAAM,EAC3B,KAAK,EACL,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,KAAK,cAAc,OAAO,IAAI,GAAG,EACnE,KAAK,GAAG;AAAA,EACX;AAAA,EAGA,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,OAA4D;AAAA,EAC3E,IAAI,UAAU,QAAQ,UAAU;AAAA,IAAW,OAAO;AAAA,EAClD,IAAI,OAAO,UAAU,UAAU;AAAA,IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAAA,MAC5B,MAAM,IAAI,MAAM,mCAAmC;AAAA,IACpD;AAAA,IACA,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAAA,MAI7B,MAAM,IAAI,MAAM,sCAAsC,OAAO;AAAA,IAC9D;AAAA,IACA,OAAO,OAAO,KAAK;AAAA,EACpB;AAAA,EACA,IAAI,OAAO,UAAU;AAAA,IAAU,OAAO,MAAM,SAAS;AAAA,EACrD,OAAO;AAAA;AAGR,SAAS,UAAU,CAAC,OAAwB;AAAA,EAC3C,OAAO,UAAU,QAAQ,UAAU,YAChC,cACA,cAAc,KAAK;AAAA;AAGvB,SAAS,SAAS,CAAC,OAAoC;AAAA,EACtD,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAmCvD,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,iBAAiB;AAAA,IAC5B,OAAO,IAAI,eAAe;AAAA,IAC1B,OAAO,IAAI,gBAAgB;AAAA,IAC3B,OAAO,IAAI,SAAS;AAAA,EACrB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,iBAAiB,CAAC,KAAqC;AAAA,EAC/D,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,QAAQ;AAAA,IACnB,OAAO,IAAI,IAAI;AAAA,IACf,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,MAAM;AAAA,IACjB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,aAAa;AAAA,IACxB,WAAW,IAAI,aAAa;AAAA,IAC5B,OAAO,IAAI,UAAU;AAAA,IACrB,OAAO,IAAI,MAAM;AAAA,EAClB,EAAE,KAAK,SAAS;AAAA;AAGjB,SAAS,WAAW,CAAC,KAA+B;AAAA,EACnD,OAAO;AAAA,IACN,OAAO,IAAI,KAAK;AAAA,IAChB,OAAO,IAAI,YAAY;AAAA,IACvB,OAAO,IAAI,WAAW;AAAA,IACtB,OAAO,IAAI,IAAI;AAAA,IACf,WAAW,IAAI,IAAI;AAAA,EACpB,EAAE,KAAK,SAAS;AAAA;AAsBV,IAAM,iBAAoC;AAAA,EAChD,IAAI;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,IAC/C,aAAa,CAAC,QACb,UAAU,YAAY,OAAO,kBAAkB,GAAG,CAAC,CAAC;AAAA,IACrD,OAAO,CAAC,QACP,UAAU,YAAY,OAAO,YAAY,GAAG,CAAC,CAAC;AAAA,EAChD;AACD;AAAA;AAYO,MAAM,qBAAqB;AAAA,EAChB,SAAS,WAAW,QAAQ;AAAA,EACrC,QAAQ;AAAA,SAET,UAAU,CAChB,UACuB;AAAA,IACvB,OAAO,IAAI;AAAA;AAAA,EAGZ,eAAe,CAAC,cAA4B;AAAA,IAC3C,KAAK,OAAO,OAAO,OAAO,KAAK,cAAc,KAAK,CAAC;AAAA,IACnD,KAAK,SAAS;AAAA;AAAA,EAGf,QAAQ,GAAW;AAAA,IAClB,OAAO,KAAK;AAAA;AAAA,EAMb,MAAM,GAAkB;AAAA,IACvB,OAAO,KAAK,UAAU,IAAI,OAAO,KAAK,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA;AAAA,EAGjE,IAAI,GAAuB;AAAA,IAC1B,OAAO;AAAA;AAET;",
+  "debugId": "875B24339EB4B9CB64756E2164756E21",
   "names": []
 }

package/dist/src/archive/status.d.ts

@@ -114,4 +114,4 @@ declare function nextScheduledArchivePublish(now: Date): Date;
 declare function deriveArchiveStatus(inputs: StatusInputs): ArchiveStatus;
 /** States a consumer should refuse to restore from. */
 declare function isRestorable(state: ArchiveState): boolean;
-export { nextScheduledArchivePublish, isRestorable, deriveArchiveStatus, StatusInputs, ArchiveStatus, ArchiveState, ARCHIVE_STATUS_SCHEMA_VERSION };
+export { ARCHIVE_STATUS_SCHEMA_VERSION, ArchiveState, ArchiveStatus, StatusInputs, deriveArchiveStatus, isRestorable, nextScheduledArchivePublish };

package/dist/src/archive/status.js

@@ -1,19 +1,3 @@
-import { createRequire } from "node:module";
-var __defProp = Object.defineProperty;
-var __returnValue = (v) => v;
-function __exportSetter(name, newValue) {
-  this[name] = __returnValue.bind(null, newValue);
-}
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, {
-      get: all[name],
-      enumerable: true,
-      configurable: true,
-      set: __exportSetter.bind(all, name)
-    });
-};
-
 // src/archive/status.ts
 var ARCHIVE_STATUS_SCHEMA_VERSION = 1;
 var DEFAULT_MAX_BLOCKS_BEHIND_FINALIZED = 60000;
@@ -121,11 +105,11 @@ function isRestorable(state) {
   return state === "fresh" || state === "lagging";
 }
 export {
-  nextScheduledArchivePublish,
-  isRestorable,
+  ARCHIVE_STATUS_SCHEMA_VERSION,
   deriveArchiveStatus,
-  ARCHIVE_STATUS_SCHEMA_VERSION
+  isRestorable,
+  nextScheduledArchivePublish
 };
 
-//# debugId=C18B5116B1FC55FB64756E2164756E21
+//# debugId=779DB5C9B354565F64756E2164756E21
 //# sourceMappingURL=status.js.map

package/dist/src/archive/status.js.map

@@ -4,7 +4,7 @@
   "sourcesContent": [
     "/**\n * `status.json` — the archive's operational truth, published short-cache from\n * verified state only.\n *\n * Everything else in the tree is immutable and signed, which makes it durable\n * but silent: a consumer holding a valid manifest cannot tell whether it is\n * current, three days behind, or the last thing published before an incident.\n * This object answers that, and it is the only object allowed to say something\n * unflattering.\n *\n * The distinction this file exists to protect:\n *\n *   lagging → the archive trails the chain tip. This is CORRECT and permanent.\n *             Two expected causes: twice-weekly publish (Wednesday and Sunday)\n *             and the finality boundary. Cadence is the bulk of the gap;\n *             finality is hours, not days. An archive that reported `stale`\n *             for its own expected lag would be crying wolf forever, and\n *             consumers would learn to ignore it.\n *   stale   → publishing stopped. The lag exceeds what cadence and the\n *             finality rule can explain, so something is broken.\n *\n * `state` is derived from measurements, never asserted by the publisher, and\n * every unhealthy state is reachable — an archive that can only report health\n * is decoration.\n */\n\n/**\n * v1 is additive. `source.decoder_head` joined the object without a bump:\n * it does not change the meaning of any existing field, and readers already\n * ignore unknown keys. Bump only if a field is renamed, removed, or\n * re-interpreted.\n */\nexport const ARCHIVE_STATUS_SCHEMA_VERSION = 1;\n\nexport type ArchiveState =\n\t| \"fresh\"\n\t| \"lagging\"\n\t| \"stale\"\n\t| \"gap\"\n\t| \"failed-audit\"\n\t| \"source-unavailable\";\n\nexport type ArchiveStatus = {\n\tschema_version: typeof ARCHIVE_STATUS_SCHEMA_VERSION;\n\tnetwork: string;\n\tstate: ArchiveState;\n\t/** Human-facing one-liner explaining the state, including WHY. */\n\tdetail: string;\n\tgenerated_at: string;\n\tarchive: {\n\t\tsnapshot_digest: string | null;\n\t\tcoverage_to_block: number | null;\n\t\tpromoted_at: string | null;\n\t\tsigning_key_id: string | null;\n\t};\n\tsource: {\n\t\t/** Chain tip as the publisher last observed it. Null when unreachable. */\n\t\ttip_height: number | null;\n\t\t/** Highest height eligible to publish under the finality rule. */\n\t\tfinalized_height: number | null;\n\t\t/**\n\t\t * Highest height the Index decoder (`decode.ft_transfer.v1`) has\n\t\t * committed. Null when the checkpoint cannot be read. Distinct from\n\t\t * `archive.coverage_to_block`, which is the last signed publish.\n\t\t */\n\t\tdecoder_head: number | null;\n\t};\n\tlag: {\n\t\t/** Behind the FINALIZED height — the number that indicates a problem. */\n\t\tblocks_behind_finalized: number | null;\n\t\t/** Behind the raw chain tip — expected to be non-zero forever. */\n\t\tblocks_behind_tip: number | null;\n\t\tseconds_since_promotion: number | null;\n\t};\n\taudit: {\n\t\tcomplete: boolean;\n\t\tchecked_at: string;\n\t} | null;\n\tsignature?: string;\n\tkey_id?: string;\n};\n\nexport type StatusInputs = {\n\tnetwork: string;\n\tsnapshotDigest: string | null;\n\tcoverageToBlock: number | null;\n\tpromotedAt: string | null;\n\tsigningKeyId: string | null;\n\t/** Null when the source could not be reached. */\n\tsourceTipHeight: number | null;\n\tfinalizedHeight: number | null;\n\t/**\n\t * Index decoder checkpoint height. Null when unread or unreachable.\n\t * Reported, never used to derive `state`.\n\t */\n\tdecoderHead?: number | null;\n\taudit: { complete: boolean; checkedAt: string } | null;\n\tnow: Date;\n\t/**\n\t * How far behind the FINALIZED height the archive may fall before it is\n\t * stale rather than merely lagging. Publishing one partition covers 50k\n\t * blocks, so a healthy archive sits well inside this.\n\t */\n\tmaxBlocksBehindFinalized?: number;\n\t/** How long since the last promotion before staleness, regardless of height. */\n\tmaxSecondsSincePromotion?: number;\n};\n\nconst DEFAULT_MAX_BLOCKS_BEHIND_FINALIZED = 60_000;\n/**\n * Must exceed the publish cadence, or the archive reports `stale` on every\n * healthy cycle and the signal means nothing.\n *\n * The publisher runs Wed + Sun, so the longest gap between promotions in a\n * healthy week is 4 days. Five days leaves a day of grace for a slow export or\n * timer jitter, and still fires two days before the next scheduled attempt\n * whenever a cycle is actually missed.\n *\n * It also lands just inside the height rule: at the observed ~7–9k blocks/day\n * the archive is ~45k blocks behind finalized at the five-day mark, so age\n * trips first and reports the more diagnostic message (\"publishing stopped\")\n * rather than the symptom.\n */\nconst DEFAULT_MAX_SECONDS_SINCE_PROMOTION = 5 * 24 * 3_600;\n\n/** systemd `OnCalendar=Wed,Sun *-*-* 08:00:00`. Host is UTC. Job start, not promotion landing. */\nconst PUBLISH_HOUR_UTC = 8;\nconst PUBLISH_WEEKDAYS_UTC = new Set([0, 3]);\n\n/**\n * Next twice-weekly publish fire strictly after `now`. Matches\n * `secondlayer-archive-publish.timer`. Export duration means the promotion\n * lands hours later; this is the scheduled start.\n */\nexport function nextScheduledArchivePublish(now: Date): Date {\n\tfor (let i = 0; i <= 7; i++) {\n\t\tconst candidate = new Date(\n\t\t\tDate.UTC(\n\t\t\t\tnow.getUTCFullYear(),\n\t\t\t\tnow.getUTCMonth(),\n\t\t\t\tnow.getUTCDate() + i,\n\t\t\t\tPUBLISH_HOUR_UTC,\n\t\t\t\t0,\n\t\t\t\t0,\n\t\t\t\t0,\n\t\t\t),\n\t\t);\n\t\tif (PUBLISH_WEEKDAYS_UTC.has(candidate.getUTCDay()) && candidate > now) {\n\t\t\treturn candidate;\n\t\t}\n\t}\n\tthrow new Error(\"nextScheduledArchivePublish: no fire in 7 days\");\n}\n\nfunction publishWeekdayName(date: Date): \"Sunday\" | \"Wednesday\" {\n\treturn date.getUTCDay() === 0 ? \"Sunday\" : \"Wednesday\";\n}\n\n/**\n * Durations here run to days, and \"beyond the 120h objective\" makes a reader do\n * arithmetic before they can tell whether that is alarming.\n */\nfunction formatAge(seconds: number): string {\n\tconst hours = seconds / 3_600;\n\tif (hours < 48) return `${Math.round(hours)}h`;\n\tconst days = hours / 24;\n\t// One decimal only when it changes the reading: 4d and 4.5d are different\n\t// facts during an incident, 5.0d is noise.\n\tconst rounded = Math.round(days * 10) / 10;\n\treturn `${Number.isInteger(rounded) ? rounded : rounded.toFixed(1)}d`;\n}\n\n/**\n * Derive status from measurements. Pure, so every state below is reachable in\n * a test rather than only in production at 3am.\n *\n * Order matters: a failing audit outranks freshness, because an archive that\n * is current and wrong is worse than one that is behind and correct.\n */\nexport function deriveArchiveStatus(inputs: StatusInputs): ArchiveStatus {\n\tconst maxBehind =\n\t\tinputs.maxBlocksBehindFinalized ?? DEFAULT_MAX_BLOCKS_BEHIND_FINALIZED;\n\tconst maxAge =\n\t\tinputs.maxSecondsSincePromotion ?? DEFAULT_MAX_SECONDS_SINCE_PROMOTION;\n\n\tconst secondsSincePromotion = inputs.promotedAt\n\t\t? Math.max(\n\t\t\t\t0,\n\t\t\t\tMath.round(\n\t\t\t\t\t(inputs.now.getTime() - Date.parse(inputs.promotedAt)) / 1000,\n\t\t\t\t),\n\t\t\t)\n\t\t: null;\n\n\tconst behindFinalized =\n\t\tinputs.finalizedHeight !== null && inputs.coverageToBlock !== null\n\t\t\t? Math.max(0, inputs.finalizedHeight - inputs.coverageToBlock)\n\t\t\t: null;\n\tconst behindTip =\n\t\tinputs.sourceTipHeight !== null && inputs.coverageToBlock !== null\n\t\t\t? Math.max(0, inputs.sourceTipHeight - inputs.coverageToBlock)\n\t\t\t: null;\n\n\tconst base = {\n\t\tschema_version:\n\t\t\tARCHIVE_STATUS_SCHEMA_VERSION as typeof ARCHIVE_STATUS_SCHEMA_VERSION,\n\t\tnetwork: inputs.network,\n\t\tgenerated_at: inputs.now.toISOString(),\n\t\tarchive: {\n\t\t\tsnapshot_digest: inputs.snapshotDigest,\n\t\t\tcoverage_to_block: inputs.coverageToBlock,\n\t\t\tpromoted_at: inputs.promotedAt,\n\t\t\tsigning_key_id: inputs.signingKeyId,\n\t\t},\n\t\tsource: {\n\t\t\ttip_height: inputs.sourceTipHeight,\n\t\t\tfinalized_height: inputs.finalizedHeight,\n\t\t\tdecoder_head: inputs.decoderHead ?? null,\n\t\t},\n\t\tlag: {\n\t\t\tblocks_behind_finalized: behindFinalized,\n\t\t\tblocks_behind_tip: behindTip,\n\t\t\tseconds_since_promotion: secondsSincePromotion,\n\t\t},\n\t\taudit: inputs.audit\n\t\t\t? { complete: inputs.audit.complete, checked_at: inputs.audit.checkedAt }\n\t\t\t: null,\n\t};\n\n\t// A failed audit is the loudest signal: current-and-wrong beats behind-and-right.\n\tif (inputs.audit && !inputs.audit.complete) {\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"failed-audit\",\n\t\t\tdetail: `the canonical audit did not pass at ${inputs.audit.checkedAt}; this archive is not safe to restore from`,\n\t\t};\n\t}\n\n\tif (!inputs.snapshotDigest || inputs.coverageToBlock === null) {\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"gap\",\n\t\t\tdetail: \"no snapshot is currently promoted\",\n\t\t};\n\t}\n\n\t// Source unreachable: report the gap in KNOWLEDGE rather than guessing. The\n\t// archive may be perfectly healthy; we cannot currently say so.\n\tif (inputs.sourceTipHeight === null || inputs.finalizedHeight === null) {\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"source-unavailable\",\n\t\t\tdetail:\n\t\t\t\t\"the chain source could not be reached, so freshness cannot be determined\",\n\t\t};\n\t}\n\n\tif (secondsSincePromotion !== null && secondsSincePromotion > maxAge) {\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"stale\",\n\t\t\tdetail: `last promotion was ${formatAge(secondsSincePromotion)} ago, beyond the ${formatAge(maxAge)} freshness objective`,\n\t\t};\n\t}\n\n\tif (behindFinalized !== null && behindFinalized > maxBehind) {\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"stale\",\n\t\t\tdetail: `${behindFinalized} blocks behind the finalized height, beyond the ${maxBehind} threshold`,\n\t\t};\n\t}\n\n\t// Behind the tip. CORRECT and permanent: twice-weekly publish plus the\n\t// finality boundary. Cadence is the bulk of the gap. Do not call this stale.\n\tif (behindTip !== null && behindTip > 0) {\n\t\tconst nextDay = publishWeekdayName(nextScheduledArchivePublish(inputs.now));\n\t\treturn {\n\t\t\t...base,\n\t\t\tstate: \"lagging\",\n\t\t\tdetail: `${behindTip} blocks behind the chain tip, which is expected: publishing is twice weekly (Wednesday and Sunday, next ${nextDay}) and stops at the finality boundary`,\n\t\t};\n\t}\n\n\treturn {\n\t\t...base,\n\t\tstate: \"fresh\",\n\t\tdetail: \"published through the finalized height\",\n\t};\n}\n\n/** States a consumer should refuse to restore from. */\nexport function isRestorable(state: ArchiveState): boolean {\n\treturn state === \"fresh\" || state === \"lagging\";\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;AAgCO,IAAM,gCAAgC;AA4E7C,IAAM,sCAAsC;AAe5C,IAAM,sCAAsC,IAAI,KAAK;AAGrD,IAAM,mBAAmB;AACzB,IAAM,uBAAuB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;AAOpC,SAAS,2BAA2B,CAAC,KAAiB;AAAA,EAC5D,SAAS,IAAI,EAAG,KAAK,GAAG,KAAK;AAAA,IAC5B,MAAM,YAAY,IAAI,KACrB,KAAK,IACJ,IAAI,eAAe,GACnB,IAAI,YAAY,GAChB,IAAI,WAAW,IAAI,GACnB,kBACA,GACA,GACA,CACD,CACD;AAAA,IACA,IAAI,qBAAqB,IAAI,UAAU,UAAU,CAAC,KAAK,YAAY,KAAK;AAAA,MACvE,OAAO;AAAA,IACR;AAAA,EACD;AAAA,EACA,MAAM,IAAI,MAAM,gDAAgD;AAAA;AAGjE,SAAS,kBAAkB,CAAC,MAAoC;AAAA,EAC/D,OAAO,KAAK,UAAU,MAAM,IAAI,WAAW;AAAA;AAO5C,SAAS,SAAS,CAAC,SAAyB;AAAA,EAC3C,MAAM,QAAQ,UAAU;AAAA,EACxB,IAAI,QAAQ;AAAA,IAAI,OAAO,GAAG,KAAK,MAAM,KAAK;AAAA,EAC1C,MAAM,OAAO,QAAQ;AAAA,EAGrB,MAAM,UAAU,KAAK,MAAM,OAAO,EAAE,IAAI;AAAA,EACxC,OAAO,GAAG,OAAO,UAAU,OAAO,IAAI,UAAU,QAAQ,QAAQ,CAAC;AAAA;AAU3D,SAAS,mBAAmB,CAAC,QAAqC;AAAA,EACxE,MAAM,YACL,OAAO,4BAA4B;AAAA,EACpC,MAAM,SACL,OAAO,4BAA4B;AAAA,EAEpC,MAAM,wBAAwB,OAAO,aAClC,KAAK,IACL,GACA,KAAK,OACH,OAAO,IAAI,QAAQ,IAAI,KAAK,MAAM,OAAO,UAAU,KAAK,IAC1D,CACD,IACC;AAAA,EAEH,MAAM,kBACL,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,OAC3D,KAAK,IAAI,GAAG,OAAO,kBAAkB,OAAO,eAAe,IAC3D;AAAA,EACJ,MAAM,YACL,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,OAC3D,KAAK,IAAI,GAAG,OAAO,kBAAkB,OAAO,eAAe,IAC3D;AAAA,EAEJ,MAAM,OAAO;AAAA,IACZ,gBACC;AAAA,IACD,SAAS,OAAO;AAAA,IAChB,cAAc,OAAO,IAAI,YAAY;AAAA,IACrC,SAAS;AAAA,MACR,iBAAiB,OAAO;AAAA,MACxB,mBAAmB,OAAO;AAAA,MAC1B,aAAa,OAAO;AAAA,MACpB,gBAAgB,OAAO;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,MACP,YAAY,OAAO;AAAA,MACnB,kBAAkB,OAAO;AAAA,MACzB,cAAc,OAAO,eAAe;AAAA,IACrC;AAAA,IACA,KAAK;AAAA,MACJ,yBAAyB;AAAA,MACzB,mBAAmB;AAAA,MACnB,yBAAyB;AAAA,IAC1B;AAAA,IACA,OAAO,OAAO,QACX,EAAE,UAAU,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,UAAU,IACtE;AAAA,EACJ;AAAA,EAGA,IAAI,OAAO,SAAS,CAAC,OAAO,MAAM,UAAU;AAAA,IAC3C,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,uCAAuC,OAAO,MAAM;AAAA,IAC7D;AAAA,EACD;AAAA,EAEA,IAAI,CAAC,OAAO,kBAAkB,OAAO,oBAAoB,MAAM;AAAA,IAC9D,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,IACT;AAAA,EACD;AAAA,EAIA,IAAI,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,MAAM;AAAA,IACvE,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QACC;AAAA,IACF;AAAA,EACD;AAAA,EAEA,IAAI,0BAA0B,QAAQ,wBAAwB,QAAQ;AAAA,IACrE,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,sBAAsB,UAAU,qBAAqB,qBAAqB,UAAU,MAAM;AAAA,IACnG;AAAA,EACD;AAAA,EAEA,IAAI,oBAAoB,QAAQ,kBAAkB,WAAW;AAAA,IAC5D,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,GAAG,kEAAkE;AAAA,IAC9E;AAAA,EACD;AAAA,EAIA,IAAI,cAAc,QAAQ,YAAY,GAAG;AAAA,IACxC,MAAM,UAAU,mBAAmB,4BAA4B,OAAO,GAAG,CAAC;AAAA,IAC1E,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,GAAG,oHAAoH;AAAA,IAChI;AAAA,EACD;AAAA,EAEA,OAAO;AAAA,OACH;AAAA,IACH,OAAO;AAAA,IACP,QAAQ;AAAA,EACT;AAAA;AAIM,SAAS,YAAY,CAAC,OAA8B;AAAA,EAC1D,OAAO,UAAU,WAAW,UAAU;AAAA;",
-  "debugId": "C18B5116B1FC55FB64756E2164756E21",
+  "mappings": ";AAgCO,IAAM,gCAAgC;AA4E7C,IAAM,sCAAsC;AAe5C,IAAM,sCAAsC,IAAI,KAAK;AAGrD,IAAM,mBAAmB;AACzB,IAAM,uBAAuB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;AAOpC,SAAS,2BAA2B,CAAC,KAAiB;AAAA,EAC5D,SAAS,IAAI,EAAG,KAAK,GAAG,KAAK;AAAA,IAC5B,MAAM,YAAY,IAAI,KACrB,KAAK,IACJ,IAAI,eAAe,GACnB,IAAI,YAAY,GAChB,IAAI,WAAW,IAAI,GACnB,kBACA,GACA,GACA,CACD,CACD;AAAA,IACA,IAAI,qBAAqB,IAAI,UAAU,UAAU,CAAC,KAAK,YAAY,KAAK;AAAA,MACvE,OAAO;AAAA,IACR;AAAA,EACD;AAAA,EACA,MAAM,IAAI,MAAM,gDAAgD;AAAA;AAGjE,SAAS,kBAAkB,CAAC,MAAoC;AAAA,EAC/D,OAAO,KAAK,UAAU,MAAM,IAAI,WAAW;AAAA;AAO5C,SAAS,SAAS,CAAC,SAAyB;AAAA,EAC3C,MAAM,QAAQ,UAAU;AAAA,EACxB,IAAI,QAAQ;AAAA,IAAI,OAAO,GAAG,KAAK,MAAM,KAAK;AAAA,EAC1C,MAAM,OAAO,QAAQ;AAAA,EAGrB,MAAM,UAAU,KAAK,MAAM,OAAO,EAAE,IAAI;AAAA,EACxC,OAAO,GAAG,OAAO,UAAU,OAAO,IAAI,UAAU,QAAQ,QAAQ,CAAC;AAAA;AAU3D,SAAS,mBAAmB,CAAC,QAAqC;AAAA,EACxE,MAAM,YACL,OAAO,4BAA4B;AAAA,EACpC,MAAM,SACL,OAAO,4BAA4B;AAAA,EAEpC,MAAM,wBAAwB,OAAO,aAClC,KAAK,IACL,GACA,KAAK,OACH,OAAO,IAAI,QAAQ,IAAI,KAAK,MAAM,OAAO,UAAU,KAAK,IAC1D,CACD,IACC;AAAA,EAEH,MAAM,kBACL,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,OAC3D,KAAK,IAAI,GAAG,OAAO,kBAAkB,OAAO,eAAe,IAC3D;AAAA,EACJ,MAAM,YACL,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,OAC3D,KAAK,IAAI,GAAG,OAAO,kBAAkB,OAAO,eAAe,IAC3D;AAAA,EAEJ,MAAM,OAAO;AAAA,IACZ,gBACC;AAAA,IACD,SAAS,OAAO;AAAA,IAChB,cAAc,OAAO,IAAI,YAAY;AAAA,IACrC,SAAS;AAAA,MACR,iBAAiB,OAAO;AAAA,MACxB,mBAAmB,OAAO;AAAA,MAC1B,aAAa,OAAO;AAAA,MACpB,gBAAgB,OAAO;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,MACP,YAAY,OAAO;AAAA,MACnB,kBAAkB,OAAO;AAAA,MACzB,cAAc,OAAO,eAAe;AAAA,IACrC;AAAA,IACA,KAAK;AAAA,MACJ,yBAAyB;AAAA,MACzB,mBAAmB;AAAA,MACnB,yBAAyB;AAAA,IAC1B;AAAA,IACA,OAAO,OAAO,QACX,EAAE,UAAU,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,UAAU,IACtE;AAAA,EACJ;AAAA,EAGA,IAAI,OAAO,SAAS,CAAC,OAAO,MAAM,UAAU;AAAA,IAC3C,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,uCAAuC,OAAO,MAAM;AAAA,IAC7D;AAAA,EACD;AAAA,EAEA,IAAI,CAAC,OAAO,kBAAkB,OAAO,oBAAoB,MAAM;AAAA,IAC9D,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,IACT;AAAA,EACD;AAAA,EAIA,IAAI,OAAO,oBAAoB,QAAQ,OAAO,oBAAoB,MAAM;AAAA,IACvE,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QACC;AAAA,IACF;AAAA,EACD;AAAA,EAEA,IAAI,0BAA0B,QAAQ,wBAAwB,QAAQ;AAAA,IACrE,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,sBAAsB,UAAU,qBAAqB,qBAAqB,UAAU,MAAM;AAAA,IACnG;AAAA,EACD;AAAA,EAEA,IAAI,oBAAoB,QAAQ,kBAAkB,WAAW;AAAA,IAC5D,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,GAAG,kEAAkE;AAAA,IAC9E;AAAA,EACD;AAAA,EAIA,IAAI,cAAc,QAAQ,YAAY,GAAG;AAAA,IACxC,MAAM,UAAU,mBAAmB,4BAA4B,OAAO,GAAG,CAAC;AAAA,IAC1E,OAAO;AAAA,SACH;AAAA,MACH,OAAO;AAAA,MACP,QAAQ,GAAG,oHAAoH;AAAA,IAChI;AAAA,EACD;AAAA,EAEA,OAAO;AAAA,OACH;AAAA,IACH,OAAO;AAAA,IACP,QAAQ;AAAA,EACT;AAAA;AAIM,SAAS,YAAY,CAAC,OAA8B;AAAA,EAC1D,OAAO,UAAU,WAAW,UAAU;AAAA;",
+  "debugId": "779DB5C9B354565F64756E2164756E21",
   "names": []
 }

package/dist/src/coverage/index.d.ts

@@ -470,7 +470,6 @@ interface SubgraphsTable {
 	handler_code: string | null;
 	source_code: string | null;
 	project_id: string | null;
-	visibility: Generated<string>;
 	/** Paid (wallet-ghost) deploys expire unless renewed or claimed; NULL = no expiry. */
 	expires_at: Date | null;
 	/** (event type, contract) probe pairs persisted at deploy for weight classification. */
@@ -1496,4 +1495,4 @@ declare function reportVerify(opts: {
 	diverged?: boolean
 	detail?: string
 }): VerifyReport;
-export { versionsEqual, topoSort, sparseDigests, sequentialDigests, segmentsSurviveReorg, segmentsOverlap, sealFinalizedRange, runSubgraphCommitSteps, runDecoderCommitSteps, reportVerify, receiptsAfterReorg, receiptRetentionHolds, rangeIsOrdered, rangeDigestOf, queueCaughtUp, proofsAgree, planRepair, planDecoderReceipts, parseVerifyTarget, mergeRanges, manifestsEqual, lookupTransition, isStageKind, isRunStatus, isRetryState, isRepairMode, isNonNegativeInt, isNativeClock, isFailureUnit, isFailureClass, inputDigest, hashEffectManifest, findRangeGaps, finalRowDigest, failureRetentionHolds, failureRangeHolds, expectedAckHeight, evaluateCoverage, emptyQueueState, defaultRetainUntil, deepVerify, datasetMatchesTarget, cursorIsBeforeBlock, cursorIsAfterBlock, cursorHeight, createRunnerState, contiguousThrough, commitSubgraphAdapter, commitDecoderAdapter, canonicalizeMutations, applyRunnerEvent, applyQueueEvent, applyMutations, applyDecoderReceipts, VerifyTarget, VerifyReport, VerifyMode, VerifyExit, VERIFY_EXIT, TransitionRule, SyncScope, SubgraphCommitStep, SubgraphCommitInput, SubgraphAdapterCrash, StageRunView, StageKind, StageEvidence, StageDeclaration, StageCoverage, SourceClock, SealedSegment, SealableReceipt, SealResult, SUBGRAPH_COMMIT_STEPS, STAGE_KINDS, SAFE_REPAIR_MODES, RunnerVersion, RunnerStatus, RunnerState, RunnerResult, RunnerFailure, RunnerEventType, RunnerEvent, RunnerEffect, RunStatus, RowSnapshot, RetryState, RepairPlan, RepairMode, RepairDefect, ReceiptRow, RUN_STATUSES, RUNNER_TRANSITION_TABLE, RUNNER_STATUSES, RUNNER_EVENT_TYPES, RETRY_STATES, REPAIR_MODES, QueueState, QueueStage, QueueEvent, QueueCounters, QueueApply, QUEUE_STAGES, OpenFailure, NativeClock, NATIVE_CLOCKS, FailureUnit, FailureRow, FailureClass, FAILURE_UNITS, FAILURE_RETENTION_DAYS, FAILURE_CLASSES, EvaluatorOptions, EvaluatorInput, EffectOp, EffectMutation, DeepVerifyResult, DecoderCommitStep, DecoderClockResult, DecoderClockReceipt, DecoderClockInput, DecoderClockEvent, DecoderAdapterReceipt, DecoderAdapterFailure, DecoderAdapterCrash, DecoderAdapterCommit, DEFAULT_MAX_RETRIES, DECODER_COMMIT_STEPS, CoverageState, CoverageReport, CoverageRange, CanonicalBlock, COVERAGE_STATES, COVERAGE_REPORT_SCHEMA_VERSION, BootstrapSource };
+export { BootstrapSource, COVERAGE_REPORT_SCHEMA_VERSION, COVERAGE_STATES, CanonicalBlock, CoverageRange, CoverageReport, CoverageState, DECODER_COMMIT_STEPS, DEFAULT_MAX_RETRIES, DecoderAdapterCommit, DecoderAdapterCrash, DecoderAdapterFailure, DecoderAdapterReceipt, DecoderClockEvent, DecoderClockInput, DecoderClockReceipt, DecoderClockResult, DecoderCommitStep, DeepVerifyResult, EffectMutation, EffectOp, EvaluatorInput, EvaluatorOptions, FAILURE_CLASSES, FAILURE_RETENTION_DAYS, FAILURE_UNITS, FailureClass, FailureRow, FailureUnit, NATIVE_CLOCKS, NativeClock, OpenFailure, QUEUE_STAGES, QueueApply, QueueCounters, QueueEvent, QueueStage, QueueState, REPAIR_MODES, RETRY_STATES, RUNNER_EVENT_TYPES, RUNNER_STATUSES, RUNNER_TRANSITION_TABLE, RUN_STATUSES, ReceiptRow, RepairDefect, RepairMode, RepairPlan, RetryState, RowSnapshot, RunStatus, RunnerEffect, RunnerEvent, RunnerEventType, RunnerFailure, RunnerResult, RunnerState, RunnerStatus, RunnerVersion, SAFE_REPAIR_MODES, STAGE_KINDS, SUBGRAPH_COMMIT_STEPS, SealResult, SealableReceipt, SealedSegment, SourceClock, StageCoverage, StageDeclaration, StageEvidence, StageKind, StageRunView, SubgraphAdapterCrash, SubgraphCommitInput, SubgraphCommitStep, SyncScope, TransitionRule, VERIFY_EXIT, VerifyExit, VerifyMode, VerifyReport, VerifyTarget, applyDecoderReceipts, applyMutations, applyQueueEvent, applyRunnerEvent, canonicalizeMutations, commitDecoderAdapter, commitSubgraphAdapter, contiguousThrough, createRunnerState, cursorHeight, cursorIsAfterBlock, cursorIsBeforeBlock, datasetMatchesTarget, deepVerify, defaultRetainUntil, emptyQueueState, evaluateCoverage, expectedAckHeight, failureRangeHolds, failureRetentionHolds, finalRowDigest, findRangeGaps, hashEffectManifest, inputDigest, isFailureClass, isFailureUnit, isNativeClock, isNonNegativeInt, isRepairMode, isRetryState, isRunStatus, isStageKind, lookupTransition, manifestsEqual, mergeRanges, parseVerifyTarget, planDecoderReceipts, planRepair, proofsAgree, queueCaughtUp, rangeDigestOf, rangeIsOrdered, receiptRetentionHolds, receiptsAfterReorg, reportVerify, runDecoderCommitSteps, runSubgraphCommitSteps, sealFinalizedRange, segmentsOverlap, segmentsSurviveReorg, sequentialDigests, sparseDigests, topoSort, versionsEqual };

package/dist/src/coverage/index.js

@@ -1,19 +1,3 @@
-import { createRequire } from "node:module";
-var __defProp = Object.defineProperty;
-var __returnValue = (v) => v;
-function __exportSetter(name, newValue) {
-  this[name] = __returnValue.bind(null, newValue);
-}
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, {
-      get: all[name],
-      enumerable: true,
-      configurable: true,
-      set: __exportSetter.bind(all, name)
-    });
-};
-
 // src/coverage/constraints.ts
 var STAGE_KINDS = ["raw", "decode", "subgraph", "queue"];
 var NATIVE_CLOCKS = ["block", "cursor", "queue"];
@@ -347,13 +331,13 @@ function evaluateOne(stage, input, run, evidence, dep, missingDep, inCycle) {
     recorded_target: recordedTarget
   };
   const done = (state, detail, extra = {}) => {
-    const completeThrough2 = extra.complete_through ?? null;
-    const caughtUp = extra.caught_up ?? (state !== "disabled" && state !== "failed" && state !== "gap" && state !== "out_of_scope" && state !== "unverified_import" && state !== "unanchored" && state !== "source_unavailable" && completeThrough2 !== null && finalized !== null && completeThrough2 >= finalized && sourceFresh);
+    const completeThrough = extra.complete_through ?? null;
+    const caughtUp = extra.caught_up ?? (state !== "disabled" && state !== "failed" && state !== "gap" && state !== "out_of_scope" && state !== "unverified_import" && state !== "unanchored" && state !== "source_unavailable" && completeThrough !== null && finalized !== null && completeThrough >= finalized && sourceFresh);
     return {
       ...base,
       state,
       detail,
-      complete_through: completeThrough2,
+      complete_through: completeThrough,
       declared_range: extra.declared_range ?? null,
       gaps: extra.gaps ?? [],
       caught_up: caughtUp,
@@ -638,8 +622,8 @@ function rewind(state, forkPoint) {
 }
 function applyRetry(state, maxRetries) {
   if (state.retry_count >= maxRetries) {
-    const failure2 = state.open_failure ? { ...state.open_failure, retry_state: "halted" } : null;
-    return ok(clone(state, { status: "halted", open_failure: failure2 }));
+    const failure = state.open_failure ? { ...state.open_failure, retry_state: "halted" } : null;
+    return ok(clone(state, { status: "halted", open_failure: failure }));
   }
   const failure = state.open_failure ? { ...state.open_failure, retry_state: "retrying" } : null;
   return ok(clone(state, {
@@ -1392,82 +1376,82 @@ function reportVerify(opts) {
   };
 }
 export {
-  versionsEqual,
-  topoSort,
-  sparseDigests,
-  sequentialDigests,
-  segmentsSurviveReorg,
-  segmentsOverlap,
-  sealFinalizedRange,
-  runSubgraphCommitSteps,
-  runDecoderCommitSteps,
-  reportVerify,
-  receiptsAfterReorg,
-  receiptRetentionHolds,
-  rangeIsOrdered,
-  rangeDigestOf,
-  queueCaughtUp,
-  proofsAgree,
-  planRepair,
-  planDecoderReceipts,
-  parseVerifyTarget,
-  mergeRanges,
-  manifestsEqual,
-  lookupTransition,
-  isStageKind,
-  isRunStatus,
-  isRetryState,
-  isRepairMode,
-  isNonNegativeInt,
-  isNativeClock,
-  isFailureUnit,
-  isFailureClass,
-  inputDigest,
-  hashEffectManifest,
-  findRangeGaps,
-  finalRowDigest,
-  failureRetentionHolds,
-  failureRangeHolds,
-  expectedAckHeight,
-  evaluateCoverage,
-  emptyQueueState,
-  defaultRetainUntil,
-  deepVerify,
-  datasetMatchesTarget,
-  cursorIsBeforeBlock,
-  cursorIsAfterBlock,
-  cursorHeight,
-  createRunnerState,
-  contiguousThrough,
-  commitSubgraphAdapter,
-  commitDecoderAdapter,
-  canonicalizeMutations,
-  applyRunnerEvent,
-  applyQueueEvent,
-  applyMutations,
-  applyDecoderReceipts,
-  VERIFY_EXIT,
-  SubgraphAdapterCrash,
-  SUBGRAPH_COMMIT_STEPS,
-  STAGE_KINDS,
-  SAFE_REPAIR_MODES,
-  RUN_STATUSES,
-  RUNNER_TRANSITION_TABLE,
-  RUNNER_STATUSES,
-  RUNNER_EVENT_TYPES,
-  RETRY_STATES,
-  REPAIR_MODES,
-  QUEUE_STAGES,
-  NATIVE_CLOCKS,
-  FAILURE_UNITS,
-  FAILURE_RETENTION_DAYS,
-  FAILURE_CLASSES,
-  DecoderAdapterCrash,
-  DEFAULT_MAX_RETRIES,
-  DECODER_COMMIT_STEPS,
+  COVERAGE_REPORT_SCHEMA_VERSION,
   COVERAGE_STATES,
-  COVERAGE_REPORT_SCHEMA_VERSION
+  DECODER_COMMIT_STEPS,
+  DEFAULT_MAX_RETRIES,
+  DecoderAdapterCrash,
+  FAILURE_CLASSES,
+  FAILURE_RETENTION_DAYS,
+  FAILURE_UNITS,
+  NATIVE_CLOCKS,
+  QUEUE_STAGES,
+  REPAIR_MODES,
+  RETRY_STATES,
+  RUNNER_EVENT_TYPES,
+  RUNNER_STATUSES,
+  RUNNER_TRANSITION_TABLE,
+  RUN_STATUSES,
+  SAFE_REPAIR_MODES,
+  STAGE_KINDS,
+  SUBGRAPH_COMMIT_STEPS,
+  SubgraphAdapterCrash,
+  VERIFY_EXIT,
+  applyDecoderReceipts,
+  applyMutations,
+  applyQueueEvent,
+  applyRunnerEvent,
+  canonicalizeMutations,
+  commitDecoderAdapter,
+  commitSubgraphAdapter,
+  contiguousThrough,
+  createRunnerState,
+  cursorHeight,
+  cursorIsAfterBlock,
+  cursorIsBeforeBlock,
+  datasetMatchesTarget,
+  deepVerify,
+  defaultRetainUntil,
+  emptyQueueState,
+  evaluateCoverage,
+  expectedAckHeight,
+  failureRangeHolds,
+  failureRetentionHolds,
+  finalRowDigest,
+  findRangeGaps,
+  hashEffectManifest,
+  inputDigest,
+  isFailureClass,
+  isFailureUnit,
+  isNativeClock,
+  isNonNegativeInt,
+  isRepairMode,
+  isRetryState,
+  isRunStatus,
+  isStageKind,
+  lookupTransition,
+  manifestsEqual,
+  mergeRanges,
+  parseVerifyTarget,
+  planDecoderReceipts,
+  planRepair,
+  proofsAgree,
+  queueCaughtUp,
+  rangeDigestOf,
+  rangeIsOrdered,
+  receiptRetentionHolds,
+  receiptsAfterReorg,
+  reportVerify,
+  runDecoderCommitSteps,
+  runSubgraphCommitSteps,
+  sealFinalizedRange,
+  segmentsOverlap,
+  segmentsSurviveReorg,
+  sequentialDigests,
+  sparseDigests,
+  topoSort,
+  versionsEqual
 };
 
-//# debugId=B315F53B23D43AA664756E2164756E21
+//# debugId=EA2A528F4821830864756E2164756E21
 //# sourceMappingURL=index.js.map