@bestinslot/wallet-kit 0.13.3 → 0.13.5

package/dist/{balances-p2-VUL2h.js → balances-CqYGF0ez.js}

@@ -1,5 +1,5 @@
-import { h as yn, U as Ir, V as Do, X as Mo, Y as Wo, G as S, e as Wt, l as zr, Z as Ys, _ as Rr, O as Ke, f as Zn, H as Ut, $ as Xe, a0 as K, a1 as ce, a2 as zs, a3 as Ks, a4 as Go, a5 as Kr, a6 as Ft, a7 as me, a8 as $n, a9 as Yt, aa as Pn, ab as Xs, d as tn, D as bn, ac as Ho, ad as Xr, ae as Ln, af as Js, k as Pe, ag as Vo, ah as Zo, ai as Yo, aj as zo, ak as Ko, al as js, am as Xo, an as Qs, ao as ti, ap as ei, aq as ni, p as Jo } from "./mint-C_wN10-d.js";
-async function Df(e, t, n, r, s, i) {
+import { h as yn, U as Ir, V as Do, X as Mo, Y as Wo, G as S, e as Wt, l as Kr, Z as Ys, _ as Rr, O as ze, f as Zn, H as Ut, $ as Xe, a0 as z, a1 as ce, a2 as Ks, a3 as zs, a4 as Go, a5 as zr, a6 as Ft, a7 as me, a8 as $n, a9 as Yt, aa as Pn, ab as Xs, d as tn, D as bn, ac as Ho, ad as Xr, ae as Ln, af as Js, k as Pe, ag as Vo, ah as Zo, ai as Yo, aj as Ko, ak as zo, al as js, am as Xo, an as Qs, ao as ti, ap as ei, aq as ni, p as Jo } from "./mint-C_wN10-d.js";
+async function Mf(e, t, n, r, s, i) {
   const o = yn();
   if (!o)
     throw new Error("No wallet connected");
@@ -162,7 +162,7 @@ function oi(e) {
     throw new Error("hex string expected, got " + typeof e);
   return e === "" ? Nr : BigInt("0x" + e);
 }
-function zt(e) {
+function Kt(e) {
   return oi(ln(e));
 }
 function ai(e) {
@@ -217,7 +217,7 @@ function Cr(e, t = {}, n = {}) {
 const ye = () => {
   throw new Error("not implemented");
 };
-function _r(e) {
+function xr(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (n, ...r) => {
     const s = t.get(n);
@@ -259,7 +259,7 @@ function aa(e, t) {
   return $r(e, a, t), a;
 }
 function ca(e) {
-  const t = xn(e), n = gi(e), r = n(t, t.neg(t.ONE)), s = n(t, r), i = n(t, t.neg(r)), o = (e + ia) / hi;
+  const t = _n(e), n = gi(e), r = n(t, t.neg(t.ONE)), s = n(t, r), i = n(t, t.neg(r)), o = (e + ia) / hi;
   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);
@@ -275,7 +275,7 @@ function gi(e) {
   for (; t % ke === Ct; )
     t /= ke, n++;
   let r = ke;
-  const s = xn(e);
+  const s = _n(e);
   for (; Mn(s, r) === 1; )
     if (r++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
@@ -332,7 +332,7 @@ function yi(e) {
   }, n = la.reduce((r, s) => (r[s] = "function", r), t);
   return Cr(e, n), e;
 }
-function zn(e, t, n) {
+function Kn(e, t, n) {
   if (n < Ct)
     throw new Error("invalid exponent, negatives unsupported");
   if (n === Ct)
@@ -417,7 +417,7 @@ class da {
     return Pt(t * n, this.ORDER);
   }
   pow(t, n) {
-    return zn(this, t, n);
+    return Kn(this, t, n);
   }
   div(t, n) {
     return Pt(t * Qr(n, this.ORDER), this.ORDER);
@@ -455,7 +455,7 @@ class da {
     }
     if (t.length !== s)
       throw new Error("Field.fromBytes: expected " + s + " bytes, got " + t.length);
-    let c = i ? ai(t) : zt(t);
+    let c = i ? ai(t) : Kt(t);
     if (a && (c = Pt(c, o)), !n && !this.isValid(c))
       throw new Error("invalid field element: outside of range 0..ORDER");
     return c;
@@ -470,7 +470,7 @@ class da {
     return r ? n : t;
   }
 }
-function xn(e, t = {}) {
+function _n(e, t = {}) {
   return new da(e, t);
 }
 function bi(e) {
@@ -483,12 +483,12 @@ function mi(e) {
   const t = bi(e);
   return t + Math.ceil(t / 2);
 }
-function xi(e, t, n = !1) {
+function _i(e, t, n = !1) {
   ft(e);
   const r = e.length, s = bi(t), i = mi(t);
   if (r < 16 || r < i || r > 1024)
     throw new Error("expected " + i + "-1024 bytes of input, got " + r);
-  const o = n ? ai(e) : zt(e), a = Pt(o, t - Tt) + Tt;
+  const o = n ? ai(e) : Kt(e), a = Pt(o, t - Tt) + Tt;
   return n ? ci(a, s) : mt(a, s);
 }
 function pa(e, t, n) {
@@ -682,7 +682,7 @@ class ba extends ya {
     super(32);
   }
 }
-const _i = /* @__PURE__ */ ta(
+const xi = /* @__PURE__ */ ta(
   () => new ba(),
   /* @__PURE__ */ ea(1)
 );
@@ -813,7 +813,7 @@ class ma {
     return pr(t) !== 1;
   }
 }
-function xa(e, t, n, r) {
+function _a(e, t, n, r) {
   let s = t, i = e.ZERO, o = e.ZERO;
   for (; n > Qe || r > Qe; )
     n & Ne && (i = i.add(s)), r & Ne && (o = o.add(s)), s = s.double(), n >>= Ne, r >>= Ne;
@@ -825,9 +825,9 @@ function ns(e, t, n) {
       throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
     return yi(t), t;
   } else
-    return xn(e, { isLE: n });
+    return _n(e, { isLE: n });
 }
-function _a(e, t, n = {}, r) {
+function xa(e, t, n = {}, r) {
   if (r === void 0 && (r = e === "edwards"), !t || typeof t != "object")
     throw new Error(`expected valid ${e} CURVE object`);
   for (const c of ["p", "n", "h"]) {
@@ -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 Ea = zt;
+const Ea = Kt;
 function we(e, t) {
   if (je(e), je(t), e < 0 || e >= 1 << 8 * t)
     throw new Error("invalid I2OSP input: " + e);
@@ -1021,7 +1021,7 @@ function Ta(e, t, n) {
 }
 const Ce = BigInt(0), It = BigInt(1), re = BigInt(2), He = BigInt(3), Er = BigInt(4);
 function Ti(e, t = {}) {
-  const n = _a("weierstrass", e, t), { Fp: r, Fn: s } = n;
+  const n = xa("weierstrass", e, t), { Fp: r, Fn: s } = n;
   let i = n.CURVE;
   const { h: o, n: a } = i;
   Cr(t, {}, {
@@ -1040,9 +1040,9 @@ function Ti(e, t = {}) {
     if (!r.isOdd)
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
-  function f(U, y, _) {
+  function f(U, y, x) {
     const { x: B, y: R } = y.toAffine(), P = r.toBytes(B);
-    if (jr(_, "isCompressed"), _) {
+    if (jr(x, "isCompressed"), x) {
       l();
       const $ = !r.isOdd(R);
       return ht(Ia($), P);
@@ -1051,7 +1051,7 @@ function Ti(e, t = {}) {
   }
   function d(U) {
     ft(U, void 0, "Point");
-    const { publicKey: y, publicKeyUncompressed: _ } = u, B = U.length, R = U[0], P = U.subarray(1);
+    const { publicKey: y, publicKeyUncompressed: x } = u, B = U.length, R = U[0], P = U.subarray(1);
     if (B === y && (R === 2 || R === 3)) {
       const $ = r.fromBytes(P);
       if (!r.isValid($))
@@ -1067,35 +1067,35 @@ function Ti(e, t = {}) {
       l();
       const W = r.isOdd(k);
       return (R & 1) === 1 !== W && (k = r.neg(k)), { x: $, y: k };
-    } else if (B === _ && R === 4) {
+    } else if (B === x && R === 4) {
       const $ = r.BYTES, q = r.fromBytes(P.subarray(0, $)), k = r.fromBytes(P.subarray($, $ * 2));
       if (!g(q, k))
         throw new Error("bad point: is not on curve");
       return { x: q, y: k };
     } else
-      throw new Error(`bad point: got length ${B}, expected compressed=${y} or uncompressed=${_}`);
+      throw new Error(`bad point: got length ${B}, expected compressed=${y} or uncompressed=${x}`);
   }
   const p = t.toBytes || f, w = t.fromBytes || d;
   function h(U) {
-    const y = r.sqr(U), _ = r.mul(y, U);
-    return r.add(r.add(_, r.mul(U, i.a)), i.b);
+    const y = r.sqr(U), x = r.mul(y, U);
+    return r.add(r.add(x, r.mul(U, i.a)), i.b);
   }
   function g(U, y) {
-    const _ = r.sqr(y), B = h(U);
-    return r.eql(_, B);
+    const x = r.sqr(y), B = h(U);
+    return r.eql(x, B);
   }
   if (!g(i.Gx, i.Gy))
     throw new Error("bad curve params: generator point");
   const b = r.mul(r.pow(i.a, He), 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, _ = !1) {
-    if (!r.isValid(y) || _ && r.is0(y))
+  function O(U, y, x = !1) {
+    if (!r.isValid(y) || x && r.is0(y))
       throw new Error(`bad point coordinate ${U}`);
     return y;
   }
   function F(U) {
-    if (!(U instanceof x))
+    if (!(U instanceof _))
       throw new Error("Weierstrass Point expected");
   }
   function M(U) {
@@ -1103,41 +1103,41 @@ function Ti(e, t = {}) {
       throw new Error("no endo");
     return Ta(U, c.basises, s.ORDER);
   }
-  const A = _r((U, y) => {
-    const { X: _, Y: B, Z: R } = U;
+  const A = xr((U, y) => {
+    const { X: x, Y: B, Z: R } = U;
     if (r.eql(R, r.ONE))
-      return { x: _, y: B };
+      return { x, y: B };
     const P = U.is0();
     y == null && (y = P ? r.ONE : r.inv(R));
-    const $ = r.mul(_, y), q = r.mul(B, y), k = r.mul(R, y);
+    const $ = r.mul(x, y), q = r.mul(B, y), k = r.mul(R, y);
     if (P)
       return { x: r.ZERO, y: r.ZERO };
     if (!r.eql(k, r.ONE))
       throw new Error("invZ was invalid");
     return { x: $, y: q };
-  }), C = _r((U) => {
+  }), C = xr((U) => {
     if (U.is0()) {
       if (t.allowInfinityPoint && !r.is0(U.Y))
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: y, y: _ } = U.toAffine();
-    if (!r.isValid(y) || !r.isValid(_))
+    const { x: y, y: x } = U.toAffine();
+    if (!r.isValid(y) || !r.isValid(x))
       throw new Error("bad point: x or y not field elements");
-    if (!g(y, _))
+    if (!g(y, x))
       throw new Error("bad point: equation left != right");
     if (!U.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function I(U, y, _, B, R) {
-    return _ = new x(r.mul(_.X, U), _.Y, _.Z), y = Wn(B, y), _ = Wn(R, _), y.add(_);
+  function I(U, y, x, B, R) {
+    return x = new _(r.mul(x.X, U), x.Y, x.Z), y = Wn(B, y), x = Wn(R, x), y.add(x);
   }
-  class x {
+  class _ {
     // base / generator point
-    static BASE = new x(i.Gx, i.Gy, r.ONE);
+    static BASE = new _(i.Gx, i.Gy, r.ONE);
     // zero / infinity / identity point
-    static ZERO = new x(r.ZERO, r.ONE, r.ZERO);
+    static ZERO = new _(r.ZERO, r.ONE, r.ZERO);
     // 0, 1, 0
     // math field
     static Fp = r;
@@ -1147,27 +1147,27 @@ function Ti(e, t = {}) {
     Y;
     Z;
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(y, _, B) {
-      this.X = O("x", y), this.Y = O("y", _, !0), this.Z = O("z", B), Object.freeze(this);
+    constructor(y, x, B) {
+      this.X = O("x", y), this.Y = O("y", x, !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: B } = y || {};
-      if (!y || !r.isValid(_) || !r.isValid(B))
+      const { x, y: B } = y || {};
+      if (!y || !r.isValid(x) || !r.isValid(B))
         throw new Error("invalid affine point");
-      if (y instanceof x)
+      if (y instanceof _)
         throw new Error("projective point not allowed");
-      return r.is0(_) && r.is0(B) ? x.ZERO : new x(_, B, r.ONE);
+      return r.is0(x) && r.is0(B) ? _.ZERO : new _(x, B, r.ONE);
     }
     static fromBytes(y) {
-      const _ = x.fromAffine(w(ft(y, void 0, "point")));
-      return _.assertValidity(), _;
+      const x = _.fromAffine(w(ft(y, void 0, "point")));
+      return x.assertValidity(), x;
     }
     static fromHex(y) {
-      return x.fromBytes(Un(y));
+      return _.fromBytes(Un(y));
     }
     get x() {
       return this.toAffine().x;
@@ -1181,8 +1181,8 @@ function Ti(e, t = {}) {
      * @param isLazy true will defer table computation until the first multiplication
      * @returns
      */
-    precompute(y = 8, _ = !0) {
-      return H.createCache(this, y), _ || this.multiply(He), this;
+    precompute(y = 8, x = !0) {
+      return H.createCache(this, y), x || this.multiply(He), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -1198,21 +1198,21 @@ function Ti(e, t = {}) {
     /** Compare one point to another. */
     equals(y) {
       F(y);
-      const { X: _, Y: B, Z: R } = this, { X: P, Y: $, Z: q } = y, k = r.eql(r.mul(_, q), r.mul(P, R)), W = r.eql(r.mul(B, q), r.mul($, R));
+      const { X: x, Y: B, Z: R } = this, { X: P, Y: $, Z: q } = y, k = r.eql(r.mul(x, q), r.mul(P, R)), W = r.eql(r.mul(B, q), r.mul($, R));
       return k && W;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
     negate() {
-      return new x(this.X, r.neg(this.Y), this.Z);
+      return new _(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: _ } = i, B = r.mul(_, He), { X: R, Y: P, Z: $ } = this;
+      const { a: y, b: x } = i, B = r.mul(x, He), { X: R, Y: P, Z: $ } = this;
       let q = r.ZERO, k = r.ZERO, W = r.ZERO, Z = r.mul(R, R), ct = r.mul(P, P), j = r.mul($, $), G = r.mul(R, P);
-      return G = r.add(G, G), W = r.mul(R, $), W = r.add(W, W), q = r.mul(y, W), k = r.mul(B, j), k = r.add(q, k), q = r.sub(ct, k), k = r.add(ct, k), k = r.mul(q, k), q = r.mul(G, q), W = r.mul(B, W), j = r.mul(y, j), G = r.sub(Z, j), G = r.mul(y, G), G = r.add(G, W), W = r.add(Z, Z), Z = r.add(W, Z), Z = r.add(Z, j), Z = r.mul(Z, G), k = r.add(k, Z), j = r.mul(P, $), j = r.add(j, j), Z = r.mul(j, G), q = r.sub(q, Z), W = r.mul(j, ct), W = r.add(W, W), W = r.add(W, W), new x(q, k, W);
+      return G = r.add(G, G), W = r.mul(R, $), W = r.add(W, W), q = r.mul(y, W), k = r.mul(B, j), k = r.add(q, k), q = r.sub(ct, k), k = r.add(ct, k), k = r.mul(q, k), q = r.mul(G, q), W = r.mul(B, W), j = r.mul(y, j), G = r.sub(Z, j), G = r.mul(y, G), G = r.add(G, W), W = r.add(Z, Z), Z = r.add(W, Z), Z = r.add(Z, j), Z = r.mul(Z, G), k = r.add(k, Z), j = r.mul(P, $), j = r.add(j, j), Z = r.mul(j, G), q = r.sub(q, Z), W = r.mul(j, ct), W = r.add(W, W), W = r.add(W, W), new _(q, k, W);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -1220,19 +1220,19 @@ function Ti(e, t = {}) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(y) {
       F(y);
-      const { X: _, Y: B, Z: R } = this, { X: P, Y: $, Z: q } = y;
+      const { X: x, Y: B, Z: R } = this, { X: P, Y: $, Z: q } = y;
       let k = r.ZERO, W = r.ZERO, Z = r.ZERO;
       const ct = i.a, j = r.mul(i.b, He);
-      let G = r.mul(_, P), ut = r.mul(B, $), gt = r.mul(R, q), _t = r.add(_, B), Q = r.add(P, $);
-      _t = r.mul(_t, Q), Q = r.add(G, ut), _t = r.sub(_t, Q), Q = r.add(_, R);
+      let G = r.mul(x, P), ut = r.mul(B, $), gt = r.mul(R, q), xt = r.add(x, B), Q = r.add(P, $);
+      xt = r.mul(xt, Q), Q = r.add(G, ut), xt = r.sub(xt, Q), Q = r.add(x, R);
       let rt = r.add(P, q);
-      return Q = r.mul(Q, rt), rt = r.add(G, gt), Q = r.sub(Q, rt), rt = r.add(B, R), k = r.add($, q), rt = r.mul(rt, k), k = r.add(ut, gt), rt = r.sub(rt, k), Z = r.mul(ct, Q), k = r.mul(j, gt), Z = r.add(k, Z), k = r.sub(ut, Z), Z = r.add(ut, Z), W = r.mul(k, Z), ut = r.add(G, G), ut = r.add(ut, G), gt = r.mul(ct, gt), Q = r.mul(j, Q), ut = r.add(ut, gt), gt = r.sub(G, gt), gt = r.mul(ct, gt), Q = r.add(Q, gt), G = r.mul(ut, Q), W = r.add(W, G), G = r.mul(rt, Q), k = r.mul(_t, k), k = r.sub(k, G), G = r.mul(_t, ut), Z = r.mul(rt, Z), Z = r.add(Z, G), new x(k, W, Z);
+      return Q = r.mul(Q, rt), rt = r.add(G, gt), Q = r.sub(Q, rt), rt = r.add(B, R), k = r.add($, q), rt = r.mul(rt, k), k = r.add(ut, gt), rt = r.sub(rt, k), Z = r.mul(ct, Q), k = r.mul(j, gt), Z = r.add(k, Z), k = r.sub(ut, Z), Z = r.add(ut, Z), W = r.mul(k, Z), ut = r.add(G, G), ut = r.add(ut, G), gt = r.mul(ct, gt), Q = r.mul(j, Q), ut = r.add(ut, gt), gt = r.sub(G, gt), gt = r.mul(ct, gt), Q = r.add(Q, gt), G = r.mul(ut, Q), W = r.add(W, G), G = r.mul(rt, Q), k = r.mul(xt, k), k = r.sub(k, G), G = r.mul(xt, ut), Z = r.mul(rt, Z), Z = r.add(Z, G), new _(k, W, Z);
     }
     subtract(y) {
       return this.add(y.negate());
     }
     is0() {
-      return this.equals(x.ZERO);
+      return this.equals(_.ZERO);
     }
     /**
      * Constant time multiplication.
@@ -1244,19 +1244,19 @@ function Ti(e, t = {}) {
      * @returns New point
      */
     multiply(y) {
-      const { endo: _ } = t;
+      const { endo: x } = t;
       if (!s.isValidNot0(y))
         throw new Error("invalid scalar: out of range");
       let B, R;
-      const P = ($) => H.cached(this, $, (q) => Gn(x, q));
-      if (_) {
+      const P = ($) => H.cached(this, $, (q) => Gn(_, q));
+      if (x) {
         const { k1neg: $, k1: q, k2neg: k, k2: W } = M(y), { p: Z, f: ct } = P(q), { p: j, f: G } = P(W);
-        R = ct.add(G), B = I(_.beta, Z, j, $, k);
+        R = ct.add(G), B = I(x.beta, Z, j, $, k);
       } else {
         const { p: $, f: q } = P(y);
         B = $, R = q;
       }
-      return Gn(x, [B, R])[0];
+      return Gn(_, [B, R])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -1264,18 +1264,18 @@ function Ti(e, t = {}) {
      * an exposed secret key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(y) {
-      const { endo: _ } = t, B = this;
+      const { endo: x } = t, B = this;
       if (!s.isValid(y))
         throw new Error("invalid scalar: out of range");
       if (y === Ce || B.is0())
-        return x.ZERO;
+        return _.ZERO;
       if (y === It)
         return B;
       if (H.hasCache(this))
         return this.multiply(y);
-      if (_) {
-        const { k1neg: R, k1: P, k2neg: $, k2: q } = M(y), { p1: k, p2: W } = xa(x, B, P, q);
-        return I(_.beta, k, W, R, $);
+      if (x) {
+        const { k1neg: R, k1: P, k2neg: $, k2: q } = M(y), { p1: k, p2: W } = _a(_, B, P, q);
+        return I(x.beta, k, W, R, $);
       } else
         return H.unsafe(B, y);
     }
@@ -1292,17 +1292,17 @@ function Ti(e, t = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: y } = t;
-      return o === It ? !0 : y ? y(x, this) : H.unsafe(this, a).is0();
+      return o === It ? !0 : y ? y(_, this) : H.unsafe(this, a).is0();
     }
     clearCofactor() {
       const { clearCofactor: y } = t;
-      return o === It ? this : y ? y(x, this) : this.multiplyUnsafe(o);
+      return o === It ? this : y ? y(_, this) : this.multiplyUnsafe(o);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(o).is0();
     }
     toBytes(y = !0) {
-      return jr(y, "isCompressed"), this.assertValidity(), p(x, this, y);
+      return jr(y, "isCompressed"), this.assertValidity(), p(_, this, y);
     }
     toHex(y = !0) {
       return ln(this.toBytes(y));
@@ -1311,8 +1311,8 @@ function Ti(e, t = {}) {
       return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
     }
   }
-  const D = s.BITS, H = new ma(x, t.endo ? Math.ceil(D / 2) : D);
-  return x.BASE.precompute(8), x;
+  const D = s.BITS, H = new ma(_, t.endo ? Math.ceil(D / 2) : D);
+  return _.BASE.precompute(8), _;
 }
 function Ia(e) {
   return Uint8Array.of(e ? 2 : 3);
@@ -1336,8 +1336,8 @@ function Ra(e, t) {
       let C = A - re;
       C = re << C - It;
       let I = e.pow(F, C);
-      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);
+      const _ = 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, _), F = e.cmov(I, F, _);
     }
     return { isValid: M, value: v };
   };
@@ -1399,57 +1399,57 @@ 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 = (A, C, I, x, D, H) => o.mul014(x, A, i.mul(C, D), i.mul(I, H));
+    l = (A, C, I, _, D, H) => o.mul014(_, A, i.mul(C, D), i.mul(I, H));
   else if (a === "divisive")
-    l = (A, C, I, x, D, H) => o.mul034(x, i.mul(I, H), i.mul(C, D), A);
+    l = (A, C, I, _, D, H) => o.mul034(_, i.mul(I, H), i.mul(C, D), A);
   else
     throw new Error("bls: unknown twist type");
   const f = i.div(i.ONE, i.mul(i.ONE, is));
-  function d(A, C, I, x) {
-    const D = i.sqr(I), H = i.sqr(x), U = i.mulByB(i.mul(H, Ve)), y = i.mul(U, Ve), _ = i.sub(i.sub(i.sqr(i.add(I, x)), H), D), B = i.sub(U, D), R = i.mul(i.sqr(C), Ve), P = i.neg(_);
-    return A.push([B, R, P]), C = i.mul(i.mul(i.mul(i.sub(D, y), C), I), f), I = i.sub(i.sqr(i.mul(i.add(D, y), f)), i.mul(i.sqr(U), Ve)), x = i.mul(D, _), { Rx: C, Ry: I, Rz: x };
-  }
-  function p(A, C, I, x, D, H) {
-    const U = i.sub(I, i.mul(H, x)), y = i.sub(C, i.mul(D, x)), _ = i.sub(i.mul(U, D), i.mul(y, H)), B = i.neg(U), R = y;
-    A.push([_, B, R]);
-    const P = i.sqr(y), $ = i.mul(P, y), q = i.mul(P, C), k = i.add(i.sub($, i.mul(q, is)), i.mul(i.sqr(U), x));
-    return C = i.mul(y, k), I = i.sub(i.mul(i.sub(q, k), U), i.mul($, I)), x = i.mul(x, $), { Rx: C, Ry: I, Rz: x };
-  }
-  const w = Ca(c), h = _r((A) => {
-    const C = A, { x: I, y: x } = C.toAffine(), D = I, H = x, U = i.neg(x);
-    let y = D, _ = H, B = i.ONE;
+  function d(A, C, I, _) {
+    const D = i.sqr(I), H = i.sqr(_), U = i.mulByB(i.mul(H, Ve)), y = i.mul(U, Ve), x = i.sub(i.sub(i.sqr(i.add(I, _)), H), D), B = i.sub(U, D), R = i.mul(i.sqr(C), Ve), P = i.neg(x);
+    return A.push([B, R, P]), C = i.mul(i.mul(i.mul(i.sub(D, y), C), I), f), I = i.sub(i.sqr(i.mul(i.add(D, y), f)), i.mul(i.sqr(U), Ve)), _ = i.mul(D, x), { Rx: C, Ry: I, Rz: _ };
+  }
+  function p(A, C, I, _, D, H) {
+    const U = i.sub(I, i.mul(H, _)), y = i.sub(C, i.mul(D, _)), x = i.sub(i.mul(U, D), i.mul(y, H)), B = i.neg(U), R = y;
+    A.push([x, B, R]);
+    const P = i.sqr(y), $ = i.mul(P, y), q = i.mul(P, C), k = i.add(i.sub($, i.mul(q, is)), i.mul(i.sqr(U), _));
+    return C = i.mul(y, k), I = i.sub(i.mul(i.sub(q, k), U), i.mul($, I)), _ = i.mul(_, $), { Rx: C, Ry: I, Rz: _ };
+  }
+  const w = Ca(c), h = xr((A) => {
+    const C = A, { x: I, y: _ } = C.toAffine(), D = I, H = _, U = i.neg(_);
+    let y = D, x = H, B = i.ONE;
     const R = [];
     for (const P of w) {
       const $ = [];
-      ({ Rx: y, Ry: _, Rz: B } = d($, y, _, B)), P && ({ Rx: y, Ry: _, Rz: B } = p($, y, _, B, D, P === -1 ? U : H)), R.push($);
+      ({ Rx: y, Ry: x, Rz: B } = d($, y, x, B)), P && ({ Rx: y, Ry: x, Rz: B } = p($, y, x, B, D, P === -1 ? U : H)), R.push($);
     }
     if (u) {
       const P = R[R.length - 1];
-      u(y, _, B, D, H, p.bind(null, P));
+      u(y, x, B, D, H, p.bind(null, P));
     }
     return R;
   });
   function g(A, C = !1) {
     let I = o.ONE;
     if (A.length) {
-      const x = A[0][0].length;
-      for (let D = 0; D < x; D++) {
+      const _ = A[0][0].length;
+      for (let D = 0; D < _; D++) {
         I = o.sqr(I);
         for (const [H, U, y] of A)
-          for (const [_, B, R] of H[D])
-            I = l(_, B, R, I, U, y);
+          for (const [x, B, R] of H[D])
+            I = l(x, B, R, I, U, y);
       }
     }
     return I = o.conjugate(I), C ? o.finalExponentiate(I) : I;
   }
   function b(A, C = !0) {
     const I = [];
-    Gn(t, A.map(({ g1: x }) => x)), Gn(n, A.map(({ g2: x }) => x));
-    for (const { g1: x, g2: D } of A) {
-      if (x.is0() || D.is0())
+    Gn(t, A.map(({ g1: _ }) => _)), Gn(n, A.map(({ g2: _ }) => _));
+    for (const { g1: _, g2: D } of A) {
+      if (_.is0() || D.is0())
         throw new Error("pairing is not available for ZERO point");
-      x.assertValidity(), D.assertValidity();
-      const H = x.toAffine();
+      _.assertValidity(), D.assertValidity();
+      const H = _.toAffine();
       I.push([h(D), H.x, H.y]);
     }
     return g(I, C);
@@ -1469,7 +1469,7 @@ function $a(e, t, n, r) {
     pairing: v,
     pairingBatch: b,
     calcPairingPrecomputes: h,
-    randomSecretKey: (A = F(O.seed)) => (ft(A, O.seed, "seed"), xi(A, s.ORDER))
+    randomSecretKey: (A = F(O.seed)) => (ft(A, O.seed, "seed"), _i(A, s.ORDER))
   };
 }
 function os(e, t, n, r, s, i) {
@@ -1537,15 +1537,15 @@ function os(e, t, n, r, s, i) {
       wr(g);
       const b = d(h), v = g.map((C) => C.message), O = g.map((C) => f(C.publicKey)), F = /* @__PURE__ */ new Map();
       for (let C = 0; C < O.length; C++) {
-        const I = O[C], x = v[C];
-        let D = F.get(x);
-        D === void 0 && (D = [], F.set(x, D)), D.push(I);
+        const I = O[C], _ = v[C];
+        let D = F.get(_);
+        D === void 0 && (D = [], F.set(_, D)), D.push(I);
       }
       const M = [], A = t.BASE;
       try {
         for (const [C, I] of F) {
-          const x = I.reduce((D, H) => D.add(H));
-          M.push(w(x, C));
+          const _ = I.reduce((D, H) => D.add(H));
+          M.push(w(_, C));
         }
         return M.push(w(A.negate(), b)), a.eql(c(M), a.ONE);
       } catch {
@@ -1691,7 +1691,7 @@ class Ua {
     return { c0: this.Fp.neg(t), c1: this.Fp.neg(n) };
   }
   pow(t, n) {
-    return zn(this, t, n);
+    return Kn(this, t, n);
   }
   invertBatch(t) {
     return Fe(this, t);
@@ -1906,7 +1906,7 @@ class qa {
     return this.mul(t, typeof n == "bigint" ? s.inv(s.create(n)) : this.inv(n));
   }
   pow(t, n) {
-    return zn(this, t, n);
+    return Kn(this, t, n);
   }
   invertBatch(t) {
     return Fe(this, t);
@@ -2043,7 +2043,7 @@ class Da {
     return this.mul(t, typeof n == "bigint" ? i.inv(i.create(n)) : this.inv(n));
   }
   pow(t, n) {
-    return zn(this, t, n);
+    return Kn(this, t, n);
   }
   invertBatch(t) {
     return Fe(this, t);
@@ -2210,18 +2210,18 @@ class Da {
   }
 }
 function Ma(e) {
-  const t = xn(e.ORDER), n = new Ua(t, e), r = new qa(n), s = new Da(r, e);
+  const t = _n(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 xt = BigInt(0), Hn = BigInt(1), qt = BigInt(2), Kn = BigInt(3), fn = BigInt(4), xe = BigInt("0xd201000000010000"), Wa = Dn(xe), en = {
+const _t = BigInt(0), Hn = BigInt(1), qt = BigInt(2), zn = BigInt(3), fn = BigInt(4), _e = BigInt("0xd201000000010000"), Wa = Dn(_e), en = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
-  a: xt,
+  a: _t,
   b: fn,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
-}, Pr = xn(en.n, {
+}, Pr = _n(en.n, {
   modFromBytes: !0
 }), { Fp: N, Fp2: V, Fp6: Ga, Fp12: Y } = Ma({
   ORDER: en.p,
@@ -2234,7 +2234,7 @@ const xt = BigInt(0), Hn = BigInt(1), qt = BigInt(2), Kn = BigInt(3), fn = BigIn
     return { c0: N.sub(n, r), c1: N.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
-    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);
+    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);
     return Y.mul(Y.mul(Y.mul(l, f), d), p);
   }
 }), { G2psi: ls, G2psi2: Ha } = Fa(N, V, V.div(V.ONE, V.NONRESIDUE)), gr = Object.freeze({
@@ -2244,7 +2244,7 @@ const xt = BigInt(0), Hn = BigInt(1), qt = BigInt(2), Kn = BigInt(3), fn = BigIn
   m: 2,
   k: 128,
   expand: "xmd",
-  hash: _i
+  hash: xi
 }), Fr = {
   p: V.ORDER,
   n: en.n,
@@ -2259,13 +2259,13 @@ const xt = BigInt(0), Hn = BigInt(1), qt = BigInt(2), Kn = BigInt(3), fn = BigIn
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, Xn = _n(N.toBytes(xt), { infinity: !0, compressed: !0 });
+}, Xn = xn(N.toBytes(_t), { infinity: !0, compressed: !0 });
 function Jn(e) {
   e = ui(e);
   const t = e[0] & 224, n = !!(t >> 7 & 1), r = !!(t >> 6 & 1), s = !!(t >> 5 & 1);
   return e[0] &= 31, { compressed: n, infinity: r, sort: s, value: e };
 }
-function _n(e, t) {
+function xn(e, t) {
   if (e[0] & 224)
     throw new Error("setMask: non-empty mask");
   return t.compressed && (e[0] |= 128), t.infinity && (e[0] |= 64), t.sort && (e[0] |= 32), e;
@@ -2276,7 +2276,7 @@ function Va(e, t, n) {
     if (i)
       return Xn.slice();
     const c = !!(a * qt / s);
-    return _n(mt(o, r), { compressed: !0, sort: c });
+    return xn(mt(o, r), { compressed: !0, sort: c });
   } else
     return i ? ht(Uint8Array.of(64), new Uint8Array(2 * r - 1)) : ht(mt(o, r), mt(a, r));
 }
@@ -2286,26 +2286,26 @@ function yr(e) {
   if (e.is0())
     return Xn.slice();
   const i = !!(s * qt / n);
-  return _n(mt(r, t), { compressed: !0, sort: i });
+  return xn(mt(r, t), { compressed: !0, sort: i });
 }
 function Za(e) {
   const { compressed: t, infinity: n, sort: r, value: s } = Jn(e), { BYTES: i, ORDER: o } = N;
   if (s.length === 48 && t) {
-    const a = zt(s), c = N.create(a & mn(N.BITS));
+    const a = Kt(s), c = N.create(a & mn(N.BITS));
     if (n) {
-      if (c !== xt)
+      if (c !== _t)
         throw new Error("invalid G1 point: non-empty, at infinity, with compression");
-      return { x: xt, y: xt };
+      return { x: _t, y: _t };
     }
-    const u = N.add(N.pow(c, Kn), N.create(en.b));
+    const u = N.add(N.pow(c, zn), N.create(en.b));
     let l = N.sqrt(u);
     if (!l)
       throw new Error("invalid G1 point: compressed point");
     return l * qt / o !== BigInt(r) && (l = N.neg(l)), { x: N.create(c), y: N.create(l) };
   } else if (s.length === 96 && !t) {
-    const a = zt(s.subarray(0, i)), c = zt(s.subarray(i));
+    const a = Kt(s.subarray(0, i)), c = Kt(s.subarray(i));
     if (n) {
-      if (a !== xt || c !== xt)
+      if (a !== _t || c !== _t)
         throw new Error("G1: non-empty point at infinity");
       return T.G1.Point.ZERO.toAffine();
     }
@@ -2314,10 +2314,10 @@ function Za(e) {
     throw new Error("invalid G1 point: expected 48/96 bytes");
 }
 function fs(e) {
-  const { infinity: t, sort: n, value: r } = Jn(ft(e, 48, "signature")), s = N.ORDER, i = T.G1.Point, o = zt(r);
+  const { infinity: t, sort: n, value: r } = Jn(ft(e, 48, "signature")), s = N.ORDER, i = T.G1.Point, o = Kt(r);
   if (t)
     return i.ZERO;
-  const a = N.create(o & mn(N.BITS)), c = N.add(N.pow(a, Kn), N.create(en.b));
+  const a = N.create(o & mn(N.BITS)), c = N.add(N.pow(a, zn), N.create(en.b));
   let u = N.sqrt(c);
   if (!u)
     throw new Error("invalid G1 point: compressed");
@@ -2330,9 +2330,9 @@ function Ya(e, t, n) {
   const { BYTES: r, ORDER: s } = N, i = t.is0(), { x: o, y: a } = t.toAffine();
   if (n) {
     if (i)
-      return ht(Xn, mt(xt, r));
-    const c = !!(a.c1 === xt ? a.c0 * qt / s : a.c1 * qt / s);
-    return ht(_n(mt(o.c1, r), { compressed: !0, sort: c }), mt(o.c0, r));
+      return ht(Xn, mt(_t, r));
+    const c = !!(a.c1 === _t ? a.c0 * qt / s : a.c1 * qt / s);
+    return ht(xn(mt(o.c1, r), { compressed: !0, sort: c }), mt(o.c0, r));
   } else {
     if (i)
       return ht(Uint8Array.of(64), new Uint8Array(4 * r - 1));
@@ -2344,26 +2344,26 @@ function br(e) {
   e.assertValidity();
   const { BYTES: t } = N;
   if (e.is0())
-    return ht(Xn, 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 * qt : o * qt) / N.ORDER & Hn), l = s;
-  return ht(_n(mt(i, t), { sort: u, compressed: !0 }), mt(l, t));
+    return ht(Xn, mt(_t, t));
+  const { x: n, y: r } = e.toAffine(), { re: s, im: i } = V.reim(n), { re: o, im: a } = V.reim(r), u = !!((a > _t ? a * qt : o * qt) / N.ORDER & Hn), l = s;
+  return ht(xn(mt(i, t), { sort: u, compressed: !0 }), mt(l, t));
 }
-function za(e) {
+function Ka(e) {
   const { BYTES: t, ORDER: n } = N, { compressed: r, infinity: s, sort: i, value: o } = Jn(e);
   if (!r && !s && i || // 00100000
   !r && s && i || // 01100000
   i && s && r)
     throw new Error("invalid encoding flag: " + (e[0] & 224));
-  const a = (c, u, l) => zt(c.slice(u, l));
+  const a = (c, u, l) => Kt(c.slice(u, l));
   if (o.length === 96 && r) {
     if (s) {
       if (o.reduce((w, h) => w !== 0 ? h + 1 : h, 0) > 0)
         throw new Error("invalid G2 point: compressed");
       return { x: V.ZERO, y: V.ZERO };
     }
-    const c = a(o, 0, t), u = a(o, t, 2 * t), l = V.create({ c0: N.create(u), c1: N.create(c) }), f = V.add(V.pow(l, Kn), Fr.b);
+    const c = a(o, 0, t), u = a(o, t, 2 * t), l = V.create({ c0: N.create(u), c1: N.create(c) }), f = V.add(V.pow(l, zn), Fr.b);
     let d = V.sqrt(f);
-    const p = d.c1 === xt ? d.c0 * qt / n : d.c1 * qt / n ? Hn : xt;
+    const p = d.c1 === _t ? d.c0 * qt / n : d.c1 * qt / n ? Hn : _t;
     return d = i && p > 0 ? d : V.neg(d), { x: l, y: d };
   } else if (o.length === 192 && !r) {
     if (s) {
@@ -2380,19 +2380,19 @@ function ds(e) {
   const { ORDER: t } = N, { infinity: n, sort: r, value: s } = Jn(ft(e)), i = T.G2.Point, o = s.length / 2;
   if (o !== 48 && o !== 96)
     throw new Error("invalid compressed signature length, expected 96/192 bytes");
-  const a = zt(s.slice(0, o)), c = zt(s.slice(o));
+  const a = Kt(s.slice(0, o)), c = Kt(s.slice(o));
   if (n)
     return i.ZERO;
-  const u = N.create(a & mn(N.BITS)), l = N.create(c), f = V.create({ c0: l, c1: u }), d = V.add(V.pow(f, Kn), Fr.b);
+  const u = N.create(a & mn(N.BITS)), l = N.create(c), f = V.create({ c0: l, c1: u }), d = V.add(V.pow(f, zn), Fr.b);
   let p = V.sqrt(d);
   if (!p)
     throw new Error("Failed to find a square root");
-  const { re: w, im: h } = V.reim(p), g = BigInt(r), b = h > xt && h * qt / t !== g, v = h === xt && w * qt / t !== g;
+  const { re: w, im: h } = V.reim(p), g = BigInt(r), b = h > _t && h * qt / t !== g, v = h === _t && w * qt / t !== g;
   (b || v) && (p = V.neg(p));
   const O = i.fromAffine({ x: f, y: p });
   return O.assertValidity(), O;
 }
-const Ka = {
+const za = {
   ShortSignature: {
     fromBytes(e) {
       return fs(ft(e));
@@ -2444,25 +2444,25 @@ const Ka = {
   // https://eprint.iacr.org/2021/1130.pdf
   isTorsionFree: (e, t) => {
     const n = BigInt("0x5f19672fdf76ce51ba69c6076a0f77eaddb3a93be6f89688de17d813620a00022e01fffffffefffe"), r = new e(N.mul(t.X, n), t.Y, t.Z);
-    return t.multiplyUnsafe(xe).negate().multiplyUnsafe(xe).equals(r);
+    return t.multiplyUnsafe(_e).negate().multiplyUnsafe(_e).equals(r);
   },
   // Clear cofactor of G1
   // https://eprint.iacr.org/2019/403
-  clearCofactor: (e, t) => t.multiplyUnsafe(xe).add(t)
+  clearCofactor: (e, t) => t.multiplyUnsafe(_e).add(t)
 }), ja = Ti(Fr, {
   Fp: V,
   allowInfinityPoint: !0,
   Fn: Pr,
-  fromBytes: za,
+  fromBytes: Ka,
   toBytes: Ya,
   // https://eprint.iacr.org/2021/1130.pdf
   // Older version: https://eprint.iacr.org/2019/814.pdf
-  isTorsionFree: (e, t) => t.multiplyUnsafe(xe).negate().equals(ls(e, t)),
+  isTorsionFree: (e, t) => t.multiplyUnsafe(_e).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 = xe;
+    const n = _e;
     let r = t.multiplyUnsafe(n).negate(), s = ls(e, t), i = t.double();
     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);
   }
@@ -2473,11 +2473,11 @@ const Ka = {
   hasherOptsG1: { ...gr, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
   hasherOptsG2: { ...gr }
 }, tc = {
-  ateLoopSize: xe,
+  ateLoopSize: _e,
   // The BLS parameter x for BLS12-381
   twistType: "multiplicative",
   randomBytes: ii
-}, T = Pa(Xa, Ja, ja, tc, Qa, Ka), ec = vi(V, [
+}, T = Pa(Xa, Ja, ja, tc, Qa, za), ec = vi(V, [
   // xNum
   [
     [
@@ -2621,7 +2621,7 @@ const Ka = {
   B: N.create(BigInt("0x12e2908d11688030018b12e8753eee3b2016c1f0f24f4070a0b9c14fcef35ef55a23215a316ceaa5d1cc48e98e172be0")),
   Z: N.create(BigInt(11))
 }), sc = Ii(V, {
-  A: V.create({ c0: N.create(xt), c1: N.create(BigInt(240)) }),
+  A: V.create({ c0: N.create(_t), c1: N.create(BigInt(240)) }),
   // A' = 240 * I
   B: V.create({ c0: N.create(BigInt(1012)), c1: N.create(BigInt(1012)) }),
   // B' = 1012 * (1 + I)
@@ -2794,7 +2794,7 @@ function Ni(e, t, n) {
 function yt(e, t) {
   return Ni(e, t, !1);
 }
-function Kt(e, t) {
+function zt(e, t) {
   return Ni(e, t, !0);
 }
 function cn(e, t) {
@@ -2810,7 +2810,7 @@ function bt(e) {
   }
   return n;
 }
-function _e(e) {
+function xe(e) {
   return "0x" + e.map((t) => bt(t).substring(2)).join("");
 }
 function dc(e) {
@@ -2840,7 +2840,7 @@ function An(e, t) {
 function $i(e, t) {
   return Ci(e, t, !1);
 }
-const En = BigInt(0), Mt = BigInt(1), ze = 9007199254740991;
+const En = BigInt(0), Mt = BigInt(1), Ke = 9007199254740991;
 function pc(e, t) {
   const n = jn(e, "value"), r = BigInt(Ee(t, "width"));
   if (at(n >> r === En, "overflow", "NUMERIC_FAULT", {
@@ -2881,7 +2881,7 @@ function nn(e, t) {
     case "bigint":
       return e;
     case "number":
-      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -ze && e <= ze, "overflow", t || "value", e), BigInt(e);
+      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -Ke && e <= Ke, "overflow", t || "value", e), BigInt(e);
     case "string":
       try {
         if (e === "")
@@ -2914,9 +2914,9 @@ function Ai(e) {
 function Ee(e, t) {
   switch (typeof e) {
     case "bigint":
-      return m(e >= -ze && e <= ze, "overflow", t || "value", e), Number(e);
+      return m(e >= -Ke && e <= Ke, "overflow", t || "value", e), Number(e);
     case "number":
-      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -ze && e <= ze, "overflow", t || "value", e), e;
+      return m(Number.isInteger(e), "underflow", t || "value", e), m(e >= -Ke && e <= Ke, "overflow", t || "value", e), e;
     case "string":
       try {
         if (e === "")
@@ -3057,10 +3057,10 @@ function qr(e, t) {
 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 xc(e, t) {
+function _c(e, t) {
   return mc(bc(e, t));
 }
-const vt = 32, Sr = new Uint8Array(vt), _c = ["then"], Rn = {}, qi = /* @__PURE__ */ new WeakMap();
+const vt = 32, Sr = new Uint8Array(vt), xc = ["then"], Rn = {}, qi = /* @__PURE__ */ new WeakMap();
 function Re(e) {
   return qi.get(e);
 }
@@ -3108,7 +3108,7 @@ class oe extends Array {
             const p = c[d];
             return p instanceof Error && on(`index ${d}`, p), p;
           }
-          if (_c.indexOf(u) >= 0)
+          if (xc.indexOf(u) >= 0)
             return Reflect.get(c, u, l);
           const f = c[u];
           if (f instanceof Function)
@@ -3207,7 +3207,7 @@ class oe extends Array {
 }
 function bs(e) {
   let t = Fi(e);
-  return at(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;
+  return at(t.length <= vt, "value out-of-bounds", "BUFFER_OVERRUN", { buffer: t, length: vt, offset: t.length }), t.length !== vt && (t = zt(xe([Sr.slice(t.length % vt), t]))), t;
 }
 class de {
   // The coder name:
@@ -3243,7 +3243,7 @@ class vr {
     this.#t = [], this.#e = 0;
   }
   get data() {
-    return _e(this.#t);
+    return xe(this.#t);
   }
   get length() {
     return this.#e;
@@ -3252,13 +3252,13 @@ class vr {
     return this.#t.push(t), this.#e += t.length, t.length;
   }
   appendWriter(t) {
-    return this.#n(Kt(t.data));
+    return this.#n(zt(t.data));
   }
   // Arrayish item; pad on the right to *nearest* WordSize
   writeBytes(t) {
-    let n = Kt(t);
+    let n = zt(t);
     const r = n.length % vt;
-    return r && (n = Kt(_e([n, Sr.slice(r)]))), this.#n(n);
+    return r && (n = zt(xe([n, Sr.slice(r)]))), this.#n(n);
   }
   // Numeric item; pad on the left *to* WordSize
   writeValue(t) {
@@ -3285,7 +3285,7 @@ class Dr {
   #r;
   #s;
   constructor(t, n, r) {
-    st(this, { allowLoose: !!n }), this.#t = Kt(t), this.#n = 0, this.#r = null, this.#s = r ?? 1024, this.#e = 0;
+    st(this, { allowLoose: !!n }), this.#t = zt(t), this.#n = 0, this.#r = null, this.#s = r ?? 1024, this.#e = 0;
   }
   get data() {
     return bt(this.#t);
@@ -3303,7 +3303,7 @@ class Dr {
     if (this.#r)
       return this.#r.#i(t);
     this.#n += t, at(this.#s < 1 || this.#n <= this.#s * this.dataLength, `compressed ABI data exceeds inflation ratio of ${this.#s} ( see: https://github.com/ethers-io/ethers.js/issues/4537 )`, "BUFFER_OVERRUN", {
-      buffer: Kt(this.#t),
+      buffer: zt(this.#t),
       offset: this.#e,
       length: t,
       info: {
@@ -3315,7 +3315,7 @@ class Dr {
   #o(t, n, r) {
     let s = Math.ceil(n / vt) * vt;
     return this.#e + s > this.#t.length && (this.allowLoose && r && this.#e + n <= this.#t.length ? s = n : at(!1, "data out-of-bounds", "BUFFER_OVERRUN", {
-      buffer: Kt(this.#t),
+      buffer: zt(this.#t),
       length: this.#t.length,
       offset: this.#e + s
     })), this.#t.slice(this.#e, this.#e + s);
@@ -3348,7 +3348,7 @@ function Di(e, ...t) {
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function xs(e, t = !0) {
+function _s(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
@@ -3383,9 +3383,9 @@ function Ic(e) {
   const t = (r) => e().update(Mi(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-const kn = /* @__PURE__ */ BigInt(2 ** 32 - 1), _s = /* @__PURE__ */ BigInt(32);
+const kn = /* @__PURE__ */ BigInt(2 ** 32 - 1), xs = /* @__PURE__ */ BigInt(32);
 function Rc(e, t = !1) {
-  return t ? { h: Number(e & kn), l: Number(e >> _s & kn) } : { h: Number(e >> _s & kn) | 0, l: Number(e & kn) | 0 };
+  return t ? { h: Number(e & kn), l: Number(e >> xs & kn) } : { h: Number(e >> xs & kn) | 0, l: Number(e & kn) | 0 };
 }
 function kc(e, t = !1) {
   let n = new Uint32Array(e.length), r = new Uint32Array(e.length);
@@ -3440,7 +3440,7 @@ class Mr extends Tc {
     Wc(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    xs(this);
+    _s(this);
     const { blockLen: n, state: r } = this;
     t = Mi(t);
     const s = t.length;
@@ -3460,7 +3460,7 @@ class Mr extends Tc {
     t[r] ^= n, (n & 128) !== 0 && r === s - 1 && this.keccak(), t[s - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    xs(this, !1), Di(t), this.finish();
+    _s(this, !1), Di(t), this.finish();
     const n = this.state, { blockLen: r } = this;
     for (let s = 0, i = t.length; s < i; ) {
       this.posOut >= r && this.keccak();
@@ -3542,7 +3542,7 @@ function Yc(e) {
     n = "0" + n;
   return n;
 }
-const zc = (function() {
+const Kc = (function() {
   const e = {};
   for (let t = 0; t < 36; t++) {
     const n = "0123456789abcdefghijklmnopqrstuvwxyz"[t];
@@ -3550,11 +3550,11 @@ const zc = (function() {
   }
   return e;
 })();
-function Kc(e) {
+function zc(e) {
   e = e.toLowerCase();
   let t = Vc;
   for (let n = 0; n < e.length; n++)
-    t = t * Zc + zc[e[n]];
+    t = t * Zc + Kc[e[n]];
   return t;
 }
 function dn(e) {
@@ -3565,7 +3565,7 @@ function dn(e) {
   }
   if (e.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {
     m(e.substring(2, 4) === Yc(e), "bad icap checksum", "address", e);
-    let t = Kc(e.substring(4)).toString(16);
+    let t = zc(e.substring(4)).toString(16);
     for (; t.length < 40; )
       t = "0" + t;
     return Bs("0x" + t);
@@ -3577,7 +3577,7 @@ function E(e, t) {
   let n = !1;
   return t < 0 && (n = !0, t *= -1), new pt(se, `${n ? "" : "u"}int${t}`, e, { signed: n, width: t });
 }
-function z(e, t) {
+function K(e, t) {
   return new pt(se, `bytes${t || ""}`, e, { size: t });
 }
 const Os = /* @__PURE__ */ Symbol.for("_ethers_typed");
@@ -4075,193 +4075,193 @@ class pt {
    *  Return a new ``bytes1`` type for %%v%%.
    */
   static bytes1(t) {
-    return z(t, 1);
+    return K(t, 1);
   }
   /**
    *  Return a new ``bytes2`` type for %%v%%.
    */
   static bytes2(t) {
-    return z(t, 2);
+    return K(t, 2);
   }
   /**
    *  Return a new ``bytes3`` type for %%v%%.
    */
   static bytes3(t) {
-    return z(t, 3);
+    return K(t, 3);
   }
   /**
    *  Return a new ``bytes4`` type for %%v%%.
    */
   static bytes4(t) {
-    return z(t, 4);
+    return K(t, 4);
   }
   /**
    *  Return a new ``bytes5`` type for %%v%%.
    */
   static bytes5(t) {
-    return z(t, 5);
+    return K(t, 5);
   }
   /**
    *  Return a new ``bytes6`` type for %%v%%.
    */
   static bytes6(t) {
-    return z(t, 6);
+    return K(t, 6);
   }
   /**
    *  Return a new ``bytes7`` type for %%v%%.
    */
   static bytes7(t) {
-    return z(t, 7);
+    return K(t, 7);
   }
   /**
    *  Return a new ``bytes8`` type for %%v%%.
    */
   static bytes8(t) {
-    return z(t, 8);
+    return K(t, 8);
   }
   /**
    *  Return a new ``bytes9`` type for %%v%%.
    */
   static bytes9(t) {
-    return z(t, 9);
+    return K(t, 9);
   }
   /**
    *  Return a new ``bytes10`` type for %%v%%.
    */
   static bytes10(t) {
-    return z(t, 10);
+    return K(t, 10);
   }
   /**
    *  Return a new ``bytes11`` type for %%v%%.
    */
   static bytes11(t) {
-    return z(t, 11);
+    return K(t, 11);
   }
   /**
    *  Return a new ``bytes12`` type for %%v%%.
    */
   static bytes12(t) {
-    return z(t, 12);
+    return K(t, 12);
   }
   /**
    *  Return a new ``bytes13`` type for %%v%%.
    */
   static bytes13(t) {
-    return z(t, 13);
+    return K(t, 13);
   }
   /**
    *  Return a new ``bytes14`` type for %%v%%.
    */
   static bytes14(t) {
-    return z(t, 14);
+    return K(t, 14);
   }
   /**
    *  Return a new ``bytes15`` type for %%v%%.
    */
   static bytes15(t) {
-    return z(t, 15);
+    return K(t, 15);
   }
   /**
    *  Return a new ``bytes16`` type for %%v%%.
    */
   static bytes16(t) {
-    return z(t, 16);
+    return K(t, 16);
   }
   /**
    *  Return a new ``bytes17`` type for %%v%%.
    */
   static bytes17(t) {
-    return z(t, 17);
+    return K(t, 17);
   }
   /**
    *  Return a new ``bytes18`` type for %%v%%.
    */
   static bytes18(t) {
-    return z(t, 18);
+    return K(t, 18);
   }
   /**
    *  Return a new ``bytes19`` type for %%v%%.
    */
   static bytes19(t) {
-    return z(t, 19);
+    return K(t, 19);
   }
   /**
    *  Return a new ``bytes20`` type for %%v%%.
    */
   static bytes20(t) {
-    return z(t, 20);
+    return K(t, 20);
   }
   /**
    *  Return a new ``bytes21`` type for %%v%%.
    */
   static bytes21(t) {
-    return z(t, 21);
+    return K(t, 21);
   }
   /**
    *  Return a new ``bytes22`` type for %%v%%.
    */
   static bytes22(t) {
-    return z(t, 22);
+    return K(t, 22);
   }
   /**
    *  Return a new ``bytes23`` type for %%v%%.
    */
   static bytes23(t) {
-    return z(t, 23);
+    return K(t, 23);
   }
   /**
    *  Return a new ``bytes24`` type for %%v%%.
    */
   static bytes24(t) {
-    return z(t, 24);
+    return K(t, 24);
   }
   /**
    *  Return a new ``bytes25`` type for %%v%%.
    */
   static bytes25(t) {
-    return z(t, 25);
+    return K(t, 25);
   }
   /**
    *  Return a new ``bytes26`` type for %%v%%.
    */
   static bytes26(t) {
-    return z(t, 26);
+    return K(t, 26);
   }
   /**
    *  Return a new ``bytes27`` type for %%v%%.
    */
   static bytes27(t) {
-    return z(t, 27);
+    return K(t, 27);
   }
   /**
    *  Return a new ``bytes28`` type for %%v%%.
    */
   static bytes28(t) {
-    return z(t, 28);
+    return K(t, 28);
   }
   /**
    *  Return a new ``bytes29`` type for %%v%%.
    */
   static bytes29(t) {
-    return z(t, 29);
+    return K(t, 29);
   }
   /**
    *  Return a new ``bytes30`` type for %%v%%.
    */
   static bytes30(t) {
-    return z(t, 30);
+    return K(t, 30);
   }
   /**
    *  Return a new ``bytes31`` type for %%v%%.
    */
   static bytes31(t) {
-    return z(t, 31);
+    return K(t, 31);
   }
   /**
    *  Return a new ``bytes32`` type for %%v%%.
    */
   static bytes32(t) {
-    return z(t, 32);
+    return K(t, 32);
   }
   /**
    *  Return a new ``address`` type for %%v%%.
@@ -4362,7 +4362,7 @@ class Jc extends de {
     return this.coder.decode(t);
   }
 }
-function zi(e, t, n) {
+function Ki(e, t, n) {
   let r = [];
   if (Array.isArray(n))
     r = n;
@@ -4393,7 +4393,7 @@ function zi(e, t, n) {
   let a = e.appendWriter(s);
   return a += e.appendWriter(i), a;
 }
-function Ki(e, t) {
+function zi(e, t) {
   let n = [], r = [], s = e.subReader(0);
   return t.forEach((i) => {
     let o = null;
@@ -4440,7 +4440,7 @@ class jc extends de {
     let i = [];
     for (let o = 0; o < r.length; o++)
       i.push(this.coder);
-    return zi(t, i, r);
+    return Ki(t, i, r);
   }
   decode(t) {
     let n = this.length;
@@ -4448,7 +4448,7 @@ class jc extends de {
     let r = [];
     for (let s = 0; s < n; s++)
       r.push(new Jc(this.coder));
-    return Ki(t, r);
+    return zi(t, r);
   }
 }
 class Qc extends de {
@@ -4474,7 +4474,7 @@ class Xi extends de {
     return "0x";
   }
   encode(t, n) {
-    n = Kt(n);
+    n = zt(n);
     let r = t.writeValue(n.length);
     return r += t.writeBytes(n), r;
   }
@@ -4500,7 +4500,7 @@ class eu extends de {
     return "0x0000000000000000000000000000000000000000000000000000000000000000".substring(0, 2 + this.size * 2);
   }
   encode(t, n) {
-    let r = Kt(pt.dereference(n, this.type));
+    let r = zt(pt.dereference(n, this.type));
     return r.length !== this.size && this._throwError("incorrect data length", n), t.writeBytes(r);
   }
   decode(t) {
@@ -4557,7 +4557,7 @@ class cu extends Xi {
     return super.encode(t, qr(pt.dereference(n, "string")));
   }
   decode(t) {
-    return xc(super.decode(t));
+    return _c(super.decode(t));
   }
 }
 class Nn extends de {
@@ -4587,10 +4587,10 @@ class Nn extends de {
   }
   encode(t, n) {
     const r = pt.dereference(n, "tuple");
-    return zi(t, this.coders, r);
+    return Ki(t, this.coders, r);
   }
   decode(t) {
-    return Ki(t, this.coders);
+    return zi(t, this.coders);
   }
 }
 function pn(e) {
@@ -4623,7 +4623,7 @@ function Ji(e, t, n) {
     const o = [];
     return t.forEach(function(a) {
       o.push(Ji(s, a, !0));
-    }), yt(_e(o));
+    }), yt(xe(o));
   }
   m(!1, "invalid type", "type", e);
 }
@@ -4632,7 +4632,7 @@ function Ts(e, t) {
   const n = [];
   return e.forEach(function(r, s) {
     n.push(Ji(r, t[s]));
-  }), bt(_e(n));
+  }), bt(xe(n));
 }
 function Ot(e) {
   const t = /* @__PURE__ */ new Set();
@@ -4645,7 +4645,7 @@ const du = "external public payable override", pu = Ot(du.split(" ")), ji = "con
   "]": "CLOSE_BRACKET",
   ",": "COMMA",
   "@": "AT"
-}, xu = new RegExp("^(\\s*)"), _u = new RegExp("^([0-9]+)"), Eu = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), no = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), ro = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
+}, _u = new RegExp("^(\\s*)"), xu = new RegExp("^([0-9]+)"), Eu = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), no = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), ro = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
 class Dt {
   #t;
   #e;
@@ -4745,7 +4745,7 @@ function Se(e) {
   };
   let r = [], s = [], i = 0;
   for (; i < e.length; ) {
-    let o = e.substring(i), a = o.match(xu);
+    let o = e.substring(i), a = o.match(_u);
     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);
@@ -4783,7 +4783,7 @@ function Se(e) {
       c.type = "ID";
       continue;
     }
-    if (a = o.match(_u), a) {
+    if (a = o.match(xu), a) {
       c.text = a[1], c.type = "NUMBER", i += c.text.length;
       continue;
     }
@@ -5594,7 +5594,7 @@ Gt.set(50, "ARRAY_RANGE_ERROR");
 Gt.set(65, "OUT_OF_MEMORY");
 Gt.set(81, "UNINITIALIZED_FUNCTION_CALL");
 const Bu = new RegExp(/^bytes([0-9]*)$/), vu = new RegExp(/^(u?int)([0-9]*)$/);
-let xr = null, Fs = 1024;
+let _r = null, Fs = 1024;
 function Ou(e, t, n, r) {
   let s = "missing revert data", i = null;
   const o = null;
@@ -5712,7 +5712,7 @@ class fe {
    *  On the first call, the instance is created internally.
    */
   static defaultAbiCoder() {
-    return xr == null && (xr = new fe()), xr;
+    return _r == null && (_r = new fe()), _r;
   }
   /**
    *  Returns an ethers-compatible [[CallExceptionError]] Error for the given
@@ -6281,7 +6281,7 @@ class ge {
       const r = this.getError(t);
       m(r, "unknown error", "fragment", t), t = r;
     }
-    return _e([
+    return xe([
       t.selector,
       this._encodeParams(t.inputs, n || [])
     ]);
@@ -6311,7 +6311,7 @@ class ge {
       const r = this.getFunction(t);
       m(r, "unknown function", "fragment", t), t = r;
     }
-    return _e([
+    return xe([
       t.selector,
       this._encodeParams(t.inputs, n || [])
     ]);
@@ -6331,7 +6331,7 @@ class ge {
       m(i, "unknown function", "fragment", t), t = i;
     }
     let r = "invalid length for result data";
-    const s = Kt(n);
+    const s = zt(n);
     if (s.length % 32 === 0)
       try {
         return this.#r.decode(t.outputs, s);
@@ -6471,7 +6471,7 @@ class ge {
     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, _e(r)) : null, c = this.#r.decode(i, n, !0), u = [], l = [];
+    const a = r != null ? this.#r.decode(s, xe(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;
@@ -6868,7 +6868,7 @@ async function Yu(e, t, n, r, s, i) {
   const u = await Vu(e, t, o, a);
   return { amountA: o, amountB: a, liquidity: u };
 }
-async function zu(e, t, n) {
+async function Ku(e, t, n) {
   const {
     reserveA: r,
     reserveB: s,
@@ -6884,7 +6884,7 @@ async function zu(e, t, n) {
     total_supply: u
   }), { amountA: o, amountB: a };
 }
-async function Ku(e, t, n, r, s, i, o, a) {
+async function zu(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;
@@ -6934,7 +6934,7 @@ async function fo(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 Ku(d, p, c, u, l, f, w, h);
+    await zu(d, p, c, u, l, f, w, h);
   }
 }
 async function Xu(e, t, n) {
@@ -6954,7 +6954,7 @@ async function Ju(e, t, n) {
   return await fo(r, n), r;
 }
 async function ju(e, t, n, r, s) {
-  const { amountA: i, amountB: o } = await zu(e, t, n);
+  const { amountA: i, amountB: o } = await Ku(e, t, n);
   if (i < r)
     throw new Error("Insufficient A amount");
   if (o < s)
@@ -7392,12 +7392,12 @@ async function yo(e = {}) {
     throw new Error("Ordinals wallet address not found.");
   const n = new Hr(e, 2);
   n.next();
-  const r = await zr(Vs());
+  const r = await Kr(Vs());
   await new Promise((p) => setTimeout(p, 500)), n.next();
-  const s = await zr(Vs());
+  const s = await Kr(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 = uc(_i, i, void 0, o, 48), c = xi(a, T.fields.Fr.ORDER), u = S.from(c), l = go(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 = _i(a, T.fields.Fr.ORDER), u = S.from(c), l = go(u), f = `0x${u.toString("hex")}`, d = {
     bitcoinAddress: t.address,
     swapPubkey: l,
     swapPrivkey: f
@@ -7513,7 +7513,7 @@ async function mo(e) {
   });
   return BigInt(s.result);
 }
-async function xo(e) {
+async function _o(e) {
   const t = Wt();
   if (!t?.address)
     throw new Error("Ordinals wallet address not found.");
@@ -7606,7 +7606,7 @@ async function qe() {
   });
   return BigInt(r.result);
 }
-async function xl(e, t) {
+async function _l(e, t) {
   const n = J("get_swap_referrer_info"), s = await X(n, {
     method: "POST",
     headers: {
@@ -7623,7 +7623,7 @@ async function xl(e, t) {
 }
 async function Vr(e, t) {
   try {
-    return await xl(e, t);
+    return await _l(e, t);
   } catch (n) {
     return console.warn(`Failed to get referrer info for ref_id ${t}:`, n), { referrerPubkey: void 0, refReturnBps: void 0 };
   }
@@ -7640,7 +7640,7 @@ async function $t(e) {
   });
   return BigInt(r.result);
 }
-async function _l() {
+async function xl() {
   const e = J("get_tokens");
   return (await X(e, {
     method: "GET"
@@ -7722,7 +7722,15 @@ async function Ol(e) {
     }
   });
 }
-async function Tl(e) {
+const Tl = [
+  "swap",
+  "add_liq",
+  "remove_liq",
+  "deposit",
+  "withdraw",
+  "unwrap"
+];
+async function Il(e) {
   if (e.limit !== void 0) {
     if (e.limit > 200)
       throw new Error("Limit cannot exceed 200");
@@ -7731,8 +7739,15 @@ async function Tl(e) {
   }
   if (e.offset !== void 0 && (!Number.isInteger(e.offset) || e.offset < 0))
     throw new Error("Offset must be a non-negative integer");
-  const t = new URLSearchParams({ pairAddress: e.pairAddress });
-  e.limit !== void 0 && t.set("limit", String(e.limit)), e.offset !== void 0 && t.set("offset", String(e.offset));
+  if (e.kinds !== void 0) {
+    if (e.kinds.length === 0)
+      throw new Error("Kinds must name at least one kind");
+    const s = e.kinds.find((i) => !Tl.includes(i));
+    if (s !== void 0)
+      throw new Error(`Unknown activity kind: ${s}`);
+  }
+  const t = new URLSearchParams();
+  e.pairAddress !== void 0 && t.set("pairAddress", e.pairAddress), e.limit !== void 0 && t.set("limit", String(e.limit)), e.offset !== void 0 && t.set("offset", String(e.offset)), e.kinds !== void 0 && t.set("kinds", e.kinds.join(","));
   const n = J(`wallet-activity/${encodeURIComponent(e.pubkey)}?${t}`);
   return await X(n, {
     method: "GET",
@@ -7753,7 +7768,7 @@ async function wn(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}
@@ -7797,7 +7812,7 @@ async function So(e) {
     body: JSON.stringify(e)
   });
 }
-async function Il(e) {
+async function Rl(e) {
   const t = J("deposit");
   return X(t, {
     method: "POST",
@@ -7826,10 +7841,10 @@ function Bo(e, t) {
 function vo(e) {
   return e ? e.reduce((t, n) => t + n.amount, 0n) : 0n;
 }
-async function Rl(e, t, n, r = !0, s, i = {}) {
+async function kl(e, t, n, r = !0, s, i = {}) {
   const o = yn();
   if (!o || !o.wallets) throw new Error("Wallets not found");
-  const a = Ke(), c = Zn(), u = Wt();
+  const a = ze(), c = Zn(), u = Wt();
   if (!c) throw new Error("Payment wallet not found");
   if (!c.address) throw new Error("Payment wallet address not found");
   if (!u) throw new Error("Ordinals wallet not found");
@@ -7838,7 +7853,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
   let w = 0n, h = 0, g = "";
   const b = await mo(e);
   if (b < t) {
-    const At = await xo(e), te = At.available_balance_in_18_dec;
+    const At = await _o(e), te = At.available_balance_in_18_dec;
     h = At.decimals, g = At.ticker, w = t - b;
     const ee = vo(s);
     if (te + ee < w)
@@ -7856,24 +7871,24 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
   const F = new Hr(
     i,
     3 + (w > 0n ? 2 : 0) + (O ? 2 : 0)
-  ), M = F.wrap(Ir(o.provider)), A = rr(), C = `0x095ea7b3000000000000000000000000${A.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, I = await Xe(C), x = K.str(
+  ), M = F.wrap(Ir(o.provider)), A = rr(), C = `0x095ea7b3000000000000000000000000${A.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, I = await Xe(C), _ = z.str(
     `{"p":"brc20-prog","op":"c","c":"${e}","b":"${I}"}`
   ), D = new ce(
-    K.str("text/plain"),
+    z.str("text/plain"),
     null,
     null,
     null,
     null,
-    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: H,
     token_address: e
-  }), y = bn.address.toOutputScript(d, Ke()), _ = await Eo({
+  }), y = bn.address.toOutputScript(d, ze()), x = await Eo({
     pubkey: H,
     ordinals_script: y.toString("hex")
   }), B = await So({
@@ -7881,7 +7896,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     bls_pubkey: H,
     token_address: e.toLowerCase(),
     bip322_signature: U,
-    bls12_signature: _
+    bls12_signature: x
   }), R = B.edcsa_signature, P = B.pubkey_idx, $ = B.token_idx, q = await ir({
     pubkey: H,
     pk_idx: BigInt(P)
@@ -7893,33 +7908,33 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     BigInt(P),
     q,
     R
-  ]), Z = await Xe(W), ct = K.str(
+  ]), Z = await Xe(W), ct = z.str(
     `{"p":"brc20-prog","op":"c","c":"${A}","b":"${Z}"}`
   ), j = new ce(
-    K.str("text/plain"),
+    z.str("text/plain"),
     null,
     null,
     null,
     null,
     ct
   );
-  let G = null, ut = null, gt = null, _t = null, Q = null, rt = null, jt = null, Be = null, Qt = null;
+  let G = null, ut = null, gt = null, xt = null, Q = null, rt = null, jt = null, Be = null, Qt = null;
   if (w > 0n) {
     const At = Bo(
       w,
       h
     ), te = new ce(
-      K.str("text/plain"),
+      z.str("text/plain"),
       null,
       null,
       null,
       null,
-      K.str(
+      z.str(
         `{"p":"brc-20","op":"transfer","tick":"${g}","amt":"${At}"}`
       )
     );
     if ((s?.length ?? 0) > 0) {
-      const On = await Ks(s, d), Ie = await Ho(
+      const On = await zs(s, d), Ie = await Ho(
         te,
         On,
         n,
@@ -7945,7 +7960,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
         !0,
         M
       );
-    Q = Qt.signed_commit_tx_hex, rt = Qt.signed_reveal_tx_hex, gt = Qt.commit_txid, _t = Qt.reveal_txid, G = Qt.inscription_id;
+    Q = Qt.signed_commit_tx_hex, rt = Qt.signed_reveal_tx_hex, gt = Qt.commit_txid, xt = Qt.reveal_txid, G = Qt.inscription_id;
     const ee = `${G.split("i")[0]}:0:0`;
     ut = Qt.secret;
     let Me = null;
@@ -7958,7 +7973,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       );
       const On = new Ut(
         !0,
-        S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+        S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
         null,
         null,
         null
@@ -8014,7 +8029,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       At.push(St, Nt), Ft(At, [lt, te]);
       const Me = new Ut(
         !0,
-        S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+        S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
         null,
         null,
         null
@@ -8082,7 +8097,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     Yr = Te.secret, De.push(cr, ur), Ft(De, [sn, At]);
     const te = new Ut(
       !0,
-      S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+      S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
       null,
       null,
       null
@@ -8126,7 +8141,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     base_deposit_details: w > 0n ? {
       commit_txid: gt,
       commit_txhex: Q,
-      reveal_txid: _t,
+      reveal_txid: xt,
       reveal_txhex: rt,
       send_to_opreturn_txid: Be,
       send_to_opreturn_txhex: jt,
@@ -8135,19 +8150,19 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       fee_rate: n
     } : null
   };
-  return (await Il(qo)).result;
+  return (await Rl(qo)).result;
 }
-async function kl(e, t, n, r = !0, s) {
+async function Nl(e, t, n, r = !0, s) {
   const i = yn();
   if (!i || !i.wallets) throw new Error("Wallets not found");
-  const o = Ke(), a = Zn();
+  const o = ze(), a = Zn();
   if (!a) throw new Error("Payment wallet not found");
   if (!a.address) throw new Error("Payment wallet address not found");
   const c = a.address, u = a.pubkey, l = new Ut(!1, null, c, null, u);
   let f = 0n, d = 0, p = "";
   const w = await mo(e);
   if (w < t) {
-    const lt = await xo(e), Lt = lt.available_balance_in_18_dec;
+    const lt = await _o(e), Lt = lt.available_balance_in_18_dec;
     d = lt.decimals, p = lt.ticker, f = t - w;
     const dt = vo(s);
     if (Lt + dt < f)
@@ -8162,10 +8177,10 @@ async function kl(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 = rr(), v = `0x095ea7b3000000000000000000000000${b.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, O = await Xe(v), F = K.str(
+  const b = rr(), v = `0x095ea7b3000000000000000000000000${b.slice(2).toLowerCase()}ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff`, O = await Xe(v), F = z.str(
     `{"p":"brc20-prog","op":"c","c":"${e}","b":"${O}"}`
   ), M = new ce(
-    K.str("text/plain"),
+    z.str("text/plain"),
     null,
     null,
     null,
@@ -8174,39 +8189,39 @@ async function kl(e, t, n, r = !0, s) {
   ), A = (await et())?.swapPubkey;
   if (!A)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const C = `0x${"00".repeat(64)}`, I = 1, x = 1, D = await ir({
+  const C = `0x${"00".repeat(64)}`, I = 1, _ = 1, D = await ir({
     pubkey: A,
     pk_idx: BigInt(I)
   }), U = wo().encodeFunctionData("deposit", [
     e,
-    x,
+    _,
     t,
     A,
     BigInt(I),
     D,
     C
-  ]), y = await Xe(U), _ = K.str(
+  ]), y = await Xe(U), x = z.str(
     `{"p":"brc20-prog","op":"c","c":"${b}","b":"${y}"}`
   ), B = new ce(
-    K.str("text/plain"),
+    z.str("text/plain"),
     null,
     null,
     null,
     null,
-    _
-  ), R = await zs(c);
+    x
+  ), R = await Ks(c);
   let P = null, $ = null, q = null, k = null, W = null, Z = 0;
   if (f > 0n) {
     const lt = Bo(
       f,
       d
     ), Lt = new ce(
-      K.str("text/plain"),
+      z.str("text/plain"),
       null,
       null,
       null,
       null,
-      K.str(
+      z.str(
         `{"p":"brc-20","op":"transfer","tick":"${p}","amt":"${lt}"}`
       )
     );
@@ -8215,7 +8230,7 @@ async function kl(e, t, n, r = !0, s) {
       const Nt = Wt();
       if (!Nt) throw new Error("Ordinals wallet not found");
       if (!Nt.address) throw new Error("Ordinals wallet address not found");
-      const ve = Nt.address, rn = await Ks(s, ve);
+      const ve = Nt.address, rn = await zs(s, ve);
       dt = await Go(
         Lt,
         rn,
@@ -8224,7 +8239,7 @@ async function kl(e, t, n, r = !0, s) {
         R
       );
     } else
-      dt = await Kr(
+      dt = await zr(
         Lt,
         n,
         null,
@@ -8244,7 +8259,7 @@ async function kl(e, t, n, r = !0, s) {
       );
       const Nt = new Ut(
         !0,
-        S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+        S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
         null,
         null,
         null
@@ -8270,7 +8285,7 @@ async function kl(e, t, n, r = !0, s) {
       throw new Error("Failed to send inscription to OP_RETURN");
     k = St.unsigned_tx_hex, W = St.txid, Z += St.tx_fee;
   }
-  let ct = null, j = null, G = null, ut = null, gt = null, _t = 0;
+  let ct = null, j = null, G = null, ut = null, gt = null, xt = 0;
   if (g) {
     const lt = [];
     f > 0n && lt.push(
@@ -8280,7 +8295,7 @@ async function kl(e, t, n, r = !0, s) {
     );
     try {
       Ft(lt, null);
-      const Et = await Kr(
+      const Et = await zr(
         M,
         n,
         null,
@@ -8288,7 +8303,7 @@ async function kl(e, t, n, r = !0, s) {
         0,
         R
       );
-      j = Et.unsigned_commit_tx_hex, G = Et.signed_reveal_tx_hex, ct = Et.inscription_id, _t += Et.total_fee;
+      j = Et.unsigned_commit_tx_hex, G = Et.signed_reveal_tx_hex, ct = Et.inscription_id, xt += Et.total_fee;
     } finally {
       Yt();
     }
@@ -8300,7 +8315,7 @@ async function kl(e, t, n, r = !0, s) {
       lt.push(j, G), Ft(lt, [ct, Lt]);
       const Et = new Ut(
         !0,
-        S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+        S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
         null,
         null,
         null
@@ -8324,7 +8339,7 @@ async function kl(e, t, n, r = !0, s) {
     }
     if (dt == null)
       throw new Error("Failed to send inscription to OP_RETURN");
-    ut = dt.unsigned_tx_hex, gt = dt.txid, _t += dt.tx_fee;
+    ut = dt.unsigned_tx_hex, gt = dt.txid, xt += dt.tx_fee;
   }
   const Q = [], rt = [];
   if (f > 0n) {
@@ -8366,7 +8381,7 @@ async function kl(e, t, n, r = !0, s) {
     jt += lt.total_fee, rt.push(Lt, dt), Ft(rt, [Et, St]);
     const Nt = new Ut(
       !0,
-      S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+      S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
       null,
       null,
       null
@@ -8388,12 +8403,12 @@ async function kl(e, t, n, r = !0, s) {
   return jt += Be.tx_fee, {
     needs_approval: g,
     base_deposit_fees_total: Z,
-    allowance_fees_total: _t,
+    allowance_fees_total: xt,
     deposit_fees_total: jt,
     fee_rate: n
   };
 }
-async function Nl(e) {
+async function Cl(e) {
   const t = J("wrap");
   return X(t, {
     method: "POST",
@@ -8403,7 +8418,7 @@ async function Nl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Cl(e) {
+async function $l(e) {
   const t = J("estimate_wrap_gas");
   return X(t, {
     method: "POST",
@@ -8413,7 +8428,7 @@ async function Cl(e) {
     body: JSON.stringify(e)
   });
 }
-async function $l(e, t, n = {}) {
+async function Ll(e, t, n = {}) {
   const r = await Jt(), s = yn();
   if (!s || !s.wallets) throw new Error("Wallets not found");
   const i = new Hr(n), o = i.wrap(Ir(s.provider)), a = Zn(), c = Wt();
@@ -8425,11 +8440,11 @@ async function $l(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 = bn.address.toOutputScript(u, Ke()), w = await Eo({
+  }), p = bn.address.toOutputScript(u, ze()), w = await Eo({
     pubkey: f,
     ordinals_script: p.toString("hex")
   }), h = await So({
@@ -8454,22 +8469,22 @@ async function $l(e, t, n = {}) {
   ), A = `0x5608f857${fe.defaultAbiCoder().encode(
     ["address", "bytes"],
     [l, S.from(F.slice(2), "hex")]
-  ).slice(2)}`, C = await Xe(A), I = K.str(
+  ).slice(2)}`, C = await Xe(A), I = z.str(
     `{"p":"brc20-prog","op":"c","c":"${r.wbtc_address}","b":"${C}"}`
   );
-  let x = 0;
+  let _ = 0;
   for (let D = 0; D < 5; D++) {
-    const H = I.length * Hs, U = x > H ? Math.ceil((x - H) / Hs) : 0, y = K.from(
-      S.concat([I, K.str(" ".repeat(U))])
-    ), _ = new ce(
-      K.str("text/plain"),
+    const H = I.length * Hs, U = _ > H ? Math.ceil((_ - H) / Hs) : 0, y = z.from(
+      S.concat([I, z.str(" ".repeat(U))])
+    ), x = new ce(
+      z.str("text/plain"),
       null,
       null,
       null,
       null,
       y
     ), B = await Js(
-      _,
+      x,
       [],
       t,
       null,
@@ -8484,9 +8499,9 @@ async function $l(e, t, n = {}) {
         [R, P],
         [$, q]
       );
-      const _t = new Ut(
+      const xt = new Ut(
         !0,
-        S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+        S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
         null,
         null,
         null
@@ -8500,7 +8515,7 @@ async function $l(e, t, n = {}) {
       W = await Ln(
         $,
         [],
-        _t,
+        xt,
         1,
         Q,
         t,
@@ -8522,19 +8537,19 @@ async function $l(e, t, n = {}) {
       secret: k,
       inscription_id: $,
       fee_rate: t
-    }, G = await Cl(j), ut = Math.max(
+    }, G = await $l(j), ut = Math.max(
       G.estimated_gas + 1e5,
       G.estimated_gas * 1.2
     );
     if (G.allocated_gas < ut) {
-      x = ut + 5e4;
+      _ = ut + 5e4;
       continue;
     }
-    return (await Nl(j)).result;
+    return (await Cl(j)).result;
   }
   throw new Error("Failed to estimate gas for wrap order after multiple attempts");
 }
-async function Ll(e, t) {
+async function Al(e, t) {
   const n = await Jt(), r = yn();
   if (!r || !r.wallets) throw new Error("Wallets not found");
   const s = Zn();
@@ -8559,16 +8574,16 @@ async function Ll(e, t) {
   ), p = `0x5608f857${fe.defaultAbiCoder().encode(
     ["address", "bytes"],
     [i, S.from(f.slice(2), "hex")]
-  ).slice(2)}`, w = await Xe(p), h = K.str(
+  ).slice(2)}`, w = await Xe(p), h = z.str(
     `{"p":"brc20-prog","op":"c","c":"${n.wbtc_address}","b":"${w}"}`
   ), g = new ce(
-    K.str("text/plain"),
+    z.str("text/plain"),
     null,
     null,
     null,
     null,
     h
-  ), b = await zs(s.address);
+  ), b = await Ks(s.address);
   let v = 0;
   const O = await Xs(
     g,
@@ -8588,7 +8603,7 @@ async function Ll(e, t) {
     );
     const D = new Ut(
       !0,
-      S.from(me.encode(["OP_RETURN", K.str("BRC20PROG")], !1)),
+      S.from(me.encode(["OP_RETURN", z.str("BRC20PROG")], !1)),
       null,
       null,
       null
@@ -8618,7 +8633,7 @@ async function Ll(e, t) {
     fee_rate: t
   };
 }
-async function Al(e, t, n, r) {
+async function Pl(e, t, n, r) {
   const s = await Jt();
   er(s.wbtc_address, s.factory_address);
   const i = (await et())?.swapPubkey;
@@ -8655,7 +8670,7 @@ async function Al(e, t, n, r) {
     throw new Error("No data returned from add liquidity request.");
   return c.data;
 }
-async function Pl(e) {
+async function Fl(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}
@@ -8671,7 +8686,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 Pe(t, "ordinals");
 }
-async function Fl(e) {
+async function Ul(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");
@@ -8683,7 +8698,7 @@ async function Fl(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 Ul(e) {
+async function ql(e) {
   const t = J("add_liq_req");
   return X(t, {
     method: "POST",
@@ -8693,11 +8708,11 @@ async function Ul(e) {
     body: JSON.stringify(e)
   });
 }
-async function ql(e, t, n, r, s) {
+async function Dl(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 qe(), f = await $t("add_liquidity"), d = await Pl({
+  const o = n * (10000n - s) / 10000n, a = r * (10000n - s) / 10000n, c = 0n, u = 0n, l = await qe(), f = await $t("add_liquidity"), d = await Fl({
     token1_addr: e,
     token2_addr: t,
     amt1: n.toString(),
@@ -8707,7 +8722,7 @@ async function ql(e, t, n, r, s) {
     token1FeeBps: c.toString(),
     token2FeeBps: u.toString(),
     btc_fee: f.toString()
-  }), p = await Fl({
+  }), p = await Ul({
     pubkey: i,
     nonce: l,
     token1_addr: e,
@@ -8720,7 +8735,7 @@ async function ql(e, t, n, r, s) {
     token2FeeBps: u,
     btc_fee: f
   });
-  return await Ul({
+  return await ql({
     pubkey: i,
     token1_addr: e,
     token2_addr: t,
@@ -8735,7 +8750,7 @@ async function ql(e, t, n, r, s) {
     bip322_signature: d
   });
 }
-async function Dl(e, t, n) {
+async function Ml(e, t, n) {
   const r = await Jt();
   er(r.wbtc_address, r.factory_address);
   const s = (await et())?.swapPubkey;
@@ -8771,7 +8786,7 @@ async function Dl(e, t, n) {
     throw new Error("No data returned from remove liquidity request.");
   return a.data;
 }
-async function Ml(e) {
+async function Wl(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}
@@ -8786,7 +8801,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 Pe(t, "ordinals");
 }
-async function Wl(e) {
+async function Gl(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");
@@ -8798,7 +8813,7 @@ async function Wl(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 Gl(e) {
+async function Hl(e) {
   const t = J("remove_liq_req");
   return X(t, {
     method: "POST",
@@ -8808,11 +8823,11 @@ async function Gl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Hl(e, t, n, r, s, i) {
+async function Vl(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 qe(), d = await $t("remove_liquidity"), p = await Ml({
+  const a = r * (10000n - i) / 10000n, c = s * (10000n - i) / 10000n, u = 0n, l = 0n, f = await qe(), d = await $t("remove_liquidity"), p = await Wl({
     token1_addr: e,
     token2_addr: t,
     lp_amt: n.toString(),
@@ -8821,7 +8836,7 @@ async function Hl(e, t, n, r, s, i) {
     token1FeeBps: u.toString(),
     token2FeeBps: l.toString(),
     btc_fee: d.toString()
-  }), w = await Wl({
+  }), w = await Gl({
     pubkey: o,
     nonce: f,
     token1_addr: e,
@@ -8833,7 +8848,7 @@ async function Hl(e, t, n, r, s, i) {
     token2FeeBps: l,
     btc_fee: d
   });
-  return await Gl({
+  return await Hl({
     pubkey: o,
     token1_addr: e,
     token2_addr: t,
@@ -8855,7 +8870,7 @@ async function or(e, t) {
   }
   return Cu(e, t, n.fee_policy);
 }
-async function Vl(e, t, n) {
+async function Zl(e, t, n) {
   const r = await Jt();
   await sr(e, t);
   const s = (await et())?.swapPubkey;
@@ -8903,7 +8918,7 @@ async function Vl(e, t, n) {
     fees: co(n, u.amounts[1], a, c, o)
   };
 }
-async function Zl(e) {
+async function Yl(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}
@@ -8919,7 +8934,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 Pe(t, "ordinals");
 }
-async function Yl(e) {
+async function Kl(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 += ho.toString(16).padStart(8, "0"), e.ref_return_bps && e.ref_return_bps > 0n && (t += e.ref_return_bps.toString(16).padStart(8, "0")));
@@ -8941,12 +8956,12 @@ async function zl(e) {
     body: JSON.stringify(e)
   });
 }
-async function Kl(e, t, n, r, s, i) {
+async function Xl(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 sr(e, t);
-  const a = r * (10000n - s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await or(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Zl({
+  const a = r * (10000n - s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await or(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Yl({
     token1_addr: e,
     token2_addr: t,
     in_amt: n.toString(),
@@ -8956,7 +8971,7 @@ async function Kl(e, t, n, r, s, i) {
     btc_fee: u.toString(),
     referrer_pubkey: d,
     ref_return_bps: p ? p.toString() : void 0
-  }), h = await Yl({
+  }), h = await Kl({
     pubkey: o,
     nonce: c,
     token1_addr: e,
@@ -8984,7 +8999,7 @@ async function Kl(e, t, n, r, s, i) {
     referrer_id: d ? i : void 0
   });
 }
-async function Xl(e, t, n) {
+async function Jl(e, t, n) {
   const r = await Jt();
   await sr(e, t);
   const s = (await et())?.swapPubkey;
@@ -9032,7 +9047,7 @@ async function Xl(e, t, n) {
     fees: co(u.amounts[0], n, a, c, o)
   };
 }
-async function Jl(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}
@@ -9048,7 +9063,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 Pe(t, "ordinals");
 }
-async function jl(e) {
+async function Ql(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 += ho.toString(16).padStart(8, "0"), e.ref_return_bps && e.ref_return_bps > 0n && (t += e.ref_return_bps.toString(16).padStart(8, "0")));
@@ -9060,7 +9075,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 Ql(e) {
+async function tf(e) {
   const t = J("swap2");
   return X(t, {
     method: "POST",
@@ -9070,12 +9085,12 @@ async function Ql(e) {
     body: JSON.stringify(e)
   });
 }
-async function tf(e, t, n, r, s, i) {
+async function ef(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 sr(e, t);
-  const a = n * (10000n + s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await or(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Jl({
+  const a = n * (10000n + s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await or(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(),
@@ -9085,7 +9100,7 @@ async function tf(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 Ql({
     pubkey: o,
     nonce: c,
     token1_addr: e,
@@ -9098,7 +9113,7 @@ async function tf(e, t, n, r, s, i) {
     referrer_pubkey: d,
     ref_return_bps: p
   });
-  return await Ql({
+  return await tf({
     pubkey: o,
     token1_addr: e,
     token2_addr: t,
@@ -9114,7 +9129,7 @@ async function tf(e, t, n, r, s, i) {
   });
 }
 function Oo(e) {
-  const t = Ke();
+  const t = ze();
   return `0x${tt(bn.address.toOutputScript(e, t)).slice(26)}`;
 }
 async function To(e) {
@@ -9152,7 +9167,7 @@ async function Ro(e) {
     body: JSON.stringify(e)
   });
 }
-async function ef(e, t, n) {
+async function nf(e, t, n) {
   const r = (await et())?.swapPubkey;
   if (!r)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -9183,7 +9198,7 @@ async function ef(e, t, n) {
     bip322_signature: l
   });
 }
-async function nf(e, t) {
+async function rf(e, t) {
   const n = (await et())?.swapPubkey;
   if (!n)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -9217,7 +9232,7 @@ async function nf(e, t) {
     bip322_signature: l
   });
 }
-async function rf(e, t) {
+async function sf(e, t) {
   const n = await Jt();
   er(n.wbtc_address, n.factory_address);
   const r = (await et())?.swapPubkey;
@@ -9243,7 +9258,7 @@ async function rf(e, t) {
     throw new Error("No data returned from unwrap request.");
   return { amt: o.data.amt };
 }
-async function sf(e) {
+async function of(e) {
   e.pkscript = e.pkscript.toLowerCase();
   const t = `Unwrap Order:
 Pkscript: ${e.pkscript}
@@ -9255,7 +9270,7 @@ BTC Fee: ${e.btc_fee}
 By signing this message, you authorize the creation of a withdraw order with the above parameters.`;
   return await Pe(t, "ordinals");
 }
-async function of(e) {
+async function af(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");
@@ -9267,7 +9282,7 @@ async function of(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 af(e) {
+async function cf(e) {
   const t = J("unwrap");
   return X(t, {
     method: "POST",
@@ -9277,24 +9292,24 @@ async function af(e) {
     body: JSON.stringify(e)
   });
 }
-async function cf(e, t) {
+async function uf(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 qe(), o = await $t("unwrap"), a = await sf({
+  const r = 0n, s = 0n, i = await qe(), o = await $t("unwrap"), a = await of({
     pkscript: e,
     amt: t.toString(),
     token1FeeBps: r.toString(),
     token2FeeBps: s.toString(),
     btc_fee: o.toString()
-  }), c = await of({
+  }), c = await af({
     pubkey: n,
     nonce: i,
     pkscript: e,
     amt: t,
     btc_fee: o
   });
-  return await af({
+  return await cf({
     pubkey: n,
     pkscript: e,
     amt: t.toString(),
@@ -9305,23 +9320,24 @@ async function cf(e, t) {
     bip322_signature: a
   });
 }
-async function uf(e, t, n, r) {
-  return await Tl({
+async function lf(e, t, n, r, s) {
+  return await Il({
     pubkey: e,
     pairAddress: t,
     limit: n,
-    offset: r
+    offset: r,
+    kinds: s
   });
 }
-async function lf(e, t, n) {
+async function ff(e, t, n) {
   return await Ol({
     pair_address: e,
     limit: t || 20,
     offset: n || 0
   });
 }
-async function ff(e, t, n, r, s) {
-  return (await ql(
+async function df(e, t, n, r, s) {
+  return (await Dl(
     e,
     t,
     n,
@@ -9329,8 +9345,8 @@ async function ff(e, t, n, r, s) {
     s
   )).success;
 }
-async function df(e, t, n, r, s, i) {
-  return (await Hl(
+async function pf(e, t, n, r, s, i) {
+  return (await Vl(
     e,
     t,
     n,
@@ -9339,8 +9355,8 @@ async function df(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function pf(e, t, n, r, s, i) {
-  return (await Kl(
+async function hf(e, t, n, r, s, i) {
+  return (await Xl(
     e,
     t,
     n,
@@ -9349,8 +9365,8 @@ async function pf(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function hf(e, t, n, r, s, i) {
-  return (await tf(
+async function wf(e, t, n, r, s, i) {
+  return (await ef(
     e,
     t,
     n,
@@ -9359,11 +9375,11 @@ async function hf(e, t, n, r, s, i) {
     i
   )).success;
 }
-async function wf(e, t) {
-  return (await cf(e, t)).success;
+async function gf(e, t) {
+  return (await uf(e, t)).success;
 }
-async function gf(e, t, n, r = !0, s, i) {
-  return await Rl(
+async function yf(e, t, n, r = !0, s, i) {
+  return await kl(
     e,
     t,
     n,
@@ -9372,57 +9388,57 @@ async function gf(e, t, n, r = !0, s, i) {
     i
   );
 }
-async function yf(e, t, n) {
-  return await $l(e, t, n);
-}
 async function bf(e, t, n) {
-  return n ? (await ef(e, n, t)).success : (await nf(e, t)).success;
+  return await Ll(e, t, n);
+}
+async function mf(e, t, n) {
+  return n ? (await nf(e, n, t)).success : (await rf(e, t)).success;
 }
-const Mf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Wf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  addLiquidity: ff,
+  addLiquidity: df,
   createSwapWallet: yo,
-  deposit: gf,
+  deposit: yf,
   ensureSwapWallet: hl,
-  getActivityOfPair: lf,
-  getAddLiquidityResult: Al,
+  getActivityOfPair: ff,
+  getAddLiquidityResult: Pl,
   getKlines: Bl,
   getMinerFee: $t,
-  getMinerFeesOfDepositOrder: kl,
-  getMinerFeesOfWrapOrder: Ll,
+  getMinerFeesOfDepositOrder: Nl,
+  getMinerFeesOfWrapOrder: Al,
   getPairAddress: nr,
   getPairReserves: Ue,
   getPairVolumeOverDays: Sl,
-  getRemoveLiquidityResult: Dl,
+  getRemoveLiquidityResult: Ml,
   getSwapBalance: ml,
   getSwapBalances: bl,
-  getSwapExactInputResult: Vl,
-  getSwapExactOutputResult: Xl,
+  getSwapExactInputResult: Zl,
+  getSwapExactOutputResult: Jl,
   getSwapInfo: Jt,
   getSwapStatus: gl,
   getSwapWalletSecurityCode: wl,
   getTokenDecimals: wn,
   getTvlHistory: vl,
-  getUnwrapBtcResult: rf,
-  getWalletActivities: uf,
+  getUnwrapBtcResult: sf,
+  getWalletActivities: lf,
   importSwapWallet: pl,
   listPairs: El,
-  listTokens: _l,
-  removeLiquidity: df,
+  listTokens: xl,
+  removeLiquidity: pf,
   satsToBtc: ao,
   satsToUsd: Au,
-  swapExactInput: pf,
-  swapExactOutput: hf,
+  swapExactInput: hf,
+  swapExactOutput: wf,
   swapSide: Lu,
   tryGetSwapReferrerInfo: Vr,
-  unwrapBtc: wf,
-  withdraw: bf,
-  wrapBtc: yf
-}, Symbol.toStringTag, { value: "Module" })), mf = "text/plain", ko = /^[a-z0-9-]{6}$/i, xf = /^(?:[0-9a-f]{2})+$/i;
+  unwrapBtc: gf,
+  withdraw: mf,
+  wrapBtc: bf
+}, Symbol.toStringTag, { value: "Module" })), _f = "text/plain", ko = /^[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 K.str(e).length;
+  return z.str(e).length;
 }
 function Tr(e, t) {
   if (typeof e != "string" || !xf.test(e))
@@ -9434,12 +9450,12 @@ function Vn(e, t) {
 }
 function gn(e) {
   return new ce(
-    K.str(mf),
+    z.str(_f),
     null,
     null,
     null,
     null,
-    K.str(JSON.stringify(e))
+    z.str(JSON.stringify(e))
   );
 }
 function No(e, t, n) {
@@ -9452,7 +9468,7 @@ function No(e, t, n) {
   const s = r || e.selfMint === !0, i = { p: "brc-20", op: "deploy", tick: e.tick };
   return n != null && (i.salt = n), i.max = e.max, e.lim != null && (i.lim = e.lim), e.dec != null && (i.dec = String(e.dec)), s && (i.self_mint = "true"), i;
 }
-function _f(e) {
+function Ef(e) {
   const t = Zr(e.tick);
   if (t === 6)
     throw new Error("6-byte tickers require a predeploy; use predeployInscriptions()");
@@ -9460,12 +9476,12 @@ function _f(e) {
     throw new Error(`deploy ticker must be 4 or 5 bytes, got ${t}`);
   return gn(No(e, t, null));
 }
-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 Vn(e.amt, "amt"), gn({ p: "brc-20", op: "mint", tick: e.tick, amt: e.amt });
 }
-function Sf(e) {
+function Bf(e) {
   const t = Zr(e.tick);
   if (t < 4 || t > 6) throw new Error(`ticker must be 4-6 bytes, got ${t}`);
   return Vn(e.amt, "amt"), gn({ p: "brc-20", op: "transfer", tick: e.tick, amt: e.amt });
@@ -9473,12 +9489,12 @@ function Sf(e) {
 function Co(e = 16) {
   if (!Number.isInteger(e) || e <= 0)
     throw new Error("byteLength must be a positive integer");
-  return K.random(e).hex;
+  return z.random(e).hex;
 }
-function Bf(e) {
+function vf(e) {
   if (typeof e != "string" || e.length === 0)
     throw new Error("address must be a non-empty string");
-  return bn.address.toOutputScript(e, Ke()).toString("hex");
+  return bn.address.toOutputScript(e, ze()).toString("hex");
 }
 function $o(e, t, n) {
   if (typeof e != "string" || !ko.test(e))
@@ -9491,10 +9507,10 @@ function $o(e, t, n) {
   ]);
   return bn.crypto.hash256(r).toString("hex");
 }
-function vf(e) {
+function Of(e) {
   if (typeof e.tick != "string" || !ko.test(e.tick))
     throw new Error("6-byte ticker must match /^[A-Za-z0-9-]{6}$/");
-  const t = Bf(e.address), n = e.salt ?? Co();
+  const t = vf(e.address), n = e.salt ?? Co();
   Tr(n, "salt");
   const r = $o(e.tick, n, t), s = No(
     { tick: e.tick, max: e.max, lim: e.lim, dec: e.dec },
@@ -9535,7 +9551,7 @@ async function Lo(e, t, n, r, s, i, o, a, c) {
     );
   throw new Error(`Unsupported wallet type: ${c}`);
 }
-async function Of(e, t, n, r, s, i, o, a, c, u, l) {
+async function Tf(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");
@@ -9552,8 +9568,8 @@ async function Of(e, t, n, r, s, i, o, a, c, u, l) {
     f
   );
 }
-async function Tf(e, t, n, r, s, i) {
-  return await zo(
+async function If(e, t, n, r, s, i) {
+  return await Ko(
     e,
     t,
     n,
@@ -9563,8 +9579,8 @@ async function Tf(e, t, n, r, s, i) {
     s
   );
 }
-async function If(e, t, n, r, s, i, o) {
-  return await Ko(
+async function Rf(e, t, n, r, s, i, o) {
+  return await zo(
     e,
     t,
     n,
@@ -9575,20 +9591,20 @@ async function If(e, t, n, r, s, i, o) {
     i
   );
 }
-const Wf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Gf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   callSmartContract: Lo,
-  callSmartContractAbi: Of,
+  callSmartContractAbi: Tf,
   computeBrc20PredeployHash: $o,
-  deployBrc20Inscription: _f,
-  depositToBrc20Prog: Tf,
+  deployBrc20Inscription: Ef,
+  depositToBrc20Prog: If,
   generateBrc20Salt: Co,
-  mintBrc20Inscription: Ef,
-  predeployInscriptions: vf,
-  transferBrc20Inscription: Sf,
-  withdrawFromBrc20Prog: If
+  mintBrc20Inscription: Sf,
+  predeployInscriptions: Of,
+  transferBrc20Inscription: Bf,
+  withdrawFromBrc20Prog: Rf
 }, Symbol.toStringTag, { value: "Module" }));
-async function Rf(e, t, n, r, s) {
+async function kf(e, t, n, r, s) {
   const i = await js(
     [e],
     t,
@@ -9606,10 +9622,10 @@ async function Rf(e, t, n, r, s) {
     secret: i.secret
   };
 }
-async function kf(e, t, n, r, s) {
+async function Nf(e, t, n, r, s) {
   return await js(e, t, n, r, s);
 }
-async function Nf(e, t, n, r, s, i) {
+async function Cf(e, t, n, r, s, i) {
   return await Xo(
     e,
     t,
@@ -9619,19 +9635,19 @@ async function Nf(e, t, n, r, s, i) {
     i
   );
 }
-async function Cf(e, t, n, r) {
+async function $f(e, t, n, r) {
   return await Qs([e], t, n, r);
 }
-async function $f(e, t, n, r) {
+async function Lf(e, t, n, r) {
   return await Qs(e, t, n, r);
 }
-const Gf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Hf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  getInscribeFee: Cf,
-  getInscribeMultipleFee: $f,
-  inscribe: Rf,
-  inscribeMultiple: kf,
-  inscribeWithParent: Nf
+  getInscribeFee: $f,
+  getInscribeMultipleFee: Lf,
+  inscribe: kf,
+  inscribeMultiple: Nf,
+  inscribeWithParent: Cf
 }, Symbol.toStringTag, { value: "Module" })), Ao = [
   { inputs: [], stateMutability: "nonpayable", type: "constructor" },
   {
@@ -9790,7 +9806,7 @@ const Gf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     type: "function"
   }
 ], Po = "0xc54dd4581af2dbf18e4d90840226756e9d2b3cdb";
-async function Lf(e, t) {
+async function Af(e, t) {
   const n = t.toUpperCase(), r = ti("check_base_brc20_balance"), i = await ei(r, {
     method: "POST",
     headers: {
@@ -9808,7 +9824,7 @@ async function Lf(e, t) {
     ticker: i.result.ticker
   };
 }
-async function Af(e, t) {
+async function Pf(e, t) {
   const n = ti("check_brc20_balance"), s = await ei(n, {
     method: "POST",
     headers: {
@@ -9821,7 +9837,7 @@ async function Af(e, t) {
   });
   return BigInt(s.result);
 }
-async function Pf(e, t) {
+async function Ff(e, t) {
   const n = S.from(t, "utf-8"), r = await ni(
     Po,
     Ao,
@@ -9830,7 +9846,7 @@ async function Pf(e, t) {
   );
   return BigInt(r);
 }
-async function Ff(e) {
+async function Uf(e) {
   const t = S.from(e, "utf-8");
   return `0x${(await ni(
     Po,
@@ -9839,17 +9855,17 @@ async function Ff(e) {
     [t]
   )).slice(-40)}`;
 }
-const Hf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Vf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  getBRC20ProgBalanceOfAddress: Af,
-  getBRC20ProgBalanceOfTicker: Pf,
-  getBRC20ProgTokenAddressOfTicker: Ff,
-  getBaseBRC20BalanceOfAddress: Lf
+  getBRC20ProgBalanceOfAddress: Pf,
+  getBRC20ProgBalanceOfTicker: Ff,
+  getBRC20ProgTokenAddressOfTicker: Uf,
+  getBaseBRC20BalanceOfAddress: Af
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  Mf as a,
-  Wf as b,
-  Hf as c,
-  Gf as m,
-  Df as s
+  Wf as a,
+  Gf as b,
+  Vf as c,
+  Hf as m,
+  Mf as s
 };