@bestinslot/wallet-kit 0.13.0 → 0.13.1

package/dist/{balances-_-oF5kR6.js → balances-HcqAUOXv.js}

@@ -1,5 +1,5 @@
-import { h as wn, U as Ir, V as qo, X as Do, Y as Mo, G as S, e as Wt, l as zr, Z as Ys, _ as Rr, O as ze, f as Hn, H as Ft, $ as Ke, a0 as X, a1 as ae, a2 as zs, a3 as Wo, a4 as Kr, a5 as Pt, a6 as me, a7 as Nn, a8 as Yt, a9 as Ln, aa as Ks, d as Qe, D as gn, ab as Go, ac as Xr, ad as Cn, ae as Xs, k as Le, af as Ho, ag as Vo, ah as Zo, ai as Yo, aj as zo, ak as Js, al as Ko, am as js, an as Qs, ao as ti, ap as ei, p as Xo } from "./mint-Dm67SjcM.js";
-async function qf(e, t, n, r, s, i) {
+import { h as wn, U as Ir, V as qo, X as Do, Y as Mo, G as S, e as Wt, l as zr, Z as Ys, _ as Rr, O as ze, f as Hn, H as Ft, $ as Ke, a0 as X, a1 as ae, a2 as zs, a3 as Wo, a4 as Kr, a5 as Pt, a6 as me, a7 as Nn, a8 as Yt, a9 as Ln, aa as Ks, ab as Go, d as Qe, D as gn, ac as Ho, ad as Xr, ae as Cn, af as Xs, k as Le, ag as Vo, ah as Zo, ai as Yo, aj as zo, ak as Ko, al as Js, am as Xo, an as js, ao as Qs, ap as ti, aq as ei, p as Jo } from "./mint-A-bG5QIH.js";
+async function Df(e, t, n, r, s, i) {
   const o = wn();
   if (!o)
     throw new Error("No wallet connected");
@@ -56,7 +56,7 @@ function An(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Jo(e, t) {
+function jo(e, t) {
   lt(e, void 0, "digestInto() output");
   const n = t.outputLen;
   if (e.length < n)
@@ -72,13 +72,13 @@ function ur(e) {
 function Ht(e, t) {
   return e << 32 - t | e >>> t;
 }
-const ri = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", jo = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ri = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Qo = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function cn(e) {
   if (lt(e), ri)
     return e.toHex();
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += jo[e[n]];
+    t += Qo[e[n]];
   return t;
 }
 const ee = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
@@ -122,7 +122,7 @@ function wt(...e) {
   }
   return n;
 }
-function Qo(e, t = {}) {
+function ta(e, t = {}) {
   const n = (s, i) => e(i).update(s).digest(), r = e(void 0);
   return n.outputLen = r.outputLen, n.blockLen = r.blockLen, n.create = (s) => e(s), Object.assign(n, t), Object.freeze(n);
 }
@@ -132,7 +132,7 @@ function si(e = 32) {
     throw new Error("crypto.getRandomValues must be defined");
   return t.getRandomValues(new Uint8Array(e));
 }
-const ta = (e) => ({
+const ea = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
 const Nr = /* @__PURE__ */ BigInt(0), Fn = /* @__PURE__ */ BigInt(1);
@@ -143,9 +143,9 @@ function jr(e, t = "") {
   }
   return e;
 }
-function ea(e) {
+function na(e) {
   if (typeof e == "bigint") {
-    if (!na(e))
+    if (!ra(e))
       throw new Error("positive bigint expected, got " + e);
   } else
     Xe(e);
@@ -169,7 +169,7 @@ function oi(e) {
   return ii(cn(ci(lt(e)).reverse()));
 }
 function mt(e, t) {
-  Xe(t), e = ea(e);
+  Xe(t), e = na(e);
   const n = Pn(e.toString(16).padStart(t * 2, "0"));
   if (n.length !== t)
     throw new Error("number too large");
@@ -189,14 +189,14 @@ function Vn(e) {
     return r;
   });
 }
-const na = (e) => typeof e == "bigint" && Nr <= e;
+const ra = (e) => typeof e == "bigint" && Nr <= e;
 function Un(e) {
   let t;
   for (t = 0; e > Nr; e >>= Fn, t += 1)
     ;
   return t;
 }
-function ra(e, t) {
+function sa(e, t) {
   return e >> BigInt(t) & Fn;
 }
 const yn = (e) => (Fn << BigInt(e)) - Fn;
@@ -217,7 +217,7 @@ function Cr(e, t = {}, n = {}) {
 const ye = () => {
   throw new Error("not implemented");
 };
-function xr(e) {
+function _r(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (n, ...r) => {
     const s = t.get(n);
@@ -227,7 +227,7 @@ function xr(e) {
     return t.set(n, i), i;
   };
 }
-const Ct = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), Ie = /* @__PURE__ */ BigInt(2), ui = /* @__PURE__ */ BigInt(3), li = /* @__PURE__ */ BigInt(4), fi = /* @__PURE__ */ BigInt(5), sa = /* @__PURE__ */ BigInt(7), di = /* @__PURE__ */ BigInt(8), ia = /* @__PURE__ */ BigInt(9), pi = /* @__PURE__ */ BigInt(16);
+const Ct = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), Ie = /* @__PURE__ */ BigInt(2), ui = /* @__PURE__ */ BigInt(3), li = /* @__PURE__ */ BigInt(4), fi = /* @__PURE__ */ BigInt(5), ia = /* @__PURE__ */ BigInt(7), di = /* @__PURE__ */ BigInt(8), oa = /* @__PURE__ */ BigInt(9), pi = /* @__PURE__ */ BigInt(16);
 function At(e, t) {
   const n = e % t;
   return n >= Ct ? n : t + n;
@@ -254,12 +254,12 @@ function hi(e, t) {
   const n = (e.ORDER + Tt) / li, r = e.pow(t, n);
   return $r(e, r, t), r;
 }
-function oa(e, t) {
+function aa(e, t) {
   const n = (e.ORDER - fi) / di, r = e.mul(t, Ie), s = e.pow(r, n), i = e.mul(t, s), o = e.mul(e.mul(i, Ie), s), a = e.mul(i, e.sub(o, e.ONE));
   return $r(e, a, t), a;
 }
-function aa(e) {
-  const t = bn(e), n = wi(e), r = n(t, t.neg(t.ONE)), s = n(t, r), i = n(t, t.neg(r)), o = (e + sa) / pi;
+function ca(e) {
+  const t = bn(e), n = wi(e), r = n(t, t.neg(t.ONE)), s = n(t, r), i = n(t, t.neg(r)), o = (e + ia) / pi;
   return (a, c) => {
     let u = a.pow(c, o), l = a.mul(u, r);
     const f = a.mul(u, s), d = a.mul(u, i), p = a.eql(a.sqr(l), c), w = a.eql(a.sqr(f), c);
@@ -302,10 +302,10 @@ function wi(e) {
     return p;
   };
 }
-function ca(e) {
-  return e % li === ui ? hi : e % di === fi ? oa : e % pi === ia ? aa(e) : wi(e);
+function ua(e) {
+  return e % li === ui ? hi : e % di === fi ? aa : e % pi === oa ? ca(e) : wi(e);
 }
-const ua = [
+const la = [
   "create",
   "isValid",
   "is0",
@@ -329,7 +329,7 @@ function gi(e) {
     ORDER: "bigint",
     BYTES: "number",
     BITS: "number"
-  }, n = ua.reduce((r, s) => (r[s] = "function", r), t);
+  }, n = la.reduce((r, s) => (r[s] = "function", r), t);
   return Cr(e, n), e;
 }
 function Zn(e, t, n) {
@@ -354,12 +354,12 @@ function qn(e, t) {
     throw new Error("invalid Legendre symbol result");
   return s ? 1 : i ? 0 : -1;
 }
-function la(e, t) {
+function fa(e, t) {
   t !== void 0 && Xe(t);
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-class fa {
+class da {
   ORDER;
   BITS;
   BYTES;
@@ -375,7 +375,7 @@ class fa {
       throw new Error("invalid field: expected ORDER > 0, got " + t);
     let r;
     this.isLE = !1, n != null && typeof n == "object" && (typeof n.BITS == "number" && (r = n.BITS), typeof n.sqrt == "function" && (this.sqrt = n.sqrt), typeof n.isLE == "boolean" && (this.isLE = n.isLE), n.allowedLengths && (this._lengths = n.allowedLengths?.slice()), typeof n.modFromBytes == "boolean" && (this._mod = n.modFromBytes));
-    const { nBitLength: s, nByteLength: i } = la(t, r);
+    const { nBitLength: s, nByteLength: i } = fa(t, r);
     if (i > 2048)
       throw new Error("invalid field: expected ORDER of <= 2048 bytes");
     this.ORDER = t, this.BITS = s, this.BYTES = i, this._sqrt = void 0, Object.preventExtensions(this);
@@ -439,7 +439,7 @@ class fa {
     return Qr(t, this.ORDER);
   }
   sqrt(t) {
-    return this._sqrt || (this._sqrt = ca(this.ORDER)), this._sqrt(this, t);
+    return this._sqrt || (this._sqrt = ua(this.ORDER)), this._sqrt(this, t);
   }
   toBytes(t) {
     return this.isLE ? ai(t, this.BYTES) : mt(t, this.BYTES);
@@ -471,7 +471,7 @@ class fa {
   }
 }
 function bn(e, t = {}) {
-  return new fa(e, t);
+  return new da(e, t);
 }
 function yi(e) {
   if (typeof e != "bigint")
@@ -491,13 +491,13 @@ function mi(e, t, n = !1) {
   const o = n ? oi(e) : zt(e), a = At(o, t - Tt) + Tt;
   return n ? ai(a, s) : mt(a, s);
 }
-function da(e, t, n) {
+function pa(e, t, n) {
   return e & t ^ ~e & n;
 }
-function pa(e, t, n) {
+function ha(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
-class ha {
+class wa {
   blockLen;
   outputLen;
   padOffset;
@@ -528,7 +528,7 @@ class ha {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    An(this), Jo(t, this), this.finished = !0;
+    An(this), jo(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: s, isLE: i } = this;
     let { pos: o } = this;
     n[o++] = 128, an(this.buffer.subarray(o)), this.padOffset > s - o && (this.process(r, 0), o = 0);
@@ -568,7 +568,7 @@ const pe = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), wa = /* @__PURE__ */ Uint32Array.from([
+]), ga = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -634,7 +634,7 @@ const pe = /* @__PURE__ */ Uint32Array.from([
   3204031479,
   3329325298
 ]), he = /* @__PURE__ */ new Uint32Array(64);
-class ga extends ha {
+class ya extends wa {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -655,7 +655,7 @@ class ga extends ha {
     }
     let { A: r, B: s, C: i, D: o, E: a, F: c, G: u, H: l } = this;
     for (let f = 0; f < 64; f++) {
-      const d = Ht(a, 6) ^ Ht(a, 11) ^ Ht(a, 25), p = l + d + da(a, c, u) + wa[f] + he[f] | 0, h = (Ht(r, 2) ^ Ht(r, 13) ^ Ht(r, 22)) + pa(r, s, i) | 0;
+      const d = Ht(a, 6) ^ Ht(a, 11) ^ Ht(a, 25), p = l + d + pa(a, c, u) + ga[f] + he[f] | 0, h = (Ht(r, 2) ^ Ht(r, 13) ^ Ht(r, 22)) + ha(r, s, i) | 0;
       l = u, u = c, c = a, a = o + p | 0, o = i, i = s, s = r, r = p + h | 0;
     }
     r = r + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(r, s, i, o, a, c, u, l);
@@ -667,7 +667,7 @@ class ga extends ha {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), an(this.buffer);
   }
 }
-class ya extends ga {
+class ba extends ya {
   // We cannot use array here since array allows indexing by variable
   // which means optimizer/compiler cannot use registers.
   A = pe[0] | 0;
@@ -682,9 +682,9 @@ class ya extends ga {
     super(32);
   }
 }
-const _i = /* @__PURE__ */ Qo(
-  () => new ya(),
-  /* @__PURE__ */ ta(1)
+const xi = /* @__PURE__ */ ta(
+  () => new ba(),
+  /* @__PURE__ */ ea(1)
 );
 const je = /* @__PURE__ */ BigInt(0), Re = /* @__PURE__ */ BigInt(1);
 function Dn(e, t) {
@@ -695,12 +695,12 @@ function Mn(e, t) {
   const n = Ae(e.Fp, t.map((r) => r.Z));
   return t.map((r, s) => e.fromAffine(r.toAffine(n[s])));
 }
-function xi(e, t) {
+function _i(e, t) {
   if (!Number.isSafeInteger(e) || e <= 0 || e > t)
     throw new Error("invalid window size, expected [1.." + t + "], got W=" + e);
 }
 function lr(e, t) {
-  xi(e, t);
+  _i(e, t);
   const n = Math.ceil(t / e) + 1, r = 2 ** (e - 1), s = 2 ** e, i = yn(e), o = BigInt(e);
   return { windows: n, windowSize: r, mask: i, maxNumber: s, shiftBy: o };
 }
@@ -719,7 +719,7 @@ function es(e) {
   if (e !== je)
     throw new Error("invalid wNAF");
 }
-class ba {
+class ma {
   BASE;
   ZERO;
   Fn;
@@ -807,13 +807,13 @@ class ba {
   // using windowed method. This specifies window size and
   // stores precomputed values. Usually only base point would be precomputed.
   createCache(t, n) {
-    xi(n, this.bits), Ei.set(t, n), fr.delete(t);
+    _i(n, this.bits), Ei.set(t, n), fr.delete(t);
   }
   hasCache(t) {
     return dr(t) !== 1;
   }
 }
-function ma(e, t, n, r) {
+function xa(e, t, n, r) {
   let s = t, i = e.ZERO, o = e.ZERO;
   for (; n > je || r > je; )
     n & Re && (i = i.add(s)), r & Re && (o = o.add(s)), s = s.double(), n >>= Re, r >>= Re;
@@ -841,7 +841,7 @@ function _a(e, t, n = {}, r) {
       throw new Error(`CURVE.${c} must be valid field element of CURVE.Fp`);
   return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: s, Fn: i };
 }
-const xa = zt;
+const Ea = zt;
 function we(e, t) {
   if (Je(e), Je(t), e < 0 || e >= 1 << 8 * t)
     throw new Error("invalid I2OSP input: " + e);
@@ -850,7 +850,7 @@ function we(e, t) {
     n[r] = e & 255, e >>>= 8;
   return new Uint8Array(n);
 }
-function Ea(e, t) {
+function Sa(e, t) {
   const n = new Uint8Array(e.length);
   for (let r = 0; r < e.length; r++)
     n[r] = e[r] ^ t[r];
@@ -861,7 +861,7 @@ function Si(e) {
     throw new Error("DST must be Uint8Array or ascii string");
   return typeof e == "string" ? Vn(e) : e;
 }
-function Sa(e, t, n, r) {
+function Ba(e, t, n, r) {
   lt(e), Je(n), t = Si(t), t.length > 255 && (t = r(wt(Vn("H2C-OVERSIZE-DST-"), t)));
   const { outputLen: s, blockLen: i } = r, o = Math.ceil(n / s);
   if (n > 65535 || o > 255)
@@ -869,12 +869,12 @@ function Sa(e, t, n, r) {
   const a = wt(t, we(t.length, 1)), c = we(0, i), u = we(n, 2), l = new Array(o), f = r(wt(c, e, u, we(0, 1), a));
   l[0] = r(wt(f, we(1, 1), a));
   for (let p = 1; p <= o; p++) {
-    const w = [Ea(f, l[p - 1]), we(p + 1, 1), a];
+    const w = [Sa(f, l[p - 1]), we(p + 1, 1), a];
     l[p] = r(wt(...w));
   }
   return wt(...l).slice(0, n);
 }
-function Ba(e, t, n, r, s) {
+function va(e, t, n, r, s) {
   if (lt(e), Je(n), t = Si(t), t.length > 255) {
     const i = Math.ceil(2 * r / 8);
     t = s.create({ dkLen: i }).update(Vn("H2C-OVERSIZE-DST-")).update(t).digest();
@@ -895,9 +895,9 @@ function pr(e, t, n) {
   const u = r.toString(2).length, l = Math.ceil((u + s) / 8), f = t * i * l;
   let d;
   if (a === "xmd")
-    d = Sa(e, c, f, o);
+    d = Ba(e, c, f, o);
   else if (a === "xof")
-    d = Ba(e, c, f, s, o);
+    d = va(e, c, f, s, o);
   else if (a === "_internal_pass")
     d = e;
   else
@@ -906,8 +906,8 @@ function pr(e, t, n) {
   for (let w = 0; w < t; w++) {
     const h = new Array(i);
     for (let g = 0; g < i; g++) {
-      const b = l * (g + w * i), B = d.subarray(b, b + l);
-      h[g] = At(xa(B), r);
+      const b = l * (g + w * i), v = d.subarray(b, b + l);
+      h[g] = At(Ea(v), r);
     }
     p[w] = h;
   }
@@ -920,7 +920,7 @@ function Bi(e, t) {
     return r = e.mul(i, u), s = e.mul(s, e.mul(a, l)), { x: r, y: s };
   };
 }
-const va = Vn("HashToScalar-");
+const Oa = Vn("HashToScalar-");
 function rs(e, t, n) {
   if (typeof t != "function")
     throw new Error("mapToCurve() must be defined");
@@ -959,7 +959,7 @@ function rs(e, t, n) {
     // hash_to_scalar can produce 0: https://www.rfc-editor.org/errata/eid8393
     // RFC 9380, draft-irtf-cfrg-bbs-signatures-08
     hashToScalar(i, o) {
-      const a = e.Fn.ORDER, c = Object.assign({}, n, { p: a, m: 1, DST: va }, o);
+      const a = e.Fn.ORDER, c = Object.assign({}, n, { p: a, m: 1, DST: Oa }, o);
       return pr(i, 1, c)[0][0];
     }
   };
@@ -1009,7 +1009,7 @@ class vi {
 const Lr = (e, t, n) => new vi(e, t).update(n).digest();
 Lr.create = (e, t) => new vi(e, t);
 const ss = (e, t) => (e + (e >= 0 ? t : -t) / ne) / t;
-function Oa(e, t, n) {
+function Ta(e, t, n) {
   const [[r, s], [i, o]] = t, a = ss(o * e, n), c = ss(-s * e, n);
   let u = e - a * r - c * i, l = -a * s - c * o;
   const f = u < ke, d = l < ke;
@@ -1035,109 +1035,109 @@ function Oi(e, t = {}) {
   const { endo: c } = t;
   if (c && (!r.is0(i.a) || typeof c.beta != "bigint" || !Array.isArray(c.basises)))
     throw new Error('invalid endo: expected "beta": bigint and "basises": array');
-  const u = Ra(r, s);
+  const u = ka(r, s);
   function l() {
     if (!r.isOdd)
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
-  function f(U, y, x) {
-    const { x: v, y: N } = y.toAffine(), A = r.toBytes(v);
-    if (jr(x, "isCompressed"), x) {
+  function f(U, y, _) {
+    const { x: B, y: N } = y.toAffine(), P = r.toBytes(B);
+    if (jr(_, "isCompressed"), _) {
       l();
       const $ = !r.isOdd(N);
-      return wt(Ta($), A);
+      return wt(Ia($), P);
     } else
-      return wt(Uint8Array.of(4), A, r.toBytes(N));
+      return wt(Uint8Array.of(4), P, r.toBytes(N));
   }
   function d(U) {
     lt(U, void 0, "Point");
-    const { publicKey: y, publicKeyUncompressed: x } = u, v = U.length, N = U[0], A = U.subarray(1);
-    if (v === y && (N === 2 || N === 3)) {
-      const $ = r.fromBytes(A);
+    const { publicKey: y, publicKeyUncompressed: _ } = u, B = U.length, N = U[0], P = U.subarray(1);
+    if (B === y && (N === 2 || N === 3)) {
+      const $ = r.fromBytes(P);
       if (!r.isValid($))
         throw new Error("bad point: is not on curve, wrong x");
-      const M = h($);
+      const D = h($);
       let L;
       try {
-        L = r.sqrt(M);
+        L = r.sqrt(D);
       } catch (at) {
         const Q = at instanceof Error ? ": " + at.message : "";
         throw new Error("bad point: is not on curve, sqrt error" + Q);
       }
       l();
-      const W = r.isOdd(L);
-      return (N & 1) === 1 !== W && (L = r.neg(L)), { x: $, y: L };
-    } else if (v === x && N === 4) {
-      const $ = r.BYTES, M = r.fromBytes(A.subarray(0, $)), L = r.fromBytes(A.subarray($, $ * 2));
-      if (!g(M, L))
+      const M = r.isOdd(L);
+      return (N & 1) === 1 !== M && (L = r.neg(L)), { x: $, y: L };
+    } else if (B === _ && N === 4) {
+      const $ = r.BYTES, D = r.fromBytes(P.subarray(0, $)), L = r.fromBytes(P.subarray($, $ * 2));
+      if (!g(D, L))
         throw new Error("bad point: is not on curve");
-      return { x: M, y: L };
+      return { x: D, y: L };
     } else
-      throw new Error(`bad point: got length ${v}, expected compressed=${y} or uncompressed=${x}`);
+      throw new Error(`bad point: got length ${B}, expected compressed=${y} or uncompressed=${_}`);
   }
   const p = t.toBytes || f, w = t.fromBytes || d;
   function h(U) {
-    const y = r.sqr(U), x = r.mul(y, U);
-    return r.add(r.add(x, r.mul(U, i.a)), i.b);
+    const y = r.sqr(U), _ = r.mul(y, U);
+    return r.add(r.add(_, r.mul(U, i.a)), i.b);
   }
   function g(U, y) {
-    const x = r.sqr(y), v = h(U);
-    return r.eql(x, v);
+    const _ = r.sqr(y), B = h(U);
+    return r.eql(_, B);
   }
   if (!g(i.Gx, i.Gy))
     throw new Error("bad curve params: generator point");
-  const b = r.mul(r.pow(i.a, Ge), Er), B = r.mul(r.sqr(i.b), BigInt(27));
-  if (r.is0(r.add(b, B)))
+  const b = r.mul(r.pow(i.a, Ge), Er), v = r.mul(r.sqr(i.b), BigInt(27));
+  if (r.is0(r.add(b, v)))
     throw new Error("bad curve params: a or b");
-  function O(U, y, x = !1) {
-    if (!r.isValid(y) || x && r.is0(y))
+  function O(U, y, _ = !1) {
+    if (!r.isValid(y) || _ && r.is0(y))
       throw new Error(`bad point coordinate ${U}`);
     return y;
   }
   function F(U) {
-    if (!(U instanceof m))
+    if (!(U instanceof x))
       throw new Error("Weierstrass Point expected");
   }
-  function q(U) {
+  function W(U) {
     if (!c || !c.basises)
       throw new Error("no endo");
-    return Oa(U, c.basises, s.ORDER);
+    return Ta(U, c.basises, s.ORDER);
   }
-  const P = xr((U, y) => {
-    const { X: x, Y: v, Z: N } = U;
+  const A = _r((U, y) => {
+    const { X: _, Y: B, Z: N } = U;
     if (r.eql(N, r.ONE))
-      return { x, y: v };
-    const A = U.is0();
-    y == null && (y = A ? r.ONE : r.inv(N));
-    const $ = r.mul(x, y), M = r.mul(v, y), L = r.mul(N, y);
-    if (A)
+      return { x: _, y: B };
+    const P = U.is0();
+    y == null && (y = P ? r.ONE : r.inv(N));
+    const $ = r.mul(_, y), D = r.mul(B, y), L = r.mul(N, y);
+    if (P)
       return { x: r.ZERO, y: r.ZERO };
     if (!r.eql(L, r.ONE))
       throw new Error("invZ was invalid");
-    return { x: $, y: M };
-  }), I = xr((U) => {
+    return { x: $, y: D };
+  }), k = _r((U) => {
     if (U.is0()) {
       if (t.allowInfinityPoint && !r.is0(U.Y))
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: y, y: x } = U.toAffine();
-    if (!r.isValid(y) || !r.isValid(x))
+    const { x: y, y: _ } = U.toAffine();
+    if (!r.isValid(y) || !r.isValid(_))
       throw new Error("bad point: x or y not field elements");
-    if (!g(y, x))
+    if (!g(y, _))
       throw new Error("bad point: equation left != right");
     if (!U.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function k(U, y, x, v, N) {
-    return x = new m(r.mul(x.X, U), x.Y, x.Z), y = Dn(v, y), x = Dn(N, x), y.add(x);
+  function I(U, y, _, B, N) {
+    return _ = new x(r.mul(_.X, U), _.Y, _.Z), y = Dn(B, y), _ = Dn(N, _), y.add(_);
   }
-  class m {
+  class x {
     // base / generator point
-    static BASE = new m(i.Gx, i.Gy, r.ONE);
+    static BASE = new x(i.Gx, i.Gy, r.ONE);
     // zero / infinity / identity point
-    static ZERO = new m(r.ZERO, r.ONE, r.ZERO);
+    static ZERO = new x(r.ZERO, r.ONE, r.ZERO);
     // 0, 1, 0
     // math field
     static Fp = r;
@@ -1147,27 +1147,27 @@ function Oi(e, t = {}) {
     Y;
     Z;
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(y, x, v) {
-      this.X = O("x", y), this.Y = O("y", x, !0), this.Z = O("z", v), Object.freeze(this);
+    constructor(y, _, B) {
+      this.X = O("x", y), this.Y = O("y", _, !0), this.Z = O("z", B), Object.freeze(this);
     }
     static CURVE() {
       return i;
     }
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
     static fromAffine(y) {
-      const { x, y: v } = y || {};
-      if (!y || !r.isValid(x) || !r.isValid(v))
+      const { x: _, y: B } = y || {};
+      if (!y || !r.isValid(_) || !r.isValid(B))
         throw new Error("invalid affine point");
-      if (y instanceof m)
+      if (y instanceof x)
         throw new Error("projective point not allowed");
-      return r.is0(x) && r.is0(v) ? m.ZERO : new m(x, v, r.ONE);
+      return r.is0(_) && r.is0(B) ? x.ZERO : new x(_, B, r.ONE);
     }
     static fromBytes(y) {
-      const x = m.fromAffine(w(lt(y, void 0, "point")));
-      return x.assertValidity(), x;
+      const _ = x.fromAffine(w(lt(y, void 0, "point")));
+      return _.assertValidity(), _;
     }
     static fromHex(y) {
-      return m.fromBytes(Pn(y));
+      return x.fromBytes(Pn(y));
     }
     get x() {
       return this.toAffine().x;
@@ -1181,13 +1181,13 @@ function Oi(e, t = {}) {
      * @param isLazy true will defer table computation until the first multiplication
      * @returns
      */
-    precompute(y = 8, x = !0) {
-      return V.createCache(this, y), x || this.multiply(Ge), this;
+    precompute(y = 8, _ = !0) {
+      return H.createCache(this, y), _ || this.multiply(Ge), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
     assertValidity() {
-      I(this);
+      k(this);
     }
     hasEvenY() {
       const { y } = this.toAffine();
@@ -1198,21 +1198,21 @@ function Oi(e, t = {}) {
     /** Compare one point to another. */
     equals(y) {
       F(y);
-      const { X: x, Y: v, Z: N } = this, { X: A, Y: $, Z: M } = y, L = r.eql(r.mul(x, M), r.mul(A, N)), W = r.eql(r.mul(v, M), r.mul($, N));
-      return L && W;
+      const { X: _, Y: B, Z: N } = this, { X: P, Y: $, Z: D } = y, L = r.eql(r.mul(_, D), r.mul(P, N)), M = r.eql(r.mul(B, D), r.mul($, N));
+      return L && M;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
     negate() {
-      return new m(this.X, r.neg(this.Y), this.Z);
+      return new x(this.X, r.neg(this.Y), this.Z);
     }
     // Renes-Costello-Batina exception-free doubling formula.
     // There is 30% faster Jacobian formula, but it is not complete.
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: y, b: x } = i, v = r.mul(x, Ge), { X: N, Y: A, Z: $ } = this;
-      let M = r.ZERO, L = r.ZERO, W = r.ZERO, Z = r.mul(N, N), at = r.mul(A, A), Q = r.mul($, $), G = r.mul(N, A);
-      return G = r.add(G, G), W = r.mul(N, $), W = r.add(W, W), M = r.mul(y, W), L = r.mul(v, Q), L = r.add(M, L), M = r.sub(at, L), L = r.add(at, L), L = r.mul(M, L), M = r.mul(G, M), W = r.mul(v, W), Q = r.mul(y, Q), G = r.sub(Z, Q), G = r.mul(y, G), G = r.add(G, W), W = r.add(Z, Z), Z = r.add(W, Z), Z = r.add(Z, Q), Z = r.mul(Z, G), L = r.add(L, Z), Q = r.mul(A, $), Q = r.add(Q, Q), Z = r.mul(Q, G), M = r.sub(M, Z), W = r.mul(Q, at), W = r.add(W, W), W = r.add(W, W), new m(M, L, W);
+      const { a: y, b: _ } = i, B = r.mul(_, Ge), { X: N, Y: P, Z: $ } = this;
+      let D = r.ZERO, L = r.ZERO, M = r.ZERO, Z = r.mul(N, N), at = r.mul(P, P), Q = r.mul($, $), G = r.mul(N, P);
+      return G = r.add(G, G), M = r.mul(N, $), M = r.add(M, M), D = r.mul(y, M), L = r.mul(B, Q), L = r.add(D, L), D = r.sub(at, L), L = r.add(at, L), L = r.mul(D, L), D = r.mul(G, D), M = r.mul(B, M), Q = r.mul(y, Q), G = r.sub(Z, Q), G = r.mul(y, G), G = r.add(G, M), M = r.add(Z, Z), Z = r.add(M, Z), Z = r.add(Z, Q), Z = r.mul(Z, G), L = r.add(L, Z), Q = r.mul(P, $), Q = r.add(Q, Q), Z = r.mul(Q, G), D = r.sub(D, Z), M = r.mul(Q, at), M = r.add(M, M), M = r.add(M, M), new x(D, L, M);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -1220,19 +1220,19 @@ function Oi(e, t = {}) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(y) {
       F(y);
-      const { X: x, Y: v, Z: N } = this, { X: A, Y: $, Z: M } = y;
-      let L = r.ZERO, W = r.ZERO, Z = r.ZERO;
+      const { X: _, Y: B, Z: N } = this, { X: P, Y: $, Z: D } = y;
+      let L = r.ZERO, M = r.ZERO, Z = r.ZERO;
       const at = i.a, Q = r.mul(i.b, Ge);
-      let G = r.mul(x, A), ft = r.mul(v, $), ht = r.mul(N, M), xt = r.add(x, v), z = r.add(A, $);
-      xt = r.mul(xt, z), z = r.add(G, ft), xt = r.sub(xt, z), z = r.add(x, N);
-      let ut = r.add(A, M);
-      return z = r.mul(z, ut), ut = r.add(G, ht), z = r.sub(z, ut), ut = r.add(v, N), L = r.add($, M), ut = r.mul(ut, L), L = r.add(ft, ht), ut = r.sub(ut, L), Z = r.mul(at, z), L = r.mul(Q, ht), Z = r.add(L, Z), L = r.sub(ft, Z), Z = r.add(ft, Z), W = r.mul(L, Z), ft = r.add(G, G), ft = r.add(ft, G), ht = r.mul(at, ht), z = r.mul(Q, z), ft = r.add(ft, ht), ht = r.sub(G, ht), ht = r.mul(at, ht), z = r.add(z, ht), G = r.mul(ft, z), W = r.add(W, G), G = r.mul(ut, z), L = r.mul(xt, L), L = r.sub(L, G), G = r.mul(xt, ft), Z = r.mul(ut, Z), Z = r.add(Z, G), new m(L, W, Z);
+      let G = r.mul(_, P), ft = r.mul(B, $), ht = r.mul(N, D), _t = r.add(_, B), z = r.add(P, $);
+      _t = r.mul(_t, z), z = r.add(G, ft), _t = r.sub(_t, z), z = r.add(_, N);
+      let ut = r.add(P, D);
+      return z = r.mul(z, ut), ut = r.add(G, ht), z = r.sub(z, ut), ut = r.add(B, N), L = r.add($, D), ut = r.mul(ut, L), L = r.add(ft, ht), ut = r.sub(ut, L), Z = r.mul(at, z), L = r.mul(Q, ht), Z = r.add(L, Z), L = r.sub(ft, Z), Z = r.add(ft, Z), M = r.mul(L, Z), ft = r.add(G, G), ft = r.add(ft, G), ht = r.mul(at, ht), z = r.mul(Q, z), ft = r.add(ft, ht), ht = r.sub(G, ht), ht = r.mul(at, ht), z = r.add(z, ht), G = r.mul(ft, z), M = r.add(M, G), G = r.mul(ut, z), L = r.mul(_t, L), L = r.sub(L, G), G = r.mul(_t, ft), Z = r.mul(ut, Z), Z = r.add(Z, G), new x(L, M, Z);
     }
     subtract(y) {
       return this.add(y.negate());
     }
     is0() {
-      return this.equals(m.ZERO);
+      return this.equals(x.ZERO);
     }
     /**
      * Constant time multiplication.
@@ -1244,19 +1244,19 @@ function Oi(e, t = {}) {
      * @returns New point
      */
     multiply(y) {
-      const { endo: x } = t;
+      const { endo: _ } = t;
       if (!s.isValidNot0(y))
         throw new Error("invalid scalar: out of range");
-      let v, N;
-      const A = ($) => V.cached(this, $, (M) => Mn(m, M));
-      if (x) {
-        const { k1neg: $, k1: M, k2neg: L, k2: W } = q(y), { p: Z, f: at } = A(M), { p: Q, f: G } = A(W);
-        N = at.add(G), v = k(x.beta, Z, Q, $, L);
+      let B, N;
+      const P = ($) => H.cached(this, $, (D) => Mn(x, D));
+      if (_) {
+        const { k1neg: $, k1: D, k2neg: L, k2: M } = W(y), { p: Z, f: at } = P(D), { p: Q, f: G } = P(M);
+        N = at.add(G), B = I(_.beta, Z, Q, $, L);
       } else {
-        const { p: $, f: M } = A(y);
-        v = $, N = M;
+        const { p: $, f: D } = P(y);
+        B = $, N = D;
       }
-      return Mn(m, [v, N])[0];
+      return Mn(x, [B, N])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -1264,27 +1264,27 @@ function Oi(e, t = {}) {
      * an exposed secret key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(y) {
-      const { endo: x } = t, v = this;
+      const { endo: _ } = t, B = this;
       if (!s.isValid(y))
         throw new Error("invalid scalar: out of range");
-      if (y === ke || v.is0())
-        return m.ZERO;
+      if (y === ke || B.is0())
+        return x.ZERO;
       if (y === Rt)
-        return v;
-      if (V.hasCache(this))
+        return B;
+      if (H.hasCache(this))
         return this.multiply(y);
-      if (x) {
-        const { k1neg: N, k1: A, k2neg: $, k2: M } = q(y), { p1: L, p2: W } = ma(m, v, A, M);
-        return k(x.beta, L, W, N, $);
+      if (_) {
+        const { k1neg: N, k1: P, k2neg: $, k2: D } = W(y), { p1: L, p2: M } = xa(x, B, P, D);
+        return I(_.beta, L, M, N, $);
       } else
-        return V.unsafe(v, y);
+        return H.unsafe(B, y);
     }
     /**
      * Converts Projective point to affine (x, y) coordinates.
      * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
      */
     toAffine(y) {
-      return P(this, y);
+      return A(this, y);
     }
     /**
      * Checks whether Point is free of torsion elements (is in prime subgroup).
@@ -1292,17 +1292,17 @@ function Oi(e, t = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: y } = t;
-      return o === Rt ? !0 : y ? y(m, this) : V.unsafe(this, a).is0();
+      return o === Rt ? !0 : y ? y(x, this) : H.unsafe(this, a).is0();
     }
     clearCofactor() {
       const { clearCofactor: y } = t;
-      return o === Rt ? this : y ? y(m, this) : this.multiplyUnsafe(o);
+      return o === Rt ? this : y ? y(x, this) : this.multiplyUnsafe(o);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(o).is0();
     }
     toBytes(y = !0) {
-      return jr(y, "isCompressed"), this.assertValidity(), p(m, this, y);
+      return jr(y, "isCompressed"), this.assertValidity(), p(x, this, y);
     }
     toHex(y = !0) {
       return cn(this.toBytes(y));
@@ -1311,47 +1311,47 @@ function Oi(e, t = {}) {
       return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
     }
   }
-  const D = s.BITS, V = new ba(m, t.endo ? Math.ceil(D / 2) : D);
-  return m.BASE.precompute(8), m;
+  const q = s.BITS, H = new ma(x, t.endo ? Math.ceil(q / 2) : q);
+  return x.BASE.precompute(8), x;
 }
-function Ta(e) {
+function Ia(e) {
   return Uint8Array.of(e ? 2 : 3);
 }
-function Ia(e, t) {
+function Ra(e, t) {
   const n = e.ORDER;
   let r = ke;
   for (let w = n - Rt; w % ne === ke; w /= ne)
     r += Rt;
   const s = r, i = ne << s - Rt - Rt, o = i * ne, a = (n - Rt) / o, c = (a - Rt) / ne, u = o - Rt, l = i, f = e.pow(t, a), d = e.pow(t, (a + Rt) / ne);
   let p = (w, h) => {
-    let g = f, b = e.pow(h, u), B = e.sqr(b);
-    B = e.mul(B, h);
-    let O = e.mul(w, B);
-    O = e.pow(O, c), O = e.mul(O, b), b = e.mul(O, h), B = e.mul(O, w);
-    let F = e.mul(B, b);
+    let g = f, b = e.pow(h, u), v = e.sqr(b);
+    v = e.mul(v, h);
+    let O = e.mul(w, v);
+    O = e.pow(O, c), O = e.mul(O, b), b = e.mul(O, h), v = e.mul(O, w);
+    let F = e.mul(v, b);
     O = e.pow(F, l);
-    let q = e.eql(O, e.ONE);
-    b = e.mul(B, d), O = e.mul(F, g), B = e.cmov(b, B, q), F = e.cmov(O, F, q);
-    for (let P = s; P > Rt; P--) {
-      let I = P - ne;
-      I = ne << I - Rt;
-      let k = e.pow(F, I);
-      const m = e.eql(k, e.ONE);
-      b = e.mul(B, g), g = e.mul(g, g), k = e.mul(F, g), B = e.cmov(b, B, m), F = e.cmov(k, F, m);
-    }
-    return { isValid: q, value: B };
+    let W = e.eql(O, e.ONE);
+    b = e.mul(v, d), O = e.mul(F, g), v = e.cmov(b, v, W), F = e.cmov(O, F, W);
+    for (let A = s; A > Rt; A--) {
+      let k = A - ne;
+      k = ne << k - Rt;
+      let I = e.pow(F, k);
+      const x = e.eql(I, e.ONE);
+      b = e.mul(v, g), g = e.mul(g, g), I = e.mul(F, g), v = e.cmov(b, v, x), F = e.cmov(I, F, x);
+    }
+    return { isValid: W, value: v };
   };
   if (e.ORDER % Er === Ge) {
     const w = (e.ORDER - Ge) / Er, h = e.sqrt(e.neg(t));
     p = (g, b) => {
-      let B = e.sqr(b);
+      let v = e.sqr(b);
       const O = e.mul(g, b);
-      B = e.mul(B, O);
-      let F = e.pow(B, w);
+      v = e.mul(v, O);
+      let F = e.pow(v, w);
       F = e.mul(F, O);
-      const q = e.mul(F, h), P = e.mul(e.sqr(F), b), I = e.eql(P, g);
-      let k = e.cmov(q, F, I);
-      return { isValid: I, value: k };
+      const W = e.mul(F, h), A = e.mul(e.sqr(F), b), k = e.eql(A, g);
+      let I = e.cmov(W, F, k);
+      return { isValid: k, value: I };
     };
   }
   return p;
@@ -1361,7 +1361,7 @@ function Ti(e, t) {
   const { A: n, B: r, Z: s } = t;
   if (!e.isValid(n) || !e.isValid(r) || !e.isValid(s))
     throw new Error("mapToCurveSimpleSWU: invalid opts");
-  const i = Ia(e, s);
+  const i = Ra(e, s);
   if (!e.isOdd)
     throw new Error("Field does not have .isOdd()");
   return (o) => {
@@ -1371,11 +1371,11 @@ function Ti(e, t) {
     w = e.mul(a, o), w = e.mul(w, g), p = e.cmov(p, u, h), w = e.cmov(w, g, h);
     const b = e.isOdd(o) === e.isOdd(w);
     w = e.cmov(e.neg(w), w, b);
-    const B = Ae(e, [l], !0)[0];
-    return p = e.mul(p, B), { x: p, y: w };
+    const v = Ae(e, [l], !0)[0];
+    return p = e.mul(p, v), { x: p, y: w };
   };
 }
-function Ra(e, t) {
+function ka(e, t) {
   return {
     secretKey: t.BYTES,
     publicKey: 1 + e.BYTES,
@@ -1384,78 +1384,78 @@ function Ra(e, t) {
     signature: 2 * t.BYTES
   };
 }
-const ka = BigInt(0), On = BigInt(1), is = BigInt(2), He = BigInt(3);
-function Na(e) {
+const Na = BigInt(0), On = BigInt(1), is = BigInt(2), He = BigInt(3);
+function Ca(e) {
   const t = [];
   for (; e > On; e >>= On)
-    (e & On) === ka ? t.unshift(0) : (e & He) === He ? (t.unshift(-1), e += On) : t.unshift(1);
+    (e & On) === Na ? t.unshift(0) : (e & He) === He ? (t.unshift(-1), e += On) : t.unshift(1);
   return t;
 }
 function hr(e) {
   if (!Array.isArray(e) || e.length === 0)
     throw new Error("expected non-empty array");
 }
-function Ca(e, t, n, r) {
+function $a(e, t, n, r) {
   const { Fr: s, Fp2: i, Fp12: o } = e, { twistType: a, ateLoopSize: c, postPrecompute: u } = r;
   let l;
   if (a === "multiplicative")
-    l = (P, I, k, m, D, V) => o.mul014(m, P, i.mul(I, D), i.mul(k, V));
+    l = (A, k, I, x, q, H) => o.mul014(x, A, i.mul(k, q), i.mul(I, H));
   else if (a === "divisive")
-    l = (P, I, k, m, D, V) => o.mul034(m, i.mul(k, V), i.mul(I, D), P);
+    l = (A, k, I, x, q, H) => o.mul034(x, i.mul(I, H), i.mul(k, q), A);
   else
     throw new Error("bls: unknown twist type");
   const f = i.div(i.ONE, i.mul(i.ONE, is));
-  function d(P, I, k, m) {
-    const D = i.sqr(k), V = i.sqr(m), U = i.mulByB(i.mul(V, He)), y = i.mul(U, He), x = i.sub(i.sub(i.sqr(i.add(k, m)), V), D), v = i.sub(U, D), N = i.mul(i.sqr(I), He), A = i.neg(x);
-    return P.push([v, N, A]), I = i.mul(i.mul(i.mul(i.sub(D, y), I), k), f), k = i.sub(i.sqr(i.mul(i.add(D, y), f)), i.mul(i.sqr(U), He)), m = i.mul(D, x), { Rx: I, Ry: k, Rz: m };
-  }
-  function p(P, I, k, m, D, V) {
-    const U = i.sub(k, i.mul(V, m)), y = i.sub(I, i.mul(D, m)), x = i.sub(i.mul(U, D), i.mul(y, V)), v = i.neg(U), N = y;
-    P.push([x, v, N]);
-    const A = i.sqr(y), $ = i.mul(A, y), M = i.mul(A, I), L = i.add(i.sub($, i.mul(M, is)), i.mul(i.sqr(U), m));
-    return I = i.mul(y, L), k = i.sub(i.mul(i.sub(M, L), U), i.mul($, k)), m = i.mul(m, $), { Rx: I, Ry: k, Rz: m };
-  }
-  const w = Na(c), h = xr((P) => {
-    const I = P, { x: k, y: m } = I.toAffine(), D = k, V = m, U = i.neg(m);
-    let y = D, x = V, v = i.ONE;
+  function d(A, k, I, x) {
+    const q = i.sqr(I), H = i.sqr(x), U = i.mulByB(i.mul(H, He)), y = i.mul(U, He), _ = i.sub(i.sub(i.sqr(i.add(I, x)), H), q), B = i.sub(U, q), N = i.mul(i.sqr(k), He), P = i.neg(_);
+    return A.push([B, N, P]), k = i.mul(i.mul(i.mul(i.sub(q, y), k), I), f), I = i.sub(i.sqr(i.mul(i.add(q, y), f)), i.mul(i.sqr(U), He)), x = i.mul(q, _), { Rx: k, Ry: I, Rz: x };
+  }
+  function p(A, k, I, x, q, H) {
+    const U = i.sub(I, i.mul(H, x)), y = i.sub(k, i.mul(q, x)), _ = i.sub(i.mul(U, q), i.mul(y, H)), B = i.neg(U), N = y;
+    A.push([_, B, N]);
+    const P = i.sqr(y), $ = i.mul(P, y), D = i.mul(P, k), L = i.add(i.sub($, i.mul(D, is)), i.mul(i.sqr(U), x));
+    return k = i.mul(y, L), I = i.sub(i.mul(i.sub(D, L), U), i.mul($, I)), x = i.mul(x, $), { Rx: k, Ry: I, Rz: x };
+  }
+  const w = Ca(c), h = _r((A) => {
+    const k = A, { x: I, y: x } = k.toAffine(), q = I, H = x, U = i.neg(x);
+    let y = q, _ = H, B = i.ONE;
     const N = [];
-    for (const A of w) {
+    for (const P of w) {
       const $ = [];
-      ({ Rx: y, Ry: x, Rz: v } = d($, y, x, v)), A && ({ Rx: y, Ry: x, Rz: v } = p($, y, x, v, D, A === -1 ? U : V)), N.push($);
+      ({ Rx: y, Ry: _, Rz: B } = d($, y, _, B)), P && ({ Rx: y, Ry: _, Rz: B } = p($, y, _, B, q, P === -1 ? U : H)), N.push($);
     }
     if (u) {
-      const A = N[N.length - 1];
-      u(y, x, v, D, V, p.bind(null, A));
+      const P = N[N.length - 1];
+      u(y, _, B, q, H, p.bind(null, P));
     }
     return N;
   });
-  function g(P, I = !1) {
-    let k = o.ONE;
-    if (P.length) {
-      const m = P[0][0].length;
-      for (let D = 0; D < m; D++) {
-        k = o.sqr(k);
-        for (const [V, U, y] of P)
-          for (const [x, v, N] of V[D])
-            k = l(x, v, N, k, U, y);
+  function g(A, k = !1) {
+    let I = o.ONE;
+    if (A.length) {
+      const x = A[0][0].length;
+      for (let q = 0; q < x; q++) {
+        I = o.sqr(I);
+        for (const [H, U, y] of A)
+          for (const [_, B, N] of H[q])
+            I = l(_, B, N, I, U, y);
       }
     }
-    return k = o.conjugate(k), I ? o.finalExponentiate(k) : k;
+    return I = o.conjugate(I), k ? o.finalExponentiate(I) : I;
   }
-  function b(P, I = !0) {
-    const k = [];
-    Mn(t, P.map(({ g1: m }) => m)), Mn(n, P.map(({ g2: m }) => m));
-    for (const { g1: m, g2: D } of P) {
-      if (m.is0() || D.is0())
+  function b(A, k = !0) {
+    const I = [];
+    Mn(t, A.map(({ g1: x }) => x)), Mn(n, A.map(({ g2: x }) => x));
+    for (const { g1: x, g2: q } of A) {
+      if (x.is0() || q.is0())
         throw new Error("pairing is not available for ZERO point");
-      m.assertValidity(), D.assertValidity();
-      const V = m.toAffine();
-      k.push([h(D), V.x, V.y]);
+      x.assertValidity(), q.assertValidity();
+      const H = x.toAffine();
+      I.push([h(q), H.x, H.y]);
     }
-    return g(k, I);
+    return g(I, k);
   }
-  function B(P, I, k = !0) {
-    return b([{ g1: P, g2: I }], k);
+  function v(A, k, I = !0) {
+    return b([{ g1: A, g2: k }], I);
   }
   const O = {
     seed: bi(s.ORDER)
@@ -1466,10 +1466,10 @@ function Ca(e, t, n, r) {
     Fp12: o,
     // NOTE: we re-export Fp12 here because pairing results are Fp12!
     millerLoopBatch: g,
-    pairing: B,
+    pairing: v,
     pairingBatch: b,
     calcPairingPrecomputes: h,
-    randomSecretKey: (P = F(O.seed)) => (lt(P, O.seed, "seed"), mi(P, s.ORDER))
+    randomSecretKey: (A = F(O.seed)) => (lt(A, O.seed, "seed"), mi(A, s.ORDER))
   };
 }
 function os(e, t, n, r, s, i) {
@@ -1512,20 +1512,20 @@ function os(e, t, n, r, s, i) {
     sign(h, g, b) {
       if (b != null)
         throw new Error("sign() expects 2 arguments");
-      const B = t.Fn.fromBytes(g);
-      return p(h).assertValidity(), h.multiply(B);
+      const v = t.Fn.fromBytes(g);
+      return p(h).assertValidity(), h.multiply(v);
     },
     // Checks if pairing of public key & hash is equal to pairing of generator & signature.
     // e(P, H(m)) == e(G, S)
     // e(S, G) == e(H(m), P)
-    verify(h, g, b, B) {
-      if (B != null)
+    verify(h, g, b, v) {
+      if (v != null)
         throw new Error("verify() expects 3 arguments");
       h = d(h), b = f(b);
-      const O = b.negate(), F = t.BASE, q = p(g), P = h;
+      const O = b.negate(), F = t.BASE, W = p(g), A = h;
       try {
-        const I = c([w(O, q), w(F, P)]);
-        return a.eql(I, a.ONE);
+        const k = c([w(O, W), w(F, A)]);
+        return a.eql(k, a.ONE);
       } catch {
         return !1;
       }
@@ -1535,19 +1535,19 @@ function os(e, t, n, r, s, i) {
     // TODO: maybe `{message: G2Hex, publicKey: G1Hex}[]` instead?
     verifyBatch(h, g) {
       hr(g);
-      const b = d(h), B = g.map((I) => I.message), O = g.map((I) => f(I.publicKey)), F = /* @__PURE__ */ new Map();
-      for (let I = 0; I < O.length; I++) {
-        const k = O[I], m = B[I];
-        let D = F.get(m);
-        D === void 0 && (D = [], F.set(m, D)), D.push(k);
+      const b = d(h), v = g.map((k) => k.message), O = g.map((k) => f(k.publicKey)), F = /* @__PURE__ */ new Map();
+      for (let k = 0; k < O.length; k++) {
+        const I = O[k], x = v[k];
+        let q = F.get(x);
+        q === void 0 && (q = [], F.set(x, q)), q.push(I);
       }
-      const q = [], P = t.BASE;
+      const W = [], A = t.BASE;
       try {
-        for (const [I, k] of F) {
-          const m = k.reduce((D, V) => D.add(V));
-          q.push(w(m, I));
+        for (const [k, I] of F) {
+          const x = I.reduce((q, H) => q.add(H));
+          W.push(w(x, k));
         }
-        return q.push(w(P.negate(), b)), a.eql(c(q), a.ONE);
+        return W.push(w(A.negate(), b)), a.eql(c(W), a.ONE);
       } catch {
         return !1;
       }
@@ -1556,14 +1556,14 @@ function os(e, t, n, r, s, i) {
     // pk1 + pk2 + pk3 = pkA
     aggregatePublicKeys(h) {
       hr(h), h = h.map((b) => f(b));
-      const g = h.reduce((b, B) => b.add(B), t.ZERO);
+      const g = h.reduce((b, v) => b.add(v), t.ZERO);
       return g.assertValidity(), g;
     },
     // Adds a bunch of signature points together.
     // pk1 + pk2 + pk3 = pkA
     aggregateSignatures(h) {
       hr(h), h = h.map((b) => d(b));
-      const g = h.reduce((b, B) => b.add(B), n.ZERO);
+      const g = h.reduce((b, v) => b.add(v), n.ZERO);
       return g.assertValidity(), g;
     },
     hash(h, g) {
@@ -1572,8 +1572,8 @@ function os(e, t, n, r, s, i) {
     Signature: i
   });
 }
-function $a(e, t, n, r) {
-  const { Fp: s, Fr: i, Fp2: o, Fp6: a, Fp12: c } = e, u = { Point: t }, l = { Point: n }, f = Ca(e, t, n, r), { millerLoopBatch: d, pairing: p, pairingBatch: w, calcPairingPrecomputes: h, randomSecretKey: g, lengths: b } = f;
+function La(e, t, n, r) {
+  const { Fp: s, Fr: i, Fp2: o, Fp6: a, Fp12: c } = e, u = { Point: t }, l = { Point: n }, f = $a(e, t, n, r), { millerLoopBatch: d, pairing: p, pairingBatch: w, calcPairingPrecomputes: h, randomSecretKey: g, lengths: b } = f;
   return u.Point.BASE.precompute(4), Object.freeze({
     lengths: b,
     millerLoopBatch: d,
@@ -1592,8 +1592,8 @@ function $a(e, t, n, r) {
     }
   });
 }
-function La(e, t, n, r, s) {
-  const i = $a(e, t, n, r), o = rs(t, s.mapToG1 || ye, {
+function Aa(e, t, n, r, s) {
+  const i = La(e, t, n, r), o = rs(t, s.mapToG1 || ye, {
     ...s.hasherOpts,
     ...s.hasherOptsG1
   }), a = rs(n, s.mapToG2 || ye, {
@@ -1602,8 +1602,8 @@ function La(e, t, n, r, s) {
   });
   return Object.freeze({ ...i, G1: o, G2: a });
 }
-function Aa(e, t, n, r, s, i) {
-  const o = La(e, t, n, r, s), a = {
+function Pa(e, t, n, r, s, i) {
+  const o = Aa(e, t, n, r, s), a = {
     ...o,
     Fr: o.fields.Fr,
     Fp12: o.fields.Fp12,
@@ -1625,7 +1625,7 @@ function Ar(e, t, n, r, s = 1, i) {
   }
   return c;
 }
-function Pa(e, t, n) {
+function Fa(e, t, n) {
   const r = t.pow(n, (e.ORDER - Ve) / cs), s = t.pow(n, (e.ORDER - Ve) / Bt);
   function i(d, p) {
     const w = t.mul(t.frobeniusMap(d, 1), r), h = t.mul(t.frobeniusMap(p, 1), s);
@@ -1649,7 +1649,7 @@ const us = (e, t) => {
   const n = t.map((r) => e.create(r));
   return { c0: n[0], c1: n[1] };
 };
-class Fa {
+class Ua {
   ORDER;
   BITS;
   BYTES;
@@ -1802,7 +1802,7 @@ class Fa {
     };
   }
 }
-class Ua {
+class qa {
   ORDER;
   BITS;
   BYTES;
@@ -1993,7 +1993,7 @@ class Ua {
     };
   }
 }
-class qa {
+class Da {
   ORDER;
   BITS;
   BYTES;
@@ -2205,27 +2205,27 @@ class qa {
   _cyclotomicExp(t, n) {
     let r = this.ONE;
     for (let s = this.X_LEN - 1; s >= 0; s--)
-      r = this._cyclotomicSquare(r), ra(n, s) && (r = this.mul(r, t));
+      r = this._cyclotomicSquare(r), sa(n, s) && (r = this.mul(r, t));
     return r;
   }
 }
-function Da(e) {
-  const t = bn(e.ORDER), n = new Fa(t, e), r = new Ua(n), s = new qa(r, e);
+function Ma(e) {
+  const t = bn(e.ORDER), n = new Ua(t, e), r = new qa(n), s = new Da(r, e);
   return { Fp: t, Fp2: n, Fp6: r, Fp12: s };
 }
-const _t = BigInt(0), Wn = BigInt(1), Ut = BigInt(2), Yn = BigInt(3), un = BigInt(4), _e = BigInt("0xd201000000010000"), Ma = Un(_e), tn = {
+const xt = BigInt(0), Wn = BigInt(1), Ut = BigInt(2), Yn = BigInt(3), un = BigInt(4), xe = BigInt("0xd201000000010000"), Wa = Un(xe), tn = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
-  a: _t,
+  a: xt,
   b: un,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
 }, Pr = bn(tn.n, {
   modFromBytes: !0
-}), { Fp: R, Fp2: H, Fp6: Wa, Fp12: Y } = Da({
+}), { Fp: R, Fp2: V, Fp6: Ga, Fp12: Y } = Ma({
   ORDER: tn.p,
-  X_LEN: Ma,
+  X_LEN: Wa,
   // Finite extension field over irreducible polynominal.
   // Fp(u) / (u² - β) where β = -1
   FP2_NONRESIDUE: [Wn, Wn],
@@ -2234,32 +2234,32 @@ const _t = BigInt(0), Wn = BigInt(1), Ut = BigInt(2), Yn = BigInt(3), un = BigIn
     return { c0: R.sub(n, r), c1: R.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
-    const t = _e, n = Y.div(Y.frobeniusMap(e, 6), e), r = Y.mul(Y.frobeniusMap(n, 2), n), s = Y.conjugate(Y._cyclotomicExp(r, t)), i = Y.mul(Y.conjugate(Y._cyclotomicSquare(r)), s), o = Y.conjugate(Y._cyclotomicExp(i, t)), a = Y.conjugate(Y._cyclotomicExp(o, t)), c = Y.mul(Y.conjugate(Y._cyclotomicExp(a, t)), Y._cyclotomicSquare(s)), u = Y.conjugate(Y._cyclotomicExp(c, t)), l = Y.frobeniusMap(Y.mul(s, a), 2), f = Y.frobeniusMap(Y.mul(o, r), 3), d = Y.frobeniusMap(Y.mul(c, Y.conjugate(r)), 1), p = Y.mul(Y.mul(u, Y.conjugate(i)), r);
+    const t = xe, n = Y.div(Y.frobeniusMap(e, 6), e), r = Y.mul(Y.frobeniusMap(n, 2), n), s = Y.conjugate(Y._cyclotomicExp(r, t)), i = Y.mul(Y.conjugate(Y._cyclotomicSquare(r)), s), o = Y.conjugate(Y._cyclotomicExp(i, t)), a = Y.conjugate(Y._cyclotomicExp(o, t)), c = Y.mul(Y.conjugate(Y._cyclotomicExp(a, t)), Y._cyclotomicSquare(s)), u = Y.conjugate(Y._cyclotomicExp(c, t)), l = Y.frobeniusMap(Y.mul(s, a), 2), f = Y.frobeniusMap(Y.mul(o, r), 3), d = Y.frobeniusMap(Y.mul(c, Y.conjugate(r)), 1), p = Y.mul(Y.mul(u, Y.conjugate(i)), r);
     return Y.mul(Y.mul(Y.mul(l, f), d), p);
   }
-}), { G2psi: ls, G2psi2: Ga } = Pa(R, H, H.div(H.ONE, H.NONRESIDUE)), wr = Object.freeze({
+}), { G2psi: ls, G2psi2: Ha } = Fa(R, V, V.div(V.ONE, V.NONRESIDUE)), wr = Object.freeze({
   DST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
   encodeDST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
   p: R.ORDER,
   m: 2,
   k: 128,
   expand: "xmd",
-  hash: _i
+  hash: xi
 }), Fr = {
-  p: H.ORDER,
+  p: V.ORDER,
   n: tn.n,
   h: BigInt("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5"),
-  a: H.ZERO,
-  b: H.fromBigTuple([un, un]),
-  Gx: H.fromBigTuple([
+  a: V.ZERO,
+  b: V.fromBigTuple([un, un]),
+  Gx: V.fromBigTuple([
     BigInt("0x024aa2b2f08f0a91260805272dc51051c6e47ad4fa403b02b4510b647ae3d1770bac0326a805bbefd48056c8c121bdb8"),
     BigInt("0x13e02b6052719f607dacd3a088274f65596bd0d09920b61ab5da61bbdc7f5049334cf11213945d57e5ac7d055d042b7e")
   ]),
-  Gy: H.fromBigTuple([
+  Gy: V.fromBigTuple([
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, zn = mn(R.toBytes(_t), { infinity: !0, compressed: !0 });
+}, zn = mn(R.toBytes(xt), { infinity: !0, compressed: !0 });
 function Kn(e) {
   e = ci(e);
   const t = e[0] & 224, n = !!(t >> 7 & 1), r = !!(t >> 6 & 1), s = !!(t >> 5 & 1);
@@ -2270,7 +2270,7 @@ function mn(e, t) {
     throw new Error("setMask: non-empty mask");
   return t.compressed && (e[0] |= 128), t.infinity && (e[0] |= 64), t.sort && (e[0] |= 32), e;
 }
-function Ha(e, t, n) {
+function Va(e, t, n) {
   const { BYTES: r, ORDER: s } = R, i = t.is0(), { x: o, y: a } = t.toAffine();
   if (n) {
     if (i)
@@ -2288,14 +2288,14 @@ function gr(e) {
   const i = !!(s * Ut / n);
   return mn(mt(r, t), { compressed: !0, sort: i });
 }
-function Va(e) {
+function Za(e) {
   const { compressed: t, infinity: n, sort: r, value: s } = Kn(e), { BYTES: i, ORDER: o } = R;
   if (s.length === 48 && t) {
     const a = zt(s), c = R.create(a & yn(R.BITS));
     if (n) {
-      if (c !== _t)
+      if (c !== xt)
         throw new Error("invalid G1 point: non-empty, at infinity, with compression");
-      return { x: _t, y: _t };
+      return { x: xt, y: xt };
     }
     const u = R.add(R.pow(c, Yn), R.create(tn.b));
     let l = R.sqrt(u);
@@ -2305,7 +2305,7 @@ function Va(e) {
   } else if (s.length === 96 && !t) {
     const a = zt(s.subarray(0, i)), c = zt(s.subarray(i));
     if (n) {
-      if (a !== _t || c !== _t)
+      if (a !== xt || c !== xt)
         throw new Error("G1: non-empty point at infinity");
       return T.G1.Point.ZERO.toAffine();
     }
@@ -2326,17 +2326,17 @@ function fs(e) {
   const f = i.fromAffine({ x: a, y: u });
   return f.assertValidity(), f;
 }
-function Za(e, t, n) {
+function Ya(e, t, n) {
   const { BYTES: r, ORDER: s } = R, i = t.is0(), { x: o, y: a } = t.toAffine();
   if (n) {
     if (i)
-      return wt(zn, mt(_t, r));
-    const c = !!(a.c1 === _t ? a.c0 * Ut / s : a.c1 * Ut / s);
+      return wt(zn, mt(xt, r));
+    const c = !!(a.c1 === xt ? a.c0 * Ut / s : a.c1 * Ut / s);
     return wt(mn(mt(o.c1, r), { compressed: !0, sort: c }), mt(o.c0, r));
   } else {
     if (i)
       return wt(Uint8Array.of(64), new Uint8Array(4 * r - 1));
-    const { re: c, im: u } = H.reim(o), { re: l, im: f } = H.reim(a);
+    const { re: c, im: u } = V.reim(o), { re: l, im: f } = V.reim(a);
     return wt(mt(u, r), mt(c, r), mt(f, r), mt(l, r));
   }
 }
@@ -2344,11 +2344,11 @@ function yr(e) {
   e.assertValidity();
   const { BYTES: t } = R;
   if (e.is0())
-    return wt(zn, mt(_t, t));
-  const { x: n, y: r } = e.toAffine(), { re: s, im: i } = H.reim(n), { re: o, im: a } = H.reim(r), u = !!((a > _t ? a * Ut : o * Ut) / R.ORDER & Wn), l = s;
+    return wt(zn, mt(xt, t));
+  const { x: n, y: r } = e.toAffine(), { re: s, im: i } = V.reim(n), { re: o, im: a } = V.reim(r), u = !!((a > xt ? a * Ut : o * Ut) / R.ORDER & Wn), l = s;
   return wt(mn(mt(i, t), { sort: u, compressed: !0 }), mt(l, t));
 }
-function Ya(e) {
+function za(e) {
   const { BYTES: t, ORDER: n } = R, { compressed: r, infinity: s, sort: i, value: o } = Kn(e);
   if (!r && !s && i || // 00100000
   !r && s && i || // 01100000
@@ -2359,20 +2359,20 @@ function Ya(e) {
     if (s) {
       if (o.reduce((w, h) => w !== 0 ? h + 1 : h, 0) > 0)
         throw new Error("invalid G2 point: compressed");
-      return { x: H.ZERO, y: H.ZERO };
+      return { x: V.ZERO, y: V.ZERO };
     }
-    const c = a(o, 0, t), u = a(o, t, 2 * t), l = H.create({ c0: R.create(u), c1: R.create(c) }), f = H.add(H.pow(l, Yn), Fr.b);
-    let d = H.sqrt(f);
-    const p = d.c1 === _t ? d.c0 * Ut / n : d.c1 * Ut / n ? Wn : _t;
-    return d = i && p > 0 ? d : H.neg(d), { x: l, y: d };
+    const c = a(o, 0, t), u = a(o, t, 2 * t), l = V.create({ c0: R.create(u), c1: R.create(c) }), f = V.add(V.pow(l, Yn), Fr.b);
+    let d = V.sqrt(f);
+    const p = d.c1 === xt ? d.c0 * Ut / n : d.c1 * Ut / n ? Wn : xt;
+    return d = i && p > 0 ? d : V.neg(d), { x: l, y: d };
   } else if (o.length === 192 && !r) {
     if (s) {
       if (o.reduce((d, p) => d !== 0 ? p + 1 : p, 0) > 0)
         throw new Error("invalid G2 point: uncompressed");
-      return { x: H.ZERO, y: H.ZERO };
+      return { x: V.ZERO, y: V.ZERO };
     }
     const c = a(o, 0 * t, 1 * t), u = a(o, 1 * t, 2 * t), l = a(o, 2 * t, 3 * t), f = a(o, 3 * t, 4 * t);
-    return { x: H.fromBigTuple([u, c]), y: H.fromBigTuple([f, l]) };
+    return { x: V.fromBigTuple([u, c]), y: V.fromBigTuple([f, l]) };
   } else
     throw new Error("invalid G2 point: expected 96/192 bytes");
 }
@@ -2383,16 +2383,16 @@ function ds(e) {
   const a = zt(s.slice(0, o)), c = zt(s.slice(o));
   if (n)
     return i.ZERO;
-  const u = R.create(a & yn(R.BITS)), l = R.create(c), f = H.create({ c0: l, c1: u }), d = H.add(H.pow(f, Yn), Fr.b);
-  let p = H.sqrt(d);
+  const u = R.create(a & yn(R.BITS)), l = R.create(c), f = V.create({ c0: l, c1: u }), d = V.add(V.pow(f, Yn), Fr.b);
+  let p = V.sqrt(d);
   if (!p)
     throw new Error("Failed to find a square root");
-  const { re: w, im: h } = H.reim(p), g = BigInt(r), b = h > _t && h * Ut / t !== g, B = h === _t && w * Ut / t !== g;
-  (b || B) && (p = H.neg(p));
+  const { re: w, im: h } = V.reim(p), g = BigInt(r), b = h > xt && h * Ut / t !== g, v = h === xt && w * Ut / t !== g;
+  (b || v) && (p = V.neg(p));
   const O = i.fromAffine({ x: f, y: p });
   return O.assertValidity(), O;
 }
-const za = {
+const Ka = {
   ShortSignature: {
     fromBytes(e) {
       return fs(lt(e));
@@ -2427,57 +2427,57 @@ const za = {
       return cn(yr(e));
     }
   }
-}, Ka = {
+}, Xa = {
   Fp: R,
-  Fp2: H,
-  Fp6: Wa,
+  Fp2: V,
+  Fp6: Ga,
   Fp12: Y,
   Fr: Pr
-}, Xa = Oi(tn, {
+}, Ja = Oi(tn, {
   allowInfinityPoint: !0,
   Fn: Pr,
-  fromBytes: Va,
-  toBytes: Ha,
+  fromBytes: Za,
+  toBytes: Va,
   // Checks is the point resides in prime-order subgroup.
   // point.isTorsionFree() should return true for valid points
   // It returns false for shitty points.
   // https://eprint.iacr.org/2021/1130.pdf
   isTorsionFree: (e, t) => {
     const n = BigInt("0x5f19672fdf76ce51ba69c6076a0f77eaddb3a93be6f89688de17d813620a00022e01fffffffefffe"), r = new e(R.mul(t.X, n), t.Y, t.Z);
-    return t.multiplyUnsafe(_e).negate().multiplyUnsafe(_e).equals(r);
+    return t.multiplyUnsafe(xe).negate().multiplyUnsafe(xe).equals(r);
   },
   // Clear cofactor of G1
   // https://eprint.iacr.org/2019/403
-  clearCofactor: (e, t) => t.multiplyUnsafe(_e).add(t)
-}), Ja = Oi(Fr, {
-  Fp: H,
+  clearCofactor: (e, t) => t.multiplyUnsafe(xe).add(t)
+}), ja = Oi(Fr, {
+  Fp: V,
   allowInfinityPoint: !0,
   Fn: Pr,
-  fromBytes: Ya,
-  toBytes: Za,
+  fromBytes: za,
+  toBytes: Ya,
   // https://eprint.iacr.org/2021/1130.pdf
   // Older version: https://eprint.iacr.org/2019/814.pdf
-  isTorsionFree: (e, t) => t.multiplyUnsafe(_e).negate().equals(ls(e, t)),
+  isTorsionFree: (e, t) => t.multiplyUnsafe(xe).negate().equals(ls(e, t)),
   // clear_cofactor_bls12381_g2 from RFC 9380.
   // https://eprint.iacr.org/2017/419.pdf
   // prettier-ignore
   clearCofactor: (e, t) => {
-    const n = _e;
+    const n = xe;
     let r = t.multiplyUnsafe(n).negate(), s = ls(e, t), i = t.double();
-    return i = Ga(e, i), i = i.subtract(s), s = r.add(s), s = s.multiplyUnsafe(n).negate(), i = i.add(s), i = i.subtract(r), i.subtract(t);
+    return i = Ha(e, i), i = i.subtract(s), s = r.add(s), s = s.multiplyUnsafe(n).negate(), i = i.add(s), i = i.subtract(r), i.subtract(t);
   }
-}), ja = {
-  mapToG1: sc,
-  mapToG2: ic,
+}), Qa = {
+  mapToG1: ic,
+  mapToG2: oc,
   hasherOpts: wr,
   hasherOptsG1: { ...wr, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
   hasherOptsG2: { ...wr }
-}, Qa = {
-  ateLoopSize: _e,
+}, tc = {
+  ateLoopSize: xe,
   // The BLS parameter x for BLS12-381
   twistType: "multiplicative",
   randomBytes: si
-}, T = Aa(Ka, Xa, Ja, Qa, ja, za), tc = Bi(H, [
+}, T = Pa(Xa, Ja, ja, tc, Qa, Ka), ec = Bi(V, [
   // xNum
   [
     [
@@ -2546,7 +2546,7 @@ const za = {
     ["0x1", "0x0"]
     // LAST 1
   ]
-].map((e) => e.map((t) => H.fromBigTuple(t.map(BigInt))))), ec = Bi(R, [
+].map((e) => e.map((t) => V.fromBigTuple(t.map(BigInt))))), nc = Bi(R, [
   // xNum
   [
     "0x11a05f2b1e833340b809101dd99815856b303e88a2d7005ff2627b56cdb4e2c85610c2d5f2e62d6eaeac1662734649b7",
@@ -2616,31 +2616,31 @@ const za = {
     "0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001"
     // LAST 1
   ]
-].map((e) => e.map((t) => BigInt(t)))), nc = Ti(R, {
+].map((e) => e.map((t) => BigInt(t)))), rc = Ti(R, {
   A: R.create(BigInt("0x144698a3b8e9433d693a02c96d4982b0ea985383ee66a8d8e8981aefd881ac98936f8da0e0f97f5cf428082d584c1d")),
   B: R.create(BigInt("0x12e2908d11688030018b12e8753eee3b2016c1f0f24f4070a0b9c14fcef35ef55a23215a316ceaa5d1cc48e98e172be0")),
   Z: R.create(BigInt(11))
-}), rc = Ti(H, {
-  A: H.create({ c0: R.create(_t), c1: R.create(BigInt(240)) }),
+}), sc = Ti(V, {
+  A: V.create({ c0: R.create(xt), c1: R.create(BigInt(240)) }),
   // A' = 240 * I
-  B: H.create({ c0: R.create(BigInt(1012)), c1: R.create(BigInt(1012)) }),
+  B: V.create({ c0: R.create(BigInt(1012)), c1: R.create(BigInt(1012)) }),
   // B' = 1012 * (1 + I)
-  Z: H.create({ c0: R.create(BigInt(-2)), c1: R.create(BigInt(-1)) })
+  Z: V.create({ c0: R.create(BigInt(-2)), c1: R.create(BigInt(-1)) })
   // Z: -(2 + I)
 });
-function sc(e) {
-  const { x: t, y: n } = nc(R.create(e[0]));
-  return ec(t, n);
-}
 function ic(e) {
-  const { x: t, y: n } = rc(H.fromBigTuple(e));
-  return tc(t, n);
+  const { x: t, y: n } = rc(R.create(e[0]));
+  return nc(t, n);
+}
+function oc(e) {
+  const { x: t, y: n } = sc(V.fromBigTuple(e));
+  return ec(t, n);
 }
-function oc(e, t, n) {
+function ac(e, t, n) {
   return kr(e), n === void 0 && (n = new Uint8Array(e.outputLen)), Lr(e, n, t);
 }
 const br = /* @__PURE__ */ Uint8Array.of(0), ps = /* @__PURE__ */ Uint8Array.of();
-function ac(e, t, n, r = 32) {
+function cc(e, t, n, r = 32) {
   kr(e), Xe(r, "length");
   const s = e.outputLen;
   if (r > 255 * s)
@@ -2652,8 +2652,8 @@ function ac(e, t, n, r = 32) {
     br[0] = l + 1, c.update(l === 0 ? ps : u).update(n).update(br).digestInto(u), o.set(u, s * l), a._cloneInto(c);
   return a.destroy(), c.destroy(), an(u, br), o.slice(0, r);
 }
-const cc = (e, t, n, r, s) => ac(e, oc(e, t, n), r, s), uc = "6.16.0";
-function lc(e, t, n) {
+const uc = (e, t, n, r, s) => cc(e, ac(e, t, n), r, s), lc = "6.16.0";
+function fc(e, t, n) {
   const r = t.split("|").map((i) => i.trim());
   for (let i = 0; i < r.length; i++)
     switch (t) {
@@ -2673,7 +2673,7 @@ function st(e, t, n) {
   for (let r in t) {
     let s = t[r];
     const i = n ? n[r] : null;
-    i && lc(s, i, r), Object.defineProperty(e, r, { enumerable: !0, value: s, writable: !1 });
+    i && fc(s, i, r), Object.defineProperty(e, r, { enumerable: !0, value: s, writable: !1 });
   }
 }
 function Ze(e, t) {
@@ -2728,7 +2728,7 @@ function Ii(e, t, n) {
         i.push(o + "=" + Ze(a));
       }
     }
-    i.push(`code=${t}`), i.push(`version=${uc}`), i.length && (e += " (" + i.join(", ") + ")");
+    i.push(`code=${t}`), i.push(`version=${lc}`), i.length && (e += " (" + i.join(", ") + ")");
   }
   let s;
   switch (t) {
@@ -2748,7 +2748,7 @@ function ct(e, t, n, r) {
   if (!e)
     throw Ii(t, n, r);
 }
-function _(e, t, n, r) {
+function m(e, t, n, r) {
   ct(e, t, "INVALID_ARGUMENT", { argument: n, value: r });
 }
 function Ri(e, t, n) {
@@ -2789,7 +2789,7 @@ function ki(e, t, n) {
       r[i] = parseInt(e.substring(s, s + 2), 16), s += 2;
     return r;
   }
-  _(!1, "invalid BytesLike value", t || "value", e);
+  m(!1, "invalid BytesLike value", t || "value", e);
 }
 function yt(e, t) {
   return ki(e, t, !1);
@@ -2810,10 +2810,10 @@ function bt(e) {
   }
   return n;
 }
-function xe(e) {
+function _e(e) {
   return "0x" + e.map((t) => bt(t).substring(2)).join("");
 }
-function fc(e) {
+function dc(e) {
   return on(e, !0) ? (e.length - 2) / 2 : yt(e).length;
 }
 function Me(e, t, n) {
@@ -2840,10 +2840,10 @@ function $n(e, t) {
 function Ci(e, t) {
   return Ni(e, t, !1);
 }
-const _n = BigInt(0), Mt = BigInt(1), Ye = 9007199254740991;
-function dc(e, t) {
+const xn = BigInt(0), Mt = BigInt(1), Ye = 9007199254740991;
+function pc(e, t) {
   const n = Xn(e, "value"), r = BigInt(Ee(t, "width"));
-  if (ct(n >> r === _n, "overflow", "NUMERIC_FAULT", {
+  if (ct(n >> r === xn, "overflow", "NUMERIC_FAULT", {
     operation: "fromTwos",
     fault: "overflow",
     value: e
@@ -2856,7 +2856,7 @@ function dc(e, t) {
 function $i(e, t) {
   let n = en(e, "value");
   const r = BigInt(Ee(t, "width")), s = Mt << r - Mt;
-  if (n < _n) {
+  if (n < xn) {
     n = -n, ct(n <= s, "too low", "NUMERIC_FAULT", {
       operation: "toTwos",
       fault: "overflow",
@@ -2881,21 +2881,21 @@ function en(e, t) {
     case "bigint":
       return e;
     case "number":
-      return _(Number.isInteger(e), "underflow", t || "value", e), _(e >= -Ye && e <= Ye, "overflow", t || "value", e), BigInt(e);
+      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -Ye && e <= Ye, "overflow", t || "value", e), BigInt(e);
     case "string":
       try {
         if (e === "")
           throw new Error("empty string");
         return e[0] === "-" && e[1] !== "-" ? -BigInt(e.substring(1)) : BigInt(e);
       } catch (n) {
-        _(!1, `invalid BigNumberish string: ${n.message}`, t || "value", e);
+        m(!1, `invalid BigNumberish string: ${n.message}`, t || "value", e);
       }
   }
-  _(!1, "invalid BigNumberish value", t || "value", e);
+  m(!1, "invalid BigNumberish value", t || "value", e);
 }
 function Xn(e, t) {
   const n = en(e, t);
-  return ct(n >= _n, "unsigned value cannot be negative", "NUMERIC_FAULT", {
+  return ct(n >= xn, "unsigned value cannot be negative", "NUMERIC_FAULT", {
     fault: "overflow",
     operation: "getUint",
     value: e
@@ -2914,21 +2914,21 @@ function Li(e) {
 function Ee(e, t) {
   switch (typeof e) {
     case "bigint":
-      return _(e >= -Ye && e <= Ye, "overflow", t || "value", e), Number(e);
+      return m(e >= -Ye && e <= Ye, "overflow", t || "value", e), Number(e);
     case "number":
-      return _(Number.isInteger(e), "underflow", t || "value", e), _(e >= -Ye && e <= Ye, "overflow", t || "value", e), e;
+      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -Ye && e <= Ye, "overflow", t || "value", e), e;
     case "string":
       try {
         if (e === "")
           throw new Error("empty string");
         return Ee(BigInt(e), t);
       } catch (n) {
-        _(!1, `invalid numeric string: ${n.message}`, t || "value", e);
+        m(!1, `invalid numeric string: ${n.message}`, t || "value", e);
       }
   }
-  _(!1, "invalid numeric value", t || "value", e);
+  m(!1, "invalid numeric value", t || "value", e);
 }
-function pc(e) {
+function hc(e) {
   return Ee(Li(e));
 }
 function Ai(e, t) {
@@ -2938,7 +2938,7 @@ function Ai(e, t) {
     r.length % 2 && (r = "0" + r);
   else {
     const s = Ee(t, "width");
-    if (s === 0 && n === _n)
+    if (s === 0 && n === xn)
       return "0x";
     for (ct(s * 2 >= r.length, `value exceeds width (${s} bytes)`, "NUMERIC_FAULT", {
       operation: "toBeHex",
@@ -2951,7 +2951,7 @@ function Ai(e, t) {
 }
 function Pi(e, t) {
   const n = Xn(e, "value");
-  if (n === _n)
+  if (n === xn)
     return new Uint8Array(0);
   let r = n.toString(16);
   r.length % 2 && (r = "0" + r);
@@ -2962,8 +2962,8 @@ function Pi(e, t) {
   }
   return s;
 }
-function hc(e, t, n, r, s) {
-  _(!1, `invalid codepoint at offset ${t}; ${e}`, "bytes", n);
+function wc(e, t, n, r, s) {
+  m(!1, `invalid codepoint at offset ${t}; ${e}`, "bytes", n);
 }
 function Fi(e, t, n, r, s) {
   if (e === "BAD_PREFIX" || e === "UNEXPECTED_CONTINUE") {
@@ -2974,16 +2974,16 @@ function Fi(e, t, n, r, s) {
   }
   return e === "OVERRUN" ? n.length - t - 1 : 0;
 }
-function wc(e, t, n, r, s) {
-  return e === "OVERLONG" ? (_(typeof s == "number", "invalid bad code point for replacement", "badCodepoint", s), r.push(s), 0) : (r.push(65533), Fi(e, t, n));
+function gc(e, t, n, r, s) {
+  return e === "OVERLONG" ? (m(typeof s == "number", "invalid bad code point for replacement", "badCodepoint", s), r.push(s), 0) : (r.push(65533), Fi(e, t, n));
 }
-const gc = Object.freeze({
-  error: hc,
+const yc = Object.freeze({
+  error: wc,
   ignore: Fi,
-  replace: wc
+  replace: gc
 });
-function yc(e, t) {
-  t == null && (t = gc.error);
+function bc(e, t) {
+  t == null && (t = yc.error);
   const n = yt(e, "bytes"), r = [];
   let s = 0;
   for (; s < n.length; ) {
@@ -3035,7 +3035,7 @@ function yc(e, t) {
   return r;
 }
 function qr(e, t) {
-  _(typeof e == "string", "invalid string value", "str", e);
+  m(typeof e == "string", "invalid string value", "str", e);
   let n = [];
   for (let r = 0; r < e.length; r++) {
     const s = e.charCodeAt(r);
@@ -3046,7 +3046,7 @@ function qr(e, t) {
     else if ((s & 64512) == 55296) {
       r++;
       const i = e.charCodeAt(r);
-      _(r < e.length && (i & 64512) === 56320, "invalid surrogate pair", "str", e);
+      m(r < e.length && (i & 64512) === 56320, "invalid surrogate pair", "str", e);
       const o = 65536 + ((s & 1023) << 10) + (i & 1023);
       n.push(o >> 18 | 240), n.push(o >> 12 & 63 | 128), n.push(o >> 6 & 63 | 128), n.push(o & 63 | 128);
     } else
@@ -3054,11 +3054,11 @@ function qr(e, t) {
   }
   return new Uint8Array(n);
 }
-function bc(e) {
+function mc(e) {
   return e.map((t) => t <= 65535 ? String.fromCharCode(t) : (t -= 65536, String.fromCharCode((t >> 10 & 1023) + 55296, (t & 1023) + 56320))).join("");
 }
-function mc(e, t) {
-  return bc(yc(e, t));
+function xc(e, t) {
+  return mc(bc(e, t));
 }
 const vt = 32, Sr = new Uint8Array(vt), _c = ["then"], In = {}, Ui = /* @__PURE__ */ new WeakMap();
 function Te(e) {
@@ -3207,7 +3207,7 @@ class ie extends Array {
 }
 function bs(e) {
   let t = Pi(e);
-  return ct(t.length <= vt, "value out-of-bounds", "BUFFER_OVERRUN", { buffer: t, length: vt, offset: t.length }), t.length !== vt && (t = Kt(xe([Sr.slice(t.length % vt), t]))), t;
+  return ct(t.length <= vt, "value out-of-bounds", "BUFFER_OVERRUN", { buffer: t, length: vt, offset: t.length }), t.length !== vt && (t = Kt(_e([Sr.slice(t.length % vt), t]))), t;
 }
 class fe {
   // The coder name:
@@ -3232,7 +3232,7 @@ class fe {
     });
   }
   _throwError(t, n) {
-    _(!1, t, this.localName, n);
+    m(!1, t, this.localName, n);
   }
 }
 class vr {
@@ -3243,7 +3243,7 @@ class vr {
     this.#t = [], this.#e = 0;
   }
   get data() {
-    return xe(this.#t);
+    return _e(this.#t);
   }
   get length() {
     return this.#e;
@@ -3258,7 +3258,7 @@ class vr {
   writeBytes(t) {
     let n = Kt(t);
     const r = n.length % vt;
-    return r && (n = Kt(xe([n, Sr.slice(r)]))), this.#n(n);
+    return r && (n = Kt(_e([n, Sr.slice(r)]))), this.#n(n);
   }
   // Numeric item; pad on the left *to* WordSize
   writeValue(t) {
@@ -3335,7 +3335,7 @@ class Dr {
     return Li(this.readBytes(vt));
   }
   readIndex() {
-    return pc(this.readBytes(vt));
+    return hc(this.readBytes(vt));
   }
 }
 function ms(e) {
@@ -3348,63 +3348,63 @@ function qi(e, ...t) {
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function _s(e, t = !0) {
+function xs(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function xc(e, t) {
+function Ec(e, t) {
   qi(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const Ec = (e) => e instanceof Uint8Array, Sc = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Bc = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!Bc)
+const Sc = (e) => e instanceof Uint8Array, Bc = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), vc = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!vc)
   throw new Error("Non little-endian hardware is not supported");
-function vc(e) {
+function Oc(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Di(e) {
-  if (typeof e == "string" && (e = vc(e)), !Ec(e))
+  if (typeof e == "string" && (e = Oc(e)), !Sc(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-class Oc {
+class Tc {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function Tc(e) {
+function Ic(e) {
   const t = (r) => e().update(Di(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-const Rn = /* @__PURE__ */ BigInt(2 ** 32 - 1), xs = /* @__PURE__ */ BigInt(32);
-function Ic(e, t = !1) {
-  return t ? { h: Number(e & Rn), l: Number(e >> xs & Rn) } : { h: Number(e >> xs & Rn) | 0, l: Number(e & Rn) | 0 };
-}
+const Rn = /* @__PURE__ */ BigInt(2 ** 32 - 1), _s = /* @__PURE__ */ BigInt(32);
 function Rc(e, t = !1) {
+  return t ? { h: Number(e & Rn), l: Number(e >> _s & Rn) } : { h: Number(e >> _s & Rn) | 0, l: Number(e & Rn) | 0 };
+}
+function kc(e, t = !1) {
   let n = new Uint32Array(e.length), r = new Uint32Array(e.length);
   for (let s = 0; s < e.length; s++) {
-    const { h: i, l: o } = Ic(e[s], t);
+    const { h: i, l: o } = Rc(e[s], t);
     [n[s], r[s]] = [i, o];
   }
   return [n, r];
 }
-const kc = (e, t, n) => e << n | t >>> 32 - n, Nc = (e, t, n) => t << n | e >>> 32 - n, Cc = (e, t, n) => t << n - 32 | e >>> 64 - n, $c = (e, t, n) => e << n - 32 | t >>> 64 - n, [Mi, Wi, Gi] = [[], [], []], Lc = /* @__PURE__ */ BigInt(0), sn = /* @__PURE__ */ BigInt(1), Ac = /* @__PURE__ */ BigInt(2), Pc = /* @__PURE__ */ BigInt(7), Fc = /* @__PURE__ */ BigInt(256), Uc = /* @__PURE__ */ BigInt(113);
+const Nc = (e, t, n) => e << n | t >>> 32 - n, Cc = (e, t, n) => t << n | e >>> 32 - n, $c = (e, t, n) => t << n - 32 | e >>> 64 - n, Lc = (e, t, n) => e << n - 32 | t >>> 64 - n, [Mi, Wi, Gi] = [[], [], []], Ac = /* @__PURE__ */ BigInt(0), sn = /* @__PURE__ */ BigInt(1), Pc = /* @__PURE__ */ BigInt(2), Fc = /* @__PURE__ */ BigInt(7), Uc = /* @__PURE__ */ BigInt(256), qc = /* @__PURE__ */ BigInt(113);
 for (let e = 0, t = sn, n = 1, r = 0; e < 24; e++) {
   [n, r] = [r, (2 * n + 3 * r) % 5], Mi.push(2 * (5 * r + n)), Wi.push((e + 1) * (e + 2) / 2 % 64);
-  let s = Lc;
+  let s = Ac;
   for (let i = 0; i < 7; i++)
-    t = (t << sn ^ (t >> Pc) * Uc) % Fc, t & Ac && (s ^= sn << (sn << /* @__PURE__ */ BigInt(i)) - sn);
+    t = (t << sn ^ (t >> Fc) * qc) % Uc, t & Pc && (s ^= sn << (sn << /* @__PURE__ */ BigInt(i)) - sn);
   Gi.push(s);
 }
-const [qc, Dc] = /* @__PURE__ */ Rc(Gi, !0), Es = (e, t, n) => n > 32 ? Cc(e, t, n) : kc(e, t, n), Ss = (e, t, n) => n > 32 ? $c(e, t, n) : Nc(e, t, n);
-function Mc(e, t = 24) {
+const [Dc, Mc] = /* @__PURE__ */ kc(Gi, !0), Es = (e, t, n) => n > 32 ? $c(e, t, n) : Nc(e, t, n), Ss = (e, t, n) => n > 32 ? Lc(e, t, n) : Cc(e, t, n);
+function Wc(e, t = 24) {
   const n = new Uint32Array(10);
   for (let r = 24 - t; r < 24; r++) {
     for (let o = 0; o < 10; o++)
@@ -3425,22 +3425,22 @@ function Mc(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[o + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= qc[r], e[1] ^= Dc[r];
+    e[0] ^= Dc[r], e[1] ^= Mc[r];
   }
   n.fill(0);
 }
-class Mr extends Oc {
+class Mr extends Tc {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, r, s = !1, i = 24) {
     if (super(), this.blockLen = t, this.suffix = n, this.outputLen = r, this.enableXOF = s, this.rounds = i, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, ms(r), 0 >= this.blockLen || this.blockLen >= 200)
       throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = Sc(this.state);
+    this.state = new Uint8Array(200), this.state32 = Bc(this.state);
   }
   keccak() {
-    Mc(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
+    Wc(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    _s(this);
+    xs(this);
     const { blockLen: n, state: r } = this;
     t = Di(t);
     const s = t.length;
@@ -3460,7 +3460,7 @@ class Mr extends Oc {
     t[r] ^= n, (n & 128) !== 0 && r === s - 1 && this.keccak(), t[s - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    _s(this, !1), qi(t), this.finish();
+    xs(this, !1), qi(t), this.finish();
     const n = this.state, { blockLen: r } = this;
     for (let s = 0, i = t.length; s < i; ) {
       this.posOut >= r && this.keccak();
@@ -3478,7 +3478,7 @@ class Mr extends Oc {
     return ms(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (xc(t, this), this.finished)
+    if (Ec(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -3493,10 +3493,10 @@ class Mr extends Oc {
     return t || (t = new Mr(n, r, s, o, i)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = i, t.suffix = r, t.outputLen = s, t.enableXOF = o, t.destroyed = this.destroyed, t;
   }
 }
-const Wc = (e, t, n) => Tc(() => new Mr(t, e, n)), Gc = /* @__PURE__ */ Wc(1, 136, 256 / 8);
+const Gc = (e, t, n) => Ic(() => new Mr(t, e, n)), Hc = /* @__PURE__ */ Gc(1, 136, 256 / 8);
 let Hi = !1;
 const Vi = function(e) {
-  return Gc(e);
+  return Hc(e);
 };
 let Zi = Vi;
 function tt(e) {
@@ -3513,7 +3513,7 @@ tt.register = function(e) {
   Zi = e;
 };
 Object.freeze(tt);
-const Hc = BigInt(0), Vc = BigInt(36);
+const Vc = BigInt(0), Zc = BigInt(36);
 function Bs(e) {
   e = e.toLowerCase();
   const t = e.substring(2).split(""), n = new Uint8Array(40);
@@ -3530,7 +3530,7 @@ for (let e = 0; e < 10; e++)
 for (let e = 0; e < 26; e++)
   Wr[String.fromCharCode(65 + e)] = String(10 + e);
 const vs = 15;
-function Zc(e) {
+function Yc(e) {
   e = e.toUpperCase(), e = e.substring(4) + e.substring(0, 2) + "00";
   let t = e.split("").map((r) => Wr[r]).join("");
   for (; t.length >= vs; ) {
@@ -3542,7 +3542,7 @@ function Zc(e) {
     n = "0" + n;
   return n;
 }
-const Yc = (function() {
+const zc = (function() {
   const e = {};
   for (let t = 0; t < 36; t++) {
     const n = "0123456789abcdefghijklmnopqrstuvwxyz"[t];
@@ -3550,27 +3550,27 @@ const Yc = (function() {
   }
   return e;
 })();
-function zc(e) {
+function Kc(e) {
   e = e.toLowerCase();
-  let t = Hc;
+  let t = Vc;
   for (let n = 0; n < e.length; n++)
-    t = t * Vc + Yc[e[n]];
+    t = t * Zc + zc[e[n]];
   return t;
 }
 function ln(e) {
-  if (_(typeof e == "string", "invalid address", "address", e), e.match(/^(0x)?[0-9a-fA-F]{40}$/)) {
+  if (m(typeof e == "string", "invalid address", "address", e), e.match(/^(0x)?[0-9a-fA-F]{40}$/)) {
     e.startsWith("0x") || (e = "0x" + e);
     const t = Bs(e);
-    return _(!e.match(/([A-F].*[a-f])|([a-f].*[A-F])/) || t === e, "bad address checksum", "address", e), t;
+    return m(!e.match(/([A-F].*[a-f])|([a-f].*[A-F])/) || t === e, "bad address checksum", "address", e), t;
   }
   if (e.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {
-    _(e.substring(2, 4) === Zc(e), "bad icap checksum", "address", e);
-    let t = zc(e.substring(4)).toString(16);
+    m(e.substring(2, 4) === Yc(e), "bad icap checksum", "address", e);
+    let t = Kc(e.substring(4)).toString(16);
     for (; t.length < 40; )
       t = "0" + t;
     return Bs("0x" + t);
   }
-  _(!1, "invalid address", "address", e);
+  m(!1, "invalid address", "address", e);
 }
 const re = {};
 function E(e, t) {
@@ -4327,7 +4327,7 @@ class pt {
     return t;
   }
 }
-class Kc extends fe {
+class Xc extends fe {
   constructor(t) {
     super("address", "address", t, !1);
   }
@@ -4347,7 +4347,7 @@ class Kc extends fe {
     return ln(Ai(t.readValue(), 20));
   }
 }
-class Xc extends fe {
+class Jc extends fe {
   coder;
   constructor(t) {
     super(t.name, t.type, "_", t.dynamic), this.coder = t;
@@ -4373,8 +4373,8 @@ function Yi(e, t, n) {
       return ct(l, "cannot encode object for signature with missing names", "INVALID_ARGUMENT", { argument: "values", info: { coder: u }, value: n }), ct(!c[l], "cannot encode object for signature with duplicate names", "INVALID_ARGUMENT", { argument: "values", info: { coder: u }, value: n }), c[l] = !0, n[l];
     });
   } else
-    _(!1, "invalid tuple value", "tuple", n);
-  _(t.length === r.length, "types/value length mismatch", "tuple", n);
+    m(!1, "invalid tuple value", "tuple", n);
+  m(t.length === r.length, "types/value length mismatch", "tuple", n);
   let s = new vr(), i = new vr(), o = [];
   t.forEach((c, u) => {
     let l = r[u];
@@ -4419,7 +4419,7 @@ function zi(e, t) {
     n.push(o), r.push(i.localName || null);
   }), ie.fromItems(n, r);
 }
-class Jc extends fe {
+class jc extends fe {
   coder;
   length;
   constructor(t, n, r) {
@@ -4447,11 +4447,11 @@ class Jc extends fe {
     n === -1 && (n = t.readIndex(), ct(n * vt <= t.dataLength, "insufficient data length", "BUFFER_OVERRUN", { buffer: t.bytes, offset: n * vt, length: t.dataLength }));
     let r = [];
     for (let s = 0; s < n; s++)
-      r.push(new Xc(this.coder));
+      r.push(new Jc(this.coder));
     return zi(t, r);
   }
 }
-class jc extends fe {
+class Qc extends fe {
   constructor(t) {
     super("bool", "bool", t, !1);
   }
@@ -4482,7 +4482,7 @@ class Ki extends fe {
     return t.readBytes(t.readIndex(), !0);
   }
 }
-class Qc extends Ki {
+class tu extends Ki {
   constructor(t) {
     super("bytes", t);
   }
@@ -4490,7 +4490,7 @@ class Qc extends Ki {
     return bt(super.decode(t));
   }
 }
-class tu extends fe {
+class eu extends fe {
   size;
   constructor(t, n) {
     let r = "bytes" + String(t);
@@ -4507,8 +4507,8 @@ class tu extends fe {
     return bt(t.readBytes(this.size));
   }
 }
-const eu = new Uint8Array([]);
-class nu extends fe {
+const nu = new Uint8Array([]);
+class ru extends fe {
   constructor(t) {
     super("null", "", t, !1);
   }
@@ -4516,14 +4516,14 @@ class nu extends fe {
     return null;
   }
   encode(t, n) {
-    return n != null && this._throwError("not null", n), t.writeBytes(eu);
+    return n != null && this._throwError("not null", n), t.writeBytes(nu);
   }
   decode(t) {
     return t.readBytes(0), null;
   }
 }
-const ru = BigInt(0), su = BigInt(1), iu = BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
-class ou extends fe {
+const su = BigInt(0), iu = BigInt(1), ou = BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
+class au extends fe {
   size;
   signed;
   constructor(t, n, r) {
@@ -4534,19 +4534,19 @@ class ou extends fe {
     return 0;
   }
   encode(t, n) {
-    let r = en(pt.dereference(n, this.type)), s = Tn(iu, vt * 8);
+    let r = en(pt.dereference(n, this.type)), s = Tn(ou, vt * 8);
     if (this.signed) {
       let i = Tn(s, this.size * 8 - 1);
-      (r > i || r < -(i + su)) && this._throwError("value out-of-bounds", n), r = $i(r, 8 * vt);
-    } else (r < ru || r > Tn(s, this.size * 8)) && this._throwError("value out-of-bounds", n);
+      (r > i || r < -(i + iu)) && this._throwError("value out-of-bounds", n), r = $i(r, 8 * vt);
+    } else (r < su || r > Tn(s, this.size * 8)) && this._throwError("value out-of-bounds", n);
     return t.writeValue(r);
   }
   decode(t) {
     let n = Tn(t.readValue(), this.size * 8);
-    return this.signed && (n = dc(n, this.size * 8)), n;
+    return this.signed && (n = pc(n, this.size * 8)), n;
   }
 }
-class au extends Ki {
+class cu extends Ki {
   constructor(t) {
     super("string", t);
   }
@@ -4557,7 +4557,7 @@ class au extends Ki {
     return super.encode(t, qr(pt.dereference(n, "string")));
   }
   decode(t) {
-    return mc(super.decode(t));
+    return xc(super.decode(t));
   }
 }
 class kn extends fe {
@@ -4596,7 +4596,7 @@ class kn extends fe {
 function fn(e) {
   return tt(qr(e));
 }
-const cu = new RegExp("^bytes([0-9]+)$"), uu = new RegExp("^(u?int)([0-9]*)$"), lu = new RegExp("^(.*)\\[([0-9]*)\\]$");
+const uu = new RegExp("^bytes([0-9]+)$"), lu = new RegExp("^(u?int)([0-9]*)$"), fu = new RegExp("^(.*)\\[([0-9]*)\\]$");
 function Xi(e, t, n) {
   switch (e) {
     case "address":
@@ -4608,44 +4608,44 @@ function Xi(e, t, n) {
     case "bool":
       return t = t ? "0x01" : "0x00", yt(n ? $n(t, 32) : t);
   }
-  let r = e.match(uu);
+  let r = e.match(lu);
   if (r) {
     let s = r[1] === "int", i = parseInt(r[2] || "256");
-    return _((!r[2] || r[2] === String(i)) && i % 8 === 0 && i !== 0 && i <= 256, "invalid number type", "type", e), n && (i = 256), s && (t = $i(t, i)), yt($n(Pi(t), i / 8));
+    return m((!r[2] || r[2] === String(i)) && i % 8 === 0 && i !== 0 && i <= 256, "invalid number type", "type", e), n && (i = 256), s && (t = $i(t, i)), yt($n(Pi(t), i / 8));
   }
-  if (r = e.match(cu), r) {
+  if (r = e.match(uu), r) {
     const s = parseInt(r[1]);
-    return _(String(s) === r[1] && s !== 0 && s <= 32, "invalid bytes type", "type", e), _(fc(t) === s, `invalid value for ${e}`, "value", t), n ? yt(Ci(t, 32)) : t;
+    return m(String(s) === r[1] && s !== 0 && s <= 32, "invalid bytes type", "type", e), m(dc(t) === s, `invalid value for ${e}`, "value", t), n ? yt(Ci(t, 32)) : t;
   }
-  if (r = e.match(lu), r && Array.isArray(t)) {
+  if (r = e.match(fu), r && Array.isArray(t)) {
     const s = r[1], i = parseInt(r[2] || String(t.length));
-    _(i === t.length, `invalid array length for ${e}`, "value", t);
+    m(i === t.length, `invalid array length for ${e}`, "value", t);
     const o = [];
     return t.forEach(function(a) {
       o.push(Xi(s, a, !0));
-    }), yt(xe(o));
+    }), yt(_e(o));
   }
-  _(!1, "invalid type", "type", e);
+  m(!1, "invalid type", "type", e);
 }
 function Ts(e, t) {
-  _(e.length === t.length, "wrong number of values; expected ${ types.length }", "values", t);
+  m(e.length === t.length, "wrong number of values; expected ${ types.length }", "values", t);
   const n = [];
   return e.forEach(function(r, s) {
     n.push(Xi(r, t[s]));
-  }), bt(xe(n));
+  }), bt(_e(n));
 }
 function Ot(e) {
   const t = /* @__PURE__ */ new Set();
   return e.forEach((n) => t.add(n)), Object.freeze(t);
 }
-const fu = "external public payable override", du = Ot(fu.split(" ")), Ji = "constant external internal payable private public pure view override", pu = Ot(Ji.split(" ")), ji = "constructor error event fallback function receive struct", Qi = Ot(ji.split(" ")), to = "calldata memory storage payable indexed", hu = Ot(to.split(" ")), wu = "tuple returns", gu = [ji, to, wu, Ji].join(" "), yu = Ot(gu.split(" ")), bu = {
+const du = "external public payable override", pu = Ot(du.split(" ")), Ji = "constant external internal payable private public pure view override", hu = Ot(Ji.split(" ")), ji = "constructor error event fallback function receive struct", Qi = Ot(ji.split(" ")), to = "calldata memory storage payable indexed", wu = Ot(to.split(" ")), gu = "tuple returns", yu = [ji, to, gu, Ji].join(" "), bu = Ot(yu.split(" ")), mu = {
   "(": "OPEN_PAREN",
   ")": "CLOSE_PAREN",
   "[": "OPEN_BRACKET",
   "]": "CLOSE_BRACKET",
   ",": "COMMA",
   "@": "AT"
-}, mu = new RegExp("^(\\s*)"), _u = new RegExp("^([0-9]+)"), xu = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), eo = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), no = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
+}, xu = new RegExp("^(\\s*)"), _u = new RegExp("^([0-9]+)"), Eu = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), eo = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), no = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
 class qt {
   #t;
   #e;
@@ -4745,11 +4745,11 @@ function Se(e) {
   };
   let r = [], s = [], i = 0;
   for (; i < e.length; ) {
-    let o = e.substring(i), a = o.match(mu);
+    let o = e.substring(i), a = o.match(xu);
     a && (i += a[1].length, o = e.substring(i));
     const c = { depth: r.length, linkBack: -1, linkNext: -1, match: -1, type: "", text: "", offset: i, value: -1 };
     t.push(c);
-    let u = bu[o[0]] || "";
+    let u = mu[o[0]] || "";
     if (u) {
       if (c.type = u, c.text = o[0], i++, u === "OPEN_PAREN")
         r.push(t.length - 1), s.push(t.length - 1);
@@ -4771,8 +4771,8 @@ function Se(e) {
       }
       continue;
     }
-    if (a = o.match(xu), a) {
-      if (c.text = a[1], i += c.text.length, yu.has(c.text)) {
+    if (a = o.match(Eu), a) {
+      if (c.text = a[1], i += c.text.length, bu.has(c.text)) {
         c.type = "KEYWORD";
         continue;
       }
@@ -4819,7 +4819,7 @@ function ue(e, t) {
   return Object.freeze(n);
 }
 function ro(e) {
-  let t = ue(e, pu);
+  let t = ue(e, hu);
   return Is(t, Ot("constant payable nonpayable".split(" "))), Is(t, Ot("pure view payable nonpayable".split(" "))), t.has("view") ? "view" : t.has("pure") ? "pure" : t.has("payable") ? "payable" : t.has("nonpayable") ? "nonpayable" : t.has("constant") ? "view" : "nonpayable";
 }
 function ce(e, t) {
@@ -4837,19 +4837,19 @@ function Ce(e) {
   if (e.length)
     throw new Error(`unexpected tokens at offset ${e.offset}: ${e.toString()}`);
 }
-const Eu = new RegExp(/^(.*)\[([0-9]*)\]$/);
+const Su = new RegExp(/^(.*)\[([0-9]*)\]$/);
 function Rs(e) {
   const t = e.match(no);
-  if (_(t, "invalid type", "type", e), e === "uint")
+  if (m(t, "invalid type", "type", e), e === "uint")
     return "uint256";
   if (e === "int")
     return "int256";
   if (t[2]) {
     const n = parseInt(t[2]);
-    _(n !== 0 && n <= 32, "invalid bytes length", "type", e);
+    m(n !== 0 && n <= 32, "invalid bytes length", "type", e);
   } else if (t[3]) {
     const n = parseInt(t[3]);
-    _(n !== 0 && n <= 256 && n % 8 === 0, "invalid numeric width", "type", e);
+    m(n !== 0 && n <= 256 && n % 8 === 0, "invalid numeric width", "type", e);
   }
   return e;
 }
@@ -5063,7 +5063,7 @@ class nt {
       try {
         return nt.from(Se(t), n);
       } catch {
-        _(!1, "invalid param type", "obj", t);
+        m(!1, "invalid param type", "obj", t);
       }
     else if (t instanceof qt) {
       let a = "", c = "", u = null;
@@ -5074,7 +5074,7 @@ class nt {
         l = new nt(ot, "", a, c, null, u, f, l), f = h.value, a += h.text, c = "array", u = null;
       }
       let d = null;
-      if (ue(t, hu).has("indexed")) {
+      if (ue(t, wu).has("indexed")) {
         if (!n)
           throw new Error("");
         d = !0;
@@ -5085,10 +5085,10 @@ class nt {
       return new nt(ot, w, a, c, d, u, f, l);
     }
     const r = t.name;
-    _(!r || typeof r == "string" && r.match(eo), "invalid name", "obj.name", r);
+    m(!r || typeof r == "string" && r.match(eo), "invalid name", "obj.name", r);
     let s = t.indexed;
-    s != null && (_(n, "parameter cannot be indexed", "obj.indexed", t.indexed), s = !!s);
-    let i = t.type, o = i.match(Eu);
+    s != null && (m(n, "parameter cannot be indexed", "obj.indexed", t.indexed), s = !!s);
+    let i = t.type, o = i.match(Su);
     if (o) {
       const a = parseInt(o[2] || "-1"), c = nt.from({
         type: o[1],
@@ -5178,7 +5178,7 @@ class $e {
         operation: "Fragment.from"
       });
     }
-    _(!1, "unsupported frgament object", "obj", t);
+    m(!1, "unsupported frgament object", "obj", t);
   }
   /**
    *  Returns true if %%value%% is a [[ConstructorFragment]].
@@ -5220,7 +5220,7 @@ class jn extends $e {
    *  @private
    */
   constructor(t, n, r, s) {
-    super(t, n, s), _(typeof r == "string" && r.match(eo), "invalid identifier", "name", r), s = Object.freeze(s.slice()), st(this, { name: r });
+    super(t, n, s), m(typeof r == "string" && r.match(eo), "invalid identifier", "name", r), s = Object.freeze(s.slice()), st(this, { name: r });
   }
 }
 function dn(e, t) {
@@ -5321,7 +5321,7 @@ class Vt extends jn {
       try {
         return Vt.from(Se(t));
       } catch {
-        _(!1, "invalid event fragment", "obj", t);
+        m(!1, "invalid event fragment", "obj", t);
       }
     else if (t instanceof qt) {
       const n = Jn("event", t), r = ce(t, !0), s = !!ue(t, Ot(["anonymous"])).has("anonymous");
@@ -5377,11 +5377,11 @@ class oe extends $e {
       try {
         return oe.from(Se(t));
       } catch {
-        _(!1, "invalid constuctor fragment", "obj", t);
+        m(!1, "invalid constuctor fragment", "obj", t);
       }
     else if (t instanceof qt) {
       ue(t, Ot(["constructor"]));
-      const n = ce(t), r = !!ue(t, du).has("payable"), s = so(t);
+      const n = ce(t), r = !!ue(t, pu).has("payable"), s = so(t);
       return Ce(t), new oe(ot, "constructor", n, r, s);
     }
     return new oe(ot, "constructor", t.inputs ? t.inputs.map(nt.from) : [], !!t.payable, t.gas != null ? t.gas : null);
@@ -5423,20 +5423,20 @@ class se extends $e {
       try {
         return se.from(Se(t));
       } catch {
-        _(!1, "invalid fallback fragment", "obj", t);
+        m(!1, "invalid fallback fragment", "obj", t);
       }
     else if (t instanceof qt) {
       const n = t.toString(), r = t.peekKeyword(Ot(["fallback", "receive"]));
-      if (_(r, "type must be fallback or receive", "obj", n), t.popKeyword(Ot(["fallback", "receive"])) === "receive") {
+      if (m(r, "type must be fallback or receive", "obj", n), t.popKeyword(Ot(["fallback", "receive"])) === "receive") {
         const a = ce(t);
-        return _(a.length === 0, "receive cannot have arguments", "obj.inputs", a), ue(t, Ot(["payable"])), Ce(t), new se(ot, [], !0);
+        return m(a.length === 0, "receive cannot have arguments", "obj.inputs", a), ue(t, Ot(["payable"])), Ce(t), new se(ot, [], !0);
       }
       let i = ce(t);
-      i.length ? _(i.length === 1 && i[0].type === "bytes", "invalid fallback inputs", "obj.inputs", i.map((a) => a.format("minimal")).join(", ")) : i = [nt.from("bytes")];
+      i.length ? m(i.length === 1 && i[0].type === "bytes", "invalid fallback inputs", "obj.inputs", i.map((a) => a.format("minimal")).join(", ")) : i = [nt.from("bytes")];
       const o = ro(t);
-      if (_(o === "nonpayable" || o === "payable", "fallback cannot be constants", "obj.stateMutability", o), ue(t, Ot(["returns"])).has("returns")) {
+      if (m(o === "nonpayable" || o === "payable", "fallback cannot be constants", "obj.stateMutability", o), ue(t, Ot(["returns"])).has("returns")) {
         const a = ce(t);
-        _(a.length === 1 && a[0].type === "bytes", "invalid fallback outputs", "obj.outputs", a.map((c) => c.format("minimal")).join(", "));
+        m(a.length === 1 && a[0].type === "bytes", "invalid fallback outputs", "obj.outputs", a.map((c) => c.format("minimal")).join(", "));
       }
       return Ce(t), new se(ot, i, o === "payable");
     }
@@ -5446,7 +5446,7 @@ class se extends $e {
       const n = [nt.from("bytes")], r = t.stateMutability === "payable";
       return new se(ot, n, r);
     }
-    _(!1, "invalid fallback description", "obj", t);
+    m(!1, "invalid fallback description", "obj", t);
   }
   /**
    *  Returns ``true`` and provides a type guard if %%value%% is a
@@ -5524,7 +5524,7 @@ class Zt extends jn {
       try {
         return Zt.from(Se(t));
       } catch {
-        _(!1, "invalid function fragment", "obj", t);
+        m(!1, "invalid function fragment", "obj", t);
       }
     else if (t instanceof qt) {
       const r = Jn("function", t), s = ce(t), i = ro(t);
@@ -5565,7 +5565,7 @@ class Ne extends jn {
       try {
         return Ne.from(Se(t));
       } catch {
-        _(!1, "invalid struct fragment", "obj", t);
+        m(!1, "invalid struct fragment", "obj", t);
       }
     else if (t instanceof qt) {
       const n = Jn("struct", t), r = ce(t);
@@ -5593,9 +5593,9 @@ Gt.set(49, "STACK_UNDERFLOW");
 Gt.set(50, "ARRAY_RANGE_ERROR");
 Gt.set(65, "OUT_OF_MEMORY");
 Gt.set(81, "UNINITIALIZED_FUNCTION_CALL");
-const Su = new RegExp(/^bytes([0-9]*)$/), Bu = new RegExp(/^(u?int)([0-9]*)$/);
+const Bu = new RegExp(/^bytes([0-9]*)$/), vu = new RegExp(/^(u?int)([0-9]*)$/);
 let mr = null, Fs = 1024;
-function vu(e, t, n, r) {
+function Ou(e, t, n, r) {
   let s = "missing revert data", i = null;
   const o = null;
   let a = null;
@@ -5646,31 +5646,31 @@ function vu(e, t, n, r) {
 class le {
   #t(t) {
     if (t.isArray())
-      return new Jc(this.#t(t.arrayChildren), t.arrayLength, t.name);
+      return new jc(this.#t(t.arrayChildren), t.arrayLength, t.name);
     if (t.isTuple())
       return new kn(t.components.map((r) => this.#t(r)), t.name);
     switch (t.baseType) {
       case "address":
-        return new Kc(t.name);
+        return new Xc(t.name);
       case "bool":
-        return new jc(t.name);
+        return new Qc(t.name);
       case "string":
-        return new au(t.name);
+        return new cu(t.name);
       case "bytes":
-        return new Qc(t.name);
+        return new tu(t.name);
       case "":
-        return new nu(t.name);
+        return new ru(t.name);
     }
-    let n = t.type.match(Bu);
+    let n = t.type.match(vu);
     if (n) {
       let r = parseInt(n[2] || "256");
-      return _(r !== 0 && r <= 256 && r % 8 === 0, "invalid " + n[1] + " bit length", "param", t), new ou(r / 8, n[1] === "int", t.name);
+      return m(r !== 0 && r <= 256 && r % 8 === 0, "invalid " + n[1] + " bit length", "param", t), new au(r / 8, n[1] === "int", t.name);
     }
-    if (n = t.type.match(Su), n) {
+    if (n = t.type.match(Bu), n) {
       let r = parseInt(n[1]);
-      return _(r !== 0 && r <= 32, "invalid bytes length", "param", t), new tu(r, t.name);
+      return m(r !== 0 && r <= 32, "invalid bytes length", "param", t), new eu(r, t.name);
     }
-    _(!1, "invalid type", "type", t.type);
+    m(!1, "invalid type", "type", t.type);
   }
   /**
    *  Get the default values for the given %%types%%.
@@ -5704,7 +5704,7 @@ class le {
     return new kn(s, "_").decode(new Dr(n, r, Fs));
   }
   static _setDefaultMaxInflation(t) {
-    _(typeof t == "number" && Number.isInteger(t), "invalid defaultMaxInflation factor", "value", t), Fs = t;
+    m(typeof t == "number" && Number.isInteger(t), "invalid defaultMaxInflation factor", "value", t), Fs = t;
   }
   /**
    *  Returns the shared singleton instance of a default [[AbiCoder]].
@@ -5720,10 +5720,10 @@ class le {
    *  the Transaction %%tx%%.
    */
   static getBuiltinCallException(t, n, r) {
-    return vu(t, n, r, le.defaultAbiCoder());
+    return Ou(t, n, r, le.defaultAbiCoder());
   }
 }
-class Ou {
+class Tu {
   /**
    *  The matching fragment for the ``topic0``.
    */
@@ -5758,7 +5758,7 @@ class Ou {
     });
   }
 }
-class Tu {
+class Iu {
   /**
    *  The matching fragment from the transaction ``data``.
    */
@@ -5798,7 +5798,7 @@ class Tu {
     });
   }
 }
-class Iu {
+class Ru {
   /**
    *  The matching fragment.
    */
@@ -5935,7 +5935,7 @@ class ge {
           st(this, { deploy: o });
           return;
         case "fallback":
-          o.inputs.length === 0 ? i = !0 : (_(!s || o.payable !== s.payable, "conflicting fallback fragments", `fragments[${a}]`, o), s = o, i = s.payable);
+          o.inputs.length === 0 ? i = !0 : (m(!s || o.payable !== s.payable, "conflicting fallback fragments", `fragments[${a}]`, o), s = o, i = s.payable);
           return;
         case "function":
           c = this.#n;
@@ -6028,7 +6028,7 @@ class ge {
         return null;
       if (i.length > 1 && r) {
         const o = i.map((a) => JSON.stringify(a.format())).join(", ");
-        _(!1, `ambiguous function description (i.e. matches ${o})`, "key", t);
+        m(!1, `ambiguous function description (i.e. matches ${o})`, "key", t);
       }
       return i[0];
     }
@@ -6041,7 +6041,7 @@ class ge {
    */
   getFunctionName(t) {
     const n = this.#s(t, null, !1);
-    return _(n, "no matching function", "key", t), n.name;
+    return m(n, "no matching function", "key", t), n.name;
   }
   /**
    *  Returns true if %%key%% (a function selector, function name or
@@ -6109,7 +6109,7 @@ class ge {
         return null;
       if (i.length > 1 && r) {
         const o = i.map((a) => JSON.stringify(a.format())).join(", ");
-        _(!1, `ambiguous event description (i.e. matches ${o})`, "key", t);
+        m(!1, `ambiguous event description (i.e. matches ${o})`, "key", t);
       }
       return i[0];
     }
@@ -6122,7 +6122,7 @@ class ge {
    */
   getEventName(t) {
     const n = this.#i(t, null, !1);
-    return _(n, "no matching event", "key", t), n.name;
+    return m(n, "no matching event", "key", t), n.name;
   }
   /**
    *  Returns true if %%key%% (an event topic hash, event name or
@@ -6189,7 +6189,7 @@ class ge {
         return t === "Error" ? kt.from("error Error(string)") : t === "Panic" ? kt.from("error Panic(uint256)") : null;
       if (s.length > 1) {
         const i = s.map((o) => JSON.stringify(o.format())).join(", ");
-        _(!1, `ambiguous error description (i.e. ${i})`, "name", t);
+        m(!1, `ambiguous error description (i.e. ${i})`, "name", t);
       }
       return s[0];
     }
@@ -6264,9 +6264,9 @@ class ge {
   decodeErrorResult(t, n) {
     if (typeof t == "string") {
       const r = this.getError(t);
-      _(r, "unknown error", "fragment", t), t = r;
+      m(r, "unknown error", "fragment", t), t = r;
     }
-    return _(Me(n, 0, 4) === t.selector, `data signature does not match error ${t.name}.`, "data", n), this._decodeParams(t.inputs, Me(n, 4));
+    return m(Me(n, 0, 4) === t.selector, `data signature does not match error ${t.name}.`, "data", n), this._decodeParams(t.inputs, Me(n, 4));
   }
   /**
    *  Encodes the transaction revert data for a call result that
@@ -6279,9 +6279,9 @@ class ge {
   encodeErrorResult(t, n) {
     if (typeof t == "string") {
       const r = this.getError(t);
-      _(r, "unknown error", "fragment", t), t = r;
+      m(r, "unknown error", "fragment", t), t = r;
     }
-    return xe([
+    return _e([
       t.selector,
       this._encodeParams(t.inputs, n || [])
     ]);
@@ -6297,9 +6297,9 @@ class ge {
   decodeFunctionData(t, n) {
     if (typeof t == "string") {
       const r = this.getFunction(t);
-      _(r, "unknown function", "fragment", t), t = r;
+      m(r, "unknown function", "fragment", t), t = r;
     }
-    return _(Me(n, 0, 4) === t.selector, `data signature does not match function ${t.name}.`, "data", n), this._decodeParams(t.inputs, Me(n, 4));
+    return m(Me(n, 0, 4) === t.selector, `data signature does not match function ${t.name}.`, "data", n), this._decodeParams(t.inputs, Me(n, 4));
   }
   /**
    *  Encodes the ``tx.data`` for a transaction that calls the function
@@ -6309,9 +6309,9 @@ class ge {
   encodeFunctionData(t, n) {
     if (typeof t == "string") {
       const r = this.getFunction(t);
-      _(r, "unknown function", "fragment", t), t = r;
+      m(r, "unknown function", "fragment", t), t = r;
     }
-    return xe([
+    return _e([
       t.selector,
       this._encodeParams(t.inputs, n || [])
     ]);
@@ -6328,7 +6328,7 @@ class ge {
   decodeFunctionResult(t, n) {
     if (typeof t == "string") {
       const i = this.getFunction(t);
-      _(i, "unknown function", "fragment", t), t = i;
+      m(i, "unknown function", "fragment", t), t = i;
     }
     let r = "invalid length for result data";
     const s = Kt(n);
@@ -6377,7 +6377,7 @@ class ge {
   encodeFunctionResult(t, n) {
     if (typeof t == "string") {
       const r = this.getFunction(t);
-      _(r, "unknown function", "fragment", t), t = r;
+      m(r, "unknown function", "fragment", t), t = r;
     }
     return bt(this.#r.encode(t.outputs, n || []));
   }
@@ -6415,7 +6415,7 @@ class ge {
   encodeFilterTopics(t, n) {
     if (typeof t == "string") {
       const i = this.getEvent(t);
-      _(i, "unknown event", "eventFragment", t), t = i;
+      m(i, "unknown event", "eventFragment", t), t = i;
     }
     ct(n.length <= t.inputs.length, `too many arguments for ${t.format()}`, "UNEXPECTED_ARGUMENT", { count: n.length, expectedCount: t.inputs.length });
     const r = [];
@@ -6424,10 +6424,10 @@ class ge {
     for (n.forEach((i, o) => {
       const a = t.inputs[o];
       if (!a.indexed) {
-        _(i == null, "cannot filter non-indexed parameters; must be null", "contract." + a.name, i);
+        m(i == null, "cannot filter non-indexed parameters; must be null", "contract." + a.name, i);
         return;
       }
-      i == null ? r.push(null) : a.baseType === "array" || a.baseType === "tuple" ? _(!1, "filtering with tuples or arrays not supported", "contract." + a.name, i) : Array.isArray(i) ? r.push(i.map((c) => s(a, c))) : r.push(s(a, i));
+      i == null ? r.push(null) : a.baseType === "array" || a.baseType === "tuple" ? m(!1, "filtering with tuples or arrays not supported", "contract." + a.name, i) : Array.isArray(i) ? r.push(i.map((c) => s(a, c))) : r.push(s(a, i));
     }); r.length && r[r.length - 1] === null; )
       r.pop();
     return r;
@@ -6435,10 +6435,10 @@ class ge {
   encodeEventLog(t, n) {
     if (typeof t == "string") {
       const o = this.getEvent(t);
-      _(o, "unknown event", "eventFragment", t), t = o;
+      m(o, "unknown event", "eventFragment", t), t = o;
     }
     const r = [], s = [], i = [];
-    return t.anonymous || r.push(t.topicHash), _(n.length === t.inputs.length, "event arguments/values mismatch", "values", n), t.inputs.forEach((o, a) => {
+    return t.anonymous || r.push(t.topicHash), m(n.length === t.inputs.length, "event arguments/values mismatch", "values", n), t.inputs.forEach((o, a) => {
       const c = n[a];
       if (o.indexed)
         if (o.type === "string")
@@ -6461,17 +6461,17 @@ class ge {
   decodeEventLog(t, n, r) {
     if (typeof t == "string") {
       const p = this.getEvent(t);
-      _(p, "unknown event", "eventFragment", t), t = p;
+      m(p, "unknown event", "eventFragment", t), t = p;
     }
     if (r != null && !t.anonymous) {
       const p = t.topicHash;
-      _(on(r[0], 32) && r[0].toLowerCase() === p, "fragment/topic mismatch", "topics[0]", r[0]), r = r.slice(1);
+      m(on(r[0], 32) && r[0].toLowerCase() === p, "fragment/topic mismatch", "topics[0]", r[0]), r = r.slice(1);
     }
     const s = [], i = [], o = [];
     t.inputs.forEach((p, w) => {
       p.indexed ? p.type === "string" || p.type === "bytes" || p.baseType === "tuple" || p.baseType === "array" ? (s.push(nt.from({ type: "bytes32", name: p.name })), o.push(!0)) : (s.push(p), o.push(!1)) : (i.push(p), o.push(!1));
     });
-    const a = r != null ? this.#r.decode(s, xe(r)) : null, c = this.#r.decode(i, n, !0), u = [], l = [];
+    const a = r != null ? this.#r.decode(s, _e(r)) : null, c = this.#r.decode(i, n, !0), u = [], l = [];
     let f = 0, d = 0;
     return t.inputs.forEach((p, w) => {
       let h = null;
@@ -6506,7 +6506,7 @@ class ge {
     if (!s)
       return null;
     const i = this.#r.decode(s.inputs, n.slice(4));
-    return new Tu(s, s.selector, i, r);
+    return new Iu(s, s.selector, i, r);
   }
   parseCallResult(t) {
     throw new Error("@TODO");
@@ -6519,7 +6519,7 @@ class ge {
    */
   parseLog(t) {
     const n = this.getEvent(t.topics[0]);
-    return !n || n.anonymous ? null : new Ou(n, n.topicHash, this.decodeEventLog(n, t.data, t.topics));
+    return !n || n.anonymous ? null : new Tu(n, n.topicHash, this.decodeEventLog(n, t.data, t.topics));
   }
   /**
    *  Parses a revert data, finding the matching error and extracts
@@ -6532,7 +6532,7 @@ class ge {
     if (!r)
       return null;
     const s = this.#r.decode(r.inputs, Me(n, 4));
-    return new Iu(r, r.selector, s);
+    return new Ru(r, r.selector, s);
   }
   /**
    *  Creates a new [[Interface]] from the ABI %%value%%.
@@ -6544,14 +6544,14 @@ class ge {
     return t instanceof ge ? t : typeof t == "string" ? new ge(JSON.parse(t)) : typeof t.formatJson == "function" ? new ge(t.formatJson()) : typeof t.format == "function" ? new ge(t.format("json")) : new ge(t);
   }
 }
-const io = "The swap backend did not return a fee_policy from get_swap_info, so it is older than this wallet-kit release and swap fees cannot be computed. Upgrade the swap backend, or pin @bestinslot/wallet-kit below 0.11.0.", Ru = /^0x[0-9a-f]{40}$/;
+const io = "The swap backend did not return a fee_policy from get_swap_info, so it is older than this wallet-kit release and swap fees cannot be computed. Upgrade the swap backend, or pin @bestinslot/wallet-kit below 0.11.0.", ku = /^0x[0-9a-f]{40}$/;
 function We(e) {
   return new Error(`Invalid fee_policy from the swap backend: ${e}`);
 }
 function Ms(e) {
   return typeof e == "number" && Number.isInteger(e) && e >= 0 && e <= 1e4;
 }
-function ku(e) {
+function Nu(e) {
   if (e == null)
     throw new Error(io);
   if (typeof e != "object")
@@ -6573,7 +6573,7 @@ function ku(e) {
     throw We("priority_tokens must be a non-empty array");
   const o = r.map((a) => {
     const c = typeof a == "string" ? a.toLowerCase() : "";
-    if (!Ru.test(c))
+    if (!ku.test(c))
       throw We(`priority_tokens contains an invalid address (${String(a)})`);
     return c;
   });
@@ -6586,7 +6586,7 @@ function ku(e) {
     min_btc_exposure_sats: s
   };
 }
-function Nu(e, t, n) {
+function Cu(e, t, n) {
   const r = n.priority_tokens.indexOf(e.toLowerCase()), s = n.priority_tokens.indexOf(t.toLowerCase()), o = BigInt(r === 0 || s === 0 ? n.swap_fee_bps : n.token_pair_swap_fee_bps);
   if (r === -1 && s === -1) {
     const c = o / 2n;
@@ -6594,8 +6594,8 @@ function Nu(e, t, n) {
   }
   return r !== -1 && (s === -1 || r < s) ? { token1FeeBps: o, token2FeeBps: 0n } : { token1FeeBps: 0n, token2FeeBps: o };
 }
-const Cu = 30n;
-function $u(e, t, n) {
+const $u = 30n;
+function Lu(e, t, n) {
   const r = n.toLowerCase();
   return e.toLowerCase() === r ? "buy" : t.toLowerCase() === r ? "sell" : null;
 }
@@ -6605,12 +6605,12 @@ function oo(e) {
     throw new RangeError("satsToBtc: amount exceeds safe-integer precision (~90,000 BTC).");
   return Number(e) / 1e8;
 }
-function Lu(e, t) {
+function Au(e, t) {
   return oo(e) * t;
 }
 function ao(e, t, n, r, s) {
   return {
-    pool_fee_bps: Cu,
+    pool_fee_bps: $u,
     token_in_fee_bps: n,
     token_in_fee: e * n / 10000n,
     token_out_fee_bps: r,
@@ -6626,7 +6626,7 @@ let gt = "", Gr = "";
 function Qn(e, t) {
   gt = e.toLowerCase(), Gr = t.toLowerCase();
 }
-function Au(e) {
+function Pu(e) {
   if (e < 0n)
     throw new Error("square root of negative numbers is not supported");
   if (e < 2n)
@@ -6655,14 +6655,14 @@ async function Ws(e, t, n) {
   const r = await e.balanceOf(t, n);
   return r === null ? BigInt(0) : r;
 }
-async function Pu(e, t, n) {
+async function Fu(e, t, n) {
   t.toLowerCase() > n.toLowerCase() && ([t, n] = [n, t]);
   const r = await e.reservesOf(tr(t, n));
   if (r === null)
     throw new Error("Token pair does not exist");
   return r;
 }
-class Fu {
+class Uu {
   map;
   proxy;
   constructor() {
@@ -6697,7 +6697,7 @@ class Fu {
     this.map[s] = r;
   }
 }
-class Uu {
+class qu {
   map;
   proxy;
   constructor() {
@@ -6718,7 +6718,7 @@ class Uu {
         throw new Error("Undefined reserves encountered");
       return this.map[r];
     }
-    const s = await Pu(this.proxy, t, n);
+    const s = await Fu(this.proxy, t, n);
     return this.map[r] = s, s;
   }
   set(t, n, r) {
@@ -6728,8 +6728,8 @@ class Uu {
     this.map[s] = r;
   }
 }
-const C = new Fu(), it = new Uu();
-function xn(e) {
+const C = new Uu(), it = new qu();
+function _n(e) {
   if (gt === "" || Gr === "")
     throw new Error("Uniswap info not set");
   C.clear(e), it.clear(e);
@@ -6737,7 +6737,7 @@ function xn(e) {
 function uo(e, t) {
   return e < t ? e + t : t + e;
 }
-function qu(e, t, n) {
+function Du(e, t, n) {
   if (e <= 0n)
     throw new Error("Insufficient input amount");
   if (t <= 0n || n <= 0n)
@@ -6745,7 +6745,7 @@ function qu(e, t, n) {
   const r = e * 997n, s = r * n, i = t * 1000n + r;
   return s / i;
 }
-function Du(e, t, n) {
+function Mu(e, t, n) {
   if (e <= 0n)
     throw new Error("Insufficient output amount");
   if (t <= 0n || n <= 0n || e >= n)
@@ -6753,23 +6753,23 @@ function Du(e, t, n) {
   const r = t * e * 1000n, s = (n - e) * 997n;
   return r / s + 1n;
 }
-async function Mu(e, t) {
+async function Wu(e, t) {
   if (t.length < 2)
     throw new Error("Invalid path");
   const n = [e];
   for (let r = 0; r < t.length - 1; r++) {
-    const { reserveA: s, reserveB: i } = await Xt(t[r], t[r + 1]), o = qu(n[r], s, i);
+    const { reserveA: s, reserveB: i } = await Xt(t[r], t[r + 1]), o = Du(n[r], s, i);
     n.push(o);
   }
   return n;
 }
-async function Wu(e, t) {
+async function Gu(e, t) {
   if (t.length < 2)
     throw new Error("Invalid path");
   const n = [];
   n[t.length - 1] = e;
   for (let r = t.length - 1; r > 0; r--) {
-    const { reserveA: s, reserveB: i } = await Xt(t[r - 1], t[r]), o = Du(n[r], s, i);
+    const { reserveA: s, reserveB: i } = await Xt(t[r - 1], t[r]), o = Mu(n[r], s, i);
     n[r - 1] = o;
   }
   return n;
@@ -6795,8 +6795,8 @@ async function Xt(e, t) {
     total_supply: n.total_supply
   };
 }
-const Gu = (...e) => e.reduce((t, n) => n < t ? n : t);
-async function Hu(e, t, n, r) {
+const Hu = (...e) => e.reduce((t, n) => n < t ? n : t);
+async function Vu(e, t, n, r) {
   const {
     reserveA: s,
     reserveB: i,
@@ -6804,7 +6804,7 @@ async function Hu(e, t, n, r) {
   } = await Xt(e, t), a = s - n, c = i - r;
   let u;
   if (o === 0n) {
-    u = Au(n * r) - 1000n;
+    u = Pu(n * r) - 1000n;
     const f = await it.get(e, t);
     it.set(e, t, {
       reserveA: f.reserveA,
@@ -6812,7 +6812,7 @@ async function Hu(e, t, n, r) {
       total_supply: f.total_supply + 1000n
     });
   } else
-    u = Gu(n * o / a, r * o / c);
+    u = Hu(n * o / a, r * o / c);
   if (u <= 0n)
     throw new Error("Insufficient liquidity minted");
   const l = await it.get(e, t);
@@ -6822,7 +6822,7 @@ async function Hu(e, t, n, r) {
     total_supply: l.total_supply + u
   }), u;
 }
-async function Vu(e, t, n, r, s, i) {
+async function Zu(e, t, n, r, s, i) {
   let o, a;
   try {
     await it.get(e, t);
@@ -6847,8 +6847,8 @@ async function Vu(e, t, n, r, s, i) {
   }
   return { amountA: o, amountB: a };
 }
-async function Zu(e, t, n, r, s, i) {
-  const { amountA: o, amountB: a } = await Vu(
+async function Yu(e, t, n, r, s, i) {
+  const { amountA: o, amountB: a } = await Zu(
     e,
     t,
     n,
@@ -6865,10 +6865,10 @@ async function Zu(e, t, n, r, s, i) {
     reserveB: c.reserveB + o,
     total_supply: c.total_supply
   });
-  const u = await Hu(e, t, o, a);
+  const u = await Vu(e, t, o, a);
   return { amountA: o, amountB: a, liquidity: u };
 }
-async function Yu(e, t, n) {
+async function zu(e, t, n) {
   const {
     reserveA: r,
     reserveB: s,
@@ -6884,7 +6884,7 @@ async function Yu(e, t, n) {
     total_supply: u
   }), { amountA: o, amountB: a };
 }
-async function zu(e, t, n, r, s, i, o, a) {
+async function Ku(e, t, n, r, s, i, o, a) {
   if (s <= 0n && i <= 0n)
     throw new Error("Insufficient output amount");
   const { reserveA: c, reserveB: u } = await Xt(e, t), l = c - n, f = u - r;
@@ -6896,22 +6896,22 @@ async function zu(e, t, n, r, s, i, o, a) {
     reserveB: d.reserveB - i,
     total_supply: d.total_supply
   }), o !== null) {
-    const O = o[0], F = o[1], q = await it.get(O, F);
+    const O = o[0], F = o[1], W = await it.get(O, F);
     a ? it.set(O, F, {
-      reserveA: q.reserveA + i,
-      reserveB: q.reserveB + s,
-      total_supply: q.total_supply
+      reserveA: W.reserveA + i,
+      reserveB: W.reserveB + s,
+      total_supply: W.total_supply
     }) : it.set(O, F, {
-      reserveA: q.reserveA + s,
-      reserveB: q.reserveB + i,
-      total_supply: q.total_supply
+      reserveA: W.reserveA + s,
+      reserveB: W.reserveB + i,
+      total_supply: W.total_supply
     });
   }
   const p = (await it.get(e, t)).reserveA, w = (await it.get(e, t)).reserveB, h = p > l - s ? p - (l - s) : 0n, g = w > f - i ? w - (f - i) : 0n;
   if (h <= 0n && g <= 0n)
     throw new Error("Insufficient input amount");
-  const b = p * 1000n - h * 3n, B = w * 1000n - g * 3n;
-  if (b * B < BigInt(l) * BigInt(f) * 1000n * 1000n)
+  const b = p * 1000n - h * 3n, v = w * 1000n - g * 3n;
+  if (b * v < BigInt(l) * BigInt(f) * 1000n * 1000n)
     throw new Error("K");
 }
 async function lo(e, t) {
@@ -6934,51 +6934,51 @@ async function lo(e, t) {
     if (s === void 0 || i === void 0 || o === void 0 || a === void 0)
       throw new Error("Undefined value in swap path or amounts");
     const c = s < i ? o : 0n, u = s < i ? 0n : o, l = s < i ? 0n : a, f = s < i ? a : 0n, d = s < i ? s : i, p = s < i ? i : s, w = r < t.length - 2 ? [i, t[r + 2]] : null, h = w === null ? null : i >= t[r + 2];
-    await zu(d, p, c, u, l, f, w, h);
+    await Ku(d, p, c, u, l, f, w, h);
   }
 }
-async function Ku(e, t, n) {
+async function Xu(e, t, n) {
   if (n.length < 2)
     throw new Error("Invalid path");
-  const r = await Mu(e, n);
+  const r = await Wu(e, n);
   if (r[r.length - 1] < t)
     throw new Error("Insufficient output amount");
   return await lo(r, n), r;
 }
-async function Xu(e, t, n) {
+async function Ju(e, t, n) {
   if (n.length < 2)
     throw new Error("Invalid path");
-  const r = await Wu(t, n);
+  const r = await Gu(t, n);
   if (r[0] > e)
     throw new Error("Excessive Input Amount");
   return await lo(r, n), r;
 }
-async function Ju(e, t, n, r, s) {
-  const { amountA: i, amountB: o } = await Yu(e, t, n);
+async function ju(e, t, n, r, s) {
+  const { amountA: i, amountB: o } = await zu(e, t, n);
   if (i < r)
     throw new Error("Insufficient A amount");
   if (o < s)
     throw new Error("Insufficient B amount");
   return { amountA: i, amountB: o };
 }
-function ju(e, t, n, r, s, i, o, a, c, u, l, f) {
+function Qu(e, t, n, r, s, i, o, a, c, u, l, f) {
   if (f === "")
     return !0;
   let d = tt(S.from(e, "hex")).slice(2);
   d += t.toString(16).padStart(8, "0"), d += "01", d += n.slice(2).padStart(40, "0"), d += r.slice(2).padStart(40, "0"), d += s.toString(16).padStart(64, "0"), d += i.toString(16).padStart(64, "0"), d += o.toString(16).padStart(64, "0"), d += a.toString(16).padStart(64, "0"), d += c.toString(16).padStart(64, "0"), d += u.toString(16).padStart(64, "0"), d += l.toString(16).padStart(64, "0");
   const p = S.from(d, "hex"), w = T.G1.hashToCurve(p, {
     DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_"
-  }), h = BigInt(`0x${f.slice(0, 128)}`), g = BigInt(`0x${f.slice(128, 256)}`), b = new T.G1.Point(h, g, BigInt(1)), B = BigInt(`0x${e.slice(0, 128)}`), O = BigInt(`0x${e.slice(128, 256)}`), F = BigInt(`0x${e.slice(256, 384)}`), q = BigInt(`0x${e.slice(384, 512)}`), P = new T.G2.Point(
-    T.fields.Fp2.create({ c0: B, c1: O }),
-    T.fields.Fp2.create({ c0: F, c1: q }),
+  }), h = BigInt(`0x${f.slice(0, 128)}`), g = BigInt(`0x${f.slice(128, 256)}`), b = new T.G1.Point(h, g, BigInt(1)), v = BigInt(`0x${e.slice(0, 128)}`), O = BigInt(`0x${e.slice(128, 256)}`), F = BigInt(`0x${e.slice(256, 384)}`), W = BigInt(`0x${e.slice(384, 512)}`), A = new T.G2.Point(
+    T.fields.Fp2.create({ c0: v, c1: O }),
+    T.fields.Fp2.create({ c0: F, c1: W }),
     T.fields.Fp2.ONE
   );
-  return T.shortSignatures.verify(b, w, P);
+  return T.shortSignatures.verify(b, w, A);
 }
-async function Qu(e, t, n, r, s, i, o, a, c, u, l, f, d) {
-  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, c = c.startsWith("0x") ? c.slice(2) : c, xn(e);
+async function tl(e, t, n, r, s, i, o, a, c, u, l, f, d) {
+  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, c = c.startsWith("0x") ? c.slice(2) : c, _n(e);
   try {
-    if (!ju(
+    if (!Qu(
       t,
       u,
       n,
@@ -6993,7 +6993,7 @@ async function Qu(e, t, n, r, s, i, o, a, c, u, l, f, d) {
       c
     ))
       throw new Error("Invalid BLS signature");
-    const { amountA: p, amountB: w, liquidity: h } = await Zu(
+    const { amountA: p, amountB: w, liquidity: h } = await Yu(
       n,
       r,
       s,
@@ -7030,24 +7030,24 @@ async function Qu(e, t, n, r, s, i, o, a, c, u, l, f, d) {
     return console.error("Error in add_liquidity_request:", p), { success: !1, error_message: p.message };
   }
 }
-function tl(e, t, n, r, s, i, o, a, c, u, l) {
+function el(e, t, n, r, s, i, o, a, c, u, l) {
   if (l === "")
     return !0;
   let f = tt(S.from(e, "hex")).slice(2);
   f += t.toString(16).padStart(8, "0"), f += "02", f += n.slice(2).padStart(40, "0"), f += r.slice(2).padStart(40, "0"), f += s.toString(16).padStart(64, "0"), f += i.toString(16).padStart(64, "0"), f += o.toString(16).padStart(64, "0"), f += a.toString(16).padStart(64, "0"), f += c.toString(16).padStart(64, "0"), f += u.toString(16).padStart(64, "0");
   const d = S.from(f, "hex"), p = T.G1.hashToCurve(d, {
     DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_"
-  }), w = BigInt(`0x${l.slice(0, 128)}`), h = BigInt(`0x${l.slice(128, 256)}`), g = new T.G1.Point(w, h, BigInt(1)), b = BigInt(`0x${e.slice(0, 128)}`), B = BigInt(`0x${e.slice(128, 256)}`), O = BigInt(`0x${e.slice(256, 384)}`), F = BigInt(`0x${e.slice(384, 512)}`), q = new T.G2.Point(
-    T.fields.Fp2.create({ c0: b, c1: B }),
+  }), w = BigInt(`0x${l.slice(0, 128)}`), h = BigInt(`0x${l.slice(128, 256)}`), g = new T.G1.Point(w, h, BigInt(1)), b = BigInt(`0x${e.slice(0, 128)}`), v = BigInt(`0x${e.slice(128, 256)}`), O = BigInt(`0x${e.slice(256, 384)}`), F = BigInt(`0x${e.slice(384, 512)}`), W = new T.G2.Point(
+    T.fields.Fp2.create({ c0: b, c1: v }),
     T.fields.Fp2.create({ c0: O, c1: F }),
     T.fields.Fp2.ONE
   );
-  return T.shortSignatures.verify(g, p, q);
+  return T.shortSignatures.verify(g, p, W);
 }
-async function el(e, t, n, r, s, i, o, a, c, u, l, f) {
-  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, a = a.startsWith("0x") ? a.slice(2) : a, xn(e);
+async function nl(e, t, n, r, s, i, o, a, c, u, l, f) {
+  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, a = a.startsWith("0x") ? a.slice(2) : a, _n(e);
   try {
-    if (!tl(
+    if (!el(
       t,
       c,
       n,
@@ -7064,7 +7064,7 @@ async function el(e, t, n, r, s, i, o, a, c, u, l, f) {
     const d = uo(n, r);
     if ((await C.get(t, d) || 0n) < s)
       throw new Error("Insufficient liquidity balance");
-    const { amountA: p, amountB: w } = await Ju(
+    const { amountA: p, amountB: w } = await ju(
       n,
       r,
       s,
@@ -7100,24 +7100,24 @@ async function el(e, t, n, r, s, i, o, a, c, u, l, f) {
     return console.error("Error in remove_liquidity_request:", d), { success: !1, error_message: d.message };
   }
 }
-function nl(e, t, n, r, s, i, o, a, c, u) {
+function rl(e, t, n, r, s, i, o, a, c, u) {
   if (u === "")
     return !0;
   let l = tt(S.from(e, "hex")).slice(2);
   l += t.toString(16).padStart(8, "0"), l += "03", l += n.slice(2).padStart(64, "0"), l += r.slice(2).padStart(64, "0"), l += s.toString(16).padStart(64, "0"), l += i.toString(16).padStart(64, "0"), l += o.toString(16).padStart(64, "0"), l += a.toString(16).padStart(64, "0"), l += c.toString(16).padStart(64, "0");
   const f = S.from(l, "hex"), d = T.G1.hashToCurve(f, {
     DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_"
-  }), p = BigInt(`0x${u.slice(0, 128)}`), w = BigInt(`0x${u.slice(128, 256)}`), h = new T.G1.Point(p, w, BigInt(1)), g = BigInt(`0x${e.slice(0, 128)}`), b = BigInt(`0x${e.slice(128, 256)}`), B = BigInt(`0x${e.slice(256, 384)}`), O = BigInt(`0x${e.slice(384, 512)}`), F = new T.G2.Point(
+  }), p = BigInt(`0x${u.slice(0, 128)}`), w = BigInt(`0x${u.slice(128, 256)}`), h = new T.G1.Point(p, w, BigInt(1)), g = BigInt(`0x${e.slice(0, 128)}`), b = BigInt(`0x${e.slice(128, 256)}`), v = BigInt(`0x${e.slice(256, 384)}`), O = BigInt(`0x${e.slice(384, 512)}`), F = new T.G2.Point(
     T.fields.Fp2.create({ c0: g, c1: b }),
-    T.fields.Fp2.create({ c0: B, c1: O }),
+    T.fields.Fp2.create({ c0: v, c1: O }),
     T.fields.Fp2.ONE
   );
   return T.shortSignatures.verify(h, d, F);
 }
-async function rl(e, t, n, r, s, i, o, a, c, u, l) {
-  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, o = o.startsWith("0x") ? o.slice(2) : o, xn(e);
+async function sl(e, t, n, r, s, i, o, a, c, u, l) {
+  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, o = o.startsWith("0x") ? o.slice(2) : o, _n(e);
   try {
-    if (!nl(
+    if (!rl(
       t,
       a,
       n,
@@ -7135,7 +7135,7 @@ async function rl(e, t, n, r, s, i, o, a, c, u, l) {
     const { reserveA: f, reserveB: d } = await Xt(
       n,
       r
-    ), p = await Ku(s, i, [n, r]);
+    ), p = await Xu(s, i, [n, r]);
     if (p.length !== 2)
       throw new Error("Invalid swap output amounts");
     C.setCheckPositive(
@@ -7162,7 +7162,7 @@ async function rl(e, t, n, r, s, i, o, a, c, u, l) {
     const { reserveA: w, reserveB: h } = await Xt(
       n,
       r
-    ), g = n === gt ? f * 1000000000000000000n * 10000n / d : d * 1000000000000000000n * 10000n / f, b = n === gt ? w * 1000000000000000000n * 10000n / h : h * 1000000000000000000n * 10000n / w, B = g > b ? g - b : b - g, O = g !== 0n ? B * 10000n / g : 0n;
+    ), g = n === gt ? f * 1000000000000000000n * 10000n / d : d * 1000000000000000000n * 10000n / f, b = n === gt ? w * 1000000000000000000n * 10000n / h : h * 1000000000000000000n * 10000n / w, v = g > b ? g - b : b - g, O = g !== 0n ? v * 10000n / g : 0n;
     return {
       success: !0,
       amounts: p,
@@ -7174,24 +7174,24 @@ async function rl(e, t, n, r, s, i, o, a, c, u, l) {
     return console.error("Error in swap_request:", f), { success: !1, error_message: f.message };
   }
 }
-function sl(e, t, n, r, s, i, o, a, c, u) {
+function il(e, t, n, r, s, i, o, a, c, u) {
   if (u === "")
     return !0;
   let l = tt(S.from(e, "hex")).slice(2);
   l += t.toString(16).padStart(8, "0"), l += "03", l += n.slice(2).padStart(64, "0"), l += r.slice(2).padStart(64, "0"), l += s.toString(16).padStart(64, "0"), l += i.toString(16).padStart(64, "0"), l += o.toString(16).padStart(64, "0"), l += a.toString(16).padStart(64, "0"), l += c.toString(16).padStart(64, "0");
   const f = S.from(l, "hex"), d = T.G1.hashToCurve(f, {
     DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_"
-  }), p = BigInt(`0x${u.slice(0, 128)}`), w = BigInt(`0x${u.slice(128, 256)}`), h = new T.G1.Point(p, w, BigInt(1)), g = BigInt(`0x${e.slice(0, 128)}`), b = BigInt(`0x${e.slice(128, 256)}`), B = BigInt(`0x${e.slice(256, 384)}`), O = BigInt(`0x${e.slice(384, 512)}`), F = new T.G2.Point(
+  }), p = BigInt(`0x${u.slice(0, 128)}`), w = BigInt(`0x${u.slice(128, 256)}`), h = new T.G1.Point(p, w, BigInt(1)), g = BigInt(`0x${e.slice(0, 128)}`), b = BigInt(`0x${e.slice(128, 256)}`), v = BigInt(`0x${e.slice(256, 384)}`), O = BigInt(`0x${e.slice(384, 512)}`), F = new T.G2.Point(
     T.fields.Fp2.create({ c0: g, c1: b }),
-    T.fields.Fp2.create({ c0: B, c1: O }),
+    T.fields.Fp2.create({ c0: v, c1: O }),
     T.fields.Fp2.ONE
   );
   return T.shortSignatures.verify(h, d, F);
 }
-async function il(e, t, n, r, s, i, o, a, c, u, l) {
-  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, o = o.startsWith("0x") ? o.slice(2) : o, xn(e);
+async function ol(e, t, n, r, s, i, o, a, c, u, l) {
+  n = n.toLowerCase(), r = r.toLowerCase(), t = t.startsWith("0x") ? t.slice(2) : t, o = o.startsWith("0x") ? o.slice(2) : o, _n(e);
   try {
-    if (!sl(
+    if (!il(
       t,
       a,
       n,
@@ -7207,7 +7207,7 @@ async function il(e, t, n, r, s, i, o, a, c, u, l) {
     const { reserveA: f, reserveB: d } = await Xt(
       n,
       r
-    ), p = await Xu(s, i, [n, r]);
+    ), p = await Ju(s, i, [n, r]);
     if (p.length !== 2)
       throw new Error("Invalid swap output amounts");
     C.setCheckPositive(
@@ -7234,7 +7234,7 @@ async function il(e, t, n, r, s, i, o, a, c, u, l) {
     const { reserveA: w, reserveB: h } = await Xt(
       n,
       r
-    ), g = n === gt ? f * 1000000000000000000n * 10000n / d : d * 1000000000000000000n * 10000n / f, b = n === gt ? w * 1000000000000000000n * 10000n / h : h * 1000000000000000000n * 10000n / w, B = g > b ? g - b : b - g, O = g !== 0n ? B * 10000n / g : 0n;
+    ), g = n === gt ? f * 1000000000000000000n * 10000n / d : d * 1000000000000000000n * 10000n / f, b = n === gt ? w * 1000000000000000000n * 10000n / h : h * 1000000000000000000n * 10000n / w, v = g > b ? g - b : b - g, O = g !== 0n ? v * 10000n / g : 0n;
     return {
       success: !0,
       amounts: p,
@@ -7246,7 +7246,7 @@ async function il(e, t, n, r, s, i, o, a, c, u, l) {
     return console.error("Error in swap2_request:", f), { success: !1, error_message: f.message };
   }
 }
-function ol(e, t, n, r, s, i) {
+function al(e, t, n, r, s, i) {
   if (i === "")
     return !0;
   let o = tt(S.from(e, "hex")).slice(2);
@@ -7260,12 +7260,12 @@ function ol(e, t, n, r, s, i) {
   );
   return T.shortSignatures.verify(f, c, g);
 }
-async function al(e, t, n, r, s, i, o) {
+async function cl(e, t, n, r, s, i, o) {
   if (n = n.toLowerCase(), n = n.startsWith("0x") ? n.slice(2) : n, n.length > 126)
     throw new Error("Pkscript too long");
-  t = t.startsWith("0x") ? t.slice(2) : t, s = s.startsWith("0x") ? s.slice(2) : s, xn(e);
+  t = t.startsWith("0x") ? t.slice(2) : t, s = s.startsWith("0x") ? s.slice(2) : s, _n(e);
   try {
-    if (!ol(t, i, n, r, o, s))
+    if (!al(t, i, n, r, o, s))
       throw new Error("Invalid BLS signature");
     if ((await C.get(t, gt) || 0n) < r)
       throw new Error("Insufficient token balance");
@@ -7317,10 +7317,10 @@ const fo = [
     outputs: [],
     stateMutability: "nonpayable"
   }
-], cl = fo, be = 1e3, Hs = 12e3, po = 2500n, ul = `Sign this message only on official BiS interfaces.
+], ul = fo, be = 1e3, Hs = 12e3, po = 2500n, ll = `Sign this message only on official BiS interfaces.
 This signature is required to generate your session-specific swap key.
 Signing this message outside official BiS interfaces may result in unauthorized access to your swap session and is at the user's own risk.
-By signing, you acknowledge that the BiS Terms of Service also apply: https://bestinslot.xyz/legal/terms.`, ll = `Sign this message only on official BiS interfaces.
+By signing, you acknowledge that the BiS Terms of Service also apply: https://bestinslot.xyz/legal/terms.`, fl = `Sign this message only on official BiS interfaces.
 This signature is required to generate your session-specific swap key.
 Signing this message outside official BiS interfaces may result in unauthorized access to your swap session and is at the user's own risk.
 By signing, you acknowledge that the BiS Terms of Service also apply: https://bestinslot.xyz/legal/terms.
@@ -7350,9 +7350,9 @@ async function J(e, t) {
 function Vs() {
   const e = Qe();
   if (e === "signet")
-    return ul;
-  if (e === "mainnet")
     return ll;
+  if (e === "mainnet")
+    return fl;
   throw new Error("Unsupported network for swap signature request text");
 }
 function j(e) {
@@ -7376,7 +7376,7 @@ function ho() {
   if (e === "signet")
     return new ge(fo);
   if (e === "mainnet")
-    return new ge(cl);
+    return new ge(ul);
   throw new Error("Unsupported network for orderbook contract address");
 }
 async function et() {
@@ -7397,14 +7397,14 @@ async function go(e = {}) {
   const s = await zr(Vs());
   if (r !== s)
     throw new Error("Deterministic signature mismatch. Please try again.");
-  const i = S.from(tt(`0x${r}`).slice(2), "hex"), o = S.from("my-app/bls-keygen", "utf-8"), a = cc(_i, i, void 0, o, 48), c = mi(a, T.fields.Fr.ORDER), u = S.from(c), l = wo(u), f = `0x${u.toString("hex")}`, d = {
+  const i = S.from(tt(`0x${r}`).slice(2), "hex"), o = S.from("my-app/bls-keygen", "utf-8"), a = uc(xi, i, void 0, o, 48), c = mi(a, T.fields.Fr.ORDER), u = S.from(c), l = wo(u), f = `0x${u.toString("hex")}`, d = {
     bitcoinAddress: t.address,
     swapPubkey: l,
     swapPrivkey: f
   };
   return await Ys(d), d;
 }
-function fl(e) {
+function dl(e) {
   const t = e.trim(), n = t.toLowerCase().startsWith("0x") ? t.slice(2) : t;
   if (!/^[0-9a-f]{64}$/i.test(n))
     throw new Error("Invalid security code. Expected a 32-byte hex value.");
@@ -7413,11 +7413,11 @@ function fl(e) {
     throw new Error("Invalid security code. Not a valid swap key.");
   return S.from(n, "hex");
 }
-async function dl(e, t = {}) {
+async function pl(e, t = {}) {
   const n = Wt();
   if (!n?.address)
     throw new Error("Ordinals wallet address not found.");
-  const r = fl(e), s = {
+  const r = dl(e), s = {
     bitcoinAddress: n.address,
     swapPubkey: wo(r),
     swapPrivkey: `0x${r.toString("hex")}`
@@ -7428,17 +7428,17 @@ async function dl(e, t = {}) {
     );
   return await Ys(s), s;
 }
-async function pl(e = {}) {
+async function hl(e = {}) {
   const t = Wt();
   if (!t?.address)
     throw new Error("Ordinals wallet address not found.");
   const n = await Rr(t.address);
   return n ? { wallet: n, created: !1 } : { wallet: await go(e), created: !0 };
 }
-async function hl() {
+async function wl() {
   return (await et())?.swapPrivkey ?? null;
 }
-async function wl() {
+async function gl() {
   const e = j("status");
   return await J(e, {
     method: "GET"
@@ -7460,10 +7460,10 @@ async function yo(e) {
   });
   return BigInt(s.result);
 }
-const gl = 6e4, Zs = /* @__PURE__ */ new Map(), Or = /* @__PURE__ */ new Map();
+const yl = 6e4, Zs = /* @__PURE__ */ new Map(), Or = /* @__PURE__ */ new Map();
 async function Jt() {
   const e = Qe(), t = Zs.get(e);
-  if (t && Date.now() - t.fetchedAt < gl)
+  if (t && Date.now() - t.fetchedAt < yl)
     return t.info;
   const n = j("get_swap_info"), r = await J(n, {
     method: "GET"
@@ -7471,7 +7471,7 @@ async function Jt() {
   let i = null;
   if (Or.delete(e), s != null)
     try {
-      i = ku(s);
+      i = Nu(s);
     } catch (a) {
       Or.set(e, a instanceof Error ? a.message : String(a));
     }
@@ -7534,7 +7534,7 @@ async function mo(e) {
     ticker: s.result.ticker
   };
 }
-async function yl(e) {
+async function bl(e) {
   const t = j("get_all_balances");
   return (await J(t, {
     method: "POST",
@@ -7546,7 +7546,7 @@ async function yl(e) {
     })
   })).result;
 }
-async function bl(e) {
+async function ml(e) {
   const t = await et();
   if (!t?.swapPubkey)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -7606,7 +7606,7 @@ async function Fe() {
   });
   return BigInt(r.result);
 }
-async function ml(e, t) {
+async function xl(e, t) {
   const n = j("get_swap_referrer_info"), s = await J(n, {
     method: "POST",
     headers: {
@@ -7623,7 +7623,7 @@ async function ml(e, t) {
 }
 async function Vr(e, t) {
   try {
-    return await ml(e, t);
+    return await xl(e, t);
   } catch (n) {
     return console.warn(`Failed to get referrer info for ref_id ${t}:`, n), { referrerPubkey: void 0, refReturnBps: void 0 };
   }
@@ -7646,10 +7646,10 @@ async function _l() {
     method: "GET"
   })).tokens;
 }
-function _r(e) {
+function xr(e) {
   return e === null ? null : BigInt(e);
 }
-async function xl(e = {}) {
+async function El(e = {}) {
   const t = e.order_by ?? "tvl_desc", n = e.page ?? 1, r = e.count ?? 20;
   if (r > 100)
     throw new Error("Count cannot exceed 100");
@@ -7666,14 +7666,14 @@ async function xl(e = {}) {
     total: o.total,
     data: o.data.map((a) => ({
       ...a,
-      volume_24h: _r(a.volume_24h),
-      volume_7d: _r(a.volume_7d),
-      tvl: _r(a.tvl),
+      volume_24h: xr(a.volume_24h),
+      volume_7d: xr(a.volume_7d),
+      tvl: xr(a.tvl),
       exposure_sats: BigInt(a.exposure_sats)
     }))
   };
 }
-async function El(e) {
+async function Sl(e) {
   const t = j(`volume/${e.pair_address}?days=${e.days}`);
   return await J(t, {
     method: "GET",
@@ -7682,7 +7682,7 @@ async function El(e) {
     }
   });
 }
-async function Sl(e) {
+async function Bl(e) {
   if (e.limit > 1e3)
     throw new Error("Limit cannot exceed 1000");
   let t = j(
@@ -7695,7 +7695,7 @@ async function Sl(e) {
     }
   });
 }
-async function Bl(e) {
+async function vl(e) {
   const t = j(
     `tvl/${encodeURIComponent(e.pair_address)}?${new URLSearchParams({
       days: String(e.days)
@@ -7708,7 +7708,7 @@ async function Bl(e) {
     }
   });
 }
-async function vl(e) {
+async function Ol(e) {
   if (e.limit > 200)
     throw new Error("Limit cannot exceed 200");
   const t = j(
@@ -7721,7 +7721,7 @@ async function vl(e) {
     }
   });
 }
-async function Ol(e) {
+async function Tl(e) {
   if (e.limit !== void 0) {
     if (e.limit > 200)
       throw new Error("Limit cannot exceed 200");
@@ -7752,7 +7752,7 @@ async function pn(e) {
     })
   })).result;
 }
-async function _o(e) {
+async function xo(e) {
   e.bls_pubkey = e.bls_pubkey.startsWith("0x") ? e.bls_pubkey.slice(2) : e.bls_pubkey, e.bls_pubkey = e.bls_pubkey.toLowerCase(), e.token_address = e.token_address.toLowerCase();
   const t = `Deposit Order:
 Bitcoin Address: ${e.btc_address}
@@ -7774,7 +7774,7 @@ async function rr(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), c = T.shortSignatures.sign(r, o).negate();
   return `0x${c.x.toString(16).padStart(128, "0")}${c.y.toString(16).padStart(128, "0")}`;
 }
-async function xo(e) {
+async function _o(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += "99", t += e.ordinals_script;
@@ -7796,7 +7796,7 @@ async function Eo(e) {
     body: JSON.stringify(e)
   });
 }
-async function Tl(e) {
+async function Il(e) {
   const t = j("deposit");
   return J(t, {
     method: "POST",
@@ -7825,7 +7825,7 @@ function So(e, t) {
 function Bo(e) {
   return e ? e.reduce((t, n) => t + n.amount, 0n) : 0n;
 }
-async function Il(e, t, n, r = !0, s, i = {}) {
+async function Rl(e, t, n, r = !0, s, i = {}) {
   const o = wn();
   if (!o || !o.wallets) throw new Error("Wallets not found");
   const a = ze(), c = Hn(), u = Wt();
@@ -7845,9 +7845,9 @@ async function Il(e, t, n, r = !0, s, i = {}) {
         `Insufficient BRC-2.0 + BRC20 available balance. Current BRC-2.0: ${b}, Available in base: ${Qt}, Reclaimable: ${te}, Required: ${t}`
       ), new Error("Insufficient BRC-2.0 + BRC20 available balance");
   }
-  const B = await yo(e);
+  const v = await yo(e);
   let O = !1;
-  if (B < BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff")) {
+  if (v < BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff")) {
     if (!r)
       throw console.error("Insufficient allowance for BRC-2.0 token transfer."), new Error("Insufficient allowance for BRC-2.0 token transfer.");
     O = !0;
@@ -7855,45 +7855,45 @@ async function Il(e, t, n, r = !0, s, i = {}) {
   const F = new Hr(
     i,
     3 + (w > 0n ? 2 : 0) + (O ? 2 : 0)
-  ), q = F.wrap(Ir(o.provider)), P = er(), I = `0x095ea7b3000000000000000000000000${P.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, k = await Ke(I), m = X.str(
-    `{"p":"brc20-prog","op":"c","c":"${e}","b":"${k}"}`
-  ), D = new ae(
+  ), W = F.wrap(Ir(o.provider)), A = er(), k = `0x095ea7b3000000000000000000000000${A.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, I = await Ke(k), x = X.str(
+    `{"p":"brc20-prog","op":"c","c":"${e}","b":"${I}"}`
+  ), q = new ae(
     X.str("text/plain"),
     null,
     null,
     null,
     null,
-    m
-  ), V = (await et())?.swapPubkey;
-  if (!V)
+    x
+  ), H = (await et())?.swapPubkey;
+  if (!H)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   F.next();
-  const U = await _o({
+  const U = await xo({
     btc_address: d,
-    bls_pubkey: V,
+    bls_pubkey: H,
     token_address: e
-  }), y = gn.address.toOutputScript(d, ze()), x = await xo({
-    pubkey: V,
+  }), y = gn.address.toOutputScript(d, ze()), _ = await _o({
+    pubkey: H,
     ordinals_script: y.toString("hex")
-  }), v = await Eo({
+  }), B = await Eo({
     btc_address: d,
-    bls_pubkey: V,
+    bls_pubkey: H,
     token_address: e.toLowerCase(),
     bip322_signature: U,
-    bls12_signature: x
-  }), N = v.edcsa_signature, A = v.pubkey_idx, $ = v.token_idx, M = await rr({
-    pubkey: V,
-    pk_idx: BigInt(A)
-  }), W = ho().encodeFunctionData("deposit", [
+    bls12_signature: _
+  }), N = B.edcsa_signature, P = B.pubkey_idx, $ = B.token_idx, D = await rr({
+    pubkey: H,
+    pk_idx: BigInt(P)
+  }), M = ho().encodeFunctionData("deposit", [
     e,
     $,
     t,
-    V,
-    BigInt(A),
-    M,
+    H,
+    BigInt(P),
+    D,
     N
-  ]), Z = await Ke(W), at = X.str(
-    `{"p":"brc20-prog","op":"c","c":"${P}","b":"${Z}"}`
+  ]), Z = await Ke(M), at = X.str(
+    `{"p":"brc20-prog","op":"c","c":"${A}","b":"${Z}"}`
   ), Q = new ae(
     X.str("text/plain"),
     null,
@@ -7902,7 +7902,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
     null,
     at
   );
-  let G = null, ft = null, ht = null, xt = null, z = null, ut = null, jt = null, Sn = null, rt = null;
+  let G = null, ft = null, ht = null, _t = null, z = null, ut = null, jt = null, Sn = null, rt = null;
   if (w > 0n) {
     const Lt = So(
       w,
@@ -7918,13 +7918,13 @@ async function Il(e, t, n, r = !0, s, i = {}) {
       )
     );
     if ((s?.length ?? 0) > 0) {
-      const vn = await zs(s, d), Oe = await Go(
+      const vn = await zs(s, d), Oe = await Ho(
         Qt,
         vn,
         n,
         null,
         !0,
-        q
+        W
       );
       rt = {
         signed_commit_tx_hex: Oe.signedCommitTxHex,
@@ -7942,9 +7942,9 @@ async function Il(e, t, n, r = !0, s, i = {}) {
         null,
         0,
         !0,
-        q
+        W
       );
-    z = rt.signed_commit_tx_hex, ut = rt.signed_reveal_tx_hex, ht = rt.commit_txid, xt = rt.reveal_txid, G = rt.inscription_id;
+    z = rt.signed_commit_tx_hex, ut = rt.signed_reveal_tx_hex, ht = rt.commit_txid, _t = rt.reveal_txid, G = rt.inscription_id;
     const te = `${G.split("i")[0]}:0:0`;
     ft = rt.secret;
     let De = null;
@@ -7975,7 +7975,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
         ],
         n,
         !0,
-        q
+        W
       );
     } finally {
       Yt();
@@ -7994,13 +7994,13 @@ async function Il(e, t, n, r = !0, s, i = {}) {
     );
     try {
       Pt(Lt, null), Be = await Xr(
-        D,
+        q,
         n,
         null,
         null,
         0,
         !0,
-        q
+        W
       ), It = Be.signed_commit_tx_hex, de = Be.signed_reveal_tx_hex, St = Be.commit_txid, Dt = Be.reveal_txid, Et = Be.inscription_id, dt = Be.secret;
     } finally {
       Yt();
@@ -8031,7 +8031,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
         ],
         n,
         !0,
-        q
+        W
       );
     } finally {
       Yt();
@@ -8075,7 +8075,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
       null,
       0,
       !0,
-      q
+      W
     ), ar = ve.signedCommitTxHex, cr = ve.signedRevealTxHex, nn = ve.inscriptionId;
     const Lt = `${nn.split("i")[0]}:0:0`;
     Yr = ve.secret, qe.push(ar, cr), Pt(qe, [nn, Lt]);
@@ -8094,7 +8094,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
       [],
       n,
       !0,
-      q
+      W
     );
   } finally {
     Yt();
@@ -8125,7 +8125,7 @@ async function Il(e, t, n, r = !0, s, i = {}) {
     base_deposit_details: w > 0n ? {
       commit_txid: ht,
       commit_txhex: z,
-      reveal_txid: xt,
+      reveal_txid: _t,
       reveal_txhex: ut,
       send_to_opreturn_txid: Sn,
       send_to_opreturn_txhex: jt,
@@ -8134,9 +8134,9 @@ async function Il(e, t, n, r = !0, s, i = {}) {
       fee_rate: n
     } : null
   };
-  return (await Tl(Uo)).result;
+  return (await Il(Uo)).result;
 }
-async function Rl(e, t, n, r = !0, s) {
+async function kl(e, t, n, r = !0, s) {
   const i = wn();
   if (!i || !i.wallets) throw new Error("Wallets not found");
   const o = ze(), a = Hn();
@@ -8161,40 +8161,40 @@ async function Rl(e, t, n, r = !0, s) {
       throw console.error("Insufficient allowance for BRC-2.0 token transfer."), new Error("Insufficient allowance for BRC-2.0 token transfer.");
     g = !0;
   }
-  const b = er(), B = `0x095ea7b3000000000000000000000000${b.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, O = await Ke(B), F = X.str(
+  const b = er(), v = `0x095ea7b3000000000000000000000000${b.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, O = await Ke(v), F = X.str(
     `{"p":"brc20-prog","op":"c","c":"${e}","b":"${O}"}`
-  ), q = new ae(
+  ), W = new ae(
     X.str("text/plain"),
     null,
     null,
     null,
     null,
     F
-  ), P = (await et())?.swapPubkey;
-  if (!P)
+  ), A = (await et())?.swapPubkey;
+  if (!A)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const I = `0x${"00".repeat(64)}`, k = 1, m = 1, D = await rr({
-    pubkey: P,
-    pk_idx: BigInt(k)
+  const k = `0x${"00".repeat(64)}`, I = 1, x = 1, q = await rr({
+    pubkey: A,
+    pk_idx: BigInt(I)
   }), U = ho().encodeFunctionData("deposit", [
     e,
-    m,
+    x,
     t,
-    P,
-    BigInt(k),
-    D,
-    I
-  ]), y = await Ke(U), x = X.str(
+    A,
+    BigInt(I),
+    q,
+    k
+  ]), y = await Ke(U), _ = X.str(
     `{"p":"brc20-prog","op":"c","c":"${b}","b":"${y}"}`
-  ), v = new ae(
+  ), B = new ae(
     X.str("text/plain"),
     null,
     null,
     null,
     null,
-    x
+    _
   );
-  let N = null, A = null, $ = null, M = null, L = null, W = 0;
+  let N = null, P = null, $ = null, D = null, L = null, M = 0;
   if (f > 0n) {
     const rt = So(
       f,
@@ -8229,14 +8229,14 @@ async function Rl(e, t, n, r = !0, s) {
         null,
         0
       );
-    A = dt.unsigned_commit_tx_hex, $ = dt.signed_reveal_tx_hex, N = dt.inscription_id, W += dt.total_fee;
+    P = dt.unsigned_commit_tx_hex, $ = dt.signed_reveal_tx_hex, N = dt.inscription_id, M += dt.total_fee;
     const St = `${N.split("i")[0]}:0:0`;
     let Dt = null;
     try {
-      if (!A)
+      if (!P)
         throw new Error("Base deposit commit tx hex is missing");
       Pt(
-        [A, $],
+        [P, $],
         [N, St]
       );
       const It = new Ft(
@@ -8264,20 +8264,20 @@ async function Rl(e, t, n, r = !0, s) {
     }
     if (Dt == null)
       throw new Error("Failed to send inscription to OP_RETURN");
-    M = Dt.unsigned_tx_hex, L = Dt.txid, W += Dt.tx_fee;
+    D = Dt.unsigned_tx_hex, L = Dt.txid, M += Dt.tx_fee;
   }
   let Z = null, at = null, Q = null, G = null, ft = null, ht = 0;
   if (g) {
     const rt = [];
     f > 0n && rt.push(
-      A,
+      P,
       $,
-      M
+      D
     );
     try {
       Pt(rt, null);
       const St = await Kr(
-        q,
+        W,
         n,
         null,
         null,
@@ -8320,15 +8320,15 @@ async function Rl(e, t, n, r = !0, s) {
       throw new Error("Failed to send inscription to OP_RETURN");
     G = dt.unsigned_tx_hex, ft = dt.txid, ht += dt.tx_fee;
   }
-  const xt = [], z = [];
+  const _t = [], z = [];
   if (f > 0n) {
-    if (!A || !$ || !M)
+    if (!P || !$ || !D)
       throw new Error("Base deposit transaction hexes are missing");
     z.push(
-      A,
+      P,
       $,
-      M
-    ), xt.push({
+      D
+    ), _t.push({
       utxo: `${L}:1`,
       value: be,
       script_type: Ln(l.outputScript, o),
@@ -8338,7 +8338,7 @@ async function Rl(e, t, n, r = !0, s) {
   if (g) {
     if (!at || !Q || !G)
       throw new Error("Allowance transaction hexes are missing");
-    z.push(at, Q, G), xt.push({
+    z.push(at, Q, G), _t.push({
       utxo: `${ft}:1`,
       value: be,
       script_type: Ln(l.outputScript, o),
@@ -8349,8 +8349,8 @@ async function Rl(e, t, n, r = !0, s) {
   try {
     z.length > 0 && Pt(z, null);
     const rt = await Ks(
-      v,
-      xt,
+      B,
+      _t,
       n,
       null,
       null,
@@ -8379,13 +8379,13 @@ async function Rl(e, t, n, r = !0, s) {
     throw new Error("Failed to send inscription to OP_RETURN");
   return ut += jt.tx_fee, {
     needs_approval: g,
-    base_deposit_fees_total: W,
+    base_deposit_fees_total: M,
     allowance_fees_total: ht,
     deposit_fees_total: ut,
     fee_rate: n
   };
 }
-async function kl(e) {
+async function Nl(e) {
   const t = j("wrap");
   return J(t, {
     method: "POST",
@@ -8395,7 +8395,7 @@ async function kl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Nl(e) {
+async function Cl(e) {
   const t = j("estimate_wrap_gas");
   return J(t, {
     method: "POST",
@@ -8405,7 +8405,7 @@ async function Nl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Cl(e, t, n = {}) {
+async function $l(e, t, n = {}) {
   const r = await Jt(), s = wn();
   if (!s || !s.wallets) throw new Error("Wallets not found");
   const i = new Hr(n), o = i.wrap(Ir(s.provider)), a = Hn(), c = Wt();
@@ -8417,11 +8417,11 @@ async function Cl(e, t, n = {}) {
   if (!f)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   i.next();
-  const d = await _o({
+  const d = await xo({
     btc_address: u,
     bls_pubkey: f,
     token_address: r.wbtc_address
-  }), p = gn.address.toOutputScript(u, ze()), w = await xo({
+  }), p = gn.address.toOutputScript(u, ze()), w = await _o({
     pubkey: f,
     ordinals_script: p.toString("hex")
   }), h = await Eo({
@@ -8430,38 +8430,38 @@ async function Cl(e, t, n = {}) {
     token_address: r.wbtc_address.toLowerCase(),
     bip322_signature: d,
     bls12_signature: w
-  }), g = h.edcsa_signature, b = h.pubkey_idx, B = h.token_idx, O = await rr({
+  }), g = h.edcsa_signature, b = h.pubkey_idx, v = h.token_idx, O = await rr({
     pubkey: f,
     pk_idx: BigInt(b)
   }), F = le.defaultAbiCoder().encode(
     ["address", "uint32", "bytes", "uint64", "bytes", "bytes"],
     [
       r.wbtc_address,
-      B,
+      v,
       S.from(f.slice(2), "hex"),
       b,
       S.from(O.slice(2), "hex"),
       S.from(g.slice(2), "hex")
     ]
-  ), P = `0x5608f857${le.defaultAbiCoder().encode(
+  ), A = `0x5608f857${le.defaultAbiCoder().encode(
     ["address", "bytes"],
     [l, S.from(F.slice(2), "hex")]
-  ).slice(2)}`, I = await Ke(P), k = X.str(
-    `{"p":"brc20-prog","op":"c","c":"${r.wbtc_address}","b":"${I}"}`
+  ).slice(2)}`, k = await Ke(A), I = X.str(
+    `{"p":"brc20-prog","op":"c","c":"${r.wbtc_address}","b":"${k}"}`
   );
-  let m = 0;
-  for (let D = 0; D < 5; D++) {
-    const V = k.length * Hs, U = m > V ? Math.ceil((m - V) / Hs) : 0, y = X.from(
-      S.concat([k, X.str(" ".repeat(U))])
-    ), x = new ae(
+  let x = 0;
+  for (let q = 0; q < 5; q++) {
+    const H = I.length * Hs, U = x > H ? Math.ceil((x - H) / Hs) : 0, y = X.from(
+      S.concat([I, X.str(" ".repeat(U))])
+    ), _ = new ae(
       X.str("text/plain"),
       null,
       null,
       null,
       null,
       y
-    ), v = await Xs(
-      x,
+    ), B = await Xs(
+      _,
       [],
       t,
       null,
@@ -8469,14 +8469,14 @@ async function Cl(e, t, n = {}) {
       0,
       !0,
       o
-    ), N = v.signedCommitTxHex, A = v.signedRevealTxHex, $ = v.inscriptionId, M = `${$.split("i")[0]}:0:0`, L = v.secret;
-    let W = null;
+    ), N = B.signedCommitTxHex, P = B.signedRevealTxHex, $ = B.inscriptionId, D = `${$.split("i")[0]}:0:0`, L = B.secret;
+    let M = null;
     try {
       Pt(
-        [N, A],
-        [$, M]
+        [N, P],
+        [$, D]
       );
-      const xt = new Ft(
+      const _t = new Ft(
         !0,
         S.from(me.encode(["OP_RETURN", X.str("BRC20PROG")], !1)),
         null,
@@ -8489,10 +8489,10 @@ async function Cl(e, t, n = {}) {
           value: Number.parseInt(e.toString())
         }
       ];
-      W = await Cn(
+      M = await Cn(
         $,
         [],
-        xt,
+        _t,
         1,
         z,
         t,
@@ -8502,31 +8502,31 @@ async function Cl(e, t, n = {}) {
     } finally {
       Yt();
     }
-    if (W == null)
+    if (M == null)
       throw new Error("Failed to send inscription to OP_RETURN");
-    const Z = W.signedTxHex, at = W.txId, Q = {
-      commit_txid: v.commitTxId,
+    const Z = M.signedTxHex, at = M.txId, Q = {
+      commit_txid: B.commitTxId,
       commit_txhex: N,
-      reveal_txid: v.revealTxId,
-      reveal_txhex: A,
+      reveal_txid: B.revealTxId,
+      reveal_txhex: P,
       send_to_opreturn_txid: at,
       send_to_opreturn_txhex: Z,
       secret: L,
       inscription_id: $,
       fee_rate: t
-    }, G = await Nl(Q), ft = Math.max(
+    }, G = await Cl(Q), ft = Math.max(
       G.estimated_gas + 1e5,
       G.estimated_gas * 1.2
     );
     if (G.allocated_gas < ft) {
-      m = ft + 5e4;
+      x = ft + 5e4;
       continue;
     }
-    return (await kl(Q)).result;
+    return (await Nl(Q)).result;
   }
   throw new Error("Failed to estimate gas for wrap order after multiple attempts");
 }
-async function $l(e, t) {
+async function Ll(e, t) {
   const n = await Jt(), r = wn();
   if (!r || !r.wallets) throw new Error("Wallets not found");
   const s = Hn();
@@ -8560,30 +8560,31 @@ async function $l(e, t) {
     null,
     null,
     h
-  );
-  let b = 0;
-  const B = await Ks(
+  ), b = await Go(s.address);
+  let v = 0;
+  const O = await Ks(
     g,
     [],
     t,
     null,
     null,
-    0
-  ), O = B.unsigned_commit_tx_hex, F = B.signed_reveal_tx_hex, q = B.inscription_id, P = `${q.split("i")[0]}:0:0`;
-  b += B.total_fee;
+    0,
+    b
+  ), F = O.unsigned_commit_tx_hex, W = O.signed_reveal_tx_hex, A = O.inscription_id, k = `${A.split("i")[0]}:0:0`;
+  v += O.total_fee;
   let I = null;
   try {
     Pt(
-      [O, F],
-      [q, P]
+      [F, W],
+      [A, k]
     );
-    const m = new Ft(
+    const q = new Ft(
       !0,
       S.from(me.encode(["OP_RETURN", X.str("BRC20PROG")], !1)),
       null,
       null,
       null
-    ), D = [
+    ), H = [
       // send BTC to WBTC handler
       {
         wallet: new Ft(!1, null, n.wbtc_handler_address, null, null),
@@ -8591,24 +8592,25 @@ async function $l(e, t) {
       }
     ];
     I = await Nn(
-      q,
+      A,
       [],
-      m,
+      q,
       1,
-      D,
-      t
+      H,
+      t,
+      b
     );
   } finally {
     Yt();
   }
   if (I == null)
     throw new Error("Failed to send inscription to OP_RETURN");
-  return b += I.tx_fee, {
-    total_fee: b,
+  return v += I.tx_fee, {
+    total_fee: v,
     fee_rate: t
   };
 }
-async function Ll(e, t, n, r) {
+async function Al(e, t, n, r) {
   const s = await Jt();
   Qn(s.wbtc_address, s.factory_address);
   const i = (await et())?.swapPubkey;
@@ -8617,7 +8619,7 @@ async function Ll(e, t, n, r) {
   const o = {
     balanceOf: En,
     reservesOf: Pe
-  }, a = await $t("add_liquidity"), c = await Qu(
+  }, a = await $t("add_liquidity"), c = await tl(
     o,
     i,
     e,
@@ -8645,7 +8647,7 @@ async function Ll(e, t, n, r) {
     throw new Error("No data returned from add liquidity request.");
   return c.data;
 }
-async function Al(e) {
+async function Pl(e) {
   e.token1_addr = e.token1_addr.toLowerCase(), e.token2_addr = e.token2_addr.toLowerCase();
   const t = `Add Liquidity Order:
 Token 1 Address: ${e.token1_addr}
@@ -8661,7 +8663,7 @@ BTC Fee: ${e.btc_fee}
 By signing this message, you authorize the creation of an add liquidity order with the above parameters.`;
   return await Le(t, "ordinals");
 }
-async function Pl(e) {
+async function Fl(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += e.nonce.toString(16).padStart(8, "0"), t += "01", t += e.token1_addr.slice(2).padStart(40, "0"), t += e.token2_addr.slice(2).padStart(40, "0"), t += e.amt1.toString(16).padStart(64, "0"), t += e.amt2.toString(16).padStart(64, "0"), t += e.minamt1.toString(16).padStart(64, "0"), t += e.minamt2.toString(16).padStart(64, "0"), t += e.token1FeeBps.toString(16).padStart(64, "0"), t += e.token2FeeBps.toString(16).padStart(64, "0"), t += e.btc_fee.toString(16).padStart(64, "0");
@@ -8673,7 +8675,7 @@ async function Pl(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), a = T.shortSignatures.sign(r, o);
   return `0x${a.x.toString(16).padStart(128, "0")}${a.y.toString(16).padStart(128, "0")}`;
 }
-async function Fl(e) {
+async function Ul(e) {
   const t = j("add_liq_req");
   return J(t, {
     method: "POST",
@@ -8683,11 +8685,11 @@ async function Fl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Ul(e, t, n, r, s) {
+async function ql(e, t, n, r, s) {
   const i = (await et())?.swapPubkey;
   if (!i)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const o = n * (10000n - s) / 10000n, a = r * (10000n - s) / 10000n, c = 0n, u = 0n, l = await Fe(), f = await $t("add_liquidity"), d = await Al({
+  const o = n * (10000n - s) / 10000n, a = r * (10000n - s) / 10000n, c = 0n, u = 0n, l = await Fe(), f = await $t("add_liquidity"), d = await Pl({
     token1_addr: e,
     token2_addr: t,
     amt1: n.toString(),
@@ -8697,7 +8699,7 @@ async function Ul(e, t, n, r, s) {
     token1FeeBps: c.toString(),
     token2FeeBps: u.toString(),
     btc_fee: f.toString()
-  }), p = await Pl({
+  }), p = await Fl({
     pubkey: i,
     nonce: l,
     token1_addr: e,
@@ -8710,7 +8712,7 @@ async function Ul(e, t, n, r, s) {
     token2FeeBps: u,
     btc_fee: f
   });
-  return await Fl({
+  return await Ul({
     pubkey: i,
     token1_addr: e,
     token2_addr: t,
@@ -8725,7 +8727,7 @@ async function Ul(e, t, n, r, s) {
     bip322_signature: d
   });
 }
-async function ql(e, t, n) {
+async function Dl(e, t, n) {
   const r = await Jt();
   Qn(r.wbtc_address, r.factory_address);
   const s = (await et())?.swapPubkey;
@@ -8734,7 +8736,7 @@ async function ql(e, t, n) {
   const i = {
     balanceOf: En,
     reservesOf: Pe
-  }, o = await $t("remove_liquidity"), a = await el(
+  }, o = await $t("remove_liquidity"), a = await nl(
     i,
     s,
     e,
@@ -8761,7 +8763,7 @@ async function ql(e, t, n) {
     throw new Error("No data returned from remove liquidity request.");
   return a.data;
 }
-async function Dl(e) {
+async function Ml(e) {
   e.token1_addr = e.token1_addr.toLowerCase(), e.token2_addr = e.token2_addr.toLowerCase();
   const t = `Remove Liquidity Order:
 Token 1 Address: ${e.token1_addr}
@@ -8776,7 +8778,7 @@ BTC Fee: ${e.btc_fee}
 By signing this message, you authorize the creation of a remove liquidity order with the above parameters.`;
   return await Le(t, "ordinals");
 }
-async function Ml(e) {
+async function Wl(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += e.nonce.toString(16).padStart(8, "0"), t += "02", t += e.token1_addr.slice(2).padStart(40, "0"), t += e.token2_addr.slice(2).padStart(40, "0"), t += e.lp_amt.toString(16).padStart(64, "0"), t += e.minamt1.toString(16).padStart(64, "0"), t += e.minamt2.toString(16).padStart(64, "0"), t += e.token1FeeBps.toString(16).padStart(64, "0"), t += e.token2FeeBps.toString(16).padStart(64, "0"), t += e.btc_fee.toString(16).padStart(64, "0");
@@ -8788,7 +8790,7 @@ async function Ml(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), a = T.shortSignatures.sign(r, o);
   return `0x${a.x.toString(16).padStart(128, "0")}${a.y.toString(16).padStart(128, "0")}`;
 }
-async function Wl(e) {
+async function Gl(e) {
   const t = j("remove_liq_req");
   return J(t, {
     method: "POST",
@@ -8798,11 +8800,11 @@ async function Wl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Gl(e, t, n, r, s, i) {
+async function Hl(e, t, n, r, s, i) {
   const o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const a = r * (10000n - i) / 10000n, c = s * (10000n - i) / 10000n, u = 0n, l = 0n, f = await Fe(), d = await $t("remove_liquidity"), p = await Dl({
+  const a = r * (10000n - i) / 10000n, c = s * (10000n - i) / 10000n, u = 0n, l = 0n, f = await Fe(), d = await $t("remove_liquidity"), p = await Ml({
     token1_addr: e,
     token2_addr: t,
     lp_amt: n.toString(),
@@ -8811,7 +8813,7 @@ async function Gl(e, t, n, r, s, i) {
     token1FeeBps: u.toString(),
     token2FeeBps: l.toString(),
     btc_fee: d.toString()
-  }), w = await Ml({
+  }), w = await Wl({
     pubkey: o,
     nonce: f,
     token1_addr: e,
@@ -8823,7 +8825,7 @@ async function Gl(e, t, n, r, s, i) {
     token2FeeBps: l,
     btc_fee: d
   });
-  return await Wl({
+  return await Gl({
     pubkey: o,
     token1_addr: e,
     token2_addr: t,
@@ -8843,9 +8845,9 @@ async function sr(e, t) {
     const r = Or.get(Qe());
     throw new Error(r ?? io);
   }
-  return Nu(e, t, n.fee_policy);
+  return Cu(e, t, n.fee_policy);
 }
-async function Hl(e, t, n) {
+async function Vl(e, t, n) {
   const r = await Jt();
   await nr(e, t);
   const s = (await et())?.swapPubkey;
@@ -8854,7 +8856,7 @@ async function Hl(e, t, n) {
   const i = {
     balanceOf: En,
     reservesOf: Pe
-  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await sr(e, t), u = await rl(
+  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await sr(e, t), u = await sl(
     i,
     s,
     e,
@@ -8893,7 +8895,7 @@ async function Hl(e, t, n) {
     fees: ao(n, u.amounts[1], a, c, o)
   };
 }
-async function Vl(e) {
+async function Zl(e) {
   e.token1_addr = e.token1_addr.toLowerCase(), e.token2_addr = e.token2_addr.toLowerCase(), e.referrer_pubkey = e.referrer_pubkey?.startsWith("0x") ? e.referrer_pubkey.slice(2) : e.referrer_pubkey;
   const t = `Swap Order:
 Token 1 Address: ${e.token1_addr}
@@ -8909,7 +8911,7 @@ ${e.referrer_pubkey ? `Referrer Pubkey: ${e.referrer_pubkey}
 By signing this message, you authorize the creation of a swap order with the above parameters.`;
   return await Le(t, "ordinals");
 }
-async function Zl(e) {
+async function Yl(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey, e.referrer_pubkey = e.referrer_pubkey?.startsWith("0x") ? e.referrer_pubkey.slice(2) : e.referrer_pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += e.nonce.toString(16).padStart(8, "0"), t += "03", t += e.token1_addr.slice(2).padStart(64, "0"), t += e.token2_addr.slice(2).padStart(64, "0"), t += e.in_amt.toString(16).padStart(64, "0"), t += e.min_out_amt.toString(16).padStart(64, "0"), t += e.token1FeeBps.toString(16).padStart(64, "0"), t += e.token2FeeBps.toString(16).padStart(64, "0"), t += e.btc_fee.toString(16).padStart(64, "0"), e.referrer_pubkey && (t += tt(S.from(e.referrer_pubkey, "hex")).slice(2), t += po.toString(16).padStart(8, "0"), e.ref_return_bps && e.ref_return_bps > 0n && (t += e.ref_return_bps.toString(16).padStart(8, "0")));
@@ -8921,7 +8923,7 @@ async function Zl(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), a = T.shortSignatures.sign(r, o);
   return `0x${a.x.toString(16).padStart(128, "0")}${a.y.toString(16).padStart(128, "0")}`;
 }
-async function Yl(e) {
+async function zl(e) {
   const t = j("swap");
   return J(t, {
     method: "POST",
@@ -8931,12 +8933,12 @@ async function Yl(e) {
     body: JSON.stringify(e)
   });
 }
-async function zl(e, t, n, r, s, i) {
+async function Kl(e, t, n, r, s, i) {
   const o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   await nr(e, t);
-  const a = r * (10000n - s) / 10000n, c = await Fe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await sr(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Vl({
+  const a = r * (10000n - s) / 10000n, c = await Fe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await sr(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Zl({
     token1_addr: e,
     token2_addr: t,
     in_amt: n.toString(),
@@ -8946,7 +8948,7 @@ async function zl(e, t, n, r, s, i) {
     btc_fee: u.toString(),
     referrer_pubkey: d,
     ref_return_bps: p ? p.toString() : void 0
-  }), h = await Zl({
+  }), h = await Yl({
     pubkey: o,
     nonce: c,
     token1_addr: e,
@@ -8959,7 +8961,7 @@ async function zl(e, t, n, r, s, i) {
     referrer_pubkey: d,
     ref_return_bps: p
   });
-  return await Yl({
+  return await zl({
     pubkey: o,
     token1_addr: e,
     token2_addr: t,
@@ -8974,7 +8976,7 @@ async function zl(e, t, n, r, s, i) {
     referrer_id: d ? i : void 0
   });
 }
-async function Kl(e, t, n) {
+async function Xl(e, t, n) {
   const r = await Jt();
   await nr(e, t);
   const s = (await et())?.swapPubkey;
@@ -8983,7 +8985,7 @@ async function Kl(e, t, n) {
   const i = {
     balanceOf: En,
     reservesOf: Pe
-  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await sr(e, t), u = await il(
+  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await sr(e, t), u = await ol(
     i,
     s,
     e,
@@ -9022,7 +9024,7 @@ async function Kl(e, t, n) {
     fees: ao(u.amounts[0], n, a, c, o)
   };
 }
-async function Xl(e) {
+async function Jl(e) {
   e.token1_addr = e.token1_addr.toLowerCase(), e.token2_addr = e.token2_addr.toLowerCase(), e.referrer_pubkey = e.referrer_pubkey?.startsWith("0x") ? e.referrer_pubkey.slice(2) : e.referrer_pubkey;
   const t = `Swap Order:
 Token 1 Address: ${e.token1_addr}
@@ -9038,7 +9040,7 @@ ${e.referrer_pubkey ? `Referrer Pubkey: ${e.referrer_pubkey}
 By signing this message, you authorize the creation of a swap order with the above parameters.`;
   return await Le(t, "ordinals");
 }
-async function Jl(e) {
+async function jl(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey, e.referrer_pubkey = e.referrer_pubkey?.startsWith("0x") ? e.referrer_pubkey.slice(2) : e.referrer_pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += e.nonce.toString(16).padStart(8, "0"), t += "04", t += e.token1_addr.slice(2).padStart(64, "0"), t += e.token2_addr.slice(2).padStart(64, "0"), t += e.max_in_amt.toString(16).padStart(64, "0"), t += e.out_amt.toString(16).padStart(64, "0"), t += e.token1FeeBps.toString(16).padStart(64, "0"), t += e.token2FeeBps.toString(16).padStart(64, "0"), t += e.btc_fee.toString(16).padStart(64, "0"), e.referrer_pubkey && (t += tt(S.from(e.referrer_pubkey, "hex")).slice(2), t += po.toString(16).padStart(8, "0"), e.ref_return_bps && e.ref_return_bps > 0n && (t += e.ref_return_bps.toString(16).padStart(8, "0")));
@@ -9050,7 +9052,7 @@ async function Jl(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), a = T.shortSignatures.sign(r, o);
   return `0x${a.x.toString(16).padStart(128, "0")}${a.y.toString(16).padStart(128, "0")}`;
 }
-async function jl(e) {
+async function Ql(e) {
   const t = j("swap2");
   return J(t, {
     method: "POST",
@@ -9060,12 +9062,12 @@ async function jl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Ql(e, t, n, r, s, i) {
+async function tf(e, t, n, r, s, i) {
   const o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   await nr(e, t);
-  const a = n * (10000n + s) / 10000n, c = await Fe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await sr(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Xl({
+  const a = n * (10000n + s) / 10000n, c = await Fe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await sr(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Jl({
     token1_addr: e,
     token2_addr: t,
     max_in_amt: a.toString(),
@@ -9075,7 +9077,7 @@ async function Ql(e, t, n, r, s, i) {
     btc_fee: u.toString(),
     referrer_pubkey: d,
     ref_return_bps: p ? p.toString() : void 0
-  }), h = await Jl({
+  }), h = await jl({
     pubkey: o,
     nonce: c,
     token1_addr: e,
@@ -9088,7 +9090,7 @@ async function Ql(e, t, n, r, s, i) {
     referrer_pubkey: d,
     ref_return_bps: p
   });
-  return await jl({
+  return await Ql({
     pubkey: o,
     token1_addr: e,
     token2_addr: t,
@@ -9142,7 +9144,7 @@ async function Io(e) {
     body: JSON.stringify(e)
   });
 }
-async function tf(e, t, n) {
+async function ef(e, t, n) {
   const r = (await et())?.swapPubkey;
   if (!r)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -9173,7 +9175,7 @@ async function tf(e, t, n) {
     bip322_signature: l
   });
 }
-async function ef(e, t) {
+async function nf(e, t) {
   const n = (await et())?.swapPubkey;
   if (!n)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -9207,7 +9209,7 @@ async function ef(e, t) {
     bip322_signature: l
   });
 }
-async function nf(e, t) {
+async function rf(e, t) {
   const n = await Jt();
   Qn(n.wbtc_address, n.factory_address);
   const r = (await et())?.swapPubkey;
@@ -9216,7 +9218,7 @@ async function nf(e, t) {
   const s = {
     balanceOf: En,
     reservesOf: Pe
-  }, i = await $t("unwrap"), o = await al(
+  }, i = await $t("unwrap"), o = await cl(
     s,
     r,
     e,
@@ -9233,7 +9235,7 @@ async function nf(e, t) {
     throw new Error("No data returned from unwrap request.");
   return { amt: o.data.amt };
 }
-async function rf(e) {
+async function sf(e) {
   e.pkscript = e.pkscript.toLowerCase();
   const t = `Unwrap Order:
 Pkscript: ${e.pkscript}
@@ -9245,7 +9247,7 @@ BTC Fee: ${e.btc_fee}
 By signing this message, you authorize the creation of a withdraw order with the above parameters.`;
   return await Le(t, "ordinals");
 }
-async function sf(e) {
+async function of(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey;
   let t = tt(S.from(e.pubkey, "hex")).slice(2);
   t += e.nonce.toString(16).padStart(8, "0"), t += "06", t += tt(S.from(e.pkscript, "hex")).slice(2), t += e.amt.toString(16).padStart(64, "0"), t += e.btc_fee.toString(16).padStart(64, "0");
@@ -9257,7 +9259,7 @@ async function sf(e) {
   const i = s.swapPrivkey.startsWith("0x") ? s.swapPrivkey.slice(2) : s.swapPrivkey, o = S.from(i, "hex"), a = T.shortSignatures.sign(r, o);
   return `0x${a.x.toString(16).padStart(128, "0")}${a.y.toString(16).padStart(128, "0")}`;
 }
-async function of(e) {
+async function af(e) {
   const t = j("unwrap");
   return J(t, {
     method: "POST",
@@ -9267,24 +9269,24 @@ async function of(e) {
     body: JSON.stringify(e)
   });
 }
-async function af(e, t) {
+async function cf(e, t) {
   const n = (await et())?.swapPubkey;
   if (!n)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const r = 0n, s = 0n, i = await Fe(), o = await $t("unwrap"), a = await rf({
+  const r = 0n, s = 0n, i = await Fe(), o = await $t("unwrap"), a = await sf({
     pkscript: e,
     amt: t.toString(),
     token1FeeBps: r.toString(),
     token2FeeBps: s.toString(),
     btc_fee: o.toString()
-  }), c = await sf({
+  }), c = await of({
     pubkey: n,
     nonce: i,
     pkscript: e,
     amt: t,
     btc_fee: o
   });
-  return await of({
+  return await af({
     pubkey: n,
     pkscript: e,
     amt: t.toString(),
@@ -9295,23 +9297,23 @@ async function af(e, t) {
     bip322_signature: a
   });
 }
-async function cf(e, t, n, r) {
-  return await Ol({
+async function uf(e, t, n, r) {
+  return await Tl({
     pubkey: e,
     pairAddress: t,
     limit: n,
     offset: r
   });
 }
-async function uf(e, t, n) {
-  return await vl({
+async function lf(e, t, n) {
+  return await Ol({
     pair_address: e,
     limit: t || 20,
     offset: n || 0
   });
 }
-async function lf(e, t, n, r, s) {
-  return (await Ul(
+async function ff(e, t, n, r, s) {
+  return (await ql(
     e,
     t,
     n,
@@ -9319,8 +9321,8 @@ async function lf(e, t, n, r, s) {
     s
   )).success;
 }
-async function ff(e, t, n, r, s, i) {
-  return (await Gl(
+async function df(e, t, n, r, s, i) {
+  return (await Hl(
     e,
     t,
     n,
@@ -9329,8 +9331,8 @@ async function ff(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function df(e, t, n, r, s, i) {
-  return (await zl(
+async function pf(e, t, n, r, s, i) {
+  return (await Kl(
     e,
     t,
     n,
@@ -9339,8 +9341,8 @@ async function df(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function pf(e, t, n, r, s, i) {
-  return (await Ql(
+async function hf(e, t, n, r, s, i) {
+  return (await tf(
     e,
     t,
     n,
@@ -9349,11 +9351,11 @@ async function pf(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function hf(e, t) {
-  return (await af(e, t)).success;
+async function wf(e, t) {
+  return (await cf(e, t)).success;
 }
-async function wf(e, t, n, r = !0, s, i) {
-  return await Il(
+async function gf(e, t, n, r = !0, s, i) {
+  return await Rl(
     e,
     t,
     n,
@@ -9362,60 +9364,60 @@ async function wf(e, t, n, r = !0, s, i) {
     i
   );
 }
-async function gf(e, t, n) {
-  return await Cl(e, t, n);
-}
 async function yf(e, t, n) {
-  return n ? (await tf(e, n, t)).success : (await ef(e, t)).success;
+  return await $l(e, t, n);
 }
-const Df = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+async function bf(e, t, n) {
+  return n ? (await ef(e, n, t)).success : (await nf(e, t)).success;
+}
+const Mf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  addLiquidity: lf,
+  addLiquidity: ff,
   createSwapWallet: go,
-  deposit: wf,
-  ensureSwapWallet: pl,
-  getActivityOfPair: uf,
-  getAddLiquidityResult: Ll,
-  getKlines: Sl,
+  deposit: gf,
+  ensureSwapWallet: hl,
+  getActivityOfPair: lf,
+  getAddLiquidityResult: Al,
+  getKlines: Bl,
   getMinerFee: $t,
-  getMinerFeesOfDepositOrder: Rl,
-  getMinerFeesOfWrapOrder: $l,
+  getMinerFeesOfDepositOrder: kl,
+  getMinerFeesOfWrapOrder: Ll,
   getPairAddress: tr,
   getPairReserves: Pe,
-  getPairVolumeOverDays: El,
-  getRemoveLiquidityResult: ql,
-  getSwapBalance: bl,
-  getSwapBalances: yl,
-  getSwapExactInputResult: Hl,
-  getSwapExactOutputResult: Kl,
+  getPairVolumeOverDays: Sl,
+  getRemoveLiquidityResult: Dl,
+  getSwapBalance: ml,
+  getSwapBalances: bl,
+  getSwapExactInputResult: Vl,
+  getSwapExactOutputResult: Xl,
   getSwapInfo: Jt,
-  getSwapStatus: wl,
-  getSwapWalletSecurityCode: hl,
+  getSwapStatus: gl,
+  getSwapWalletSecurityCode: wl,
   getTokenDecimals: pn,
-  getTvlHistory: Bl,
-  getUnwrapBtcResult: nf,
-  getWalletActivities: cf,
-  importSwapWallet: dl,
-  listPairs: xl,
+  getTvlHistory: vl,
+  getUnwrapBtcResult: rf,
+  getWalletActivities: uf,
+  importSwapWallet: pl,
+  listPairs: El,
   listTokens: _l,
-  removeLiquidity: ff,
+  removeLiquidity: df,
   satsToBtc: oo,
-  satsToUsd: Lu,
-  swapExactInput: df,
-  swapExactOutput: pf,
-  swapSide: $u,
+  satsToUsd: Au,
+  swapExactInput: pf,
+  swapExactOutput: hf,
+  swapSide: Lu,
   tryGetSwapReferrerInfo: Vr,
-  unwrapBtc: hf,
-  withdraw: yf,
-  wrapBtc: gf
-}, Symbol.toStringTag, { value: "Module" })), bf = "text/plain", Ro = /^[a-z0-9-]{6}$/i, mf = /^(?:[0-9a-f]{2})+$/i;
+  unwrapBtc: wf,
+  withdraw: bf,
+  wrapBtc: yf
+}, Symbol.toStringTag, { value: "Module" })), mf = "text/plain", Ro = /^[a-z0-9-]{6}$/i, xf = /^(?:[0-9a-f]{2})+$/i;
 function Zr(e) {
   if (typeof e != "string" || e.length === 0)
     throw new Error("tick must be a non-empty string");
   return X.str(e).length;
 }
 function Tr(e, t) {
-  if (typeof e != "string" || !mf.test(e))
+  if (typeof e != "string" || !xf.test(e))
     throw new Error(`${t} must be a non-empty hex string`);
 }
 function Gn(e, t) {
@@ -9424,7 +9426,7 @@ function Gn(e, t) {
 }
 function hn(e) {
   return new ae(
-    X.str(bf),
+    X.str(mf),
     null,
     null,
     null,
@@ -9450,12 +9452,12 @@ function _f(e) {
     throw new Error(`deploy ticker must be 4 or 5 bytes, got ${t}`);
   return hn(ko(e, t, null));
 }
-function xf(e) {
+function Ef(e) {
   const t = Zr(e.tick);
   if (t < 4 || t > 6) throw new Error(`ticker must be 4-6 bytes, got ${t}`);
   return Gn(e.amt, "amt"), hn({ p: "brc-20", op: "mint", tick: e.tick, amt: e.amt });
 }
-function Ef(e) {
+function Sf(e) {
   const t = Zr(e.tick);
   if (t < 4 || t > 6) throw new Error(`ticker must be 4-6 bytes, got ${t}`);
   return Gn(e.amt, "amt"), hn({ p: "brc-20", op: "transfer", tick: e.tick, amt: e.amt });
@@ -9465,7 +9467,7 @@ function No(e = 16) {
     throw new Error("byteLength must be a positive integer");
   return X.random(e).hex;
 }
-function Sf(e) {
+function Bf(e) {
   if (typeof e != "string" || e.length === 0)
     throw new Error("address must be a non-empty string");
   return gn.address.toOutputScript(e, ze()).toString("hex");
@@ -9481,10 +9483,10 @@ function Co(e, t, n) {
   ]);
   return gn.crypto.hash256(r).toString("hex");
 }
-function Bf(e) {
+function vf(e) {
   if (typeof e.tick != "string" || !Ro.test(e.tick))
     throw new Error("6-byte ticker must match /^[A-Za-z0-9-]{6}$/");
-  const t = Sf(e.address), n = e.salt ?? No();
+  const t = Bf(e.address), n = e.salt ?? No();
   Tr(n, "salt");
   const r = Co(e.tick, n, t), s = ko(
     { tick: e.tick, max: e.max, lim: e.lim, dec: e.dec },
@@ -9500,7 +9502,7 @@ function Bf(e) {
 }
 async function $o(e, t, n, r, s, i, o, a, c) {
   if (!c || c === "ordinals")
-    return await Ho(
+    return await Vo(
       e,
       t,
       n,
@@ -9512,7 +9514,7 @@ async function $o(e, t, n, r, s, i, o, a, c) {
       o
     );
   if (c === "payment")
-    return await Vo(
+    return await Zo(
       e,
       t,
       n,
@@ -9525,11 +9527,11 @@ async function $o(e, t, n, r, s, i, o, a, c) {
     );
   throw new Error(`Unsupported wallet type: ${c}`);
 }
-async function vf(e, t, n, r, s, i, o, a, c, u, l) {
+async function Of(e, t, n, r, s, i, o, a, c, u, l) {
   if (typeof t != "object") throw new Error("abi must be an object");
   if (typeof n != "string") throw new Error("func_name must be a string");
   if (!Array.isArray(r)) throw new Error("params must be an array");
-  const f = l || "payment", d = Zo(t, n, r);
+  const f = l || "payment", d = Yo(t, n, r);
   return await $o(
     e,
     d,
@@ -9542,8 +9544,8 @@ async function vf(e, t, n, r, s, i, o, a, c, u, l) {
     f
   );
 }
-async function Of(e, t, n, r, s, i) {
-  return await Yo(
+async function Tf(e, t, n, r, s, i) {
+  return await zo(
     e,
     t,
     n,
@@ -9553,8 +9555,8 @@ async function Of(e, t, n, r, s, i) {
     s
   );
 }
-async function Tf(e, t, n, r, s, i, o) {
-  return await zo(
+async function If(e, t, n, r, s, i, o) {
+  return await Ko(
     e,
     t,
     n,
@@ -9565,20 +9567,20 @@ async function Tf(e, t, n, r, s, i, o) {
     i
   );
 }
-const Mf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Wf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   callSmartContract: $o,
-  callSmartContractAbi: vf,
+  callSmartContractAbi: Of,
   computeBrc20PredeployHash: Co,
   deployBrc20Inscription: _f,
-  depositToBrc20Prog: Of,
+  depositToBrc20Prog: Tf,
   generateBrc20Salt: No,
-  mintBrc20Inscription: xf,
-  predeployInscriptions: Bf,
-  transferBrc20Inscription: Ef,
-  withdrawFromBrc20Prog: Tf
+  mintBrc20Inscription: Ef,
+  predeployInscriptions: vf,
+  transferBrc20Inscription: Sf,
+  withdrawFromBrc20Prog: If
 }, Symbol.toStringTag, { value: "Module" }));
-async function If(e, t, n, r, s) {
+async function Rf(e, t, n, r, s) {
   const i = await Js(
     [e],
     t,
@@ -9596,11 +9598,11 @@ async function If(e, t, n, r, s) {
     secret: i.secret
   };
 }
-async function Rf(e, t, n, r, s) {
+async function kf(e, t, n, r, s) {
   return await Js(e, t, n, r, s);
 }
-async function kf(e, t, n, r, s, i) {
-  return await Ko(
+async function Nf(e, t, n, r, s, i) {
+  return await Xo(
     e,
     t,
     n,
@@ -9609,19 +9611,19 @@ async function kf(e, t, n, r, s, i) {
     i
   );
 }
-async function Nf(e, t, n, r) {
+async function Cf(e, t, n, r) {
   return await js([e], t, n, r);
 }
-async function Cf(e, t, n, r) {
+async function $f(e, t, n, r) {
   return await js(e, t, n, r);
 }
-const Wf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Gf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  getInscribeFee: Nf,
-  getInscribeMultipleFee: Cf,
-  inscribe: If,
-  inscribeMultiple: Rf,
-  inscribeWithParent: kf
+  getInscribeFee: Cf,
+  getInscribeMultipleFee: $f,
+  inscribe: Rf,
+  inscribeMultiple: kf,
+  inscribeWithParent: Nf
 }, Symbol.toStringTag, { value: "Module" })), Lo = [
   { inputs: [], stateMutability: "nonpayable", type: "constructor" },
   {
@@ -9780,7 +9782,7 @@ const Wf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     type: "function"
   }
 ], Ao = "0xc54dd4581af2dbf18e4d90840226756e9d2b3cdb";
-async function $f(e, t) {
+async function Lf(e, t) {
   const n = t.toUpperCase(), r = Qs("check_base_brc20_balance"), i = await ti(r, {
     method: "POST",
     headers: {
@@ -9798,7 +9800,7 @@ async function $f(e, t) {
     ticker: i.result.ticker
   };
 }
-async function Lf(e, t) {
+async function Af(e, t) {
   const n = Qs("check_brc20_balance"), s = await ti(n, {
     method: "POST",
     headers: {
@@ -9811,16 +9813,16 @@ async function Lf(e, t) {
   });
   return BigInt(s.result);
 }
-async function Af(e, t) {
+async function Pf(e, t) {
   const n = S.from(t, "utf-8"), r = await ei(
     Ao,
     Lo,
     "balanceOf",
-    [n, Xo(e)]
+    [n, Jo(e)]
   );
   return BigInt(r);
 }
-async function Pf(e) {
+async function Ff(e) {
   const t = S.from(e, "utf-8");
   return `0x${(await ei(
     Ao,
@@ -9829,17 +9831,17 @@ async function Pf(e) {
     [t]
   )).slice(-40)}`;
 }
-const Gf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Hf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  getBRC20ProgBalanceOfAddress: Lf,
-  getBRC20ProgBalanceOfTicker: Af,
-  getBRC20ProgTokenAddressOfTicker: Pf,
-  getBaseBRC20BalanceOfAddress: $f
+  getBRC20ProgBalanceOfAddress: Af,
+  getBRC20ProgBalanceOfTicker: Pf,
+  getBRC20ProgTokenAddressOfTicker: Ff,
+  getBaseBRC20BalanceOfAddress: Lf
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  Df as a,
-  Mf as b,
-  Gf as c,
-  Wf as m,
-  qf as s
+  Mf as a,
+  Wf as b,
+  Hf as c,
+  Gf as m,
+  Df as s
 };