@optimystic/db-core 0.14.0 → 0.16.2

package/dist/src/transaction/operations-hash.js

@@ -0,0 +1,180 @@
+import { hashString } from '../utility/hash-string.js';
+/**
+ * Rank of each operation type, used ONLY as the final tiebreaker when the same
+ * (collectionId, blockId) legitimately carries more than one operation — a block
+ * staged, then mutated, then deleted within one transform (Transforms apply order
+ * is insert → update → delete; see transform/struct.ts). This is the semantic
+ * apply order. The exact ranking is arbitrary for correctness (both sides use it),
+ * but it MUST be defined in exactly one place — here.
+ */
+const TYPE_RANK = {
+    insert: 0,
+    update: 1,
+    delete: 2,
+};
+/**
+ * Collect every block operation across all collections into a flat list.
+ *
+ * The returned order reflects Map/object insertion order and is therefore NOT
+ * canonical — {@link hashOperations} sorts before hashing, so callers do not need
+ * to pre-sort. Shared by the coordinator (both commit() and execute()) and the
+ * validator so all three collect sites produce the identical logical set.
+ */
+export function collectOperations(transforms) {
+    const operations = [];
+    for (const [collectionId, t] of transforms) {
+        for (const [blockId, block] of Object.entries(t.inserts ?? {})) {
+            operations.push({ type: 'insert', collectionId, blockId, block });
+        }
+        for (const [blockId, ops] of Object.entries(t.updates ?? {})) {
+            operations.push({ type: 'update', collectionId, blockId, operations: ops });
+        }
+        for (const blockId of t.deletes ?? []) {
+            operations.push({ type: 'delete', collectionId, blockId });
+        }
+    }
+    return operations;
+}
+/**
+ * Total order over operations by the tuple (collectionId, blockId, type), using
+ * plain string comparison on the first two components and {@link TYPE_RANK} on the
+ * third. This is the cross-node ordering contract: two honest nodes that see the
+ * same logical set MUST produce the same sorted sequence regardless of the order
+ * they happened to collect operations in.
+ */
+function compareOperations(a, b) {
+    if (a.collectionId !== b.collectionId)
+        return a.collectionId < b.collectionId ? -1 : 1;
+    if (a.blockId !== b.blockId)
+        return a.blockId < b.blockId ? -1 : 1;
+    return TYPE_RANK[a.type] - TYPE_RANK[b.type];
+}
+/**
+ * Canonical JSON encoder: recursively sorts object keys but PRESERVES array element
+ * order, and matches JSON.stringify leaf semantics.
+ *
+ * - Object keys are emitted in ascending (sorted) order, so two objects with the
+ *   same content but different key-insertion order encode identically.
+ * - Array element order is preserved because BlockOperations is an ordered list of
+ *   [entity, index, deleteCount, inserted] tuples whose order is semantically
+ *   meaningful (as are any data arrays nested inside an IBlock).
+ * - Leaf semantics mirror JSON.stringify: `undefined`/function/symbol object-values
+ *   are dropped, the same in arrays encode as `null`, `null` encodes as `null`,
+ *   non-finite numbers as `null`, and other primitives via JSON.stringify.
+ *
+ * Exported so the order-independence test can exercise it directly.
+ *
+ * NOTE: no toJSON/Date special-casing — a value carrying toJSON (e.g. a Date)
+ * encodes as its plain enumerable keys ({} for a Date), not JSON.stringify's
+ * toJSON string. Harmless today (blocks hold plain JSON) and still deterministic
+ * across nodes (both sides run this same encoder); if IBlock content ever grows
+ * toJSON-bearing values and matching JSON.stringify exactly matters, add the hook.
+ */
+export function canonicalStringify(value) {
+    if (value === null)
+        return 'null';
+    const type = typeof value;
+    if (type === 'number')
+        return Number.isFinite(value) ? JSON.stringify(value) : 'null';
+    if (type === 'string' || type === 'boolean')
+        return JSON.stringify(value);
+    if (type === 'bigint')
+        throw new TypeError('Do not know how to serialize a BigInt');
+    if (type === 'undefined' || type === 'function' || type === 'symbol')
+        return 'null';
+    if (Array.isArray(value)) {
+        const items = value.map(element => {
+            const et = typeof element;
+            // In arrays, undefined/function/symbol serialize as null (JSON.stringify semantics).
+            if (element === undefined || et === 'function' || et === 'symbol')
+                return 'null';
+            return canonicalStringify(element);
+        });
+        return `[${items.join(',')}]`;
+    }
+    // Plain object: sort keys ascending, drop undefined/function/symbol values.
+    const obj = value;
+    const parts = [];
+    for (const key of Object.keys(obj).sort()) {
+        const v = obj[key];
+        const vt = typeof v;
+        if (v === undefined || vt === 'function' || vt === 'symbol')
+            continue;
+        parts.push(`${JSON.stringify(key)}:${canonicalStringify(v)}`);
+    }
+    return `{${parts.join(',')}}`;
+}
+/**
+ * Current operations-hash FORMAT VERSION. Versions the *serialization* of operations
+ * into bytes (the sort key, {@link canonicalStringify} rules, and the SHA-256/base64url
+ * step) — distinct from `engineId` in the TransactionStamp, which versions the operation
+ * *content* an engine produces from the same statements. Two honest nodes must agree on
+ * BOTH dimensions to produce the same ops-hash.
+ *
+ * Bump this whenever a change to the canonical serialization alters the emitted bytes,
+ * so a peer running the old format is *detected* (a legible version-skew error) rather
+ * than mistaken for a content disagreement or a Byzantine lie. See docs/transactions.md
+ * ("Operations Hash — Canonical Serialization").
+ */
+export const OPS_HASH_VERSION = 'v1';
+/**
+ * Wire-token prefix carrying {@link OPS_HASH_VERSION}: `ops.v1:`. The `.` delimiter is
+ * outside the base64url alphabet (A–Z a–z 0–9 `-` `_`) that follows the trailing `:`, so
+ * the version segment can always be sliced back out unambiguously — see {@link opsHashVersion}.
+ */
+export const OPS_HASH_PREFIX = `ops.${OPS_HASH_VERSION}:`;
+/**
+ * Extract the format-version segment from an ops-hash token — the `v1` in `ops.v1:<hash>` —
+ * or `null` if the string is not a recognizable versioned ops-hash token.
+ *
+ * Total: never throws. A bare legacy `ops:<hash>` token (no `.` delimiter), an empty
+ * string, or any garbage all return `null`. A validator treats a `null` (or a version it
+ * does not recognize) as an unsupported/foreign format — a legible version-skew error —
+ * never as an accidental content match.
+ */
+export function opsHashVersion(token) {
+    if (typeof token !== 'string')
+        return null;
+    if (!token.startsWith('ops.'))
+        return null;
+    const colon = token.indexOf(':', 4);
+    if (colon <= 4)
+        return null; // no version characters between "ops." and ":"
+    return token.slice(4, colon);
+}
+/**
+ * The EXACT canonical byte-string {@link hashOperations} feeds into SHA-256: the operations
+ * sorted by {@link compareOperations} and run through {@link canonicalStringify}. The version
+ * token is NOT part of this preimage — it wraps the resulting hash, it is not hashed.
+ *
+ * Exposed so a future client signature (design-client-transaction-signatures) can bind the
+ * IDENTICAL bytes the validators hash, rather than re-deriving the serialization and risking
+ * drift. Pair it with {@link OPS_HASH_VERSION} to record which format the bytes belong to.
+ */
+export function canonicalOperationsPayload(operations) {
+    return canonicalStringify([...operations].sort(compareOperations));
+}
+/**
+ * Compute the transaction operations hash: sort into canonical order, canonically
+ * stringify, SHA-256 (base64url) via {@link hashString}, then prefix the versioned
+ * {@link OPS_HASH_PREFIX} token (`ops.v1:`) so the wire string is self-describing.
+ *
+ * This is the fingerprint the coordinator sends in PendRequest.operationsHash and
+ * the validator recomputes; equality of this string is the cross-node agreement
+ * that a transaction's operations match.
+ *
+ * NOTE: the ops-hash carries a format-version token, so a mixed-version cluster now
+ * *detects* skew — a validator seeing a foreign/legacy version emits a distinct
+ * "unsupported operations-hash format version" error instead of the ambiguous
+ * "Operations hash mismatch" (see TransactionValidator). What it does NOT do is
+ * *cross-compute* older formats: a node only recognizes that a peer speaks a different
+ * version, it cannot reproduce that peer's historical bytes. Mixed-version clusters
+ * therefore fail LEGIBLY, not interoperably; multi-version compatibility is future
+ * work if rolling upgrades ship. The ops-hash is recomputed fresh on both sides and
+ * never persisted, so bumping the version cannot retroactively invalidate committed
+ * transactions (unlike transaction.id, which IS persisted — leave it untouched).
+ */
+export async function hashOperations(operations) {
+    return `${OPS_HASH_PREFIX}${await hashString(canonicalOperationsPayload(operations))}`;
+}
+//# sourceMappingURL=operations-hash.js.map

package/dist/src/transaction/operations-hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"operations-hash.js","sourceRoot":"","sources":["../../../src/transaction/operations-hash.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAgBvD;;;;;;;GAOG;AACH,MAAM,SAAS,GAAsC;IACpD,MAAM,EAAE,CAAC;IACT,MAAM,EAAE,CAAC;IACT,MAAM,EAAE,CAAC;CACT,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAyC;IAC1E,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YAChE,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;YAC9D,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7E,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;QAC5D,CAAC;IACF,CAAC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,CAAY,EAAE,CAAY;IACpD,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,YAAY;QAAE,OAAO,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAChD,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAElC,MAAM,IAAI,GAAG,OAAO,KAAK,CAAC;IAC1B,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtF,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC1E,IAAI,IAAI,KAAK,QAAQ;QAAE,MAAM,IAAI,SAAS,CAAC,uCAAuC,CAAC,CAAC;IACpF,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC;IAEpF,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;YACjC,MAAM,EAAE,GAAG,OAAO,OAAO,CAAC;YAC1B,qFAAqF;YACrF,IAAI,OAAO,KAAK,SAAS,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC;YACjF,OAAO,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC/B,CAAC;IAED,4EAA4E;IAC5E,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,QAAQ;YAAE,SAAS;QACtE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAErC;;;;GAIG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,OAAO,gBAAgB,GAAG,CAAC;AAE1D;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC3C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,+CAA+C;IAC5E,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAgC;IAC1E,OAAO,kBAAkB,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;AACpE,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,UAAgC;IACpE,OAAO,GAAG,eAAe,GAAG,MAAM,UAAU,CAAC,0BAA0B,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;AACxF,CAAC"}

package/dist/src/transaction/read-dependency-collector.d.ts

@@ -0,0 +1,43 @@
+import type { BlockId, ReadPurpose } from "../blocks/index.js";
+import type { ReadDependency } from "./transaction.js";
+/** Accumulates the read dependencies of one transaction. Keyed by block id. For each id it keeps:
+ *
+ *  - the HIGHEST revision observed (never downgrades — a re-read from cache must not overwrite a
+ *    higher revision seen earlier), and
+ *  - the read's PURPOSE with value-wins semantics: once a block is recorded as a `value` read from
+ *    ANY path it stays `value`; `navigation` sticks only for a block that was never read as a value.
+ *    This is the exact analogue of the max-wins rule on revision, and it makes the classification
+ *    order-independent (so it is deterministic regardless of cache/timing — required for the
+ *    transaction id and client signature to match across a re-executing validator; Theorem 4).
+ *
+ *  {@link getReadDependencies} returns only the CONFLICT set (value reads); purely-structural
+ *  `navigation` reads — interior B-tree branches walked through to reach a captured leaf — are
+ *  dropped. See {@link markValue} and docs/correctness.md Theorem 5.
+ *
+ *  One instance is shared by a collection's {@link TransactorSource} (direct structural reads —
+ *  bootstrap, header) and its {@link CacheSource} (every cache hit/miss), so a block read from
+ *  either layer produces a dependency. Because both feed the same collector, a cache miss records
+ *  the id once from each layer at the same revision/purpose; the merge collapses those to one
+ *  entry. Cleared at each txn boundary. */
+export declare class ReadDependencyCollector {
+    private reads;
+    /** Record a read of `blockId` at `revision`. `purpose` defaults to `value` (retained); pass
+     *  `navigation` for an interior structural read that a later {@link markValue} may or may not
+     *  upgrade. Revision is max-wins; purpose is value-wins (see class doc). */
+    record(blockId: BlockId, revision: number, purpose?: ReadPurpose): void;
+    /** Upgrade an already-recorded read to `value` (keeping its revision), retaining it in the
+     *  conflict set. The B-tree point-lookup path uses this to mark the terminal leaf — the
+     *  load-bearing read whose content the result depends on — after its interior descent nodes
+     *  were recorded as `navigation`. No-op if the id was never recorded (e.g. a leaf served from
+     *  an uncommitted staged insert, which records no dependency at all). */
+    markValue(blockId: BlockId): void;
+    /** The optimistic-concurrency conflict (read) set: every `value` read, with `navigation`
+     *  reads excluded. Dropping a covered navigation read cannot admit a lost update — any
+     *  concurrent change to the queried result also bumps a retained value read (the target
+     *  leaf) — but it removes the false-positive stale rejections that structural block reads
+     *  otherwise caused (Theorem 5 Bound). Deterministic in query shape, so a coordinator and a
+     *  re-executing validator derive the identical set. */
+    getReadDependencies(): ReadDependency[];
+    clear(): void;
+}
+//# sourceMappingURL=read-dependency-collector.d.ts.map

package/dist/src/transaction/read-dependency-collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"read-dependency-collector.d.ts","sourceRoot":"","sources":["../../../src/transaction/read-dependency-collector.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAC/D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAKvD;;;;;;;;;;;;;;;;;;2CAkB2C;AAC3C,qBAAa,uBAAuB;IACnC,OAAO,CAAC,KAAK,CAAiC;IAE9C;;gFAE4E;IAC5E,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,GAAE,WAAqB,GAAG,IAAI;IAehF;;;;6EAIyE;IACzE,SAAS,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI;IAOjC;;;;;2DAKuD;IACvD,mBAAmB,IAAI,cAAc,EAAE;IAUvC,KAAK,IAAI,IAAI;CAGb"}

package/dist/src/transaction/read-dependency-collector.js

@@ -0,0 +1,69 @@
+/** Accumulates the read dependencies of one transaction. Keyed by block id. For each id it keeps:
+ *
+ *  - the HIGHEST revision observed (never downgrades — a re-read from cache must not overwrite a
+ *    higher revision seen earlier), and
+ *  - the read's PURPOSE with value-wins semantics: once a block is recorded as a `value` read from
+ *    ANY path it stays `value`; `navigation` sticks only for a block that was never read as a value.
+ *    This is the exact analogue of the max-wins rule on revision, and it makes the classification
+ *    order-independent (so it is deterministic regardless of cache/timing — required for the
+ *    transaction id and client signature to match across a re-executing validator; Theorem 4).
+ *
+ *  {@link getReadDependencies} returns only the CONFLICT set (value reads); purely-structural
+ *  `navigation` reads — interior B-tree branches walked through to reach a captured leaf — are
+ *  dropped. See {@link markValue} and docs/correctness.md Theorem 5.
+ *
+ *  One instance is shared by a collection's {@link TransactorSource} (direct structural reads —
+ *  bootstrap, header) and its {@link CacheSource} (every cache hit/miss), so a block read from
+ *  either layer produces a dependency. Because both feed the same collector, a cache miss records
+ *  the id once from each layer at the same revision/purpose; the merge collapses those to one
+ *  entry. Cleared at each txn boundary. */
+export class ReadDependencyCollector {
+    reads = new Map();
+    /** Record a read of `blockId` at `revision`. `purpose` defaults to `value` (retained); pass
+     *  `navigation` for an interior structural read that a later {@link markValue} may or may not
+     *  upgrade. Revision is max-wins; purpose is value-wins (see class doc). */
+    record(blockId, revision, purpose = 'value') {
+        const prev = this.reads.get(blockId);
+        if (prev === undefined) {
+            this.reads.set(blockId, { revision, purpose });
+            return;
+        }
+        if (revision > prev.revision) {
+            prev.revision = revision;
+        }
+        // value-wins: a value read anywhere pins the block as value; navigation never downgrades it.
+        if (purpose === 'value') {
+            prev.purpose = 'value';
+        }
+    }
+    /** Upgrade an already-recorded read to `value` (keeping its revision), retaining it in the
+     *  conflict set. The B-tree point-lookup path uses this to mark the terminal leaf — the
+     *  load-bearing read whose content the result depends on — after its interior descent nodes
+     *  were recorded as `navigation`. No-op if the id was never recorded (e.g. a leaf served from
+     *  an uncommitted staged insert, which records no dependency at all). */
+    markValue(blockId) {
+        const prev = this.reads.get(blockId);
+        if (prev) {
+            prev.purpose = 'value';
+        }
+    }
+    /** The optimistic-concurrency conflict (read) set: every `value` read, with `navigation`
+     *  reads excluded. Dropping a covered navigation read cannot admit a lost update — any
+     *  concurrent change to the queried result also bumps a retained value read (the target
+     *  leaf) — but it removes the false-positive stale rejections that structural block reads
+     *  otherwise caused (Theorem 5 Bound). Deterministic in query shape, so a coordinator and a
+     *  re-executing validator derive the identical set. */
+    getReadDependencies() {
+        const result = [];
+        for (const [blockId, entry] of this.reads) {
+            if (entry.purpose === 'value') {
+                result.push({ blockId, revision: entry.revision });
+            }
+        }
+        return result;
+    }
+    clear() {
+        this.reads.clear();
+    }
+}
+//# sourceMappingURL=read-dependency-collector.js.map

package/dist/src/transaction/read-dependency-collector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"read-dependency-collector.js","sourceRoot":"","sources":["../../../src/transaction/read-dependency-collector.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;2CAkB2C;AAC3C,MAAM,OAAO,uBAAuB;IAC3B,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE9C;;gFAE4E;IAC5E,MAAM,CAAC,OAAgB,EAAE,QAAgB,EAAE,UAAuB,OAAO;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;YAC/C,OAAO;QACR,CAAC;QACD,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC1B,CAAC;QACD,6FAA6F;QAC7F,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACxB,CAAC;IACF,CAAC;IAED;;;;6EAIyE;IACzE,SAAS,CAAC,OAAgB;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACxB,CAAC;IACF,CAAC;IAED;;;;;2DAKuD;IACvD,mBAAmB;QAClB,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3C,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;CACD"}

package/dist/src/transaction/session.d.ts

@@ -1,5 +1,6 @@
 import type { TransactionCoordinator } from "./coordinator.js";
-import type { ExecutionResult, ITransactionEngine, TransactionStamp, CollectionActions } from "./transaction.js";
+import type { SyncOptions } from "../collection/index.js";
+import type { ExecutionResult, ITransactionEngine, TransactionStamp, CollectionActions, TransactionSigner } from "./transaction.js";
 /**
  * TransactionSession manages incremental transaction building.
  *
@@ -22,6 +23,7 @@ import type { ExecutionResult, ITransactionEngine, TransactionStamp, CollectionA
 export declare class TransactionSession {
     private readonly coordinator;
     private readonly engine;
+    private readonly signer?;
     private readonly statements;
     private readonly stamp;
     private committed;
@@ -30,8 +32,12 @@ export declare class TransactionSession {
     /**
      * Create a new TransactionSession.
      * Uses async factory because stamp creation requires SHA-256 hashing.
+     *
+     * @param signer - Optional client signer. When supplied, commit() stamps the built
+     *   transaction's `signature` over its canonical payload; when omitted the
+     *   transaction is left unsigned (accepted only by nodes with no verifier wired).
      */
-    static create(coordinator: TransactionCoordinator, engine: ITransactionEngine, peerId?: string, schemaHash?: string, ttlMs?: number): Promise<TransactionSession>;
+    static create(coordinator: TransactionCoordinator, engine: ITransactionEngine, peerId?: string, schemaHash?: string, ttlMs?: number, signer?: TransactionSigner): Promise<TransactionSession>;
     /**
      * Execute a statement.
      *
@@ -50,8 +56,11 @@ export declare class TransactionSession {
      * Commit the transaction.
      *
      * Compiles all statements into a complete Transaction and commits through coordinator.
+     *
+     * @param options - Optional retry knobs forwarded to {@link TransactionCoordinator.commit}
+     *   (bounded backoff+jitter retry of a clean stale loss). Defaults are safe out of the box.
      */
-    commit(): Promise<ExecutionResult>;
+    commit(options?: SyncOptions): Promise<ExecutionResult>;
     /**
      * Rollback the transaction (undo this session's applied actions).
      *

package/dist/src/transaction/session.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"session.d.ts","sourceRoot":"","sources":["../../../src/transaction/session.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,KAAK,EAAe,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAG9H;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,kBAAkB;IAO7B,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,MAAM;IAPxB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAgB;IAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAS;IAE3B,OAAO;IAQP;;;OAGG;WACU,MAAM,CAClB,WAAW,EAAE,sBAAsB,EACnC,MAAM,EAAE,kBAAkB,EAC1B,MAAM,GAAE,MAAgB,EACxB,UAAU,GAAE,MAAW,EACvB,KAAK,CAAC,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,CAAC;IAW9B;;;;;;;;;OASG;IACG,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IA2C9G;;;;OAIG;IACG,MAAM,IAAI,OAAO,CAAC,eAAe,CAAC;IAgCxC;;;;;;OAMG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAe/B;;OAEG;IACH,UAAU,IAAI,MAAM;IAIpB;;OAEG;IACH,QAAQ,IAAI,gBAAgB;IAI5B;;OAEG;IACH,aAAa,IAAI,SAAS,MAAM,EAAE;IAIlC;;OAEG;IACH,WAAW,IAAI,OAAO;IAItB;;OAEG;IACH,YAAY,IAAI,OAAO;CAGvB"}
+{"version":3,"file":"session.d.ts","sourceRoot":"","sources":["../../../src/transaction/session.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,KAAK,EAAe,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAGjJ;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,kBAAkB;IAO7B,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,MAAM;IAEvB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IATzB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAgB;IAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAS;IAE3B,OAAO;IASP;;;;;;;OAOG;WACU,MAAM,CAClB,WAAW,EAAE,sBAAsB,EACnC,MAAM,EAAE,kBAAkB,EAC1B,MAAM,GAAE,MAAgB,EACxB,UAAU,GAAE,MAAW,EACvB,KAAK,CAAC,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,iBAAiB,GACxB,OAAO,CAAC,kBAAkB,CAAC;IAW9B;;;;;;;;;OASG;IACG,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IA2C9G;;;;;;;OAOG;IACG,MAAM,CAAC,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,CAAC;IAkD7D;;;;;;OAMG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAe/B;;OAEG;IACH,UAAU,IAAI,MAAM;IAIpB;;OAEG;IACH,QAAQ,IAAI,gBAAgB;IAI5B;;OAEG;IACH,aAAa,IAAI,SAAS,MAAM,EAAE;IAIlC;;OAEG;IACH,WAAW,IAAI,OAAO;IAItB;;OAEG;IACH,YAAY,IAAI,OAAO;CAGvB"}

package/dist/src/transaction/session.js

@@ -1,4 +1,4 @@
-import { createTransactionStamp, createTransactionId, isTransactionExpired } from "./transaction.js";
+import { createTransactionStamp, createTransactionId, isTransactionExpired, clientSignaturePayload } from "./transaction.js";
 /**
  * TransactionSession manages incremental transaction building.
  *
@@ -21,23 +21,28 @@ import { createTransactionStamp, createTransactionId, isTransactionExpired } fro
 export class TransactionSession {
     coordinator;
     engine;
+    signer;
     statements = [];
     stamp;
     committed = false;
     rolledBack = false;
-    constructor(coordinator, engine, stamp) {
+    constructor(coordinator, engine, stamp, signer) {
         this.coordinator = coordinator;
         this.engine = engine;
+        this.signer = signer;
         this.stamp = stamp;
     }
     /**
      * Create a new TransactionSession.
      * Uses async factory because stamp creation requires SHA-256 hashing.
+     *
+     * @param signer - Optional client signer. When supplied, commit() stamps the built
+     *   transaction's `signature` over its canonical payload; when omitted the
+     *   transaction is left unsigned (accepted only by nodes with no verifier wired).
      */
-    static async create(coordinator, engine, peerId = 'local', schemaHash = '', ttlMs) {
-        const stamp = await createTransactionStamp(peerId, Date.now(), schemaHash, 'unknown', // TODO: Get engine ID from engine
-        ttlMs);
-        return new TransactionSession(coordinator, engine, stamp);
+    static async create(coordinator, engine, peerId = 'local', schemaHash = '', ttlMs, signer) {
+        const stamp = await createTransactionStamp(peerId, Date.now(), schemaHash, engine.id, ttlMs);
+        return new TransactionSession(coordinator, engine, stamp, signer);
     }
     /**
      * Execute a statement.
@@ -93,8 +98,11 @@ export class TransactionSession {
      * Commit the transaction.
      *
      * Compiles all statements into a complete Transaction and commits through coordinator.
+     *
+     * @param options - Optional retry knobs forwarded to {@link TransactionCoordinator.commit}
+     *   (bounded backoff+jitter retry of a clean stale loss). Defaults are safe out of the box.
      */
-    async commit() {
+    async commit(options) {
         if (this.committed) {
             return { success: false, error: 'Transaction already committed' };
         }
@@ -113,8 +121,26 @@ export class TransactionSession {
             reads,
             id: await createTransactionId(this.stamp.id, this.statements, reads)
         };
-        // Commit through coordinator (which will orchestrate PEND/COMMIT)
-        await this.coordinator.commit(transaction);
+        // Sign the canonical client-signature payload if a signer was supplied. The
+        // payload covers stamp.id + statements + reads, which are all final now. A signer failure
+        // (e.g. a wrong-key-type libp2p sign) is caught and surfaced as a clean commit failure BEFORE
+        // coordinator.commit runs — the transaction object is local and discarded, so a failed sign can
+        // never leak a partially-built unsigned transaction into consensus.
+        if (this.signer) {
+            const payload = clientSignaturePayload(this.stamp.id, this.statements, reads);
+            try {
+                transaction.signature = await this.signer(payload);
+            }
+            catch (error) {
+                return {
+                    success: false,
+                    error: `Failed to sign transaction: ${error instanceof Error ? error.message : String(error)}`
+                };
+            }
+        }
+        // Commit through coordinator (which will orchestrate PEND/COMMIT, with bounded
+        // backoff+jitter retry of a clean stale loss)
+        await this.coordinator.commit(transaction, options);
         // Clear read dependencies after successful commit
         this.coordinator.clearReadDependencies();
         this.committed = true;

package/dist/src/transaction/session.js.map

@@ -1 +1 @@
-{"version":3,"file":"session.js","sourceRoot":"","sources":["../../../src/transaction/session.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAErG;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,OAAO,kBAAkB;IAOZ;IACA;IAPD,UAAU,GAAa,EAAE,CAAC;IAC1B,KAAK,CAAmB;IACjC,SAAS,GAAG,KAAK,CAAC;IAClB,UAAU,GAAG,KAAK,CAAC;IAE3B,YACkB,WAAmC,EACnC,MAA0B,EAC3C,KAAuB;QAFN,gBAAW,GAAX,WAAW,CAAwB;QACnC,WAAM,GAAN,MAAM,CAAoB;QAG3C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAClB,WAAmC,EACnC,MAA0B,EAC1B,SAAiB,OAAO,EACxB,aAAqB,EAAE,EACvB,KAAc;QAEd,MAAM,KAAK,GAAG,MAAM,sBAAsB,CACzC,MAAM,EACN,IAAI,CAAC,GAAG,EAAE,EACV,UAAU,EACV,SAAS,EAAE,kCAAkC;QAC7C,KAAK,CACL,CAAC;QACF,OAAO,IAAI,kBAAkB,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,OAAO,CAAC,SAAiB,EAAE,OAA6B;QAC7D,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,+BAA+B,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC;QACrE,CAAC;QAED,IAAI,CAAC;YACJ,gEAAgE;YAChE,IAAI,cAAmC,CAAC;YACxC,IAAI,OAAO,EAAE,CAAC;gBACb,cAAc,GAAG,OAAO,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACP,0EAA0E;gBAC1E,MAAM,eAAe,GAAgB;oBACpC,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,UAAU,EAAE,CAAC,SAAS,CAAC;oBACvB,KAAK,EAAE,EAAE;oBACT,EAAE,EAAE,MAAM,CAAC,oCAAoC;iBAC/C,CAAC;gBACF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;gBAC1D,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;oBACxC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,+BAA+B,EAAE,CAAC;gBACnF,CAAC;gBACD,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC;YACjC,CAAC;YAED,oCAAoC;YACpC,MAAM,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAEnE,iDAAiD;YACjD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEhC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC1B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,OAAO;gBACN,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,gCAAgC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;aAC/F,CAAC;QACH,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM;QACX,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,+BAA+B,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC;QACrE,CAAC;QACD,IAAI,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACtC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,0BAA0B,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC;QACrF,CAAC;QAED,+DAA+D;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,EAAE,CAAC;QAErD,kCAAkC;QAClC,MAAM,WAAW,GAAgB;YAChC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,KAAK;YACL,EAAE,EAAE,MAAM,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC;SACpE,CAAC;QAEF,kEAAkE;QAClE,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE3C,kDAAkD;QAClD,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC;QAEzC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ;QACb,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACpD,CAAC;QAED,+BAA+B;QAC/B,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/C,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC;QACzC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,UAAU;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,QAAQ;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,YAAY;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;CACD"}
+{"version":3,"file":"session.js","sourceRoot":"","sources":["../../../src/transaction/session.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAE7H;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,OAAO,kBAAkB;IAOZ;IACA;IAEA;IATD,UAAU,GAAa,EAAE,CAAC;IAC1B,KAAK,CAAmB;IACjC,SAAS,GAAG,KAAK,CAAC;IAClB,UAAU,GAAG,KAAK,CAAC;IAE3B,YACkB,WAAmC,EACnC,MAA0B,EAC3C,KAAuB,EACN,MAA0B;QAH1B,gBAAW,GAAX,WAAW,CAAwB;QACnC,WAAM,GAAN,MAAM,CAAoB;QAE1B,WAAM,GAAN,MAAM,CAAoB;QAE3C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAClB,WAAmC,EACnC,MAA0B,EAC1B,SAAiB,OAAO,EACxB,aAAqB,EAAE,EACvB,KAAc,EACd,MAA0B;QAE1B,MAAM,KAAK,GAAG,MAAM,sBAAsB,CACzC,MAAM,EACN,IAAI,CAAC,GAAG,EAAE,EACV,UAAU,EACV,MAAM,CAAC,EAAE,EACT,KAAK,CACL,CAAC;QACF,OAAO,IAAI,kBAAkB,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACnE,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,OAAO,CAAC,SAAiB,EAAE,OAA6B;QAC7D,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,+BAA+B,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC;QACrE,CAAC;QAED,IAAI,CAAC;YACJ,gEAAgE;YAChE,IAAI,cAAmC,CAAC;YACxC,IAAI,OAAO,EAAE,CAAC;gBACb,cAAc,GAAG,OAAO,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACP,0EAA0E;gBAC1E,MAAM,eAAe,GAAgB;oBACpC,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,UAAU,EAAE,CAAC,SAAS,CAAC;oBACvB,KAAK,EAAE,EAAE;oBACT,EAAE,EAAE,MAAM,CAAC,oCAAoC;iBAC/C,CAAC;gBACF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;gBAC1D,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;oBACxC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,+BAA+B,EAAE,CAAC;gBACnF,CAAC;gBACD,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC;YACjC,CAAC;YAED,oCAAoC;YACpC,MAAM,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAEnE,iDAAiD;YACjD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEhC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC1B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,OAAO;gBACN,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,gCAAgC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;aAC/F,CAAC;QACH,CAAC;IACF,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CAAC,OAAqB;QACjC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,+BAA+B,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC;QACrE,CAAC;QACD,IAAI,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACtC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,0BAA0B,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC;QACrF,CAAC;QAED,+DAA+D;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,EAAE,CAAC;QAErD,kCAAkC;QAClC,MAAM,WAAW,GAAgB;YAChC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,KAAK;YACL,EAAE,EAAE,MAAM,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC;SACpE,CAAC;QAEF,4EAA4E;QAC5E,0FAA0F;QAC1F,8FAA8F;QAC9F,gGAAgG;QAChG,oEAAoE;QACpE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAC9E,IAAI,CAAC;gBACJ,WAAW,CAAC,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACpD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,OAAO;oBACN,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,+BAA+B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;iBAC9F,CAAC;YACH,CAAC;QACF,CAAC;QAED,+EAA+E;QAC/E,8CAA8C;QAC9C,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAEpD,kDAAkD;QAClD,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC;QAEzC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ;QACb,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACpD,CAAC;QAED,+BAA+B;QAC/B,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/C,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC;QACzC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,UAAU;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,QAAQ;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,YAAY;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;CACD"}