@pufferfinance/puffer-sdk 1.12.2 → 1.13.1

package/dist/{constants-BjRNQpT2.js → constants-CH7Tz5jz.js}

@@ -1,30 +1,30 @@
-function V(e, { strict: t = !0 } = {}) {
+function _(e, { strict: t = !0 } = {}) {
   return !e || typeof e != "string" ? !1 : t ? /^0x[0-9a-fA-F]*$/.test(e) : e.startsWith("0x");
 }
 function P(e) {
-  return V(e, { strict: !1 }) ? Math.ceil((e.length - 2) / 2) : e.length;
+  return _(e, { strict: !1 }) ? Math.ceil((e.length - 2) / 2) : e.length;
 }
-const Ee = "2.21.55";
-let k = {
-  getDocsUrl: ({ docsBaseUrl: e, docsPath: t = "", docsSlug: s }) => t ? `${e ?? "https://viem.sh"}${t}${s ? `#${s}` : ""}` : void 0,
-  version: `viem@${Ee}`
+const Be = "2.23.6";
+let O = {
+  getDocsUrl: ({ docsBaseUrl: e, docsPath: t = "", docsSlug: n }) => t ? `${e ?? "https://viem.sh"}${t}${n ? `#${n}` : ""}` : void 0,
+  version: `viem@${Be}`
 };
 class u extends Error {
-  constructor(t, s = {}) {
+  constructor(t, n = {}) {
     var a;
-    const n = (() => {
+    const s = (() => {
       var c;
-      return s.cause instanceof u ? s.cause.details : (c = s.cause) != null && c.message ? s.cause.message : s.details;
-    })(), i = s.cause instanceof u && s.cause.docsPath || s.docsPath, r = (a = k.getDocsUrl) == null ? void 0 : a.call(k, { ...s, docsPath: i }), o = [
+      return n.cause instanceof u ? n.cause.details : (c = n.cause) != null && c.message ? n.cause.message : n.details;
+    })(), i = n.cause instanceof u && n.cause.docsPath || n.docsPath, r = (a = O.getDocsUrl) == null ? void 0 : a.call(O, { ...n, docsPath: i }), o = [
       t || "An error occurred.",
       "",
-      ...s.metaMessages ? [...s.metaMessages, ""] : [],
+      ...n.metaMessages ? [...n.metaMessages, ""] : [],
       ...r ? [`Docs: ${r}`] : [],
-      ...n ? [`Details: ${n}`] : [],
-      ...k.version ? [`Version: ${k.version}`] : []
+      ...s ? [`Details: ${s}`] : [],
+      ...O.version ? [`Version: ${O.version}`] : []
     ].join(`
 `);
-    super(o, s.cause ? { cause: s.cause } : void 0), Object.defineProperty(this, "details", {
+    super(o, n.cause ? { cause: n.cause } : void 0), Object.defineProperty(this, "details", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
@@ -54,161 +54,161 @@ class u extends Error {
       configurable: !0,
       writable: !0,
       value: "BaseError"
-    }), this.details = n, this.docsPath = i, this.metaMessages = s.metaMessages, this.name = s.name ?? this.name, this.shortMessage = t, this.version = Ee;
+    }), this.details = s, this.docsPath = i, this.metaMessages = n.metaMessages, this.name = n.name ?? this.name, this.shortMessage = t, this.version = Be;
   }
   walk(t) {
-    return Be(this, t);
+    return Ie(this, t);
   }
 }
-function Be(e, t) {
-  return t != null && t(e) ? e : e && typeof e == "object" && "cause" in e && e.cause !== void 0 ? Be(e.cause, t) : t ? null : e;
+function Ie(e, t) {
+  return t != null && t(e) ? e : e && typeof e == "object" && "cause" in e && e.cause !== void 0 ? Ie(e.cause, t) : t ? null : e;
 }
-class Ie extends u {
-  constructor({ offset: t, position: s, size: n }) {
-    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${t}" is out-of-bounds (size: ${n}).`, { name: "SliceOffsetOutOfBoundsError" });
+class ve extends u {
+  constructor({ offset: t, position: n, size: s }) {
+    super(`Slice ${n === "start" ? "starting" : "ending"} at offset "${t}" is out-of-bounds (size: ${s}).`, { name: "SliceOffsetOutOfBoundsError" });
   }
 }
-class ve extends u {
-  constructor({ size: t, targetSize: s, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (${t}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+class Te extends u {
+  constructor({ size: t, targetSize: n, type: s }) {
+    super(`${s.charAt(0).toUpperCase()}${s.slice(1).toLowerCase()} size (${t}) exceeds padding size (${n}).`, { name: "SizeExceedsPaddingSizeError" });
   }
 }
-class Xs extends u {
-  constructor({ size: t, targetSize: s, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} is expected to be ${s} ${n} long, but is ${t} ${n} long.`, { name: "InvalidBytesLengthError" });
+class Yn extends u {
+  constructor({ size: t, targetSize: n, type: s }) {
+    super(`${s.charAt(0).toUpperCase()}${s.slice(1).toLowerCase()} is expected to be ${n} ${s} long, but is ${t} ${s} long.`, { name: "InvalidBytesLengthError" });
   }
 }
-function L(e, { dir: t, size: s = 32 } = {}) {
-  return typeof e == "string" ? nt(e, { dir: t, size: s }) : it(e, { dir: t, size: s });
+function G(e, { dir: t, size: n = 32 } = {}) {
+  return typeof e == "string" ? it(e, { dir: t, size: n }) : rt(e, { dir: t, size: n });
 }
-function nt(e, { dir: t, size: s = 32 } = {}) {
-  if (s === null)
+function it(e, { dir: t, size: n = 32 } = {}) {
+  if (n === null)
     return e;
-  const n = e.replace("0x", "");
-  if (n.length > s * 2)
-    throw new ve({
-      size: Math.ceil(n.length / 2),
-      targetSize: s,
+  const s = e.replace("0x", "");
+  if (s.length > n * 2)
+    throw new Te({
+      size: Math.ceil(s.length / 2),
+      targetSize: n,
       type: "hex"
     });
-  return `0x${n[t === "right" ? "padEnd" : "padStart"](s * 2, "0")}`;
+  return `0x${s[t === "right" ? "padEnd" : "padStart"](n * 2, "0")}`;
 }
-function it(e, { dir: t, size: s = 32 } = {}) {
-  if (s === null)
+function rt(e, { dir: t, size: n = 32 } = {}) {
+  if (n === null)
     return e;
-  if (e.length > s)
-    throw new ve({
+  if (e.length > n)
+    throw new Te({
       size: e.length,
-      targetSize: s,
+      targetSize: n,
       type: "bytes"
     });
-  const n = new Uint8Array(s);
-  for (let i = 0; i < s; i++) {
+  const s = new Uint8Array(n);
+  for (let i = 0; i < n; i++) {
     const r = t === "right";
-    n[r ? i : s - i - 1] = e[r ? i : e.length - i - 1];
+    s[r ? i : n - i - 1] = e[r ? i : e.length - i - 1];
   }
-  return n;
+  return s;
 }
-class rt extends u {
-  constructor({ max: t, min: s, signed: n, size: i, value: r }) {
-    super(`Number "${r}" is not in safe ${i ? `${i * 8}-bit ${n ? "signed" : "unsigned"} ` : ""}integer range ${t ? `(${s} to ${t})` : `(above ${s})`}`, { name: "IntegerOutOfRangeError" });
+class ot extends u {
+  constructor({ max: t, min: n, signed: s, size: i, value: r }) {
+    super(`Number "${r}" is not in safe ${i ? `${i * 8}-bit ${s ? "signed" : "unsigned"} ` : ""}integer range ${t ? `(${n} to ${t})` : `(above ${n})`}`, { name: "IntegerOutOfRangeError" });
   }
 }
-class qs extends u {
+class Jn extends u {
   constructor(t) {
     super(`Bytes value "${t}" is not a valid boolean. The bytes array must contain a single byte of either a 0 or 1 value.`, {
       name: "InvalidBytesBooleanError"
     });
   }
 }
-class ot extends u {
+class at extends u {
   constructor(t) {
     super(`Hex value "${t}" is not a valid boolean. The hex value must be "0x0" (false) or "0x1" (true).`, { name: "InvalidHexBooleanError" });
   }
 }
-class at extends u {
-  constructor({ givenSize: t, maxSize: s }) {
-    super(`Size cannot exceed ${s} bytes. Given size: ${t} bytes.`, { name: "SizeOverflowError" });
+class ct extends u {
+  constructor({ givenSize: t, maxSize: n }) {
+    super(`Size cannot exceed ${n} bytes. Given size: ${t} bytes.`, { name: "SizeOverflowError" });
   }
 }
 function T(e, { dir: t = "left" } = {}) {
-  let s = typeof e == "string" ? e.replace("0x", "") : e, n = 0;
-  for (let i = 0; i < s.length - 1 && s[t === "left" ? i : s.length - i - 1].toString() === "0"; i++)
-    n++;
-  return s = t === "left" ? s.slice(n) : s.slice(0, s.length - n), typeof e == "string" ? (s.length === 1 && t === "right" && (s = `${s}0`), `0x${s.length % 2 === 1 ? `0${s}` : s}`) : s;
+  let n = typeof e == "string" ? e.replace("0x", "") : e, s = 0;
+  for (let i = 0; i < n.length - 1 && n[t === "left" ? i : n.length - i - 1].toString() === "0"; i++)
+    s++;
+  return n = t === "left" ? n.slice(s) : n.slice(0, n.length - s), typeof e == "string" ? (n.length === 1 && t === "right" && (n = `${n}0`), `0x${n.length % 2 === 1 ? `0${n}` : n}`) : n;
 }
 function U(e, { size: t }) {
   if (P(e) > t)
-    throw new at({
+    throw new ct({
       givenSize: P(e),
       maxSize: t
     });
 }
-function F(e, t = {}) {
-  const { signed: s } = t;
+function L(e, t = {}) {
+  const { signed: n } = t;
   t.size && U(e, { size: t.size });
-  const n = BigInt(e);
-  if (!s)
-    return n;
+  const s = BigInt(e);
+  if (!n)
+    return s;
   const i = (e.length - 2) / 2, r = (1n << BigInt(i) * 8n - 1n) - 1n;
-  return n <= r ? n : n - BigInt(`0x${"f".padStart(i * 2, "f")}`) - 1n;
+  return s <= r ? s : s - BigInt(`0x${"f".padStart(i * 2, "f")}`) - 1n;
 }
-function Ys(e, t = {}) {
-  let s = e;
-  if (t.size && (U(s, { size: t.size }), s = T(s)), T(s) === "0x00")
+function Qn(e, t = {}) {
+  let n = e;
+  if (t.size && (U(n, { size: t.size }), n = T(n)), T(n) === "0x00")
     return !1;
-  if (T(s) === "0x01")
+  if (T(n) === "0x01")
     return !0;
-  throw new ot(s);
+  throw new at(n);
 }
-function R(e, t = {}) {
-  return Number(F(e, t));
+function K(e, t = {}) {
+  return Number(L(e, t));
 }
-const ct = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ut = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function d(e, t = {}) {
-  return typeof e == "number" || typeof e == "bigint" ? Te(e, t) : typeof e == "string" ? lt(e, t) : typeof e == "boolean" ? ut(e, t) : I(e, t);
+  return typeof e == "number" || typeof e == "bigint" ? $e(e, t) : typeof e == "string" ? dt(e, t) : typeof e == "boolean" ? ft(e, t) : I(e, t);
 }
-function ut(e, t = {}) {
-  const s = `0x${Number(e)}`;
-  return typeof t.size == "number" ? (U(s, { size: t.size }), L(s, { size: t.size })) : s;
+function ft(e, t = {}) {
+  const n = `0x${Number(e)}`;
+  return typeof t.size == "number" ? (U(n, { size: t.size }), G(n, { size: t.size })) : n;
 }
 function I(e, t = {}) {
-  let s = "";
+  let n = "";
   for (let i = 0; i < e.length; i++)
-    s += ct[e[i]];
-  const n = `0x${s}`;
-  return typeof t.size == "number" ? (U(n, { size: t.size }), L(n, { dir: "right", size: t.size })) : n;
+    n += ut[e[i]];
+  const s = `0x${n}`;
+  return typeof t.size == "number" ? (U(s, { size: t.size }), G(s, { dir: "right", size: t.size })) : s;
 }
-function Te(e, t = {}) {
-  const { signed: s, size: n } = t, i = BigInt(e);
+function $e(e, t = {}) {
+  const { signed: n, size: s } = t, i = BigInt(e);
   let r;
-  n ? s ? r = (1n << BigInt(n) * 8n - 1n) - 1n : r = 2n ** (BigInt(n) * 8n) - 1n : typeof e == "number" && (r = BigInt(Number.MAX_SAFE_INTEGER));
-  const o = typeof r == "bigint" && s ? -r - 1n : 0;
+  s ? n ? r = (1n << BigInt(s) * 8n - 1n) - 1n : r = 2n ** (BigInt(s) * 8n) - 1n : typeof e == "number" && (r = BigInt(Number.MAX_SAFE_INTEGER));
+  const o = typeof r == "bigint" && n ? -r - 1n : 0;
   if (r && i > r || i < o) {
     const c = typeof e == "bigint" ? "n" : "";
-    throw new rt({
+    throw new ot({
       max: r ? `${r}${c}` : void 0,
       min: `${o}${c}`,
-      signed: s,
-      size: n,
+      signed: n,
+      size: s,
       value: `${e}${c}`
     });
   }
-  const a = `0x${(s && i < 0 ? (1n << BigInt(n * 8)) + BigInt(i) : i).toString(16)}`;
-  return n ? L(a, { size: n }) : a;
+  const a = `0x${(n && i < 0 ? (1n << BigInt(s * 8)) + BigInt(i) : i).toString(16)}`;
+  return s ? G(a, { size: s }) : a;
 }
-const ft = /* @__PURE__ */ new TextEncoder();
-function lt(e, t = {}) {
-  const s = ft.encode(e);
-  return I(s, t);
+const lt = /* @__PURE__ */ new TextEncoder();
+function dt(e, t = {}) {
+  const n = lt.encode(e);
+  return I(n, t);
 }
-const dt = /* @__PURE__ */ new TextEncoder();
-function $e(e, t = {}) {
-  return typeof e == "number" || typeof e == "bigint" ? pt(e, t) : typeof e == "boolean" ? ht(e, t) : V(e) ? z(e, t) : ze(e, t);
+const ht = /* @__PURE__ */ new TextEncoder();
+function ze(e, t = {}) {
+  return typeof e == "number" || typeof e == "bigint" ? bt(e, t) : typeof e == "boolean" ? pt(e, t) : _(e) ? z(e, t) : Ae(e, t);
 }
-function ht(e, t = {}) {
-  const s = new Uint8Array(1);
-  return s[0] = Number(e), typeof t.size == "number" ? (U(s, { size: t.size }), L(s, { size: t.size })) : s;
+function pt(e, t = {}) {
+  const n = new Uint8Array(1);
+  return n[0] = Number(e), typeof t.size == "number" ? (U(n, { size: t.size }), G(n, { size: t.size })) : n;
 }
 const m = {
   zero: 48,
@@ -218,7 +218,7 @@ const m = {
   a: 97,
   f: 102
 };
-function le(e) {
+function he(e) {
   if (e >= m.zero && e <= m.nine)
     return e - m.zero;
   if (e >= m.A && e <= m.F)
@@ -227,143 +227,180 @@ function le(e) {
     return e - (m.a - 10);
 }
 function z(e, t = {}) {
-  let s = e;
-  t.size && (U(s, { size: t.size }), s = L(s, { dir: "right", size: t.size }));
-  let n = s.slice(2);
-  n.length % 2 && (n = `0${n}`);
-  const i = n.length / 2, r = new Uint8Array(i);
+  let n = e;
+  t.size && (U(n, { size: t.size }), n = G(n, { dir: "right", size: t.size }));
+  let s = n.slice(2);
+  s.length % 2 && (s = `0${s}`);
+  const i = s.length / 2, r = new Uint8Array(i);
   for (let o = 0, a = 0; o < i; o++) {
-    const c = le(n.charCodeAt(a++)), f = le(n.charCodeAt(a++));
+    const c = he(s.charCodeAt(a++)), f = he(s.charCodeAt(a++));
     if (c === void 0 || f === void 0)
-      throw new u(`Invalid byte sequence ("${n[a - 2]}${n[a - 1]}" in "${n}").`);
+      throw new u(`Invalid byte sequence ("${s[a - 2]}${s[a - 1]}" in "${s}").`);
     r[o] = c * 16 + f;
   }
   return r;
 }
-function pt(e, t) {
-  const s = Te(e, t);
-  return z(s);
+function bt(e, t) {
+  const n = $e(e, t);
+  return z(n);
 }
-function ze(e, t = {}) {
-  const s = dt.encode(e);
-  return typeof t.size == "number" ? (U(s, { size: t.size }), L(s, { dir: "right", size: t.size })) : s;
+function Ae(e, t = {}) {
+  const n = ht.encode(e);
+  return typeof t.size == "number" ? (U(n, { size: t.size }), G(n, { dir: "right", size: t.size })) : n;
 }
-function de(e) {
+function W(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error("positive integer expected, got " + e);
 }
-function bt(e) {
+function xt(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
-function ee(e, ...t) {
-  if (!bt(e))
+function q(e, ...t) {
+  if (!xt(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
 }
-function K(e, t = !0) {
+function Zn(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.wrapConstructor");
+  W(e.outputLen), W(e.blockLen);
+}
+function X(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Ae(e, t) {
-  ee(e);
-  const s = t.outputLen;
-  if (e.length < s)
-    throw new Error("digestInto() expects output buffer of length at least " + s);
-}
-const D = /* @__PURE__ */ BigInt(2 ** 32 - 1), he = /* @__PURE__ */ BigInt(32);
-function xt(e, t = !1) {
-  return t ? { h: Number(e & D), l: Number(e >> he & D) } : { h: Number(e >> he & D) | 0, l: Number(e & D) | 0 };
+function Ue(e, t) {
+  q(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
 }
+const R = /* @__PURE__ */ BigInt(2 ** 32 - 1), pe = /* @__PURE__ */ BigInt(32);
 function mt(e, t = !1) {
-  let s = new Uint32Array(e.length), n = new Uint32Array(e.length);
+  return t ? { h: Number(e & R), l: Number(e >> pe & R) } : { h: Number(e >> pe & R) | 0, l: Number(e & R) | 0 };
+}
+function gt(e, t = !1) {
+  let n = new Uint32Array(e.length), s = new Uint32Array(e.length);
   for (let i = 0; i < e.length; i++) {
-    const { h: r, l: o } = xt(e[i], t);
-    [s[i], n[i]] = [r, o];
+    const { h: r, l: o } = mt(e[i], t);
+    [n[i], s[i]] = [r, o];
   }
-  return [s, n];
+  return [n, s];
 }
-const gt = (e, t, s) => e << s | t >>> 32 - s, yt = (e, t, s) => t << s | e >>> 32 - s, wt = (e, t, s) => t << s - 32 | e >>> 64 - s, Pt = (e, t, s) => e << s - 32 | t >>> 64 - s;
+const yt = (e, t, n) => e << n | t >>> 32 - n, wt = (e, t, n) => t << n | e >>> 32 - n, Pt = (e, t, n) => t << n - 32 | e >>> 64 - n, Et = (e, t, n) => e << n - 32 | t >>> 64 - n, F = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Et = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), J = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), x = (e, t) => e << 32 - t | e >>> t, pe = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, Bt = (e) => e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
-function be(e) {
-  for (let t = 0; t < e.length; t++)
-    e[t] = Bt(e[t]);
+function Bt(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function ee(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function x(e, t) {
+  return e << 32 - t | e >>> t;
 }
+const be = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 function It(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function xe(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = It(e[t]);
+}
+function vt(e) {
   if (typeof e != "string")
     throw new Error("utf8ToBytes expected string, got " + typeof e);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function te(e) {
-  return typeof e == "string" && (e = It(e)), ee(e), e;
+function se(e) {
+  return typeof e == "string" && (e = vt(e)), q(e), e;
 }
-class Ue {
+function es(...e) {
+  let t = 0;
+  for (let s = 0; s < e.length; s++) {
+    const i = e[s];
+    q(i), t += i.length;
+  }
+  const n = new Uint8Array(t);
+  for (let s = 0, i = 0; s < e.length; s++) {
+    const r = e[s];
+    n.set(r, i), i += r.length;
+  }
+  return n;
+}
+class Ce {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function Ce(e) {
-  const t = (n) => e().update(te(n)).digest(), s = e();
-  return t.outputLen = s.outputLen, t.blockLen = s.blockLen, t.create = () => e(), t;
+function Fe(e) {
+  const t = (s) => e().update(se(s)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-const Fe = [], Le = [], Ge = [], vt = /* @__PURE__ */ BigInt(0), O = /* @__PURE__ */ BigInt(1), Tt = /* @__PURE__ */ BigInt(2), $t = /* @__PURE__ */ BigInt(7), zt = /* @__PURE__ */ BigInt(256), At = /* @__PURE__ */ BigInt(113);
-for (let e = 0, t = O, s = 1, n = 0; e < 24; e++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], Fe.push(2 * (5 * n + s)), Le.push((e + 1) * (e + 2) / 2 % 64);
-  let i = vt;
+function ts(e = 32) {
+  if (F && typeof F.getRandomValues == "function")
+    return F.getRandomValues(new Uint8Array(e));
+  if (F && typeof F.randomBytes == "function")
+    return F.randomBytes(e);
+  throw new Error("crypto.getRandomValues must be defined");
+}
+const Le = [], Ge = [], Se = [], Tt = /* @__PURE__ */ BigInt(0), N = /* @__PURE__ */ BigInt(1), $t = /* @__PURE__ */ BigInt(2), zt = /* @__PURE__ */ BigInt(7), At = /* @__PURE__ */ BigInt(256), Ut = /* @__PURE__ */ BigInt(113);
+for (let e = 0, t = N, n = 1, s = 0; e < 24; e++) {
+  [n, s] = [s, (2 * n + 3 * s) % 5], Le.push(2 * (5 * s + n)), Ge.push((e + 1) * (e + 2) / 2 % 64);
+  let i = Tt;
   for (let r = 0; r < 7; r++)
-    t = (t << O ^ (t >> $t) * At) % zt, t & Tt && (i ^= O << (O << /* @__PURE__ */ BigInt(r)) - O);
-  Ge.push(i);
+    t = (t << N ^ (t >> zt) * Ut) % At, t & $t && (i ^= N << (N << /* @__PURE__ */ BigInt(r)) - N);
+  Se.push(i);
 }
-const [Ut, Ct] = /* @__PURE__ */ mt(Ge, !0), xe = (e, t, s) => s > 32 ? wt(e, t, s) : gt(e, t, s), me = (e, t, s) => s > 32 ? Pt(e, t, s) : yt(e, t, s);
-function Ft(e, t = 24) {
-  const s = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
+const [Ct, Ft] = /* @__PURE__ */ gt(Se, !0), me = (e, t, n) => n > 32 ? Pt(e, t, n) : yt(e, t, n), ge = (e, t, n) => n > 32 ? Et(e, t, n) : wt(e, t, n);
+function Lt(e, t = 24) {
+  const n = new Uint32Array(10);
+  for (let s = 24 - t; s < 24; s++) {
     for (let o = 0; o < 10; o++)
-      s[o] = e[o] ^ e[o + 10] ^ e[o + 20] ^ e[o + 30] ^ e[o + 40];
+      n[o] = e[o] ^ e[o + 10] ^ e[o + 20] ^ e[o + 30] ^ e[o + 40];
     for (let o = 0; o < 10; o += 2) {
-      const a = (o + 8) % 10, c = (o + 2) % 10, f = s[c], h = s[c + 1], l = xe(f, h, 1) ^ s[a], b = me(f, h, 1) ^ s[a + 1];
+      const a = (o + 8) % 10, c = (o + 2) % 10, f = n[c], h = n[c + 1], l = me(f, h, 1) ^ n[a], b = ge(f, h, 1) ^ n[a + 1];
       for (let p = 0; p < 50; p += 10)
         e[o + p] ^= l, e[o + p + 1] ^= b;
     }
     let i = e[2], r = e[3];
     for (let o = 0; o < 24; o++) {
-      const a = Le[o], c = xe(i, r, a), f = me(i, r, a), h = Fe[o];
+      const a = Ge[o], c = me(i, r, a), f = ge(i, r, a), h = Le[o];
       i = e[h], r = e[h + 1], e[h] = c, e[h + 1] = f;
     }
     for (let o = 0; o < 50; o += 10) {
       for (let a = 0; a < 10; a++)
-        s[a] = e[o + a];
+        n[a] = e[o + a];
       for (let a = 0; a < 10; a++)
-        e[o + a] ^= ~s[(a + 2) % 10] & s[(a + 4) % 10];
+        e[o + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= Ut[n], e[1] ^= Ct[n];
+    e[0] ^= Ct[s], e[1] ^= Ft[s];
   }
-  s.fill(0);
+  n.fill(0);
 }
-class se extends Ue {
+class ie extends Ce {
   // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, n, i = !1, r = 24) {
-    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = i, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, de(n), 0 >= this.blockLen || this.blockLen >= 200)
+  constructor(t, n, s, i = !1, r = 24) {
+    if (super(), this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = i, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, W(s), 0 >= this.blockLen || this.blockLen >= 200)
       throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = Et(this.state);
+    this.state = new Uint8Array(200), this.state32 = Bt(this.state);
   }
   keccak() {
-    pe || be(this.state32), Ft(this.state32, this.rounds), pe || be(this.state32), this.posOut = 0, this.pos = 0;
+    be || xe(this.state32), Lt(this.state32, this.rounds), be || xe(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    K(this);
-    const { blockLen: s, state: n } = this;
-    t = te(t);
+    X(this);
+    const { blockLen: n, state: s } = this;
+    t = se(t);
     const i = t.length;
     for (let r = 0; r < i; ) {
-      const o = Math.min(s - this.pos, i - r);
+      const o = Math.min(n - this.pos, i - r);
       for (let a = 0; a < o; a++)
-        n[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
+        s[this.pos++] ^= t[r++];
+      this.pos === n && this.keccak();
     }
     return this;
   }
@@ -371,16 +408,16 @@ class se extends Ue {
     if (this.finished)
       return;
     this.finished = !0;
-    const { state: t, suffix: s, pos: n, blockLen: i } = this;
-    t[n] ^= s, s & 128 && n === i - 1 && this.keccak(), t[i - 1] ^= 128, this.keccak();
+    const { state: t, suffix: n, pos: s, blockLen: i } = this;
+    t[s] ^= n, (n & 128) !== 0 && s === i - 1 && this.keccak(), t[i - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    K(this, !1), ee(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
+    X(this, !1), q(t), this.finish();
+    const n = this.state, { blockLen: s } = this;
     for (let i = 0, r = t.length; i < r; ) {
-      this.posOut >= n && this.keccak();
-      const o = Math.min(n - this.posOut, r - i);
-      t.set(s.subarray(this.posOut, this.posOut + o), i), this.posOut += o, i += o;
+      this.posOut >= s && this.keccak();
+      const o = Math.min(s - this.posOut, r - i);
+      t.set(n.subarray(this.posOut, this.posOut + o), i), this.posOut += o, i += o;
     }
     return t;
   }
@@ -390,10 +427,10 @@ class se extends Ue {
     return this.writeInto(t);
   }
   xof(t) {
-    return de(t), this.xofInto(new Uint8Array(t));
+    return W(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (Ae(t, this), this.finished)
+    if (Ue(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -404,14 +441,14 @@ class se extends Ue {
     this.destroyed = !0, this.state.fill(0);
   }
   _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: i, rounds: r, enableXOF: o } = this;
-    return t || (t = new se(s, n, i, o, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = i, t.enableXOF = o, t.destroyed = this.destroyed, t;
+    const { blockLen: n, suffix: s, outputLen: i, rounds: r, enableXOF: o } = this;
+    return t || (t = new ie(n, s, i, o, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = s, t.outputLen = i, t.enableXOF = o, t.destroyed = this.destroyed, t;
   }
 }
-const Lt = (e, t, s) => Ce(() => new se(t, e, s)), Gt = /* @__PURE__ */ Lt(1, 136, 256 / 8);
-function St(e, t) {
-  const s = t || "hex", n = Gt(V(e, { strict: !1 }) ? $e(e) : e);
-  return s === "bytes" ? n : d(n);
+const Gt = (e, t, n) => Fe(() => new ie(t, e, n)), St = /* @__PURE__ */ Gt(1, 136, 256 / 8);
+function kt(e, t) {
+  const n = t || "hex", s = St(_(e, { strict: !1 }) ? ze(e) : e);
+  return n === "bytes" ? s : d(s);
 }
 class E extends u {
   constructor({ address: t }) {
@@ -424,7 +461,7 @@ class E extends u {
     });
   }
 }
-class Se extends Map {
+class ke extends Map {
   constructor(t) {
     super(), Object.defineProperty(this, "maxSize", {
       enumerable: !0,
@@ -434,107 +471,107 @@ class Se extends Map {
     }), this.maxSize = t;
   }
   get(t) {
-    const s = super.get(t);
-    return super.has(t) && s !== void 0 && (this.delete(t), super.set(t, s)), s;
+    const n = super.get(t);
+    return super.has(t) && n !== void 0 && (this.delete(t), super.set(t, n)), n;
   }
-  set(t, s) {
-    if (super.set(t, s), this.maxSize && this.size > this.maxSize) {
-      const n = this.keys().next().value;
-      n && this.delete(n);
+  set(t, n) {
+    if (super.set(t, n), this.maxSize && this.size > this.maxSize) {
+      const s = this.keys().next().value;
+      s && this.delete(s);
     }
     return this;
   }
 }
-const Q = /* @__PURE__ */ new Se(8192);
+const te = /* @__PURE__ */ new ke(8192);
 function He(e, t) {
-  if (Q.has(`${e}.${t}`))
-    return Q.get(`${e}.${t}`);
-  const s = e.substring(2).toLowerCase(), n = St(ze(s), "bytes"), i = s.split("");
+  if (te.has(`${e}.${t}`))
+    return te.get(`${e}.${t}`);
+  const n = e.substring(2).toLowerCase(), s = kt(Ae(n), "bytes"), i = n.split("");
   for (let o = 0; o < 40; o += 2)
-    n[o >> 1] >> 4 >= 8 && i[o] && (i[o] = i[o].toUpperCase()), (n[o >> 1] & 15) >= 8 && i[o + 1] && (i[o + 1] = i[o + 1].toUpperCase());
+    s[o >> 1] >> 4 >= 8 && i[o] && (i[o] = i[o].toUpperCase()), (s[o >> 1] & 15) >= 8 && i[o + 1] && (i[o + 1] = i[o + 1].toUpperCase());
   const r = `0x${i.join("")}`;
-  return Q.set(`${e}.${t}`, r), r;
+  return te.set(`${e}.${t}`, r), r;
 }
-function Js(e, t) {
+function ns(e, t) {
   if (!B(e, { strict: !1 }))
     throw new E({ address: e });
   return He(e, t);
 }
-const Ht = /^0x[a-fA-F0-9]{40}$/, Z = /* @__PURE__ */ new Se(8192);
+const Ht = /^0x[a-fA-F0-9]{40}$/, ne = /* @__PURE__ */ new ke(8192);
 function B(e, t) {
-  const { strict: s = !0 } = t ?? {}, n = `${e}.${s}`;
-  if (Z.has(n))
-    return Z.get(n);
-  const i = Ht.test(e) ? e.toLowerCase() === e ? !0 : s ? He(e) === e : !0 : !1;
-  return Z.set(n, i), i;
+  const { strict: n = !0 } = t ?? {}, s = `${e}.${n}`;
+  if (ne.has(s))
+    return ne.get(s);
+  const i = Ht.test(e) ? e.toLowerCase() === e ? !0 : n ? He(e) === e : !0 : !1;
+  return ne.set(s, i), i;
 }
-function Qs(e) {
-  return typeof e[0] == "string" ? G(e) : kt(e);
+function ss(e) {
+  return typeof e[0] == "string" ? S(e) : Ot(e);
 }
-function kt(e) {
+function Ot(e) {
   let t = 0;
   for (const i of e)
     t += i.length;
-  const s = new Uint8Array(t);
-  let n = 0;
+  const n = new Uint8Array(t);
+  let s = 0;
   for (const i of e)
-    s.set(i, n), n += i.length;
-  return s;
+    n.set(i, s), s += i.length;
+  return n;
 }
-function G(e) {
-  return `0x${e.reduce((t, s) => t + s.replace("0x", ""), "")}`;
+function S(e) {
+  return `0x${e.reduce((t, n) => t + n.replace("0x", ""), "")}`;
 }
-function Ot(e, t, s, { strict: n } = {}) {
-  return V(e, { strict: !1 }) ? Mt(e, t, s, {
-    strict: n
-  }) : Nt(e, t, s, {
-    strict: n
+function Nt(e, t, n, { strict: s } = {}) {
+  return _(e, { strict: !1 }) ? Vt(e, t, n, {
+    strict: s
+  }) : Mt(e, t, n, {
+    strict: s
   });
 }
-function ke(e, t) {
+function Oe(e, t) {
   if (typeof t == "number" && t > 0 && t > P(e) - 1)
-    throw new Ie({
+    throw new ve({
       offset: t,
       position: "start",
       size: P(e)
     });
 }
-function Oe(e, t, s) {
-  if (typeof t == "number" && typeof s == "number" && P(e) !== s - t)
-    throw new Ie({
-      offset: s,
+function Ne(e, t, n) {
+  if (typeof t == "number" && typeof n == "number" && P(e) !== n - t)
+    throw new ve({
+      offset: n,
       position: "end",
       size: P(e)
     });
 }
-function Nt(e, t, s, { strict: n } = {}) {
-  ke(e, t);
-  const i = e.slice(t, s);
-  return n && Oe(i, t, s), i;
+function Mt(e, t, n, { strict: s } = {}) {
+  Oe(e, t);
+  const i = e.slice(t, n);
+  return s && Ne(i, t, n), i;
 }
-function Mt(e, t, s, { strict: n } = {}) {
-  ke(e, t);
-  const i = `0x${e.replace("0x", "").slice((t ?? 0) * 2, (s ?? e.length) * 2)}`;
-  return n && Oe(i, t, s), i;
+function Vt(e, t, n, { strict: s } = {}) {
+  Oe(e, t);
+  const i = `0x${e.replace("0x", "").slice((t ?? 0) * 2, (n ?? e.length) * 2)}`;
+  return s && Ne(i, t, n), i;
 }
-class ge extends u {
+class ye extends u {
   constructor({ offset: t }) {
     super(`Offset \`${t}\` cannot be negative.`, {
       name: "NegativeOffsetError"
     });
   }
 }
-class Vt extends u {
-  constructor({ length: t, position: s }) {
-    super(`Position \`${s}\` is out of bounds (\`0 < position < ${t}\`).`, { name: "PositionOutOfBoundsError" });
+class _t extends u {
+  constructor({ length: t, position: n }) {
+    super(`Position \`${n}\` is out of bounds (\`0 < position < ${t}\`).`, { name: "PositionOutOfBoundsError" });
   }
 }
-class _t extends u {
-  constructor({ count: t, limit: s }) {
-    super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${t}\`).`, { name: "RecursiveReadLimitExceededError" });
+class jt extends u {
+  constructor({ count: t, limit: n }) {
+    super(`Recursive read limit of \`${n}\` exceeded (recursive read count: \`${t}\`).`, { name: "RecursiveReadLimitExceededError" });
   }
 }
-const jt = {
+const Dt = {
   bytes: new Uint8Array(),
   dataView: new DataView(new ArrayBuffer(0)),
   position: 0,
@@ -543,21 +580,21 @@ const jt = {
   recursiveReadLimit: Number.POSITIVE_INFINITY,
   assertReadLimit() {
     if (this.recursiveReadCount >= this.recursiveReadLimit)
-      throw new _t({
+      throw new jt({
         count: this.recursiveReadCount + 1,
         limit: this.recursiveReadLimit
       });
   },
   assertPosition(e) {
     if (e < 0 || e > this.bytes.length - 1)
-      throw new Vt({
+      throw new _t({
         length: this.bytes.length,
         position: e
       });
   },
   decrementPosition(e) {
     if (e < 0)
-      throw new ge({ offset: e });
+      throw new ye({ offset: e });
     const t = this.position - e;
     this.assertPosition(t), this.position = t;
   },
@@ -566,7 +603,7 @@ const jt = {
   },
   incrementPosition(e) {
     if (e < 0)
-      throw new ge({ offset: e });
+      throw new ye({ offset: e });
     const t = this.position + e;
     this.assertPosition(t), this.position = t;
   },
@@ -575,8 +612,8 @@ const jt = {
     return this.assertPosition(t), this.bytes[t];
   },
   inspectBytes(e, t) {
-    const s = t ?? this.position;
-    return this.assertPosition(s + e - 1), this.bytes.subarray(s, s + e);
+    const n = t ?? this.position;
+    return this.assertPosition(n + e - 1), this.bytes.subarray(n, n + e);
   },
   inspectUint8(e) {
     const t = e ?? this.position;
@@ -619,8 +656,8 @@ const jt = {
   },
   readBytes(e, t) {
     this.assertReadLimit(), this._touch();
-    const s = this.inspectBytes(e);
-    return this.position += t ?? e, s;
+    const n = this.inspectBytes(e);
+    return this.position += t ?? e, n;
   },
   readUint8() {
     this.assertReadLimit(), this._touch();
@@ -656,39 +693,39 @@ const jt = {
     this.positionReadCount.set(this.position, e + 1), e > 0 && this.recursiveReadCount++;
   }
 };
-function Ne(e, { recursiveReadLimit: t = 8192 } = {}) {
-  const s = Object.create(jt);
-  return s.bytes = e, s.dataView = new DataView(e.buffer, e.byteOffset, e.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = t, s;
+function Me(e, { recursiveReadLimit: t = 8192 } = {}) {
+  const n = Object.create(Dt);
+  return n.bytes = e, n.dataView = new DataView(e.buffer, e.byteOffset, e.byteLength), n.positionReadCount = /* @__PURE__ */ new Map(), n.recursiveReadLimit = t, n;
 }
-const Dt = {
+const Rt = {
   gwei: 9,
   wei: 18
-}, Rt = {
+}, Kt = {
   ether: -9,
   wei: 9
 };
-function Me(e, t) {
-  let s = e.toString();
-  const n = s.startsWith("-");
-  n && (s = s.slice(1)), s = s.padStart(t, "0");
+function Ve(e, t) {
+  let n = e.toString();
+  const s = n.startsWith("-");
+  s && (n = n.slice(1)), n = n.padStart(t, "0");
   let [i, r] = [
-    s.slice(0, s.length - t),
-    s.slice(s.length - t)
+    n.slice(0, n.length - t),
+    n.slice(n.length - t)
   ];
-  return r = r.replace(/(0+)$/, ""), `${n ? "-" : ""}${i || "0"}${r ? `.${r}` : ""}`;
+  return r = r.replace(/(0+)$/, ""), `${s ? "-" : ""}${i || "0"}${r ? `.${r}` : ""}`;
 }
-function Kt(e, t = "wei") {
-  return Me(e, Dt[t]);
+function Wt(e, t = "wei") {
+  return Ve(e, Rt[t]);
 }
 function $(e, t = "wei") {
-  return Me(e, Rt[t]);
+  return Ve(e, Kt[t]);
 }
-function Ve(e) {
-  const t = Object.entries(e).map(([n, i]) => i === void 0 || i === !1 ? null : [n, i]).filter(Boolean), s = t.reduce((n, [i]) => Math.max(n, i.length), 0);
-  return t.map(([n, i]) => `  ${`${n}:`.padEnd(s + 1)}  ${i}`).join(`
+function _e(e) {
+  const t = Object.entries(e).map(([s, i]) => i === void 0 || i === !1 ? null : [s, i]).filter(Boolean), n = t.reduce((s, [i]) => Math.max(s, i.length), 0);
+  return t.map(([s, i]) => `  ${`${s}:`.padEnd(n + 1)}  ${i}`).join(`
 `);
 }
-class Zs extends u {
+class is extends u {
   constructor() {
     super([
       "Cannot specify both a `gasPrice` and a `maxFeePerGas`/`maxPriorityFeePerGas`.",
@@ -697,20 +734,20 @@ class Zs extends u {
 `), { name: "FeeConflictError" });
   }
 }
-class Wt extends u {
+class Xt extends u {
   constructor({ v: t }) {
     super(`Invalid \`v\` value "${t}". Expected 27 or 28.`, {
       name: "InvalidLegacyVError"
     });
   }
 }
-class Xt extends u {
+class qt extends u {
   constructor({ transaction: t }) {
     super("Cannot infer a transaction type from provided transaction.", {
       metaMessages: [
         "Provided Transaction:",
         "{",
-        Ve(t),
+        _e(t),
         "}",
         "",
         "To infer the type, either provide:",
@@ -725,19 +762,19 @@ class Xt extends u {
     });
   }
 }
-class qt extends u {
+class Yt extends u {
   constructor({ storageKey: t }) {
     super(`Size for storage key "${t}" is invalid. Expected 32 bytes. Got ${Math.floor((t.length - 2) / 2)} bytes.`, { name: "InvalidStorageKeySizeError" });
   }
 }
-class en extends u {
-  constructor(t, { account: s, docsPath: n, chain: i, data: r, gas: o, gasPrice: a, maxFeePerGas: c, maxPriorityFeePerGas: f, nonce: h, to: l, value: b }) {
+class rs extends u {
+  constructor(t, { account: n, docsPath: s, chain: i, data: r, gas: o, gasPrice: a, maxFeePerGas: c, maxPriorityFeePerGas: f, nonce: h, to: l, value: b }) {
     var g;
-    const p = Ve({
+    const p = _e({
       chain: i && `${i == null ? void 0 : i.name} (id: ${i == null ? void 0 : i.id})`,
-      from: s == null ? void 0 : s.address,
+      from: n == null ? void 0 : n.address,
       to: l,
-      value: typeof b < "u" && `${Kt(b)} ${((g = i == null ? void 0 : i.nativeCurrency) == null ? void 0 : g.symbol) || "ETH"}`,
+      value: typeof b < "u" && `${Wt(b)} ${((g = i == null ? void 0 : i.nativeCurrency) == null ? void 0 : g.symbol) || "ETH"}`,
       data: r,
       gas: o,
       gasPrice: typeof a < "u" && `${$(a)} gwei`,
@@ -747,7 +784,7 @@ class en extends u {
     });
     super(t.shortMessage, {
       cause: t,
-      docsPath: n,
+      docsPath: s,
       metaMessages: [
         ...t.metaMessages ? [...t.metaMessages, " "] : [],
         "Request Arguments:",
@@ -762,54 +799,54 @@ class en extends u {
     }), this.cause = t;
   }
 }
-class tn extends u {
-  constructor({ blockHash: t, blockNumber: s, blockTag: n, hash: i, index: r }) {
+class os extends u {
+  constructor({ blockHash: t, blockNumber: n, blockTag: s, hash: i, index: r }) {
     let o = "Transaction";
-    n && r !== void 0 && (o = `Transaction at block time "${n}" at index "${r}"`), t && r !== void 0 && (o = `Transaction at block hash "${t}" at index "${r}"`), s && r !== void 0 && (o = `Transaction at block number "${s}" at index "${r}"`), i && (o = `Transaction with hash "${i}"`), super(`${o} could not be found.`, {
+    s && r !== void 0 && (o = `Transaction at block time "${s}" at index "${r}"`), t && r !== void 0 && (o = `Transaction at block hash "${t}" at index "${r}"`), n && r !== void 0 && (o = `Transaction at block number "${n}" at index "${r}"`), i && (o = `Transaction with hash "${i}"`), super(`${o} could not be found.`, {
       name: "TransactionNotFoundError"
     });
   }
 }
-class sn extends u {
+class as extends u {
   constructor({ hash: t }) {
     super(`Transaction receipt with hash "${t}" could not be found. The Transaction may not be processed on a block yet.`, {
       name: "TransactionReceiptNotFoundError"
     });
   }
 }
-class nn extends u {
+class cs extends u {
   constructor({ hash: t }) {
     super(`Timed out while waiting for transaction with hash "${t}" to be confirmed.`, { name: "WaitForTransactionReceiptTimeoutError" });
   }
 }
 function A(e, t = "hex") {
-  const s = _e(e), n = Ne(new Uint8Array(s.length));
-  return s.encode(n), t === "hex" ? I(n.bytes) : n.bytes;
+  const n = je(e), s = Me(new Uint8Array(n.length));
+  return n.encode(s), t === "hex" ? I(s.bytes) : s.bytes;
 }
-function _e(e) {
-  return Array.isArray(e) ? Yt(e.map((t) => _e(t))) : Jt(e);
+function je(e) {
+  return Array.isArray(e) ? Jt(e.map((t) => je(t))) : Qt(e);
 }
-function Yt(e) {
-  const t = e.reduce((i, r) => i + r.length, 0), s = je(t);
+function Jt(e) {
+  const t = e.reduce((i, r) => i + r.length, 0), n = De(t);
   return {
-    length: t <= 55 ? 1 + t : 1 + s + t,
+    length: t <= 55 ? 1 + t : 1 + n + t,
     encode(i) {
-      t <= 55 ? i.pushByte(192 + t) : (i.pushByte(247 + s), s === 1 ? i.pushUint8(t) : s === 2 ? i.pushUint16(t) : s === 3 ? i.pushUint24(t) : i.pushUint32(t));
+      t <= 55 ? i.pushByte(192 + t) : (i.pushByte(247 + n), n === 1 ? i.pushUint8(t) : n === 2 ? i.pushUint16(t) : n === 3 ? i.pushUint24(t) : i.pushUint32(t));
       for (const { encode: r } of e)
         r(i);
     }
   };
 }
-function Jt(e) {
-  const t = typeof e == "string" ? z(e) : e, s = je(t.length);
+function Qt(e) {
+  const t = typeof e == "string" ? z(e) : e, n = De(t.length);
   return {
-    length: t.length === 1 && t[0] < 128 ? 1 : t.length <= 55 ? 1 + t.length : 1 + s + t.length,
+    length: t.length === 1 && t[0] < 128 ? 1 : t.length <= 55 ? 1 + t.length : 1 + n + t.length,
     encode(i) {
-      t.length === 1 && t[0] < 128 ? i.pushBytes(t) : t.length <= 55 ? (i.pushByte(128 + t.length), i.pushBytes(t)) : (i.pushByte(183 + s), s === 1 ? i.pushUint8(t.length) : s === 2 ? i.pushUint16(t.length) : s === 3 ? i.pushUint24(t.length) : i.pushUint32(t.length), i.pushBytes(t));
+      t.length === 1 && t[0] < 128 ? i.pushBytes(t) : t.length <= 55 ? (i.pushByte(128 + t.length), i.pushBytes(t)) : (i.pushByte(183 + n), n === 1 ? i.pushUint8(t.length) : n === 2 ? i.pushUint16(t.length) : n === 3 ? i.pushUint24(t.length) : i.pushUint32(t.length), i.pushBytes(t));
     }
   };
 }
-function je(e) {
+function De(e) {
   if (e < 2 ** 8)
     return 1;
   if (e < 2 ** 16)
@@ -820,94 +857,94 @@ function je(e) {
     return 4;
   throw new u("Length is too large.");
 }
-class De extends u {
-  constructor({ cause: t, message: s } = {}) {
+class Re extends u {
+  constructor({ cause: t, message: n } = {}) {
     var i;
-    const n = (i = s == null ? void 0 : s.replace("execution reverted: ", "")) == null ? void 0 : i.replace("execution reverted", "");
-    super(`Execution reverted ${n ? `with reason: ${n}` : "for an unknown reason"}.`, {
+    const s = (i = n == null ? void 0 : n.replace("execution reverted: ", "")) == null ? void 0 : i.replace("execution reverted", "");
+    super(`Execution reverted ${s ? `with reason: ${s}` : "for an unknown reason"}.`, {
       cause: t,
       name: "ExecutionRevertedError"
     });
   }
 }
-Object.defineProperty(De, "code", {
+Object.defineProperty(Re, "code", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: 3
 });
-Object.defineProperty(De, "nodeMessage", {
+Object.defineProperty(Re, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /execution reverted/
 });
-class W extends u {
-  constructor({ cause: t, maxFeePerGas: s } = {}) {
-    super(`The fee cap (\`maxFeePerGas\`${s ? ` = ${$(s)} gwei` : ""}) cannot be higher than the maximum allowed value (2^256-1).`, {
+class Y extends u {
+  constructor({ cause: t, maxFeePerGas: n } = {}) {
+    super(`The fee cap (\`maxFeePerGas\`${n ? ` = ${$(n)} gwei` : ""}) cannot be higher than the maximum allowed value (2^256-1).`, {
       cause: t,
       name: "FeeCapTooHighError"
     });
   }
 }
-Object.defineProperty(W, "nodeMessage", {
+Object.defineProperty(Y, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/
 });
-class Qt extends u {
-  constructor({ cause: t, maxFeePerGas: s } = {}) {
-    super(`The fee cap (\`maxFeePerGas\`${s ? ` = ${$(s)}` : ""} gwei) cannot be lower than the block base fee.`, {
+class Zt extends u {
+  constructor({ cause: t, maxFeePerGas: n } = {}) {
+    super(`The fee cap (\`maxFeePerGas\`${n ? ` = ${$(n)}` : ""} gwei) cannot be lower than the block base fee.`, {
       cause: t,
       name: "FeeCapTooLowError"
     });
   }
 }
-Object.defineProperty(Qt, "nodeMessage", {
+Object.defineProperty(Zt, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /max fee per gas less than block base fee|fee cap less than block base fee|transaction is outdated/
 });
-class Zt extends u {
-  constructor({ cause: t, nonce: s } = {}) {
-    super(`Nonce provided for the transaction ${s ? `(${s}) ` : ""}is higher than the next one expected.`, { cause: t, name: "NonceTooHighError" });
+class en extends u {
+  constructor({ cause: t, nonce: n } = {}) {
+    super(`Nonce provided for the transaction ${n ? `(${n}) ` : ""}is higher than the next one expected.`, { cause: t, name: "NonceTooHighError" });
   }
 }
-Object.defineProperty(Zt, "nodeMessage", {
+Object.defineProperty(en, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /nonce too high/
 });
-class es extends u {
-  constructor({ cause: t, nonce: s } = {}) {
+class tn extends u {
+  constructor({ cause: t, nonce: n } = {}) {
     super([
-      `Nonce provided for the transaction ${s ? `(${s}) ` : ""}is lower than the current nonce of the account.`,
+      `Nonce provided for the transaction ${n ? `(${n}) ` : ""}is lower than the current nonce of the account.`,
       "Try increasing the nonce or find the latest nonce with `getTransactionCount`."
     ].join(`
 `), { cause: t, name: "NonceTooLowError" });
   }
 }
-Object.defineProperty(es, "nodeMessage", {
+Object.defineProperty(tn, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /nonce too low|transaction already imported|already known/
 });
-class ts extends u {
-  constructor({ cause: t, nonce: s } = {}) {
-    super(`Nonce provided for the transaction ${s ? `(${s}) ` : ""}exceeds the maximum allowed nonce.`, { cause: t, name: "NonceMaxValueError" });
+class nn extends u {
+  constructor({ cause: t, nonce: n } = {}) {
+    super(`Nonce provided for the transaction ${n ? `(${n}) ` : ""}exceeds the maximum allowed nonce.`, { cause: t, name: "NonceMaxValueError" });
   }
 }
-Object.defineProperty(ts, "nodeMessage", {
+Object.defineProperty(nn, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /nonce has max value/
 });
-class ss extends u {
+class sn extends u {
   constructor({ cause: t } = {}) {
     super([
       "The total cost (gas * gas fee + value) of executing this transaction exceeds the balance of the account."
@@ -928,41 +965,41 @@ class ss extends u {
     });
   }
 }
-Object.defineProperty(ss, "nodeMessage", {
+Object.defineProperty(sn, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /insufficient funds|exceeds transaction sender account balance/
 });
-class ns extends u {
-  constructor({ cause: t, gas: s } = {}) {
-    super(`The amount of gas ${s ? `(${s}) ` : ""}provided for the transaction exceeds the limit allowed for the block.`, {
+class rn extends u {
+  constructor({ cause: t, gas: n } = {}) {
+    super(`The amount of gas ${n ? `(${n}) ` : ""}provided for the transaction exceeds the limit allowed for the block.`, {
       cause: t,
       name: "IntrinsicGasTooHighError"
     });
   }
 }
-Object.defineProperty(ns, "nodeMessage", {
+Object.defineProperty(rn, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /intrinsic gas too high|gas limit reached/
 });
-class is extends u {
-  constructor({ cause: t, gas: s } = {}) {
-    super(`The amount of gas ${s ? `(${s}) ` : ""}provided for the transaction is too low.`, {
+class on extends u {
+  constructor({ cause: t, gas: n } = {}) {
+    super(`The amount of gas ${n ? `(${n}) ` : ""}provided for the transaction is too low.`, {
       cause: t,
       name: "IntrinsicGasTooLowError"
     });
   }
 }
-Object.defineProperty(is, "nodeMessage", {
+Object.defineProperty(on, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /intrinsic gas too low/
 });
-class rs extends u {
+class an extends u {
   constructor({ cause: t }) {
     super("The transaction type is not supported for this chain.", {
       cause: t,
@@ -970,16 +1007,16 @@ class rs extends u {
     });
   }
 }
-Object.defineProperty(rs, "nodeMessage", {
+Object.defineProperty(an, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /transaction type not valid/
 });
-class Re extends u {
-  constructor({ cause: t, maxPriorityFeePerGas: s, maxFeePerGas: n } = {}) {
+class Ke extends u {
+  constructor({ cause: t, maxPriorityFeePerGas: n, maxFeePerGas: s } = {}) {
     super([
-      `The provided tip (\`maxPriorityFeePerGas\`${s ? ` = ${$(s)} gwei` : ""}) cannot be higher than the fee cap (\`maxFeePerGas\`${n ? ` = ${$(n)} gwei` : ""}).`
+      `The provided tip (\`maxPriorityFeePerGas\`${n ? ` = ${$(n)} gwei` : ""}) cannot be higher than the fee cap (\`maxFeePerGas\`${s ? ` = ${$(s)} gwei` : ""}).`
     ].join(`
 `), {
       cause: t,
@@ -987,13 +1024,13 @@ class Re extends u {
     });
   }
 }
-Object.defineProperty(Re, "nodeMessage", {
+Object.defineProperty(Ke, "nodeMessage", {
   enumerable: !0,
   configurable: !0,
   writable: !0,
   value: /max priority fee per gas higher than max fee per gas|tip higher than fee cap/
 });
-class rn extends u {
+class us extends u {
   constructor({ cause: t }) {
     super(`An error occurred while executing: ${t == null ? void 0 : t.shortMessage}`, {
       cause: t,
@@ -1001,49 +1038,49 @@ class rn extends u {
     });
   }
 }
-function ne(e, t) {
-  return ({ exclude: s, format: n }) => ({
-    exclude: s,
+function re(e, t) {
+  return ({ exclude: n, format: s }) => ({
+    exclude: n,
     format: (i) => {
       const r = t(i);
-      if (s)
-        for (const o of s)
+      if (n)
+        for (const o of n)
           delete r[o];
       return {
         ...r,
-        ...n(i)
+        ...s(i)
       };
     },
     type: e
   });
 }
-const ie = 2n ** 256n - 1n, Ke = {
+const oe = 2n ** 256n - 1n, We = {
   "0x0": "legacy",
   "0x1": "eip2930",
   "0x2": "eip1559",
   "0x3": "eip4844",
   "0x4": "eip7702"
 };
-function re(e) {
+function ae(e) {
   const t = {
     ...e,
     blockHash: e.blockHash ? e.blockHash : null,
     blockNumber: e.blockNumber ? BigInt(e.blockNumber) : null,
-    chainId: e.chainId ? R(e.chainId) : void 0,
+    chainId: e.chainId ? K(e.chainId) : void 0,
     gas: e.gas ? BigInt(e.gas) : void 0,
     gasPrice: e.gasPrice ? BigInt(e.gasPrice) : void 0,
     maxFeePerBlobGas: e.maxFeePerBlobGas ? BigInt(e.maxFeePerBlobGas) : void 0,
     maxFeePerGas: e.maxFeePerGas ? BigInt(e.maxFeePerGas) : void 0,
     maxPriorityFeePerGas: e.maxPriorityFeePerGas ? BigInt(e.maxPriorityFeePerGas) : void 0,
-    nonce: e.nonce ? R(e.nonce) : void 0,
+    nonce: e.nonce ? K(e.nonce) : void 0,
     to: e.to ? e.to : null,
     transactionIndex: e.transactionIndex ? Number(e.transactionIndex) : null,
-    type: e.type ? Ke[e.type] : void 0,
+    type: e.type ? We[e.type] : void 0,
     typeHex: e.type ? e.type : void 0,
     value: e.value ? BigInt(e.value) : void 0,
     v: e.v ? BigInt(e.v) : void 0
   };
-  return e.authorizationList && (t.authorizationList = as(e.authorizationList)), t.yParity = (() => {
+  return e.authorizationList && (t.authorizationList = un(e.authorizationList)), t.yParity = (() => {
     if (e.yParity)
       return Number(e.yParity);
     if (typeof t.v == "bigint") {
@@ -1056,8 +1093,8 @@ function re(e) {
     }
   })(), t.type === "legacy" && (delete t.accessList, delete t.maxFeePerBlobGas, delete t.maxFeePerGas, delete t.maxPriorityFeePerGas, delete t.yParity), t.type === "eip2930" && (delete t.maxFeePerBlobGas, delete t.maxFeePerGas, delete t.maxPriorityFeePerGas), t.type === "eip1559" && delete t.maxFeePerBlobGas, t;
 }
-const os = /* @__PURE__ */ ne("transaction", re);
-function as(e) {
+const cn = /* @__PURE__ */ re("transaction", ae);
+function un(e) {
   return e.map((t) => ({
     contractAddress: t.address,
     chainId: Number(t.chainId),
@@ -1067,8 +1104,8 @@ function as(e) {
     yParity: Number(t.yParity)
   }));
 }
-function cs(e) {
-  const t = (e.transactions ?? []).map((s) => typeof s == "string" ? s : re(s));
+function fn(e) {
+  const t = (e.transactions ?? []).map((n) => typeof n == "string" ? n : ae(n));
   return {
     ...e,
     baseFeePerGas: e.baseFeePerGas ? BigInt(e.baseFeePerGas) : null,
@@ -1087,58 +1124,63 @@ function cs(e) {
     totalDifficulty: e.totalDifficulty ? BigInt(e.totalDifficulty) : null
   };
 }
-const us = /* @__PURE__ */ ne("block", cs);
-function We(e) {
-  const { kzg: t } = e, s = e.to ?? (typeof e.blobs[0] == "string" ? "hex" : "bytes"), n = typeof e.blobs[0] == "string" ? e.blobs.map((r) => z(r)) : e.blobs, i = [];
-  for (const r of n)
+const ln = /* @__PURE__ */ re("block", fn);
+function Xe(e) {
+  const { kzg: t } = e, n = e.to ?? (typeof e.blobs[0] == "string" ? "hex" : "bytes"), s = typeof e.blobs[0] == "string" ? e.blobs.map((r) => z(r)) : e.blobs, i = [];
+  for (const r of s)
     i.push(Uint8Array.from(t.blobToKzgCommitment(r)));
-  return s === "bytes" ? i : i.map((r) => I(r));
+  return n === "bytes" ? i : i.map((r) => I(r));
 }
-function Xe(e) {
-  const { kzg: t } = e, s = e.to ?? (typeof e.blobs[0] == "string" ? "hex" : "bytes"), n = typeof e.blobs[0] == "string" ? e.blobs.map((o) => z(o)) : e.blobs, i = typeof e.commitments[0] == "string" ? e.commitments.map((o) => z(o)) : e.commitments, r = [];
-  for (let o = 0; o < n.length; o++) {
-    const a = n[o], c = i[o];
+function qe(e) {
+  const { kzg: t } = e, n = e.to ?? (typeof e.blobs[0] == "string" ? "hex" : "bytes"), s = typeof e.blobs[0] == "string" ? e.blobs.map((o) => z(o)) : e.blobs, i = typeof e.commitments[0] == "string" ? e.commitments.map((o) => z(o)) : e.commitments, r = [];
+  for (let o = 0; o < s.length; o++) {
+    const a = s[o], c = i[o];
     r.push(Uint8Array.from(t.computeBlobKzgProof(a, c)));
   }
-  return s === "bytes" ? r : r.map((o) => I(o));
+  return n === "bytes" ? r : r.map((o) => I(o));
 }
-function fs(e, t, s, n) {
+function dn(e, t, n, s) {
   if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, s, n);
-  const i = BigInt(32), r = BigInt(4294967295), o = Number(s >> i & r), a = Number(s & r), c = n ? 4 : 0, f = n ? 0 : 4;
-  e.setUint32(t + c, o, n), e.setUint32(t + f, a, n);
+    return e.setBigUint64(t, n, s);
+  const i = BigInt(32), r = BigInt(4294967295), o = Number(n >> i & r), a = Number(n & r), c = s ? 4 : 0, f = s ? 0 : 4;
+  e.setUint32(t + c, o, s), e.setUint32(t + f, a, s);
+}
+function hn(e, t, n) {
+  return e & t ^ ~e & n;
 }
-const ls = (e, t, s) => e & t ^ ~e & s, ds = (e, t, s) => e & t ^ e & s ^ t & s;
-class hs extends Ue {
-  constructor(t, s, n, i) {
-    super(), this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = J(this.buffer);
+function pn(e, t, n) {
+  return e & t ^ e & n ^ t & n;
+}
+class bn extends Ce {
+  constructor(t, n, s, i) {
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = ee(this.buffer);
   }
   update(t) {
-    K(this);
-    const { view: s, buffer: n, blockLen: i } = this;
-    t = te(t);
+    X(this);
+    const { view: n, buffer: s, blockLen: i } = this;
+    t = se(t);
     const r = t.length;
     for (let o = 0; o < r; ) {
       const a = Math.min(i - this.pos, r - o);
       if (a === i) {
-        const c = J(t);
+        const c = ee(t);
         for (; i <= r - o; o += i)
           this.process(c, o);
         continue;
       }
-      n.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(s, 0), this.pos = 0);
+      s.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    K(this), Ae(t, this), this.finished = !0;
-    const { buffer: s, view: n, blockLen: i, isLE: r } = this;
+    X(this), Ue(t, this), this.finished = !0;
+    const { buffer: n, view: s, blockLen: i, isLE: r } = this;
     let { pos: o } = this;
-    s[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(n, 0), o = 0);
+    n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(s, 0), o = 0);
     for (let l = o; l < i; l++)
-      s[l] = 0;
-    fs(n, i - 8, BigInt(this.length * 8), r), this.process(n, 0);
-    const a = J(t), c = this.outputLen;
+      n[l] = 0;
+    dn(s, i - 8, BigInt(this.length * 8), r), this.process(s, 0);
+    const a = ee(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const f = c / 4, h = this.get();
@@ -1148,18 +1190,18 @@ class hs extends Ue {
       a.setUint32(4 * l, h[l], r);
   }
   digest() {
-    const { buffer: t, outputLen: s } = this;
+    const { buffer: t, outputLen: n } = this;
     this.digestInto(t);
-    const n = t.slice(0, s);
-    return this.destroy(), n;
+    const s = t.slice(0, n);
+    return this.destroy(), s;
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: n, length: i, finished: r, destroyed: o, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = r, t.destroyed = o, i % s && t.buffer.set(n), t;
+    const { blockLen: n, buffer: s, length: i, finished: r, destroyed: o, pos: a } = this;
+    return t.length = i, t.pos = a, t.finished = r, t.destroyed = o, i % n && t.buffer.set(s), t;
   }
 }
-const ps = /* @__PURE__ */ new Uint32Array([
+const xn = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1234,31 +1276,31 @@ const ps = /* @__PURE__ */ new Uint32Array([
   528734635,
   1541459225
 ]), w = /* @__PURE__ */ new Uint32Array(64);
-class bs extends hs {
+class mn extends bn {
   constructor() {
     super(64, 32, 8, !1), this.A = y[0] | 0, this.B = y[1] | 0, this.C = y[2] | 0, this.D = y[3] | 0, this.E = y[4] | 0, this.F = y[5] | 0, this.G = y[6] | 0, this.H = y[7] | 0;
   }
   get() {
-    const { A: t, B: s, C: n, D: i, E: r, F: o, G: a, H: c } = this;
-    return [t, s, n, i, r, o, a, c];
+    const { A: t, B: n, C: s, D: i, E: r, F: o, G: a, H: c } = this;
+    return [t, n, s, i, r, o, a, c];
   }
   // prettier-ignore
-  set(t, s, n, i, r, o, a, c) {
-    this.A = t | 0, this.B = s | 0, this.C = n | 0, this.D = i | 0, this.E = r | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, s, i, r, o, a, c) {
+    this.A = t | 0, this.B = n | 0, this.C = s | 0, this.D = i | 0, this.E = r | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
   }
-  process(t, s) {
-    for (let l = 0; l < 16; l++, s += 4)
-      w[l] = t.getUint32(s, !1);
+  process(t, n) {
+    for (let l = 0; l < 16; l++, n += 4)
+      w[l] = t.getUint32(n, !1);
     for (let l = 16; l < 64; l++) {
       const b = w[l - 15], p = w[l - 2], g = x(b, 7) ^ x(b, 18) ^ b >>> 3, C = x(p, 17) ^ x(p, 19) ^ p >>> 10;
       w[l] = C + w[l - 7] + g + w[l - 16] | 0;
     }
-    let { A: n, B: i, C: r, D: o, E: a, F: c, G: f, H: h } = this;
+    let { A: s, B: i, C: r, D: o, E: a, F: c, G: f, H: h } = this;
     for (let l = 0; l < 64; l++) {
-      const b = x(a, 6) ^ x(a, 11) ^ x(a, 25), p = h + b + ls(a, c, f) + ps[l] + w[l] | 0, C = (x(n, 2) ^ x(n, 13) ^ x(n, 22)) + ds(n, i, r) | 0;
-      h = f, f = c, c = a, a = o + p | 0, o = r, r = i, i = n, n = p + C | 0;
+      const b = x(a, 6) ^ x(a, 11) ^ x(a, 25), p = h + b + hn(a, c, f) + xn[l] + w[l] | 0, C = (x(s, 2) ^ x(s, 13) ^ x(s, 22)) + pn(s, i, r) | 0;
+      h = f, f = c, c = a, a = o + p | 0, o = r, r = i, i = s, s = p + C | 0;
     }
-    n = n + this.A | 0, i = i + this.B | 0, r = r + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, f = f + this.G | 0, h = h + this.H | 0, this.set(n, i, r, o, a, c, f, h);
+    s = s + this.A | 0, i = i + this.B | 0, r = r + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, f = f + this.G | 0, h = h + this.H | 0, this.set(s, i, r, o, a, c, f, h);
   }
   roundClean() {
     w.fill(0);
@@ -1267,75 +1309,75 @@ class bs extends hs {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-const xs = /* @__PURE__ */ Ce(() => new bs());
-function ms(e, t) {
-  return xs(V(e, { strict: !1 }) ? $e(e) : e);
+const gn = /* @__PURE__ */ Fe(() => new mn());
+function yn(e, t) {
+  return gn(_(e, { strict: !1 }) ? ze(e) : e);
 }
-function gs(e) {
-  const { commitment: t, version: s = 1 } = e, n = e.to ?? (typeof t == "string" ? "hex" : "bytes"), i = ms(t);
-  return i.set([s], 0), n === "bytes" ? i : I(i);
+function wn(e) {
+  const { commitment: t, version: n = 1 } = e, s = e.to ?? (typeof t == "string" ? "hex" : "bytes"), i = yn(t);
+  return i.set([n], 0), s === "bytes" ? i : I(i);
 }
-function ys(e) {
-  const { commitments: t, version: s } = e, n = e.to ?? (typeof t[0] == "string" ? "hex" : "bytes"), i = [];
+function Pn(e) {
+  const { commitments: t, version: n } = e, s = e.to ?? (typeof t[0] == "string" ? "hex" : "bytes"), i = [];
   for (const r of t)
-    i.push(gs({
+    i.push(wn({
       commitment: r,
-      to: n,
-      version: s
+      to: s,
+      version: n
     }));
   return i;
 }
-const ye = 6, qe = 32, oe = 4096, Ye = qe * oe, we = Ye * ye - // terminator byte (0x80).
+const we = 6, Ye = 32, ce = 4096, Je = Ye * ce, Pe = Je * we - // terminator byte (0x80).
 1 - // zero byte (0x00) appended to each field element.
-1 * oe * ye, Je = 1;
-class ws extends u {
-  constructor({ maxSize: t, size: s }) {
+1 * ce * we, Qe = 1;
+class En extends u {
+  constructor({ maxSize: t, size: n }) {
     super("Blob size is too large.", {
-      metaMessages: [`Max: ${t} bytes`, `Given: ${s} bytes`],
+      metaMessages: [`Max: ${t} bytes`, `Given: ${n} bytes`],
       name: "BlobSizeTooLargeError"
     });
   }
 }
-class Qe extends u {
+class Ze extends u {
   constructor() {
     super("Blob data must not be empty.", { name: "EmptyBlobError" });
   }
 }
-class Ps extends u {
-  constructor({ hash: t, size: s }) {
+class Bn extends u {
+  constructor({ hash: t, size: n }) {
     super(`Versioned hash "${t}" size is invalid.`, {
-      metaMessages: ["Expected: 32", `Received: ${s}`],
+      metaMessages: ["Expected: 32", `Received: ${n}`],
       name: "InvalidVersionedHashSizeError"
     });
   }
 }
-class Es extends u {
-  constructor({ hash: t, version: s }) {
+class In extends u {
+  constructor({ hash: t, version: n }) {
     super(`Versioned hash "${t}" version is invalid.`, {
       metaMessages: [
-        `Expected: ${Je}`,
-        `Received: ${s}`
+        `Expected: ${Qe}`,
+        `Received: ${n}`
       ],
       name: "InvalidVersionedHashVersionError"
     });
   }
 }
-function Bs(e) {
-  const t = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), s = typeof e.data == "string" ? z(e.data) : e.data, n = P(s);
-  if (!n)
-    throw new Qe();
-  if (n > we)
-    throw new ws({
-      maxSize: we,
-      size: n
+function vn(e) {
+  const t = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), n = typeof e.data == "string" ? z(e.data) : e.data, s = P(n);
+  if (!s)
+    throw new Ze();
+  if (s > Pe)
+    throw new En({
+      maxSize: Pe,
+      size: s
     });
   const i = [];
   let r = !0, o = 0;
   for (; r; ) {
-    const a = Ne(new Uint8Array(Ye));
+    const a = Me(new Uint8Array(Je));
     let c = 0;
-    for (; c < oe; ) {
-      const f = s.slice(o, o + (qe - 1));
+    for (; c < ce; ) {
+      const f = n.slice(o, o + (Ye - 1));
       if (a.pushByte(0), a.pushBytes(f), f.length < 31) {
         a.pushByte(128), r = !1;
         break;
@@ -1346,8 +1388,8 @@ function Bs(e) {
   }
   return t === "bytes" ? i.map((a) => a.bytes) : i.map((a) => I(a.bytes));
 }
-function Is(e) {
-  const { data: t, kzg: s, to: n } = e, i = e.blobs ?? Bs({ data: t, to: n }), r = e.commitments ?? We({ blobs: i, kzg: s, to: n }), o = e.proofs ?? Xe({ blobs: i, commitments: r, kzg: s, to: n }), a = [];
+function Tn(e) {
+  const { data: t, kzg: n, to: s } = e, i = e.blobs ?? vn({ data: t, to: s }), r = e.commitments ?? Xe({ blobs: i, kzg: n, to: s }), o = e.proofs ?? qe({ blobs: i, commitments: r, kzg: n, to: s }), a = [];
   for (let c = 0; c < i.length; c++)
     a.push({
       blob: i[c],
@@ -1356,7 +1398,7 @@ function Is(e) {
     });
   return a;
 }
-function vs(e) {
+function $n(e) {
   if (e.type)
     return e.type;
   if (typeof e.authorizationList < "u")
@@ -1367,9 +1409,9 @@ function vs(e) {
     return "eip1559";
   if (typeof e.gasPrice < "u")
     return typeof e.accessList < "u" ? "eip2930" : "legacy";
-  throw new Xt({ transaction: e });
+  throw new qt({ transaction: e });
 }
-function Ts(e, { args: t, eventName: s } = {}) {
+function zn(e, { args: t, eventName: n } = {}) {
   return {
     ...e,
     blockHash: e.blockHash ? e.blockHash : null,
@@ -1377,36 +1419,36 @@ function Ts(e, { args: t, eventName: s } = {}) {
     logIndex: e.logIndex ? Number(e.logIndex) : null,
     transactionHash: e.transactionHash ? e.transactionHash : null,
     transactionIndex: e.transactionIndex ? Number(e.transactionIndex) : null,
-    ...s ? { args: t, eventName: s } : {}
+    ...n ? { args: t, eventName: n } : {}
   };
 }
-class on extends u {
-  constructor({ blockNumber: t, chain: s, contract: n }) {
-    super(`Chain "${s.name}" does not support contract "${n.name}".`, {
+class fs extends u {
+  constructor({ blockNumber: t, chain: n, contract: s }) {
+    super(`Chain "${n.name}" does not support contract "${s.name}".`, {
       metaMessages: [
         "This could be due to any of the following:",
-        ...t && n.blockCreated && n.blockCreated > t ? [
-          `- The contract "${n.name}" was not deployed until block ${n.blockCreated} (current block ${t}).`
+        ...t && s.blockCreated && s.blockCreated > t ? [
+          `- The contract "${s.name}" was not deployed until block ${s.blockCreated} (current block ${t}).`
         ] : [
-          `- The chain does not have the contract "${n.name}" configured.`
+          `- The chain does not have the contract "${s.name}" configured.`
         ]
       ],
       name: "ChainDoesNotSupportContract"
     });
   }
 }
-class an extends u {
-  constructor({ chain: t, currentChainId: s }) {
-    super(`The current chain of the wallet (id: ${s}) does not match the target chain for the transaction (id: ${t.id} – ${t.name}).`, {
+class ls extends u {
+  constructor({ chain: t, currentChainId: n }) {
+    super(`The current chain of the wallet (id: ${n}) does not match the target chain for the transaction (id: ${t.id} – ${t.name}).`, {
       metaMessages: [
-        `Current Chain ID:  ${s}`,
+        `Current Chain ID:  ${n}`,
         `Expected Chain ID: ${t.id} – ${t.name}`
       ],
       name: "ChainMismatchError"
     });
   }
 }
-class cn extends u {
+class ds extends u {
   constructor() {
     super([
       "No chain was provided to the request.",
@@ -1417,19 +1459,19 @@ class cn extends u {
     });
   }
 }
-class un extends u {
+class hs extends u {
   constructor() {
     super("No chain was provided to the Client.", {
       name: "ClientChainNotConfiguredError"
     });
   }
 }
-class X extends u {
+class J extends u {
   constructor({ chainId: t }) {
     super(typeof t == "number" ? `Chain ID "${t}" is invalid.` : "Chain ID is invalid.", { name: "InvalidChainIdError" });
   }
 }
-function q(e) {
+function Q(e) {
   return {
     formatters: void 0,
     fees: void 0,
@@ -1437,11 +1479,11 @@ function q(e) {
     ...e
   };
 }
-const $s = {
+const An = {
   "0x0": "reverted",
   "0x1": "success"
 };
-function zs(e) {
+function Un(e) {
   const t = {
     ...e,
     blockNumber: e.blockNumber ? BigInt(e.blockNumber) : null,
@@ -1449,120 +1491,120 @@ function zs(e) {
     cumulativeGasUsed: e.cumulativeGasUsed ? BigInt(e.cumulativeGasUsed) : null,
     effectiveGasPrice: e.effectiveGasPrice ? BigInt(e.effectiveGasPrice) : null,
     gasUsed: e.gasUsed ? BigInt(e.gasUsed) : null,
-    logs: e.logs ? e.logs.map((s) => Ts(s)) : null,
+    logs: e.logs ? e.logs.map((n) => zn(n)) : null,
     to: e.to ? e.to : null,
-    transactionIndex: e.transactionIndex ? R(e.transactionIndex) : null,
-    status: e.status ? $s[e.status] : null,
-    type: e.type ? Ke[e.type] || e.type : null
+    transactionIndex: e.transactionIndex ? K(e.transactionIndex) : null,
+    status: e.status ? An[e.status] : null,
+    type: e.type ? We[e.type] || e.type : null
   };
   return e.blobGasPrice && (t.blobGasPrice = BigInt(e.blobGasPrice)), e.blobGasUsed && (t.blobGasUsed = BigInt(e.blobGasUsed)), t;
 }
-const As = /* @__PURE__ */ ne("transactionReceipt", zs);
-function Us(e) {
+const Cn = /* @__PURE__ */ re("transactionReceipt", Un);
+function Fn(e) {
   const { authorizationList: t } = e;
   if (t)
-    for (const s of t) {
-      const { contractAddress: n, chainId: i } = s;
-      if (!B(n))
-        throw new E({ address: n });
+    for (const n of t) {
+      const { contractAddress: s, chainId: i } = n;
+      if (!B(s))
+        throw new E({ address: s });
       if (i < 0)
-        throw new X({ chainId: i });
+        throw new J({ chainId: i });
     }
-  ae(e);
+  ue(e);
 }
-function Cs(e) {
+function Ln(e) {
   const { blobVersionedHashes: t } = e;
   if (t) {
     if (t.length === 0)
-      throw new Qe();
-    for (const s of t) {
-      const n = P(s), i = R(Ot(s, 0, 1));
-      if (n !== 32)
-        throw new Ps({ hash: s, size: n });
-      if (i !== Je)
-        throw new Es({
-          hash: s,
+      throw new Ze();
+    for (const n of t) {
+      const s = P(n), i = K(Nt(n, 0, 1));
+      if (s !== 32)
+        throw new Bn({ hash: n, size: s });
+      if (i !== Qe)
+        throw new In({
+          hash: n,
           version: i
         });
     }
   }
-  ae(e);
+  ue(e);
 }
-function ae(e) {
-  const { chainId: t, maxPriorityFeePerGas: s, maxFeePerGas: n, to: i } = e;
+function ue(e) {
+  const { chainId: t, maxPriorityFeePerGas: n, maxFeePerGas: s, to: i } = e;
   if (t <= 0)
-    throw new X({ chainId: t });
+    throw new J({ chainId: t });
   if (i && !B(i))
     throw new E({ address: i });
-  if (n && n > ie)
-    throw new W({ maxFeePerGas: n });
-  if (s && n && s > n)
-    throw new Re({ maxFeePerGas: n, maxPriorityFeePerGas: s });
+  if (s && s > oe)
+    throw new Y({ maxFeePerGas: s });
+  if (n && s && n > s)
+    throw new Ke({ maxFeePerGas: s, maxPriorityFeePerGas: n });
 }
-function Fs(e) {
-  const { chainId: t, maxPriorityFeePerGas: s, gasPrice: n, maxFeePerGas: i, to: r } = e;
+function Gn(e) {
+  const { chainId: t, maxPriorityFeePerGas: n, gasPrice: s, maxFeePerGas: i, to: r } = e;
   if (t <= 0)
-    throw new X({ chainId: t });
+    throw new J({ chainId: t });
   if (r && !B(r))
     throw new E({ address: r });
-  if (s || i)
+  if (n || i)
     throw new u("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid EIP-2930 Transaction attribute.");
-  if (n && n > ie)
-    throw new W({ maxFeePerGas: n });
+  if (s && s > oe)
+    throw new Y({ maxFeePerGas: s });
 }
-function Ls(e) {
-  const { chainId: t, maxPriorityFeePerGas: s, gasPrice: n, maxFeePerGas: i, to: r } = e;
+function Sn(e) {
+  const { chainId: t, maxPriorityFeePerGas: n, gasPrice: s, maxFeePerGas: i, to: r } = e;
   if (r && !B(r))
     throw new E({ address: r });
   if (typeof t < "u" && t <= 0)
-    throw new X({ chainId: t });
-  if (s || i)
+    throw new J({ chainId: t });
+  if (n || i)
     throw new u("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid Legacy Transaction attribute.");
-  if (n && n > ie)
-    throw new W({ maxFeePerGas: n });
+  if (s && s > oe)
+    throw new Y({ maxFeePerGas: s });
 }
-function Gs(e) {
+function kn(e) {
   if (!e || e.length === 0)
     return [];
   const t = [];
-  for (const s of e) {
-    const { contractAddress: n, chainId: i, nonce: r, ...o } = s;
+  for (const n of e) {
+    const { contractAddress: s, chainId: i, nonce: r, ...o } = n;
     t.push([
       i ? d(i) : "0x",
-      n,
+      s,
       r ? d(r) : "0x",
-      ..._({}, o)
+      ...j({}, o)
     ]);
   }
   return t;
 }
-function Y(e) {
+function Z(e) {
   if (!e || e.length === 0)
     return [];
   const t = [];
-  for (let s = 0; s < e.length; s++) {
-    const { address: n, storageKeys: i } = e[s];
+  for (let n = 0; n < e.length; n++) {
+    const { address: s, storageKeys: i } = e[n];
     for (let r = 0; r < i.length; r++)
       if (i[r].length - 2 !== 64)
-        throw new qt({ storageKey: i[r] });
-    if (!B(n, { strict: !1 }))
-      throw new E({ address: n });
-    t.push([n, i]);
+        throw new Yt({ storageKey: i[r] });
+    if (!B(s, { strict: !1 }))
+      throw new E({ address: s });
+    t.push([s, i]);
   }
   return t;
 }
-function Ss(e, t) {
-  const s = vs(e);
-  return s === "eip1559" ? Os(e, t) : s === "eip2930" ? Ns(e, t) : s === "eip4844" ? ks(e, t) : s === "eip7702" ? Hs(e, t) : Ms(e, t);
+function Hn(e, t) {
+  const n = $n(e);
+  return n === "eip1559" ? Mn(e, t) : n === "eip2930" ? Vn(e, t) : n === "eip4844" ? Nn(e, t) : n === "eip7702" ? On(e, t) : _n(e, t);
 }
-function Hs(e, t) {
-  const { authorizationList: s, chainId: n, gas: i, nonce: r, to: o, value: a, maxFeePerGas: c, maxPriorityFeePerGas: f, accessList: h, data: l } = e;
-  Us(e);
-  const b = Y(h), p = Gs(s);
-  return G([
+function On(e, t) {
+  const { authorizationList: n, chainId: s, gas: i, nonce: r, to: o, value: a, maxFeePerGas: c, maxPriorityFeePerGas: f, accessList: h, data: l } = e;
+  Fn(e);
+  const b = Z(h), p = kn(n);
+  return S([
     "0x04",
     A([
-      d(n),
+      d(s),
       r ? d(r) : "0x",
       f ? d(f) : "0x",
       c ? d(c) : "0x",
@@ -1572,97 +1614,97 @@ function Hs(e, t) {
       l ?? "0x",
       b,
       p,
-      ..._(e, t)
+      ...j(e, t)
     ])
   ]);
 }
-function ks(e, t) {
-  const { chainId: s, gas: n, nonce: i, to: r, value: o, maxFeePerBlobGas: a, maxFeePerGas: c, maxPriorityFeePerGas: f, accessList: h, data: l } = e;
-  Cs(e);
+function Nn(e, t) {
+  const { chainId: n, gas: s, nonce: i, to: r, value: o, maxFeePerBlobGas: a, maxFeePerGas: c, maxPriorityFeePerGas: f, accessList: h, data: l } = e;
+  Ln(e);
   let b = e.blobVersionedHashes, p = e.sidecars;
   if (e.blobs && (typeof b > "u" || typeof p > "u")) {
-    const v = typeof e.blobs[0] == "string" ? e.blobs : e.blobs.map((H) => I(H)), j = e.kzg, S = We({
+    const v = typeof e.blobs[0] == "string" ? e.blobs : e.blobs.map((H) => I(H)), D = e.kzg, k = Xe({
       blobs: v,
-      kzg: j
+      kzg: D
     });
-    if (typeof b > "u" && (b = ys({
-      commitments: S
+    if (typeof b > "u" && (b = Pn({
+      commitments: k
     })), typeof p > "u") {
-      const H = Xe({ blobs: v, commitments: S, kzg: j });
-      p = Is({ blobs: v, commitments: S, proofs: H });
+      const H = qe({ blobs: v, commitments: k, kzg: D });
+      p = Tn({ blobs: v, commitments: k, proofs: H });
     }
   }
-  const g = Y(h), C = [
-    d(s),
+  const g = Z(h), C = [
+    d(n),
     i ? d(i) : "0x",
     f ? d(f) : "0x",
     c ? d(c) : "0x",
-    n ? d(n) : "0x",
+    s ? d(s) : "0x",
     r ?? "0x",
     o ? d(o) : "0x",
     l ?? "0x",
     g,
     a ? d(a) : "0x",
     b ?? [],
-    ..._(e, t)
-  ], ce = [], ue = [], fe = [];
+    ...j(e, t)
+  ], fe = [], le = [], de = [];
   if (p)
     for (let v = 0; v < p.length; v++) {
-      const { blob: j, commitment: S, proof: H } = p[v];
-      ce.push(j), ue.push(S), fe.push(H);
+      const { blob: D, commitment: k, proof: H } = p[v];
+      fe.push(D), le.push(k), de.push(H);
     }
-  return G([
+  return S([
     "0x03",
     // If sidecars are enabled, envelope turns into a "wrapper":
-    A(p ? [C, ce, ue, fe] : C)
+    A(p ? [C, fe, le, de] : C)
   ]);
 }
-function Os(e, t) {
-  const { chainId: s, gas: n, nonce: i, to: r, value: o, maxFeePerGas: a, maxPriorityFeePerGas: c, accessList: f, data: h } = e;
-  ae(e);
-  const l = Y(f), b = [
-    d(s),
+function Mn(e, t) {
+  const { chainId: n, gas: s, nonce: i, to: r, value: o, maxFeePerGas: a, maxPriorityFeePerGas: c, accessList: f, data: h } = e;
+  ue(e);
+  const l = Z(f), b = [
+    d(n),
     i ? d(i) : "0x",
     c ? d(c) : "0x",
     a ? d(a) : "0x",
-    n ? d(n) : "0x",
+    s ? d(s) : "0x",
     r ?? "0x",
     o ? d(o) : "0x",
     h ?? "0x",
     l,
-    ..._(e, t)
+    ...j(e, t)
   ];
-  return G([
+  return S([
     "0x02",
     A(b)
   ]);
 }
-function Ns(e, t) {
-  const { chainId: s, gas: n, data: i, nonce: r, to: o, value: a, accessList: c, gasPrice: f } = e;
-  Fs(e);
-  const h = Y(c), l = [
-    d(s),
+function Vn(e, t) {
+  const { chainId: n, gas: s, data: i, nonce: r, to: o, value: a, accessList: c, gasPrice: f } = e;
+  Gn(e);
+  const h = Z(c), l = [
+    d(n),
     r ? d(r) : "0x",
     f ? d(f) : "0x",
-    n ? d(n) : "0x",
+    s ? d(s) : "0x",
     o ?? "0x",
     a ? d(a) : "0x",
     i ?? "0x",
     h,
-    ..._(e, t)
+    ...j(e, t)
   ];
-  return G([
+  return S([
     "0x01",
     A(l)
   ]);
 }
-function Ms(e, t) {
-  const { chainId: s = 0, gas: n, data: i, nonce: r, to: o, value: a, gasPrice: c } = e;
-  Ls(e);
+function _n(e, t) {
+  const { chainId: n = 0, gas: s, data: i, nonce: r, to: o, value: a, gasPrice: c } = e;
+  Sn(e);
   let f = [
     r ? d(r) : "0x",
     c ? d(c) : "0x",
-    n ? d(n) : "0x",
+    s ? d(s) : "0x",
     o ?? "0x",
     a ? d(a) : "0x",
     i ?? "0x"
@@ -1671,11 +1713,11 @@ function Ms(e, t) {
     const h = (() => {
       if (t.v >= 35n)
         return (t.v - 35n) / 2n > 0 ? t.v : 27n + (t.v === 35n ? 0n : 1n);
-      if (s > 0)
-        return BigInt(s * 2) + BigInt(35n + t.v - 27n);
+      if (n > 0)
+        return BigInt(n * 2) + BigInt(35n + t.v - 27n);
       const p = 27n + (t.v === 27n ? 0n : 1n);
       if (t.v !== p)
-        throw new Wt({ v: t.v });
+        throw new Xt({ v: t.v });
       return p;
     })(), l = T(t.r), b = T(t.s);
     f = [
@@ -1684,26 +1726,26 @@ function Ms(e, t) {
       l === "0x00" ? "0x" : l,
       b === "0x00" ? "0x" : b
     ];
-  } else s > 0 && (f = [
+  } else n > 0 && (f = [
     ...f,
-    d(s),
+    d(n),
     "0x",
     "0x"
   ]);
   return A(f);
 }
-function _(e, t) {
-  const s = t ?? e, { v: n, yParity: i } = s;
-  if (typeof s.r > "u")
+function j(e, t) {
+  const n = t ?? e, { v: s, yParity: i } = n;
+  if (typeof n.r > "u")
     return [];
-  if (typeof s.s > "u")
+  if (typeof n.s > "u")
     return [];
-  if (typeof n > "u" && typeof i > "u")
+  if (typeof s > "u" && typeof i > "u")
     return [];
-  const r = T(s.r), o = T(s.s);
-  return [typeof i == "number" ? i ? d(1) : "0x" : n === 0n ? "0x" : n === 1n ? d(1) : n === 27n ? "0x" : d(1), r === "0x00" ? "0x" : r, o === "0x00" ? "0x" : o];
+  const r = T(n.r), o = T(n.s);
+  return [typeof i == "number" ? i ? d(1) : "0x" : s === 0n ? "0x" : s === 1n ? d(1) : s === 27n ? "0x" : d(1), r === "0x00" ? "0x" : r, o === "0x00" ? "0x" : o];
 }
-const Vs = {
+const jn = {
   gasPriceOracle: { address: "0x420000000000000000000000000000000000000F" },
   l1Block: { address: "0x4200000000000000000000000000000000000015" },
   l2CrossDomainMessenger: {
@@ -1714,77 +1756,77 @@ const Vs = {
   l2ToL1MessagePasser: {
     address: "0x4200000000000000000000000000000000000016"
   }
-}, _s = {
-  block: /* @__PURE__ */ us({
+}, Dn = {
+  block: /* @__PURE__ */ ln({
     format(e) {
-      var s;
+      var n;
       return {
-        transactions: (s = e.transactions) == null ? void 0 : s.map((n) => {
-          if (typeof n == "string")
-            return n;
-          const i = re(n);
-          return i.typeHex === "0x7e" && (i.isSystemTx = n.isSystemTx, i.mint = n.mint ? F(n.mint) : void 0, i.sourceHash = n.sourceHash, i.type = "deposit"), i;
+        transactions: (n = e.transactions) == null ? void 0 : n.map((s) => {
+          if (typeof s == "string")
+            return s;
+          const i = ae(s);
+          return i.typeHex === "0x7e" && (i.isSystemTx = s.isSystemTx, i.mint = s.mint ? L(s.mint) : void 0, i.sourceHash = s.sourceHash, i.type = "deposit"), i;
         }),
         stateRoot: e.stateRoot
       };
     }
   }),
-  transaction: /* @__PURE__ */ os({
+  transaction: /* @__PURE__ */ cn({
     format(e) {
       const t = {};
-      return e.type === "0x7e" && (t.isSystemTx = e.isSystemTx, t.mint = e.mint ? F(e.mint) : void 0, t.sourceHash = e.sourceHash, t.type = "deposit"), t;
+      return e.type === "0x7e" && (t.isSystemTx = e.isSystemTx, t.mint = e.mint ? L(e.mint) : void 0, t.sourceHash = e.sourceHash, t.type = "deposit"), t;
     }
   }),
-  transactionReceipt: /* @__PURE__ */ As({
+  transactionReceipt: /* @__PURE__ */ Cn({
     format(e) {
       return {
-        l1GasPrice: e.l1GasPrice ? F(e.l1GasPrice) : null,
-        l1GasUsed: e.l1GasUsed ? F(e.l1GasUsed) : null,
-        l1Fee: e.l1Fee ? F(e.l1Fee) : null,
+        l1GasPrice: e.l1GasPrice ? L(e.l1GasPrice) : null,
+        l1GasUsed: e.l1GasUsed ? L(e.l1GasUsed) : null,
+        l1Fee: e.l1Fee ? L(e.l1Fee) : null,
         l1FeeScalar: e.l1FeeScalar ? Number(e.l1FeeScalar) : null
       };
     }
   })
 };
-function js(e, t) {
-  return Ks(e) ? Rs(e) : Ss(e, t);
+function Rn(e, t) {
+  return Xn(e) ? Wn(e) : Hn(e, t);
 }
-const Ds = {
-  transaction: js
+const Kn = {
+  transaction: Rn
 };
-function Rs(e) {
-  Ws(e);
-  const { sourceHash: t, data: s, from: n, gas: i, isSystemTx: r, mint: o, to: a, value: c } = e, f = [
+function Wn(e) {
+  qn(e);
+  const { sourceHash: t, data: n, from: s, gas: i, isSystemTx: r, mint: o, to: a, value: c } = e, f = [
     t,
-    n,
+    s,
     a ?? "0x",
     o ? d(o) : "0x",
     c ? d(c) : "0x",
     i ? d(i) : "0x",
     r ? "0x1" : "0x",
-    s ?? "0x"
+    n ?? "0x"
   ];
-  return G([
+  return S([
     "0x7e",
     A(f)
   ]);
 }
-function Ks(e) {
+function Xn(e) {
   return e.type === "deposit" || typeof e.sourceHash < "u";
 }
-function Ws(e) {
-  const { from: t, to: s } = e;
+function qn(e) {
+  const { from: t, to: n } = e;
   if (t && !B(t))
     throw new E({ address: t });
-  if (s && !B(s))
-    throw new E({ address: s });
-}
-const Pe = {
-  contracts: Vs,
-  formatters: _s,
-  serializers: Ds
-}, N = 1, Ze = /* @__PURE__ */ q({
-  ...Pe,
+  if (n && !B(n))
+    throw new E({ address: n });
+}
+const Ee = {
+  contracts: jn,
+  formatters: Dn,
+  serializers: Kn
+}, M = 1, et = /* @__PURE__ */ Q({
+  ...Ee,
   id: 8453,
   name: "Base",
   nativeCurrency: { name: "Ether", symbol: "ETH", decimals: 18 },
@@ -1801,14 +1843,14 @@ const Pe = {
     }
   },
   contracts: {
-    ...Pe.contracts,
+    ...Ee.contracts,
     disputeGameFactory: {
-      [N]: {
+      [M]: {
         address: "0x43edB88C4B80fDD2AdFF2412A7BebF9dF42cB40e"
       }
     },
     l2OutputOracle: {
-      [N]: {
+      [M]: {
         address: "0x56315b90c40730925ec5485cf004d835058518A0"
       }
     },
@@ -1817,20 +1859,20 @@ const Pe = {
       blockCreated: 5022
     },
     portal: {
-      [N]: {
+      [M]: {
         address: "0x49048044D57e1C92A77f79988d21Fa8fAF74E97e",
         blockCreated: 17482143
       }
     },
     l1StandardBridge: {
-      [N]: {
+      [M]: {
         address: "0x3154Cf16ccdb4C6d922629664174b904d80F2C35",
         blockCreated: 17482143
       }
     }
   },
-  sourceId: N
-}), et = /* @__PURE__ */ q({
+  sourceId: M
+}), tt = /* @__PURE__ */ Q({
   id: 56,
   name: "BNB Smart Chain",
   nativeCurrency: {
@@ -1854,7 +1896,7 @@ const Pe = {
       blockCreated: 15921452
     }
   }
-}), tt = /* @__PURE__ */ q({
+}), nt = /* @__PURE__ */ Q({
   id: 17e3,
   name: "Holesky",
   nativeCurrency: { name: "Holesky Ether", symbol: "ETH", decimals: 18 },
@@ -1885,13 +1927,13 @@ const Pe = {
     }
   },
   testnet: !0
-}), st = /* @__PURE__ */ q({
+}), st = /* @__PURE__ */ Q({
   id: 1,
   name: "Ethereum",
   nativeCurrency: { name: "Ether", symbol: "ETH", decimals: 18 },
   rpcUrls: {
     default: {
-      http: ["https://cloudflare-eth.com"]
+      http: ["https://eth.merkle.io"]
     }
   },
   blockExplorers: {
@@ -1915,83 +1957,92 @@ const Pe = {
     }
   }
 });
-var M = ((e) => (e[e.Mainnet = st.id] = "Mainnet", e[e.Holesky = tt.id] = "Holesky", e[e.Base = Ze.id] = "Base", e[e.Bsc = et.id] = "Bsc", e))(M || {});
-const fn = {
-  [M.Mainnet]: st,
-  [M.Holesky]: tt,
-  [M.Base]: Ze,
-  [M.Bsc]: et
+var V = ((e) => (e[e.Mainnet = st.id] = "Mainnet", e[e.Holesky = nt.id] = "Holesky", e[e.Base = et.id] = "Base", e[e.Bsc = tt.id] = "Bsc", e))(V || {});
+const ps = {
+  [V.Mainnet]: st,
+  [V.Holesky]: nt,
+  [V.Base]: et,
+  [V.Bsc]: tt
 };
 export {
-  Re as $,
-  rt as A,
+  is as $,
+  z as A,
   u as B,
-  M as C,
-  Ot as D,
-  U as E,
-  qs as F,
-  Ne as G,
-  Nt as H,
+  V as C,
+  Me as D,
+  Re as E,
+  He as F,
+  Mt as G,
+  Ce as H,
   E as I,
-  Ve as J,
-  Kt as K,
-  Se as L,
-  $ as M,
+  _e as J,
+  $ as K,
+  Wt as L,
+  d as M,
   A as N,
-  De as O,
-  W as P,
-  Qt as Q,
-  Zt as R,
-  es as S,
-  tn as T,
-  ts as U,
-  fn as V,
-  nn as W,
-  ss as X,
-  ns as Y,
-  is as Z,
-  rs as _,
-  ze as a,
-  rn as a0,
-  Xs as a1,
-  Zs as a2,
-  ie as a3,
-  cs as a4,
-  We as a5,
-  ys as a6,
-  Xe as a7,
-  Is as a8,
-  vs as a9,
-  Vt as aa,
-  on as ab,
-  un as ac,
-  cn as ad,
-  an as ae,
-  en as af,
-  I as b,
-  Qs as c,
-  d,
-  T as e,
-  Ts as f,
-  B as g,
-  R as h,
-  V as i,
-  P as j,
-  St as k,
-  Mt as l,
-  G as m,
-  Te as n,
-  z as o,
-  nt as p,
-  re as q,
-  sn as r,
-  lt as s,
-  $e as t,
-  zs as u,
-  F as v,
-  Ys as w,
-  Js as x,
-  He as y,
-  ut as z
+  Y as O,
+  Zt as P,
+  en as Q,
+  tn as R,
+  nn as S,
+  sn as T,
+  rn as U,
+  ps as V,
+  on as W,
+  an as X,
+  Ke as Y,
+  us as Z,
+  Yn as _,
+  Zn as a,
+  oe as a0,
+  fn as a1,
+  Xe as a2,
+  Pn as a3,
+  qe as a4,
+  Tn as a5,
+  $n as a6,
+  _t as a7,
+  zn as a8,
+  fs as a9,
+  hs as aa,
+  ds as ab,
+  ls as ac,
+  rs as ad,
+  ke as ae,
+  Ae as af,
+  Vt as ag,
+  os as ah,
+  ae as ai,
+  as as aj,
+  Un as ak,
+  St as al,
+  Qn as am,
+  ns as an,
+  cs as ao,
+  X as b,
+  ss as c,
+  q as d,
+  es as e,
+  P as f,
+  ze as g,
+  B as h,
+  _ as i,
+  ft as j,
+  kt as k,
+  ot as l,
+  dt as m,
+  $e as n,
+  Nt as o,
+  it as p,
+  S as q,
+  ts as r,
+  gn as s,
+  se as t,
+  U as u,
+  I as v,
+  K as w,
+  T as x,
+  Jn as y,
+  L as z
 };
-//# sourceMappingURL=constants-BjRNQpT2.js.map
+//# sourceMappingURL=constants-CH7Tz5jz.js.map