@wormhole-foundation/wormhole-connect 3.0.0-beta.7-development → 3.0.0-beta.9-development

package/lib/{address-CBux52Na.mjs → address-DqsMcbcT.mjs}

@@ -24,7 +24,7 @@ function iu(n) {
     });
   }), t;
 }
-var Ze = {}, ce = {}, $i = {};
+var Qe = {}, ce = {}, $i = {};
 $i.byteLength = Ch;
 $i.toByteArray = Dh;
 $i.fromByteArray = Fh;
@@ -799,12 +799,12 @@ uc.write = function(n, e, t, r, s, i) {
   }), a.prototype.writeBigInt64BE = Yt(function(d, f = 0) {
     return $(this, d, f, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
   });
-  function J(w, d, f, v, _, P) {
+  function Z(w, d, f, v, _, P) {
     if (f + v > w.length) throw new RangeError("Index out of range");
     if (f < 0) throw new RangeError("Index out of range");
   }
   function ee(w, d, f, v, _) {
-    return d = +d, f = f >>> 0, _ || J(w, d, f, 4), t.write(w, d, f, v, 23, 4), f + 4;
+    return d = +d, f = f >>> 0, _ || Z(w, d, f, 4), t.write(w, d, f, v, 23, 4), f + 4;
   }
   a.prototype.writeFloatLE = function(d, f, v) {
     return ee(this, d, f, !0, v);
@@ -812,7 +812,7 @@ uc.write = function(n, e, t, r, s, i) {
     return ee(this, d, f, !1, v);
   };
   function Be(w, d, f, v, _) {
-    return d = +d, f = f >>> 0, _ || J(w, d, f, 8), t.write(w, d, f, v, 52, 8), f + 8;
+    return d = +d, f = f >>> 0, _ || Z(w, d, f, 8), t.write(w, d, f, v, 52, 8), f + 8;
   }
   a.prototype.writeDoubleLE = function(d, f, v) {
     return Be(this, d, f, !0, v);
@@ -1125,17 +1125,17 @@ it.env = {};
 it.argv = [];
 it.version = "";
 it.versions = {};
-function Jn() {
-}
-it.on = Jn;
-it.addListener = Jn;
-it.once = Jn;
-it.off = Jn;
-it.removeListener = Jn;
-it.removeAllListeners = Jn;
-it.emit = Jn;
-it.prependListener = Jn;
-it.prependOnceListener = Jn;
+function Zn() {
+}
+it.on = Zn;
+it.addListener = Zn;
+it.once = Zn;
+it.off = Zn;
+it.removeListener = Zn;
+it.removeAllListeners = Zn;
+it.emit = Zn;
+it.prependListener = Zn;
+it.prependOnceListener = Zn;
 it.listeners = function(n) {
   return [];
 };
@@ -1156,7 +1156,7 @@ var Uh = au.exports;
   Object.defineProperty(n, Symbol.toStringTag, { value: "Module" });
   const e = ce, t = Uh, r = (o) => o && o.__esModule ? o : { default: o }, s = r(t), i = globalThis || window || void 0 || self;
   Object.defineProperty(n, "Buffer", { enumerable: !0, get: () => e.Buffer }), Object.defineProperty(n, "process", { enumerable: !0, get: () => s.default }), n.global = i;
-})(Ze);
+})(Qe);
 const Bi = (n) => [...Array(n).keys()], uu = (n, e) => n.map((t) => t[e]), pr = (n) => Bi(n[0].length).map((e) => Bi(n.length).map((t) => n[t][e])), Mh = (n, e, t) => {
   const r = new Set(Array.isArray(e) ? e : [e]);
   return n.filter((s, i) => r.has(i) !== t);
@@ -1274,11 +1274,11 @@ function mu(n, e) {
   );
 }
 function bu(n) {
-  return lr(n, cn);
+  return dr(n, cn);
 }
 var cn = Symbol("staticCalc");
 function Kh(n, e) {
-  const t = [], r = lr(n, e, t);
+  const t = [], r = dr(n, e, t);
   if (r === null)
     throw new Error(
       `coding error: couldn't calculate layout size for layout ${n} with data ${e}`
@@ -1294,7 +1294,7 @@ function El(n, e, t) {
     case "bytes": {
       const s = "lengthSize" in n ? n.lengthSize | 0 : 0;
       if ("layout" in n) {
-        const { custom: o } = n, a = lr(
+        const { custom: o } = n, a = dr(
           n.layout,
           o === void 0 ? e : typeof o.from == "function" ? e !== cn ? r(o.from(e)) : cn : o.from,
           //flex layout bytes only allows conversions, not fixed values
@@ -1309,7 +1309,7 @@ function El(n, e, t) {
       const s = "length" in n ? n.length : void 0;
       if (e === cn) {
         if (s !== void 0) {
-          const o = lr(n.layout, cn, t);
+          const o = dr(n.layout, cn, t);
           return o !== null ? s * o : null;
         }
         return null;
@@ -1321,7 +1321,7 @@ function El(n, e, t) {
         );
       "lengthSize" in n && n.lengthSize !== void 0 && (i += n.lengthSize);
       for (let o = 0; o < e.length; ++o) {
-        const a = lr(n.layout, e[o], t);
+        const a = dr(n.layout, e[o], t);
         if (a === null)
           return null;
         i += a;
@@ -1330,12 +1330,12 @@ function El(n, e, t) {
     }
     case "switch": {
       if (e !== cn) {
-        const [i, o] = mu(n, e), a = lr(o, e, t);
+        const [i, o] = mu(n, e), a = dr(o, e, t);
         return a !== null ? n.idSize + a : null;
       }
       let s = null;
       for (const [i, o] of n.layouts) {
-        const a = lr(o, cn, t);
+        const a = dr(o, cn, t);
         if (s === null)
           s = a;
         else if (a !== s)
@@ -1345,7 +1345,7 @@ function El(n, e, t) {
     }
   }
 }
-function lr(n, e, t) {
+function dr(n, e, t) {
   if (Cs(n))
     return El(n, e, t);
   let r = 0;
@@ -1494,7 +1494,7 @@ function Es(n, e) {
     }
   return t;
 }
-function Js(n, e, t = fu, r = !1) {
+function Zs(n, e, t = fu, r = !1) {
   let s = 0n;
   for (let i = 0; i < e; ++i)
     s |= BigInt(n.bytes[n.offset + i]) << BigInt(8 * (t === "big" ? e - i - 1 : i));
@@ -1504,11 +1504,11 @@ function Cl(n, e) {
   switch (n.binary) {
     case "int":
     case "uint": {
-      const t = Js(e, n.size, n.endianness, n.binary === "int"), { custom: r } = n;
+      const t = Zs(e, n.size, n.endianness, n.binary === "int"), { custom: r } = n;
       return Br(r) ? (Sa(r, t), r) : Br(r == null ? void 0 : r.from) ? (Sa(r.from, t), r.to) : r !== void 0 ? r.to(t) : t;
     }
     case "bytes": {
-      const t = "lengthSize" in n && n.lengthSize !== void 0 ? Js(e, n.lengthSize, n.lengthEndianness) : n == null ? void 0 : n.size;
+      const t = "lengthSize" in n && n.lengthSize !== void 0 ? Zs(e, n.lengthSize, n.lengthEndianness) : n == null ? void 0 : n.size;
       if ("layout" in n) {
         const { custom: a } = n, l = e.offset;
         let h;
@@ -1547,7 +1547,7 @@ function Cl(n, e) {
         t.push(o);
       };
       let i = null;
-      if ("length" in n && n.length !== void 0 ? i = n.length : "lengthSize" in n && n.lengthSize !== void 0 && (i = Js(e, n.lengthSize, n.lengthEndianness)), i !== null)
+      if ("length" in n && n.length !== void 0 ? i = n.length : "lengthSize" in n && n.lengthSize !== void 0 && (i = Zs(e, n.lengthSize, n.lengthEndianness)), i !== null)
         for (let o = 0; o < i; ++o)
           s();
       else
@@ -1556,7 +1556,7 @@ function Cl(n, e) {
       return t;
     }
     case "switch": {
-      const t = Js(e, n.idSize, n.idEndianness), { layouts: r } = n;
+      const t = Zs(e, n.idSize, n.idEndianness), { layouts: r } = n;
       if (r.length === 0)
         throw new Error("switch item has no layouts");
       const s = typeof r[0][0] == "number", i = r.find(([h]) => s ? h === t : h[0] === t);
@@ -1623,7 +1623,7 @@ function $h(n, e) {
 function va(n) {
   return n.reduce((e, t) => e | BigInt(1) << BigInt(t), BigInt(0));
 }
-function Zs(n) {
+function Js(n) {
   const e = [];
   for (let t = 0n; n > 0n; n >>= 1n, ++t)
     n & 1n && e.push(Number(t));
@@ -1812,7 +1812,7 @@ function Gh(n) {
       if (V === n.length - 1)
         return [
           !0,
-          (ae) => Zs(
+          (ae) => Js(
             ae.length <= F ? K : G.get(ae[F]) ?? e
           )
         ];
@@ -1820,7 +1820,7 @@ function Gh(n) {
     }
   }
   if (l === n.length - 1)
-    return [!0, (F) => Zs(m(F.length))];
+    return [!0, (F) => Js(m(F.length))];
   S.sort(([F], [W]) => W - F);
   let A = !0;
   const g = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), x = (F, W) => {
@@ -1830,7 +1830,7 @@ function Gh(n) {
       return;
     let z = 0;
     const H = /* @__PURE__ */ new Map();
-    for (const G of Zs(F)) {
+    for (const G of Js(F)) {
       const V = s[G][0], ae = a.get(V) & F;
       H.set(V, ae), z = Math.max(z, St(ae));
     }
@@ -1910,7 +1910,7 @@ function Gh(n) {
         break;
       z = g.get(W) ?? R(W);
     }
-    return Zs(W);
+    return Js(W);
   }];
 }
 var hc = (n, e) => ({
@@ -1959,7 +1959,7 @@ function P4(n, e) {
   return Number(Number(n).toFixed(e));
 }
 function jo(n, e) {
-  if (Jh(n, e), n = n.toString(), n.includes("e"))
+  if (Zh(n, e), n = n.toString(), n.includes("e"))
     throw new Error("Scientific notation is not supported yet by Amount");
   const t = n.split(".");
   if (t.length > 2)
@@ -2022,7 +2022,7 @@ function hi(n) {
 function kl(n, e) {
   return gu(Bs(n, e));
 }
-function Jh(n, e) {
+function Zh(n, e) {
   if (typeof n == "number") {
     if (!isFinite(n))
       throw new Error("Amount: invalid input. Amount must be finite");
@@ -2108,7 +2108,7 @@ function Xi(n = "") {
   };
 }
 // @__NO_SIDE_EFFECTS__
-function Zh(n, e = "=") {
+function Jh(n, e = "=") {
   return rs(n), Vr("padding", e), {
     encode(t) {
       for (Di("padding.encode", t); t.length * n % 8; )
@@ -2250,7 +2250,7 @@ function em(n, e) {
     }
   };
 }
-const Il = /* @__PURE__ */ Ps(/* @__PURE__ */ bc(4), /* @__PURE__ */ Gi("0123456789ABCDEF"), /* @__PURE__ */ Xi("")), Ul = /* @__PURE__ */ Ps(/* @__PURE__ */ bc(6), /* @__PURE__ */ Gi("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ Zh(6), /* @__PURE__ */ Xi("")), tm = /* @__NO_SIDE_EFFECTS__ */ (n) => /* @__PURE__ */ Ps(/* @__PURE__ */ Qh(58), /* @__PURE__ */ Gi(n), /* @__PURE__ */ Xi("")), Fa = /* @__PURE__ */ tm("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), L4 = (n) => /* @__PURE__ */ Ps(em(4, (e) => n(n(e))), Fa), Ta = /* @__PURE__ */ Ps(/* @__PURE__ */ Gi("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ Xi("")), Ml = [996825010, 642813549, 513874426, 1027748829, 705979059];
+const Il = /* @__PURE__ */ Ps(/* @__PURE__ */ bc(4), /* @__PURE__ */ Gi("0123456789ABCDEF"), /* @__PURE__ */ Xi("")), Ul = /* @__PURE__ */ Ps(/* @__PURE__ */ bc(6), /* @__PURE__ */ Gi("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ Jh(6), /* @__PURE__ */ Xi("")), tm = /* @__NO_SIDE_EFFECTS__ */ (n) => /* @__PURE__ */ Ps(/* @__PURE__ */ Qh(58), /* @__PURE__ */ Gi(n), /* @__PURE__ */ Xi("")), Fa = /* @__PURE__ */ tm("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), L4 = (n) => /* @__PURE__ */ Ps(em(4, (e) => n(n(e))), Fa), Ta = /* @__PURE__ */ Ps(/* @__PURE__ */ Gi("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ Xi("")), Ml = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function ps(n) {
   const e = n >> 25;
   let t = (n & 33554431) << 5;
@@ -4189,7 +4189,7 @@ function ql(n) {
     n[e] = Ru(n[e]);
 }
 const qm = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0"));
-function J4(n) {
+function Z4(n) {
   ss(n);
   let e = "";
   for (let t = 0; t < n.length; t++)
@@ -4205,7 +4205,7 @@ function Kl(n) {
   if (n >= Wn.a && n <= Wn.f)
     return n - (Wn.a - 10);
 }
-function Z4(n) {
+function J4(n) {
   if (typeof n != "string")
     throw new Error("hex string expected, got " + typeof n);
   const e = n.length, t = e / 2;
@@ -4254,7 +4254,7 @@ function e6(n, e) {
     throw new Error("Options should be object or undefined");
   return Object.assign(n, e);
 }
-function Ji(n) {
+function Zi(n) {
   const e = (r) => n().update(zs(r)).digest(), t = n();
   return e.outputLen = t.outputLen, e.blockLen = t.blockLen, e.create = () => n(), e;
 }
@@ -4396,7 +4396,7 @@ const Xm = /* @__PURE__ */ new Uint32Array([
   2756734187,
   3204031479,
   3329325298
-]), Zn = /* @__PURE__ */ new Uint32Array([
+]), Jn = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -4408,7 +4408,7 @@ const Xm = /* @__PURE__ */ new Uint32Array([
 ]), Qn = /* @__PURE__ */ new Uint32Array(64);
 class Ym extends Pu {
   constructor() {
-    super(64, 32, 8, !1), this.A = Zn[0] | 0, this.B = Zn[1] | 0, this.C = Zn[2] | 0, this.D = Zn[3] | 0, this.E = Zn[4] | 0, this.F = Zn[5] | 0, this.G = Zn[6] | 0, this.H = Zn[7] | 0;
+    super(64, 32, 8, !1), this.A = Jn[0] | 0, this.B = Jn[1] | 0, this.C = Jn[2] | 0, this.D = Jn[3] | 0, this.E = Jn[4] | 0, this.F = Jn[5] | 0, this.G = Jn[6] | 0, this.H = Jn[7] | 0;
   }
   get() {
     const { A: e, B: t, C: r, D: s, E: i, F: o, G: a, H: l } = this;
@@ -4439,7 +4439,7 @@ class Ym extends Pu {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-const Fi = /* @__PURE__ */ Ji(() => new Ym()), Qs = /* @__PURE__ */ BigInt(2 ** 32 - 1), Wa = /* @__PURE__ */ BigInt(32);
+const Fi = /* @__PURE__ */ Zi(() => new Ym()), Qs = /* @__PURE__ */ BigInt(2 ** 32 - 1), Wa = /* @__PURE__ */ BigInt(32);
 function Lu(n, e = !1) {
   return e ? { h: Number(n & Qs), l: Number(n >> Wa & Qs) } : { h: Number(n >> Wa & Qs) | 0, l: Number(n & Qs) | 0 };
 }
@@ -4451,7 +4451,7 @@ function Ou(n, e = !1) {
   }
   return [t, r];
 }
-const Jm = (n, e) => BigInt(n >>> 0) << Wa | BigInt(e >>> 0), Zm = (n, e, t) => n >>> t, Qm = (n, e, t) => n << 32 - t | e >>> t, e1 = (n, e, t) => n >>> t | e << 32 - t, t1 = (n, e, t) => n << 32 - t | e >>> t, n1 = (n, e, t) => n << 64 - t | e >>> t - 32, r1 = (n, e, t) => n >>> t - 32 | e << 64 - t, s1 = (n, e) => e, i1 = (n, e) => n, Nu = (n, e, t) => n << t | e >>> 32 - t, zu = (n, e, t) => e << t | n >>> 32 - t, Hu = (n, e, t) => e << t - 32 | n >>> 64 - t, qu = (n, e, t) => n << t - 32 | e >>> 64 - t;
+const Zm = (n, e) => BigInt(n >>> 0) << Wa | BigInt(e >>> 0), Jm = (n, e, t) => n >>> t, Qm = (n, e, t) => n << 32 - t | e >>> t, e1 = (n, e, t) => n >>> t | e << 32 - t, t1 = (n, e, t) => n << 32 - t | e >>> t, n1 = (n, e, t) => n << 64 - t | e >>> t - 32, r1 = (n, e, t) => n >>> t - 32 | e << 64 - t, s1 = (n, e) => e, i1 = (n, e) => n, Nu = (n, e, t) => n << t | e >>> 32 - t, zu = (n, e, t) => e << t | n >>> 32 - t, Hu = (n, e, t) => e << t - 32 | n >>> 64 - t, qu = (n, e, t) => n << t - 32 | e >>> 64 - t;
 function o1(n, e, t, r) {
   const s = (e >>> 0) + (r >>> 0);
   return { h: n + t + (s / 2 ** 32 | 0) | 0, l: s | 0 };
@@ -4459,8 +4459,8 @@ function o1(n, e, t, r) {
 const a1 = (n, e, t) => (n >>> 0) + (e >>> 0) + (t >>> 0), c1 = (n, e, t, r) => e + t + r + (n / 2 ** 32 | 0) | 0, l1 = (n, e, t, r) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0), d1 = (n, e, t, r, s) => e + t + r + s + (n / 2 ** 32 | 0) | 0, u1 = (n, e, t, r, s) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0) + (s >>> 0), f1 = (n, e, t, r, s, i) => e + t + r + s + i + (n / 2 ** 32 | 0) | 0, ye = {
   fromBig: Lu,
   split: Ou,
-  toBig: Jm,
-  shrSH: Zm,
+  toBig: Zm,
+  shrSH: Jm,
   shrSL: Qm,
   rotrSH: e1,
   rotrSL: t1,
@@ -4577,7 +4577,7 @@ let E1 = class Vu extends xc {
     return e || (e = new Vu(t, r, s, o, i)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = i, e.suffix = r, e.outputLen = s, e.enableXOF = o, e.destroyed = this.destroyed, e;
   }
 };
-const Gu = (n, e, t) => Ji(() => new E1(e, n, t)), n6 = /* @__PURE__ */ Gu(6, 136, 256 / 8), Ti = /* @__PURE__ */ Gu(1, 136, 256 / 8), [B1, x1] = ye.split([
+const Gu = (n, e, t) => Zi(() => new E1(e, n, t)), n6 = /* @__PURE__ */ Gu(6, 136, 256 / 8), Ti = /* @__PURE__ */ Gu(1, 136, 256 / 8), [B1, x1] = ye.split([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
   "0xb5c0fbcfec4d3b2f",
@@ -4700,7 +4700,7 @@ class C1 extends Xu {
     super(), this.Ah = 573645204, this.Al = -64227540, this.Bh = -1621794909, this.Bl = -934517566, this.Ch = 596883563, this.Cl = 1867755857, this.Dh = -1774684391, this.Dl = 1497426621, this.Eh = -1775747358, this.El = -1467023389, this.Fh = -1101128155, this.Fl = 1401305490, this.Gh = 721525244, this.Gl = 746961066, this.Hh = 246885852, this.Hl = -2117784414, this.outputLen = 32;
   }
 }
-const S1 = /* @__PURE__ */ Ji(() => new Xu()), D1 = /* @__PURE__ */ Ji(() => new C1());
+const S1 = /* @__PURE__ */ Zi(() => new Xu()), D1 = /* @__PURE__ */ Zi(() => new C1());
 class Yu extends xc {
   constructor(e, t) {
     super(), this.finished = !1, this.destroyed = !1, zm(e);
@@ -4736,10 +4736,10 @@ class Yu extends xc {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const Ju = (n, e, t) => new Yu(n, e).update(t).digest();
-Ju.create = (n, e) => new Yu(n, e);
+const Zu = (n, e, t) => new Yu(n, e).update(t).digest();
+Zu.create = (n, e) => new Yu(n, e);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Zi = /* @__PURE__ */ BigInt(0), Qi = /* @__PURE__ */ BigInt(1), v1 = /* @__PURE__ */ BigInt(2);
+const Ji = /* @__PURE__ */ BigInt(0), Qi = /* @__PURE__ */ BigInt(1), v1 = /* @__PURE__ */ BigInt(2);
 function xr(n) {
   return n instanceof Uint8Array || ArrayBuffer.isView(n) && n.constructor.name === "Uint8Array";
 }
@@ -4766,7 +4766,7 @@ function Lr(n) {
 function Cc(n) {
   if (typeof n != "string")
     throw new Error("hex string expected, got " + typeof n);
-  return n === "" ? Zi : BigInt("0x" + n);
+  return n === "" ? Ji : BigInt("0x" + n);
 }
 const Pn = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
 function Vl(n) {
@@ -4852,7 +4852,7 @@ function I1(n) {
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(n));
 }
-const Yo = (n) => typeof n == "bigint" && Zi <= n;
+const Yo = (n) => typeof n == "bigint" && Ji <= n;
 function eo(n, e, t) {
   return Yo(n) && Yo(e) && Yo(t) && e <= n && n < t;
 }
@@ -4860,9 +4860,9 @@ function dn(n, e, t, r) {
   if (!eo(e, t, r))
     throw new Error("expected valid " + n + ": " + t + " <= n < " + r + ", got " + e);
 }
-function Zu(n) {
+function Ju(n) {
   let e;
-  for (e = 0; n > Zi; n >>= Qi, e += 1)
+  for (e = 0; n > Ji; n >>= Qi, e += 1)
     ;
   return e;
 }
@@ -4870,9 +4870,9 @@ function U1(n, e) {
   return n >> BigInt(e) & Qi;
 }
 function M1(n, e, t) {
-  return n | (t ? Qi : Zi) << BigInt(e);
+  return n | (t ? Qi : Ji) << BigInt(e);
 }
-const Sc = (n) => (v1 << BigInt(n - 1)) - Qi, Jo = (n) => new Uint8Array(n), Gl = (n) => Uint8Array.from(n);
+const Sc = (n) => (v1 << BigInt(n - 1)) - Qi, Zo = (n) => new Uint8Array(n), Gl = (n) => Uint8Array.from(n);
 function Qu(n, e, t) {
   if (typeof n != "number" || n < 2)
     throw new Error("hashLen must be a number");
@@ -4880,10 +4880,10 @@ function Qu(n, e, t) {
     throw new Error("qByteLen must be a number");
   if (typeof t != "function")
     throw new Error("hmacFn must be a function");
-  let r = Jo(n), s = Jo(n), i = 0;
+  let r = Zo(n), s = Zo(n), i = 0;
   const o = () => {
     r.fill(1), s.fill(0), i = 0;
-  }, a = (...E) => t(s, r, ...E), l = (E = Jo()) => {
+  }, a = (...E) => t(s, r, ...E), l = (E = Zo()) => {
     s = a(Gl([0]), E), r = a(), E.length !== 0 && (s = a(Gl([1]), E), r = a());
   }, h = () => {
     if (i++ >= 1e3)
@@ -4950,7 +4950,7 @@ const W1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   abool: $n,
   abytes: Hs,
   bitGet: U1,
-  bitLen: Zu,
+  bitLen: Ju,
   bitMask: Sc,
   bitSet: M1,
   bytesToHex: Cr,
@@ -4974,8 +4974,8 @@ const W1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateObject: is
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Tt = BigInt(0), et = BigInt(1), dr = /* @__PURE__ */ BigInt(2), P1 = /* @__PURE__ */ BigInt(3), Pa = /* @__PURE__ */ BigInt(4), Xl = /* @__PURE__ */ BigInt(5), Yl = /* @__PURE__ */ BigInt(8);
-function Je(n, e) {
+const Tt = BigInt(0), Je = BigInt(1), rr = /* @__PURE__ */ BigInt(2), P1 = /* @__PURE__ */ BigInt(3), Pa = /* @__PURE__ */ BigInt(4), Xl = /* @__PURE__ */ BigInt(5), Yl = /* @__PURE__ */ BigInt(8);
+function Ze(n, e) {
   const t = n % e;
   return t >= Tt ? t : e + t;
 }
@@ -4984,11 +4984,11 @@ function L1(n, e, t) {
     throw new Error("invalid exponent, negatives unsupported");
   if (t <= Tt)
     throw new Error("invalid modulus");
-  if (t === et)
+  if (t === Je)
     return Tt;
-  let r = et;
+  let r = Je;
   for (; e > Tt; )
-    e & et && (r = r * n % t), n = n * n % t, e >>= et;
+    e & Je && (r = r * n % t), n = n * n % t, e >>= Je;
   return r;
 }
 function rt(n, e, t) {
@@ -5002,25 +5002,25 @@ function La(n, e) {
     throw new Error("invert: expected non-zero number");
   if (e <= Tt)
     throw new Error("invert: expected positive modulus, got " + e);
-  let t = Je(n, e), r = e, s = Tt, i = et;
+  let t = Ze(n, e), r = e, s = Tt, i = Je;
   for (; t !== Tt; ) {
     const a = r / t, l = r % t, h = s - i * a;
     r = t, t = l, s = i, i = h;
   }
-  if (r !== et)
+  if (r !== Je)
     throw new Error("invert: does not exist");
-  return Je(s, e);
+  return Ze(s, e);
 }
 function O1(n) {
-  const e = (n - et) / dr;
+  const e = (n - Je) / rr;
   let t, r, s;
-  for (t = n - et, r = 0; t % dr === Tt; t /= dr, r++)
+  for (t = n - Je, r = 0; t % rr === Tt; t /= rr, r++)
     ;
-  for (s = dr; s < n && L1(s, e, n) !== n - et; s++)
+  for (s = rr; s < n && L1(s, e, n) !== n - Je; s++)
     if (s > 1e3)
       throw new Error("Cannot find square root: likely non-prime P");
   if (r === 1) {
-    const o = (n + et) / Pa;
+    const o = (n + Je) / Pa;
     return function(l, h) {
       const m = l.pow(h, o);
       if (!l.eql(l.sqr(m), h))
@@ -5028,7 +5028,7 @@ function O1(n) {
       return m;
     };
   }
-  const i = (t + et) / dr;
+  const i = (t + Je) / rr;
   return function(a, l) {
     if (a.pow(l, e) === a.neg(a.ONE))
       throw new Error("Cannot find square root");
@@ -5039,7 +5039,7 @@ function O1(n) {
       let A = 1;
       for (let D = a.sqr(S); A < h && !a.eql(D, a.ONE); A++)
         D = a.sqr(D);
-      const g = a.pow(m, et << BigInt(h - A - 1));
+      const g = a.pow(m, Je << BigInt(h - A - 1));
       m = a.sqr(g), E = a.mul(E, g), S = a.mul(S, m), h = A;
     }
     return E;
@@ -5047,7 +5047,7 @@ function O1(n) {
 }
 function N1(n) {
   if (n % Pa === P1) {
-    const e = (n + et) / Pa;
+    const e = (n + Je) / Pa;
     return function(r, s) {
       const i = r.pow(s, e);
       if (!r.eql(r.sqr(i), s))
@@ -5058,7 +5058,7 @@ function N1(n) {
   if (n % Yl === Xl) {
     const e = (n - Xl) / Yl;
     return function(r, s) {
-      const i = r.mul(s, dr), o = r.pow(i, e), a = r.mul(s, o), l = r.mul(r.mul(a, dr), o), h = r.mul(a, r.sub(l, r.ONE));
+      const i = r.mul(s, rr), o = r.pow(i, e), a = r.mul(s, o), l = r.mul(r.mul(a, rr), o), h = r.mul(a, r.sub(l, r.ONE));
       if (!r.eql(r.sqr(h), s))
         throw new Error("Cannot find square root");
       return h;
@@ -5066,7 +5066,7 @@ function N1(n) {
   }
   return O1(n);
 }
-const z1 = (n, e) => (Je(n, e) & et) === et, H1 = [
+const z1 = (n, e) => (Ze(n, e) & Je) === Je, H1 = [
   "create",
   "isValid",
   "is0",
@@ -5099,17 +5099,21 @@ function K1(n, e, t) {
     throw new Error("invalid exponent, negatives unsupported");
   if (t === Tt)
     return n.ONE;
-  if (t === et)
+  if (t === Je)
     return e;
   let r = n.ONE, s = e;
   for (; t > Tt; )
-    t & et && (r = n.mul(r, s)), s = n.sqr(s), t >>= et;
+    t & Je && (r = n.mul(r, s)), s = n.sqr(s), t >>= Je;
   return r;
 }
 function j1(n, e) {
   const t = new Array(e.length), r = e.reduce((i, o, a) => n.is0(o) ? i : (t[a] = i, n.mul(i, o)), n.ONE), s = n.inv(r);
   return e.reduceRight((i, o, a) => n.is0(o) ? i : (t[a] = n.mul(i, t[a]), n.mul(i, o)), s), t;
 }
+function r6(n) {
+  const e = (n - Je) / rr;
+  return (t, r) => t.pow(r, e);
+}
 function ef(n, e) {
   const t = e !== void 0 ? e : n.toString(2).length, r = Math.ceil(t / 8);
   return { nBitLength: t, nByteLength: r };
@@ -5128,23 +5132,23 @@ function to(n, e, t = !1, r = {}) {
     BYTES: i,
     MASK: Sc(s),
     ZERO: Tt,
-    ONE: et,
-    create: (l) => Je(l, n),
+    ONE: Je,
+    create: (l) => Ze(l, n),
     isValid: (l) => {
       if (typeof l != "bigint")
         throw new Error("invalid field element: expected bigint, got " + typeof l);
       return Tt <= l && l < n;
     },
     is0: (l) => l === Tt,
-    isOdd: (l) => (l & et) === et,
-    neg: (l) => Je(-l, n),
+    isOdd: (l) => (l & Je) === Je,
+    neg: (l) => Ze(-l, n),
     eql: (l, h) => l === h,
-    sqr: (l) => Je(l * l, n),
-    add: (l, h) => Je(l + h, n),
-    sub: (l, h) => Je(l - h, n),
-    mul: (l, h) => Je(l * h, n),
+    sqr: (l) => Ze(l * l, n),
+    add: (l, h) => Ze(l + h, n),
+    sub: (l, h) => Ze(l - h, n),
+    mul: (l, h) => Ze(l * h, n),
     pow: (l, h) => K1(a, l, h),
-    div: (l, h) => Je(l * La(h, n), n),
+    div: (l, h) => Ze(l * La(h, n), n),
     // Same as above, but doesn't normalize
     sqrN: (l) => l * l,
     addN: (l, h) => l + h,
@@ -5179,12 +5183,12 @@ function $1(n, e, t = !1) {
   const r = n.length, s = tf(e), i = nf(e);
   if (r < 16 || r < i || r > 1024)
     throw new Error("expected " + i + "-1024 bytes of input, got " + r);
-  const o = t ? Hr(n) : Ar(n), a = Je(o, e - et) + et;
+  const o = t ? Hr(n) : Ar(n), a = Ze(o, e - Je) + Je;
   return t ? Ds(a, s) : Yr(a, s);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Jl = BigInt(0), ei = BigInt(1);
-function Zo(n, e) {
+const Zl = BigInt(0), ei = BigInt(1);
+function Jo(n, e) {
   const t = e.negate();
   return n ? t : e;
 }
@@ -5219,14 +5223,14 @@ function ta(n) {
 }
 function of(n, e) {
   return {
-    constTimeNegate: Zo,
+    constTimeNegate: Jo,
     hasPrecomputes(t) {
       return ta(t) !== 1;
     },
     // non-const time multiplication ladder
     unsafeLadder(t, r, s = n.ZERO) {
       let i = t;
-      for (; r > Jl; )
+      for (; r > Zl; )
         r & ei && (s = s.add(i)), i = i.double(), r >>= ei;
       return s;
     },
@@ -5269,7 +5273,7 @@ function of(n, e) {
         let g = Number(s & h);
         s >>= E, g > o && (g -= m, s += ei);
         const D = A, x = A + Math.abs(g) - 1, U = S % 2 !== 0, R = g < 0;
-        g === 0 ? l = l.add(Zo(U, r[D])) : a = a.add(Zo(R, r[x]));
+        g === 0 ? l = l.add(Jo(U, r[D])) : a = a.add(Jo(R, r[x]));
       }
       return { p: a, f: l };
     },
@@ -5285,7 +5289,7 @@ function of(n, e) {
       const { windows: o, windowSize: a } = Qo(t, e), l = BigInt(2 ** t - 1), h = 2 ** t, m = BigInt(t);
       for (let E = 0; E < o; E++) {
         const S = E * a;
-        if (s === Jl)
+        if (s === Zl)
           break;
         let A = Number(s & l);
         if (s >>= m, A > a && (A -= h, s += ei), A === 0)
@@ -5318,7 +5322,7 @@ function of(n, e) {
 function af(n, e, t, r) {
   if (V1(t, n), G1(r, e), t.length !== r.length)
     throw new Error("arrays of points and scalars must have equal length");
-  const s = n.ZERO, i = Zu(BigInt(t.length)), o = i > 12 ? i - 3 : i > 4 ? i - 2 : i ? 2 : 1, a = (1 << o) - 1, l = new Array(a + 1).fill(s), h = Math.floor((e.BITS - 1) / o) * o;
+  const s = n.ZERO, i = Ju(BigInt(t.length)), o = i > 12 ? i - 3 : i > 4 ? i - 2 : i ? 2 : 1, a = (1 << o) - 1, l = new Array(a + 1).fill(s), h = Math.floor((e.BITS - 1) / o) * o;
   let m = s;
   for (let E = h; E >= 0; E -= o) {
     l.fill(s);
@@ -5351,7 +5355,7 @@ function Dc(n) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Zl(n) {
+function Jl(n) {
   n.lowS !== void 0 && $n("lowS", n.lowS), n.prehash !== void 0 && $n("prehash", n.prehash);
 }
 function X1(n) {
@@ -5377,15 +5381,15 @@ function X1(n) {
   }
   return Object.freeze({ ...e });
 }
-const { bytesToNumberBE: Y1, hexToBytes: J1 } = W1;
-class Z1 extends Error {
+const { bytesToNumberBE: Y1, hexToBytes: Z1 } = W1;
+class J1 extends Error {
   constructor(e = "") {
     super(e);
   }
 }
 const Nn = {
   // asn.1 DER encoding utils
-  Err: Z1,
+  Err: J1,
   // Basic building block is TLV (Tag-Length-Value)
   _tlv: {
     encode: (n, e) => {
@@ -5458,7 +5462,7 @@ const Nn = {
     }
   },
   toSig(n) {
-    const { Err: e, _int: t, _tlv: r } = Nn, s = typeof n == "string" ? J1(n) : n;
+    const { Err: e, _int: t, _tlv: r } = Nn, s = typeof n == "string" ? Z1(n) : n;
     Hs(s);
     const { v: i, l: o } = r.decode(48, s);
     if (o.length)
@@ -5506,7 +5510,7 @@ function Q1(n) {
     } catch {
       throw new Error("invalid private key, expected hex or " + U + " bytes, got " + typeof D);
     }
-    return R && (W = Je(W, F)), dn("private key", W, vt, F), W;
+    return R && (W = Ze(W, F)), dn("private key", W, vt, F), W;
   }
   function h(D) {
     if (!(D instanceof S))
@@ -5756,7 +5760,7 @@ function eb(n) {
 function tb(n) {
   const e = eb(n), { Fp: t, n: r } = e, s = t.BYTES + 1, i = 2 * t.BYTES + 1;
   function o(c) {
-    return Je(c, r);
+    return Ze(c, r);
   }
   function a(c) {
     return La(c, r);
@@ -5828,7 +5832,7 @@ function tb(n) {
       const M = C === 2 || C === 3 ? p + e.n : p;
       if (M >= t.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const B = C & 1 ? "03" : "02", u = l.fromHex(B + S(M)), k = a(M), $ = o(-T * k), J = o(y * k), ee = l.BASE.multiplyAndAddUnsafe(u, $, J);
+      const B = C & 1 ? "03" : "02", u = l.fromHex(B + S(M)), k = a(M), $ = o(-T * k), Z = o(y * k), ee = l.BASE.multiplyAndAddUnsafe(u, $, Z);
       if (!ee)
         throw new Error("point at infinify");
       return ee.assertValidity(), ee;
@@ -5914,13 +5918,13 @@ function tb(n) {
       throw new Error("sign() legacy options not supported");
     const { hash: y, randomBytes: C } = e;
     let { lowS: T, prehash: M, extraEntropy: B } = p;
-    T == null && (T = !0), c = Ct("msgHash", c), Zl(p), M && (c = Ct("prehashed msgHash", y(c)));
+    T == null && (T = !0), c = Ct("msgHash", c), Jl(p), M && (c = Ct("prehashed msgHash", y(c)));
     const u = H(c), k = h(b), $ = [G(k), G(u)];
     if (B != null && B !== !1) {
       const ue = B === !0 ? C(t.BYTES) : B;
       $.push(Ct("extraEntropy", ue));
     }
-    const J = Sr(...$), ee = u;
+    const Z = Sr(...$), ee = u;
     function Be(ue) {
       const me = z(ue);
       if (!E(me))
@@ -5934,7 +5938,7 @@ function tb(n) {
       let De = (Ce.x === Ee ? 0 : 2) | Number(Ce.y & vt), Ie = ot;
       return T && A(ot) && (Ie = g(ot), De ^= 1), new x(Ee, Ie, De);
     }
-    return { seed: J, k2sig: Be };
+    return { seed: Z, k2sig: Be };
   }
   const ae = { lowS: e.lowS, prehash: !1 }, ne = { lowS: e.lowS, prehash: !1 };
   function le(c, b, p = ae) {
@@ -5947,14 +5951,14 @@ function tb(n) {
     const C = c;
     b = Ct("msgHash", b), p = Ct("publicKey", p);
     const { lowS: T, prehash: M, format: B } = y;
-    if (Zl(y), "strict" in y)
+    if (Jl(y), "strict" in y)
       throw new Error("options.strict was renamed to lowS");
     if (B !== void 0 && B !== "compact" && B !== "der")
       throw new Error("format must be compact or der");
     const u = typeof C == "string" || xr(C), k = !u && !B && typeof C == "object" && C !== null && typeof C.r == "bigint" && typeof C.s == "bigint";
     if (!u && !k)
       throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-    let $, J;
+    let $, Z;
     try {
       if (k && ($ = new x(C.r, C.s)), u) {
         try {
@@ -5965,14 +5969,14 @@ function tb(n) {
         }
         !$ && B !== "der" && ($ = x.fromCompact(C));
       }
-      J = l.fromHex(p);
+      Z = l.fromHex(p);
     } catch {
       return !1;
     }
     if (!$ || T && $.hasHighS())
       return !1;
     M && (b = e.hash(b));
-    const { r: ee, s: Be } = $, ue = H(b), me = a(Be), nt = o(ue * me), Ce = o(ee * me), Ee = (De = l.BASE.multiplyAndAddUnsafe(J, nt, Ce)) == null ? void 0 : De.toAffine();
+    const { r: ee, s: Be } = $, ue = H(b), me = a(Be), nt = o(ue * me), Ce = o(ee * me), Ee = (De = l.BASE.multiplyAndAddUnsafe(Z, nt, Ce)) == null ? void 0 : De.toAffine();
     return Ee ? o(Ee.x) === ee : !1;
   }
   return {
@@ -5990,7 +5994,7 @@ function tb(n) {
 function nb(n) {
   return {
     hash: n,
-    hmac: (e, ...t) => Ju(n, e, jm(...t)),
+    hmac: (e, ...t) => Zu(n, e, jm(...t)),
     randomBytes: Wu
   };
 }
@@ -6006,7 +6010,7 @@ function ib(n) {
     throw new Error("Cannot find square root");
   return H;
 }
-const Na = to(cf, void 0, void 0, { sqrt: ib }), rr = rb({
+const Na = to(cf, void 0, void 0, { sqrt: ib }), sr = rb({
   a: BigInt(0),
   // equation params: a, b
   b: BigInt(7),
@@ -6026,7 +6030,7 @@ const Na = to(cf, void 0, void 0, { sqrt: ib }), rr = rb({
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (n) => {
       const e = ed, t = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -sb * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), s = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = t, o = BigInt("0x100000000000000000000000000000000"), a = td(i * n, e), l = td(-r * n, e);
-      let h = Je(n - a * t - l * s, e), m = Je(-a * r - l * i, e);
+      let h = Ze(n - a * t - l * s, e), m = Ze(-a * r - l * i, e);
       const E = h > o, S = m > o;
       if (E && (h = e - h), S && (m = e - m), h > o || m > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + n);
@@ -6035,9 +6039,9 @@ const Na = to(cf, void 0, void 0, { sqrt: ib }), rr = rb({
   }
 }, Fi);
 BigInt(0);
-rr.ProjectivePoint;
+sr.ProjectivePoint;
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const mn = BigInt(0), Jt = BigInt(1), ti = BigInt(2), ob = BigInt(8), ab = { zip215: !0 };
+const mn = BigInt(0), Zt = BigInt(1), ti = BigInt(2), ob = BigInt(8), ab = { zip215: !0 };
 function cb(n) {
   const e = Dc(n);
   return is(n, {
@@ -6053,7 +6057,7 @@ function cb(n) {
   }), Object.freeze({ ...e });
 }
 function lb(n) {
-  const e = cb(n), { Fp: t, n: r, prehash: s, hash: i, randomBytes: o, nByteLength: a, h: l } = e, h = ti << BigInt(a * 8) - Jt, m = t.create, E = to(e.n, e.nBitLength), S = e.uvRatio || ((p, y) => {
+  const e = cb(n), { Fp: t, n: r, prehash: s, hash: i, randomBytes: o, nByteLength: a, h: l } = e, h = ti << BigInt(a * 8) - Zt, m = t.create, E = to(e.n, e.nBitLength), S = e.uvRatio || ((p, y) => {
     try {
       return { isValid: !0, value: t.sqrt(p * t.inv(y)) };
     } catch {
@@ -6076,15 +6080,15 @@ function lb(n) {
     y == null && (y = B ? ob : t.inv(M));
     const u = m(C * y), k = m(T * y), $ = m(M * y);
     if (B)
-      return { x: mn, y: Jt };
-    if ($ !== Jt)
+      return { x: mn, y: Zt };
+    if ($ !== Zt)
       throw new Error("invZ was invalid");
     return { x: u, y: k };
   }), R = vs((p) => {
     const { a: y, d: C } = e;
     if (p.is0())
       throw new Error("bad point: ZERO");
-    const { ex: T, ey: M, ez: B, et: u } = p, k = m(T * T), $ = m(M * M), J = m(B * B), ee = m(J * J), Be = m(k * y), ue = m(J * m(Be + $)), me = m(ee + m(C * m(k * $)));
+    const { ex: T, ey: M, ez: B, et: u } = p, k = m(T * T), $ = m(M * M), Z = m(B * B), ee = m(Z * Z), Be = m(k * y), ue = m(Z * m(Be + $)), me = m(ee + m(C * m(k * $)));
     if (ue !== me)
       throw new Error("bad point: equation left != right (1)");
     const nt = m(T * M), Ce = m(B * u);
@@ -6106,7 +6110,7 @@ function lb(n) {
       if (y instanceof F)
         throw new Error("extended point not allowed");
       const { x: C, y: T } = y || {};
-      return D("x", C), D("y", T), new F(C, T, Jt, m(C * T));
+      return D("x", C), D("y", T), new F(C, T, Zt, m(C * T));
     }
     static normalizeZ(y) {
       const C = t.invertBatch(y.map((T) => T.ez));
@@ -6128,8 +6132,8 @@ function lb(n) {
     // Compare one point to another.
     equals(y) {
       x(y);
-      const { ex: C, ey: T, ez: M } = this, { ex: B, ey: u, ez: k } = y, $ = m(C * k), J = m(B * M), ee = m(T * k), Be = m(u * M);
-      return $ === J && ee === Be;
+      const { ex: C, ey: T, ez: M } = this, { ex: B, ey: u, ez: k } = y, $ = m(C * k), Z = m(B * M), ee = m(T * k), Be = m(u * M);
+      return $ === Z && ee === Be;
     }
     is0() {
       return this.equals(F.ZERO);
@@ -6141,7 +6145,7 @@ function lb(n) {
     // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
     // Cost: 4M + 4S + 1*a + 6add + 1*2.
     double() {
-      const { a: y } = e, { ex: C, ey: T, ez: M } = this, B = m(C * C), u = m(T * T), k = m(ti * m(M * M)), $ = m(y * B), J = C + T, ee = m(m(J * J) - B - u), Be = $ + u, ue = Be - k, me = $ - u, nt = m(ee * ue), Ce = m(Be * me), Ee = m(ee * me), ot = m(ue * Be);
+      const { a: y } = e, { ex: C, ey: T, ez: M } = this, B = m(C * C), u = m(T * T), k = m(ti * m(M * M)), $ = m(y * B), Z = C + T, ee = m(m(Z * Z) - B - u), Be = $ + u, ue = Be - k, me = $ - u, nt = m(ee * ue), Ce = m(Be * me), Ee = m(ee * me), ot = m(ue * Be);
       return new F(nt, Ce, ot, Ee);
     }
     // Fast algo for adding 2 Extended Points.
@@ -6149,15 +6153,15 @@ function lb(n) {
     // Cost: 9M + 1*a + 1*d + 7add.
     add(y) {
       x(y);
-      const { a: C, d: T } = e, { ex: M, ey: B, ez: u, et: k } = this, { ex: $, ey: J, ez: ee, et: Be } = y;
+      const { a: C, d: T } = e, { ex: M, ey: B, ez: u, et: k } = this, { ex: $, ey: Z, ez: ee, et: Be } = y;
       if (C === BigInt(-1)) {
-        const qe = m((B - M) * (J + $)), Oe = m((B + M) * (J - $)), Ut = m(Oe - qe);
+        const qe = m((B - M) * (Z + $)), Oe = m((B + M) * (Z - $)), Ut = m(Oe - qe);
         if (Ut === mn)
           return this.double();
         const Ne = m(u * ti * Be), $e = m(k * ti * ee), Yt = $e + Ne, Ve = Oe + qe, w = $e - Ne, d = m(Yt * Ut), f = m(Ve * w), v = m(Yt * w), _ = m(Ut * Ve);
         return new F(d, f, _, v);
       }
-      const ue = m(M * $), me = m(B * J), nt = m(k * T * Be), Ce = m(u * ee), Ee = m((M + B) * ($ + J) - ue - me), ot = Ce - nt, De = Ce + nt, Ie = m(me - C * ue), Mr = m(Ee * ot), He = m(De * Ie), Ye = m(Ee * Ie), _r = m(ot * De);
+      const ue = m(M * $), me = m(B * Z), nt = m(k * T * Be), Ce = m(u * ee), Ee = m((M + B) * ($ + Z) - ue - me), ot = Ce - nt, De = Ce + nt, Ie = m(me - C * ue), Mr = m(Ee * ot), He = m(De * Ie), Ye = m(Ee * Ie), _r = m(ot * De);
       return new F(Mr, He, _r, Ye);
     }
     subtract(y) {
@@ -6169,7 +6173,7 @@ function lb(n) {
     // Constant-time multiplication.
     multiply(y) {
       const C = y;
-      dn("scalar", C, Jt, r);
+      dn("scalar", C, Zt, r);
       const { p: T, f: M } = this.wNAF(C);
       return F.normalizeZ([T, M])[0];
     }
@@ -6180,7 +6184,7 @@ function lb(n) {
     // Accepts optional accumulator to merge with multiply (important for sparse scalars)
     multiplyUnsafe(y, C = F.ZERO) {
       const T = y;
-      return dn("scalar", T, mn, r), T === mn ? z : this.is0() || T === Jt ? this : H.wNAFCachedUnsafe(this, T, F.normalizeZ, C);
+      return dn("scalar", T, mn, r), T === mn ? z : this.is0() || T === Zt ? this : H.wNAFCachedUnsafe(this, T, F.normalizeZ, C);
     }
     // Checks if point is of small order.
     // If you add something to small order point, you will have "dirty"
@@ -6201,7 +6205,7 @@ function lb(n) {
     }
     clearCofactor() {
       const { h: y } = e;
-      return y === Jt ? this : this.multiplyUnsafe(y);
+      return y === Zt ? this : this.multiplyUnsafe(y);
     }
     // Converts hash string or Uint8Array to Point.
     // Uses algo from RFC8032 5.1.3.
@@ -6210,13 +6214,13 @@ function lb(n) {
       y = Ct("pointHex", y, B), $n("zip215", C);
       const u = y.slice(), k = y[B - 1];
       u[B - 1] = k & -129;
-      const $ = Hr(u), J = C ? h : t.ORDER;
-      dn("pointHex.y", $, mn, J);
-      const ee = m($ * $), Be = m(ee - Jt), ue = m(T * ee - M);
+      const $ = Hr(u), Z = C ? h : t.ORDER;
+      dn("pointHex.y", $, mn, Z);
+      const ee = m($ * $), Be = m(ee - Zt), ue = m(T * ee - M);
       let { isValid: me, value: nt } = S(Be, ue);
       if (!me)
         throw new Error("Point.fromHex: invalid y coordinate");
-      const Ce = (nt & Jt) === Jt, Ee = (k & 128) !== 0;
+      const Ce = (nt & Zt) === Zt, Ee = (k & 128) !== 0;
       if (!C && nt === mn && Ee)
         throw new Error("Point.fromHex: x=0 and x_0=1");
       return Ee !== Ce && (nt = m(-nt)), F.fromAffine({ x: nt, y: $ });
@@ -6226,16 +6230,16 @@ function lb(n) {
     }
     toRawBytes() {
       const { x: y, y: C } = this.toAffine(), T = Ds(C, t.BYTES);
-      return T[T.length - 1] |= y & Jt ? 128 : 0, T;
+      return T[T.length - 1] |= y & Zt ? 128 : 0, T;
     }
     toHex() {
       return Cr(this.toRawBytes());
     }
   }
-  F.BASE = new F(e.Gx, e.Gy, Jt, m(e.Gx * e.Gy)), F.ZERO = new F(mn, Jt, Jt, mn);
+  F.BASE = new F(e.Gx, e.Gy, Zt, m(e.Gx * e.Gy)), F.ZERO = new F(mn, Zt, Zt, mn);
   const { BASE: W, ZERO: z } = F, H = of(F, a * 8);
   function K(p) {
-    return Je(p, r);
+    return Ze(p, r);
   }
   function G(p) {
     return K(Hr(p));
@@ -6255,9 +6259,9 @@ function lb(n) {
   }
   function le(p, y, C = {}) {
     p = Ct("message", p), s && (p = s(p));
-    const { prefix: T, scalar: M, pointBytes: B } = V(y), u = ne(C.context, T, p), k = W.multiply(u).toRawBytes(), $ = ne(C.context, k, B, p), J = K(u + $ * M);
-    dn("signature.s", J, mn, r);
-    const ee = Sr(k, Ds(J, t.BYTES));
+    const { prefix: T, scalar: M, pointBytes: B } = V(y), u = ne(C.context, T, p), k = W.multiply(u).toRawBytes(), $ = ne(C.context, k, B, p), Z = K(u + $ * M);
+    dn("signature.s", Z, mn, r);
+    const ee = Sr(k, Ds(Z, t.BYTES));
     return Ct("result", ee, t.BYTES * 2);
   }
   const I = ab;
@@ -6265,16 +6269,16 @@ function lb(n) {
     const { context: M, zip215: B } = T, u = t.BYTES;
     p = Ct("signature", p, 2 * u), y = Ct("message", y), C = Ct("publicKey", C, u), B !== void 0 && $n("zip215", B), s && (y = s(y));
     const k = Hr(p.slice(u, 2 * u));
-    let $, J, ee;
+    let $, Z, ee;
     try {
-      $ = F.fromHex(C, B), J = F.fromHex(p.slice(0, u), B), ee = W.multiplyUnsafe(k);
+      $ = F.fromHex(C, B), Z = F.fromHex(p.slice(0, u), B), ee = W.multiplyUnsafe(k);
     } catch {
       return !1;
     }
     if (!B && $.isSmallOrder())
       return !1;
-    const Be = ne(M, J.toRawBytes(), $.toRawBytes(), y);
-    return J.add($.multiplyUnsafe(Be)).subtract(ee).clearCofactor().equals(F.ZERO);
+    const Be = ne(M, Z.toRawBytes(), $.toRawBytes(), y);
+    return Z.add($.multiplyUnsafe(Be)).subtract(ee).clearCofactor().equals(F.ZERO);
   }
   return W._setWindowSize(8), {
     CURVE: e,
@@ -6312,10 +6316,10 @@ function mb(n) {
   return n[0] &= 248, n[31] &= 127, n[31] |= 64, n;
 }
 function bb(n, e) {
-  const t = vc, r = Je(e * e * e, t), s = Je(r * r * e, t), i = hb(n * s).pow_p_5_8;
-  let o = Je(n * r * i, t);
-  const a = Je(e * o * o, t), l = o, h = Je(o * nd, t), m = a === n, E = a === Je(-n, t), S = a === Je(-n * nd, t);
-  return m && (o = l), (E || S) && (o = h), z1(o, t) && (o = Je(-o, t)), { isValid: m || E, value: o };
+  const t = vc, r = Ze(e * e * e, t), s = Ze(r * r * e, t), i = hb(n * s).pow_p_5_8;
+  let o = Ze(n * r * i, t);
+  const a = Ze(e * o * o, t), l = o, h = Ze(o * nd, t), m = a === n, E = a === Ze(-n, t), S = a === Ze(-n * nd, t);
+  return m && (o = l), (E || S) && (o = h), z1(o, t) && (o = Ze(-o, t)), { isValid: m || E, value: o };
 }
 const pb = to(vc, void 0, !0), gb = {
   // Param: a
@@ -6461,7 +6465,7 @@ const Ot = {
 }, df = {
   binary: "uint",
   size: 4
-}, cr = (n) => ({
+}, lr = (n) => ({
   name: "payloadId",
   binary: "uint",
   size: 1,
@@ -6488,22 +6492,22 @@ class xb {
 var sd;
 (function(n) {
   function e(i) {
-    return rr.getPublicKey(i);
+    return sr.getPublicKey(i);
   }
   n.toPubkey = e;
   function t(i, o) {
     if (o.length != 32)
       throw new Error("hash.length != 32");
-    return rr.sign(o, i);
+    return sr.sign(o, i);
   }
   n.sign = t;
   function r(i, o, a) {
     const { r: l, s: h } = i;
-    return rr.verify({ r: l, s: h }, a, o);
+    return sr.verify({ r: l, s: h }, a, o);
   }
   n.validate = r;
   function s(i, o) {
-    const { r: a, s: l, v: h } = i, m = new rr.Signature(a, l);
+    const { r: a, s: l, v: h } = i, m = new sr.Signature(a, l);
     return m.recovery = h, m.recoverPublicKey(o).toRawBytes();
   }
   n.recover = s;
@@ -6579,7 +6583,7 @@ function id(n) {
   ];
   return Vn(e, n);
 }
-function r6(n, e) {
+function s6(n, e) {
   if (n === "Uint8Array")
     return e;
   const t = Fs(n);
@@ -14194,7 +14198,7 @@ function Mb(n, e) {
   const t = no(n, e);
   return t ? Ns.native(t) : void 0;
 }
-function s6(n, e, t) {
+function i6(n, e, t) {
   const r = no(n, e);
   return r ? Ns.byAddress(r, t) : void 0;
 }
@@ -14228,7 +14232,7 @@ function Pb(n, e) {
 function Xn(n) {
   return Ic(n) && jt(n.address) ? n.address : n.address.toNative(n.chain).toString();
 }
-function i6(n) {
+function o6(n) {
   if (jt(n.address))
     throw new Error("Invalid address, cannot convert the string literal `native` to a Universal Address");
   return n.address.toUniversalAddress().toString();
@@ -14290,7 +14294,7 @@ function Nb(n) {
 function bf(n) {
   return typeof n == "object" && "chain" in n && typeof n.chain == "function" && "address" in n && typeof n.address == "function" && "signAndSend" in n && typeof n.signAndSend == "function";
 }
-class o6 {
+class a6 {
   constructor(e, t, r) {
     ie(this, "_chain");
     ie(this, "_address");
@@ -14308,7 +14312,7 @@ function Ui(n) {
   return n.hash !== void 0;
 }
 const ld = (n) => [
-  cr(1),
+  lr(1),
   {
     name: "token",
     binary: "bytes",
@@ -14324,7 +14328,7 @@ const ld = (n) => [
   { name: "mintRecipient", ...ve },
   hc({ name: "payload", lengthSize: 2 }, n)
 ], zb = [
-  cr(1),
+  lr(1),
   { name: "targetRelayerFee", ...Ot },
   { name: "toNativeTokenAmount", ...Ot },
   { name: "targetRecipient", ...ve }
@@ -14399,11 +14403,11 @@ const ud = {
     ]
   }
 ], yf = [
-  cr(1),
+  lr(1),
   ...gf,
   { name: "fee", ...Ot }
 ], ro = (n) => [
-  cr(3),
+  lr(3),
   ...gf,
   { name: "from", ...ve },
   hc({ name: "payload" }, n)
@@ -14411,7 +14415,7 @@ const ud = {
   [
     "AttestMeta",
     [
-      cr(2),
+      lr(2),
       {
         name: "token",
         binary: "bytes",
@@ -14482,8 +14486,8 @@ const wf = {
     [[1, "VAA"], Xb],
     [[2, "CCTP"], Yb]
   ]
-}, Jb = (n) => [
-  cr(1),
+}, Zb = (n) => [
+  lr(1),
   { name: "target", ...hd },
   hc({ name: "payload", lengthSize: 4 }, n),
   { name: "requestedReceiverValue", ...Ot },
@@ -14494,12 +14498,12 @@ const wf = {
   { name: "sourceDeliveryProvider", ...ve },
   { name: "senderAddress", ...ve },
   { name: "messageKeys", binary: "array", lengthSize: 1, layout: Af }
-], Zb = [
-  ["DeliveryInstruction", Jb()],
+], Jb = [
+  ["DeliveryInstruction", Zb()],
   [
     "RedeliveryInstruction",
     [
-      cr(2),
+      lr(2),
       { name: "deliveryVaaKey", binary: "bytes", layout: Af },
       { name: "targetChain", ...tn() },
       { name: "newRequestedReceiverValue", ...Ot },
@@ -14509,9 +14513,9 @@ const wf = {
     ]
   ]
 ];
-It("Relayer", Zb);
+It("Relayer", Jb);
 const Qb = [
-  cr(1),
+  lr(1),
   { name: "targetRelayerFee", ...Ot },
   { name: "toNativeTokenAmount", ...Ot },
   { name: "targetRecipient", ...ve }
@@ -14519,7 +14523,7 @@ const Qb = [
   ["TransferWithRelay", ro(Qb)]
 ];
 It("AutomaticTokenBridge", ep);
-const a6 = (n) => new Error(`Token ${n} is not a wrapped asset`);
+const c6 = (n) => new Error(`Token ${n} is not a wrapped asset`);
 var Ga;
 (function(n) {
   const e = "TokenBridge", t = ["Transfer", "TransferWithPayload"], r = ["AttestMeta"];
@@ -14832,7 +14836,7 @@ function Sf(n, e) {
       return s;
   return null;
 }
-const Df = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : Ze.global, vf = (n) => !Is(n) && n !== Df;
+const Df = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : Qe.global, vf = (n) => !Is(n) && n !== Df;
 function Ya() {
   const { caseless: n } = vf(this) && this || {}, e = {}, t = (r, s) => {
     const i = n && Sf(e, s) || s;
@@ -14884,12 +14888,12 @@ const zp = (n, e, t, { allOwnKeys: r } = {}) => (qs(e, (s, i) => {
   for (; (t = n.exec(e)) !== null; )
     r.push(t);
   return r;
-}, Yp = Un("HTMLFormElement"), Jp = (n) => n.toLowerCase().replace(
+}, Yp = Un("HTMLFormElement"), Zp = (n) => n.toLowerCase().replace(
   /[-_\s]([a-z\d])(\w*)/g,
   function(t, r, s) {
     return r.toUpperCase() + s;
   }
-), gd = (({ hasOwnProperty: n }) => (e, t) => n.call(e, t))(Object.prototype), Zp = Un("RegExp"), kf = (n, e) => {
+), gd = (({ hasOwnProperty: n }) => (e, t) => n.call(e, t))(Object.prototype), Jp = Un("RegExp"), kf = (n, e) => {
   const t = Object.getOwnPropertyDescriptors(n), r = {};
   qs(t, (s, i) => {
     e(s, i, n) !== !1 && (r[i] = s);
@@ -14963,7 +14967,7 @@ const ig = (n) => {
   isDate: Mp,
   isFile: _p,
   isBlob: Rp,
-  isRegExp: Zp,
+  isRegExp: Jp,
   isFunction: un,
   isStream: Pp,
   isURLSearchParams: Op,
@@ -14989,7 +14993,7 @@ const ig = (n) => {
   reduceDescriptors: kf,
   freezeMethods: Qp,
   toObjectSet: eg,
-  toCamelCase: Jp,
+  toCamelCase: Zp,
   noop: tg,
   toFiniteNumber: ng,
   findKey: Sf,
@@ -15053,7 +15057,7 @@ Fe.from = (n, e, t, r, s, i) => {
   }, (a) => a !== "isAxiosError"), Fe.call(o, n.message, e, t, r, s), o.cause = n, o.name = n.name, i && Object.assign(o, i), o;
 };
 const cg = null;
-function Ja(n) {
+function Za(n) {
   return q.isPlainObject(n) || q.isArray(n);
 }
 function Uf(n) {
@@ -15065,7 +15069,7 @@ function wd(n, e, t) {
   }).join(t ? "." : "") : e;
 }
 function lg(n) {
-  return q.isArray(n) && !n.some(Ja);
+  return q.isArray(n) && !n.some(Za);
 }
 const dg = q.toFlatObject(q, {}, null, function(e) {
   return /^is[A-Z]/.test(e);
@@ -15089,7 +15093,7 @@ function ao(n, e, t) {
       return g.toISOString();
     if (!l && q.isBlob(g))
       throw new Fe("Blob is not supported. Use a Buffer instead.");
-    return q.isArrayBuffer(g) || q.isTypedArray(g) ? l && typeof Blob == "function" ? new Blob([g]) : Ze.Buffer.from(g) : g;
+    return q.isArrayBuffer(g) || q.isTypedArray(g) ? l && typeof Blob == "function" ? new Blob([g]) : Qe.Buffer.from(g) : g;
   }
   function m(g, D, x) {
     let U = g;
@@ -15105,12 +15109,12 @@ function ao(n, e, t) {
           );
         }), !1;
     }
-    return Ja(g) ? !0 : (e.append(wd(x, D, i), h(g)), !1);
+    return Za(g) ? !0 : (e.append(wd(x, D, i), h(g)), !1);
   }
   const E = [], S = Object.assign(dg, {
     defaultVisitor: m,
     convertValue: h,
-    isVisitable: Ja
+    isVisitable: Za
   });
   function A(g, D) {
     if (!q.isUndefined(g)) {
@@ -15795,7 +15799,7 @@ function Cd(n) {
   });
 }
 const Sd = (n) => n instanceof fn ? n.toJSON() : n;
-function Jr(n, e) {
+function Zr(n, e) {
   e = e || {};
   const t = {};
   function r(h, m, E) {
@@ -15900,10 +15904,10 @@ function Lg(n, e, t) {
       throw new Fe("Unknown option " + i, Fe.ERR_BAD_OPTION);
   }
 }
-const Za = {
+const Ja = {
   assertOptions: Lg,
   validators: _c
-}, nr = Za.validators;
+}, nr = Ja.validators;
 let Er = class {
   constructor(e) {
     this.defaults = e, this.interceptors = {
@@ -15920,15 +15924,15 @@ let Er = class {
    * @returns {Promise} The Promise to be fulfilled
    */
   request(e, t) {
-    typeof e == "string" ? (t = t || {}, t.url = e) : t = e || {}, t = Jr(this.defaults, t);
+    typeof e == "string" ? (t = t || {}, t.url = e) : t = e || {}, t = Zr(this.defaults, t);
     const { transitional: r, paramsSerializer: s, headers: i } = t;
-    r !== void 0 && Za.assertOptions(r, {
+    r !== void 0 && Ja.assertOptions(r, {
       silentJSONParsing: nr.transitional(nr.boolean),
       forcedJSONParsing: nr.transitional(nr.boolean),
       clarifyTimeoutError: nr.transitional(nr.boolean)
     }, !1), s != null && (q.isFunction(s) ? t.paramsSerializer = {
       serialize: s
-    } : Za.assertOptions(s, {
+    } : Ja.assertOptions(s, {
       encode: nr.function,
       serialize: nr.function
     }, !0)), t.method = (t.method || this.defaults.method || "get").toLowerCase();
@@ -15979,14 +15983,14 @@ let Er = class {
     return m;
   }
   getUri(e) {
-    e = Jr(this.defaults, e);
+    e = Zr(this.defaults, e);
     const t = Lf(e.baseURL, e.url);
     return _f(t, e.params, e.paramsSerializer);
   }
 };
 q.forEach(["delete", "get", "head", "options"], function(e) {
   Er.prototype[e] = function(t, r) {
-    return this.request(Jr(r || {}, {
+    return this.request(Zr(r || {}, {
       method: e,
       url: t,
       data: (r || {}).data
@@ -15996,7 +16000,7 @@ q.forEach(["delete", "get", "head", "options"], function(e) {
 q.forEach(["post", "put", "patch"], function(e) {
   function t(r) {
     return function(i, o, a) {
-      return this.request(Jr(a || {}, {
+      return this.request(Zr(a || {}, {
         method: e,
         headers: r ? {
           "Content-Type": "multipart/form-data"
@@ -16154,7 +16158,7 @@ Object.entries(Qa).forEach(([n, e]) => {
 function zf(n) {
   const e = new Er(n), t = Bf(Er.prototype.request, e);
   return q.extend(t, Er.prototype, e, { allOwnKeys: !0 }), q.extend(t, e, null, { allOwnKeys: !0 }), t.create = function(s) {
-    return zf(Jr(n, s));
+    return zf(Zr(n, s));
   }, t;
 }
 const _e = zf(cs);
@@ -16171,27 +16175,27 @@ _e.all = function(e) {
 };
 _e.spread = Ng;
 _e.isAxiosError = zg;
-_e.mergeConfig = Jr;
+_e.mergeConfig = Zr;
 _e.AxiosHeaders = fn;
 _e.formToJSON = (n) => Wf(q.isHTMLForm(n) ? new FormData(n) : n);
 _e.HttpStatusCode = Qa;
 _e.default = _e;
 const {
-  Axios: d6,
-  AxiosError: u6,
-  CanceledError: f6,
-  isCancel: h6,
-  CancelToken: m6,
-  VERSION: b6,
-  all: p6,
-  Cancel: g6,
-  isAxiosError: y6,
-  spread: w6,
-  toFormData: A6,
-  AxiosHeaders: E6,
-  HttpStatusCode: B6,
-  formToJSON: x6,
-  mergeConfig: C6
+  Axios: u6,
+  AxiosError: f6,
+  CanceledError: h6,
+  isCancel: m6,
+  CancelToken: b6,
+  VERSION: p6,
+  all: g6,
+  Cancel: y6,
+  isAxiosError: w6,
+  spread: A6,
+  toFormData: E6,
+  AxiosHeaders: B6,
+  HttpStatusCode: x6,
+  formToJSON: C6,
+  mergeConfig: S6
 } = _e, Hn = 60 * 1e3, Hf = {
   Mainnet: {
     api: "https://api.wormholescan.io",
@@ -16217,7 +16221,7 @@ function qg(n, e) {
   let t = Hf[n];
   return e ? Rc(t, e) : t;
 }
-function S6(n, e, t) {
+function D6(n, e, t) {
   const r = Hg(n, e);
   return t ? Rc(r, t) : r;
 }
@@ -16227,8 +16231,8 @@ function Rc(n, e) {
     typeof r == "object" && !Array.isArray(r) ? n[t] = Rc(n[t], r) : n[t] = r;
   return n;
 }
-const Kg = typeof Ze.process < "u";
-Kg && Ze.process.env.NETWORK;
+const Kg = typeof Qe.process < "u";
+Kg && Qe.process.env.NETWORK;
 async function ls(n, e, t = Hn, r) {
   const s = Math.floor(t / e);
   let i = 0;
@@ -16301,19 +16305,19 @@ function kd(n) {
 function Ri(n) {
   return n.state === fe.Attested;
 }
-function D6(n) {
+function v6(n) {
   return n.state === fe.Refunded;
 }
 function Kf(n) {
   return n.state === fe.DestinationInitiated;
 }
-function v6(n) {
+function k6(n) {
   return n.state === fe.DestinationQueued;
 }
-function k6(n) {
+function F6(n) {
   return n.state === fe.DestinationFinalized;
 }
-function F6(n) {
+function T6(n) {
   return n.state < 0;
 }
 class Rt {
@@ -16652,12 +16656,12 @@ async function jf(n, e) {
 async function Yg(n, e, t) {
   return await ls(() => jf(n, e), co, t, "Wormholescan:GetVaaBytes");
 }
-async function Jg(n, e, t) {
+async function Zg(n, e, t) {
   const r = await jf(n, e);
   return r ? Ii(t, r) : null;
 }
-async function Zg(n, e, t, r) {
-  return await ls(() => Jg(n, e, t), co, r, "Wormholescan:GetVaaBytes");
+async function Jg(n, e, t, r) {
+  return await ls(() => Zg(n, e, t), co, r, "Wormholescan:GetVaaBytes");
 }
 async function Qg(n, e) {
   var l;
@@ -17159,7 +17163,7 @@ function oy(n) {
     throw new Error("Not every chain is equal");
   return Array.from(new Set(n.map((t) => Xn(t)))).map((t) => bn.tokenId(e, t));
 }
-async function T6(n, e, t) {
+async function I6(n, e, t) {
   const r = Xn(e), s = n.config.tokenMap ? Ns.byAddress(n.config.tokenMap, r) : void 0, i = s ? s.symbol : void 0, o = jt(e.address) ? await n.getNativeWrappedTokenId() : void 0;
   return t = t ?? await n.getDecimals(e.address), {
     id: e,
@@ -17403,7 +17407,7 @@ class bn {
    * @throws Errors if the VAA is not available after the retries
    */
   async getVaa(e, t, r = Hn) {
-    return typeof e == "string" ? await Fd(this.config.api, e, t, r) : await Zg(this.config.api, e, t, r);
+    return typeof e == "string" ? await Fd(this.config.api, e, t, r) : await Jg(this.config.api, e, t, r);
   }
   /**
    * Gets if the token bridge transfer VAA has been enqueued by the Governor.
@@ -17523,18 +17527,18 @@ class Wc {
 class cy extends Wc {
 }
 ie(cy, "IS_AUTOMATIC", !0);
-function I6(n) {
+function U6(n) {
   return !!n.constructor.IS_AUTOMATIC;
 }
 class Td extends Wc {
 }
 ie(Td, "NATIVE_GAS_DROPOFF_SUPPORTED", !1), ie(Td, "IS_AUTOMATIC", !1);
-function U6(n) {
+function M6(n) {
   return n.complete !== void 0;
 }
-class M6 extends Wc {
+class _6 extends Wc {
 }
-function _6(n) {
+function R6(n) {
   return n.finalize !== void 0;
 }
 var ec = { exports: {} };
@@ -17837,8 +17841,8 @@ Pc.exports;
         p = "";
         var $ = this.clone();
         for ($.negative = 0; !$.isZero(); ) {
-          var J = $.modrn(k).toString(c);
-          $ = $.idivn(k), $.isZero() ? p = J + p : p = S[u - J.length] + J + p;
+          var Z = $.modrn(k).toString(c);
+          $ = $.idivn(k), $.isZero() ? p = Z + p : p = S[u - Z.length] + Z + p;
         }
         for (this.isZero() && (p = "0" + p); p.length % b !== 0; )
           p = "0" + p;
@@ -18022,7 +18026,7 @@ Pc.exports;
       var y = I.words[0] | 0, C = c.words[0] | 0, T = y * C, M = T & 67108863, B = T / 67108864 | 0;
       b.words[0] = M;
       for (var u = 1; u < p; u++) {
-        for (var k = B >>> 26, $ = B & 67108863, J = Math.min(u, c.length - 1), ee = Math.max(0, u - I.length + 1); ee <= J; ee++) {
+        for (var k = B >>> 26, $ = B & 67108863, Z = Math.min(u, c.length - 1), ee = Math.max(0, u - I.length + 1); ee <= Z; ee++) {
           var Be = u - ee | 0;
           y = I.words[Be] | 0, C = c.words[ee] | 0, T = y * C + $, k += T / 67108864 | 0, $ = T & 67108863;
         }
@@ -18031,26 +18035,26 @@ Pc.exports;
       return B !== 0 ? b.words[u] = B | 0 : b.length--, b._strip();
     }
     var R = function(c, b, p) {
-      var y = c.words, C = b.words, T = p.words, M = 0, B, u, k, $ = y[0] | 0, J = $ & 8191, ee = $ >>> 13, Be = y[1] | 0, ue = Be & 8191, me = Be >>> 13, nt = y[2] | 0, Ce = nt & 8191, Ee = nt >>> 13, ot = y[3] | 0, De = ot & 8191, Ie = ot >>> 13, Mr = y[4] | 0, He = Mr & 8191, Ye = Mr >>> 13, _r = y[5] | 0, qe = _r & 8191, Oe = _r >>> 13, Ut = y[6] | 0, Ne = Ut & 8191, $e = Ut >>> 13, Yt = y[7] | 0, Ve = Yt & 8191, w = Yt >>> 13, d = y[8] | 0, f = d & 8191, v = d >>> 13, _ = y[9] | 0, P = _ & 8191, N = _ >>> 13, ge = C[0] | 0, pe = ge & 8191, be = ge >>> 13, Ge = C[1] | 0, he = Ge & 8191, at = Ge >>> 13, fl = C[2] | 0, ct = fl & 8191, lt = fl >>> 13, hl = C[3] | 0, dt = hl & 8191, ut = hl >>> 13, ml = C[4] | 0, ft = ml & 8191, ht = ml >>> 13, bl = C[5] | 0, mt = bl & 8191, bt = bl >>> 13, pl = C[6] | 0, pt = pl & 8191, gt = pl >>> 13, gl = C[7] | 0, yt = gl & 8191, wt = gl >>> 13, yl = C[8] | 0, At = yl & 8191, Et = yl >>> 13, wl = C[9] | 0, Bt = wl & 8191, xt = wl >>> 13;
-      p.negative = c.negative ^ b.negative, p.length = 19, B = Math.imul(J, pe), u = Math.imul(J, be), u = u + Math.imul(ee, pe) | 0, k = Math.imul(ee, be);
+      var y = c.words, C = b.words, T = p.words, M = 0, B, u, k, $ = y[0] | 0, Z = $ & 8191, ee = $ >>> 13, Be = y[1] | 0, ue = Be & 8191, me = Be >>> 13, nt = y[2] | 0, Ce = nt & 8191, Ee = nt >>> 13, ot = y[3] | 0, De = ot & 8191, Ie = ot >>> 13, Mr = y[4] | 0, He = Mr & 8191, Ye = Mr >>> 13, _r = y[5] | 0, qe = _r & 8191, Oe = _r >>> 13, Ut = y[6] | 0, Ne = Ut & 8191, $e = Ut >>> 13, Yt = y[7] | 0, Ve = Yt & 8191, w = Yt >>> 13, d = y[8] | 0, f = d & 8191, v = d >>> 13, _ = y[9] | 0, P = _ & 8191, N = _ >>> 13, ge = C[0] | 0, pe = ge & 8191, be = ge >>> 13, Ge = C[1] | 0, he = Ge & 8191, at = Ge >>> 13, fl = C[2] | 0, ct = fl & 8191, lt = fl >>> 13, hl = C[3] | 0, dt = hl & 8191, ut = hl >>> 13, ml = C[4] | 0, ft = ml & 8191, ht = ml >>> 13, bl = C[5] | 0, mt = bl & 8191, bt = bl >>> 13, pl = C[6] | 0, pt = pl & 8191, gt = pl >>> 13, gl = C[7] | 0, yt = gl & 8191, wt = gl >>> 13, yl = C[8] | 0, At = yl & 8191, Et = yl >>> 13, wl = C[9] | 0, Bt = wl & 8191, xt = wl >>> 13;
+      p.negative = c.negative ^ b.negative, p.length = 19, B = Math.imul(Z, pe), u = Math.imul(Z, be), u = u + Math.imul(ee, pe) | 0, k = Math.imul(ee, be);
       var Co = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, B = Math.imul(ue, pe), u = Math.imul(ue, be), u = u + Math.imul(me, pe) | 0, k = Math.imul(me, be), B = B + Math.imul(J, he) | 0, u = u + Math.imul(J, at) | 0, u = u + Math.imul(ee, he) | 0, k = k + Math.imul(ee, at) | 0;
+      M = (k + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, B = Math.imul(ue, pe), u = Math.imul(ue, be), u = u + Math.imul(me, pe) | 0, k = Math.imul(me, be), B = B + Math.imul(Z, he) | 0, u = u + Math.imul(Z, at) | 0, u = u + Math.imul(ee, he) | 0, k = k + Math.imul(ee, at) | 0;
       var So = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863, B = Math.imul(Ce, pe), u = Math.imul(Ce, be), u = u + Math.imul(Ee, pe) | 0, k = Math.imul(Ee, be), B = B + Math.imul(ue, he) | 0, u = u + Math.imul(ue, at) | 0, u = u + Math.imul(me, he) | 0, k = k + Math.imul(me, at) | 0, B = B + Math.imul(J, ct) | 0, u = u + Math.imul(J, lt) | 0, u = u + Math.imul(ee, ct) | 0, k = k + Math.imul(ee, lt) | 0;
+      M = (k + (u >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863, B = Math.imul(Ce, pe), u = Math.imul(Ce, be), u = u + Math.imul(Ee, pe) | 0, k = Math.imul(Ee, be), B = B + Math.imul(ue, he) | 0, u = u + Math.imul(ue, at) | 0, u = u + Math.imul(me, he) | 0, k = k + Math.imul(me, at) | 0, B = B + Math.imul(Z, ct) | 0, u = u + Math.imul(Z, lt) | 0, u = u + Math.imul(ee, ct) | 0, k = k + Math.imul(ee, lt) | 0;
       var Do = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863, B = Math.imul(De, pe), u = Math.imul(De, be), u = u + Math.imul(Ie, pe) | 0, k = Math.imul(Ie, be), B = B + Math.imul(Ce, he) | 0, u = u + Math.imul(Ce, at) | 0, u = u + Math.imul(Ee, he) | 0, k = k + Math.imul(Ee, at) | 0, B = B + Math.imul(ue, ct) | 0, u = u + Math.imul(ue, lt) | 0, u = u + Math.imul(me, ct) | 0, k = k + Math.imul(me, lt) | 0, B = B + Math.imul(J, dt) | 0, u = u + Math.imul(J, ut) | 0, u = u + Math.imul(ee, dt) | 0, k = k + Math.imul(ee, ut) | 0;
+      M = (k + (u >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863, B = Math.imul(De, pe), u = Math.imul(De, be), u = u + Math.imul(Ie, pe) | 0, k = Math.imul(Ie, be), B = B + Math.imul(Ce, he) | 0, u = u + Math.imul(Ce, at) | 0, u = u + Math.imul(Ee, he) | 0, k = k + Math.imul(Ee, at) | 0, B = B + Math.imul(ue, ct) | 0, u = u + Math.imul(ue, lt) | 0, u = u + Math.imul(me, ct) | 0, k = k + Math.imul(me, lt) | 0, B = B + Math.imul(Z, dt) | 0, u = u + Math.imul(Z, ut) | 0, u = u + Math.imul(ee, dt) | 0, k = k + Math.imul(ee, ut) | 0;
       var vo = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (vo >>> 26) | 0, vo &= 67108863, B = Math.imul(He, pe), u = Math.imul(He, be), u = u + Math.imul(Ye, pe) | 0, k = Math.imul(Ye, be), B = B + Math.imul(De, he) | 0, u = u + Math.imul(De, at) | 0, u = u + Math.imul(Ie, he) | 0, k = k + Math.imul(Ie, at) | 0, B = B + Math.imul(Ce, ct) | 0, u = u + Math.imul(Ce, lt) | 0, u = u + Math.imul(Ee, ct) | 0, k = k + Math.imul(Ee, lt) | 0, B = B + Math.imul(ue, dt) | 0, u = u + Math.imul(ue, ut) | 0, u = u + Math.imul(me, dt) | 0, k = k + Math.imul(me, ut) | 0, B = B + Math.imul(J, ft) | 0, u = u + Math.imul(J, ht) | 0, u = u + Math.imul(ee, ft) | 0, k = k + Math.imul(ee, ht) | 0;
+      M = (k + (u >>> 13) | 0) + (vo >>> 26) | 0, vo &= 67108863, B = Math.imul(He, pe), u = Math.imul(He, be), u = u + Math.imul(Ye, pe) | 0, k = Math.imul(Ye, be), B = B + Math.imul(De, he) | 0, u = u + Math.imul(De, at) | 0, u = u + Math.imul(Ie, he) | 0, k = k + Math.imul(Ie, at) | 0, B = B + Math.imul(Ce, ct) | 0, u = u + Math.imul(Ce, lt) | 0, u = u + Math.imul(Ee, ct) | 0, k = k + Math.imul(Ee, lt) | 0, B = B + Math.imul(ue, dt) | 0, u = u + Math.imul(ue, ut) | 0, u = u + Math.imul(me, dt) | 0, k = k + Math.imul(me, ut) | 0, B = B + Math.imul(Z, ft) | 0, u = u + Math.imul(Z, ht) | 0, u = u + Math.imul(ee, ft) | 0, k = k + Math.imul(ee, ht) | 0;
       var ko = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (ko >>> 26) | 0, ko &= 67108863, B = Math.imul(qe, pe), u = Math.imul(qe, be), u = u + Math.imul(Oe, pe) | 0, k = Math.imul(Oe, be), B = B + Math.imul(He, he) | 0, u = u + Math.imul(He, at) | 0, u = u + Math.imul(Ye, he) | 0, k = k + Math.imul(Ye, at) | 0, B = B + Math.imul(De, ct) | 0, u = u + Math.imul(De, lt) | 0, u = u + Math.imul(Ie, ct) | 0, k = k + Math.imul(Ie, lt) | 0, B = B + Math.imul(Ce, dt) | 0, u = u + Math.imul(Ce, ut) | 0, u = u + Math.imul(Ee, dt) | 0, k = k + Math.imul(Ee, ut) | 0, B = B + Math.imul(ue, ft) | 0, u = u + Math.imul(ue, ht) | 0, u = u + Math.imul(me, ft) | 0, k = k + Math.imul(me, ht) | 0, B = B + Math.imul(J, mt) | 0, u = u + Math.imul(J, bt) | 0, u = u + Math.imul(ee, mt) | 0, k = k + Math.imul(ee, bt) | 0;
+      M = (k + (u >>> 13) | 0) + (ko >>> 26) | 0, ko &= 67108863, B = Math.imul(qe, pe), u = Math.imul(qe, be), u = u + Math.imul(Oe, pe) | 0, k = Math.imul(Oe, be), B = B + Math.imul(He, he) | 0, u = u + Math.imul(He, at) | 0, u = u + Math.imul(Ye, he) | 0, k = k + Math.imul(Ye, at) | 0, B = B + Math.imul(De, ct) | 0, u = u + Math.imul(De, lt) | 0, u = u + Math.imul(Ie, ct) | 0, k = k + Math.imul(Ie, lt) | 0, B = B + Math.imul(Ce, dt) | 0, u = u + Math.imul(Ce, ut) | 0, u = u + Math.imul(Ee, dt) | 0, k = k + Math.imul(Ee, ut) | 0, B = B + Math.imul(ue, ft) | 0, u = u + Math.imul(ue, ht) | 0, u = u + Math.imul(me, ft) | 0, k = k + Math.imul(me, ht) | 0, B = B + Math.imul(Z, mt) | 0, u = u + Math.imul(Z, bt) | 0, u = u + Math.imul(ee, mt) | 0, k = k + Math.imul(ee, bt) | 0;
       var Fo = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (Fo >>> 26) | 0, Fo &= 67108863, B = Math.imul(Ne, pe), u = Math.imul(Ne, be), u = u + Math.imul($e, pe) | 0, k = Math.imul($e, be), B = B + Math.imul(qe, he) | 0, u = u + Math.imul(qe, at) | 0, u = u + Math.imul(Oe, he) | 0, k = k + Math.imul(Oe, at) | 0, B = B + Math.imul(He, ct) | 0, u = u + Math.imul(He, lt) | 0, u = u + Math.imul(Ye, ct) | 0, k = k + Math.imul(Ye, lt) | 0, B = B + Math.imul(De, dt) | 0, u = u + Math.imul(De, ut) | 0, u = u + Math.imul(Ie, dt) | 0, k = k + Math.imul(Ie, ut) | 0, B = B + Math.imul(Ce, ft) | 0, u = u + Math.imul(Ce, ht) | 0, u = u + Math.imul(Ee, ft) | 0, k = k + Math.imul(Ee, ht) | 0, B = B + Math.imul(ue, mt) | 0, u = u + Math.imul(ue, bt) | 0, u = u + Math.imul(me, mt) | 0, k = k + Math.imul(me, bt) | 0, B = B + Math.imul(J, pt) | 0, u = u + Math.imul(J, gt) | 0, u = u + Math.imul(ee, pt) | 0, k = k + Math.imul(ee, gt) | 0;
+      M = (k + (u >>> 13) | 0) + (Fo >>> 26) | 0, Fo &= 67108863, B = Math.imul(Ne, pe), u = Math.imul(Ne, be), u = u + Math.imul($e, pe) | 0, k = Math.imul($e, be), B = B + Math.imul(qe, he) | 0, u = u + Math.imul(qe, at) | 0, u = u + Math.imul(Oe, he) | 0, k = k + Math.imul(Oe, at) | 0, B = B + Math.imul(He, ct) | 0, u = u + Math.imul(He, lt) | 0, u = u + Math.imul(Ye, ct) | 0, k = k + Math.imul(Ye, lt) | 0, B = B + Math.imul(De, dt) | 0, u = u + Math.imul(De, ut) | 0, u = u + Math.imul(Ie, dt) | 0, k = k + Math.imul(Ie, ut) | 0, B = B + Math.imul(Ce, ft) | 0, u = u + Math.imul(Ce, ht) | 0, u = u + Math.imul(Ee, ft) | 0, k = k + Math.imul(Ee, ht) | 0, B = B + Math.imul(ue, mt) | 0, u = u + Math.imul(ue, bt) | 0, u = u + Math.imul(me, mt) | 0, k = k + Math.imul(me, bt) | 0, B = B + Math.imul(Z, pt) | 0, u = u + Math.imul(Z, gt) | 0, u = u + Math.imul(ee, pt) | 0, k = k + Math.imul(ee, gt) | 0;
       var To = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863, B = Math.imul(Ve, pe), u = Math.imul(Ve, be), u = u + Math.imul(w, pe) | 0, k = Math.imul(w, be), B = B + Math.imul(Ne, he) | 0, u = u + Math.imul(Ne, at) | 0, u = u + Math.imul($e, he) | 0, k = k + Math.imul($e, at) | 0, B = B + Math.imul(qe, ct) | 0, u = u + Math.imul(qe, lt) | 0, u = u + Math.imul(Oe, ct) | 0, k = k + Math.imul(Oe, lt) | 0, B = B + Math.imul(He, dt) | 0, u = u + Math.imul(He, ut) | 0, u = u + Math.imul(Ye, dt) | 0, k = k + Math.imul(Ye, ut) | 0, B = B + Math.imul(De, ft) | 0, u = u + Math.imul(De, ht) | 0, u = u + Math.imul(Ie, ft) | 0, k = k + Math.imul(Ie, ht) | 0, B = B + Math.imul(Ce, mt) | 0, u = u + Math.imul(Ce, bt) | 0, u = u + Math.imul(Ee, mt) | 0, k = k + Math.imul(Ee, bt) | 0, B = B + Math.imul(ue, pt) | 0, u = u + Math.imul(ue, gt) | 0, u = u + Math.imul(me, pt) | 0, k = k + Math.imul(me, gt) | 0, B = B + Math.imul(J, yt) | 0, u = u + Math.imul(J, wt) | 0, u = u + Math.imul(ee, yt) | 0, k = k + Math.imul(ee, wt) | 0;
+      M = (k + (u >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863, B = Math.imul(Ve, pe), u = Math.imul(Ve, be), u = u + Math.imul(w, pe) | 0, k = Math.imul(w, be), B = B + Math.imul(Ne, he) | 0, u = u + Math.imul(Ne, at) | 0, u = u + Math.imul($e, he) | 0, k = k + Math.imul($e, at) | 0, B = B + Math.imul(qe, ct) | 0, u = u + Math.imul(qe, lt) | 0, u = u + Math.imul(Oe, ct) | 0, k = k + Math.imul(Oe, lt) | 0, B = B + Math.imul(He, dt) | 0, u = u + Math.imul(He, ut) | 0, u = u + Math.imul(Ye, dt) | 0, k = k + Math.imul(Ye, ut) | 0, B = B + Math.imul(De, ft) | 0, u = u + Math.imul(De, ht) | 0, u = u + Math.imul(Ie, ft) | 0, k = k + Math.imul(Ie, ht) | 0, B = B + Math.imul(Ce, mt) | 0, u = u + Math.imul(Ce, bt) | 0, u = u + Math.imul(Ee, mt) | 0, k = k + Math.imul(Ee, bt) | 0, B = B + Math.imul(ue, pt) | 0, u = u + Math.imul(ue, gt) | 0, u = u + Math.imul(me, pt) | 0, k = k + Math.imul(me, gt) | 0, B = B + Math.imul(Z, yt) | 0, u = u + Math.imul(Z, wt) | 0, u = u + Math.imul(ee, yt) | 0, k = k + Math.imul(ee, wt) | 0;
       var Io = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, B = Math.imul(f, pe), u = Math.imul(f, be), u = u + Math.imul(v, pe) | 0, k = Math.imul(v, be), B = B + Math.imul(Ve, he) | 0, u = u + Math.imul(Ve, at) | 0, u = u + Math.imul(w, he) | 0, k = k + Math.imul(w, at) | 0, B = B + Math.imul(Ne, ct) | 0, u = u + Math.imul(Ne, lt) | 0, u = u + Math.imul($e, ct) | 0, k = k + Math.imul($e, lt) | 0, B = B + Math.imul(qe, dt) | 0, u = u + Math.imul(qe, ut) | 0, u = u + Math.imul(Oe, dt) | 0, k = k + Math.imul(Oe, ut) | 0, B = B + Math.imul(He, ft) | 0, u = u + Math.imul(He, ht) | 0, u = u + Math.imul(Ye, ft) | 0, k = k + Math.imul(Ye, ht) | 0, B = B + Math.imul(De, mt) | 0, u = u + Math.imul(De, bt) | 0, u = u + Math.imul(Ie, mt) | 0, k = k + Math.imul(Ie, bt) | 0, B = B + Math.imul(Ce, pt) | 0, u = u + Math.imul(Ce, gt) | 0, u = u + Math.imul(Ee, pt) | 0, k = k + Math.imul(Ee, gt) | 0, B = B + Math.imul(ue, yt) | 0, u = u + Math.imul(ue, wt) | 0, u = u + Math.imul(me, yt) | 0, k = k + Math.imul(me, wt) | 0, B = B + Math.imul(J, At) | 0, u = u + Math.imul(J, Et) | 0, u = u + Math.imul(ee, At) | 0, k = k + Math.imul(ee, Et) | 0;
+      M = (k + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, B = Math.imul(f, pe), u = Math.imul(f, be), u = u + Math.imul(v, pe) | 0, k = Math.imul(v, be), B = B + Math.imul(Ve, he) | 0, u = u + Math.imul(Ve, at) | 0, u = u + Math.imul(w, he) | 0, k = k + Math.imul(w, at) | 0, B = B + Math.imul(Ne, ct) | 0, u = u + Math.imul(Ne, lt) | 0, u = u + Math.imul($e, ct) | 0, k = k + Math.imul($e, lt) | 0, B = B + Math.imul(qe, dt) | 0, u = u + Math.imul(qe, ut) | 0, u = u + Math.imul(Oe, dt) | 0, k = k + Math.imul(Oe, ut) | 0, B = B + Math.imul(He, ft) | 0, u = u + Math.imul(He, ht) | 0, u = u + Math.imul(Ye, ft) | 0, k = k + Math.imul(Ye, ht) | 0, B = B + Math.imul(De, mt) | 0, u = u + Math.imul(De, bt) | 0, u = u + Math.imul(Ie, mt) | 0, k = k + Math.imul(Ie, bt) | 0, B = B + Math.imul(Ce, pt) | 0, u = u + Math.imul(Ce, gt) | 0, u = u + Math.imul(Ee, pt) | 0, k = k + Math.imul(Ee, gt) | 0, B = B + Math.imul(ue, yt) | 0, u = u + Math.imul(ue, wt) | 0, u = u + Math.imul(me, yt) | 0, k = k + Math.imul(me, wt) | 0, B = B + Math.imul(Z, At) | 0, u = u + Math.imul(Z, Et) | 0, u = u + Math.imul(ee, At) | 0, k = k + Math.imul(ee, Et) | 0;
       var Uo = (M + B | 0) + ((u & 8191) << 13) | 0;
-      M = (k + (u >>> 13) | 0) + (Uo >>> 26) | 0, Uo &= 67108863, B = Math.imul(P, pe), u = Math.imul(P, be), u = u + Math.imul(N, pe) | 0, k = Math.imul(N, be), B = B + Math.imul(f, he) | 0, u = u + Math.imul(f, at) | 0, u = u + Math.imul(v, he) | 0, k = k + Math.imul(v, at) | 0, B = B + Math.imul(Ve, ct) | 0, u = u + Math.imul(Ve, lt) | 0, u = u + Math.imul(w, ct) | 0, k = k + Math.imul(w, lt) | 0, B = B + Math.imul(Ne, dt) | 0, u = u + Math.imul(Ne, ut) | 0, u = u + Math.imul($e, dt) | 0, k = k + Math.imul($e, ut) | 0, B = B + Math.imul(qe, ft) | 0, u = u + Math.imul(qe, ht) | 0, u = u + Math.imul(Oe, ft) | 0, k = k + Math.imul(Oe, ht) | 0, B = B + Math.imul(He, mt) | 0, u = u + Math.imul(He, bt) | 0, u = u + Math.imul(Ye, mt) | 0, k = k + Math.imul(Ye, bt) | 0, B = B + Math.imul(De, pt) | 0, u = u + Math.imul(De, gt) | 0, u = u + Math.imul(Ie, pt) | 0, k = k + Math.imul(Ie, gt) | 0, B = B + Math.imul(Ce, yt) | 0, u = u + Math.imul(Ce, wt) | 0, u = u + Math.imul(Ee, yt) | 0, k = k + Math.imul(Ee, wt) | 0, B = B + Math.imul(ue, At) | 0, u = u + Math.imul(ue, Et) | 0, u = u + Math.imul(me, At) | 0, k = k + Math.imul(me, Et) | 0, B = B + Math.imul(J, Bt) | 0, u = u + Math.imul(J, xt) | 0, u = u + Math.imul(ee, Bt) | 0, k = k + Math.imul(ee, xt) | 0;
+      M = (k + (u >>> 13) | 0) + (Uo >>> 26) | 0, Uo &= 67108863, B = Math.imul(P, pe), u = Math.imul(P, be), u = u + Math.imul(N, pe) | 0, k = Math.imul(N, be), B = B + Math.imul(f, he) | 0, u = u + Math.imul(f, at) | 0, u = u + Math.imul(v, he) | 0, k = k + Math.imul(v, at) | 0, B = B + Math.imul(Ve, ct) | 0, u = u + Math.imul(Ve, lt) | 0, u = u + Math.imul(w, ct) | 0, k = k + Math.imul(w, lt) | 0, B = B + Math.imul(Ne, dt) | 0, u = u + Math.imul(Ne, ut) | 0, u = u + Math.imul($e, dt) | 0, k = k + Math.imul($e, ut) | 0, B = B + Math.imul(qe, ft) | 0, u = u + Math.imul(qe, ht) | 0, u = u + Math.imul(Oe, ft) | 0, k = k + Math.imul(Oe, ht) | 0, B = B + Math.imul(He, mt) | 0, u = u + Math.imul(He, bt) | 0, u = u + Math.imul(Ye, mt) | 0, k = k + Math.imul(Ye, bt) | 0, B = B + Math.imul(De, pt) | 0, u = u + Math.imul(De, gt) | 0, u = u + Math.imul(Ie, pt) | 0, k = k + Math.imul(Ie, gt) | 0, B = B + Math.imul(Ce, yt) | 0, u = u + Math.imul(Ce, wt) | 0, u = u + Math.imul(Ee, yt) | 0, k = k + Math.imul(Ee, wt) | 0, B = B + Math.imul(ue, At) | 0, u = u + Math.imul(ue, Et) | 0, u = u + Math.imul(me, At) | 0, k = k + Math.imul(me, Et) | 0, B = B + Math.imul(Z, Bt) | 0, u = u + Math.imul(Z, xt) | 0, u = u + Math.imul(ee, Bt) | 0, k = k + Math.imul(ee, xt) | 0;
       var Mo = (M + B | 0) + ((u & 8191) << 13) | 0;
       M = (k + (u >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, B = Math.imul(P, he), u = Math.imul(P, at), u = u + Math.imul(N, he) | 0, k = Math.imul(N, at), B = B + Math.imul(f, ct) | 0, u = u + Math.imul(f, lt) | 0, u = u + Math.imul(v, ct) | 0, k = k + Math.imul(v, lt) | 0, B = B + Math.imul(Ve, dt) | 0, u = u + Math.imul(Ve, ut) | 0, u = u + Math.imul(w, dt) | 0, k = k + Math.imul(w, ut) | 0, B = B + Math.imul(Ne, ft) | 0, u = u + Math.imul(Ne, ht) | 0, u = u + Math.imul($e, ft) | 0, k = k + Math.imul($e, ht) | 0, B = B + Math.imul(qe, mt) | 0, u = u + Math.imul(qe, bt) | 0, u = u + Math.imul(Oe, mt) | 0, k = k + Math.imul(Oe, bt) | 0, B = B + Math.imul(He, pt) | 0, u = u + Math.imul(He, gt) | 0, u = u + Math.imul(Ye, pt) | 0, k = k + Math.imul(Ye, gt) | 0, B = B + Math.imul(De, yt) | 0, u = u + Math.imul(De, wt) | 0, u = u + Math.imul(Ie, yt) | 0, k = k + Math.imul(Ie, wt) | 0, B = B + Math.imul(Ce, At) | 0, u = u + Math.imul(Ce, Et) | 0, u = u + Math.imul(Ee, At) | 0, k = k + Math.imul(Ee, Et) | 0, B = B + Math.imul(ue, Bt) | 0, u = u + Math.imul(ue, xt) | 0, u = u + Math.imul(me, Bt) | 0, k = k + Math.imul(me, xt) | 0;
       var _o = (M + B | 0) + ((u & 8191) << 13) | 0;
@@ -18079,7 +18083,7 @@ Pc.exports;
         var T = y;
         y = 0;
         for (var M = p & 67108863, B = Math.min(C, c.length - 1), u = Math.max(0, C - I.length + 1); u <= B; u++) {
-          var k = C - u, $ = I.words[k] | 0, J = c.words[u] | 0, ee = $ * J, Be = ee & 67108863;
+          var k = C - u, $ = I.words[k] | 0, Z = c.words[u] | 0, ee = $ * Z, Be = ee & 67108863;
           T = T + (ee / 67108864 | 0) | 0, Be = Be + M | 0, M = Be & 67108863, T = T + (Be >>> 26) | 0, y += T >>> 26, T &= 67108863;
         }
         b.words[C] = M, p = T, T = y;
@@ -18244,11 +18248,11 @@ Pc.exports;
       }
       var $ = y.clone()._ishlnsubmul(C, 1, B);
       $.negative === 0 && (y = $, u && (u.words[B] = 1));
-      for (var J = B - 1; J >= 0; J--) {
-        var ee = (y.words[C.length + J] | 0) * 67108864 + (y.words[C.length + J - 1] | 0);
-        for (ee = Math.min(ee / T | 0, 67108863), y._ishlnsubmul(C, ee, J); y.negative !== 0; )
-          ee--, y.negative = 0, y._ishlnsubmul(C, 1, J), y.isZero() || (y.negative ^= 1);
-        u && (u.words[J] = ee);
+      for (var Z = B - 1; Z >= 0; Z--) {
+        var ee = (y.words[C.length + Z] | 0) * 67108864 + (y.words[C.length + Z - 1] | 0);
+        for (ee = Math.min(ee / T | 0, 67108863), y._ishlnsubmul(C, ee, Z); y.negative !== 0; )
+          ee--, y.negative = 0, y._ishlnsubmul(C, 1, Z), y.isZero() || (y.negative ^= 1);
+        u && (u.words[Z] = ee);
       }
       return u && u._strip(), y._strip(), b !== "div" && p !== 0 && y.iushrn(p), {
         div: u || null,
@@ -18319,7 +18323,7 @@ Pc.exports;
       for (var y = new i(1), C = new i(0), T = new i(0), M = new i(1), B = 0; b.isEven() && p.isEven(); )
         b.iushrn(1), p.iushrn(1), ++B;
       for (var u = p.clone(), k = b.clone(); !b.isZero(); ) {
-        for (var $ = 0, J = 1; !(b.words[0] & J) && $ < 26; ++$, J <<= 1) ;
+        for (var $ = 0, Z = 1; !(b.words[0] & Z) && $ < 26; ++$, Z <<= 1) ;
         if ($ > 0)
           for (b.iushrn($); $-- > 0; )
             (y.isOdd() || C.isOdd()) && (y.iadd(u), C.isub(k)), y.iushrn(1), C.iushrn(1);
@@ -18632,12 +18636,12 @@ Pc.exports;
       var T = new i(1).toRed(this), M = T.redNeg(), B = this.m.subn(1).iushrn(1), u = this.m.bitLength();
       for (u = new i(2 * u * u).toRed(this); this.pow(u, B).cmp(M) !== 0; )
         u.redIAdd(M);
-      for (var k = this.pow(u, y), $ = this.pow(c, y.addn(1).iushrn(1)), J = this.pow(c, y), ee = C; J.cmp(T) !== 0; ) {
-        for (var Be = J, ue = 0; Be.cmp(T) !== 0; ue++)
+      for (var k = this.pow(u, y), $ = this.pow(c, y.addn(1).iushrn(1)), Z = this.pow(c, y), ee = C; Z.cmp(T) !== 0; ) {
+        for (var Be = Z, ue = 0; Be.cmp(T) !== 0; ue++)
           Be = Be.redSqr();
         r(ue < ee);
         var me = this.pow(k, new i(1).iushln(ee - ue - 1));
-        $ = $.redMul(me), k = me.redSqr(), J = J.redMul(k), ee = ue;
+        $ = $.redMul(me), k = me.redSqr(), Z = Z.redMul(k), ee = ue;
       }
       return $;
     }, ne.prototype.invm = function(c) {
@@ -18653,12 +18657,12 @@ Pc.exports;
       var T = y[0], M = 0, B = 0, u = b.bitLength() % 26;
       for (u === 0 && (u = 26), C = b.length - 1; C >= 0; C--) {
         for (var k = b.words[C], $ = u - 1; $ >= 0; $--) {
-          var J = k >> $ & 1;
-          if (T !== y[0] && (T = this.sqr(T)), J === 0 && M === 0) {
+          var Z = k >> $ & 1;
+          if (T !== y[0] && (T = this.sqr(T)), Z === 0 && M === 0) {
             B = 0;
             continue;
           }
-          M <<= 1, M |= J, B++, !(B !== p && (C !== 0 || $ !== 0)) && (T = this.mul(T, y[M]), B = 0, M = 0);
+          M <<= 1, M |= Z, B++, !(B !== p && (C !== 0 || $ !== 0)) && (T = this.mul(T, y[M]), B = 0, M = 0);
         }
         u = 26;
       }
@@ -18713,7 +18717,7 @@ function uy(n, e, t) {
   const s = new Error(`invalid value for type ${e}`);
   throw s.code = "INVALID_ARGUMENT", s.argument = `value.${t}`, s.value = n, s;
 }
-async function R6(n) {
+async function W6(n) {
   const e = Object.keys(n);
   return (await Promise.all(e.map((r) => Promise.resolve(n[r])))).reduce((r, s, i) => (r[e[i]] = s, r), {});
 }
@@ -18758,7 +18762,7 @@ function Or(n) {
 function fy(n, e) {
   return n && n.code === e;
 }
-function W6(n) {
+function P6(n) {
   return fy(n, "CALL_EXCEPTION");
 }
 function hy(n, e, t) {
@@ -18798,7 +18802,7 @@ function Yn(n, e, t, r) {
 function yr(n, e, t, r) {
   Yn(n, e, "INVALID_ARGUMENT", { argument: t, value: r });
 }
-function P6(n, e, t) {
+function L6(n, e, t) {
   t == null && (t = ""), t && (t = ": " + t), Yn(n >= e, "missing argument" + t, "MISSING_ARGUMENT", {
     count: n,
     expectedCount: e
@@ -18818,13 +18822,13 @@ const my = ["NFD", "NFC", "NFKD", "NFKC"].reduce((n, e) => {
   }
   return n;
 }, []);
-function L6(n) {
+function O6(n) {
   Yn(my.indexOf(n) >= 0, "platform missing String.prototype.normalize", "UNSUPPORTED_OPERATION", {
     operation: "String.prototype.normalize",
     info: { form: n }
   });
 }
-function O6(n, e, t) {
+function N6(n, e, t) {
   if (t == null && (t = ""), n !== e) {
     let r = t, s = "new";
     t && (r += ".", s += " " + t), Yn(!1, `private constructor; use ${r}from* methods`, "UNSUPPORTED_OPERATION", {
@@ -18847,13 +18851,13 @@ function Vf(n, e, t) {
 function ds(n, e) {
   return Vf(n, e, !1);
 }
-function N6(n, e) {
+function z6(n, e) {
   return Vf(n, e, !0);
 }
 function Gf(n, e) {
   return !(typeof n != "string" || !n.match(/^0x[0-9A-Fa-f]*$/) || typeof e == "number" && n.length !== 2 + 2 * e || e === !0 && n.length % 2 !== 0);
 }
-function z6(n) {
+function H6(n) {
   return Gf(n, !0) || n instanceof Uint8Array;
 }
 const Md = "0123456789abcdef";
@@ -18866,13 +18870,13 @@ function lo(n) {
   }
   return t;
 }
-function H6(n) {
+function q6(n) {
   return "0x" + n.map((e) => lo(e).substring(2)).join("");
 }
-function q6(n) {
+function K6(n) {
   return Gf(n, !0) ? (n.length - 2) / 2 : ds(n).length;
 }
-function K6(n, e, t) {
+function j6(n, e, t) {
   const r = ds(n);
   return t != null && t > r.length && Yn(!1, "cannot slice beyond data bounds", "BUFFER_OVERRUN", {
     buffer: r,
@@ -18890,10 +18894,10 @@ function Xf(n, e, t) {
   const s = new Uint8Array(e);
   return s.fill(0), t ? s.set(r, e - r.length) : s.set(r, 0), lo(s);
 }
-function j6(n, e) {
+function $6(n, e) {
   return Xf(n, e, !0);
 }
-function $6(n, e) {
+function V6(n, e) {
   return Xf(n, e, !1);
 }
 function Wi(n) {
@@ -18906,7 +18910,7 @@ function Yf(n, ...e) {
   if (e.length > 0 && !e.includes(n.length))
     throw new Error(`Expected Uint8Array of length ${e}, not of length=${n.length}`);
 }
-function V6(n) {
+function G6(n) {
   if (typeof n != "function" || typeof n.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Wi(n.outputLen), Wi(n.blockLen);
@@ -18925,12 +18929,12 @@ function by(n, e) {
 }
 const ca = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Jf = (n) => n instanceof Uint8Array, py = (n) => new Uint32Array(n.buffer, n.byteOffset, Math.floor(n.byteLength / 4)), G6 = (n) => new DataView(n.buffer, n.byteOffset, n.byteLength), X6 = (n, e) => n << 32 - e | n >>> e, gy = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Zf = (n) => n instanceof Uint8Array, py = (n) => new Uint32Array(n.buffer, n.byteOffset, Math.floor(n.byteLength / 4)), X6 = (n) => new DataView(n.buffer, n.byteOffset, n.byteLength), Y6 = (n, e) => n << 32 - e | n >>> e, gy = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!gy)
   throw new Error("Non little-endian hardware is not supported");
 const yy = async () => {
 };
-async function Y6(n, e, t) {
+async function Z6(n, e, t) {
   let r = Date.now();
   for (let s = 0; s < n; s++) {
     t(s);
@@ -18943,8 +18947,8 @@ function wy(n) {
     throw new Error(`utf8ToBytes expected string, got ${typeof n}`);
   return new Uint8Array(new TextEncoder().encode(n));
 }
-function Zf(n) {
-  if (typeof n == "string" && (n = wy(n)), !Jf(n))
+function Jf(n) {
+  if (typeof n == "string" && (n = wy(n)), !Zf(n))
     throw new Error(`expected Uint8Array, got ${typeof n}`);
   return n;
 }
@@ -18952,7 +18956,7 @@ function J6(...n) {
   const e = new Uint8Array(n.reduce((r, s) => r + s.length, 0));
   let t = 0;
   return n.forEach((r) => {
-    if (!Jf(r))
+    if (!Zf(r))
       throw new Error("Uint8Array expected");
     e.set(r, t), t += r.length;
   }), e;
@@ -18964,16 +18968,16 @@ class Ay {
   }
 }
 const Ey = {}.toString;
-function Z6(n, e) {
+function Q6(n, e) {
   if (e !== void 0 && Ey.call(e) !== "[object Object]")
     throw new Error("Options should be object or undefined");
   return Object.assign(n, e);
 }
 function By(n) {
-  const e = (r) => n().update(Zf(r)).digest(), t = n();
+  const e = (r) => n().update(Jf(r)).digest(), t = n();
   return e.outputLen = t.outputLen, e.blockLen = t.blockLen, e.create = () => n(), e;
 }
-function Q6(n = 32) {
+function ew(n = 32) {
   if (ca && typeof ca.getRandomValues == "function")
     return ca.getRandomValues(new Uint8Array(n));
   throw new Error("crypto.getRandomValues must be defined");
@@ -18995,7 +18999,7 @@ function Uy(n, e, t, r) {
   const s = (e >>> 0) + (r >>> 0);
   return { h: n + t + (s / 2 ** 32 | 0) | 0, l: s | 0 };
 }
-const My = (n, e, t) => (n >>> 0) + (e >>> 0) + (t >>> 0), _y = (n, e, t, r) => e + t + r + (n / 2 ** 32 | 0) | 0, Ry = (n, e, t, r) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0), Wy = (n, e, t, r, s) => e + t + r + s + (n / 2 ** 32 | 0) | 0, Py = (n, e, t, r, s) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0) + (s >>> 0), Ly = (n, e, t, r, s, i) => e + t + r + s + i + (n / 2 ** 32 | 0) | 0, ew = {
+const My = (n, e, t) => (n >>> 0) + (e >>> 0) + (t >>> 0), _y = (n, e, t, r) => e + t + r + (n / 2 ** 32 | 0) | 0, Ry = (n, e, t, r) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0), Wy = (n, e, t, r, s) => e + t + r + s + (n / 2 ** 32 | 0) | 0, Py = (n, e, t, r, s) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0) + (s >>> 0), Ly = (n, e, t, r, s, i) => e + t + r + s + i + (n / 2 ** 32 | 0) | 0, tw = {
   fromBig: Qf,
   split: e0,
   toBig: xy,
@@ -19065,7 +19069,7 @@ class Lc extends Ay {
   update(e) {
     _d(this);
     const { blockLen: t, state: r } = this;
-    e = Zf(e);
+    e = Jf(e);
     const s = e.length;
     for (let i = 0; i < s; ) {
       const o = Math.min(t - this.pos, s - i);
@@ -19153,7 +19157,7 @@ for (let n = 0; n < 10; n++)
 for (let n = 0; n < 26; n++)
   Oc[String.fromCharCode(65 + n)] = String(10 + n);
 const Ld = 15;
-function Jy(n) {
+function Zy(n) {
   n = n.toUpperCase(), n = n.substring(4) + n.substring(0, 2) + "00";
   let e = n.split("").map((r) => Oc[r]).join("");
   for (; e.length >= Ld; ) {
@@ -19165,7 +19169,7 @@ function Jy(n) {
     t = "0" + t;
   return t;
 }
-const Zy = function() {
+const Jy = function() {
   const n = {};
   for (let e = 0; e < 36; e++) {
     const t = "0123456789abcdefghijklmnopqrstuvwxyz"[e];
@@ -19177,7 +19181,7 @@ function Qy(n) {
   n = n.toLowerCase();
   let e = Xy;
   for (let t = 0; t < n.length; t++)
-    e = e * Yy + Zy[n[t]];
+    e = e * Yy + Jy[n[t]];
   return e;
 }
 function Kr(n) {
@@ -19187,7 +19191,7 @@ function Kr(n) {
     return yr(!n.match(/([A-F].*[a-f])|([a-f].*[A-F])/) || e === n, "bad address checksum", "address", n), e;
   }
   if (n.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {
-    yr(n.substring(2, 4) === Jy(n), "bad icap checksum", "address", n);
+    yr(n.substring(2, 4) === Zy(n), "bad icap checksum", "address", n);
     let e = Qy(n.substring(4)).toString(16);
     for (; e.length < 40; )
       e = "0" + e;
@@ -19209,7 +19213,7 @@ async function la(n, e) {
   const t = await e;
   return (t == null || t === "0x0000000000000000000000000000000000000000") && (Yn(typeof n != "string", "unconfigured name", "UNCONFIGURED_NAME", { value: n }), yr(!1, "invalid AddressLike value; did not resolve to a value address", "target", n)), Kr(t);
 }
-function tw(n, e) {
+function nw(n, e) {
   if (typeof n == "string")
     return n.match(/^0x[0-9a-f]{40}$/i) ? Kr(n) : (Yn(e != null, "ENS resolution requires a provider", "UNSUPPORTED_OPERATION", { operation: "resolveName" }), la(n, e.resolveName(n)));
   if (e2(n))
@@ -19218,13 +19222,13 @@ function tw(n, e) {
     return la(n, n);
   yr(!1, "unsupported addressable value", "target", n);
 }
-const nw = 0, rw = 0n, u0 = "Evm", sw = (n, e) => ({
+const rw = 0, sw = 0n, u0 = "Evm", iw = (n, e) => ({
   ...n,
   from: e
-}), iw = (n, e) => ({
+}), ow = (n, e) => ({
   ...n,
   chainId: e
-}), ow = "0x0000000000000000000000000000000000000000", on = class on {
+}), aw = "0x0000000000000000000000000000000000000000", on = class on {
   constructor(e) {
     ie(this, "type", "Native");
     // stored as checksum address
@@ -19455,7 +19459,7 @@ Nc.prototype = {
       this.tokens.push(n);
   }
 };
-var Zr = -1;
+var Jr = -1;
 function da(n, e) {
   if (n)
     throw TypeError("Decoder error");
@@ -19482,7 +19486,7 @@ Oi.prototype = {
       e.byteOffset,
       e.byteLength
     ) : r = new Uint8Array(0), t = uo(t), this._streaming || (this._decoder = new c2({ fatal: this._fatal }), this._BOMseen = !1), this._streaming = !!t.stream;
-    for (var s = new Nc(r), i = [], o; !s.endOfStream() && (o = this._decoder.handler(s, s.read()), o !== Zr); )
+    for (var s = new Nc(r), i = [], o; !s.endOfStream() && (o = this._decoder.handler(s, s.read()), o !== Jr); )
       o !== null && (Array.isArray(o) ? i.push.apply(
         i,
         /**@type {!Array.<number>}*/
@@ -19490,7 +19494,7 @@ Oi.prototype = {
       ) : i.push(o));
     if (!this._streaming) {
       do {
-        if (o = this._decoder.handler(s, s.read()), o === Zr)
+        if (o = this._decoder.handler(s, s.read()), o === Jr)
           break;
         o !== null && (Array.isArray(o) ? i.push.apply(
           i,
@@ -19518,14 +19522,14 @@ Ni.prototype = {
    */
   encode: function(e, t) {
     e = e ? String(e) : "", t = uo(t), this._streaming || (this._encoder = new l2(this._options)), this._streaming = !!t.stream;
-    for (var r = [], s = new Nc(o2(e)), i; !s.endOfStream() && (i = this._encoder.handler(s, s.read()), i !== Zr); )
+    for (var r = [], s = new Nc(o2(e)), i; !s.endOfStream() && (i = this._encoder.handler(s, s.read()), i !== Jr); )
       Array.isArray(i) ? r.push.apply(
         r,
         /**@type {!Array.<number>}*/
         i
       ) : r.push(i);
     if (!this._streaming) {
-      for (; i = this._encoder.handler(s, s.read()), i !== Zr; )
+      for (; i = this._encoder.handler(s, s.read()), i !== Jr; )
         Array.isArray(i) ? r.push.apply(
           r,
           /**@type {!Array.<number>}*/
@@ -19542,7 +19546,7 @@ function c2(n) {
     if (l === Pi && s !== 0)
       return s = 0, da(e);
     if (l === Pi)
-      return Zr;
+      return Jr;
     if (s === 0) {
       if (qn(l, 0, 127))
         return l;
@@ -19567,7 +19571,7 @@ function c2(n) {
 function l2(n) {
   n.fatal, this.handler = function(e, t) {
     if (t === Pi)
-      return Zr;
+      return Jr;
     if (qn(t, 0, 127))
       return t;
     var r, s;
@@ -19609,13 +19613,13 @@ var f2 = gn && gn.__createBinding || (Object.create ? function(n, e, t, r) {
 };
 Object.defineProperty(Wt, "__esModule", { value: !0 });
 var m0 = Wt.deserializeUnchecked = A0 = Wt.deserialize = w0 = Wt.serialize = Wt.BinaryReader = Wt.BinaryWriter = Wt.BorshError = Wt.baseDecode = Wt.baseEncode = void 0;
-const sr = h0($f), b0 = h0(f0), b2 = m2(u2), p2 = typeof TextDecoder != "function" ? b2.TextDecoder : TextDecoder, g2 = new p2("utf-8", { fatal: !0 });
+const ir = h0($f), b0 = h0(f0), b2 = m2(u2), p2 = typeof TextDecoder != "function" ? b2.TextDecoder : TextDecoder, g2 = new p2("utf-8", { fatal: !0 });
 function y2(n) {
-  return typeof n == "string" && (n = Ze.Buffer.from(n, "utf8")), b0.default.encode(Ze.Buffer.from(n));
+  return typeof n == "string" && (n = Qe.Buffer.from(n, "utf8")), b0.default.encode(Qe.Buffer.from(n));
 }
 Wt.baseEncode = y2;
 function w2(n) {
-  return Ze.Buffer.from(b0.default.decode(n));
+  return Qe.Buffer.from(b0.default.decode(n));
 }
 Wt.baseDecode = w2;
 const ua = 1024;
@@ -19630,10 +19634,10 @@ class Vt extends Error {
 Wt.BorshError = Vt;
 class p0 {
   constructor() {
-    this.buf = Ze.Buffer.alloc(ua), this.length = 0;
+    this.buf = Qe.Buffer.alloc(ua), this.length = 0;
   }
   maybeResize() {
-    this.buf.length < 16 + this.length && (this.buf = Ze.Buffer.concat([this.buf, Ze.Buffer.alloc(ua)]));
+    this.buf.length < 16 + this.length && (this.buf = Qe.Buffer.concat([this.buf, Qe.Buffer.alloc(ua)]));
   }
   writeU8(e) {
     this.maybeResize(), this.buf.writeUInt8(e, this.length), this.length += 1;
@@ -19645,31 +19649,31 @@ class p0 {
     this.maybeResize(), this.buf.writeUInt32LE(e, this.length), this.length += 4;
   }
   writeU64(e) {
-    this.maybeResize(), this.writeBuffer(Ze.Buffer.from(new sr.default(e).toArray("le", 8)));
+    this.maybeResize(), this.writeBuffer(Qe.Buffer.from(new ir.default(e).toArray("le", 8)));
   }
   writeU128(e) {
-    this.maybeResize(), this.writeBuffer(Ze.Buffer.from(new sr.default(e).toArray("le", 16)));
+    this.maybeResize(), this.writeBuffer(Qe.Buffer.from(new ir.default(e).toArray("le", 16)));
   }
   writeU256(e) {
-    this.maybeResize(), this.writeBuffer(Ze.Buffer.from(new sr.default(e).toArray("le", 32)));
+    this.maybeResize(), this.writeBuffer(Qe.Buffer.from(new ir.default(e).toArray("le", 32)));
   }
   writeU512(e) {
-    this.maybeResize(), this.writeBuffer(Ze.Buffer.from(new sr.default(e).toArray("le", 64)));
+    this.maybeResize(), this.writeBuffer(Qe.Buffer.from(new ir.default(e).toArray("le", 64)));
   }
   writeBuffer(e) {
-    this.buf = Ze.Buffer.concat([
-      Ze.Buffer.from(this.buf.subarray(0, this.length)),
+    this.buf = Qe.Buffer.concat([
+      Qe.Buffer.from(this.buf.subarray(0, this.length)),
       e,
-      Ze.Buffer.alloc(ua)
+      Qe.Buffer.alloc(ua)
     ]), this.length += e.length;
   }
   writeString(e) {
     this.maybeResize();
-    const t = Ze.Buffer.from(e, "utf8");
+    const t = Qe.Buffer.from(e, "utf8");
     this.writeU32(t.length), this.writeBuffer(t);
   }
   writeFixedArray(e) {
-    this.writeBuffer(Ze.Buffer.from(e));
+    this.writeBuffer(Qe.Buffer.from(e));
   }
   writeArray(e, t) {
     this.maybeResize(), this.writeU32(e.length);
@@ -19714,19 +19718,19 @@ class sn {
   }
   readU64() {
     const e = this.readBuffer(8);
-    return new sr.default(e, "le");
+    return new ir.default(e, "le");
   }
   readU128() {
     const e = this.readBuffer(16);
-    return new sr.default(e, "le");
+    return new ir.default(e, "le");
   }
   readU256() {
     const e = this.readBuffer(32);
-    return new sr.default(e, "le");
+    return new ir.default(e, "le");
   }
   readU512() {
     const e = this.readBuffer(64);
-    return new sr.default(e, "le");
+    return new ir.default(e, "le");
   }
   readBuffer(e) {
     if (this.offset + e > this.buf.length)
@@ -19920,7 +19924,7 @@ function B2(n, e, t, r = sn) {
 m0 = Wt.deserializeUnchecked = B2;
 var O = {};
 Object.defineProperty(O, "__esModule", { value: !0 });
-var x2 = O.s16 = O.s8 = O.nu64be = O.u48be = O.u40be = O.u32be = O.u24be = O.u16be = _t = O.nu64 = O.u48 = O.u40 = re = O.u32 = O.u24 = ln = O.u16 = Te = O.u8 = or = O.offset = S2 = O.greedy = O.Constant = O.UTF8 = O.CString = O.Blob = O.Boolean = O.BitField = O.BitStructure = O.VariantLayout = O.Union = O.UnionLayoutDiscriminator = O.UnionDiscriminator = O.Structure = O.Sequence = O.DoubleBE = O.Double = O.FloatBE = O.Float = O.NearInt64BE = O.NearInt64 = O.NearUInt64BE = O.NearUInt64 = O.IntBE = O.Int = O.UIntBE = O.UInt = O.OffsetLayout = O.GreedyCount = O.ExternalLayout = O.bindConstructorLayout = O.nameWithProperty = O.Layout = O.uint8ArrayToBuffer = O.checkUint8Array = void 0;
+var x2 = O.s16 = O.s8 = O.nu64be = O.u48be = O.u40be = O.u32be = O.u24be = O.u16be = _t = O.nu64 = O.u48 = O.u40 = re = O.u32 = O.u24 = ln = O.u16 = Te = O.u8 = ar = O.offset = S2 = O.greedy = O.Constant = O.UTF8 = O.CString = O.Blob = O.Boolean = O.BitField = O.BitStructure = O.VariantLayout = O.Union = O.UnionLayoutDiscriminator = O.UnionDiscriminator = O.Structure = O.Sequence = O.DoubleBE = O.Double = O.FloatBE = O.Float = O.NearInt64BE = O.NearInt64 = O.NearUInt64BE = O.NearUInt64 = O.IntBE = O.Int = O.UIntBE = O.UInt = O.OffsetLayout = O.GreedyCount = O.ExternalLayout = O.bindConstructorLayout = O.nameWithProperty = O.Layout = O.uint8ArrayToBuffer = O.checkUint8Array = void 0;
 O.constant = O.utf8 = O.cstr = Xe = O.blob = O.unionLayoutDiscriminator = O.union = Lt = O.seq = O.bits = se = O.struct = O.f64be = O.f64 = O.f32be = O.f32 = O.ns64be = O.s48be = O.s40be = O.s32be = O.s24be = O.s16be = nn = O.ns64 = O.s48 = O.s40 = O.s32 = O.s24 = void 0;
 const Hc = ce;
 function us(n) {
@@ -20918,7 +20922,7 @@ class P0 extends Le {
   }
 }
 O.Constant = P0;
-var S2 = O.greedy = (n, e) => new E0(n, e), or = O.offset = (n, e, t) => new Kc(n, e, t), Te = O.u8 = (n) => new hn(1, n), ln = O.u16 = (n) => new hn(2, n);
+var S2 = O.greedy = (n, e) => new E0(n, e), ar = O.offset = (n, e, t) => new Kc(n, e, t), Te = O.u8 = (n) => new hn(1, n), ln = O.u16 = (n) => new hn(2, n);
 O.u24 = (n) => new hn(3, n);
 var re = O.u32 = (n) => new hn(4, n);
 O.u40 = (n) => new hn(5, n);
@@ -20960,7 +20964,7 @@ var $s = {};
 Object.defineProperty($s, "__esModule", { value: !0 });
 function D2(n) {
   {
-    const e = Ze.Buffer.from(n);
+    const e = Qe.Buffer.from(n);
     e.reverse();
     const t = e.toString("hex");
     return t.length === 0 ? BigInt(0) : BigInt(`0x${t}`);
@@ -20976,7 +20980,7 @@ function k2(n) {
 $s.toBigIntBE = k2;
 function F2(n, e) {
   {
-    const t = n.toString(16), r = Ze.Buffer.from(t.padStart(e * 2, "0").slice(0, e * 2), "hex");
+    const t = n.toString(16), r = Qe.Buffer.from(t.padStart(e * 2, "0").slice(0, e * 2), "hex");
     return r.reverse(), r;
   }
 }
@@ -20984,7 +20988,7 @@ var L0 = $s.toBufferLE = F2;
 function T2(n, e) {
   {
     const t = n.toString(16);
-    return Ze.Buffer.from(t.padStart(e * 2, "0").slice(0, e * 2), "hex");
+    return Qe.Buffer.from(t.padStart(e * 2, "0").slice(0, e * 2), "hex");
   }
 }
 $s.toBufferBE = T2;
@@ -21078,7 +21082,7 @@ let Rn = class {
    * Create a value with the struct's coercion logic, then validate it.
    */
   create(e, t) {
-    return Z(e, this, t);
+    return J(e, this, t);
   }
   /**
    * Check if a value passes the struct's validation.
@@ -21112,7 +21116,7 @@ function O0(n, e, t) {
   if (r[0])
     throw r[0];
 }
-function Z(n, e, t) {
+function J(n, e, t) {
   const r = Gs(n, e, { coerce: !0, message: t });
   if (r[0])
     throw r[0];
@@ -21163,7 +21167,7 @@ function In() {
 function Yc(n) {
   return Tr("instance", (e) => e instanceof n || `Expected a \`${n.name}\` instance, but received: ${yn(e)}`);
 }
-function Qe(n) {
+function et(n) {
   const e = yn(n), t = typeof n;
   return new Rn({
     type: "literal",
@@ -21215,7 +21219,7 @@ function z0(n, e) {
 function X() {
   return Tr("string", (n) => typeof n == "string" || `Expected a string, but received: ${yn(n)}`);
 }
-function Jc(n) {
+function Zc(n) {
   const e = P2();
   return new Rn({
     type: "tuple",
@@ -21390,7 +21394,7 @@ function $2(n, e) {
   n[e >> 5] |= 128 << e % 32, n[j0(e) - 1] = e;
   for (var t = 1732584193, r = -271733879, s = -1732584194, i = 271733878, o = 0; o < n.length; o += 16) {
     var a = t, l = r, h = s, m = i;
-    t = Nt(t, r, s, i, n[o], 7, -680876936), i = Nt(i, t, r, s, n[o + 1], 12, -389564586), s = Nt(s, i, t, r, n[o + 2], 17, 606105819), r = Nt(r, s, i, t, n[o + 3], 22, -1044525330), t = Nt(t, r, s, i, n[o + 4], 7, -176418897), i = Nt(i, t, r, s, n[o + 5], 12, 1200080426), s = Nt(s, i, t, r, n[o + 6], 17, -1473231341), r = Nt(r, s, i, t, n[o + 7], 22, -45705983), t = Nt(t, r, s, i, n[o + 8], 7, 1770035416), i = Nt(i, t, r, s, n[o + 9], 12, -1958414417), s = Nt(s, i, t, r, n[o + 10], 17, -42063), r = Nt(r, s, i, t, n[o + 11], 22, -1990404162), t = Nt(t, r, s, i, n[o + 12], 7, 1804603682), i = Nt(i, t, r, s, n[o + 13], 12, -40341101), s = Nt(s, i, t, r, n[o + 14], 17, -1502002290), r = Nt(r, s, i, t, n[o + 15], 22, 1236535329), t = zt(t, r, s, i, n[o + 1], 5, -165796510), i = zt(i, t, r, s, n[o + 6], 9, -1069501632), s = zt(s, i, t, r, n[o + 11], 14, 643717713), r = zt(r, s, i, t, n[o], 20, -373897302), t = zt(t, r, s, i, n[o + 5], 5, -701558691), i = zt(i, t, r, s, n[o + 10], 9, 38016083), s = zt(s, i, t, r, n[o + 15], 14, -660478335), r = zt(r, s, i, t, n[o + 4], 20, -405537848), t = zt(t, r, s, i, n[o + 9], 5, 568446438), i = zt(i, t, r, s, n[o + 14], 9, -1019803690), s = zt(s, i, t, r, n[o + 3], 14, -187363961), r = zt(r, s, i, t, n[o + 8], 20, 1163531501), t = zt(t, r, s, i, n[o + 13], 5, -1444681467), i = zt(i, t, r, s, n[o + 2], 9, -51403784), s = zt(s, i, t, r, n[o + 7], 14, 1735328473), r = zt(r, s, i, t, n[o + 12], 20, -1926607734), t = Ht(t, r, s, i, n[o + 5], 4, -378558), i = Ht(i, t, r, s, n[o + 8], 11, -2022574463), s = Ht(s, i, t, r, n[o + 11], 16, 1839030562), r = Ht(r, s, i, t, n[o + 14], 23, -35309556), t = Ht(t, r, s, i, n[o + 1], 4, -1530992060), i = Ht(i, t, r, s, n[o + 4], 11, 1272893353), s = Ht(s, i, t, r, n[o + 7], 16, -155497632), r = Ht(r, s, i, t, n[o + 10], 23, -1094730640), t = Ht(t, r, s, i, n[o + 13], 4, 681279174), i = Ht(i, t, r, s, n[o], 11, -358537222), s = Ht(s, i, t, r, n[o + 3], 16, -722521979), r = Ht(r, s, i, t, n[o + 6], 23, 76029189), t = Ht(t, r, s, i, n[o + 9], 4, -640364487), i = Ht(i, t, r, s, n[o + 12], 11, -421815835), s = Ht(s, i, t, r, n[o + 15], 16, 530742520), r = Ht(r, s, i, t, n[o + 2], 23, -995338651), t = qt(t, r, s, i, n[o], 6, -198630844), i = qt(i, t, r, s, n[o + 7], 10, 1126891415), s = qt(s, i, t, r, n[o + 14], 15, -1416354905), r = qt(r, s, i, t, n[o + 5], 21, -57434055), t = qt(t, r, s, i, n[o + 12], 6, 1700485571), i = qt(i, t, r, s, n[o + 3], 10, -1894986606), s = qt(s, i, t, r, n[o + 10], 15, -1051523), r = qt(r, s, i, t, n[o + 1], 21, -2054922799), t = qt(t, r, s, i, n[o + 8], 6, 1873313359), i = qt(i, t, r, s, n[o + 15], 10, -30611744), s = qt(s, i, t, r, n[o + 6], 15, -1560198380), r = qt(r, s, i, t, n[o + 13], 21, 1309151649), t = qt(t, r, s, i, n[o + 4], 6, -145523070), i = qt(i, t, r, s, n[o + 11], 10, -1120210379), s = qt(s, i, t, r, n[o + 2], 15, 718787259), r = qt(r, s, i, t, n[o + 9], 21, -343485551), t = ir(t, a), r = ir(r, l), s = ir(s, h), i = ir(i, m);
+    t = Nt(t, r, s, i, n[o], 7, -680876936), i = Nt(i, t, r, s, n[o + 1], 12, -389564586), s = Nt(s, i, t, r, n[o + 2], 17, 606105819), r = Nt(r, s, i, t, n[o + 3], 22, -1044525330), t = Nt(t, r, s, i, n[o + 4], 7, -176418897), i = Nt(i, t, r, s, n[o + 5], 12, 1200080426), s = Nt(s, i, t, r, n[o + 6], 17, -1473231341), r = Nt(r, s, i, t, n[o + 7], 22, -45705983), t = Nt(t, r, s, i, n[o + 8], 7, 1770035416), i = Nt(i, t, r, s, n[o + 9], 12, -1958414417), s = Nt(s, i, t, r, n[o + 10], 17, -42063), r = Nt(r, s, i, t, n[o + 11], 22, -1990404162), t = Nt(t, r, s, i, n[o + 12], 7, 1804603682), i = Nt(i, t, r, s, n[o + 13], 12, -40341101), s = Nt(s, i, t, r, n[o + 14], 17, -1502002290), r = Nt(r, s, i, t, n[o + 15], 22, 1236535329), t = zt(t, r, s, i, n[o + 1], 5, -165796510), i = zt(i, t, r, s, n[o + 6], 9, -1069501632), s = zt(s, i, t, r, n[o + 11], 14, 643717713), r = zt(r, s, i, t, n[o], 20, -373897302), t = zt(t, r, s, i, n[o + 5], 5, -701558691), i = zt(i, t, r, s, n[o + 10], 9, 38016083), s = zt(s, i, t, r, n[o + 15], 14, -660478335), r = zt(r, s, i, t, n[o + 4], 20, -405537848), t = zt(t, r, s, i, n[o + 9], 5, 568446438), i = zt(i, t, r, s, n[o + 14], 9, -1019803690), s = zt(s, i, t, r, n[o + 3], 14, -187363961), r = zt(r, s, i, t, n[o + 8], 20, 1163531501), t = zt(t, r, s, i, n[o + 13], 5, -1444681467), i = zt(i, t, r, s, n[o + 2], 9, -51403784), s = zt(s, i, t, r, n[o + 7], 14, 1735328473), r = zt(r, s, i, t, n[o + 12], 20, -1926607734), t = Ht(t, r, s, i, n[o + 5], 4, -378558), i = Ht(i, t, r, s, n[o + 8], 11, -2022574463), s = Ht(s, i, t, r, n[o + 11], 16, 1839030562), r = Ht(r, s, i, t, n[o + 14], 23, -35309556), t = Ht(t, r, s, i, n[o + 1], 4, -1530992060), i = Ht(i, t, r, s, n[o + 4], 11, 1272893353), s = Ht(s, i, t, r, n[o + 7], 16, -155497632), r = Ht(r, s, i, t, n[o + 10], 23, -1094730640), t = Ht(t, r, s, i, n[o + 13], 4, 681279174), i = Ht(i, t, r, s, n[o], 11, -358537222), s = Ht(s, i, t, r, n[o + 3], 16, -722521979), r = Ht(r, s, i, t, n[o + 6], 23, 76029189), t = Ht(t, r, s, i, n[o + 9], 4, -640364487), i = Ht(i, t, r, s, n[o + 12], 11, -421815835), s = Ht(s, i, t, r, n[o + 15], 16, 530742520), r = Ht(r, s, i, t, n[o + 2], 23, -995338651), t = qt(t, r, s, i, n[o], 6, -198630844), i = qt(i, t, r, s, n[o + 7], 10, 1126891415), s = qt(s, i, t, r, n[o + 14], 15, -1416354905), r = qt(r, s, i, t, n[o + 5], 21, -57434055), t = qt(t, r, s, i, n[o + 12], 6, 1700485571), i = qt(i, t, r, s, n[o + 3], 10, -1894986606), s = qt(s, i, t, r, n[o + 10], 15, -1051523), r = qt(r, s, i, t, n[o + 1], 21, -2054922799), t = qt(t, r, s, i, n[o + 8], 6, 1873313359), i = qt(i, t, r, s, n[o + 15], 10, -30611744), s = qt(s, i, t, r, n[o + 6], 15, -1560198380), r = qt(r, s, i, t, n[o + 13], 21, 1309151649), t = qt(t, r, s, i, n[o + 4], 6, -145523070), i = qt(i, t, r, s, n[o + 11], 10, -1120210379), s = qt(s, i, t, r, n[o + 2], 15, 718787259), r = qt(r, s, i, t, n[o + 9], 21, -343485551), t = or(t, a), r = or(r, l), s = or(s, h), i = or(i, m);
   }
   return [t, r, s, i];
 }
@@ -21401,7 +21405,7 @@ function V2(n) {
     t[r >> 5] |= (n[r / 8] & 255) << r % 32;
   return t;
 }
-function ir(n, e) {
+function or(n, e) {
   var t = (n & 65535) + (e & 65535), r = (n >> 16) + (e >> 16) + (t >> 16);
   return r << 16 | t & 65535;
 }
@@ -21409,7 +21413,7 @@ function G2(n, e) {
   return n << e | n >>> 32 - e;
 }
 function po(n, e, t, r, s, i) {
-  return ir(G2(ir(ir(e, n), ir(r, i)), s), t);
+  return or(G2(or(or(e, n), or(r, i)), s), t);
 }
 function Nt(n, e, t, r, s, i, o) {
   return po(e & t | ~e & r, n, e, s, i, o);
@@ -21435,7 +21439,7 @@ function Y2(n, e, t) {
   }
   return bo(r);
 }
-function J2(n, e, t, r) {
+function Z2(n, e, t, r) {
   switch (n) {
     case 0:
       return e & t ^ ~e & r;
@@ -21450,7 +21454,7 @@ function J2(n, e, t, r) {
 function pa(n, e) {
   return n << e | n >>> 32 - e;
 }
-function Z2(n) {
+function J2(n) {
   var e = [1518500249, 1859775393, 2400959708, 3395469782], t = [1732584193, 4023233417, 2562383102, 271733878, 3285377520];
   if (typeof n == "string") {
     var r = unescape(encodeURIComponent(n));
@@ -21471,14 +21475,14 @@ function Z2(n) {
     for (var g = 16; g < 80; ++g)
       S[g] = pa(S[g - 3] ^ S[g - 8] ^ S[g - 14] ^ S[g - 16], 1);
     for (var D = t[0], x = t[1], U = t[2], R = t[3], F = t[4], W = 0; W < 80; ++W) {
-      var z = Math.floor(W / 20), H = pa(D, 5) + J2(z, x, U, R) + F + e[z] + S[W] >>> 0;
+      var z = Math.floor(W / 20), H = pa(D, 5) + Z2(z, x, U, R) + F + e[z] + S[W] >>> 0;
       F = R, R = U, U = pa(x, 30) >>> 0, x = D, D = H;
     }
     t[0] = t[0] + D >>> 0, t[1] = t[1] + x >>> 0, t[2] = t[2] + U >>> 0, t[3] = t[3] + R >>> 0, t[4] = t[4] + F >>> 0;
   }
   return [t[0] >> 24 & 255, t[0] >> 16 & 255, t[0] >> 8 & 255, t[0] & 255, t[1] >> 24 & 255, t[1] >> 16 & 255, t[1] >> 8 & 255, t[1] & 255, t[2] >> 24 & 255, t[2] >> 16 & 255, t[2] >> 8 & 255, t[2] & 255, t[3] >> 24 & 255, t[3] >> 16 & 255, t[3] >> 8 & 255, t[3] & 255, t[4] >> 24 & 255, t[4] >> 16 & 255, t[4] >> 8 & 255, t[4] & 255];
 }
-var Q2 = K0("v5", 80, Z2);
+var Q2 = K0("v5", 80, J2);
 const e8 = "00000000-0000-0000-0000-000000000000";
 function t8(n) {
   if (!mo(n))
@@ -22009,7 +22013,7 @@ function Hd(n) {
     return !1;
   }
 }
-const Zc = (n, e) => os.sign(n, e.slice(0, 32)), p8 = os.verify, Ae = (n) => ce.Buffer.isBuffer(n) ? n : n instanceof Uint8Array ? ce.Buffer.from(n.buffer, n.byteOffset, n.byteLength) : ce.Buffer.from(n);
+const Jc = (n, e) => os.sign(n, e.slice(0, 32)), p8 = os.verify, Ae = (n) => ce.Buffer.isBuffer(n) ? n : n instanceof Uint8Array ? ce.Buffer.from(n.buffer, n.byteOffset, n.byteLength) : ce.Buffer.from(n);
 class Qc {
   constructor(e) {
     Object.assign(this, e);
@@ -22227,7 +22231,7 @@ class w8 {
     return ce.Buffer.concat([this._secretKey, this._publicKey], 64);
   }
 }
-const A8 = new Y("BPFLoader1111111111111111111111111111111111"), ar = 1232, go = 127, Ms = 64;
+const A8 = new Y("BPFLoader1111111111111111111111111111111111"), cr = 1232, go = 127, Ms = 64;
 class el extends Error {
   constructor(e) {
     super(`Signature ${e} has expired: block height exceeded.`), this.signature = void 0, this.signature = e;
@@ -22290,7 +22294,7 @@ class _s {
   }
 }
 const Se = (n = "publicKey") => Xe(32, n), E8 = (n = "signature") => Xe(64, n), wr = (n = "string") => {
-  const e = se([re("length"), re("lengthPadding"), Xe(or(re(), -8), "chars")], n), t = e.decode.bind(e), r = e.encode.bind(e), s = e;
+  const e = se([re("length"), re("lengthPadding"), Xe(ar(re(), -8), "chars")], n), t = e.decode.bind(e), r = e.encode.bind(e), s = e;
   return s.decode = (i, o) => t(i, o).chars.toString(), s.encode = (i, o, a) => {
     const l = {
       chars: ce.Buffer.from(i, "utf8")
@@ -22298,7 +22302,7 @@ const Se = (n = "publicKey") => Xe(32, n), E8 = (n = "signature") => Xe(64, n),
     return r(l, o, a);
   }, s.alloc = (i) => re().span + re().span + ce.Buffer.from(i, "utf8").length, s;
 }, B8 = (n = "authorized") => se([Se("staker"), Se("withdrawer")], n), x8 = (n = "lockup") => se([nn("unixTimestamp"), nn("epoch"), Se("custodian")], n), C8 = (n = "voteInit") => se([Se("nodePubkey"), Se("authorizedVoter"), Se("authorizedWithdrawer"), Te("commission")], n), S8 = (n = "voteAuthorizeWithSeedArgs") => se([re("voteAuthorizationType"), Se("currentAuthorityDerivedKeyOwnerPubkey"), wr("currentAuthorityDerivedKeySeed"), Se("newAuthorized")], n);
-function J0(n, e) {
+function Z0(n, e) {
   const t = (s) => {
     if (s.span >= 0)
       return s.span;
@@ -22309,7 +22313,7 @@ function J0(n, e) {
       if (Array.isArray(i))
         return i.length * t(s.elementLayout);
     } else if ("fields" in s)
-      return J0({
+      return Z0({
         layout: s
       }, e[s.property]);
     return 0;
@@ -22319,7 +22323,7 @@ function J0(n, e) {
     r += t(s);
   }), r;
 }
-function Zt(n) {
+function Jt(n) {
   let e = 0, t = 0;
   for (; ; ) {
     let r = n.shift();
@@ -22406,16 +22410,16 @@ class yo {
     return [r, s];
   }
 }
-const Z0 = "Reached end of buffer unexpectedly";
+const J0 = "Reached end of buffer unexpectedly";
 function Dn(n) {
   if (n.length === 0)
-    throw new Error(Z0);
+    throw new Error(J0);
   return n.shift();
 }
 function Qt(n, ...e) {
   const [t] = e;
   if (e.length === 2 ? t + (e[1] ?? 0) > n.length : t >= n.length)
-    throw new Error(Z0);
+    throw new Error(J0);
   return n.splice(...e);
 }
 class wn {
@@ -22498,7 +22502,7 @@ class wn {
     });
     let s = [];
     rn(s, r.length);
-    let i = ce.Buffer.alloc(ar);
+    let i = ce.Buffer.alloc(cr);
     ce.Buffer.from(s).copy(i);
     let o = s.length;
     r.forEach((E) => {
@@ -22525,16 +22529,16 @@ class wn {
     const r = Dn(t);
     if (r !== (r & go))
       throw new Error("Versioned messages must be deserialized with VersionedMessage.deserialize()");
-    const s = Dn(t), i = Dn(t), o = Zt(t);
+    const s = Dn(t), i = Dn(t), o = Jt(t);
     let a = [];
     for (let S = 0; S < o; S++) {
       const A = Qt(t, 0, Tn);
       a.push(new Y(ce.Buffer.from(A)));
     }
-    const l = Qt(t, 0, Tn), h = Zt(t);
+    const l = Qt(t, 0, Tn), h = Jt(t);
     let m = [];
     for (let S = 0; S < h; S++) {
-      const A = Dn(t), g = Zt(t), D = Qt(t, 0, g), x = Zt(t), U = Qt(t, 0, x), R = Pt.encode(ce.Buffer.from(U));
+      const A = Dn(t), g = Jt(t), D = Qt(t, 0, g), x = Jt(t), U = Qt(t, 0, x), R = Pt.encode(ce.Buffer.from(U));
       m.push({
         programIdIndex: A,
         accounts: D,
@@ -22648,7 +22652,7 @@ class vr {
     rn(r, this.compiledInstructions.length);
     const s = this.serializeAddressTableLookups(), i = Array();
     rn(i, this.addressTableLookups.length);
-    const o = se([Te("prefix"), se([Te("numRequiredSignatures"), Te("numReadonlySignedAccounts"), Te("numReadonlyUnsignedAccounts")], "header"), Xe(e.length, "staticAccountKeysLength"), Lt(Se(), this.staticAccountKeys.length, "staticAccountKeys"), Se("recentBlockhash"), Xe(r.length, "instructionsLength"), Xe(t.length, "serializedInstructions"), Xe(i.length, "addressTableLookupsLength"), Xe(s.length, "serializedAddressTableLookups")]), a = new Uint8Array(ar), h = o.encode({
+    const o = se([Te("prefix"), se([Te("numRequiredSignatures"), Te("numReadonlySignedAccounts"), Te("numReadonlyUnsignedAccounts")], "header"), Xe(e.length, "staticAccountKeysLength"), Lt(Se(), this.staticAccountKeys.length, "staticAccountKeys"), Se("recentBlockhash"), Xe(r.length, "instructionsLength"), Xe(t.length, "serializedInstructions"), Xe(i.length, "addressTableLookupsLength"), Xe(s.length, "serializedAddressTableLookups")]), a = new Uint8Array(cr), h = o.encode({
       prefix: 128,
       header: this.header,
       staticAccountKeysLength: new Uint8Array(e),
@@ -22663,7 +22667,7 @@ class vr {
   }
   serializeInstructions() {
     let e = 0;
-    const t = new Uint8Array(ar);
+    const t = new Uint8Array(cr);
     for (const r of this.compiledInstructions) {
       const s = Array();
       rn(s, r.accountKeyIndexes.length);
@@ -22682,7 +22686,7 @@ class vr {
   }
   serializeAddressTableLookups() {
     let e = 0;
-    const t = new Uint8Array(ar);
+    const t = new Uint8Array(cr);
     for (const r of this.addressTableLookups) {
       const s = Array();
       rn(s, r.writableIndexes.length);
@@ -22709,21 +22713,21 @@ class vr {
       numRequiredSignatures: Dn(t),
       numReadonlySignedAccounts: Dn(t),
       numReadonlyUnsignedAccounts: Dn(t)
-    }, a = [], l = Zt(t);
+    }, a = [], l = Jt(t);
     for (let g = 0; g < l; g++)
       a.push(new Y(Qt(t, 0, Tn)));
-    const h = Pt.encode(Qt(t, 0, Tn)), m = Zt(t), E = [];
+    const h = Pt.encode(Qt(t, 0, Tn)), m = Jt(t), E = [];
     for (let g = 0; g < m; g++) {
-      const D = Dn(t), x = Zt(t), U = Qt(t, 0, x), R = Zt(t), F = new Uint8Array(Qt(t, 0, R));
+      const D = Dn(t), x = Jt(t), U = Qt(t, 0, x), R = Jt(t), F = new Uint8Array(Qt(t, 0, R));
       E.push({
         programIdIndex: D,
         accountKeyIndexes: U,
         data: F
       });
     }
-    const S = Zt(t), A = [];
+    const S = Jt(t), A = [];
     for (let g = 0; g < S; g++) {
-      const D = new Y(Qt(t, 0, Tn)), x = Zt(t), U = Qt(t, 0, x), R = Zt(t), F = Qt(t, 0, R);
+      const D = new Y(Qt(t, 0, Tn)), x = Jt(t), U = Qt(t, 0, x), R = Jt(t), F = Qt(t, 0, R);
       A.push({
         accountKey: D,
         writableIndexes: U,
@@ -23062,7 +23066,7 @@ class Re {
   _partialSign(e, ...t) {
     const r = e.serialize();
     t.forEach((s) => {
-      const i = Zc(r, s.secretKey);
+      const i = Jc(r, s.secretKey);
       this._addSignature(s.publicKey, Ae(i));
     });
   }
@@ -23148,7 +23152,7 @@ Missing signature for public key${i.missing.length === 1 ? "" : "(s)"} [\`${i.mi
       signature: o
     }, a) => {
       o !== null && (Ue(o.length === 64, "signature has invalid length"), ce.Buffer.from(o).copy(i, r.length + a * 64));
-    }), e.copy(i, r.length + t.length * 64), Ue(i.length <= ar, `Transaction too large: ${i.length} > ${ar}`), i;
+    }), e.copy(i, r.length + t.length * 64), Ue(i.length <= cr, `Transaction too large: ${i.length} > ${cr}`), i;
   }
   /**
    * Deprecated method
@@ -23180,7 +23184,7 @@ Missing signature for public key${i.missing.length === 1 ? "" : "(s)"} [\`${i.mi
    */
   static from(e) {
     let t = [...e];
-    const r = Zt(t);
+    const r = Jt(t);
     let s = [];
     for (let i = 0; i < r; i++) {
       const o = Qt(t, 0, Ms);
@@ -23315,7 +23319,7 @@ class sl {
   }
   static deserialize(e) {
     let t = [...e];
-    const r = [], s = Zt(t);
+    const r = [], s = Jt(t);
     for (let o = 0; o < s; o++)
       r.push(new Uint8Array(Qt(t, 0, Ms)));
     const i = nl.deserialize(new Uint8Array(t));
@@ -23325,7 +23329,7 @@ class sl {
     const t = this.message.serialize(), r = this.message.staticAccountKeys.slice(0, this.message.header.numRequiredSignatures);
     for (const s of e) {
       const i = r.findIndex((o) => o.equals(s.publicKey));
-      Ue(i >= 0, `Cannot sign with non signer key ${s.publicKey.toBase58()}`), this.signatures[i] = Zc(t, s.secretKey);
+      Ue(i >= 0, `Cannot sign with non signer key ${s.publicKey.toBase58()}`), this.signatures[i] = Jc(t, s.secretKey);
     }
   }
   addSignature(e, t) {
@@ -23451,7 +23455,7 @@ function hr(n) {
   return new Promise((e) => setTimeout(e, n));
 }
 function ke(n, e) {
-  const t = n.layout.span >= 0 ? n.layout.span : J0(n, e), r = ce.Buffer.alloc(t), s = Object.assign({
+  const t = n.layout.span >= 0 ? n.layout.span : Z0(n, e), r = ce.Buffer.alloc(t), s = Object.assign({
     instruction: n.index
   }, e);
   return n.layout.encode(s, r), r;
@@ -24097,7 +24101,7 @@ class Ft {
   }
 }
 Ft.programId = new Y("11111111111111111111111111111111");
-const O8 = ar - 300;
+const O8 = cr - 300;
 class kr {
   /**
    * @internal
@@ -24158,7 +24162,7 @@ class kr {
         commitment: "confirmed"
       });
     }
-    const o = se([re("instruction"), re("offset"), re("bytesLength"), re("bytesLengthPadding"), Lt(Te("byte"), or(re(), -8), "bytes")]), a = kr.chunkSize;
+    const o = se([re("instruction"), re("offset"), re("bytesLength"), re("bytesLengthPadding"), Lt(Te("byte"), ar(re(), -8), "bytes")]), a = kr.chunkSize;
     let l = 0, h = i, m = [];
     for (; h.length > 0; ) {
       const E = h.slice(0, a), S = ce.Buffer.alloc(a + 16);
@@ -24411,10 +24415,10 @@ const X8 = {
     Te("lastExtendedStartIndex"),
     Te(),
     // option
-    Lt(Se(), or(Te(), -1), "authority")
+    Lt(Se(), ar(Te(), -1), "authority")
   ])
 }, Y8 = /^[^:]+:\/\/([^:[]+|\[[^\]]+\])(:\d+)?(.*)/i;
-function J8(n) {
+function Z8(n) {
   const e = n.match(Y8);
   if (e == null)
     throw TypeError(`Failed to validate endpoint URL \`${n}\``);
@@ -24435,8 +24439,8 @@ function J8(n) {
   );
   return `${o}//${r}${l}${i}`;
 }
-const tt = Xs(Yc(Y), X(), (n) => new Y(n)), rh = Jc([X(), Qe("base64")]), il = Xs(Yc(ce.Buffer), rh, (n) => ce.Buffer.from(n[0], "base64")), sh = 30 * 1e3;
-function Z8(n) {
+const tt = Xs(Yc(Y), X(), (n) => new Y(n)), rh = Zc([X(), et("base64")]), il = Xs(Yc(ce.Buffer), rh, (n) => ce.Buffer.from(n[0], "base64")), sh = 30 * 1e3;
+function J8(n) {
   if (/^https?:/.test(n) === !1)
     throw new TypeError("Endpoint URL must start with `http:` or `https:`.");
   return n;
@@ -24468,11 +24472,11 @@ function Vd(n) {
 }
 function ih(n) {
   return Xt([j({
-    jsonrpc: Qe("2.0"),
+    jsonrpc: et("2.0"),
     id: X(),
     result: n
   }), j({
-    jsonrpc: Qe("2.0"),
+    jsonrpc: et("2.0"),
     id: X(),
     error: j({
       code: hs(),
@@ -24485,7 +24489,7 @@ const Q8 = ih(hs());
 function we(n) {
   return Xs(ih(n), Q8, (e) => "error" in e ? e : {
     ...e,
-    result: Z(e.result, n)
+    result: J(e.result, n)
   });
 }
 function st(n) {
@@ -24552,7 +24556,7 @@ const e3 = j({
   firstNormalSlot: L()
 }), o3 = z0(X(), Q(L())), Ir = te(Xt([j({}), X()])), a3 = j({
   err: Ir
-}), c3 = Qe("receivedSignature"), l3 = j({
+}), c3 = et("receivedSignature"), l3 = j({
   "solana-core": X(),
   "feature-set": de(L())
 }), d3 = j({
@@ -24576,7 +24580,7 @@ const e3 = j({
   unitsConsumed: de(L()),
   returnData: de(te(j({
     programId: X(),
-    data: Jc([X(), Qe("base64")])
+    data: Zc([X(), et("base64")])
   }))),
   innerInstructions: de(te(Q(j({
     index: L(),
@@ -24697,7 +24701,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
 }), k3 = j({
   pubkey: tt,
   account: Ws
-}), F3 = Xs(Xt([Yc(ce.Buffer), cc]), Xt([rh, cc]), (n) => Array.isArray(n) ? Z(n, il) : n), lc = j({
+}), F3 = Xs(Xt([Yc(ce.Buffer), cc]), Xt([rh, cc]), (n) => Array.isArray(n) ? J(n, il) : n), lc = j({
   executable: In(),
   owner: tt,
   lamports: L(),
@@ -24707,7 +24711,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   pubkey: tt,
   account: lc
 }), I3 = j({
-  state: Xt([Qe("active"), Qe("inactive"), Qe("activating"), Qe("deactivating")]),
+  state: Xt([et("active"), et("inactive"), et("activating"), et("deactivating")]),
   active: L(),
   inactive: L()
 }), U3 = we(Q(j({
@@ -24739,16 +24743,16 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   subscription: L(),
   result: P3
 }), O3 = Xt([j({
-  type: Xt([Qe("firstShredReceived"), Qe("completed"), Qe("optimisticConfirmation"), Qe("root")]),
+  type: Xt([et("firstShredReceived"), et("completed"), et("optimisticConfirmation"), et("root")]),
   slot: L(),
   timestamp: L()
 }), j({
-  type: Qe("createdBank"),
+  type: et("createdBank"),
   parent: L(),
   slot: L(),
   timestamp: L()
 }), j({
-  type: Qe("frozen"),
+  type: et("frozen"),
   slot: L(),
   timestamp: L(),
   stats: j({
@@ -24758,7 +24762,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
     maxTransactionsPerEntry: L()
   })
 }), j({
-  type: Qe("dead"),
+  type: et("dead"),
   slot: L(),
   timestamp: L(),
   err: X()
@@ -24782,14 +24786,14 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   nodePubkey: X(),
   activatedStake: L(),
   epochVoteAccount: In(),
-  epochCredits: Q(Jc([L(), L(), L()])),
+  epochCredits: Q(Zc([L(), L(), L()])),
   commission: L(),
   lastVote: L(),
   rootSlot: te(L())
 }), K3 = we(j({
   current: Q(Xd),
   delinquent: Q(Xd)
-})), j3 = Xt([Qe("processed"), Qe("confirmed"), Qe("finalized")]), $3 = j({
+})), j3 = Xt([et("processed"), et("confirmed"), et("finalized")]), $3 = j({
   slot: L(),
   confirmations: te(L()),
   err: Ir,
@@ -24819,7 +24823,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   pubkey: tt,
   signer: In(),
   writable: In(),
-  source: de(Xt([Qe("transaction"), Qe("lookupTable")]))
+  source: de(Xt([et("transaction"), et("lookupTable")]))
 }), ch = j({
   accountKeys: Q(ah),
   signatures: Q(X())
@@ -24839,7 +24843,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   accounts: Q(X()),
   data: X(),
   programId: X()
-})]), uh = Xs(X3, Y3, (n) => "accounts" in n ? Z(n, dh) : Z(n, lh)), fh = j({
+})]), uh = Xs(X3, Y3, (n) => "accounts" in n ? J(n, dh) : J(n, lh)), fh = j({
   signatures: Q(X()),
   message: j({
     accountKeys: Q(ah),
@@ -24888,13 +24892,13 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   postTokenBalances: de(te(Q(Ki))),
   loadedAddresses: de(hh),
   computeUnitsConsumed: de(L())
-}), ms = Xt([Qe(0), Qe("legacy")]), Ur = j({
+}), ms = Xt([et(0), et("legacy")]), Ur = j({
   pubkey: X(),
   lamports: L(),
   postBalance: te(L()),
   rewardType: te(X()),
   commission: de(te(L()))
-}), J3 = we(te(j({
+}), Z3 = we(te(j({
   blockhash: X(),
   previousBlockhash: X(),
   parentSlot: L(),
@@ -24906,7 +24910,7 @@ const p3 = we(e3), g3 = we(r3), y3 = we(n3), w3 = we(s3), A3 = we(i3), E3 = we(o
   rewards: de(Q(Ur)),
   blockTime: te(L()),
   blockHeight: te(L())
-}))), Z3 = we(te(j({
+}))), J3 = we(te(j({
   blockhash: X(),
   previousBlockhash: X(),
   parentSlot: L(),
@@ -25028,7 +25032,7 @@ class m4 {
         } = Ke(m), A = this._buildArgs([], E, void 0, S), g = jd(A);
         return h[g] = h[g] ?? (async () => {
           try {
-            const D = await this._rpcRequest("getBlockHeight", A), x = Z(D, we(L()));
+            const D = await this._rpcRequest("getBlockHeight", A), x = J(D, we(L()));
             if ("error" in x)
               throw new oe(x.error, "failed to get block height information");
             return x.result;
@@ -25039,7 +25043,7 @@ class m4 {
       };
     })();
     let r, s, i, o, a, l;
-    t && typeof t == "string" ? this._commitment = t : t && (this._commitment = t.commitment, this._confirmTransactionInitialTimeout = t.confirmTransactionInitialTimeout, r = t.wsEndpoint, s = t.httpHeaders, i = t.fetch, o = t.fetchMiddleware, a = t.disableRetryOnRateLimit, l = t.httpAgent), this._rpcEndpoint = Z8(e), this._rpcWsEndpoint = r || J8(e), this._rpcClient = h3(e, s, i, o, a, l), this._rpcRequest = m3(this._rpcClient), this._rpcBatchRequest = b3(this._rpcClient), this._rpcWebSocket = new V8(this._rpcWsEndpoint, {
+    t && typeof t == "string" ? this._commitment = t : t && (this._commitment = t.commitment, this._confirmTransactionInitialTimeout = t.confirmTransactionInitialTimeout, r = t.wsEndpoint, s = t.httpHeaders, i = t.fetch, o = t.fetchMiddleware, a = t.disableRetryOnRateLimit, l = t.httpAgent), this._rpcEndpoint = J8(e), this._rpcWsEndpoint = r || Z8(e), this._rpcClient = h3(e, s, i, o, a, l), this._rpcRequest = m3(this._rpcClient), this._rpcBatchRequest = b3(this._rpcClient), this._rpcWebSocket = new V8(this._rpcWsEndpoint, {
       autoconnect: !1,
       max_reconnects: 1 / 0
     }), this._rpcWebSocket.on("open", this._wsOnOpen.bind(this)), this._rpcWebSocket.on("error", this._wsOnError.bind(this)), this._rpcWebSocket.on("close", this._wsOnClose.bind(this)), this._rpcWebSocket.on("accountNotification", this._wsOnAccountNotification.bind(this)), this._rpcWebSocket.on("programNotification", this._wsOnProgramAccountNotification.bind(this)), this._rpcWebSocket.on("slotNotification", this._wsOnSlotNotification.bind(this)), this._rpcWebSocket.on("slotsUpdatesNotification", this._wsOnSlotUpdatesNotification.bind(this)), this._rpcWebSocket.on("signatureNotification", this._wsOnSignatureNotification.bind(this)), this._rpcWebSocket.on("rootNotification", this._wsOnRootNotification.bind(this)), this._rpcWebSocket.on("logsNotification", this._wsOnLogsNotification.bind(this));
@@ -25063,7 +25067,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgs([e.toBase58()], r, void 0, s), o = await this._rpcRequest("getBalance", i), a = Z(o, st(L()));
+    } = Ke(t), i = this._buildArgs([e.toBase58()], r, void 0, s), o = await this._rpcRequest("getBalance", i), a = J(o, st(L()));
     if ("error" in a)
       throw new oe(a.error, `failed to get balance for ${e.toBase58()}`);
     return a.result;
@@ -25080,7 +25084,7 @@ class m4 {
    * Fetch the estimated production time of a block
    */
   async getBlockTime(e) {
-    const t = await this._rpcRequest("getBlockTime", [e]), r = Z(t, we(te(L())));
+    const t = await this._rpcRequest("getBlockTime", [e]), r = J(t, we(te(L())));
     if ("error" in r)
       throw new oe(r.error, `failed to get block time for slot ${e}`);
     return r.result;
@@ -25090,7 +25094,7 @@ class m4 {
    * This value may increase over time if the node is configured to purge older ledger data
    */
   async getMinimumLedgerSlot() {
-    const e = await this._rpcRequest("minimumLedgerSlot", []), t = Z(e, we(L()));
+    const e = await this._rpcRequest("minimumLedgerSlot", []), t = J(e, we(L()));
     if ("error" in t)
       throw new oe(t.error, "failed to get minimum ledger slot");
     return t.result;
@@ -25099,7 +25103,7 @@ class m4 {
    * Fetch the slot of the lowest confirmed block that has not been purged from the ledger
    */
   async getFirstAvailableBlock() {
-    const e = await this._rpcRequest("getFirstAvailableBlock", []), t = Z(e, B3);
+    const e = await this._rpcRequest("getFirstAvailableBlock", []), t = J(e, B3);
     if ("error" in t)
       throw new oe(t.error, "failed to get first available block");
     return t.result;
@@ -25117,7 +25121,7 @@ class m4 {
     } : t = {
       commitment: this.commitment
     };
-    const r = await this._rpcRequest("getSupply", [t]), s = Z(r, x3);
+    const r = await this._rpcRequest("getSupply", [t]), s = J(r, x3);
     if ("error" in s)
       throw new oe(s.error, "failed to get supply");
     return s.result;
@@ -25126,7 +25130,7 @@ class m4 {
    * Fetch the current supply of a token mint
    */
   async getTokenSupply(e, t) {
-    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenSupply", r), i = Z(s, st(ac));
+    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenSupply", r), i = J(s, st(ac));
     if ("error" in i)
       throw new oe(i.error, "failed to get token supply");
     return i.result;
@@ -25135,7 +25139,7 @@ class m4 {
    * Fetch the current balance of a token account
    */
   async getTokenAccountBalance(e, t) {
-    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenAccountBalance", r), i = Z(s, st(ac));
+    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenAccountBalance", r), i = J(s, st(ac));
     if ("error" in i)
       throw new oe(i.error, "failed to get token account balance");
     return i.result;
@@ -25156,7 +25160,7 @@ class m4 {
     }) : o.push({
       programId: t.programId.toBase58()
     });
-    const a = this._buildArgs(o, s, "base64", i), l = await this._rpcRequest("getTokenAccountsByOwner", a), h = Z(l, S3);
+    const a = this._buildArgs(o, s, "base64", i), l = await this._rpcRequest("getTokenAccountsByOwner", a), h = J(l, S3);
     if ("error" in h)
       throw new oe(h.error, `failed to get token accounts owned by account ${e.toBase58()}`);
     return h.result;
@@ -25173,7 +25177,7 @@ class m4 {
     }) : s.push({
       programId: t.programId.toBase58()
     });
-    const i = this._buildArgs(s, r, "jsonParsed"), o = await this._rpcRequest("getTokenAccountsByOwner", i), a = Z(o, D3);
+    const i = this._buildArgs(s, r, "jsonParsed"), o = await this._rpcRequest("getTokenAccountsByOwner", i), a = J(o, D3);
     if ("error" in a)
       throw new oe(a.error, `failed to get token accounts owned by account ${e.toBase58()}`);
     return a.result;
@@ -25185,7 +25189,7 @@ class m4 {
     const t = {
       ...e,
       commitment: e && e.commitment || this.commitment
-    }, r = t.filter || t.commitment ? [t] : [], s = await this._rpcRequest("getLargestAccounts", r), i = Z(s, v3);
+    }, r = t.filter || t.commitment ? [t] : [], s = await this._rpcRequest("getLargestAccounts", r), i = J(s, v3);
     if ("error" in i)
       throw new oe(i.error, "failed to get largest accounts");
     return i.result;
@@ -25195,7 +25199,7 @@ class m4 {
    * for a given mint.
    */
   async getTokenLargestAccounts(e, t) {
-    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenLargestAccounts", r), i = Z(s, C3);
+    const r = this._buildArgs([e.toBase58()], t), s = await this._rpcRequest("getTokenLargestAccounts", r), i = J(s, C3);
     if ("error" in i)
       throw new oe(i.error, "failed to get token largest accounts");
     return i.result;
@@ -25207,7 +25211,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "base64", s), o = await this._rpcRequest("getAccountInfo", i), a = Z(o, st(te(Ws)));
+    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "base64", s), o = await this._rpcRequest("getAccountInfo", i), a = J(o, st(te(Ws)));
     if ("error" in a)
       throw new oe(a.error, `failed to get info about account ${e.toBase58()}`);
     return a.result;
@@ -25219,7 +25223,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "jsonParsed", s), o = await this._rpcRequest("getAccountInfo", i), a = Z(o, st(te(lc)));
+    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "jsonParsed", s), o = await this._rpcRequest("getAccountInfo", i), a = J(o, st(te(lc)));
     if ("error" in a)
       throw new oe(a.error, `failed to get info about account ${e.toBase58()}`);
     return a.result;
@@ -25241,7 +25245,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = e.map((h) => h.toBase58()), o = this._buildArgs([i], r, "jsonParsed", s), a = await this._rpcRequest("getMultipleAccounts", o), l = Z(a, st(Q(te(lc))));
+    } = Ke(t), i = e.map((h) => h.toBase58()), o = this._buildArgs([i], r, "jsonParsed", s), a = await this._rpcRequest("getMultipleAccounts", o), l = J(a, st(Q(te(lc))));
     if ("error" in l)
       throw new oe(l.error, `failed to get info for accounts ${i}`);
     return l.result;
@@ -25253,7 +25257,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = e.map((h) => h.toBase58()), o = this._buildArgs([i], r, "base64", s), a = await this._rpcRequest("getMultipleAccounts", o), l = Z(a, st(Q(te(Ws))));
+    } = Ke(t), i = e.map((h) => h.toBase58()), o = this._buildArgs([i], r, "base64", s), a = await this._rpcRequest("getMultipleAccounts", o), l = J(a, st(Q(te(Ws))));
     if ("error" in l)
       throw new oe(l.error, `failed to get info for accounts ${i}`);
     return l.result;
@@ -25276,7 +25280,7 @@ class m4 {
     } = Ke(t), o = this._buildArgs([e.toBase58()], s, void 0, {
       ...i,
       epoch: r ?? (i == null ? void 0 : i.epoch)
-    }), a = await this._rpcRequest("getStakeActivation", o), l = Z(a, we(I3));
+    }), a = await this._rpcRequest("getStakeActivation", o), l = J(a, we(I3));
     if ("error" in l)
       throw new oe(l.error, `failed to get Stake Activation ${e.toBase58()}`);
     return l.result;
@@ -25300,7 +25304,7 @@ class m4 {
       ...o.filters ? {
         filters: Vd(o.filters)
       } : null
-    }), l = await this._rpcRequest("getProgramAccounts", a), h = Q(k3), m = o.withContext === !0 ? Z(l, st(h)) : Z(l, we(h));
+    }), l = await this._rpcRequest("getProgramAccounts", a), h = Q(k3), m = o.withContext === !0 ? J(l, st(h)) : J(l, we(h));
     if ("error" in m)
       throw new oe(m.error, `failed to get accounts owned by program ${e.toBase58()}`);
     return m.result;
@@ -25314,7 +25318,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "jsonParsed", s), o = await this._rpcRequest("getProgramAccounts", i), a = Z(o, we(Q(T3)));
+    } = Ke(t), i = this._buildArgs([e.toBase58()], r, "jsonParsed", s), o = await this._rpcRequest("getProgramAccounts", i), a = J(o, we(Q(T3)));
     if ("error" in a)
       throw new oe(a.error, `failed to get accounts owned by program ${e.toBase58()}`);
     return a.result;
@@ -25624,7 +25628,7 @@ class m4 {
    * Return the list of nodes that are currently participating in the cluster
    */
   async getClusterNodes() {
-    const e = await this._rpcRequest("getClusterNodes", []), t = Z(e, we(Q(q3)));
+    const e = await this._rpcRequest("getClusterNodes", []), t = J(e, we(Q(q3)));
     if ("error" in t)
       throw new oe(t.error, "failed to get cluster nodes");
     return t.result;
@@ -25633,7 +25637,7 @@ class m4 {
    * Return the list of nodes that are currently participating in the cluster
    */
   async getVoteAccounts(e) {
-    const t = this._buildArgs([], e), r = await this._rpcRequest("getVoteAccounts", t), s = Z(r, K3);
+    const t = this._buildArgs([], e), r = await this._rpcRequest("getVoteAccounts", t), s = J(r, K3);
     if ("error" in s)
       throw new oe(s.error, "failed to get vote accounts");
     return s.result;
@@ -25645,7 +25649,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getSlot", s), o = Z(i, we(L()));
+    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getSlot", s), o = J(i, we(L()));
     if ("error" in o)
       throw new oe(o.error, "failed to get slot");
     return o.result;
@@ -25657,7 +25661,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getSlotLeader", s), o = Z(i, we(X()));
+    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getSlotLeader", s), o = J(i, we(X()));
     if ("error" in o)
       throw new oe(o.error, "failed to get slot leader");
     return o.result;
@@ -25669,7 +25673,7 @@ class m4 {
    * @param limit number of slot leaders to return
    */
   async getSlotLeaders(e, t) {
-    const r = [e, t], s = await this._rpcRequest("getSlotLeaders", r), i = Z(s, we(Q(tt)));
+    const r = [e, t], s = await this._rpcRequest("getSlotLeaders", r), i = J(s, we(Q(tt)));
     if ("error" in i)
       throw new oe(i.error, "failed to get slot leaders");
     return i.result;
@@ -25695,7 +25699,7 @@ class m4 {
   async getSignatureStatuses(e, t) {
     const r = [e];
     t && r.push(t);
-    const s = await this._rpcRequest("getSignatureStatuses", r), i = Z(s, V3);
+    const s = await this._rpcRequest("getSignatureStatuses", r), i = J(s, V3);
     if ("error" in i)
       throw new oe(i.error, "failed to get signature status");
     return i.result;
@@ -25707,7 +25711,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getTransactionCount", s), o = Z(i, we(L()));
+    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getTransactionCount", s), o = J(i, we(L()));
     if ("error" in o)
       throw new oe(o.error, "failed to get transaction count");
     return o.result;
@@ -25727,7 +25731,7 @@ class m4 {
    * Fetch the cluster InflationGovernor parameters
    */
   async getInflationGovernor(e) {
-    const t = this._buildArgs([], e), r = await this._rpcRequest("getInflationGovernor", t), s = Z(r, p3);
+    const t = this._buildArgs([], e), r = await this._rpcRequest("getInflationGovernor", t), s = J(r, p3);
     if ("error" in s)
       throw new oe(s.error, "failed to get inflation");
     return s.result;
@@ -25742,7 +25746,7 @@ class m4 {
     } = Ke(r), o = this._buildArgs([e.map((h) => h.toBase58())], s, void 0, {
       ...i,
       epoch: t ?? (i == null ? void 0 : i.epoch)
-    }), a = await this._rpcRequest("getInflationReward", o), l = Z(a, t3);
+    }), a = await this._rpcRequest("getInflationReward", o), l = J(a, t3);
     if ("error" in l)
       throw new oe(l.error, "failed to get inflation reward");
     return l.result;
@@ -25751,7 +25755,7 @@ class m4 {
    * Fetch the specific inflation values for the current epoch
    */
   async getInflationRate() {
-    const e = await this._rpcRequest("getInflationRate", []), t = Z(e, g3);
+    const e = await this._rpcRequest("getInflationRate", []), t = J(e, g3);
     if ("error" in t)
       throw new oe(t.error, "failed to get inflation rate");
     return t.result;
@@ -25763,7 +25767,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getEpochInfo", s), o = Z(i, w3);
+    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getEpochInfo", s), o = J(i, w3);
     if ("error" in o)
       throw new oe(o.error, "failed to get epoch info");
     return o.result;
@@ -25772,7 +25776,7 @@ class m4 {
    * Fetch the Epoch Schedule parameters
    */
   async getEpochSchedule() {
-    const e = await this._rpcRequest("getEpochSchedule", []), t = Z(e, A3);
+    const e = await this._rpcRequest("getEpochSchedule", []), t = J(e, A3);
     if ("error" in t)
       throw new oe(t.error, "failed to get epoch schedule");
     const r = t.result;
@@ -25783,7 +25787,7 @@ class m4 {
    * @return {Promise<RpcResponseAndContext<LeaderSchedule>>}
    */
   async getLeaderSchedule() {
-    const e = await this._rpcRequest("getLeaderSchedule", []), t = Z(e, E3);
+    const e = await this._rpcRequest("getLeaderSchedule", []), t = J(e, E3);
     if ("error" in t)
       throw new oe(t.error, "failed to get leader schedule");
     return t.result;
@@ -25793,7 +25797,7 @@ class m4 {
    * size from rent
    */
   async getMinimumBalanceForRentExemption(e, t) {
-    const r = this._buildArgs([e], t), s = await this._rpcRequest("getMinimumBalanceForRentExemption", r), i = Z(s, G3);
+    const r = this._buildArgs([e], t), s = await this._rpcRequest("getMinimumBalanceForRentExemption", r), i = J(s, G3);
     return "error" in i ? (console.warn("Unable to fetch minimum balance for rent exemption"), 0) : i.result;
   }
   /**
@@ -25829,7 +25833,7 @@ class m4 {
    * @return {Promise<Array<PerfSample>>}
    */
   async getRecentPerformanceSamples(e) {
-    const t = await this._rpcRequest("getRecentPerformanceSamples", e ? [e] : []), r = Z(t, a4);
+    const t = await this._rpcRequest("getRecentPerformanceSamples", e ? [e] : []), r = J(t, a4);
     if ("error" in r)
       throw new oe(r.error, "failed to get recent performance samples");
     return r.result;
@@ -25840,7 +25844,7 @@ class m4 {
    * @deprecated Deprecated since RPC v1.9.0. Please use {@link getFeeForMessage} instead.
    */
   async getFeeCalculatorForBlockhash(e, t) {
-    const r = this._buildArgs([e], t), s = await this._rpcRequest("getFeeCalculatorForBlockhash", r), i = Z(s, c4);
+    const r = this._buildArgs([e], t), s = await this._rpcRequest("getFeeCalculatorForBlockhash", r), i = J(s, c4);
     if ("error" in i)
       throw new oe(i.error, "failed to get fee calculator");
     const {
@@ -25856,7 +25860,7 @@ class m4 {
    * Fetch the fee for a message from the cluster, return with context
    */
   async getFeeForMessage(e, t) {
-    const r = Ae(e.serialize()).toString("base64"), s = this._buildArgs([r], t), i = await this._rpcRequest("getFeeForMessage", s), o = Z(i, st(te(L())));
+    const r = Ae(e.serialize()).toString("base64"), s = this._buildArgs([r], t), i = await this._rpcRequest("getFeeForMessage", s), o = J(i, st(te(L())));
     if ("error" in o)
       throw new oe(o.error, "failed to get fee for message");
     if (o.result === null)
@@ -25868,7 +25872,7 @@ class m4 {
    */
   async getRecentPrioritizationFees(e) {
     var o;
-    const t = (o = e == null ? void 0 : e.lockedWritableAccounts) == null ? void 0 : o.map((a) => a.toBase58()), r = t != null && t.length ? [t] : [], s = await this._rpcRequest("getRecentPrioritizationFees", r), i = Z(s, y3);
+    const t = (o = e == null ? void 0 : e.lockedWritableAccounts) == null ? void 0 : o.map((a) => a.toBase58()), r = t != null && t.length ? [t] : [], s = await this._rpcRequest("getRecentPrioritizationFees", r), i = J(s, y3);
     if ("error" in i)
       throw new oe(i.error, "failed to get recent prioritization fees");
     return i.result;
@@ -25905,7 +25909,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getLatestBlockhash", s), o = Z(i, s4);
+    } = Ke(e), s = this._buildArgs([], t, void 0, r), i = await this._rpcRequest("getLatestBlockhash", s), o = J(i, s4);
     if ("error" in o)
       throw new oe(o.error, "failed to get latest blockhash");
     return o.result;
@@ -25917,7 +25921,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgs([e], r, void 0, s), o = await this._rpcRequest("isBlockhashValid", i), a = Z(o, i4);
+    } = Ke(t), i = this._buildArgs([e], r, void 0, s), o = await this._rpcRequest("isBlockhashValid", i), a = J(o, i4);
     if ("error" in a)
       throw new oe(a.error, "failed to determine if the blockhash `" + e + "`is valid");
     return a.result;
@@ -25926,7 +25930,7 @@ class m4 {
    * Fetch the node version
    */
   async getVersion() {
-    const e = await this._rpcRequest("getVersion", []), t = Z(e, we(l3));
+    const e = await this._rpcRequest("getVersion", []), t = J(e, we(l3));
     if ("error" in t)
       throw new oe(t.error, "failed to get version");
     return t.result;
@@ -25935,7 +25939,7 @@ class m4 {
    * Fetch the genesis hash
    */
   async getGenesisHash() {
-    const e = await this._rpcRequest("getGenesisHash", []), t = Z(e, we(X()));
+    const e = await this._rpcRequest("getGenesisHash", []), t = J(e, we(X()));
     if ("error" in t)
       throw new oe(t.error, "failed to get genesis hash");
     return t.result;
@@ -25974,19 +25978,19 @@ class m4 {
     try {
       switch (s == null ? void 0 : s.transactionDetails) {
         case "accounts": {
-          const a = Z(o, Q3);
+          const a = J(o, Q3);
           if ("error" in a)
             throw a.error;
           return a.result;
         }
         case "none": {
-          const a = Z(o, Z3);
+          const a = J(o, J3);
           if ("error" in a)
             throw a.error;
           return a.result;
         }
         default: {
-          const a = Z(o, J3);
+          const a = J(o, Z3);
           if ("error" in a)
             throw a.error;
           const {
@@ -26027,19 +26031,19 @@ class m4 {
     try {
       switch (s == null ? void 0 : s.transactionDetails) {
         case "accounts": {
-          const a = Z(o, t4);
+          const a = J(o, t4);
           if ("error" in a)
             throw a.error;
           return a.result;
         }
         case "none": {
-          const a = Z(o, n4);
+          const a = J(o, n4);
           if ("error" in a)
             throw a.error;
           return a.result;
         }
         default: {
-          const a = Z(o, e4);
+          const a = J(o, e4);
           if ("error" in a)
             throw a.error;
           return a.result;
@@ -26063,7 +26067,7 @@ class m4 {
       } = e;
       r = a, t = l;
     }
-    const s = this._buildArgs([], r, "base64", t), i = await this._rpcRequest("getBlockProduction", s), o = Z(i, f3);
+    const s = this._buildArgs([], r, "base64", t), i = await this._rpcRequest("getBlockProduction", s), o = J(i, f3);
     if ("error" in o)
       throw new oe(o.error, "failed to get block production information");
     return o.result;
@@ -26087,7 +26091,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgsAtLeastConfirmed([e], r, void 0, s), o = await this._rpcRequest("getTransaction", i), a = Z(o, Aa);
+    } = Ke(t), i = this._buildArgsAtLeastConfirmed([e], r, void 0, s), o = await this._rpcRequest("getTransaction", i), a = J(o, Aa);
     if ("error" in a)
       throw new oe(a.error, "failed to get transaction");
     const l = a.result;
@@ -26106,7 +26110,7 @@ class m4 {
     const {
       commitment: r,
       config: s
-    } = Ke(t), i = this._buildArgsAtLeastConfirmed([e], r, "jsonParsed", s), o = await this._rpcRequest("getTransaction", i), a = Z(o, ii);
+    } = Ke(t), i = this._buildArgsAtLeastConfirmed([e], r, "jsonParsed", s), o = await this._rpcRequest("getTransaction", i), a = J(o, ii);
     if ("error" in a)
       throw new oe(a.error, "failed to get transaction");
     return a.result;
@@ -26123,7 +26127,7 @@ class m4 {
       args: this._buildArgsAtLeastConfirmed([l], r, "jsonParsed", s)
     }));
     return (await this._rpcBatchRequest(i)).map((l) => {
-      const h = Z(l, ii);
+      const h = J(l, ii);
       if ("error" in h)
         throw new oe(h.error, "failed to get transactions");
       return h.result;
@@ -26158,7 +26162,7 @@ class m4 {
       args: this._buildArgsAtLeastConfirmed([l], r, void 0, s)
     }));
     return (await this._rpcBatchRequest(i)).map((l) => {
-      const h = Z(l, Aa);
+      const h = J(l, Aa);
       if ("error" in h)
         throw new oe(h.error, "failed to get transactions");
       const m = h.result;
@@ -26178,7 +26182,7 @@ class m4 {
    * @deprecated Deprecated since RPC v1.7.0. Please use {@link getBlock} instead.
    */
   async getConfirmedBlock(e, t) {
-    const r = this._buildArgsAtLeastConfirmed([e], t), s = await this._rpcRequest("getBlock", r), i = Z(s, r4);
+    const r = this._buildArgsAtLeastConfirmed([e], t), s = await this._rpcRequest("getBlock", r), i = J(s, r4);
     if ("error" in i)
       throw new oe(i.error, "failed to get confirmed block");
     const o = i.result;
@@ -26215,7 +26219,7 @@ class m4 {
    * Fetch confirmed blocks between two slots
    */
   async getBlocks(e, t, r) {
-    const s = this._buildArgsAtLeastConfirmed(t !== void 0 ? [e, t] : [e], r), i = await this._rpcRequest("getBlocks", s), o = Z(i, we(Q(L())));
+    const s = this._buildArgsAtLeastConfirmed(t !== void 0 ? [e, t] : [e], r), i = await this._rpcRequest("getBlocks", s), o = J(i, we(Q(L())));
     if ("error" in o)
       throw new oe(o.error, "failed to get blocks");
     return o.result;
@@ -26227,7 +26231,7 @@ class m4 {
     const r = this._buildArgsAtLeastConfirmed([e], t, void 0, {
       transactionDetails: "signatures",
       rewards: !1
-    }), s = await this._rpcRequest("getBlock", r), i = Z(s, Yd);
+    }), s = await this._rpcRequest("getBlock", r), i = J(s, Yd);
     if ("error" in i)
       throw new oe(i.error, "failed to get block");
     const o = i.result;
@@ -26244,7 +26248,7 @@ class m4 {
     const r = this._buildArgsAtLeastConfirmed([e], t, void 0, {
       transactionDetails: "signatures",
       rewards: !1
-    }), s = await this._rpcRequest("getBlock", r), i = Z(s, Yd);
+    }), s = await this._rpcRequest("getBlock", r), i = J(s, Yd);
     if ("error" in i)
       throw new oe(i.error, "failed to get confirmed block");
     const o = i.result;
@@ -26258,7 +26262,7 @@ class m4 {
    * @deprecated Deprecated since RPC v1.7.0. Please use {@link getTransaction} instead.
    */
   async getConfirmedTransaction(e, t) {
-    const r = this._buildArgsAtLeastConfirmed([e], t), s = await this._rpcRequest("getTransaction", r), i = Z(s, Aa);
+    const r = this._buildArgsAtLeastConfirmed([e], t), s = await this._rpcRequest("getTransaction", r), i = J(s, Aa);
     if ("error" in i)
       throw new oe(i.error, "failed to get transaction");
     const o = i.result;
@@ -26275,7 +26279,7 @@ class m4 {
    * @deprecated Deprecated since RPC v1.7.0. Please use {@link getParsedTransaction} instead.
    */
   async getParsedConfirmedTransaction(e, t) {
-    const r = this._buildArgsAtLeastConfirmed([e], t, "jsonParsed"), s = await this._rpcRequest("getTransaction", r), i = Z(s, ii);
+    const r = this._buildArgsAtLeastConfirmed([e], t, "jsonParsed"), s = await this._rpcRequest("getTransaction", r), i = J(s, ii);
     if ("error" in i)
       throw new oe(i.error, "failed to get confirmed transaction");
     return i.result;
@@ -26291,7 +26295,7 @@ class m4 {
       args: this._buildArgsAtLeastConfirmed([o], t, "jsonParsed")
     }));
     return (await this._rpcBatchRequest(r)).map((o) => {
-      const a = Z(o, ii);
+      const a = J(o, ii);
       if ("error" in a)
         throw new oe(a.error, "failed to get confirmed transactions");
       return a.result;
@@ -26337,7 +26341,7 @@ class m4 {
    * @deprecated Deprecated since RPC v1.7.0. Please use {@link getSignaturesForAddress} instead.
    */
   async getConfirmedSignaturesForAddress2(e, t, r) {
-    const s = this._buildArgsAtLeastConfirmed([e.toBase58()], r, void 0, t), i = await this._rpcRequest("getConfirmedSignaturesForAddress2", s), o = Z(i, U3);
+    const s = this._buildArgsAtLeastConfirmed([e.toBase58()], r, void 0, t), i = await this._rpcRequest("getConfirmedSignaturesForAddress2", s), o = J(i, U3);
     if ("error" in o)
       throw new oe(o.error, "failed to get confirmed signatures for address");
     return o.result;
@@ -26351,7 +26355,7 @@ class m4 {
    * @param options
    */
   async getSignaturesForAddress(e, t, r) {
-    const s = this._buildArgsAtLeastConfirmed([e.toBase58()], r, void 0, t), i = await this._rpcRequest("getSignaturesForAddress", s), o = Z(i, M3);
+    const s = this._buildArgsAtLeastConfirmed([e.toBase58()], r, void 0, t), i = await this._rpcRequest("getSignaturesForAddress", s), o = J(i, M3);
     if ("error" in o)
       throw new oe(o.error, "failed to get signatures for address");
     return o.result;
@@ -26407,7 +26411,7 @@ class m4 {
    * ```
    */
   async requestAirdrop(e, t) {
-    const r = await this._rpcRequest("requestAirdrop", [e.toBase58(), t]), s = Z(r, l4);
+    const r = await this._rpcRequest("requestAirdrop", [e.toBase58(), t]), s = J(r, l4);
     if ("error" in s)
       throw new oe(s.error, `airdrop to ${e.toBase58()} failed`);
     return s.result;
@@ -26455,7 +26459,7 @@ class m4 {
     const {
       commitment: t,
       config: r
-    } = Ke(e), s = this._buildArgs([], t, "base64", r), i = await this._rpcRequest("getStakeMinimumDelegation", s), o = Z(i, st(L()));
+    } = Ke(e), s = this._buildArgs([], t, "base64", r), i = await this._rpcRequest("getStakeMinimumDelegation", s), o = J(i, st(L()));
     if ("error" in o)
       throw new oe(o.error, "failed to get stake minimum delegation");
     return o.result;
@@ -26481,7 +26485,7 @@ class m4 {
         throw new Error("Invalid arguments");
       const U = t || {};
       U.encoding = "base64", "commitment" in U || (U.commitment = this.commitment), t && typeof t == "object" && "innerInstructions" in t && (U.innerInstructions = t.innerInstructions);
-      const R = [x, U], F = await this._rpcRequest("simulateTransaction", R), W = Z(F, Gd);
+      const R = [x, U], F = await this._rpcRequest("simulateTransaction", R), W = J(F, Gd);
       if ("error" in W)
         throw new Error("failed to simulate transaction: " + W.error.message);
       return W.result;
@@ -26524,7 +26528,7 @@ class m4 {
       };
     }
     i && (m.sigVerify = !0), t && typeof t == "object" && "innerInstructions" in t && (m.innerInstructions = t.innerInstructions);
-    const E = [h, m], S = await this._rpcRequest("simulateTransaction", E), A = Z(S, Gd);
+    const E = [h, m], S = await this._rpcRequest("simulateTransaction", E), A = J(S, Gd);
     if ("error" in A) {
       let g;
       if ("data" in A.error && (g = A.error.data.logs, g && Array.isArray(g))) {
@@ -26602,7 +26606,7 @@ class m4 {
       encoding: "base64"
     }, s = t && t.skipPreflight, i = s === !0 ? "processed" : t && t.preflightCommitment || this.commitment;
     t && t.maxRetries != null && (r.maxRetries = t.maxRetries), t && t.minContextSlot != null && (r.minContextSlot = t.minContextSlot), s && (r.skipPreflight = s), i && (r.preflightCommitment = i);
-    const o = [e, r], a = await this._rpcRequest("sendTransaction", o), l = Z(a, d4);
+    const o = [e, r], a = await this._rpcRequest("sendTransaction", o), l = J(a, d4);
     if ("error" in l) {
       let h;
       throw "data" in l.error && (h = l.error.data.logs), new Rs({
@@ -26802,7 +26806,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, _3);
+    } = J(e, _3);
     this._handleServerNotification(r, [t.value, t.context]);
   }
   /**
@@ -26864,7 +26868,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, W3);
+    } = J(e, W3);
     this._handleServerNotification(r, [{
       accountId: t.value.pubkey,
       accountInfo: t.value.account
@@ -26942,7 +26946,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, f4);
+    } = J(e, f4);
     this._handleServerNotification(r, [t.value, t.context]);
   }
   /**
@@ -26952,7 +26956,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, L3);
+    } = J(e, L3);
     this._handleServerNotification(r, [t]);
   }
   /**
@@ -26987,7 +26991,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, N3);
+    } = J(e, N3);
     this._handleServerNotification(r, [t]);
   }
   /**
@@ -27047,7 +27051,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, z3);
+    } = J(e, z3);
     t.value !== "receivedSignature" && this._subscriptionsAutoDisposedByRpc.add(r), this._handleServerNotification(r, t.value === "receivedSignature" ? [{
       type: "received"
     }, t.context] : [{
@@ -27129,7 +27133,7 @@ class m4 {
     const {
       result: t,
       subscription: r
-    } = Z(e, H3);
+    } = J(e, H3);
     this._handleServerNotification(r, [t]);
   }
   /**
@@ -27246,7 +27250,7 @@ const Kn = Object.freeze({
   },
   ExtendLookupTable: {
     index: 2,
-    layout: se([re("instruction"), es(), Lt(Se(), or(re(), -8), "addresses")])
+    layout: se([re("instruction"), es(), Lt(Se(), ar(re(), -8), "addresses")])
   },
   DeactivateLookupTable: {
     index: 3,
@@ -27593,7 +27597,7 @@ class ll {
   }
 }
 ll.programId = new Y("ComputeBudget111111111111111111111111111111");
-const Jd = 64, Zd = 32, Qd = 64, eu = se([Te("numSignatures"), Te("padding"), ln("signatureOffset"), ln("signatureInstructionIndex"), ln("publicKeyOffset"), ln("publicKeyInstructionIndex"), ln("messageDataOffset"), ln("messageDataSize"), ln("messageInstructionIndex")]);
+const Zd = 64, Jd = 32, Qd = 64, eu = se([Te("numSignatures"), Te("padding"), ln("signatureOffset"), ln("signatureInstructionIndex"), ln("publicKeyOffset"), ln("publicKeyInstructionIndex"), ln("messageDataOffset"), ln("messageDataSize"), ln("messageInstructionIndex")]);
 class Bo {
   /**
    * @internal
@@ -27615,7 +27619,7 @@ class Bo {
       signature: s,
       instructionIndex: i
     } = e;
-    Ue(t.length === Zd, `Public Key must be ${Zd} bytes but received ${t.length} bytes`), Ue(s.length === Qd, `Signature must be ${Qd} bytes but received ${s.length} bytes`);
+    Ue(t.length === Jd, `Public Key must be ${Jd} bytes but received ${t.length} bytes`), Ue(s.length === Qd, `Signature must be ${Qd} bytes but received ${s.length} bytes`);
     const o = eu.span, a = o + t.length, l = a + s.length, h = 1, m = ce.Buffer.alloc(l + r.length), E = i ?? 65535;
     return eu.encode({
       numSignatures: h,
@@ -27643,9 +27647,9 @@ class Bo {
       message: r,
       instructionIndex: s
     } = e;
-    Ue(t.length === Jd, `Private key must be ${Jd} bytes but received ${t.length} bytes`);
+    Ue(t.length === Zd, `Private key must be ${Zd} bytes but received ${t.length} bytes`);
     try {
-      const i = jr.fromSecretKey(t), o = i.publicKey.toBytes(), a = Zc(r, i.secretKey);
+      const i = jr.fromSecretKey(t), o = i.publicKey.toBytes(), a = Jc(r, i.secretKey);
       return this.createInstructionWithPublicKey({
         publicKey: o,
         message: r,
@@ -27659,11 +27663,11 @@ class Bo {
 }
 Bo.programId = new Y("Ed25519SigVerify111111111111111111111111111");
 const g4 = (n, e) => {
-  const t = rr.sign(n, e);
+  const t = sr.sign(n, e);
   return [t.toCompactRawBytes(), t.recovery];
 };
-rr.utils.isValidPrivateKey;
-const y4 = rr.getPublicKey, tu = 32, Ea = 20, nu = 64, w4 = 11, Ba = se([Te("numSignatures"), ln("signatureOffset"), Te("signatureInstructionIndex"), ln("ethAddressOffset"), Te("ethAddressInstructionIndex"), ln("messageDataOffset"), ln("messageDataSize"), Te("messageInstructionIndex"), Xe(20, "ethAddress"), Xe(64, "signature"), Te("recoveryId")]);
+sr.utils.isValidPrivateKey;
+const y4 = sr.getPublicKey, tu = 32, Ea = 20, nu = 64, w4 = 11, Ba = se([Te("numSignatures"), ln("signatureOffset"), Te("signatureInstructionIndex"), ln("ethAddressOffset"), Te("ethAddressInstructionIndex"), ln("messageDataOffset"), ln("messageDataSize"), Te("messageInstructionIndex"), Xe(20, "ethAddress"), Xe(64, "signature"), Te("recoveryId")]);
 class $r {
   /**
    * @internal
@@ -28750,7 +28754,7 @@ class dl {
    */
   static fromConfigData(e) {
     let t = [...e];
-    if (Zt(t) !== 2) return null;
+    if (Jt(t) !== 2) return null;
     const s = [];
     for (let i = 0; i < 2; i++) {
       const o = new Y(Qt(t, 0, Tn)), a = Dn(t) === 1;
@@ -28772,16 +28776,16 @@ const S4 = new Y("Vote111111111111111111111111111111111111111"), D4 = se([
   Te("commission"),
   _t(),
   // votes.length
-  Lt(se([_t("slot"), re("confirmationCount")]), or(re(), -8), "votes"),
+  Lt(se([_t("slot"), re("confirmationCount")]), ar(re(), -8), "votes"),
   Te("rootSlotValid"),
   _t("rootSlot"),
   _t(),
   // authorizedVoters.length
-  Lt(se([_t("epoch"), Se("authorizedVoter")]), or(re(), -8), "authorizedVoters"),
+  Lt(se([_t("epoch"), Se("authorizedVoter")]), ar(re(), -8), "authorizedVoters"),
   se([Lt(se([Se("authorizedPubkey"), _t("epochOfLastAuthorizedSwitch"), _t("targetEpoch")]), 32, "buf"), _t("idx"), Te("isEmpty")], "priorVoters"),
   _t(),
   // epochCredits.length
-  Lt(se([_t("epoch"), _t("credits"), _t("prevCredits")]), or(re(), -8), "epochCredits"),
+  Lt(se([_t("epoch"), _t("credits"), _t("prevCredits")]), ar(re(), -8), "epochCredits"),
   se([_t("slot"), _t("timestamp")], "lastTimestamp")
 ]);
 class ul {
@@ -28877,7 +28881,7 @@ async function T4(n, e, t, r) {
     }) : new Error(`Raw transaction ${a} failed (${JSON.stringify(m)})`);
   return a;
 }
-const I4 = 1e9, dw = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const I4 = 1e9, uw = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Account: w8,
   AddressLookupTableAccount: oc,
@@ -28907,7 +28911,7 @@ const I4 = 1e9, dw = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.define
   MessageV0: vr,
   NONCE_ACCOUNT_LENGTH: ic,
   NonceAccount: wo,
-  PACKET_DATA_SIZE: ar,
+  PACKET_DATA_SIZE: cr,
   PUBLIC_KEY_LENGTH: Tn,
   PublicKey: Y,
   SIGNATURE_LENGTH_IN_BYTES: Ms,
@@ -28955,7 +28959,7 @@ const I4 = 1e9, dw = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.define
   clusterApiUrl: F4,
   sendAndConfirmRawTransaction: T4,
   sendAndConfirmTransaction: sc
-}, Symbol.toStringTag, { value: "Module" })), wh = "Solana", uw = "11111111111111111111111111111111", mr = class mr {
+}, Symbol.toStringTag, { value: "Module" })), wh = "Solana", fw = "11111111111111111111111111111111", mr = class mr {
   constructor(e) {
     ie(this, "type", "Native");
     ie(this, "address");
@@ -29003,10 +29007,10 @@ export {
   Td as M,
   id as N,
   Ii as O,
-  M6 as P,
+  _6 as P,
   ay as Q,
   Wc as R,
-  I6 as S,
+  U6 as S,
   fe as T,
   ly as U,
   gn as V,
@@ -29026,7 +29030,7 @@ export {
   wc as a6,
   Dr as a7,
   hi as a8,
-  G0 as a9,
+  gu as a9,
   Ls as aA,
   vr as aB,
   sl as aC,
@@ -29039,32 +29043,32 @@ export {
   ve as aJ,
   hc as aK,
   tn as aL,
-  Jb as aM,
+  Zb as aM,
   Vn as aN,
   Ti as aO,
   Yi as aP,
   It as aQ,
   nc as aR,
   Ab as aS,
-  i6 as aT,
-  sw as aU,
-  iw as aV,
+  o6 as aT,
+  iw as aU,
+  ow as aV,
   u0 as aW,
   Id as aX,
   Am as aY,
   rl as aZ,
   Gn as a_,
-  yc as aa,
-  Gf as ab,
-  gu as ac,
+  G0 as aa,
+  yc as ab,
+  Gf as ac,
   m4 as ad,
   Y as ae,
   Wb as af,
   Kr as ag,
   P4 as ah,
-  D6 as ai,
-  F6 as aj,
-  v6 as ak,
+  v6 as ai,
+  T6 as aj,
+  k6 as ak,
   Ia as al,
   ll as am,
   Ft as an,
@@ -29073,132 +29077,152 @@ export {
   Qr as aq,
   se as ar,
   ze as as,
-  j6 as at,
+  $6 as at,
   Te as au,
   Xe as av,
   ln as aw,
   oc as ax,
   js as ay,
   _e as az,
-  T6 as b,
-  xc as b$,
+  I6 as b,
+  G6 as b$,
   I4 as b0,
   dc as b1,
   Re as b2,
   wh as b3,
-  Sm as b4,
-  wn as b5,
-  os as b6,
-  ds as b7,
-  lo as b8,
-  By as b9,
-  Ay as bA,
-  V6 as bB,
-  Zf as bC,
-  _d as bD,
-  Yf as bE,
-  G6 as bF,
-  by as bG,
-  X6 as bH,
-  ew as bI,
-  Q6 as bJ,
-  J6 as bK,
-  q6 as bL,
-  fy as bM,
-  W6 as bN,
-  P6 as bO,
-  $6 as bP,
-  e2 as bQ,
-  Pt as bR,
-  F4 as bS,
-  _4 as bT,
-  R4 as bU,
-  om as bV,
-  el as bW,
-  Rs as bX,
-  uw as bY,
-  s6 as bZ,
-  l8 as b_,
-  Y6 as ba,
-  Z6 as bb,
-  Wi as bc,
-  py as bd,
-  H6 as be,
-  Ud as bf,
-  yr as bg,
-  R6 as bh,
-  tw as bi,
-  Yn as bj,
-  O6 as bk,
-  L6 as bl,
-  N6 as bm,
-  dy as bn,
-  K6 as bo,
-  z6 as bp,
-  o6 as bq,
-  S6 as br,
-  Hg as bs,
-  ow as bt,
-  mm as bu,
-  N4 as bv,
-  J4 as bw,
-  Ju as bx,
-  S1 as by,
-  hy as bz,
-  U6 as c,
-  ki as c0,
-  Hm as c1,
-  Gr as c2,
-  zs as c3,
-  Ra as c4,
-  ql as c5,
-  _u as c6,
-  Y4 as c7,
-  t6 as c8,
-  ye as c9,
-  x2 as cA,
-  $r as cB,
-  r6 as cC,
-  I8 as cD,
-  dw as cE,
-  vb as cF,
-  W4 as cG,
-  hf as cH,
-  Tb as cI,
-  ff as cJ,
-  Uh as cK,
-  n6 as ca,
-  Z4 as cb,
-  Ji as cc,
-  Pu as cd,
-  X4 as ce,
-  Xo as cf,
-  L4 as cg,
-  jm as ch,
-  ss as ci,
-  rr as cj,
-  Je as ck,
-  Km as cl,
-  Fi as cm,
-  Wu as cn,
-  zm as co,
-  e6 as cp,
-  v2 as cq,
-  L0 as cr,
-  fd as cs,
-  lm as ct,
-  Vo as cu,
-  a6 as cv,
-  rw as cw,
-  nw as cx,
-  qr as cy,
-  nn as cz,
-  Ze as d,
+  is as b4,
+  Hs as b5,
+  I1 as b6,
+  Ze as b7,
+  Ar as b8,
+  Sr as b9,
+  ds as bA,
+  lo as bB,
+  By as bC,
+  Z6 as bD,
+  Q6 as bE,
+  Wi as bF,
+  py as bG,
+  q6 as bH,
+  Ud as bI,
+  yr as bJ,
+  W6 as bK,
+  nw as bL,
+  Yn as bM,
+  N6 as bN,
+  O6 as bO,
+  z6 as bP,
+  dy as bQ,
+  j6 as bR,
+  H6 as bS,
+  a6 as bT,
+  D6 as bU,
+  Hg as bV,
+  aw as bW,
+  mm as bX,
+  N4 as bY,
+  hy as bZ,
+  Ay as b_,
+  Z4 as ba,
+  J4 as bb,
+  Zu as bc,
+  S1 as bd,
+  sr as be,
+  n6 as bf,
+  os as bg,
+  Q1 as bh,
+  vs as bi,
+  nf as bj,
+  $1 as bk,
+  Ct as bl,
+  to as bm,
+  Sc as bn,
+  Ju as bo,
+  j1 as bp,
+  K1 as bq,
+  R1 as br,
+  r6 as bs,
+  Fi as bt,
+  U1 as bu,
+  Wu as bv,
+  tb as bw,
+  nb as bx,
+  Sm as by,
+  wn as bz,
+  M6 as c,
+  hf as c$,
+  Jf as c0,
+  _d as c1,
+  Yf as c2,
+  X6 as c3,
+  by as c4,
+  Y6 as c5,
+  tw as c6,
+  ew as c7,
+  J6 as c8,
+  K6 as c9,
+  Zi as cA,
+  Pu as cB,
+  X4 as cC,
+  Xo as cD,
+  L4 as cE,
+  jm as cF,
+  ss as cG,
+  Km as cH,
+  zm as cI,
+  e6 as cJ,
+  v2 as cK,
+  L0 as cL,
+  fd as cM,
+  lm as cN,
+  Vo as cO,
+  c6 as cP,
+  sw as cQ,
+  rw as cR,
+  qr as cS,
+  nn as cT,
+  x2 as cU,
+  $r as cV,
+  s6 as cW,
+  I8 as cX,
+  uw as cY,
+  vb as cZ,
+  W4 as c_,
+  fy as ca,
+  P6 as cb,
+  L6 as cc,
+  V6 as cd,
+  e2 as ce,
+  Pt as cf,
+  F4 as cg,
+  _4 as ch,
+  R4 as ci,
+  om as cj,
+  el as ck,
+  Rs as cl,
+  fw as cm,
+  i6 as cn,
+  l8 as co,
+  xc as cp,
+  ki as cq,
+  Hm as cr,
+  Gr as cs,
+  zs as ct,
+  Ra as cu,
+  ql as cv,
+  _u as cw,
+  Y4 as cx,
+  t6 as cy,
+  ye as cz,
+  Qe as d,
+  Tb as d0,
+  ff as d1,
+  Uh as d2,
   Ri as e,
   Bs as f,
   ji as g,
-  _6 as h,
-  k6 as i,
+  R6 as h,
+  F6 as i,
   Kf as j,
   jt as k,
   Dt as l,