@flaunch/sdk 0.9.16 → 0.9.19

package/dist/index.cjs.js

@@ -20,7 +20,7 @@ function defineChain(chain) {
     };
 }
 
-const version = '2.29.2';
+const version = '2.37.12';
 
 let errorConfig = {
     getDocsUrl: ({ docsBaseUrl, docsPath = '', docsSlug, }) => docsPath
@@ -620,8 +620,8 @@ function defineFormatter(type, format) {
     return ({ exclude, format: overrides, }) => {
         return {
             exclude,
-            format: (args) => {
-                const formatted = format(args);
+            format: (args, action) => {
+                const formatted = format(args, action);
                 if (exclude) {
                     for (const key of exclude) {
                         delete formatted[key];
@@ -629,7 +629,7 @@ function defineFormatter(type, format) {
                 }
                 return {
                     ...formatted,
-                    ...overrides(args),
+                    ...overrides(args, action),
                 };
             },
             type,
@@ -644,7 +644,7 @@ const transactionType = {
     '0x3': 'eip4844',
     '0x4': 'eip7702',
 };
-function formatTransaction(transaction) {
+function formatTransaction(transaction, _) {
     const transaction_ = {
         ...transaction,
         blockHash: transaction.blockHash ? transaction.blockHash : null,
@@ -722,7 +722,7 @@ function formatAuthorizationList$1(authorizationList) {
     }));
 }
 
-function formatBlock(block) {
+function formatBlock(block, _) {
     const transactions = (block.transactions ?? []).map((transaction) => {
         if (typeof transaction === 'string')
             return transaction;
@@ -770,7 +770,7 @@ const receiptStatuses = {
     '0x0': 'reverted',
     '0x1': 'success',
 };
-function formatTransactionReceipt(transactionReceipt) {
+function formatTransactionReceipt(transactionReceipt, _) {
     const receipt = {
         ...transactionReceipt,
         blockNumber: transactionReceipt.blockNumber
@@ -817,7 +817,7 @@ const rpcTransactionType = {
     eip4844: '0x3',
     eip7702: '0x4',
 };
-function formatTransactionRequest(request) {
+function formatTransactionRequest(request, _) {
     const rpcRequest = {};
     if (typeof request.authorizationList !== 'undefined')
         rpcRequest.authorizationList = formatAuthorizationList(request.authorizationList);
@@ -1354,19 +1354,21 @@ function blobsToProofs(parameters) {
         : proofs.map((x) => bytesToHex$1(x)));
 }
 
+const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;
+
 /**
- * Internal assertion helpers.
+ * Utilities for hex, bytes, CSPRNG.
  * @module
  */
+/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */
+function isBytes$2(a) {
+    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');
+}
 /** Asserts something is positive integer. */
 function anumber$1(n) {
     if (!Number.isSafeInteger(n) || n < 0)
         throw new Error('positive integer expected, got ' + n);
 }
-/** Is number an Uint8Array? Copied from utils for perf. */
-function isBytes$2(a) {
-    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');
-}
 /** Asserts something is Uint8Array. */
 function abytes$2(b, ...lengths) {
     if (!isBytes$2(b))
@@ -1377,7 +1379,7 @@ function abytes$2(b, ...lengths) {
 /** Asserts something is hash */
 function ahash(h) {
     if (typeof h !== 'function' || typeof h.create !== 'function')
-        throw new Error('Hash should be wrapped by utils.wrapConstructor');
+        throw new Error('Hash should be wrapped by utils.createHasher');
     anumber$1(h.outputLen);
     anumber$1(h.blockLen);
 }
@@ -1396,17 +1398,17 @@ function aoutput(out, instance) {
         throw new Error('digestInto() expects output buffer of length at least ' + min);
     }
 }
-
-const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;
-
-/**
- * Utilities for hex, bytes, CSPRNG.
- * @module
- */
+/** Cast u8 / u16 / u32 to u32. */
 function u32(arr) {
     return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
 }
-// Cast array to view
+/** Zeroize a byte array. Warning: JS provides no guarantees. */
+function clean(...arrays) {
+    for (let i = 0; i < arrays.length; i++) {
+        arrays[i].fill(0);
+    }
+}
+/** Create DataView of an array for easy byte-level manipulation. */
 function createView(arr) {
     return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
 }
@@ -1416,7 +1418,7 @@ function rotr(word, shift) {
 }
 /** Is current platform little-endian? Most are. Big-Endian platform: IBM */
 const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();
-// The byte swap operation for uint32
+/** The byte swap operation for uint32 */
 function byteSwap(word) {
     return (((word << 24) & 0xff000000) |
         ((word << 8) & 0xff0000) |
@@ -1428,17 +1430,18 @@ function byteSwap32(arr) {
     for (let i = 0; i < arr.length; i++) {
         arr[i] = byteSwap(arr[i]);
     }
+    return arr;
 }
-// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex
-// @ts-ignore
-typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';
+const swap32IfBE = isLE
+    ? (u) => u
+    : byteSwap32;
 /**
- * Convert JS string to byte array.
- * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
+ * Converts string to bytes using UTF8 encoding.
+ * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])
  */
 function utf8ToBytes(str) {
     if (typeof str !== 'string')
-        throw new Error('utf8ToBytes expected string, got ' + typeof str);
+        throw new Error('string expected');
     return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
 }
 /**
@@ -1452,9 +1455,7 @@ function toBytes(data) {
     abytes$2(data);
     return data;
 }
-/**
- * Copies several Uint8Arrays into one.
- */
+/** Copies several Uint8Arrays into one. */
 function concatBytes$1(...arrays) {
     let sum = 0;
     for (let i = 0; i < arrays.length; i++) {
@@ -1472,13 +1473,9 @@ function concatBytes$1(...arrays) {
 }
 /** For runtime check if class implements interface */
 class Hash {
-    // Safe version that clones internal state
-    clone() {
-        return this._cloneInto();
-    }
 }
 /** Wraps hash function, creating an interface on top of it */
-function wrapConstructor(hashCons) {
+function createHasher(hashCons) {
     const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
     const tmp = hashCons();
     hashC.outputLen = tmp.outputLen;
@@ -1543,8 +1540,9 @@ class HashMD extends Hash {
     }
     update(data) {
         aexists(this);
-        const { view, buffer, blockLen } = this;
         data = toBytes(data);
+        abytes$2(data);
+        const { view, buffer, blockLen } = this;
         const len = data.length;
         for (let pos = 0; pos < len;) {
             const take = Math.min(blockLen - this.pos, len - pos);
@@ -1578,7 +1576,7 @@ class HashMD extends Hash {
         let { pos } = this;
         // append the bit '1' to the message
         buffer[pos++] = 0b10000000;
-        this.buffer.subarray(pos).fill(0);
+        clean(this.buffer.subarray(pos));
         // we have less than padOffset left in buffer, so we cannot put length in
         // current block, need process it and pad again
         if (this.padOffset > blockLen - pos) {
@@ -1616,28 +1614,69 @@ class HashMD extends Hash {
         to || (to = new this.constructor());
         to.set(...this.get());
         const { blockLen, buffer, length, finished, destroyed, pos } = this;
+        to.destroyed = destroyed;
+        to.finished = finished;
         to.length = length;
         to.pos = pos;
-        to.finished = finished;
-        to.destroyed = destroyed;
         if (length % blockLen)
             to.buffer.set(buffer);
         return to;
     }
+    clone() {
+        return this._cloneInto();
+    }
 }
+/**
+ * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
+ * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
+ */
+/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */
+const SHA256_IV = /* @__PURE__ */ Uint32Array.from([
+    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
+]);
 
 /**
- * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.
- *
- * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
- * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
- *
- * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+ * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
+ * @todo re-check https://issues.chromium.org/issues/42212588
  * @module
  */
-/** Round constants: first 32 bits of fractional parts of the cube roots of the first 64 primes 2..311). */
+const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+const _32n = /* @__PURE__ */ BigInt(32);
+function fromBig(n, le = false) {
+    if (le)
+        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
+    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+}
+function split(lst, le = false) {
+    const len = lst.length;
+    let Ah = new Uint32Array(len);
+    let Al = new Uint32Array(len);
+    for (let i = 0; i < len; i++) {
+        const { h, l } = fromBig(lst[i], le);
+        [Ah[i], Al[i]] = [h, l];
+    }
+    return [Ah, Al];
+}
+// Left rotate for Shift in [1, 32)
+const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
+const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
+// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
+const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
+const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
+
+/**
+ * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.
+ * SHA256 is the fastest hash implementable in JS, even faster than Blake3.
+ * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and
+ * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+ * @module
+ */
+/**
+ * Round constants:
+ * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)
+ */
 // prettier-ignore
-const SHA256_K = /* @__PURE__ */ new Uint32Array([
+const SHA256_K = /* @__PURE__ */ Uint32Array.from([
     0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
     0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
     0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
@@ -1647,15 +1686,7 @@ const SHA256_K = /* @__PURE__ */ new Uint32Array([
     0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
     0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
 ]);
-/** Initial state: first 32 bits of fractional parts of the square roots of the first 8 primes 2..19. */
-// prettier-ignore
-const SHA256_IV = /* @__PURE__ */ new Uint32Array([
-    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
-]);
-/**
- * Temporary buffer, not used to store anything between runs.
- * Named this way because it matches specification.
- */
+/** Reusable temporary buffer. "W" comes straight from spec. */
 const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
 class SHA256 extends HashMD {
     constructor(outputLen = 32) {
@@ -1725,15 +1756,34 @@ class SHA256 extends HashMD {
         this.set(A, B, C, D, E, F, G, H);
     }
     roundClean() {
-        SHA256_W.fill(0);
+        clean(SHA256_W);
     }
     destroy() {
         this.set(0, 0, 0, 0, 0, 0, 0, 0);
-        this.buffer.fill(0);
+        clean(this.buffer);
     }
 }
-/** SHA2-256 hash function */
-const sha256$1 = /* @__PURE__ */ wrapConstructor(() => new SHA256());
+/**
+ * SHA2-256 hash function from RFC 4634.
+ *
+ * It is the fastest JS hash, even faster than Blake3.
+ * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
+ * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+ */
+const sha256$2 = /* @__PURE__ */ createHasher(() => new SHA256());
+
+/**
+ * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.
+ *
+ * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
+ * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+ *
+ * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+ * @module
+ * @deprecated
+ */
+/** @deprecated Use import from `noble/hashes/sha2` module */
+const sha256$1 = sha256$2;
 
 function sha256(value, to_) {
     const to = to_ || 'hex';
@@ -2033,34 +2083,6 @@ class LruMap extends Map {
     }
 }
 
-/**
- * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
- * @todo re-check https://issues.chromium.org/issues/42212588
- * @module
- */
-const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-const _32n = /* @__PURE__ */ BigInt(32);
-function fromBig(n, le = false) {
-    if (le)
-        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
-    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
-}
-function split(lst, le = false) {
-    let Ah = new Uint32Array(lst.length);
-    let Al = new Uint32Array(lst.length);
-    for (let i = 0; i < lst.length; i++) {
-        const { h, l } = fromBig(lst[i], le);
-        [Ah[i], Al[i]] = [h, l];
-    }
-    return [Ah, Al];
-}
-// Left rotate for Shift in [1, 32)
-const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
-const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
-// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
-const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
-const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
-
 /**
  * SHA3 (keccak) hash function, based on a new "Sponge function" design.
  * Different from older hashes, the internal state is bigger than output size.
@@ -2072,16 +2094,18 @@ const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
  * Check out `sha3-addons` module for cSHAKE, k12, and others.
  * @module
  */
+// No __PURE__ annotations in sha3 header:
+// EVERYTHING is in fact used on every export.
 // Various per round constants calculations
+const _0n$5 = BigInt(0);
+const _1n$5 = BigInt(1);
+const _2n$2 = BigInt(2);
+const _7n = BigInt(7);
+const _256n = BigInt(256);
+const _0x71n = BigInt(0x71);
 const SHA3_PI = [];
 const SHA3_ROTL = [];
 const _SHA3_IOTA = [];
-const _0n$4 = /* @__PURE__ */ BigInt(0);
-const _1n$5 = /* @__PURE__ */ BigInt(1);
-const _2n$2 = /* @__PURE__ */ BigInt(2);
-const _7n = /* @__PURE__ */ BigInt(7);
-const _256n = /* @__PURE__ */ BigInt(256);
-const _0x71n = /* @__PURE__ */ BigInt(0x71);
 for (let round = 0, R = _1n$5, x = 1, y = 0; round < 24; round++) {
     // Pi
     [x, y] = [y, (2 * x + 3 * y) % 5];
@@ -2089,7 +2113,7 @@ for (let round = 0, R = _1n$5, x = 1, y = 0; round < 24; round++) {
     // Rotational
     SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);
     // Iota
-    let t = _0n$4;
+    let t = _0n$5;
     for (let j = 0; j < 7; j++) {
         R = ((R << _1n$5) ^ ((R >> _7n) * _0x71n)) % _256n;
         if (R & _2n$2)
@@ -2097,7 +2121,9 @@ for (let round = 0, R = _1n$5, x = 1, y = 0; round < 24; round++) {
     }
     _SHA3_IOTA.push(t);
 }
-const [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);
+const IOTAS = split(_SHA3_IOTA, true);
+const SHA3_IOTA_H = IOTAS[0];
+const SHA3_IOTA_L = IOTAS[1];
 // Left rotation (without 0, 32, 64)
 const rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));
 const rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));
@@ -2145,7 +2171,7 @@ function keccakP(s, rounds = 24) {
         s[0] ^= SHA3_IOTA_H[round];
         s[1] ^= SHA3_IOTA_L[round];
     }
-    B.fill(0);
+    clean(B);
 }
 /** Keccak sponge function. */
 class Keccak extends Hash {
@@ -2166,24 +2192,26 @@ class Keccak extends Hash {
         anumber$1(outputLen);
         // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes
         // 0 < blockLen < 200
-        if (0 >= this.blockLen || this.blockLen >= 200)
-            throw new Error('Sha3 supports only keccak-f1600 function');
+        if (!(0 < blockLen && blockLen < 200))
+            throw new Error('only keccak-f1600 function is supported');
         this.state = new Uint8Array(200);
         this.state32 = u32(this.state);
     }
+    clone() {
+        return this._cloneInto();
+    }
     keccak() {
-        if (!isLE)
-            byteSwap32(this.state32);
+        swap32IfBE(this.state32);
         keccakP(this.state32, this.rounds);
-        if (!isLE)
-            byteSwap32(this.state32);
+        swap32IfBE(this.state32);
         this.posOut = 0;
         this.pos = 0;
     }
     update(data) {
         aexists(this);
-        const { blockLen, state } = this;
         data = toBytes(data);
+        abytes$2(data);
+        const { blockLen, state } = this;
         const len = data.length;
         for (let pos = 0; pos < len;) {
             const take = Math.min(blockLen - this.pos, len - pos);
@@ -2245,7 +2273,7 @@ class Keccak extends Hash {
     }
     destroy() {
         this.destroyed = true;
-        this.state.fill(0);
+        clean(this.state);
     }
     _cloneInto(to) {
         const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
@@ -2263,9 +2291,9 @@ class Keccak extends Hash {
         return to;
     }
 }
-const gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));
+const gen = (suffix, blockLen, outputLen) => createHasher(() => new Keccak(blockLen, suffix, outputLen));
 /** keccak-256 hash function. Different from SHA3-256. */
-const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);
+const keccak_256 = /* @__PURE__ */ (() => gen(0x01, 136, 256 / 8))();
 
 function keccak256(value, to_) {
     const to = to_ || 'hex';
@@ -2534,13 +2562,13 @@ function serializeTransactionEIP7702(transaction, signature) {
     return concatHex([
         '0x04',
         toRlp([
-            toHex(chainId),
-            nonce ? toHex(nonce) : '0x',
-            maxPriorityFeePerGas ? toHex(maxPriorityFeePerGas) : '0x',
-            maxFeePerGas ? toHex(maxFeePerGas) : '0x',
-            gas ? toHex(gas) : '0x',
+            numberToHex(chainId),
+            nonce ? numberToHex(nonce) : '0x',
+            maxPriorityFeePerGas ? numberToHex(maxPriorityFeePerGas) : '0x',
+            maxFeePerGas ? numberToHex(maxFeePerGas) : '0x',
+            gas ? numberToHex(gas) : '0x',
             to ?? '0x',
-            value ? toHex(value) : '0x',
+            value ? numberToHex(value) : '0x',
             data ?? '0x',
             serializedAccessList,
             serializedAuthorizationList,
@@ -2576,16 +2604,16 @@ function serializeTransactionEIP4844(transaction, signature) {
     }
     const serializedAccessList = serializeAccessList(accessList);
     const serializedTransaction = [
-        toHex(chainId),
-        nonce ? toHex(nonce) : '0x',
-        maxPriorityFeePerGas ? toHex(maxPriorityFeePerGas) : '0x',
-        maxFeePerGas ? toHex(maxFeePerGas) : '0x',
-        gas ? toHex(gas) : '0x',
+        numberToHex(chainId),
+        nonce ? numberToHex(nonce) : '0x',
+        maxPriorityFeePerGas ? numberToHex(maxPriorityFeePerGas) : '0x',
+        maxFeePerGas ? numberToHex(maxFeePerGas) : '0x',
+        gas ? numberToHex(gas) : '0x',
         to ?? '0x',
-        value ? toHex(value) : '0x',
+        value ? numberToHex(value) : '0x',
         data ?? '0x',
         serializedAccessList,
-        maxFeePerBlobGas ? toHex(maxFeePerBlobGas) : '0x',
+        maxFeePerBlobGas ? numberToHex(maxFeePerBlobGas) : '0x',
         blobVersionedHashes ?? [],
         ...toYParitySignatureArray(transaction, signature),
     ];
@@ -2613,13 +2641,13 @@ function serializeTransactionEIP1559(transaction, signature) {
     assertTransactionEIP1559(transaction);
     const serializedAccessList = serializeAccessList(accessList);
     const serializedTransaction = [
-        toHex(chainId),
-        nonce ? toHex(nonce) : '0x',
-        maxPriorityFeePerGas ? toHex(maxPriorityFeePerGas) : '0x',
-        maxFeePerGas ? toHex(maxFeePerGas) : '0x',
-        gas ? toHex(gas) : '0x',
+        numberToHex(chainId),
+        nonce ? numberToHex(nonce) : '0x',
+        maxPriorityFeePerGas ? numberToHex(maxPriorityFeePerGas) : '0x',
+        maxFeePerGas ? numberToHex(maxFeePerGas) : '0x',
+        gas ? numberToHex(gas) : '0x',
         to ?? '0x',
-        value ? toHex(value) : '0x',
+        value ? numberToHex(value) : '0x',
         data ?? '0x',
         serializedAccessList,
         ...toYParitySignatureArray(transaction, signature),
@@ -2634,12 +2662,12 @@ function serializeTransactionEIP2930(transaction, signature) {
     assertTransactionEIP2930(transaction);
     const serializedAccessList = serializeAccessList(accessList);
     const serializedTransaction = [
-        toHex(chainId),
-        nonce ? toHex(nonce) : '0x',
-        gasPrice ? toHex(gasPrice) : '0x',
-        gas ? toHex(gas) : '0x',
+        numberToHex(chainId),
+        nonce ? numberToHex(nonce) : '0x',
+        gasPrice ? numberToHex(gasPrice) : '0x',
+        gas ? numberToHex(gas) : '0x',
         to ?? '0x',
-        value ? toHex(value) : '0x',
+        value ? numberToHex(value) : '0x',
         data ?? '0x',
         serializedAccessList,
         ...toYParitySignatureArray(transaction, signature),
@@ -2653,11 +2681,11 @@ function serializeTransactionLegacy(transaction, signature) {
     const { chainId = 0, gas, data, nonce, to, value, gasPrice } = transaction;
     assertTransactionLegacy(transaction);
     let serializedTransaction = [
-        nonce ? toHex(nonce) : '0x',
-        gasPrice ? toHex(gasPrice) : '0x',
-        gas ? toHex(gas) : '0x',
+        nonce ? numberToHex(nonce) : '0x',
+        gasPrice ? numberToHex(gasPrice) : '0x',
+        gas ? numberToHex(gas) : '0x',
         to ?? '0x',
-        value ? toHex(value) : '0x',
+        value ? numberToHex(value) : '0x',
         data ?? '0x',
     ];
     if (signature) {
@@ -2682,7 +2710,7 @@ function serializeTransactionLegacy(transaction, signature) {
         const s = trim(signature.s);
         serializedTransaction = [
             ...serializedTransaction,
-            toHex(v),
+            numberToHex(v),
             r === '0x00' ? '0x' : r,
             s === '0x00' ? '0x' : s,
         ];
@@ -2690,7 +2718,7 @@ function serializeTransactionLegacy(transaction, signature) {
     else if (chainId > 0) {
         serializedTransaction = [
             ...serializedTransaction,
-            toHex(chainId),
+            numberToHex(chainId),
             '0x',
             '0x',
         ];
@@ -2710,12 +2738,12 @@ function toYParitySignatureArray(transaction, signature_) {
     const s = trim(signature.s);
     const yParity_ = (() => {
         if (typeof yParity === 'number')
-            return yParity ? toHex(1) : '0x';
+            return yParity ? numberToHex(1) : '0x';
         if (v === 0n)
             return '0x';
         if (v === 1n)
-            return toHex(1);
-        return v === 27n ? '0x' : toHex(1);
+            return numberToHex(1);
+        return v === 27n ? '0x' : numberToHex(1);
     })();
     return [yParity_, r === '0x00' ? '0x' : r, s === '0x00' ? '0x' : s];
 }
@@ -2826,12 +2854,13 @@ function assertTransactionDeposit(transaction) {
 }
 
 const chainConfig$1 = {
+    blockTime: 2_000,
     contracts,
     formatters: formatters$1,
     serializers: serializers$1,
 };
 
-const sourceId$K = 1; // mainnet
+const sourceId$M = 1; // mainnet
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 888888888,
@@ -2852,27 +2881,27 @@ const sourceId$K = 1; // mainnet
     contracts: {
         ...chainConfig$1.contracts,
         l2OutputOracle: {
-            [sourceId$K]: {
+            [sourceId$M]: {
                 address: '0xB09DC08428C8b4EFB4ff9C0827386CDF34277996',
             },
         },
         portal: {
-            [sourceId$K]: {
+            [sourceId$M]: {
                 address: '0x639F2AECE398Aa76b07e59eF6abe2cFe32bacb68',
                 blockCreated: 19070571,
             },
         },
         l1StandardBridge: {
-            [sourceId$K]: {
+            [sourceId$M]: {
                 address: '0xd5e3eDf5b68135D559D572E26bF863FBC1950033',
                 blockCreated: 19070571,
             },
         },
     },
-    sourceId: sourceId$K,
+    sourceId: sourceId$M,
 });
 
-const sourceId$J = 11_155_111; // sepolia
+const sourceId$L = 11_155_111; // sepolia
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 28122024,
@@ -2893,27 +2922,27 @@ const sourceId$J = 11_155_111; // sepolia
     contracts: {
         ...chainConfig$1.contracts,
         l2OutputOracle: {
-            [sourceId$J]: {
+            [sourceId$L]: {
                 address: '0x942fD5017c0F60575930D8574Eaca13BEcD6e1bB',
             },
         },
         portal: {
-            [sourceId$J]: {
+            [sourceId$L]: {
                 address: '0xfa1d9E26A6aCD7b22115D27572c1221B9803c960',
                 blockCreated: 4972908,
             },
         },
         l1StandardBridge: {
-            [sourceId$J]: {
+            [sourceId$L]: {
                 address: '0xF6Bc0146d3c74D48306e79Ae134A260E418C9335',
                 blockCreated: 4972908,
             },
         },
     },
-    sourceId: sourceId$J,
+    sourceId: sourceId$L,
 });
 
-const sourceId$I = 1; // mainnet
+const sourceId$K = 1; // mainnet
 const base = /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 8453,
@@ -2934,12 +2963,12 @@ const base = /*#__PURE__*/ defineChain({
     contracts: {
         ...chainConfig$1.contracts,
         disputeGameFactory: {
-            [sourceId$I]: {
+            [sourceId$K]: {
                 address: '0x43edB88C4B80fDD2AdFF2412A7BebF9dF42cB40e',
             },
         },
         l2OutputOracle: {
-            [sourceId$I]: {
+            [sourceId$K]: {
                 address: '0x56315b90c40730925ec5485cf004d835058518A0',
             },
         },
@@ -2948,22 +2977,22 @@ const base = /*#__PURE__*/ defineChain({
             blockCreated: 5022,
         },
         portal: {
-            [sourceId$I]: {
+            [sourceId$K]: {
                 address: '0x49048044D57e1C92A77f79988d21Fa8fAF74E97e',
                 blockCreated: 17482143,
             },
         },
         l1StandardBridge: {
-            [sourceId$I]: {
+            [sourceId$K]: {
                 address: '0x3154Cf16ccdb4C6d922629664174b904d80F2C35',
                 blockCreated: 17482143,
             },
         },
     },
-    sourceId: sourceId$I,
+    sourceId: sourceId$K,
 });
 
-const sourceId$H = 5; // goerli
+const sourceId$J = 5; // goerli
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 84531,
@@ -2982,7 +3011,7 @@ const sourceId$H = 5; // goerli
     contracts: {
         ...chainConfig$1.contracts,
         l2OutputOracle: {
-            [sourceId$H]: {
+            [sourceId$J]: {
                 address: '0x2A35891ff30313CcFa6CE88dcf3858bb075A2298',
             },
         },
@@ -2991,21 +3020,21 @@ const sourceId$H = 5; // goerli
             blockCreated: 1376988,
         },
         portal: {
-            [sourceId$H]: {
+            [sourceId$J]: {
                 address: '0xe93c8cD0D409341205A592f8c4Ac1A5fe5585cfA',
             },
         },
         l1StandardBridge: {
-            [sourceId$H]: {
+            [sourceId$J]: {
                 address: '0xfA6D8Ee5BE770F84FC001D098C4bD604Fe01284a',
             },
         },
     },
     testnet: true,
-    sourceId: sourceId$H,
+    sourceId: sourceId$J,
 });
 
-const sourceId$G = 11_155_111; // sepolia
+const sourceId$I = 11_155_111; // sepolia
 const baseSepolia = /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 84532,
@@ -3027,23 +3056,23 @@ const baseSepolia = /*#__PURE__*/ defineChain({
     contracts: {
         ...chainConfig$1.contracts,
         disputeGameFactory: {
-            [sourceId$G]: {
+            [sourceId$I]: {
                 address: '0xd6E6dBf4F7EA0ac412fD8b65ED297e64BB7a06E1',
             },
         },
         l2OutputOracle: {
-            [sourceId$G]: {
+            [sourceId$I]: {
                 address: '0x84457ca9D0163FbC4bbfe4Dfbb20ba46e48DF254',
             },
         },
         portal: {
-            [sourceId$G]: {
+            [sourceId$I]: {
                 address: '0x49f53e41452c74589e85ca1677426ba426459e85',
                 blockCreated: 4446677,
             },
         },
         l1StandardBridge: {
-            [sourceId$G]: {
+            [sourceId$I]: {
                 address: '0xfd0Bf71F60660E2f608ed56e1659C450eB113120',
                 blockCreated: 4446677,
             },
@@ -3054,7 +3083,7 @@ const baseSepolia = /*#__PURE__*/ defineChain({
         },
     },
     testnet: true,
-    sourceId: sourceId$G,
+    sourceId: sourceId$I,
 });
 
 defineChain({
@@ -3075,7 +3104,7 @@ defineChain({
     },
 });
 
-const sourceId$F = 1; // mainnet
+const sourceId$H = 1; // mainnet
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 81457,
@@ -3101,11 +3130,29 @@ const sourceId$F = 1; // mainnet
             address: '0xcA11bde05977b3631167028862bE2a173976CA11',
             blockCreated: 212929,
         },
+        l2OutputOracle: {
+            [sourceId$H]: {
+                address: '0x826D1B0D4111Ad9146Eb8941D7Ca2B6a44215c76',
+                blockCreated: 19300358,
+            },
+        },
+        portal: {
+            [sourceId$H]: {
+                address: '0x0Ec68c5B10F21EFFb74f2A5C61DFe6b08C0Db6Cb',
+                blockCreated: 19300357,
+            },
+        },
+        l1StandardBridge: {
+            [sourceId$H]: {
+                address: '0x697402166Fbf2F22E970df8a6486Ef171dbfc524',
+                blockCreated: 19300360,
+            },
+        },
     },
-    sourceId: sourceId$F,
+    sourceId: sourceId$H,
 });
 
-const sourceId$E = 1; // mainnet
+const sourceId$G = 1; // mainnet
 defineChain({
     ...chainConfig$1,
     id: 60808,
@@ -3134,22 +3181,22 @@ defineChain({
             blockCreated: 23131,
         },
         l2OutputOracle: {
-            [sourceId$E]: {
+            [sourceId$G]: {
                 address: '0xdDa53E23f8a32640b04D7256e651C1db98dB11C1',
                 blockCreated: 4462615,
             },
         },
         portal: {
-            [sourceId$E]: {
+            [sourceId$G]: {
                 address: '0x8AdeE124447435fE03e3CD24dF3f4cAE32E65a3E',
                 blockCreated: 4462615,
             },
         },
     },
-    sourceId: sourceId$E,
+    sourceId: sourceId$G,
 });
 
-const sourceId$D = 11_155_111; // sepolia
+const sourceId$F = 11_155_111; // sepolia
 defineChain({
     ...chainConfig$1,
     id: 808813,
@@ -3178,20 +3225,20 @@ defineChain({
             blockCreated: 35677,
         },
         l2OutputOracle: {
-            [sourceId$D]: {
+            [sourceId$F]: {
                 address: '0x14D0069452b4AE2b250B395b8adAb771E4267d2f',
                 blockCreated: 4462615,
             },
         },
         portal: {
-            [sourceId$D]: {
+            [sourceId$F]: {
                 address: '0x867B1Aa872b9C8cB5E9F7755feDC45BB24Ad0ae4',
                 blockCreated: 4462615,
             },
         },
     },
     testnet: true,
-    sourceId: sourceId$D,
+    sourceId: sourceId$F,
 });
 
 const fees = {
@@ -3400,13 +3447,14 @@ function assertTransactionCIP64(transaction) {
 }
 
 const chainConfig = {
+    blockTime: 1_000,
     contracts,
     formatters,
     serializers,
     fees,
 };
 
-const sourceId$C = 17000; // holsky
+const sourceId$E = 17000; // holsky
 // source https://storage.googleapis.com/cel2-rollup-files/alfajores/deployment-l1.json
 /*#__PURE__*/ defineChain({
     ...chainConfig,
@@ -3436,25 +3484,25 @@ const sourceId$C = 17000; // holsky
             blockCreated: 14569001,
         },
         portal: {
-            [sourceId$C]: {
+            [sourceId$E]: {
                 address: '0x82527353927d8D069b3B452904c942dA149BA381',
                 blockCreated: 2411324,
             },
         },
         disputeGameFactory: {
-            [sourceId$C]: {
+            [sourceId$E]: {
                 address: '0xE28AAdcd9883746c0e5068F58f9ea06027b214cb',
                 blockCreated: 2411324,
             },
         },
         l2OutputOracle: {
-            [sourceId$C]: {
+            [sourceId$E]: {
                 address: '0x4a2635e9e4f6e45817b1D402ac4904c1d1752438',
                 blockCreated: 2411324,
             },
         },
         l1StandardBridge: {
-            [sourceId$C]: {
+            [sourceId$E]: {
                 address: '0xD1B0E0581973c9eB7f886967A606b9441A897037',
                 blockCreated: 2411324,
             },
@@ -3463,6 +3511,57 @@ const sourceId$C = 17000; // holsky
     testnet: true,
 });
 
+const sourceId$D = 11_155_111; // sepolia
+// source https://storage.googleapis.com/cel2-rollup-files/celo-sepolia/deployment-l1.json
+/*#__PURE__*/ defineChain({
+    ...chainConfig,
+    id: 11_142_220,
+    name: 'Celo Sepolia Testnet',
+    nativeCurrency: {
+        decimals: 18,
+        name: 'CELO',
+        symbol: 'S-CELO',
+    },
+    rpcUrls: {
+        default: {
+            http: ['https://forno.celo-sepolia.celo-testnet.org'],
+        },
+    },
+    blockExplorers: {
+        default: {
+            name: 'Celo Sepolia Explorer',
+            url: 'https://celo-sepolia.blockscout.com/',
+            apiUrl: 'https://celo-sepolia.blockscout.com/api',
+        },
+    },
+    contracts: {
+        ...chainConfig.contracts,
+        multicall3: {
+            address: '0xcA11bde05977b3631167028862bE2a173976CA11',
+            blockCreated: 1,
+        },
+        portal: {
+            [sourceId$D]: {
+                address: '0x44ae3d41a335a7d05eb533029917aad35662dcc2',
+                blockCreated: 8825790,
+            },
+        },
+        disputeGameFactory: {
+            [sourceId$D]: {
+                address: '0x57c45d82d1a995f1e135b8d7edc0a6bb5211cfaa',
+                blockCreated: 8825790,
+            },
+        },
+        l1StandardBridge: {
+            [sourceId$D]: {
+                address: '0xec18a3c30131a0db4246e785355fbc16e2eaf408',
+                blockCreated: 8825790,
+            },
+        },
+    },
+    testnet: true,
+});
+
 defineChain({
     id: 44,
     name: 'Crab Network',
@@ -3577,7 +3676,7 @@ defineChain({
     testnet: true,
 });
 
-const sourceId$B = 1; // mainnet
+const sourceId$C = 1; // mainnet
 /*#__PURE__*/ defineChain({
     id: 478,
     name: 'Form Network',
@@ -3601,27 +3700,27 @@ const sourceId$B = 1; // mainnet
     contracts: {
         ...chainConfig$1.contracts,
         addressManager: {
-            [sourceId$B]: {
+            [sourceId$C]: {
                 address: '0x15c249E46A2F924C2dB3A1560CF86729bAD1f07B',
             },
         },
         l1CrossDomainMessenger: {
-            [sourceId$B]: {
+            [sourceId$C]: {
                 address: '0xF333158DCCad1dF6C3F0a3aEe8BC31fA94d9eD5c',
             },
         },
         l2OutputOracle: {
-            [sourceId$B]: {
+            [sourceId$C]: {
                 address: '0x4ccAAF69F41c5810cA875183648B577CaCf1F67E',
             },
         },
         portal: {
-            [sourceId$B]: {
+            [sourceId$C]: {
                 address: '0x4E259Ee5F4136408908160dD32295A5031Fa426F',
             },
         },
         l1StandardBridge: {
-            [sourceId$B]: {
+            [sourceId$C]: {
                 address: '0xdc20aA63D3DE59574E065957190D8f24e0F7B8Ba',
             },
         },
@@ -3629,10 +3728,10 @@ const sourceId$B = 1; // mainnet
             address: '0xcA11bde05977b3631167028862bE2a173976CA11',
         },
     },
-    sourceId: sourceId$B,
+    sourceId: sourceId$C,
 });
 
-const sourceId$A = 11_155_111; // sepolia
+const sourceId$B = 11_155_111; // sepolia
 /*#__PURE__*/ defineChain({
     id: 132_902,
     name: 'Form Testnet',
@@ -3656,27 +3755,27 @@ const sourceId$A = 11_155_111; // sepolia
     contracts: {
         ...chainConfig$1.contracts,
         addressManager: {
-            [sourceId$A]: {
+            [sourceId$B]: {
                 address: '0xd5C38fa934f7fd7477D4800F4f38a1c5BFdF1373',
             },
         },
         l1CrossDomainMessenger: {
-            [sourceId$A]: {
+            [sourceId$B]: {
                 address: '0x37A68565c4BE9700b3E3Ec60cC4416cAC3052FAa',
             },
         },
         l2OutputOracle: {
-            [sourceId$A]: {
+            [sourceId$B]: {
                 address: '0x9eA2239E65a59EC9C7F1ED4C116dD58Da71Fc1e2',
             },
         },
         portal: {
-            [sourceId$A]: {
+            [sourceId$B]: {
                 address: '0x60377e3cE15dF4CCA24c4beF076b60314240b032',
             },
         },
         l1StandardBridge: {
-            [sourceId$A]: {
+            [sourceId$B]: {
                 address: '0xD4531f633942b2725896F47cD2aFd260b44Ab1F7',
             },
         },
@@ -3685,10 +3784,10 @@ const sourceId$A = 11_155_111; // sepolia
         },
     },
     testnet: true,
-    sourceId: sourceId$A,
+    sourceId: sourceId$B,
 });
 
-const sourceId$z = 1; // mainnet
+const sourceId$A = 1; // mainnet
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 252,
@@ -3709,7 +3808,7 @@ const sourceId$z = 1; // mainnet
     contracts: {
         ...chainConfig$1.contracts,
         l2OutputOracle: {
-            [sourceId$z]: {
+            [sourceId$A]: {
                 address: '0x66CC916Ed5C6C2FA97014f7D1cD141528Ae171e4',
             },
         },
@@ -3717,22 +3816,22 @@ const sourceId$z = 1; // mainnet
             address: '0xca11bde05977b3631167028862be2a173976ca11',
         },
         portal: {
-            [sourceId$z]: {
+            [sourceId$A]: {
                 address: '0x36cb65c1967A0Fb0EEE11569C51C2f2aA1Ca6f6D',
                 blockCreated: 19135323,
             },
         },
         l1StandardBridge: {
-            [sourceId$z]: {
+            [sourceId$A]: {
                 address: '0x34C0bD5877A5Ee7099D0f5688D65F4bB9158BDE2',
                 blockCreated: 19135323,
             },
         },
     },
-    sourceId: sourceId$z,
+    sourceId: sourceId$A,
 });
 
-const sourceId$y = 17000; // holesky
+const sourceId$z = 17000; // holesky
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 2522,
@@ -3753,7 +3852,7 @@ const sourceId$y = 17000; // holesky
     contracts: {
         ...chainConfig$1.contracts,
         l2OutputOracle: {
-            [sourceId$y]: {
+            [sourceId$z]: {
                 address: '0x715EA64DA13F4d0831ece4Ad3E8c1aa013167F32',
             },
         },
@@ -3761,22 +3860,22 @@ const sourceId$y = 17000; // holesky
             address: '0xca11bde05977b3631167028862be2a173976ca11',
         },
         portal: {
-            [sourceId$y]: {
+            [sourceId$z]: {
                 address: '0xB9c64BfA498d5b9a8398Ed6f46eb76d90dE5505d',
                 blockCreated: 318416,
             },
         },
         l1StandardBridge: {
-            [sourceId$y]: {
+            [sourceId$z]: {
                 address: '0x0BaafC217162f64930909aD9f2B27125121d6332',
                 blockCreated: 318416,
             },
         },
     },
-    sourceId: sourceId$y,
+    sourceId: sourceId$z,
 });
 
-const sourceId$x = 1; // mainnet
+const sourceId$y = 1; // mainnet
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
     id: 33979,
@@ -3796,10 +3895,10 @@ const sourceId$x = 1; // mainnet
     contracts: {
         ...chainConfig$1.contracts,
     },
-    sourceId: sourceId$x,
+    sourceId: sourceId$y,
 });
 
-const sourceId$w = 11_155_111; // sepolia
+const sourceId$x = 11_155_111; // sepolia
 defineChain({
     ...chainConfig$1,
     id: 3397901,
@@ -3825,16 +3924,16 @@ defineChain({
             blockCreated: 1620204,
         },
     },
-    sourceId: sourceId$w,
+    sourceId: sourceId$x,
 });
 
-const sourceId$v = 17000; // Holesky testnet
+const sourceId$w = 17000; // Holesky testnet
 defineChain({
     ...chainConfig$1,
     name: 'Garnet Testnet',
     testnet: true,
     id: 17069,
-    sourceId: sourceId$v,
+    sourceId: sourceId$w,
     nativeCurrency: { name: 'Ether', symbol: 'ETH', decimals: 18 },
     rpcUrls: {
         default: {
@@ -3854,19 +3953,19 @@ defineChain({
             address: '0xca11bde05977b3631167028862be2a173976ca11',
         },
         portal: {
-            [sourceId$v]: {
+            [sourceId$w]: {
                 address: '0x57ee40586fbE286AfC75E67cb69511A6D9aF5909',
                 blockCreated: 1274684,
             },
         },
         l2OutputOracle: {
-            [sourceId$v]: {
+            [sourceId$w]: {
                 address: '0xCb8E7AC561b8EF04F2a15865e9fbc0766FEF569B',
                 blockCreated: 1274684,
             },
         },
         l1StandardBridge: {
-            [sourceId$v]: {
+            [sourceId$w]: {
                 address: '0x09bcDd311FE398F80a78BE37E489f5D440DB95DE',
                 blockCreated: 1274684,
             },
@@ -3874,6 +3973,52 @@ defineChain({
     },
 });
 
+const sourceId$v = 11_155_111; // sepolia
+/*#__PURE__*/ defineChain({
+    ...chainConfig$1,
+    id: 91342,
+    network: 'giwa-sepolia',
+    name: 'GIWA Sepolia',
+    nativeCurrency: { name: 'Sepolia Ether', symbol: 'ETH', decimals: 18 },
+    blockTime: 1_000,
+    rpcUrls: {
+        default: {
+            http: ['https://sepolia-rpc.giwa.io'],
+        },
+    },
+    blockExplorers: {
+        default: {
+            name: 'Blockscout',
+            url: 'https://sepolia-explorer.giwa.io',
+            apiUrl: 'https://sepolia-explorer.giwa.io/api',
+        },
+    },
+    contracts: {
+        ...chainConfig$1.contracts,
+        multicall3: {
+            address: '0xcA11bde05977b3631167028862bE2a173976CA11',
+            blockCreated: 0,
+        },
+        disputeGameFactory: {
+            [sourceId$v]: {
+                address: '0x37347caB2afaa49B776372279143D71ad1f354F6',
+            },
+        },
+        portal: {
+            [sourceId$v]: {
+                address: '0x956962C34687A954e611A83619ABaA37Ce6bC78A',
+            },
+        },
+        l1StandardBridge: {
+            [sourceId$v]: {
+                address: '0x77b2ffc0F57598cAe1DB76cb398059cF5d10A7E7',
+            },
+        },
+    },
+    testnet: true,
+    sourceId: sourceId$v,
+});
+
 const sourceId$u = 1; // mainnet
 /*#__PURE__*/ defineChain({
     ...chainConfig$1,
@@ -4226,9 +4371,9 @@ function encodeBytes(value, { param }) {
             encoded: concat([padHex(numberToHex(bytesSize, { size: 32 })), value_]),
         };
     }
-    if (bytesSize !== Number.parseInt(paramSize))
+    if (bytesSize !== Number.parseInt(paramSize, 10))
         throw new AbiEncodingBytesSizeMismatchError({
-            expectedSize: Number.parseInt(paramSize),
+            expectedSize: Number.parseInt(paramSize, 10),
             value,
         });
     return { dynamic: false, encoded: padHex(value, { dir: 'right' }) };
@@ -4538,6 +4683,25 @@ const sourceId$o = 11_155_111; // sepolia
     sourceId: sourceId$o,
 });
 
+defineChain({
+    id: 166,
+    name: 'Omni',
+    nativeCurrency: { name: 'Omni', symbol: 'OMNI', decimals: 18 },
+    rpcUrls: {
+        default: {
+            http: ['https://mainnet.omni.network'],
+            webSocket: ['wss://mainnet.omni.network'],
+        },
+    },
+    blockExplorers: {
+        default: {
+            name: 'OmniScan',
+            url: 'https://omniscan.network',
+        },
+    },
+    testnet: false,
+});
+
 const sourceId$n = 56; // bsc mainnet
 /*#__PURE__*/ defineChain({
     id: 204,
@@ -5357,6 +5521,7 @@ const sourceId$6 = 1; // mainnet
     id: 130,
     name: 'Unichain',
     nativeCurrency: { name: 'Ether', symbol: 'ETH', decimals: 18 },
+    blockTime: 1_000,
     rpcUrls: {
         default: {
             http: ['https://mainnet.unichain.org/'],
@@ -5404,6 +5569,7 @@ const sourceId$5 = 11_155_111; // sepolia
         symbol: 'ETH',
         decimals: 18,
     },
+    blockTime: 1_000,
     rpcUrls: {
         default: {
             http: ['https://sepolia.unichain.org'],
@@ -5686,8 +5852,8 @@ const sourceId = 5; // goerli
 });
 
 const FlaunchZapAddress = {
-    [base.id]: "0xe52dE1801C10cF709cc8e62d43D783AFe984b510",
-    [baseSepolia.id]: "0xf0Fd8Bb98c050607d999D6fFF9C617edD6673b75",
+    [base.id]: "0x39112541720078c70164EA4Deb61F0A4811910F9",
+    [baseSepolia.id]: "0x25b747aeca2612b9804b5c3bb272a3daefdc6eaa",
 };
 // only old V1.0: doesn't use FeeEscrow
 const FlaunchPositionManagerAddress = {
@@ -5756,13 +5922,17 @@ const AddressFeeSplitManagerAddress = {
     [base.id]: "0xfAB4BA48a322Efc8b25815448BE6018D211e89f3",
     [baseSepolia.id]: "0x0A3AF63cd86E68a852A1D4923FEfC4e855D8499d",
 };
+const DynamicAddressFeeSplitManagerAddress = {
+    [base.id]: "0x9b332EA14a99B74cAB03A3D3178964eD9CE35fc8",
+    [baseSepolia.id]: "0x4882075542626721C8743D80DC9528e2f54d8A46",
+};
 const StakingManagerAddress = {
     [base.id]: "0xec0069F8DBbbC94058dc895000dd38ef40b3125d",
     [baseSepolia.id]: "0xB8f1cb6B4Ff8f07149276bbfA617aed7bd32d20D",
 };
 const BuyBackManagerAddress = {
-    [base.id]: "0x3AAF3b1D8cD5b61C77f99bA7cdf41E9eC0Ba8a3f",
-    [baseSepolia.id]: "0xc3947EC9d687053bBA72b36Fd6b2567e775E82C7",
+    [base.id]: "0x18713855492A778363e23e2CdE325344b8fd6F8d",
+    [baseSepolia.id]: "0xA4A1a2Ca68151565d5200243a52EEBbCb2C878E0",
 };
 /** Verifiers */
 const TokenImporterAddress = {
@@ -5809,7 +5979,7 @@ const FeeEscrowAddress = {
     [baseSepolia.id]: "0x73E27908b7d35A9251a54799A8ef4C17e4ED9FF9",
 };
 const ReferralEscrowAddress = {
-    [base.id]: "0xBD39c7Be6D98BD1a3e4Ad482baF99d738947fE55",
+    [base.id]: "0xd381f8ea57df43c57cfe6e5b19a0a4700396f28c",
     [baseSepolia.id]: "0xd3d9047CaBE3346C70b510435866565176e8CE12",
 };
 const FLETHAddress = {
@@ -14399,6 +14569,92 @@ class ReadWriteFlaunchZap extends ReadFlaunchZap {
             tokenUri,
         });
     }
+    /**
+     * Flaunches a new token with the Dynamic Address Fee Split manager.
+     * Unlike static splits, recipient shares are mutable post-deployment.
+     * @param params - Parameters for the flaunch with dynamic split manager
+     * @returns Transaction response for the flaunch creation
+     */
+    async flaunchWithDynamicSplitManager(params) {
+        const VALID_SHARE_TOTAL = 10000000n;
+        if (params.moderator === viem.zeroAddress) {
+            throw new Error("Dynamic split moderator cannot be zero address");
+        }
+        if (params.creatorShare < 0n || params.managerOwnerShare < 0n) {
+            throw new Error("Creator and manager owner shares cannot be negative");
+        }
+        if (params.creatorShare + params.managerOwnerShare > VALID_SHARE_TOTAL) {
+            throw new Error("Creator and manager owner shares must be less than or equal to 100_00000");
+        }
+        const duplicateRecipients = new Set();
+        const recipientShares = params.splitReceivers.map((receiver) => {
+            if (receiver.address === viem.zeroAddress) {
+                throw new Error("Recipient address cannot be zero address");
+            }
+            if (receiver.share <= 0n) {
+                throw new Error("Recipient share must be greater than zero");
+            }
+            const normalizedAddress = viem.getAddress(receiver.address);
+            if (duplicateRecipients.has(normalizedAddress)) {
+                throw new Error("Duplicate recipient found in split receivers");
+            }
+            duplicateRecipients.add(normalizedAddress);
+            return {
+                recipient: normalizedAddress,
+                share: receiver.share,
+            };
+        });
+        const initializeData = viem.encodeAbiParameters([
+            {
+                type: "tuple",
+                name: "params",
+                components: [
+                    { type: "uint256", name: "creatorShare" },
+                    { type: "uint256", name: "ownerShare" },
+                    { type: "address", name: "moderator" },
+                    {
+                        type: "tuple[]",
+                        name: "recipientShares",
+                        components: [
+                            { type: "address", name: "recipient" },
+                            { type: "uint256", name: "share" },
+                        ],
+                    },
+                ],
+            },
+        ], [
+            {
+                creatorShare: params.creatorShare,
+                ownerShare: params.managerOwnerShare,
+                moderator: params.moderator,
+                recipientShares,
+            },
+        ]);
+        return this.flaunch({
+            ...params,
+            treasuryManagerParams: {
+                manager: DynamicAddressFeeSplitManagerAddress[this.chainId],
+                permissions: params.treasuryManagerParams?.permissions ?? exports.Permissions.OPEN,
+                initializeData,
+                depositData: "0x",
+            },
+        });
+    }
+    /**
+     * Flaunches a new token with dynamic split manager and stores metadata on IPFS.
+     * @param params - Parameters for dynamic split manager flow including IPFS metadata
+     * @returns Transaction response for the flaunch creation
+     */
+    async flaunchIPFSWithDynamicSplitManager(params) {
+        const tokenUri = await generateTokenUri(params.name, params.symbol, {
+            metadata: params.metadata,
+            pinataConfig: params.pinataConfig,
+        });
+        return this.flaunchWithDynamicSplitManager({
+            ...params,
+            tokenUri,
+        });
+    }
     /**
      * Deploys a new revenue manager
      * @param params - Parameters for deploying the revenue manager
@@ -26309,278 +26565,1770 @@ const chainIdToChain = {
     [baseSepolia.id]: baseSepolia,
 };
 
-const FastFlaunchZapAbi = [
+const DynamicAddressFeeSplitManagerAbi = [
     {
-        inputs: [
+        "type": "constructor",
+        "inputs": [
             {
-                internalType: "contract PositionManager",
-                name: "_positionManager",
-                type: "address",
+                "name": "_treasuryManagerFactory",
+                "type": "address",
+                "internalType": "address"
             },
+            {
+                "name": "_feeEscrowRegistry",
+                "type": "address",
+                "internalType": "address"
+            }
         ],
-        stateMutability: "nonpayable",
-        type: "constructor",
-    },
-    {
-        inputs: [],
-        name: "CREATOR_FEE_ALLOCATION",
-        outputs: [{ internalType: "uint24", name: "", type: "uint24" }],
-        stateMutability: "view",
-        type: "function",
-    },
-    {
-        inputs: [],
-        name: "FAIR_LAUNCH_SUPPLY",
-        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
-        stateMutability: "view",
-        type: "function",
+        "stateMutability": "nonpayable"
     },
     {
-        inputs: [],
-        name: "USDC_MARKET_CAP",
-        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
-        stateMutability: "view",
-        type: "function",
+        "type": "receive",
+        "stateMutability": "payable"
     },
     {
-        inputs: [
+        "type": "function",
+        "name": "MAX_CREATOR_SHARE",
+        "inputs": [],
+        "outputs": [
             {
-                components: [
-                    { internalType: "string", name: "name", type: "string" },
-                    { internalType: "string", name: "symbol", type: "string" },
-                    { internalType: "string", name: "tokenUri", type: "string" },
-                    { internalType: "address", name: "creator", type: "address" },
-                ],
-                internalType: "struct FastFlaunchZap.FastFlaunchParams",
-                name: "_params",
-                type: "tuple",
-            },
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "flaunch",
-        outputs: [{ internalType: "address", name: "memecoin_", type: "address" }],
-        stateMutability: "nonpayable",
-        type: "function",
+        "stateMutability": "view"
     },
     {
-        inputs: [],
-        name: "positionManager",
-        outputs: [
-            { internalType: "contract PositionManager", name: "", type: "address" },
+        "type": "function",
+        "name": "MAX_OWNER_SHARE",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        stateMutability: "view",
-        type: "function",
-    },
-];
-
-const FLETHAbi = [
-    {
-        inputs: [{ internalType: "uint256", name: "wethAmount", type: "uint256" }],
-        name: "deposit",
-        outputs: [],
-        stateMutability: "payable",
-        type: "function",
-    },
-    {
-        inputs: [{ internalType: "uint256", name: "amount", type: "uint256" }],
-        name: "withdraw",
-        outputs: [],
-        stateMutability: "nonpayable",
-        type: "function",
-    },
-    {
-        inputs: [{ internalType: "address", name: "account", type: "address" }],
-        name: "balanceOf",
-        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
-        stateMutability: "view",
-        type: "function",
-    },
-    {
-        inputs: [],
-        name: "totalSupply",
-        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
-        stateMutability: "view",
-        type: "function",
-    },
-    {
-        inputs: [],
-        name: "name",
-        outputs: [{ internalType: "string", name: "", type: "string" }],
-        stateMutability: "view",
-        type: "function",
-    },
-    {
-        inputs: [],
-        name: "symbol",
-        outputs: [{ internalType: "string", name: "", type: "string" }],
-        stateMutability: "view",
-        type: "function",
+        "stateMutability": "view"
     },
     {
-        inputs: [],
-        name: "decimals",
-        outputs: [{ internalType: "uint8", name: "", type: "uint8" }],
-        stateMutability: "view",
-        type: "function",
+        "type": "function",
+        "name": "VALID_SHARE_TOTAL",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
     },
-];
-
-const TrustedSignerFeeCalculatorAbi = [
     {
-        inputs: [
-            { internalType: "address", name: "_nativeToken", type: "address" },
-            { internalType: "address", name: "_positionManager", type: "address" },
+        "type": "function",
+        "name": "accumulatorPerShare",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        stateMutability: "nonpayable",
-        type: "constructor",
+        "stateMutability": "view"
     },
-    { inputs: [], name: "AlreadyInitialized", type: "error" },
-    { inputs: [], name: "CallerNotPositionManager", type: "error" },
     {
-        inputs: [{ internalType: "uint256", name: "_deadline", type: "uint256" }],
-        name: "DeadlineExpired",
-        type: "error",
+        "type": "function",
+        "name": "balances",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "balance_",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
     },
-    { inputs: [], name: "InvalidPoolKey", type: "error" },
     {
-        inputs: [
-            { internalType: "address", name: "_invalidSigner", type: "address" },
+        "type": "function",
+        "name": "claim",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "InvalidSigner",
-        type: "error",
+        "stateMutability": "nonpayable"
     },
-    { inputs: [], name: "NewOwnerIsZeroAddress", type: "error" },
-    { inputs: [], name: "NoHandoverRequest", type: "error" },
-    { inputs: [], name: "Reentrancy", type: "error" },
-    { inputs: [], name: "SignatureAlreadyUsed", type: "error" },
     {
-        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
-        name: "SignerAlreadyAdded",
-        type: "error",
+        "type": "function",
+        "name": "claim",
+        "inputs": [
+            {
+                "name": "_data",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "nonpayable"
     },
     {
-        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
-        name: "SignerDoesNotExist",
-        type: "error",
+        "type": "function",
+        "name": "claimableOwnerFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
     },
     {
-        inputs: [
-            { internalType: "uint256", name: "_requestedAmount", type: "uint256" },
-            { internalType: "uint256", name: "_maxTokensOut", type: "uint256" },
+        "type": "function",
+        "name": "creator",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "TransactionCapExceeded",
-        type: "error",
+        "outputs": [
+            {
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "stateMutability": "view"
     },
-    { inputs: [], name: "Unauthorized", type: "error" },
     {
-        anonymous: false,
-        inputs: [
+        "type": "function",
+        "name": "creatorFees",
+        "inputs": [],
+        "outputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "pendingOwner",
-                type: "address",
-            },
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "OwnershipHandoverCanceled",
-        type: "event",
+        "stateMutability": "view"
     },
     {
-        anonymous: false,
-        inputs: [
+        "type": "function",
+        "name": "creatorShare",
+        "inputs": [],
+        "outputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "pendingOwner",
-                type: "address",
-            },
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "OwnershipHandoverRequested",
-        type: "event",
+        "stateMutability": "view"
     },
     {
-        anonymous: false,
-        inputs: [
+        "type": "function",
+        "name": "creatorTotalClaimed",
+        "inputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "oldOwner",
-                type: "address",
-            },
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "newOwner",
-                type: "address",
-            },
+                "name": "_claimed",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "OwnershipTransferred",
-        type: "event",
+        "stateMutability": "view"
     },
     {
-        anonymous: false,
-        inputs: [
+        "type": "function",
+        "name": "deposit",
+        "inputs": [
             {
-                indexed: false,
-                internalType: "PoolId",
-                name: "_poolId",
-                type: "bytes32",
+                "name": "_flaunchToken",
+                "type": "tuple",
+                "internalType": "struct ITreasuryManager.FlaunchToken",
+                "components": [
+                    {
+                        "name": "flaunch",
+                        "type": "address",
+                        "internalType": "contract Flaunch"
+                    },
+                    {
+                        "name": "tokenId",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
             },
             {
-                components: [
-                    { internalType: "bool", name: "enabled", type: "bool" },
-                    { internalType: "uint256", name: "walletCap", type: "uint256" },
-                    { internalType: "uint256", name: "txCap", type: "uint256" },
-                ],
-                indexed: false,
-                internalType: "struct TrustedSignerFeeCalculator.FairLaunchSettings",
-                name: "_settings",
-                type: "tuple",
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address"
             },
+            {
+                "name": "_data",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
         ],
-        name: "PoolKeyFairLaunchSettingsUpdated",
-        type: "event",
+        "outputs": [],
+        "stateMutability": "nonpayable"
     },
     {
-        anonymous: false,
-        inputs: [
-            {
-                indexed: false,
-                internalType: "PoolId",
-                name: "_poolId",
-                type: "bytes32",
-            },
+        "type": "function",
+        "name": "feeEscrowRegistry",
+        "inputs": [],
+        "outputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "_signer",
-                type: "address",
-            },
+                "name": "",
+                "type": "address",
+                "internalType": "contract IFeeEscrowRegistry"
+            }
         ],
-        name: "PoolKeySignerUpdated",
-        type: "event",
+        "stateMutability": "view"
     },
     {
-        anonymous: false,
-        inputs: [
+        "type": "function",
+        "name": "flaunchTokenInternalIds",
+        "inputs": [
             {
-                indexed: true,
-                internalType: "address",
-                name: "_signer",
-                type: "address",
+                "name": "_flaunch",
+                "type": "address",
+                "internalType": "address"
             },
             {
-                indexed: false,
-                internalType: "bool",
-                name: "_isTrusted",
-                type: "bool",
-            },
+                "name": "_tokenId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
         ],
-        name: "TrustedSignerUpdated",
-        type: "event",
-    },
-    {
-        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
-        name: "addTrustedSigner",
+        "outputs": [
+            {
+                "name": "_internalId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "getCreatorFee",
+        "inputs": [
+            {
+                "name": "_amount",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "creatorFee_",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "getOwnerFee",
+        "inputs": [
+            {
+                "name": "_amount",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "ownerFee_",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "getPoolId",
+        "inputs": [
+            {
+                "name": "_flaunchToken",
+                "type": "tuple",
+                "internalType": "struct ITreasuryManager.FlaunchToken",
+                "components": [
+                    {
+                        "name": "flaunch",
+                        "type": "address",
+                        "internalType": "contract Flaunch"
+                    },
+                    {
+                        "name": "tokenId",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
+            }
+        ],
+        "outputs": [
+            {
+                "name": "poolId_",
+                "type": "bytes32",
+                "internalType": "PoolId"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "initialize",
+        "inputs": [
+            {
+                "name": "_owner",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "_data",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "initialized",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "bool",
+                "internalType": "bool"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "internalIds",
+        "inputs": [
+            {
+                "name": "_internalId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "flaunch",
+                "type": "address",
+                "internalType": "contract Flaunch"
+            },
+            {
+                "name": "tokenId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "isValidCreator",
+        "inputs": [
+            {
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "_data",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "",
+                "type": "bool",
+                "internalType": "bool"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "isValidRecipient",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "",
+                "type": "bool",
+                "internalType": "bool"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "lastProcessedManagerFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "managerFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "managerOwner",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "moderator",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "nextInternalId",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "ownerFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "ownerShare",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "pendingCreatorFees",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "balance_",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "pendingOwnerFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "permissions",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "address",
+                "internalType": "contract IManagerPermissions"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "recipientAt",
+        "inputs": [
+            {
+                "name": "_index",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "recipientCount",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "recipientShare",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "recipients",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "share",
+                "type": "uint256",
+                "internalType": "uint256"
+            },
+            {
+                "name": "debtPerShare",
+                "type": "uint256",
+                "internalType": "uint256"
+            },
+            {
+                "name": "snapshotBalance",
+                "type": "uint256",
+                "internalType": "uint256"
+            },
+            {
+                "name": "claimed",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "rescue",
+        "inputs": [
+            {
+                "name": "_flaunchToken",
+                "type": "tuple",
+                "internalType": "struct ITreasuryManager.FlaunchToken",
+                "components": [
+                    {
+                        "name": "flaunch",
+                        "type": "address",
+                        "internalType": "contract Flaunch"
+                    },
+                    {
+                        "name": "tokenId",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
+            },
+            {
+                "name": "_recipient",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "setCreator",
+        "inputs": [
+            {
+                "name": "_flaunchToken",
+                "type": "tuple",
+                "internalType": "struct ITreasuryManager.FlaunchToken",
+                "components": [
+                    {
+                        "name": "flaunch",
+                        "type": "address",
+                        "internalType": "contract Flaunch"
+                    },
+                    {
+                        "name": "tokenId",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
+            },
+            {
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address payable"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "setModerator",
+        "inputs": [
+            {
+                "name": "_moderator",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "setPermissions",
+        "inputs": [
+            {
+                "name": "_permissions",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "splitFees",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "tokenPoolId",
+        "inputs": [
+            {
+                "name": "_internalId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "_poolId",
+                "type": "bytes32",
+                "internalType": "PoolId"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "tokenTimelock",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "_unlockedAt",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "tokenTotalClaimed",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "_claimed",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "tokens",
+        "inputs": [
+            {
+                "name": "_creator",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [
+            {
+                "name": "flaunchTokens_",
+                "type": "tuple[]",
+                "internalType": "struct ITreasuryManager.FlaunchToken[]",
+                "components": [
+                    {
+                        "name": "flaunch",
+                        "type": "address",
+                        "internalType": "contract Flaunch"
+                    },
+                    {
+                        "name": "tokenId",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "totalActiveShares",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "transferManagerOwnership",
+        "inputs": [
+            {
+                "name": "_newManagerOwner",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "transferRecipientShare",
+        "inputs": [
+            {
+                "name": "_newRecipient",
+                "type": "address",
+                "internalType": "address"
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "function",
+        "name": "treasuryManagerFactory",
+        "inputs": [],
+        "outputs": [
+            {
+                "name": "",
+                "type": "address",
+                "internalType": "contract TreasuryManagerFactory"
+            }
+        ],
+        "stateMutability": "view"
+    },
+    {
+        "type": "function",
+        "name": "updateRecipients",
+        "inputs": [
+            {
+                "name": "_recipients",
+                "type": "tuple[]",
+                "internalType": "struct DynamicAddressFeeSplitManager.RecipientShare[]",
+                "components": [
+                    {
+                        "name": "recipient",
+                        "type": "address",
+                        "internalType": "address"
+                    },
+                    {
+                        "name": "share",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    }
+                ]
+            }
+        ],
+        "outputs": [],
+        "stateMutability": "nonpayable"
+    },
+    {
+        "type": "event",
+        "name": "CreatorShareInitialized",
+        "inputs": [
+            {
+                "name": "_creatorShare",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "CreatorUpdated",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "indexed": true,
+                "internalType": "uint256"
+            },
+            {
+                "name": "_creator",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "ETHReceivedFromUnknownSource",
+        "inputs": [
+            {
+                "name": "_sender",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_amount",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "ManagerInitialized",
+        "inputs": [
+            {
+                "name": "_owner",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            },
+            {
+                "name": "_params",
+                "type": "tuple",
+                "indexed": false,
+                "internalType": "struct DynamicAddressFeeSplitManager.InitializeParams",
+                "components": [
+                    {
+                        "name": "creatorShare",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    },
+                    {
+                        "name": "ownerShare",
+                        "type": "uint256",
+                        "internalType": "uint256"
+                    },
+                    {
+                        "name": "moderator",
+                        "type": "address",
+                        "internalType": "address"
+                    },
+                    {
+                        "name": "recipientShares",
+                        "type": "tuple[]",
+                        "internalType": "struct DynamicAddressFeeSplitManager.RecipientShare[]",
+                        "components": [
+                            {
+                                "name": "recipient",
+                                "type": "address",
+                                "internalType": "address"
+                            },
+                            {
+                                "name": "share",
+                                "type": "uint256",
+                                "internalType": "uint256"
+                            }
+                        ]
+                    }
+                ]
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "ManagerOwnershipTransferred",
+        "inputs": [
+            {
+                "name": "_previousOwner",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_newOwner",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "ModeratorUpdated",
+        "inputs": [
+            {
+                "name": "_oldModerator",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_newModerator",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "OwnerShareInitialized",
+        "inputs": [
+            {
+                "name": "_ownerShare",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "PermissionsUpdated",
+        "inputs": [
+            {
+                "name": "_permissions",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RecipientAdded",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_share",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RecipientRemoved",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_snapshotBalance",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RecipientShareTransferred",
+        "inputs": [
+            {
+                "name": "_oldRecipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_newRecipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_share",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RecipientShareUpdated",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_oldShare",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            },
+            {
+                "name": "_newShare",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RevenueClaimed",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_amountClaimed",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "RoundingDustAllocated",
+        "inputs": [
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_amount",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "TreasuryEscrowed",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "indexed": true,
+                "internalType": "uint256"
+            },
+            {
+                "name": "_owner",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            },
+            {
+                "name": "_sender",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "TreasuryReclaimed",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "indexed": true,
+                "internalType": "uint256"
+            },
+            {
+                "name": "_sender",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            },
+            {
+                "name": "_recipient",
+                "type": "address",
+                "indexed": false,
+                "internalType": "address"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "event",
+        "name": "TreasuryTimelocked",
+        "inputs": [
+            {
+                "name": "_flaunch",
+                "type": "address",
+                "indexed": true,
+                "internalType": "address"
+            },
+            {
+                "name": "_tokenId",
+                "type": "uint256",
+                "indexed": true,
+                "internalType": "uint256"
+            },
+            {
+                "name": "_unlockedAt",
+                "type": "uint256",
+                "indexed": false,
+                "internalType": "uint256"
+            }
+        ],
+        "anonymous": false
+    },
+    {
+        "type": "error",
+        "name": "AlreadyDeposited",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "AlreadyInitialized",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "CreatorShareAlreadyInitialized",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "FlaunchContractNotValid",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InsufficientSharesToTransfer",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidClaimer",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidCreator",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidCreatorAddress",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidCreatorShare",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidOwnerShare",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidRecipient",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidRecipientShareTotal",
+        "inputs": [
+            {
+                "name": "_share",
+                "type": "uint256",
+                "internalType": "uint256"
+            },
+            {
+                "name": "_validShare",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ]
+    },
+    {
+        "type": "error",
+        "name": "InvalidShareAmount",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidShareTotal",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "InvalidShareTransferRecipient",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "NotInitialized",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "NotManagerOwner",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "NotOwnerOrModerator",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "OwnerShareAlreadyInitialized",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "RecipientAlreadyActive",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "RecipientNotActive",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "Reentrancy",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "TokenTimelocked",
+        "inputs": [
+            {
+                "name": "_unlockedAt",
+                "type": "uint256",
+                "internalType": "uint256"
+            }
+        ]
+    },
+    {
+        "type": "error",
+        "name": "UnableToSendRevenue",
+        "inputs": [
+            {
+                "name": "_reason",
+                "type": "bytes",
+                "internalType": "bytes"
+            }
+        ]
+    },
+    {
+        "type": "error",
+        "name": "UnknownFlaunchToken",
+        "inputs": []
+    },
+    {
+        "type": "error",
+        "name": "UnknownPoolId",
+        "inputs": []
+    }
+];
+
+const FastFlaunchZapAbi = [
+    {
+        inputs: [
+            {
+                internalType: "contract PositionManager",
+                name: "_positionManager",
+                type: "address",
+            },
+        ],
+        stateMutability: "nonpayable",
+        type: "constructor",
+    },
+    {
+        inputs: [],
+        name: "CREATOR_FEE_ALLOCATION",
+        outputs: [{ internalType: "uint24", name: "", type: "uint24" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "FAIR_LAUNCH_SUPPLY",
+        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "USDC_MARKET_CAP",
+        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [
+            {
+                components: [
+                    { internalType: "string", name: "name", type: "string" },
+                    { internalType: "string", name: "symbol", type: "string" },
+                    { internalType: "string", name: "tokenUri", type: "string" },
+                    { internalType: "address", name: "creator", type: "address" },
+                ],
+                internalType: "struct FastFlaunchZap.FastFlaunchParams",
+                name: "_params",
+                type: "tuple",
+            },
+        ],
+        name: "flaunch",
+        outputs: [{ internalType: "address", name: "memecoin_", type: "address" }],
+        stateMutability: "nonpayable",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "positionManager",
+        outputs: [
+            { internalType: "contract PositionManager", name: "", type: "address" },
+        ],
+        stateMutability: "view",
+        type: "function",
+    },
+];
+
+const FLETHAbi = [
+    {
+        inputs: [{ internalType: "uint256", name: "wethAmount", type: "uint256" }],
+        name: "deposit",
+        outputs: [],
+        stateMutability: "payable",
+        type: "function",
+    },
+    {
+        inputs: [{ internalType: "uint256", name: "amount", type: "uint256" }],
+        name: "withdraw",
+        outputs: [],
+        stateMutability: "nonpayable",
+        type: "function",
+    },
+    {
+        inputs: [{ internalType: "address", name: "account", type: "address" }],
+        name: "balanceOf",
+        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "totalSupply",
+        outputs: [{ internalType: "uint256", name: "", type: "uint256" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "name",
+        outputs: [{ internalType: "string", name: "", type: "string" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "symbol",
+        outputs: [{ internalType: "string", name: "", type: "string" }],
+        stateMutability: "view",
+        type: "function",
+    },
+    {
+        inputs: [],
+        name: "decimals",
+        outputs: [{ internalType: "uint8", name: "", type: "uint8" }],
+        stateMutability: "view",
+        type: "function",
+    },
+];
+
+const TrustedSignerFeeCalculatorAbi = [
+    {
+        inputs: [
+            { internalType: "address", name: "_nativeToken", type: "address" },
+            { internalType: "address", name: "_positionManager", type: "address" },
+        ],
+        stateMutability: "nonpayable",
+        type: "constructor",
+    },
+    { inputs: [], name: "AlreadyInitialized", type: "error" },
+    { inputs: [], name: "CallerNotPositionManager", type: "error" },
+    {
+        inputs: [{ internalType: "uint256", name: "_deadline", type: "uint256" }],
+        name: "DeadlineExpired",
+        type: "error",
+    },
+    { inputs: [], name: "InvalidPoolKey", type: "error" },
+    {
+        inputs: [
+            { internalType: "address", name: "_invalidSigner", type: "address" },
+        ],
+        name: "InvalidSigner",
+        type: "error",
+    },
+    { inputs: [], name: "NewOwnerIsZeroAddress", type: "error" },
+    { inputs: [], name: "NoHandoverRequest", type: "error" },
+    { inputs: [], name: "Reentrancy", type: "error" },
+    { inputs: [], name: "SignatureAlreadyUsed", type: "error" },
+    {
+        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
+        name: "SignerAlreadyAdded",
+        type: "error",
+    },
+    {
+        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
+        name: "SignerDoesNotExist",
+        type: "error",
+    },
+    {
+        inputs: [
+            { internalType: "uint256", name: "_requestedAmount", type: "uint256" },
+            { internalType: "uint256", name: "_maxTokensOut", type: "uint256" },
+        ],
+        name: "TransactionCapExceeded",
+        type: "error",
+    },
+    { inputs: [], name: "Unauthorized", type: "error" },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: true,
+                internalType: "address",
+                name: "pendingOwner",
+                type: "address",
+            },
+        ],
+        name: "OwnershipHandoverCanceled",
+        type: "event",
+    },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: true,
+                internalType: "address",
+                name: "pendingOwner",
+                type: "address",
+            },
+        ],
+        name: "OwnershipHandoverRequested",
+        type: "event",
+    },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: true,
+                internalType: "address",
+                name: "oldOwner",
+                type: "address",
+            },
+            {
+                indexed: true,
+                internalType: "address",
+                name: "newOwner",
+                type: "address",
+            },
+        ],
+        name: "OwnershipTransferred",
+        type: "event",
+    },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: false,
+                internalType: "PoolId",
+                name: "_poolId",
+                type: "bytes32",
+            },
+            {
+                components: [
+                    { internalType: "bool", name: "enabled", type: "bool" },
+                    { internalType: "uint256", name: "walletCap", type: "uint256" },
+                    { internalType: "uint256", name: "txCap", type: "uint256" },
+                ],
+                indexed: false,
+                internalType: "struct TrustedSignerFeeCalculator.FairLaunchSettings",
+                name: "_settings",
+                type: "tuple",
+            },
+        ],
+        name: "PoolKeyFairLaunchSettingsUpdated",
+        type: "event",
+    },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: false,
+                internalType: "PoolId",
+                name: "_poolId",
+                type: "bytes32",
+            },
+            {
+                indexed: true,
+                internalType: "address",
+                name: "_signer",
+                type: "address",
+            },
+        ],
+        name: "PoolKeySignerUpdated",
+        type: "event",
+    },
+    {
+        anonymous: false,
+        inputs: [
+            {
+                indexed: true,
+                internalType: "address",
+                name: "_signer",
+                type: "address",
+            },
+            {
+                indexed: false,
+                internalType: "bool",
+                name: "_isTrusted",
+                type: "bool",
+            },
+        ],
+        name: "TrustedSignerUpdated",
+        type: "event",
+    },
+    {
+        inputs: [{ internalType: "address", name: "_signer", type: "address" }],
+        name: "addTrustedSigner",
         outputs: [],
         stateMutability: "nonpayable",
         type: "function",
@@ -28291,6 +30039,22 @@ class ReadWriteFlaunchSDK extends ReadFlaunchSDK {
     flaunchIPFSWithSplitManager(params) {
         return this.readWriteFlaunchZap.flaunchIPFSWithSplitManager(params);
     }
+    /**
+     * Creates a new Flaunch with dynamic split manager configuration.
+     * @param params - Parameters for creating the Flaunch with dynamic split manager
+     * @returns Transaction response
+     */
+    flaunchWithDynamicSplitManager(params) {
+        return this.readWriteFlaunchZap.flaunchWithDynamicSplitManager(params);
+    }
+    /**
+     * Creates a new Flaunch with dynamic split manager configuration and IPFS metadata.
+     * @param params - Parameters for creating the Flaunch with dynamic split manager and IPFS data
+     * @returns Transaction response
+     */
+    flaunchIPFSWithDynamicSplitManager(params) {
+        return this.readWriteFlaunchZap.flaunchIPFSWithDynamicSplitManager(params);
+    }
     /**
      * Creates a new Flaunch with AnyPositionManager for external coins
      * @param params - Parameters for creating the Flaunch with AnyPositionManager
@@ -29271,6 +31035,148 @@ class ReadWriteFlaunchSDK extends ReadFlaunchSDK {
     }
 }
 
+class ReadDynamicAddressFeeSplitManager {
+    constructor(address, drift$1 = drift.createDrift()) {
+        if (!address) {
+            throw new Error("Address is required");
+        }
+        this.contract = drift$1.contract({
+            abi: DynamicAddressFeeSplitManagerAbi,
+            address,
+        });
+    }
+    permissions() {
+        return this.contract.read("permissions");
+    }
+    managerOwner() {
+        return this.contract.read("managerOwner");
+    }
+    moderator() {
+        return this.contract.read("moderator");
+    }
+    creatorShare() {
+        return this.contract.read("creatorShare");
+    }
+    ownerShare() {
+        return this.contract.read("ownerShare");
+    }
+    totalActiveShares() {
+        return this.contract.read("totalActiveShares");
+    }
+    accumulatorPerShare() {
+        return this.contract.read("accumulatorPerShare");
+    }
+    lastProcessedManagerFees() {
+        return this.contract.read("lastProcessedManagerFees");
+    }
+    recipientCount() {
+        return this.contract.read("recipientCount");
+    }
+    recipientAt(index) {
+        return this.contract.read("recipientAt", {
+            _index: index,
+        });
+    }
+    recipients(recipient) {
+        return this.contract.read("recipients", {
+            _recipient: recipient,
+        });
+    }
+    balances(recipient) {
+        return this.contract.read("balances", {
+            _recipient: recipient,
+        });
+    }
+    recipientShare(recipient, data = "0x") {
+        return this.contract.read("recipientShare", {
+            _recipient: recipient,
+            1: data,
+        });
+    }
+    pendingCreatorFees(recipient) {
+        return this.contract.read("pendingCreatorFees", {
+            _recipient: recipient,
+        });
+    }
+    pendingOwnerFees() {
+        return this.contract.read("pendingOwnerFees");
+    }
+    claimableOwnerFees() {
+        return this.contract.read("claimableOwnerFees");
+    }
+    async allRecipients(includeInactive = false) {
+        const count = await this.recipientCount();
+        const recipients = await Promise.all(Array.from({ length: Number(count) }, (_, i) => this.recipientAt(BigInt(i))));
+        if (includeInactive) {
+            return recipients;
+        }
+        const recipientData = await Promise.all(recipients.map(async (recipient) => ({
+            recipient,
+            data: await this.recipients(recipient),
+        })));
+        return recipientData
+            .filter(({ data }) => data.share > 0n)
+            .map(({ recipient }) => recipient);
+    }
+}
+class ReadWriteDynamicAddressFeeSplitManager extends ReadDynamicAddressFeeSplitManager {
+    constructor(address, drift$1 = drift.createDrift()) {
+        super(address, drift$1);
+    }
+    setPermissions(permissions) {
+        return this.contract.write("setPermissions", {
+            _permissions: permissions,
+        });
+    }
+    transferManagerOwnership(newManagerOwner) {
+        return this.contract.write("transferManagerOwnership", {
+            _newManagerOwner: newManagerOwner,
+        });
+    }
+    setModerator(moderator) {
+        return this.contract.write("setModerator", {
+            _moderator: moderator,
+        });
+    }
+    updateRecipients(recipients) {
+        return this.contract.write("updateRecipients", {
+            _recipients: recipients,
+        });
+    }
+    transferRecipientShare(newRecipient) {
+        return this.contract.write("transferRecipientShare", {
+            _newRecipient: newRecipient,
+        });
+    }
+    claim() {
+        return this.contract.write("claim", {});
+    }
+    claimForData(data) {
+        return this.contract.write("claim", {
+            _data: data,
+        });
+    }
+    deposit(flaunchToken, creator, data) {
+        return this.contract.write("deposit", {
+            _flaunchToken: flaunchToken,
+            _creator: creator,
+            _data: data,
+        });
+    }
+    setCreator(flaunchToken, creator) {
+        return this.contract.write("setCreator", {
+            _flaunchToken: flaunchToken,
+            _creator: creator,
+        });
+    }
+    rescue(flaunchToken, recipient) {
+        return this.contract.write("rescue", {
+            _flaunchToken: flaunchToken,
+            _recipient: recipient,
+        });
+    }
+}
+
 /**
  * Creates a Drift instance with the provided clients
  * @param params - Parameters for creating the Drift instance
@@ -29441,103 +31347,6 @@ async function parseCall(sdkMethod) {
     return decodeCallData(encodedCall);
 }
 
-/**
- * HMAC: RFC2104 message authentication code.
- * @module
- */
-class HMAC extends Hash {
-    constructor(hash, _key) {
-        super();
-        this.finished = false;
-        this.destroyed = false;
-        ahash(hash);
-        const key = toBytes(_key);
-        this.iHash = hash.create();
-        if (typeof this.iHash.update !== 'function')
-            throw new Error('Expected instance of class which extends utils.Hash');
-        this.blockLen = this.iHash.blockLen;
-        this.outputLen = this.iHash.outputLen;
-        const blockLen = this.blockLen;
-        const pad = new Uint8Array(blockLen);
-        // blockLen can be bigger than outputLen
-        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
-        for (let i = 0; i < pad.length; i++)
-            pad[i] ^= 0x36;
-        this.iHash.update(pad);
-        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
-        this.oHash = hash.create();
-        // Undo internal XOR && apply outer XOR
-        for (let i = 0; i < pad.length; i++)
-            pad[i] ^= 0x36 ^ 0x5c;
-        this.oHash.update(pad);
-        pad.fill(0);
-    }
-    update(buf) {
-        aexists(this);
-        this.iHash.update(buf);
-        return this;
-    }
-    digestInto(out) {
-        aexists(this);
-        abytes$2(out, this.outputLen);
-        this.finished = true;
-        this.iHash.digestInto(out);
-        this.oHash.update(out);
-        this.oHash.digestInto(out);
-        this.destroy();
-    }
-    digest() {
-        const out = new Uint8Array(this.oHash.outputLen);
-        this.digestInto(out);
-        return out;
-    }
-    _cloneInto(to) {
-        // Create new instance without calling constructor since key already in state and we don't know it.
-        to || (to = Object.create(Object.getPrototypeOf(this), {}));
-        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-        to = to;
-        to.finished = finished;
-        to.destroyed = destroyed;
-        to.blockLen = blockLen;
-        to.outputLen = outputLen;
-        to.oHash = oHash._cloneInto(to.oHash);
-        to.iHash = iHash._cloneInto(to.iHash);
-        return to;
-    }
-    destroy() {
-        this.destroyed = true;
-        this.oHash.destroy();
-        this.iHash.destroy();
-    }
-}
-/**
- * HMAC: RFC2104 message authentication code.
- * @param hash - function that would be used e.g. sha256
- * @param key - message key
- * @param message - message data
- * @example
- * import { hmac } from '@noble/hashes/hmac';
- * import { sha256 } from '@noble/hashes/sha2';
- * const mac1 = hmac(sha256, 'key', 'message');
- */
-const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
-hmac.create = (hash, key) => new HMAC(hash, key);
-
-/**
- * RIPEMD-160 legacy hash function.
- * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html
- * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf
- * @module
- */
-const Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);
-const Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));
-const Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);
-let idxL = [Id];
-let idxR = [Pi];
-for (let i = 0; i < 4; i++)
-    for (let j of [idxL, idxR])
-        j.push(j[i].map((k) => Rho[k]));
-
 /**
  * Hex, bytes and number utilities.
  * @module
@@ -29547,7 +31356,7 @@ for (let i = 0; i < 4; i++)
 // This is OK: `abstract` directory does not use noble-hashes.
 // User may opt-in into using different hashing library. This way, noble-hashes
 // won't be included into their bundle.
-const _0n$3 = /* @__PURE__ */ BigInt(0);
+const _0n$4 = /* @__PURE__ */ BigInt(0);
 const _1n$4 = /* @__PURE__ */ BigInt(1);
 function isBytes$1(a) {
     return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');
@@ -29560,6 +31369,7 @@ function abool(title, value) {
     if (typeof value !== 'boolean')
         throw new Error(title + ' boolean expected, got ' + value);
 }
+// Used in weierstrass, der
 function numberToHexUnpadded(num) {
     const hex = num.toString(16);
     return hex.length & 1 ? '0' + hex : hex;
@@ -29567,7 +31377,7 @@ function numberToHexUnpadded(num) {
 function hexToNumber(hex) {
     if (typeof hex !== 'string')
         throw new Error('hex string expected, got ' + typeof hex);
-    return hex === '' ? _0n$3 : BigInt('0x' + hex); // Big Endian
+    return hex === '' ? _0n$4 : BigInt('0x' + hex); // Big Endian
 }
 // Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex
 const hasHexBuiltin$1 = 
@@ -29693,7 +31503,7 @@ function concatBytes(...arrays) {
     return res;
 }
 // Is positive bigint
-const isPosBig = (n) => typeof n === 'bigint' && _0n$3 <= n;
+const isPosBig = (n) => typeof n === 'bigint' && _0n$4 <= n;
 function inRange(n, min, max) {
     return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;
 }
@@ -29715,10 +31525,11 @@ function aInRange(title, n, min, max) {
 /**
  * Calculates amount of bits in a bigint.
  * Same as `n.toString(2).length`
+ * TODO: merge with nLength in modular
  */
 function bitLen(n) {
     let len;
-    for (len = 0; n > _0n$3; n >>= _1n$4, len += 1)
+    for (len = 0; n > _0n$4; n >>= _1n$4, len += 1)
         ;
     return len;
 }
@@ -29842,41 +31653,18 @@ function memoized(fn) {
  * @module
  */
 // prettier-ignore
-const _0n$2 = BigInt(0), _1n$3 = BigInt(1), _2n$1 = /* @__PURE__ */ BigInt(2), _3n$1 = /* @__PURE__ */ BigInt(3);
+const _0n$3 = BigInt(0), _1n$3 = BigInt(1), _2n$1 = /* @__PURE__ */ BigInt(2), _3n$1 = /* @__PURE__ */ BigInt(3);
 // prettier-ignore
-const _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);
+const _4n$1 = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);
 // Calculates a modulo b
 function mod(a, b) {
     const result = a % b;
-    return result >= _0n$2 ? result : b + result;
-}
-/**
- * Efficiently raise num to power and do modular division.
- * Unsafe in some contexts: uses ladder, so can expose bigint bits.
- * @todo use field version && remove
- * @example
- * pow(2n, 6n, 11n) // 64n % 11n == 9n
- */
-function pow(num, power, modulo) {
-    if (power < _0n$2)
-        throw new Error('invalid exponent, negatives unsupported');
-    if (modulo <= _0n$2)
-        throw new Error('invalid modulus');
-    if (modulo === _1n$3)
-        return _0n$2;
-    let res = _1n$3;
-    while (power > _0n$2) {
-        if (power & _1n$3)
-            res = (res * num) % modulo;
-        num = (num * num) % modulo;
-        power >>= _1n$3;
-    }
-    return res;
+    return result >= _0n$3 ? result : b + result;
 }
 /** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */
 function pow2(x, power, modulo) {
     let res = x;
-    while (power-- > _0n$2) {
+    while (power-- > _0n$3) {
         res *= res;
         res %= modulo;
     }
@@ -29887,16 +31675,16 @@ function pow2(x, power, modulo) {
  * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).
  */
 function invert(number, modulo) {
-    if (number === _0n$2)
+    if (number === _0n$3)
         throw new Error('invert: expected non-zero number');
-    if (modulo <= _0n$2)
+    if (modulo <= _0n$3)
         throw new Error('invert: expected positive modulus, got ' + modulo);
     // Fermat's little theorem "CT-like" version inv(n) = n^(m-2) mod m is 30x slower.
     let a = mod(number, modulo);
     let b = modulo;
     // prettier-ignore
-    let x = _0n$2, u = _1n$3;
-    while (a !== _0n$2) {
+    let x = _0n$3, u = _1n$3;
+    while (a !== _0n$3) {
         // JIT applies optimization if those two lines follow each other
         const q = b / a;
         const r = b % a;
@@ -29909,116 +31697,141 @@ function invert(number, modulo) {
         throw new Error('invert: does not exist');
     return mod(x, modulo);
 }
+// Not all roots are possible! Example which will throw:
+// const NUM =
+// n = 72057594037927816n;
+// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));
+function sqrt3mod4(Fp, n) {
+    const p1div4 = (Fp.ORDER + _1n$3) / _4n$1;
+    const root = Fp.pow(n, p1div4);
+    // Throw if root^2 != n
+    if (!Fp.eql(Fp.sqr(root), n))
+        throw new Error('Cannot find square root');
+    return root;
+}
+function sqrt5mod8(Fp, n) {
+    const p5div8 = (Fp.ORDER - _5n) / _8n;
+    const n2 = Fp.mul(n, _2n$1);
+    const v = Fp.pow(n2, p5div8);
+    const nv = Fp.mul(n, v);
+    const i = Fp.mul(Fp.mul(nv, _2n$1), v);
+    const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));
+    if (!Fp.eql(Fp.sqr(root), n))
+        throw new Error('Cannot find square root');
+    return root;
+}
+// TODO: Commented-out for now. Provide test vectors.
+// Tonelli is too slow for extension fields Fp2.
+// That means we can't use sqrt (c1, c2...) even for initialization constants.
+// if (P % _16n === _9n) return sqrt9mod16;
+// // prettier-ignore
+// function sqrt9mod16<T>(Fp: IField<T>, n: T, p7div16?: bigint) {
+//   if (p7div16 === undefined) p7div16 = (Fp.ORDER + BigInt(7)) / _16n;
+//   const c1 = Fp.sqrt(Fp.neg(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F
+//   const c2 = Fp.sqrt(c1);             //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F
+//   const c3 = Fp.sqrt(Fp.neg(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F
+//   const c4 = p7div16;                 //  4. c4 = (q + 7) / 16        # Integer arithmetic
+//   let tv1 = Fp.pow(n, c4);            //  1. tv1 = x^c4
+//   let tv2 = Fp.mul(c1, tv1);          //  2. tv2 = c1 * tv1
+//   const tv3 = Fp.mul(c2, tv1);        //  3. tv3 = c2 * tv1
+//   let tv4 = Fp.mul(c3, tv1);          //  4. tv4 = c3 * tv1
+//   const e1 = Fp.eql(Fp.sqr(tv2), n);  //  5.  e1 = (tv2^2) == x
+//   const e2 = Fp.eql(Fp.sqr(tv3), n);  //  6.  e2 = (tv3^2) == x
+//   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x
+//   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x
+//   const e3 = Fp.eql(Fp.sqr(tv2), n);  //  9.  e3 = (tv2^2) == x
+//   return Fp.cmov(tv1, tv2, e3); // 10.  z = CMOV(tv1, tv2, e3) # Select the sqrt from tv1 and tv2
+// }
 /**
  * Tonelli-Shanks square root search algorithm.
  * 1. https://eprint.iacr.org/2012/685.pdf (page 12)
  * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks
- * Will start an infinite loop if field order P is not prime.
  * @param P field order
  * @returns function that takes field Fp (created from P) and number n
  */
 function tonelliShanks(P) {
-    // Legendre constant: used to calculate Legendre symbol (a | p),
-    // which denotes the value of a^((p-1)/2) (mod p).
-    // (a | p) ≡ 1    if a is a square (mod p)
-    // (a | p) ≡ -1   if a is not a square (mod p)
-    // (a | p) ≡ 0    if a ≡ 0 (mod p)
-    const legendreC = (P - _1n$3) / _2n$1;
-    let Q, S, Z;
-    // Step 1: By factoring out powers of 2 from p - 1,
-    // find q and s such that p - 1 = q*(2^s) with q odd
-    for (Q = P - _1n$3, S = 0; Q % _2n$1 === _0n$2; Q /= _2n$1, S++)
-        ;
-    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq
-    for (Z = _2n$1; Z < P && pow(Z, legendreC, P) !== P - _1n$3; Z++) {
-        // Crash instead of infinity loop, we cannot reasonable count until P.
-        if (Z > 1000)
-            throw new Error('Cannot find square root: likely non-prime P');
-    }
-    // Fast-path
-    if (S === 1) {
-        const p1div4 = (P + _1n$3) / _4n;
-        return function tonelliFast(Fp, n) {
-            const root = Fp.pow(n, p1div4);
-            if (!Fp.eql(Fp.sqr(root), n))
-                throw new Error('Cannot find square root');
-            return root;
-        };
-    }
+    // Initialization (precomputation).
+    if (P < BigInt(3))
+        throw new Error('sqrt is not defined for small field');
+    // Factor P - 1 = Q * 2^S, where Q is odd
+    let Q = P - _1n$3;
+    let S = 0;
+    while (Q % _2n$1 === _0n$3) {
+        Q /= _2n$1;
+        S++;
+    }
+    // Find the first quadratic non-residue Z >= 2
+    let Z = _2n$1;
+    const _Fp = Field(P);
+    while (FpLegendre(_Fp, Z) === 1) {
+        // Basic primality test for P. After x iterations, chance of
+        // not finding quadratic non-residue is 2^x, so 2^1000.
+        if (Z++ > 1000)
+            throw new Error('Cannot find square root: probably non-prime P');
+    }
+    // Fast-path; usually done before Z, but we do "primality test".
+    if (S === 1)
+        return sqrt3mod4;
     // Slow-path
+    // TODO: test on Fp2 and others
+    let cc = _Fp.pow(Z, Q); // c = z^Q
     const Q1div2 = (Q + _1n$3) / _2n$1;
     return function tonelliSlow(Fp, n) {
-        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1
-        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))
+        if (Fp.is0(n))
+            return n;
+        // Check if n is a quadratic residue using Legendre symbol
+        if (FpLegendre(Fp, n) !== 1)
             throw new Error('Cannot find square root');
-        let r = S;
-        // TODO: will fail at Fp2/etc
-        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b
-        let x = Fp.pow(n, Q1div2); // first guess at the square root
-        let b = Fp.pow(n, Q); // first guess at the fudge factor
-        while (!Fp.eql(b, Fp.ONE)) {
-            if (Fp.eql(b, Fp.ZERO))
-                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)
-            // Find m such b^(2^m)==1
-            let m = 1;
-            for (let t2 = Fp.sqr(b); m < r; m++) {
-                if (Fp.eql(t2, Fp.ONE))
-                    break;
-                t2 = Fp.sqr(t2); // t2 *= t2
+        // Initialize variables for the main loop
+        let M = S;
+        let c = Fp.mul(Fp.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp
+        let t = Fp.pow(n, Q); // t = n^Q, first guess at the fudge factor
+        let R = Fp.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root
+        // Main loop
+        // while t != 1
+        while (!Fp.eql(t, Fp.ONE)) {
+            if (Fp.is0(t))
+                return Fp.ZERO; // if t=0 return R=0
+            let i = 1;
+            // Find the smallest i >= 1 such that t^(2^i) ≡ 1 (mod P)
+            let t_tmp = Fp.sqr(t); // t^(2^1)
+            while (!Fp.eql(t_tmp, Fp.ONE)) {
+                i++;
+                t_tmp = Fp.sqr(t_tmp); // t^(2^2)...
+                if (i === M)
+                    throw new Error('Cannot find square root');
             }
-            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow
-            const ge = Fp.pow(g, _1n$3 << BigInt(r - m - 1)); // ge = 2^(r-m-1)
-            g = Fp.sqr(ge); // g = ge * ge
-            x = Fp.mul(x, ge); // x *= ge
-            b = Fp.mul(b, g); // b *= g
-            r = m;
+            // Calculate the exponent for b: 2^(M - i - 1)
+            const exponent = _1n$3 << BigInt(M - i - 1); // bigint is important
+            const b = Fp.pow(c, exponent); // b = 2^(M - i - 1)
+            // Update variables
+            M = i;
+            c = Fp.sqr(b); // c = b^2
+            t = Fp.mul(t, c); // t = (t * b^2)
+            R = Fp.mul(R, b); // R = R*b
         }
-        return x;
+        return R;
     };
 }
 /**
- * Square root for a finite field. It will try to check if optimizations are applicable and fall back to 4:
+ * Square root for a finite field. Will try optimized versions first:
  *
  * 1. P ≡ 3 (mod 4)
  * 2. P ≡ 5 (mod 8)
- * 3. P ≡ 9 (mod 16)
- * 4. Tonelli-Shanks algorithm
+ * 3. Tonelli-Shanks algorithm
  *
  * Different algorithms can give different roots, it is up to user to decide which one they want.
  * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).
  */
 function FpSqrt(P) {
-    // P ≡ 3 (mod 4)
-    // √n = n^((P+1)/4)
-    if (P % _4n === _3n$1) {
-        // Not all roots possible!
-        // const ORDER =
-        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;
-        // const NUM = 72057594037927816n;
-        const p1div4 = (P + _1n$3) / _4n;
-        return function sqrt3mod4(Fp, n) {
-            const root = Fp.pow(n, p1div4);
-            // Throw if root**2 != n
-            if (!Fp.eql(Fp.sqr(root), n))
-                throw new Error('Cannot find square root');
-            return root;
-        };
-    }
-    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)
-    if (P % _8n === _5n) {
-        const c1 = (P - _5n) / _8n;
-        return function sqrt5mod8(Fp, n) {
-            const n2 = Fp.mul(n, _2n$1);
-            const v = Fp.pow(n2, c1);
-            const nv = Fp.mul(n, v);
-            const i = Fp.mul(Fp.mul(nv, _2n$1), v);
-            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));
-            if (!Fp.eql(Fp.sqr(root), n))
-                throw new Error('Cannot find square root');
-            return root;
-        };
-    }
-    // Other cases: Tonelli-Shanks algorithm
+    // P ≡ 3 (mod 4) => √n = n^((P+1)/4)
+    if (P % _4n$1 === _3n$1)
+        return sqrt3mod4;
+    // P ≡ 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf
+    if (P % _8n === _5n)
+        return sqrt5mod8;
+    // P ≡ 9 (mod 16) not implemented, see above
+    // Tonelli-Shanks algorithm
     return tonelliShanks(P);
 }
 // prettier-ignore
@@ -30045,52 +31858,74 @@ function validateField(field) {
  * Same as `pow` but for Fp: non-constant-time.
  * Unsafe in some contexts: uses ladder, so can expose bigint bits.
  */
-function FpPow(f, num, power) {
-    // Should have same speed as pow for bigints
-    // TODO: benchmark!
-    if (power < _0n$2)
+function FpPow(Fp, num, power) {
+    if (power < _0n$3)
         throw new Error('invalid exponent, negatives unsupported');
-    if (power === _0n$2)
-        return f.ONE;
+    if (power === _0n$3)
+        return Fp.ONE;
     if (power === _1n$3)
         return num;
-    let p = f.ONE;
+    let p = Fp.ONE;
     let d = num;
-    while (power > _0n$2) {
+    while (power > _0n$3) {
         if (power & _1n$3)
-            p = f.mul(p, d);
-        d = f.sqr(d);
+            p = Fp.mul(p, d);
+        d = Fp.sqr(d);
         power >>= _1n$3;
     }
     return p;
 }
 /**
  * Efficiently invert an array of Field elements.
- * `inv(0)` will return `undefined` here: make sure to throw an error.
+ * Exception-free. Will return `undefined` for 0 elements.
+ * @param passZero map 0 to 0 (instead of undefined)
  */
-function FpInvertBatch(f, nums) {
-    const tmp = new Array(nums.length);
+function FpInvertBatch(Fp, nums, passZero = false) {
+    const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);
     // Walk from first to last, multiply them by each other MOD p
-    const lastMultiplied = nums.reduce((acc, num, i) => {
-        if (f.is0(num))
+    const multipliedAcc = nums.reduce((acc, num, i) => {
+        if (Fp.is0(num))
             return acc;
-        tmp[i] = acc;
-        return f.mul(acc, num);
-    }, f.ONE);
+        inverted[i] = acc;
+        return Fp.mul(acc, num);
+    }, Fp.ONE);
     // Invert last element
-    const inverted = f.inv(lastMultiplied);
+    const invertedAcc = Fp.inv(multipliedAcc);
     // Walk from last to first, multiply them by inverted each other MOD p
     nums.reduceRight((acc, num, i) => {
-        if (f.is0(num))
+        if (Fp.is0(num))
             return acc;
-        tmp[i] = f.mul(acc, tmp[i]);
-        return f.mul(acc, num);
-    }, inverted);
-    return tmp;
+        inverted[i] = Fp.mul(acc, inverted[i]);
+        return Fp.mul(acc, num);
+    }, invertedAcc);
+    return inverted;
+}
+/**
+ * Legendre symbol.
+ * Legendre constant is used to calculate Legendre symbol (a | p)
+ * which denotes the value of a^((p-1)/2) (mod p).
+ *
+ * * (a | p) ≡ 1    if a is a square (mod p), quadratic residue
+ * * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue
+ * * (a | p) ≡ 0    if a ≡ 0 (mod p)
+ */
+function FpLegendre(Fp, n) {
+    // We can use 3rd argument as optional cache of this value
+    // but seems unneeded for now. The operation is very fast.
+    const p1mod2 = (Fp.ORDER - _1n$3) / _2n$1;
+    const powered = Fp.pow(n, p1mod2);
+    const yes = Fp.eql(powered, Fp.ONE);
+    const zero = Fp.eql(powered, Fp.ZERO);
+    const no = Fp.eql(powered, Fp.neg(Fp.ONE));
+    if (!yes && !zero && !no)
+        throw new Error('invalid Legendre symbol result');
+    return yes ? 1 : zero ? 0 : -1;
 }
 // CURVE.n lengths
 function nLength(n, nBitLength) {
     // Bit size, byte size of CURVE.n
+    if (nBitLength !== undefined)
+        anumber$1(nBitLength);
     const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;
     const nByteLength = Math.ceil(_nBitLength / 8);
     return { nBitLength: _nBitLength, nByteLength };
@@ -30111,7 +31946,7 @@ function nLength(n, nBitLength) {
  * @param redef optional faster redefinitions of sqrt and other methods
  */
 function Field(ORDER, bitLen, isLE = false, redef = {}) {
-    if (ORDER <= _0n$2)
+    if (ORDER <= _0n$3)
         throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);
     const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);
     if (BYTES > 2048)
@@ -30123,15 +31958,15 @@ function Field(ORDER, bitLen, isLE = false, redef = {}) {
         BITS,
         BYTES,
         MASK: bitMask(BITS),
-        ZERO: _0n$2,
+        ZERO: _0n$3,
         ONE: _1n$3,
         create: (num) => mod(num, ORDER),
         isValid: (num) => {
             if (typeof num !== 'bigint')
                 throw new Error('invalid field element: expected bigint, got ' + typeof num);
-            return _0n$2 <= num && num < ORDER; // 0 is valid element, but it's not invertible
+            return _0n$3 <= num && num < ORDER; // 0 is valid element, but it's not invertible
         },
-        is0: (num) => num === _0n$2,
+        is0: (num) => num === _0n$3,
         isOdd: (num) => (num & _1n$3) === _1n$3,
         neg: (num) => mod(-num, ORDER),
         eql: (lhs, rhs) => lhs === rhs,
@@ -30153,16 +31988,17 @@ function Field(ORDER, bitLen, isLE = false, redef = {}) {
                     sqrtP = FpSqrt(ORDER);
                 return sqrtP(f, n);
             }),
-        invertBatch: (lst) => FpInvertBatch(f, lst),
-        // TODO: do we really need constant cmov?
-        // We don't have const-time bigints anyway, so probably will be not very useful
-        cmov: (a, b, c) => (c ? b : a),
         toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),
         fromBytes: (bytes) => {
             if (bytes.length !== BYTES)
                 throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);
             return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);
         },
+        // TODO: we don't need it here, move out to separate fn
+        invertBatch: (lst) => FpInvertBatch(f, lst),
+        // We can't move this out because Fp6, Fp12 implement it
+        // and it's unclear what to return in there.
+        cmov: (a, b, c) => (c ? b : a),
     });
     return Object.freeze(f);
 }
@@ -30215,12 +32051,97 @@ function mapHashToField(key, fieldOrder, isLE = false) {
     return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
 }
 
+/**
+ * HMAC: RFC2104 message authentication code.
+ * @module
+ */
+class HMAC extends Hash {
+    constructor(hash, _key) {
+        super();
+        this.finished = false;
+        this.destroyed = false;
+        ahash(hash);
+        const key = toBytes(_key);
+        this.iHash = hash.create();
+        if (typeof this.iHash.update !== 'function')
+            throw new Error('Expected instance of class which extends utils.Hash');
+        this.blockLen = this.iHash.blockLen;
+        this.outputLen = this.iHash.outputLen;
+        const blockLen = this.blockLen;
+        const pad = new Uint8Array(blockLen);
+        // blockLen can be bigger than outputLen
+        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
+        for (let i = 0; i < pad.length; i++)
+            pad[i] ^= 0x36;
+        this.iHash.update(pad);
+        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
+        this.oHash = hash.create();
+        // Undo internal XOR && apply outer XOR
+        for (let i = 0; i < pad.length; i++)
+            pad[i] ^= 0x36 ^ 0x5c;
+        this.oHash.update(pad);
+        clean(pad);
+    }
+    update(buf) {
+        aexists(this);
+        this.iHash.update(buf);
+        return this;
+    }
+    digestInto(out) {
+        aexists(this);
+        abytes$2(out, this.outputLen);
+        this.finished = true;
+        this.iHash.digestInto(out);
+        this.oHash.update(out);
+        this.oHash.digestInto(out);
+        this.destroy();
+    }
+    digest() {
+        const out = new Uint8Array(this.oHash.outputLen);
+        this.digestInto(out);
+        return out;
+    }
+    _cloneInto(to) {
+        // Create new instance without calling constructor since key already in state and we don't know it.
+        to || (to = Object.create(Object.getPrototypeOf(this), {}));
+        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
+        to = to;
+        to.finished = finished;
+        to.destroyed = destroyed;
+        to.blockLen = blockLen;
+        to.outputLen = outputLen;
+        to.oHash = oHash._cloneInto(to.oHash);
+        to.iHash = iHash._cloneInto(to.iHash);
+        return to;
+    }
+    clone() {
+        return this._cloneInto();
+    }
+    destroy() {
+        this.destroyed = true;
+        this.oHash.destroy();
+        this.iHash.destroy();
+    }
+}
+/**
+ * HMAC: RFC2104 message authentication code.
+ * @param hash - function that would be used e.g. sha256
+ * @param key - message key
+ * @param message - message data
+ * @example
+ * import { hmac } from '@noble/hashes/hmac';
+ * import { sha256 } from '@noble/hashes/sha2';
+ * const mac1 = hmac(sha256, 'key', 'message');
+ */
+const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
+hmac.create = (hash, key) => new HMAC(hash, key);
+
 /**
  * Methods for elliptic curve multiplication by scalars.
  * Contains wNAF, pippenger
  * @module
  */
-const _0n$1 = BigInt(0);
+const _0n$2 = BigInt(0);
 const _1n$2 = BigInt(1);
 function constTimeNegate(condition, item) {
     const neg = item.negate();
@@ -30308,7 +32229,7 @@ function wNAF(c, bits) {
         // non-const time multiplication ladder
         unsafeLadder(elm, n, p = c.ZERO) {
             let d = elm;
-            while (n > _0n$1) {
+            while (n > _0n$2) {
                 if (n & _1n$2)
                     p = p.add(d);
                 d = d.double();
@@ -30397,7 +32318,7 @@ function wNAF(c, bits) {
         wNAFUnsafe(W, precomputes, n, acc = c.ZERO) {
             const wo = calcWOpts(W, bits);
             for (let window = 0; window < wo.windows; window++) {
-                if (n === _0n$1)
+                if (n === _0n$2)
                     break; // Early-exit, skip 0 value
                 const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);
                 n = nextN;
@@ -30462,18 +32383,27 @@ function pippenger(c, fieldN, points, scalars) {
     // 0 is accepted in scalars
     validateMSMPoints(points, c);
     validateMSMScalars(scalars, fieldN);
-    if (points.length !== scalars.length)
+    const plength = points.length;
+    const slength = scalars.length;
+    if (plength !== slength)
         throw new Error('arrays of points and scalars must have equal length');
+    // if (plength === 0) throw new Error('array must be of length >= 2');
     const zero = c.ZERO;
-    const wbits = bitLen(BigInt(points.length));
-    const windowSize = wbits > 12 ? wbits - 3 : wbits > 4 ? wbits - 2 : wbits ? 2 : 1; // in bits
+    const wbits = bitLen(BigInt(plength));
+    let windowSize = 1; // bits
+    if (wbits > 12)
+        windowSize = wbits - 3;
+    else if (wbits > 4)
+        windowSize = wbits - 2;
+    else if (wbits > 0)
+        windowSize = 2;
     const MASK = bitMask(windowSize);
     const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array
     const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;
     let sum = zero;
     for (let i = lastBits; i >= 0; i -= windowSize) {
         buckets.fill(zero);
-        for (let j = 0; j < scalars.length; j++) {
+        for (let j = 0; j < slength; j++) {
             const scalar = scalars[j];
             const wbits = Number((scalar >> BigInt(i)) & MASK);
             buckets[wbits] = buckets[wbits].add(points[j]);
@@ -30519,9 +32449,9 @@ function validateBasic(curve) {
  *
  * * a: formula param
  * * b: formula param
- * * Fp: finite Field over which we'll do calculations. Can be complex (Fp2, Fp12)
- * * n: Curve prime subgroup order, total count of valid points in the field
- * * Gx: Base point (x, y) aka generator point x coordinate
+ * * Fp: finite field of prime characteristic P; may be complex (Fp2). Arithmetics is done in field
+ * * n: order of prime subgroup a.k.a total amount of valid curve points
+ * * Gx: Base point (x, y) aka generator point. Gx = x coordinate
  * * Gy: ...y coordinate
  * * h: cofactor, usually 1. h*n = curve group order (n is only subgroup order)
  * * lowS: whether to enable (default) or disable "low-s" non-malleable signatures
@@ -30561,23 +32491,23 @@ function validatePointOpts(curve) {
         a: 'field',
         b: 'field',
     }, {
+        allowInfinityPoint: 'boolean',
         allowedPrivateKeyLengths: 'array',
-        wrapPrivateKey: 'boolean',
-        isTorsionFree: 'function',
         clearCofactor: 'function',
-        allowInfinityPoint: 'boolean',
         fromBytes: 'function',
+        isTorsionFree: 'function',
         toBytes: 'function',
+        wrapPrivateKey: 'boolean',
     });
     const { endo, Fp, a } = opts;
     if (endo) {
         if (!Fp.eql(a, Fp.ZERO)) {
-            throw new Error('invalid endomorphism, can only be defined for Koblitz curves that have a=0');
+            throw new Error('invalid endo: CURVE.a must be 0');
         }
         if (typeof endo !== 'object' ||
             typeof endo.beta !== 'bigint' ||
             typeof endo.splitScalar !== 'function') {
-            throw new Error('invalid endomorphism, expected beta: bigint and splitScalar: function');
+            throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');
         }
     }
     return Object.freeze({ ...opts });
@@ -30658,7 +32588,7 @@ const DER = {
     _int: {
         encode(num) {
             const { Err: E } = DER;
-            if (num < _0n)
+            if (num < _0n$1)
                 throw new E('integer: negative integers are not allowed');
             let hex = numberToHexUnpadded(num);
             // Pad with zero byte if negative flag is present
@@ -30698,9 +32628,12 @@ const DER = {
         return tlv.encode(0x30, seq);
     },
 };
+function numToSizedHex(num, size) {
+    return bytesToHex(numberToBytesBE(num, size));
+}
 // Be friendly to bad ECMAScript parsers by not using bigint literals
 // prettier-ignore
-const _0n = BigInt(0), _1n$1 = BigInt(1); BigInt(2); const _3n = BigInt(3); BigInt(4);
+const _0n$1 = BigInt(0), _1n$1 = BigInt(1); BigInt(2); const _3n = BigInt(3), _4n = BigInt(4);
 function weierstrassPoints(opts) {
     const CURVE = validatePointOpts(opts);
     const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ
@@ -30726,15 +32659,24 @@ function weierstrassPoints(opts) {
     function weierstrassEquation(x) {
         const { a, b } = CURVE;
         const x2 = Fp.sqr(x); // x * x
-        const x3 = Fp.mul(x2, x); // x2 * x
-        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b
+        const x3 = Fp.mul(x2, x); // x² * x
+        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x³ + a * x + b
+    }
+    function isValidXY(x, y) {
+        const left = Fp.sqr(y); // y²
+        const right = weierstrassEquation(x); // x³ + ax + b
+        return Fp.eql(left, right);
     }
     // Validate whether the passed curve params are valid.
-    // We check if curve equation works for generator point.
-    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.
-    // ProjectivePoint class has not been initialized yet.
-    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))
-        throw new Error('bad generator point: equation left != right');
+    // Test 1: equation y² = x³ + ax + b should work for generator point.
+    if (!isValidXY(CURVE.Gx, CURVE.Gy))
+        throw new Error('bad curve params: generator point');
+    // Test 2: discriminant Δ part should be non-zero: 4a³ + 27b² != 0.
+    // Guarantees curve is genus-1, smooth (non-singular).
+    const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);
+    const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));
+    if (Fp.is0(Fp.add(_4a3, _27b2)))
+        throw new Error('bad curve params: a or b');
     // Valid group elements reside in range 1..n-1
     function isWithinCurveOrder(num) {
         return inRange(num, _1n$1, CURVE.n);
@@ -30773,7 +32715,7 @@ function weierstrassPoints(opts) {
     // Memoized toAffine / validity check. They are heavy. Points are immutable.
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
-    // (x, y, z) ∋ (x=x/z, y=y/z)
+    // (X, Y, Z) ∋ (x=X/Z, y=Y/Z)
     const toAffineMemo = memoized((p, iz) => {
         const { px: x, py: y, pz: z } = p;
         // Fast-path for normalized points
@@ -30809,16 +32751,14 @@ function weierstrassPoints(opts) {
         // Check if x, y are valid field elements
         if (!Fp.isValid(x) || !Fp.isValid(y))
             throw new Error('bad point: x or y not FE');
-        const left = Fp.sqr(y); // y²
-        const right = weierstrassEquation(x); // x³ + ax + b
-        if (!Fp.eql(left, right))
+        if (!isValidXY(x, y))
             throw new Error('bad point: equation left != right');
         if (!p.isTorsionFree())
             throw new Error('bad point: not in prime-order subgroup');
         return true;
     });
     /**
-     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)
+     * Projective Point works in 3d / projective (homogeneous) coordinates: (X, Y, Z) ∋ (x=X/Z, y=Y/Z)
      * Default Point works in 2d / affine coordinates: (x, y)
      * We're doing calculations in projective, because its operations don't require costly inversion.
      */
@@ -30826,7 +32766,7 @@ function weierstrassPoints(opts) {
         constructor(px, py, pz) {
             if (px == null || !Fp.isValid(px))
                 throw new Error('x required');
-            if (py == null || !Fp.isValid(py))
+            if (py == null || !Fp.isValid(py) || Fp.is0(py))
                 throw new Error('y required');
             if (pz == null || !Fp.isValid(pz))
                 throw new Error('z required');
@@ -30862,7 +32802,7 @@ function weierstrassPoints(opts) {
          * Optimization: converts a list of projective points to a list of identical points with Z=1.
          */
         static normalizeZ(points) {
-            const toInv = Fp.invertBatch(points.map((p) => p.pz));
+            const toInv = FpInvertBatch(Fp, points.map((p) => p.pz));
             return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);
         }
         /**
@@ -31024,9 +32964,9 @@ function weierstrassPoints(opts) {
          */
         multiplyUnsafe(sc) {
             const { endo, n: N } = CURVE;
-            aInRange('scalar', sc, _0n, N);
+            aInRange('scalar', sc, _0n$1, N);
             const I = Point.ZERO;
-            if (sc === _0n)
+            if (sc === _0n$1)
                 return I;
             if (this.is0() || sc === _1n$1)
                 return this;
@@ -31034,11 +32974,12 @@ function weierstrassPoints(opts) {
             if (!endo || wnaf.hasPrecomputes(this))
                 return wnaf.wNAFCachedUnsafe(this, sc, Point.normalizeZ);
             // Case c: endomorphism
+            /** See docs for {@link EndomorphismOpts} */
             let { k1neg, k1, k2neg, k2 } = endo.splitScalar(sc);
             let k1p = I;
             let k2p = I;
             let d = this;
-            while (k1 > _0n || k2 > _0n) {
+            while (k1 > _0n$1 || k2 > _0n$1) {
                 if (k1 & _1n$1)
                     k1p = k1p.add(d);
                 if (k2 & _1n$1)
@@ -31067,6 +33008,7 @@ function weierstrassPoints(opts) {
             const { endo, n: N } = CURVE;
             aInRange('scalar', scalar, _1n$1, N);
             let point, fake; // Fake point is used to const-time mult
+            /** See docs for {@link EndomorphismOpts} */
             if (endo) {
                 const { k1neg, k1, k2neg, k2 } = endo.splitScalar(scalar);
                 let { p: k1p, f: f1p } = this.wNAF(k1);
@@ -31094,7 +33036,7 @@ function weierstrassPoints(opts) {
         multiplyAndAddUnsafe(Q, a, b) {
             const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes
             const mul = (P, a // Select faster multiply() method
-            ) => (a === _0n || a === _1n$1 || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));
+            ) => (a === _0n$1 || a === _1n$1 || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));
             const sum = mul(this, a).add(mul(Q, b));
             return sum.is0() ? undefined : sum;
         }
@@ -31130,11 +33072,12 @@ function weierstrassPoints(opts) {
             return bytesToHex(this.toRawBytes(isCompressed));
         }
     }
+    // base / generator point
     Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);
-    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);
-    const _bits = CURVE.nBitLength;
-    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);
-    // Validate if generator point is on curve
+    // zero / infinity / identity point
+    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0
+    const { endo, nBitLength } = CURVE;
+    const wnaf = wNAF(Point, endo ? Math.ceil(nBitLength / 2) : nBitLength);
     return {
         CURVE,
         ProjectivePoint: Point,
@@ -31165,7 +33108,7 @@ function validateOpts(curve) {
  */
 function weierstrass(curveDef) {
     const CURVE = validateOpts(curveDef);
-    const { Fp, n: CURVE_ORDER } = CURVE;
+    const { Fp, n: CURVE_ORDER, nByteLength, nBitLength } = CURVE;
     const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32
     const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32
     function modN(a) {
@@ -31225,7 +33168,6 @@ function weierstrass(curveDef) {
             }
         },
     });
-    const numToNByteHex = (num) => bytesToHex(numberToBytesBE(num, CURVE.nByteLength));
     function isBiggerThanHalfOrder(number) {
         const HALF = CURVE_ORDER >> _1n$1;
         return number > HALF;
@@ -31250,7 +33192,7 @@ function weierstrass(curveDef) {
         }
         // pair (bytes of r, bytes of s)
         static fromCompact(hex) {
-            const l = CURVE.nByteLength;
+            const l = nByteLength;
             hex = ensureBytes('compactSignature', hex, l * 2);
             return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));
         }
@@ -31277,7 +33219,7 @@ function weierstrass(curveDef) {
             if (radj >= Fp.ORDER)
                 throw new Error('recovery id 2 or 3 invalid');
             const prefix = (rec & 1) === 0 ? '02' : '03';
-            const R = Point.fromHex(prefix + numToNByteHex(radj));
+            const R = Point.fromHex(prefix + numToSizedHex(radj, Fp.BYTES));
             const ir = invN(radj); // r^-1
             const u1 = modN(-h * ir); // -hr^-1
             const u2 = modN(s * ir); // sr^-1
@@ -31299,14 +33241,15 @@ function weierstrass(curveDef) {
             return hexToBytes(this.toDERHex());
         }
         toDERHex() {
-            return DER.hexFromSig({ r: this.r, s: this.s });
+            return DER.hexFromSig(this);
         }
         // padded bytes of r, then padded bytes of s
         toCompactRawBytes() {
             return hexToBytes(this.toCompactHex());
         }
         toCompactHex() {
-            return numToNByteHex(this.r) + numToNByteHex(this.s);
+            const l = nByteLength;
+            return numToSizedHex(this.r, l) + numToSizedHex(this.s, l);
         }
     }
     const utils = {
@@ -31355,16 +33298,21 @@ function weierstrass(curveDef) {
      * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.
      */
     function isProbPub(item) {
-        const arr = isBytes$1(item);
-        const str = typeof item === 'string';
-        const len = (arr || str) && item.length;
-        if (arr)
-            return len === compressedLen || len === uncompressedLen;
-        if (str)
-            return len === 2 * compressedLen || len === 2 * uncompressedLen;
+        if (typeof item === 'bigint')
+            return false;
         if (item instanceof Point)
             return true;
-        return false;
+        const arr = ensureBytes('key', item);
+        const len = arr.length;
+        const fpl = Fp.BYTES;
+        const compLen = fpl + 1; // e.g. 33 for 32
+        const uncompLen = 2 * fpl + 1; // e.g. 65 for 32
+        if (CURVE.allowedPrivateKeyLengths || nByteLength === compLen) {
+            return undefined;
+        }
+        else {
+            return len === compLen || len === uncompLen;
+        }
     }
     /**
      * ECDH (Elliptic Curve Diffie Hellman).
@@ -31377,9 +33325,9 @@ function weierstrass(curveDef) {
      * @returns shared public key
      */
     function getSharedSecret(privateA, publicB, isCompressed = true) {
-        if (isProbPub(privateA))
+        if (isProbPub(privateA) === true)
             throw new Error('first arg must be private key');
-        if (!isProbPub(publicB))
+        if (isProbPub(publicB) === false)
             throw new Error('second arg must be public key');
         const b = Point.fromHex(publicB); // check for being on-curve
         return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);
@@ -31390,13 +33338,13 @@ function weierstrass(curveDef) {
     // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors
     const bits2int = CURVE.bits2int ||
         function (bytes) {
-            // Our custom check "just in case"
+            // Our custom check "just in case", for protection against DoS
             if (bytes.length > 8192)
                 throw new Error('input is too large');
             // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)
             // for some cases, since bytes.length * 8 is not actual bitLength.
             const num = bytesToNumberBE(bytes); // check for == u8 done here
-            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits
+            const delta = bytes.length * 8 - nBitLength; // truncate to nBitLength leftmost bits
             return delta > 0 ? num >> BigInt(delta) : num;
         };
     const bits2int_modN = CURVE.bits2int_modN ||
@@ -31404,14 +33352,14 @@ function weierstrass(curveDef) {
             return modN(bits2int(bytes)); // can't use bytesToNumberBE here
         };
     // NOTE: pads output with zero as per spec
-    const ORDER_MASK = bitMask(CURVE.nBitLength);
+    const ORDER_MASK = bitMask(nBitLength);
     /**
      * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.
      */
     function int2octets(num) {
-        aInRange('num < 2^' + CURVE.nBitLength, num, _0n, ORDER_MASK);
+        aInRange('num < 2^' + nBitLength, num, _0n$1, ORDER_MASK);
         // works with order, can have different size than numToField!
-        return numberToBytesBE(num, CURVE.nByteLength);
+        return numberToBytesBE(num, nByteLength);
     }
     // Steps A, D of RFC6979 3.2
     // Creates RFC6979 seed; converts msg/privKey to numbers.
@@ -31452,13 +33400,13 @@ function weierstrass(curveDef) {
             const ik = invN(k); // k^-1 mod n
             const q = Point.BASE.multiply(k).toAffine(); // q = Gk
             const r = modN(q.x); // r = q.x mod n
-            if (r === _0n)
+            if (r === _0n$1)
                 return;
             // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to
             // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:
             // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT
             const s = modN(ik * modN(m + r * d)); // Not using blinding here
-            if (s === _0n)
+            if (s === _0n$1)
                 return;
             let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n$1); // recovery bit (2 or 3, when q.x > n)
             let normS = s;
@@ -31611,6 +33559,7 @@ function createCurve(curveDef, defHash) {
  */
 const secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');
 const secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');
+const _0n = BigInt(0);
 const _1n = BigInt(1);
 const _2n = BigInt(2);
 const divNearest = (a, b) => (a + b / _2n) / b;
@@ -31659,13 +33608,13 @@ const Fpk1 = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });
  * ```
  */
 const secp256k1 = createCurve({
-    a: BigInt(0),
+    a: _0n,
     b: BigInt(7),
     Fp: Fpk1,
     n: secp256k1N,
     Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),
     Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),
-    h: BigInt(1), // Cofactor
+    h: BigInt(1),
     lowS: true, // Allow only low-S signatures by default in sign() and verify()
     endo: {
         // Endomorphism, see above
@@ -31693,11 +33642,7 @@ const secp256k1 = createCurve({
             return { k1neg, k1, k2neg, k2 };
         },
     },
-}, sha256$1);
-// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.
-// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki
-BigInt(0);
-secp256k1.ProjectivePoint;
+}, sha256$2);
 
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function isBytes(a) {
@@ -32100,10 +34045,17 @@ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), join(''));
  */
 chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));
 // Built-in base64 conversion https://caniuse.com/mdn-javascript_builtins_uint8array_frombase64
-// TODO: temporarily set to false, trying to understand bugs
 // prettier-ignore
 const hasBase64Builtin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toBase64 === 'function' &&
     typeof Uint8Array.fromBase64 === 'function')();
+const decodeBase64Builtin = (s, isUrl) => {
+    astr('base64', s);
+    const re = isUrl ? /^[A-Za-z0-9=_-]+$/ : /^[A-Za-z0-9=+/]+$/;
+    const alphabet = isUrl ? 'base64url' : 'base64';
+    if (s.length > 0 && !re.test(s))
+        throw new Error('invalid base64');
+    return Uint8Array.fromBase64(s, { alphabet, lastChunkHandling: 'strict' });
+};
 /**
  * base64 from RFC 4648. Padded.
  * Use `base64nopad` for unpadded version.
@@ -32120,10 +34072,7 @@ const hasBase64Builtin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toBas
 // prettier-ignore
 hasBase64Builtin ? {
     encode(b) { abytes(b); return b.toBase64(); },
-    decode(s) {
-        astr('base64', s);
-        return Uint8Array.fromBase64(s, { lastChunkHandling: 'strict' });
-    },
+    decode(s) { return decodeBase64Builtin(s, false); },
 } : chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));
 /**
  * base64 from RFC 4648. No padding.
@@ -32152,7 +34101,7 @@ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0
 // prettier-ignore
 hasBase64Builtin ? {
     encode(b) { abytes(b); return b.toBase64({ alphabet: 'base64url' }); },
-    decode(s) { astr('base64', s); return Uint8Array.fromBase64(s, { alphabet: 'base64url' }); },
+    decode(s) { return decodeBase64Builtin(s, true); },
 } : chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));
 /**
  * base64 from RFC 4648, using URL-safe alphabet. No padding.
@@ -32343,9 +34292,37 @@ hasHexBuiltin
  * ```
  */
 secp256k1.ProjectivePoint;
-createBase58check(sha256$1);
+createBase58check(sha256$2);
 utf8ToBytes('Bitcoin seed');
 
+/**
+ * @description Converts a signature into hex format.
+ *
+ * @param signature The signature to convert.
+ * @returns The signature in hex format.
+ *
+ * @example
+ * serializeSignature({
+ *   r: '0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf',
+ *   s: '0x4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db8',
+ *   yParity: 1
+ * })
+ * // "0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db81c"
+ */
+function serializeSignature({ r, s, to = 'hex', v, yParity, }) {
+    const yParity_ = (() => {
+        if (yParity === 0 || yParity === 1)
+            return yParity;
+        if (v && (v === 27n || v === 28n || v >= 35n))
+            return v % 2n === 0n ? 1 : 0;
+        throw new Error('Invalid `v` or `yParity` value');
+    })();
+    const signature = `0x${new secp256k1.Signature(hexToBigInt(r), hexToBigInt(s)).toCompactHex()}${yParity_ === 0 ? '1b' : '1c'}`;
+    if (to === 'hex')
+        return signature;
+    return hexToBytes$1(signature);
+}
+
 // TODO(v3): Rename to `toLocalAccount` + add `source` property to define source (privateKey, mnemonic, hdKey, etc).
 /**
  * @description Creates an Account from a custom signing implementation.
@@ -32388,34 +34365,6 @@ function publicKeyToAddress(publicKey) {
     return checksumAddress(`0x${address}`);
 }
 
-/**
- * @description Converts a signature into hex format.
- *
- * @param signature The signature to convert.
- * @returns The signature in hex format.
- *
- * @example
- * serializeSignature({
- *   r: '0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf',
- *   s: '0x4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db8',
- *   yParity: 1
- * })
- * // "0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db81c"
- */
-function serializeSignature({ r, s, to = 'hex', v, yParity, }) {
-    const yParity_ = (() => {
-        if (yParity === 0 || yParity === 1)
-            return yParity;
-        if (v && (v === 27n || v === 28n || v >= 35n))
-            return v % 2n === 0n ? 1 : 0;
-        throw new Error('Invalid `v` or `yParity` value');
-    })();
-    const signature = `0x${new secp256k1.Signature(hexToBigInt(r), hexToBigInt(s)).toCompactHex()}${yParity_ === 0 ? '1b' : '1c'}`;
-    if (to === 'hex')
-        return signature;
-    return hexToBytes$1(signature);
-}
-
 // TODO(v3): Convert to sync.
 let extraEntropy = false;
 /**
@@ -32427,7 +34376,12 @@ let extraEntropy = false;
  * @returns The signature.
  */
 async function sign({ hash, privateKey, to = 'object', }) {
-    const { r, s, recovery } = secp256k1.sign(hash.slice(2), privateKey.slice(2), { lowS: true, extraEntropy });
+    const { r, s, recovery } = secp256k1.sign(hash.slice(2), privateKey.slice(2), {
+        lowS: true,
+        extraEntropy: isHex(extraEntropy, { strict: false })
+            ? hexToBytes$1(extraEntropy)
+            : extraEntropy,
+    });
     const signature = {
         r: numberToHex(r, { size: 32 }),
         s: numberToHex(s, { size: 32 }),
@@ -32522,10 +34476,10 @@ async function signTransaction(parameters) {
         return transaction;
     })();
     const signature = await sign({
-        hash: keccak256(serializer(signableTransaction)),
+        hash: keccak256(await serializer(signableTransaction)),
         privateKey,
     });
-    return serializer(transaction, signature);
+    return (await serializer(transaction, signature));
 }
 
 class InvalidDomainError extends BaseError {
@@ -32566,7 +34520,7 @@ function validateTypedData(parameters) {
                 // and will throw.
                 numberToHex(value, {
                     signed: base === 'int',
-                    size: Number.parseInt(size_) / 8,
+                    size: Number.parseInt(size_, 10) / 8,
                 });
             }
             if (type === 'address' && typeof value === 'string' && !isAddress(value))
@@ -32574,9 +34528,9 @@ function validateTypedData(parameters) {
             const bytesMatch = type.match(bytesRegex);
             if (bytesMatch) {
                 const [_type, size_] = bytesMatch;
-                if (size_ && size(value) !== Number.parseInt(size_))
+                if (size_ && size(value) !== Number.parseInt(size_, 10))
                     throw new BytesSizeMismatchError({
-                        expectedSize: Number.parseInt(size_),
+                        expectedSize: Number.parseInt(size_, 10),
                         givenSize: size(value),
                     });
             }
@@ -32922,6 +34876,8 @@ exports.BuyBackManagerAddress = BuyBackManagerAddress;
 exports.ClankerWorldVerifierAddress = ClankerWorldVerifierAddress;
 exports.ClosedPermissionsAddress = ClosedPermissionsAddress;
 exports.DopplerVerifierAddress = DopplerVerifierAddress;
+exports.DynamicAddressFeeSplitManagerAbi = DynamicAddressFeeSplitManagerAbi;
+exports.DynamicAddressFeeSplitManagerAddress = DynamicAddressFeeSplitManagerAddress;
 exports.FLETHAddress = FLETHAddress;
 exports.FLETHHooksAddress = FLETHHooksAddress;
 exports.FairLaunchAbi = FairLaunchAbi;
@@ -32959,7 +34915,9 @@ exports.Q192 = Q192;
 exports.Q96 = Q96;
 exports.QuoterAbi = QuoterAbi;
 exports.QuoterAddress = QuoterAddress;
+exports.ReadDynamicAddressFeeSplitManager = ReadDynamicAddressFeeSplitManager;
 exports.ReadFlaunchSDK = ReadFlaunchSDK;
+exports.ReadWriteDynamicAddressFeeSplitManager = ReadWriteDynamicAddressFeeSplitManager;
 exports.ReadWriteFlaunchSDK = ReadWriteFlaunchSDK;
 exports.ReferralEscrowAbi = ReferralEscrowAbi;
 exports.ReferralEscrowAddress = ReferralEscrowAddress;