ox 0.14.28 → 1.0.0-beta.0

package/dist/core/BinaryStateTree.d.ts

@@ -0,0 +1,91 @@
+import * as Bytes from './Bytes.js';
+import type { OneOf } from './internal/types.js';
+/** Type that defines a Binary State Tree instance. */
+export type BinaryStateTree = {
+    root: Node;
+};
+/** Type defining a node of the BST. */
+export type Node = OneOf<EmptyNode | StemNode | InternalNode>;
+/**
+ * Creates a new Binary State Tree instance.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ * ```
+ *
+ * @returns A Binary State Tree.
+ */
+export declare function create(): BinaryStateTree;
+/**
+ * Inserts a key-value pair into the Binary State Tree.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree, Bytes } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ *
+ * BinaryStateTree.insert(
+ *   // [!code focus]
+ *   tree, // [!code focus]
+ *   Bytes.fromHex(
+ *     '0xe34f199b19b2b4f47f68442619d555527d244f78a3297ea89325f843f87b8b54'
+ *   ), // [!code focus]
+ *   Bytes.fromHex(
+ *     '0xd4fd4e189132273036449fc9e11198c739161b4c0116a9a2dccdfa1c492006f1'
+ *   ) // [!code focus]
+ * ) // [!code focus]
+ * ```
+ *
+ * @param tree - Binary State Tree instance.
+ * @param key - Key to insert.
+ * @param value - Value to insert.
+ */
+export declare function insert(tree: BinaryStateTree, key: Bytes.Bytes, value: Bytes.Bytes): void;
+/**
+ * Merkelizes a Binary State Tree.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree, Bytes } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ *
+ * BinaryStateTree.insert(
+ *   tree,
+ *   Bytes.fromHex(
+ *     '0xe34f199b19b2b4f47f68442619d555527d244f78a3297ea89325f843f87b8b54'
+ *   ),
+ *   Bytes.fromHex(
+ *     '0xd4fd4e189132273036449fc9e11198c739161b4c0116a9a2dccdfa1c492006f1'
+ *   )
+ * )
+ *
+ * const hash = BinaryStateTree.merkelize(tree) // [!code focus]
+ * ```
+ *
+ * @param tree - Binary State Tree instance.
+ * @returns Merkle hash.
+ */
+export declare function merkelize(tree: BinaryStateTree): Bytes.Bytes;
+/** @internal */
+type EmptyNode = {
+    type: 'empty';
+};
+/** @internal */
+type InternalNode = {
+    left: Node;
+    right: Node;
+    type: 'internal';
+};
+/** @internal */
+type StemNode = {
+    stem: Bytes.Bytes;
+    values: (Bytes.Bytes | undefined)[];
+    type: 'stem';
+};
+export {};
+//# sourceMappingURL=BinaryStateTree.d.ts.map

package/dist/core/BinaryStateTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryStateTree.d.ts","sourceRoot":"","sources":["../../src/core/BinaryStateTree.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAEhD,sDAAsD;AACtD,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AAED,uCAAuC;AACvC,MAAM,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,GAAG,QAAQ,GAAG,YAAY,CAAC,CAAA;AAE7D;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,IAAI,eAAe,CAIxC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,MAAM,CACpB,IAAI,EAAE,eAAe,EACrB,GAAG,EAAE,KAAK,CAAC,KAAK,EAChB,KAAK,EAAE,KAAK,CAAC,KAAK,GACjB,IAAI,CAgDN;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,eAAe,GAAG,KAAK,CAAC,KAAK,CAqB5D;AAMD,gBAAgB;AAChB,KAAK,SAAS,GAAG;IACf,IAAI,EAAE,OAAO,CAAA;CACd,CAAA;AAED,gBAAgB;AAChB,KAAK,YAAY,GAAG;IAClB,IAAI,EAAE,IAAI,CAAA;IACV,KAAK,EAAE,IAAI,CAAA;IACX,IAAI,EAAE,UAAU,CAAA;CACjB,CAAA;AAED,gBAAgB;AAChB,KAAK,QAAQ,GAAG;IACd,IAAI,EAAE,KAAK,CAAC,KAAK,CAAA;IACjB,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,EAAE,CAAA;IACnC,IAAI,EAAE,MAAM,CAAA;CACb,CAAA"}

package/dist/core/BinaryStateTree.js

@@ -0,0 +1,205 @@
+import { blake3 } from '@noble/hashes/blake3.js';
+import * as Bytes from './Bytes.js';
+/**
+ * Creates a new Binary State Tree instance.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ * ```
+ *
+ * @returns A Binary State Tree.
+ */
+export function create() {
+    return {
+        root: emptyNode(),
+    };
+}
+/**
+ * Inserts a key-value pair into the Binary State Tree.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree, Bytes } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ *
+ * BinaryStateTree.insert(
+ *   // [!code focus]
+ *   tree, // [!code focus]
+ *   Bytes.fromHex(
+ *     '0xe34f199b19b2b4f47f68442619d555527d244f78a3297ea89325f843f87b8b54'
+ *   ), // [!code focus]
+ *   Bytes.fromHex(
+ *     '0xd4fd4e189132273036449fc9e11198c739161b4c0116a9a2dccdfa1c492006f1'
+ *   ) // [!code focus]
+ * ) // [!code focus]
+ * ```
+ *
+ * @param tree - Binary State Tree instance.
+ * @param key - Key to insert.
+ * @param value - Value to insert.
+ */
+export function insert(tree, key, value) {
+    const stem = Bytes.slice(key, 0, 31);
+    const subIndex = Bytes.slice(key, 31)[0];
+    if (tree.root.type === 'empty') {
+        tree.root = stemNode(stem);
+        tree.root.values[subIndex] = value;
+        return;
+    }
+    function inner(node_, stem, subIndex, value, depth) {
+        let node = node_;
+        if (node.type === 'empty') {
+            node = stemNode(stem);
+            node.values[subIndex] = value;
+            return node;
+        }
+        const stemBits = bytesToBits(stem);
+        if (node.type === 'stem') {
+            if (Bytes.isEqual(node.stem, stem)) {
+                node.values[subIndex] = value;
+                return node;
+            }
+            const existingStemBits = bytesToBits(node.stem);
+            return splitLeaf(node, stemBits, existingStemBits, subIndex, value, depth);
+        }
+        if (node.type === 'internal') {
+            const bit = stemBits[depth];
+            if (bit === 0) {
+                node.left = inner(node.left, stem, subIndex, value, depth + 1);
+            }
+            else {
+                node.right = inner(node.right, stem, subIndex, value, depth + 1);
+            }
+            return node;
+        }
+        return emptyNode();
+    }
+    tree.root = inner(tree.root, stem, subIndex, value, 0);
+}
+/**
+ * Merkelizes a Binary State Tree.
+ *
+ * @example
+ * ```ts twoslash
+ * import { BinaryStateTree, Bytes } from 'ox'
+ *
+ * const tree = BinaryStateTree.create()
+ *
+ * BinaryStateTree.insert(
+ *   tree,
+ *   Bytes.fromHex(
+ *     '0xe34f199b19b2b4f47f68442619d555527d244f78a3297ea89325f843f87b8b54'
+ *   ),
+ *   Bytes.fromHex(
+ *     '0xd4fd4e189132273036449fc9e11198c739161b4c0116a9a2dccdfa1c492006f1'
+ *   )
+ * )
+ *
+ * const hash = BinaryStateTree.merkelize(tree) // [!code focus]
+ * ```
+ *
+ * @param tree - Binary State Tree instance.
+ * @returns Merkle hash.
+ */
+export function merkelize(tree) {
+    function inner(node) {
+        if (node.type === 'empty')
+            return new Uint8Array(32).fill(0);
+        if (node.type === 'internal') {
+            const hash_left = inner(node.left);
+            const hash_right = inner(node.right);
+            return hash(Bytes.concat(hash_left, hash_right));
+        }
+        let level = node.values.map(hash);
+        while (level.length > 1) {
+            const level_ = [];
+            for (let i = 0; i < level.length; i += 2)
+                level_.push(hash(Bytes.concat(level[i], level[i + 1])));
+            level = level_;
+        }
+        return hash(Bytes.concat(node.stem, new Uint8Array(1).fill(0), level[0]));
+    }
+    return inner(tree.root);
+}
+/** @internal */
+function splitLeaf(leaf, stemBits, existingStemBits, subIndex, value, depth) {
+    if (stemBits[depth] === existingStemBits[depth]) {
+        const internal = internalNode();
+        const bit = stemBits[depth];
+        if (bit === 0) {
+            internal.left = splitLeaf(leaf, stemBits, existingStemBits, subIndex, value, depth + 1);
+        }
+        else {
+            internal.right = splitLeaf(leaf, stemBits, existingStemBits, subIndex, value, depth + 1);
+        }
+        return internal;
+    }
+    const internal = internalNode();
+    const bit = stemBits[depth];
+    const stem = bitsToBytes(stemBits);
+    if (bit === 0) {
+        internal.left = stemNode(stem);
+        internal.left.values[subIndex] = value;
+        internal.right = leaf;
+    }
+    else {
+        internal.right = stemNode(stem);
+        internal.right.values[subIndex] = value;
+        internal.left = leaf;
+    }
+    return internal;
+}
+/** @internal */
+function emptyNode() {
+    return {
+        type: 'empty',
+    };
+}
+/** @internal */
+function internalNode() {
+    return {
+        left: emptyNode(),
+        right: emptyNode(),
+        type: 'internal',
+    };
+}
+/** @internal */
+function stemNode(stem) {
+    return {
+        stem,
+        values: Array.from({ length: 256 }, () => undefined),
+        type: 'stem',
+    };
+}
+/** @internal */
+function bytesToBits(bytes) {
+    const bits = [];
+    for (const byte of bytes)
+        for (let i = 0; i < 8; i++)
+            bits.push((byte >> (7 - i)) & 1);
+    return bits;
+}
+/** @internal */
+function bitsToBytes(bits) {
+    const byte_data = new Uint8Array(bits.length / 8);
+    for (let i = 0; i < bits.length; i += 8) {
+        let byte = 0;
+        for (let j = 0; j < 8; j++)
+            byte |= bits[i + j] << (7 - j);
+        byte_data[i / 8] = byte;
+    }
+    return byte_data;
+}
+/** @internal */
+function hash(bytes) {
+    if (!bytes)
+        return new Uint8Array(32).fill(0);
+    if (!bytes.some((byte) => byte !== 0))
+        return new Uint8Array(32).fill(0);
+    return blake3(bytes);
+}
+//# sourceMappingURL=BinaryStateTree.js.map

package/dist/core/BinaryStateTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryStateTree.js","sourceRoot":"","sources":["../../src/core/BinaryStateTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAA;AAEhD,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAWnC;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,MAAM;IACpB,OAAO;QACL,IAAI,EAAE,SAAS,EAAE;KAClB,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,MAAM,CACpB,IAAqB,EACrB,GAAgB,EAChB,KAAkB;IAElB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAA;IACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAA;IAEzC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAA;QAClC,OAAM;IACR,CAAC;IAED,SAAS,KAAK,CACZ,KAAW,EACX,IAAiB,EACjB,QAAgB,EAChB,KAAkB,EAClB,KAAa;QAEb,IAAI,IAAI,GAAG,KAAK,CAAA;QAEhB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;YACrB,IAAI,CAAC,MAAM,CAAC,QAAS,CAAC,GAAG,KAAK,CAAA;YAC9B,OAAO,IAAI,CAAA;QACb,CAAC;QAED,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACnC,IAAI,CAAC,MAAM,CAAC,QAAS,CAAC,GAAG,KAAK,CAAA;gBAC9B,OAAO,IAAI,CAAA;YACb,CAAC;YACD,MAAM,gBAAgB,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/C,OAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5E,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;YAC3B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YAChE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YAClE,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;QAED,OAAO,SAAS,EAAE,CAAA;IACpB,CAAC;IACD,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;AACxD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,SAAS,CAAC,IAAqB;IAC7C,SAAS,KAAK,CAAC,IAAU;QACvB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACpC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAA;QAClD,CAAC;QAED,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,EAAE,CAAA;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBACtC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,CAAA;YAC3D,KAAK,GAAG,MAAM,CAAA;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;IAC5E,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC;AAyBD,gBAAgB;AAChB,SAAS,SAAS,CAChB,IAAU,EACV,QAAkB,EAClB,gBAA0B,EAC1B,QAAgB,EAChB,KAAkB,EAClB,KAAa;IAEb,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAA;QAC/B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC3B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,QAAQ,CAAC,IAAI,GAAG,SAAS,CACvB,IAAI,EACJ,QAAQ,EACR,gBAAgB,EAChB,QAAQ,EACR,KAAK,EACL,KAAK,GAAG,CAAC,CACV,CAAA;QACH,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,KAAK,GAAG,SAAS,CACxB,IAAI,EACJ,QAAQ,EACR,gBAAgB,EAChB,QAAQ,EACR,KAAK,EACL,KAAK,GAAG,CAAC,CACV,CAAA;QACH,CAAC;QACD,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAA;IAC/B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;IAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAA;IAClC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC9B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAA;QACtC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAA;IACvB,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;QAC/B,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAA;QACvC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;IACtB,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED,gBAAgB;AAChB,SAAS,SAAS;IAChB,OAAO;QACL,IAAI,EAAE,OAAO;KACd,CAAA;AACH,CAAC;AAED,gBAAgB;AAChB,SAAS,YAAY;IACnB,OAAO;QACL,IAAI,EAAE,SAAS,EAAE;QACjB,KAAK,EAAE,SAAS,EAAE;QAClB,IAAI,EAAE,UAAU;KACjB,CAAA;AACH,CAAC;AAED,gBAAgB;AAChB,SAAS,QAAQ,CAAC,IAAiB;IACjC,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC;QACpD,IAAI,EAAE,MAAM;KACb,CAAA;AACH,CAAC;AAED,gBAAgB;AAChB,SAAS,WAAW,CAAC,KAAkB;IACrC,MAAM,IAAI,GAAG,EAAE,CAAA;IACf,KAAK,MAAM,IAAI,IAAI,KAAK;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC9D,OAAO,IAAI,CAAA;AACb,CAAC;AAED,gBAAgB;AAChB,SAAS,WAAW,CAAC,IAAc;IACjC,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3D,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;IACzB,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,gBAAgB;AAChB,SAAS,IAAI,CAAC,KAA8B;IAC1C,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACxE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAA;AACtB,CAAC"}

package/dist/core/BlobCells.d.ts

@@ -0,0 +1,202 @@
+import * as Blobs from './Blobs.js';
+import * as Bytes from './Bytes.js';
+import * as Errors from './Errors.js';
+import * as Hex from './Hex.js';
+import type { Compute } from './internal/types.js';
+import type * as Kzg from './Kzg.js';
+/** The number of field elements in a cell. */
+export declare const fieldElementsPerCell = 64;
+/** The number of bytes in a cell (64 × 32). */
+export declare const bytesPerCell = 2048;
+/** The number of cells per extended blob. */
+export declare const cellsPerExtBlob = 128;
+/** Root type for a Cell. */
+export type Cell<type extends Hex.Hex | Bytes.Bytes = Hex.Hex | Bytes.Bytes> = type;
+/** Root type for a cell KZG proof. */
+export type CellProof<type extends Hex.Hex | Bytes.Bytes = Hex.Hex | Bytes.Bytes> = type;
+/** The 0-based index of a cell within an extended blob (0…127). */
+export type CellIndex = number;
+/** The 0-based index of a column across all blobs in a block (0…127). */
+export type ColumnIndex = number;
+/**
+ * A PeerDAS data column for a single block: one cell + cell proof per blob,
+ * plus the blob-level commitments needed to verify them.
+ */
+export type DataColumn<type extends Hex.Hex | Bytes.Bytes = Hex.Hex | Bytes.Bytes> = {
+    /** Column index within the block (0…127). */
+    index: ColumnIndex;
+    /** One cell per blob, at position `index` of each blob's extended form. */
+    cells: readonly Cell<type>[];
+    /** One cell KZG proof per blob, parallel to `cells`. */
+    proofs: readonly CellProof<type>[];
+    /** Blob commitments, parallel to `cells`. */
+    commitments: readonly type[];
+};
+/**
+ * Compute the cells and KZG proofs for a single blob (PeerDAS, EIP-7594).
+ *
+ * Returns 128 cells (each 2048 bytes) and 128 cell-level KZG proofs (each 48 bytes).
+ *
+ * @example
+ * ```ts twoslash
+ * // @noErrors
+ * import { BlobCells, Blobs } from 'ox'
+ * import { kzg } from './kzg'
+ *
+ * const [blob] = Blobs.from('0xdeadbeef')
+ * const { cells, proofs } = BlobCells.fromBlob(blob, { kzg })
+ * ```
+ *
+ * @param blob - The blob to convert.
+ * @param options - Options.
+ * @returns The cells and proofs.
+ */
+export declare function fromBlob<const blob extends Hex.Hex | Bytes.Bytes, as extends 'Hex' | 'Bytes' = (blob extends Hex.Hex ? 'Hex' : never) | (blob extends Bytes.Bytes ? 'Bytes' : never)>(blob: blob | Hex.Hex | Bytes.Bytes, options: fromBlob.Options<as>): fromBlob.ReturnType<as>;
+export declare namespace fromBlob {
+    type Options<as extends 'Hex' | 'Bytes' = 'Hex'> = {
+        /** KZG implementation. */
+        kzg: Pick<Kzg.Kzg, 'computeCellsAndKzgProofs'>;
+        /** Return type. */
+        as?: as | 'Hex' | 'Bytes' | undefined;
+    };
+    type ReturnType<as extends 'Hex' | 'Bytes' = 'Hex'> = Compute<(as extends 'Bytes' ? {
+        cells: readonly Cell<Bytes.Bytes>[];
+        proofs: readonly CellProof<Bytes.Bytes>[];
+    } : never) | (as extends 'Hex' ? {
+        cells: readonly Cell<Hex.Hex>[];
+        proofs: readonly CellProof<Hex.Hex>[];
+    } : never)>;
+    type ErrorType = Bytes.fromHex.ErrorType | Hex.fromBytes.ErrorType | Errors.GlobalErrorType;
+}
+/**
+ * Verify a batch of cell KZG proofs against their commitments (PeerDAS, EIP-7594).
+ *
+ * Each cell at index `cellIndices[i]` is checked against the commitment
+ * `commitments[i]` using the proof `proofs[i]`.
+ *
+ * @example
+ * ```ts twoslash
+ * // @noErrors
+ * import { BlobCells, Blobs } from 'ox'
+ * import { kzg } from './kzg'
+ *
+ * const [blob] = Blobs.from('0xdeadbeef')
+ * const [commitment] = Blobs.toCommitments([blob], { kzg })
+ * const { cells, proofs } = BlobCells.fromBlob(blob, { kzg })
+ * const valid = BlobCells.verify({
+ *   cells,
+ *   cellIndices: cells.map((_, i) => i),
+ *   commitments: cells.map(() => commitment),
+ *   proofs,
+ *   kzg
+ * })
+ * ```
+ *
+ * @param options - Verification options.
+ * @returns Whether all (commitment, cell, proof) tuples verify.
+ */
+export declare function verify(options: verify.Options): boolean;
+export declare namespace verify {
+    type Options = {
+        /** KZG implementation. */
+        kzg: Pick<Kzg.Kzg, 'verifyCellKzgProofBatch'>;
+        /** Commitments, one per cell (parallel to `cells`). */
+        commitments: readonly (Hex.Hex | Bytes.Bytes)[];
+        /** Cell indices within their respective extended blobs. */
+        cellIndices: readonly CellIndex[];
+        /** Cells to verify. */
+        cells: readonly (Cell<Hex.Hex> | Cell<Bytes.Bytes>)[];
+        /** Proofs, one per cell (parallel to `cells`). */
+        proofs: readonly (CellProof<Hex.Hex> | CellProof<Bytes.Bytes>)[];
+    };
+    type ErrorType = Bytes.fromHex.ErrorType | Errors.GlobalErrorType;
+}
+/**
+ * Reconstruct all 128 cells (and their KZG proofs) of an extended blob from
+ * at least 64 known cells (PeerDAS, EIP-7594).
+ *
+ * @example
+ * ```ts twoslash
+ * // @noErrors
+ * import { BlobCells } from 'ox'
+ * import { kzg } from './kzg'
+ *
+ * // Reconstruct from 64 of 128 cells.
+ * const { cells, proofs } = BlobCells.recover(
+ *   knownIndices, // e.g. [0, 2, 4, …]
+ *   knownCells,
+ *   { kzg }
+ * )
+ * ```
+ *
+ * @param cellIndices - The indices of the known cells (must contain ≥ 64 distinct values).
+ * @param cells - The known cells, parallel to `cellIndices`.
+ * @param options - Options.
+ * @returns The full set of 128 cells and 128 proofs.
+ */
+export declare function recover<const cells extends readonly (Hex.Hex | Bytes.Bytes)[], as extends 'Hex' | 'Bytes' = (cells extends readonly Hex.Hex[] ? 'Hex' : never) | (cells extends readonly Bytes.Bytes[] ? 'Bytes' : never)>(cellIndices: readonly CellIndex[], cells: cells | readonly (Hex.Hex | Bytes.Bytes)[], options: recover.Options<as>): recover.ReturnType<as>;
+export declare namespace recover {
+    type Options<as extends 'Hex' | 'Bytes' = 'Hex'> = {
+        /** KZG implementation. */
+        kzg: Pick<Kzg.Kzg, 'recoverCellsAndKzgProofs'>;
+        /** Return type. */
+        as?: as | 'Hex' | 'Bytes' | undefined;
+    };
+    type ReturnType<as extends 'Hex' | 'Bytes' = 'Hex'> = Compute<(as extends 'Bytes' ? {
+        cells: readonly Cell<Bytes.Bytes>[];
+        proofs: readonly CellProof<Bytes.Bytes>[];
+    } : never) | (as extends 'Hex' ? {
+        cells: readonly Cell<Hex.Hex>[];
+        proofs: readonly CellProof<Hex.Hex>[];
+    } : never)>;
+    type ErrorType = Bytes.fromHex.ErrorType | Hex.fromBytes.ErrorType | InsufficientCellsError | MismatchedLengthsError | Errors.GlobalErrorType;
+}
+/**
+ * Build the 128 PeerDAS data columns from a list of blobs (EIP-7594).
+ *
+ * For each column index `i ∈ [0, 128)`, produces a {@link ox#BlobCells.DataColumn}
+ * containing one cell + one cell proof per blob (at column `i` of each blob's
+ * extended form), alongside the blob-level commitments needed to verify them.
+ *
+ * @example
+ * ```ts twoslash
+ * // @noErrors
+ * import { BlobCells, Blobs } from 'ox'
+ * import { kzg } from './kzg'
+ *
+ * const blobs = Blobs.from('0xdeadbeef')
+ * const columns = BlobCells.toDataColumns(blobs, { kzg }) // 128 columns
+ * ```
+ *
+ * @param blobs - The blobs to convert.
+ * @param options - Options.
+ * @returns 128 data columns.
+ */
+export declare function toDataColumns<const blobs extends Blobs.Blobs<Hex.Hex> | Blobs.Blobs<Bytes.Bytes>, as extends 'Hex' | 'Bytes' = (blobs extends Blobs.Blobs<Hex.Hex> ? 'Hex' : never) | (blobs extends Blobs.Blobs<Bytes.Bytes> ? 'Bytes' : never)>(blobs: blobs | Blobs.Blobs<Hex.Hex> | Blobs.Blobs<Bytes.Bytes>, options: toDataColumns.Options<as>): toDataColumns.ReturnType<as>;
+export declare namespace toDataColumns {
+    type Options<as extends 'Hex' | 'Bytes' = 'Hex'> = {
+        /** KZG implementation. */
+        kzg: Pick<Kzg.Kzg, 'blobToKzgCommitment' | 'computeCellsAndKzgProofs'>;
+        /** Return type. */
+        as?: as | 'Hex' | 'Bytes' | undefined;
+    };
+    type ReturnType<as extends 'Hex' | 'Bytes' = 'Hex'> = Compute<(as extends 'Bytes' ? readonly DataColumn<Bytes.Bytes>[] : never) | (as extends 'Hex' ? readonly DataColumn<Hex.Hex>[] : never)>;
+    type ErrorType = fromBlob.ErrorType | Blobs.toCommitments.ErrorType | Errors.GlobalErrorType;
+}
+/** Thrown when fewer than {@link ox#BlobCells.cellsPerExtBlob}/2 cells are passed to {@link ox#BlobCells.recover}. */
+export declare class InsufficientCellsError extends Errors.BaseError {
+    readonly name = "BlobCells.InsufficientCellsError";
+    constructor({ count }: {
+        count: number;
+    });
+}
+/** Thrown when two parallel input arrays have different lengths. */
+export declare class MismatchedLengthsError extends Errors.BaseError {
+    readonly name = "BlobCells.MismatchedLengthsError";
+    constructor({ label, a, b }: {
+        label: string;
+        a: number;
+        b: number;
+    });
+}
+//# sourceMappingURL=BlobCells.d.ts.map

package/dist/core/BlobCells.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BlobCells.d.ts","sourceRoot":"","sources":["../../src/core/BlobCells.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,GAAG,MAAM,UAAU,CAAA;AAC/B,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAClD,OAAO,KAAK,KAAK,GAAG,MAAM,UAAU,CAAA;AAEpC,8CAA8C;AAC9C,eAAO,MAAM,oBAAoB,KAAK,CAAA;AAEtC,+CAA+C;AAC/C,eAAO,MAAM,YAAY,OAAO,CAAA;AAEhC,6CAA6C;AAC7C,eAAO,MAAM,eAAe,MAAM,CAAA;AAElC,4BAA4B;AAC5B,MAAM,MAAM,IAAI,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,IACzE,IAAI,CAAA;AAEN,sCAAsC;AACtC,MAAM,MAAM,SAAS,CACnB,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,IACxD,IAAI,CAAA;AAER,mEAAmE;AACnE,MAAM,MAAM,SAAS,GAAG,MAAM,CAAA;AAE9B,yEAAyE;AACzE,MAAM,MAAM,WAAW,GAAG,MAAM,CAAA;AAEhC;;;GAGG;AACH,MAAM,MAAM,UAAU,CACpB,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,IACxD;IACF,6CAA6C;IAC7C,KAAK,EAAE,WAAW,CAAA;IAClB,2EAA2E;IAC3E,KAAK,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;IAC5B,wDAAwD;IACxD,MAAM,EAAE,SAAS,SAAS,CAAC,IAAI,CAAC,EAAE,CAAA;IAClC,6CAA6C;IAC7C,WAAW,EAAE,SAAS,IAAI,EAAE,CAAA;CAC7B,CAAA;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,QAAQ,CACtB,KAAK,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EACxC,EAAE,SAAS,KAAK,GAAG,OAAO,GACtB,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC,GACtC,CAAC,IAAI,SAAS,KAAK,CAAC,KAAK,GAAG,OAAO,GAAG,KAAK,CAAC,EAEhD,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAClC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,GAC5B,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,CAoBzB;AAED,MAAM,CAAC,OAAO,WAAW,QAAQ,CAAC;IAChC,KAAK,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI;QACjD,0BAA0B;QAC1B,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,0BAA0B,CAAC,CAAA;QAC9C,mBAAmB;QACnB,EAAE,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,OAAO,GAAG,SAAS,CAAA;KACtC,CAAA;IAED,KAAK,UAAU,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI,OAAO,CACzD,CAAC,EAAE,SAAS,OAAO,GACf;QACE,KAAK,EAAE,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAA;QACnC,MAAM,EAAE,SAAS,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAA;KAC1C,GACD,KAAK,CAAC,GACV,CAAC,EAAE,SAAS,KAAK,GACb;QACE,KAAK,EAAE,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;QAC/B,MAAM,EAAE,SAAS,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;KACtC,GACD,KAAK,CAAC,CACb,CAAA;IAED,KAAK,SAAS,GACV,KAAK,CAAC,OAAO,CAAC,SAAS,GACvB,GAAG,CAAC,SAAS,CAAC,SAAS,GACvB,MAAM,CAAC,eAAe,CAAA;CAC3B;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,GAAG,OAAO,CAUvD;AAED,MAAM,CAAC,OAAO,WAAW,MAAM,CAAC;IAC9B,KAAK,OAAO,GAAG;QACb,0BAA0B;QAC1B,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,yBAAyB,CAAC,CAAA;QAC7C,uDAAuD;QACvD,WAAW,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAA;QAC/C,2DAA2D;QAC3D,WAAW,EAAE,SAAS,SAAS,EAAE,CAAA;QACjC,uBAAuB;QACvB,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAA;QACrD,kDAAkD;QAClD,MAAM,EAAE,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAA;KACjE,CAAA;IAED,KAAK,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,GAAG,MAAM,CAAC,eAAe,CAAA;CAClE;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,OAAO,CACrB,KAAK,CAAC,KAAK,SAAS,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,EACtD,EAAE,SAAS,KAAK,GAAG,OAAO,GACtB,CAAC,KAAK,SAAS,SAAS,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,GAClD,CAAC,KAAK,SAAS,SAAS,KAAK,CAAC,KAAK,EAAE,GAAG,OAAO,GAAG,KAAK,CAAC,EAE5D,WAAW,EAAE,SAAS,SAAS,EAAE,EACjC,KAAK,EAAE,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,EACjD,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,GAC3B,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAgCxB;AAED,MAAM,CAAC,OAAO,WAAW,OAAO,CAAC;IAC/B,KAAK,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI;QACjD,0BAA0B;QAC1B,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,0BAA0B,CAAC,CAAA;QAC9C,mBAAmB;QACnB,EAAE,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,OAAO,GAAG,SAAS,CAAA;KACtC,CAAA;IAED,KAAK,UAAU,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI,OAAO,CACzD,CAAC,EAAE,SAAS,OAAO,GACf;QACE,KAAK,EAAE,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAA;QACnC,MAAM,EAAE,SAAS,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAA;KAC1C,GACD,KAAK,CAAC,GACV,CAAC,EAAE,SAAS,KAAK,GACb;QACE,KAAK,EAAE,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;QAC/B,MAAM,EAAE,SAAS,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;KACtC,GACD,KAAK,CAAC,CACb,CAAA;IAED,KAAK,SAAS,GACV,KAAK,CAAC,OAAO,CAAC,SAAS,GACvB,GAAG,CAAC,SAAS,CAAC,SAAS,GACvB,sBAAsB,GACtB,sBAAsB,GACtB,MAAM,CAAC,eAAe,CAAA;CAC3B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,aAAa,CAC3B,KAAK,CAAC,KAAK,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EACnE,EAAE,SAAS,KAAK,GAAG,OAAO,GACtB,CAAC,KAAK,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,GACpD,CAAC,KAAK,SAAS,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,GAAG,KAAK,CAAC,EAE9D,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAC9D,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC,GACjC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC,CA+B9B;AAED,MAAM,CAAC,OAAO,WAAW,aAAa,CAAC;IACrC,KAAK,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI;QACjD,0BAA0B;QAC1B,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,qBAAqB,GAAG,0BAA0B,CAAC,CAAA;QACtE,mBAAmB;QACnB,EAAE,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,OAAO,GAAG,SAAS,CAAA;KACtC,CAAA;IAED,KAAK,UAAU,CAAC,EAAE,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI,OAAO,CACzD,CAAC,EAAE,SAAS,OAAO,GAAG,SAAS,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,GACjE,CAAC,EAAE,SAAS,KAAK,GAAG,SAAS,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,CAC9D,CAAA;IAED,KAAK,SAAS,GACV,QAAQ,CAAC,SAAS,GAClB,KAAK,CAAC,aAAa,CAAC,SAAS,GAC7B,MAAM,CAAC,eAAe,CAAA;CAC3B;AAED,sHAAsH;AACtH,qBAAa,sBAAuB,SAAQ,MAAM,CAAC,SAAS;IAC1D,SAAkB,IAAI,sCAAqC;gBAE/C,EAAE,KAAK,EAAE,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE;CAKzC;AAED,oEAAoE;AACpE,qBAAa,sBAAuB,SAAQ,MAAM,CAAC,SAAS;IAC1D,SAAkB,IAAI,sCAAqC;gBAE/C,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE;CAGrE"}