@bestinslot/wallet-kit 0.13.2 → 0.13.3

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

@@ -1,4 +1,4 @@
-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 Vn, 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 Cn, a9 as Yt, aa as An, ab as Xs, d as tn, D as bn, ac as Ho, ad as Xr, ae as $n, 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";
+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) {
   const o = yn();
   if (!o)
@@ -50,7 +50,7 @@ function kr(e) {
     throw new Error("Hash must wrapped by utils.createHasher");
   Je(e.outputLen), Je(e.blockLen);
 }
-function Pn(e, t = !0) {
+function Fn(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
@@ -66,7 +66,7 @@ function un(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
-function ur(e) {
+function lr(e) {
   return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
 function Ht(e, t) {
@@ -90,7 +90,7 @@ function Jr(e) {
   if (e >= ne.a && e <= ne.f)
     return e - (ne.a - 10);
 }
-function Fn(e) {
+function Un(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   if (si)
@@ -135,7 +135,7 @@ function ii(e = 32) {
 const ea = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-const Nr = /* @__PURE__ */ BigInt(0), Un = /* @__PURE__ */ BigInt(1);
+const Nr = /* @__PURE__ */ BigInt(0), qn = /* @__PURE__ */ BigInt(1);
 function jr(e, t = "") {
   if (typeof e != "boolean") {
     const n = t && `"${t}" `;
@@ -170,7 +170,7 @@ function ai(e) {
 }
 function mt(e, t) {
   Je(t), e = na(e);
-  const n = Fn(e.toString(16).padStart(t * 2, "0"));
+  const n = Un(e.toString(16).padStart(t * 2, "0"));
   if (n.length !== t)
     throw new Error("number too large");
   return n;
@@ -181,7 +181,7 @@ function ci(e, t) {
 function ui(e) {
   return Uint8Array.from(e);
 }
-function Zn(e) {
+function Yn(e) {
   return Uint8Array.from(e, (t, n) => {
     const r = t.charCodeAt(0);
     if (t.length !== 1 || r > 127)
@@ -190,16 +190,16 @@ function Zn(e) {
   });
 }
 const ra = (e) => typeof e == "bigint" && Nr <= e;
-function qn(e) {
+function Dn(e) {
   let t;
-  for (t = 0; e > Nr; e >>= Un, t += 1)
+  for (t = 0; e > Nr; e >>= qn, t += 1)
     ;
   return t;
 }
 function sa(e, t) {
-  return e >> BigInt(t) & Un;
+  return e >> BigInt(t) & qn;
 }
-const mn = (e) => (Un << BigInt(e)) - Un;
+const mn = (e) => (qn << BigInt(e)) - qn;
 function Cr(e, t = {}, n = {}) {
   if (!e || typeof e != "object")
     throw new Error("expected valid options object");
@@ -276,7 +276,7 @@ function gi(e) {
     t /= ke, n++;
   let r = ke;
   const s = xn(e);
-  for (; Dn(s, r) === 1; )
+  for (; Mn(s, r) === 1; )
     if (r++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
   if (n === 1)
@@ -286,7 +286,7 @@ function gi(e) {
   return function(c, u) {
     if (c.is0(u))
       return u;
-    if (Dn(c, u) !== 1)
+    if (Mn(c, u) !== 1)
       throw new Error("Cannot find square root");
     let l = n, f = c.mul(c.ONE, i), d = c.pow(u, t), p = c.pow(u, o);
     for (; !c.eql(d, c.ONE); ) {
@@ -332,7 +332,7 @@ function yi(e) {
   }, n = la.reduce((r, s) => (r[s] = "function", r), t);
   return Cr(e, n), e;
 }
-function Yn(e, t, n) {
+function zn(e, t, n) {
   if (n < Ct)
     throw new Error("invalid exponent, negatives unsupported");
   if (n === Ct)
@@ -348,7 +348,7 @@ function Fe(e, t, n = !1) {
   const r = new Array(t.length).fill(n ? e.ZERO : void 0), s = t.reduce((o, a, c) => e.is0(a) ? o : (r[c] = o, e.mul(o, a)), e.ONE), i = e.inv(s);
   return t.reduceRight((o, a, c) => e.is0(a) ? o : (r[c] = e.mul(o, r[c]), e.mul(o, a)), i), r;
 }
-function Dn(e, t) {
+function Mn(e, t) {
   const n = (e.ORDER - Tt) / ke, r = e.pow(t, n), s = e.eql(r, e.ONE), i = e.eql(r, e.ZERO), o = e.eql(r, e.neg(e.ONE));
   if (!s && !i && !o)
     throw new Error("invalid Legendre symbol result");
@@ -417,7 +417,7 @@ class da {
     return Pt(t * n, this.ORDER);
   }
   pow(t, n) {
-    return Yn(this, t, n);
+    return zn(this, t, n);
   }
   div(t, n) {
     return Pt(t * Qr(n, this.ORDER), this.ORDER);
@@ -510,15 +510,15 @@ class wa {
   pos = 0;
   destroyed = !1;
   constructor(t, n, r, s) {
-    this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = s, this.buffer = new Uint8Array(t), this.view = ur(this.buffer);
+    this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = s, this.buffer = new Uint8Array(t), this.view = lr(this.buffer);
   }
   update(t) {
-    Pn(this), ft(t);
+    Fn(this), ft(t);
     const { view: n, buffer: r, blockLen: s } = this, i = t.length;
     for (let o = 0; o < i; ) {
       const a = Math.min(s - this.pos, i - o);
       if (a === s) {
-        const c = ur(t);
+        const c = lr(t);
         for (; s <= i - o; o += s)
           this.process(c, o);
         continue;
@@ -528,14 +528,14 @@ class wa {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    Pn(this), jo(t, this), this.finished = !0;
+    Fn(this), jo(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: s, isLE: i } = this;
     let { pos: o } = this;
     n[o++] = 128, un(this.buffer.subarray(o)), this.padOffset > s - o && (this.process(r, 0), o = 0);
     for (let f = o; f < s; f++)
       n[f] = 0;
     r.setBigUint64(s - 8, BigInt(this.length * 8), i), this.process(r, 0);
-    const a = ur(t), c = this.outputLen;
+    const a = lr(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
     const u = c / 4, l = this.get();
@@ -687,11 +687,11 @@ const _i = /* @__PURE__ */ ta(
   /* @__PURE__ */ ea(1)
 );
 const Qe = /* @__PURE__ */ BigInt(0), Ne = /* @__PURE__ */ BigInt(1);
-function Mn(e, t) {
+function Wn(e, t) {
   const n = t.negate();
   return e ? n : t;
 }
-function Wn(e, t) {
+function Gn(e, t) {
   const n = Fe(e.Fp, t.map((r) => r.Z));
   return t.map((r, s) => e.fromAffine(r.toAffine(n[s])));
 }
@@ -699,7 +699,7 @@ function Ei(e, t) {
   if (!Number.isSafeInteger(e) || e <= 0 || e > t)
     throw new Error("invalid window size, expected [1.." + t + "], got W=" + e);
 }
-function lr(e, t) {
+function fr(e, t) {
   Ei(e, t);
   const n = Math.ceil(t / e) + 1, r = 2 ** (e - 1), s = 2 ** e, i = mn(e), o = BigInt(e);
   return { windows: n, windowSize: r, mask: i, maxNumber: s, shiftBy: o };
@@ -711,8 +711,8 @@ function ts(e, t, n) {
   const u = t * r, l = u + Math.abs(a) - 1, f = a === 0, d = a < 0, p = t % 2 !== 0;
   return { nextN: c, offset: l, isZero: f, isNeg: d, isNegF: p, offsetF: u };
 }
-const fr = /* @__PURE__ */ new WeakMap(), Si = /* @__PURE__ */ new WeakMap();
-function dr(e) {
+const dr = /* @__PURE__ */ new WeakMap(), Si = /* @__PURE__ */ new WeakMap();
+function pr(e) {
   return Si.get(e) || 1;
 }
 function es(e) {
@@ -748,7 +748,7 @@ class ma {
    * @returns precomputed point tables flattened to a single array
    */
   precomputeWindow(t, n) {
-    const { windows: r, windowSize: s } = lr(n, this.bits), i = [];
+    const { windows: r, windowSize: s } = fr(n, this.bits), i = [];
     let o = t, a = o;
     for (let c = 0; c < r; c++) {
       a = o, i.push(a);
@@ -768,10 +768,10 @@ class ma {
     if (!this.Fn.isValid(r))
       throw new Error("invalid scalar");
     let s = this.ZERO, i = this.BASE;
-    const o = lr(t, this.bits);
+    const o = fr(t, this.bits);
     for (let a = 0; a < o.windows; a++) {
       const { nextN: c, offset: u, isZero: l, isNeg: f, isNegF: d, offsetF: p } = ts(r, a, o);
-      r = c, l ? i = i.add(Mn(d, n[p])) : s = s.add(Mn(f, n[u]));
+      r = c, l ? i = i.add(Wn(d, n[p])) : s = s.add(Wn(f, n[u]));
     }
     return es(r), { p: s, f: i };
   }
@@ -781,7 +781,7 @@ class ma {
    * @returns point
    */
   wNAFUnsafe(t, n, r, s = this.ZERO) {
-    const i = lr(t, this.bits);
+    const i = fr(t, this.bits);
     for (let o = 0; o < i.windows && r !== Qe; o++) {
       const { nextN: a, offset: c, isZero: u, isNeg: l } = ts(r, o, i);
       if (r = a, !u) {
@@ -792,25 +792,25 @@ class ma {
     return es(r), s;
   }
   getPrecomputes(t, n, r) {
-    let s = fr.get(n);
-    return s || (s = this.precomputeWindow(n, t), t !== 1 && (typeof r == "function" && (s = r(s)), fr.set(n, s))), s;
+    let s = dr.get(n);
+    return s || (s = this.precomputeWindow(n, t), t !== 1 && (typeof r == "function" && (s = r(s)), dr.set(n, s))), s;
   }
   cached(t, n, r) {
-    const s = dr(t);
+    const s = pr(t);
     return this.wNAF(s, this.getPrecomputes(s, t, r), n);
   }
   unsafe(t, n, r, s) {
-    const i = dr(t);
+    const i = pr(t);
     return i === 1 ? this._unsafeLadder(t, n, s) : this.wNAFUnsafe(i, this.getPrecomputes(i, t, r), n, s);
   }
   // We calculate precomputes for elliptic curve point multiplication
   // using windowed method. This specifies window size and
   // stores precomputed values. Usually only base point would be precomputed.
   createCache(t, n) {
-    Ei(n, this.bits), Si.set(t, n), fr.delete(t);
+    Ei(n, this.bits), Si.set(t, n), dr.delete(t);
   }
   hasCache(t) {
-    return dr(t) !== 1;
+    return pr(t) !== 1;
   }
 }
 function xa(e, t, n, r) {
@@ -859,10 +859,10 @@ function Sa(e, t) {
 function Bi(e) {
   if (!ri(e) && typeof e != "string")
     throw new Error("DST must be Uint8Array or ascii string");
-  return typeof e == "string" ? Zn(e) : e;
+  return typeof e == "string" ? Yn(e) : e;
 }
 function Ba(e, t, n, r) {
-  ft(e), je(n), t = Bi(t), t.length > 255 && (t = r(ht(Zn("H2C-OVERSIZE-DST-"), t)));
+  ft(e), je(n), t = Bi(t), t.length > 255 && (t = r(ht(Yn("H2C-OVERSIZE-DST-"), t)));
   const { outputLen: s, blockLen: i } = r, o = Math.ceil(n / s);
   if (n > 65535 || o > 255)
     throw new Error("expand_message_xmd: invalid lenInBytes");
@@ -877,13 +877,13 @@ function Ba(e, t, n, r) {
 function va(e, t, n, r, s) {
   if (ft(e), je(n), t = Bi(t), t.length > 255) {
     const i = Math.ceil(2 * r / 8);
-    t = s.create({ dkLen: i }).update(Zn("H2C-OVERSIZE-DST-")).update(t).digest();
+    t = s.create({ dkLen: i }).update(Yn("H2C-OVERSIZE-DST-")).update(t).digest();
   }
   if (n > 65535 || t.length > 255)
     throw new Error("expand_message_xof: invalid lenInBytes");
   return s.create({ dkLen: n }).update(e).update(we(n, 2)).update(t).update(we(t.length, 1)).digest();
 }
-function pr(e, t, n) {
+function hr(e, t, n) {
   Cr(n, {
     p: "bigint",
     m: "number",
@@ -920,7 +920,7 @@ function vi(e, t) {
     return r = e.mul(i, u), s = e.mul(s, e.mul(a, l)), { x: r, y: s };
   };
 }
-const Oa = Zn("HashToScalar-");
+const Oa = Yn("HashToScalar-");
 function rs(e, t, n) {
   if (typeof t != "function")
     throw new Error("mapToCurve() must be defined");
@@ -935,11 +935,11 @@ function rs(e, t, n) {
     defaults: Object.freeze(n),
     Point: e,
     hashToCurve(i, o) {
-      const a = Object.assign({}, n, o), c = pr(i, 2, a), u = r(c[0]), l = r(c[1]);
+      const a = Object.assign({}, n, o), c = hr(i, 2, a), u = r(c[0]), l = r(c[1]);
       return s(u.add(l));
     },
     encodeToCurve(i, o) {
-      const a = n.encodeDST ? { DST: n.encodeDST } : {}, c = Object.assign({}, n, a, o), u = pr(i, 1, c), l = r(u[0]);
+      const a = n.encodeDST ? { DST: n.encodeDST } : {}, c = Object.assign({}, n, a, o), u = hr(i, 1, c), l = r(u[0]);
       return s(l);
     },
     /** See {@link H2CHasher} */
@@ -960,7 +960,7 @@ function rs(e, t, n) {
     // RFC 9380, draft-irtf-cfrg-bbs-signatures-08
     hashToScalar(i, o) {
       const a = e.Fn.ORDER, c = Object.assign({}, n, { p: a, m: 1, DST: Oa }, o);
-      return pr(i, 1, c)[0][0];
+      return hr(i, 1, c)[0][0];
     }
   };
 }
@@ -985,10 +985,10 @@ class Oi {
     this.oHash.update(s), un(s);
   }
   update(t) {
-    return Pn(this), this.iHash.update(t), this;
+    return Fn(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    Pn(this), ft(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    Fn(this), ft(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
   }
   digest() {
     const t = new Uint8Array(this.oHash.outputLen);
@@ -1014,7 +1014,7 @@ function Ta(e, t, n) {
   let u = e - a * r - c * i, l = -a * s - c * o;
   const f = u < Ce, d = l < Ce;
   f && (u = -u), d && (l = -l);
-  const p = mn(Math.ceil(qn(n) / 2)) + It;
+  const p = mn(Math.ceil(Dn(n) / 2)) + It;
   if (u < Ce || u >= p || l < Ce || l >= p)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: f, k1: u, k2neg: d, k2: l };
@@ -1131,7 +1131,7 @@ function Ti(e, t = {}) {
     return !0;
   });
   function I(U, y, _, B, R) {
-    return _ = new x(r.mul(_.X, U), _.Y, _.Z), y = Mn(B, y), _ = Mn(R, _), y.add(_);
+    return _ = new x(r.mul(_.X, U), _.Y, _.Z), y = Wn(B, y), _ = Wn(R, _), y.add(_);
   }
   class x {
     // base / generator point
@@ -1167,7 +1167,7 @@ function Ti(e, t = {}) {
       return _.assertValidity(), _;
     }
     static fromHex(y) {
-      return x.fromBytes(Fn(y));
+      return x.fromBytes(Un(y));
     }
     get x() {
       return this.toAffine().x;
@@ -1248,7 +1248,7 @@ function Ti(e, t = {}) {
       if (!s.isValidNot0(y))
         throw new Error("invalid scalar: out of range");
       let B, R;
-      const P = ($) => H.cached(this, $, (q) => Wn(x, q));
+      const P = ($) => H.cached(this, $, (q) => Gn(x, q));
       if (_) {
         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);
@@ -1256,7 +1256,7 @@ function Ti(e, t = {}) {
         const { p: $, f: q } = P(y);
         B = $, R = q;
       }
-      return Wn(x, [B, R])[0];
+      return Gn(x, [B, R])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -1391,7 +1391,7 @@ function Ca(e) {
     (e & Tn) === Na ? t.unshift(0) : (e & Ve) === Ve ? (t.unshift(-1), e += Tn) : t.unshift(1);
   return t;
 }
-function hr(e) {
+function wr(e) {
   if (!Array.isArray(e) || e.length === 0)
     throw new Error("expected non-empty array");
 }
@@ -1444,7 +1444,7 @@ function $a(e, t, n, r) {
   }
   function b(A, C = !0) {
     const I = [];
-    Wn(t, A.map(({ g1: x }) => x)), Wn(n, A.map(({ g2: x }) => x));
+    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())
         throw new Error("pairing is not available for ZERO point");
@@ -1534,7 +1534,7 @@ function os(e, t, n, r, s, i) {
     // e(G, S) = e(G, SUM(n)(Si)) = MUL(n)(e(G, Si))
     // TODO: maybe `{message: G2Hex, publicKey: G1Hex}[]` instead?
     verifyBatch(h, g) {
-      hr(g);
+      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];
@@ -1555,14 +1555,14 @@ function os(e, t, n, r, s, i) {
     // Adds a bunch of public key points together.
     // pk1 + pk2 + pk3 = pkA
     aggregatePublicKeys(h) {
-      hr(h), h = h.map((b) => f(b));
+      wr(h), h = h.map((b) => f(b));
       const g = h.reduce((b, v) => b.add(v), t.ZERO);
       return g.assertValidity(), g;
     },
     // Adds a bunch of signature points together.
     // pk1 + pk2 + pk3 = pkA
     aggregateSignatures(h) {
-      hr(h), h = h.map((b) => d(b));
+      wr(h), h = h.map((b) => d(b));
       const g = h.reduce((b, v) => b.add(v), n.ZERO);
       return g.assertValidity(), g;
     },
@@ -1664,7 +1664,7 @@ class Ua {
   FROBENIUS_COEFFICIENTS;
   constructor(t, n = {}) {
     const r = t.ORDER, s = r * r;
-    this.Fp = t, this.ORDER = s, this.BITS = qn(s), this.BYTES = Math.ceil(qn(s) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, Bt), this.NONRESIDUE = us(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Ar(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
+    this.Fp = t, this.ORDER = s, this.BITS = Dn(s), this.BYTES = Math.ceil(Dn(s) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, Bt), this.NONRESIDUE = us(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Ar(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
   }
   fromBigTuple(t) {
     return us(this.Fp, t);
@@ -1691,7 +1691,7 @@ class Ua {
     return { c0: this.Fp.neg(t), c1: this.Fp.neg(n) };
   }
   pow(t, n) {
-    return Yn(this, t, n);
+    return zn(this, t, n);
   }
   invertBatch(t) {
     return Fe(this, t);
@@ -1748,10 +1748,10 @@ class Ua {
   sqrt(t) {
     const { Fp: n } = this, r = this, { c0: s, c1: i } = t;
     if (n.is0(i))
-      return Dn(n, s) === 1 ? r.create({ c0: n.sqrt(s), c1: n.ZERO }) : r.create({ c0: n.ZERO, c1: n.sqrt(n.div(s, this.Fp_NONRESIDUE)) });
+      return Mn(n, s) === 1 ? r.create({ c0: n.sqrt(s), c1: n.ZERO }) : r.create({ c0: n.ZERO, c1: n.sqrt(n.div(s, this.Fp_NONRESIDUE)) });
     const o = n.sqrt(n.sub(n.sqr(s), n.mul(n.sqr(i), this.Fp_NONRESIDUE)));
     let a = n.mul(n.add(o, s), this.Fp_div2);
-    Dn(n, a) === -1 && (a = n.sub(a, o));
+    Mn(n, a) === -1 && (a = n.sub(a, o));
     const u = n.sqrt(a), l = r.create({ c0: u, c1: n.div(n.mul(i, this.Fp_div2), u) });
     if (!r.eql(r.sqr(l), t))
       throw new Error("Cannot find square root");
@@ -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 Yn(this, t, n);
+    return zn(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 Yn(this, t, n);
+    return zn(this, t, n);
   }
   invertBatch(t) {
     return Fe(this, t);
@@ -2213,7 +2213,7 @@ function Ma(e) {
   const t = xn(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), Gn = BigInt(1), qt = BigInt(2), zn = BigInt(3), fn = BigInt(4), xe = BigInt("0xd201000000010000"), Wa = qn(xe), en = {
+const xt = BigInt(0), Hn = BigInt(1), qt = BigInt(2), Kn = BigInt(3), fn = BigInt(4), xe = BigInt("0xd201000000010000"), Wa = Dn(xe), en = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
@@ -2228,7 +2228,7 @@ const xt = BigInt(0), Gn = BigInt(1), qt = BigInt(2), zn = BigInt(3), fn = BigIn
   X_LEN: Wa,
   // Finite extension field over irreducible polynominal.
   // Fp(u) / (u² - β) where β = -1
-  FP2_NONRESIDUE: [Gn, Gn],
+  FP2_NONRESIDUE: [Hn, Hn],
   Fp2mulByB: ({ c0: e, c1: t }) => {
     const n = N.mul(e, fn), r = N.mul(t, fn);
     return { c0: N.sub(n, r), c1: N.add(n, r) };
@@ -2237,7 +2237,7 @@ const xt = BigInt(0), Gn = BigInt(1), qt = BigInt(2), zn = BigInt(3), fn = BigIn
     const t = xe, n = Y.div(Y.frobeniusMap(e, 6), e), r = Y.mul(Y.frobeniusMap(n, 2), n), s = Y.conjugate(Y._cyclotomicExp(r, t)), i = Y.mul(Y.conjugate(Y._cyclotomicSquare(r)), s), o = Y.conjugate(Y._cyclotomicExp(i, t)), a = Y.conjugate(Y._cyclotomicExp(o, t)), c = Y.mul(Y.conjugate(Y._cyclotomicExp(a, t)), Y._cyclotomicSquare(s)), u = Y.conjugate(Y._cyclotomicExp(c, t)), l = Y.frobeniusMap(Y.mul(s, a), 2), f = Y.frobeniusMap(Y.mul(o, r), 3), d = Y.frobeniusMap(Y.mul(c, Y.conjugate(r)), 1), p = Y.mul(Y.mul(u, Y.conjugate(i)), r);
     return Y.mul(Y.mul(Y.mul(l, f), d), p);
   }
-}), { G2psi: ls, G2psi2: Ha } = Fa(N, V, V.div(V.ONE, V.NONRESIDUE)), wr = Object.freeze({
+}), { G2psi: ls, G2psi2: Ha } = Fa(N, V, V.div(V.ONE, V.NONRESIDUE)), gr = Object.freeze({
   DST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
   encodeDST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
   p: N.ORDER,
@@ -2259,8 +2259,8 @@ const xt = BigInt(0), Gn = BigInt(1), qt = BigInt(2), zn = BigInt(3), fn = BigIn
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, Kn = _n(N.toBytes(xt), { infinity: !0, compressed: !0 });
-function Xn(e) {
+}, Xn = _n(N.toBytes(xt), { 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 };
@@ -2274,22 +2274,22 @@ function Va(e, t, n) {
   const { BYTES: r, ORDER: s } = N, i = t.is0(), { x: o, y: a } = t.toAffine();
   if (n) {
     if (i)
-      return Kn.slice();
+      return Xn.slice();
     const c = !!(a * qt / s);
     return _n(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));
 }
-function gr(e) {
+function yr(e) {
   e.assertValidity();
   const { BYTES: t, ORDER: n } = N, { x: r, y: s } = e.toAffine();
   if (e.is0())
-    return Kn.slice();
+    return Xn.slice();
   const i = !!(s * qt / n);
   return _n(mt(r, t), { compressed: !0, sort: i });
 }
 function Za(e) {
-  const { compressed: t, infinity: n, sort: r, value: s } = Xn(e), { BYTES: i, ORDER: o } = N;
+  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));
     if (n) {
@@ -2297,7 +2297,7 @@ function Za(e) {
         throw new Error("invalid G1 point: non-empty, at infinity, with compression");
       return { x: xt, y: xt };
     }
-    const u = N.add(N.pow(c, zn), N.create(en.b));
+    const u = N.add(N.pow(c, Kn), N.create(en.b));
     let l = N.sqrt(u);
     if (!l)
       throw new Error("invalid G1 point: compressed point");
@@ -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 } = Xn(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 = zt(r);
   if (t)
     return i.ZERO;
-  const a = N.create(o & mn(N.BITS)), c = N.add(N.pow(a, zn), N.create(en.b));
+  const a = N.create(o & mn(N.BITS)), c = N.add(N.pow(a, Kn), N.create(en.b));
   let u = N.sqrt(c);
   if (!u)
     throw new Error("invalid G1 point: compressed");
@@ -2330,7 +2330,7 @@ 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(Kn, mt(xt, r));
+      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));
   } else {
@@ -2340,16 +2340,16 @@ function Ya(e, t, n) {
     return ht(mt(u, r), mt(c, r), mt(f, r), mt(l, r));
   }
 }
-function yr(e) {
+function br(e) {
   e.assertValidity();
   const { BYTES: t } = N;
   if (e.is0())
-    return ht(Kn, 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 & Gn), l = s;
+    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));
 }
 function za(e) {
-  const { BYTES: t, ORDER: n } = N, { compressed: r, infinity: s, sort: i, value: o } = Xn(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)
@@ -2361,9 +2361,9 @@ function za(e) {
         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, zn), 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, Kn), Fr.b);
     let d = V.sqrt(f);
-    const p = d.c1 === xt ? d.c0 * qt / n : d.c1 * qt / n ? Gn : xt;
+    const p = d.c1 === xt ? d.c0 * qt / n : d.c1 * qt / n ? Hn : xt;
     return d = i && p > 0 ? d : V.neg(d), { x: l, y: d };
   } else if (o.length === 192 && !r) {
     if (s) {
@@ -2377,13 +2377,13 @@ function za(e) {
     throw new Error("invalid G2 point: expected 96/192 bytes");
 }
 function ds(e) {
-  const { ORDER: t } = N, { infinity: n, sort: r, value: s } = Xn(ft(e)), i = T.G2.Point, o = s.length / 2;
+  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));
   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, zn), 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, Kn), Fr.b);
   let p = V.sqrt(d);
   if (!p)
     throw new Error("Failed to find a square root");
@@ -2398,16 +2398,16 @@ const Ka = {
       return fs(ft(e));
     },
     fromHex(e) {
-      return fs(Fn(e));
+      return fs(Un(e));
     },
     toBytes(e) {
-      return gr(e);
+      return yr(e);
     },
     toRawBytes(e) {
-      return gr(e);
+      return yr(e);
     },
     toHex(e) {
-      return ln(gr(e));
+      return ln(yr(e));
     }
   },
   LongSignature: {
@@ -2415,16 +2415,16 @@ const Ka = {
       return ds(ft(e));
     },
     fromHex(e) {
-      return ds(Fn(e));
+      return ds(Un(e));
     },
     toBytes(e) {
-      return yr(e);
+      return br(e);
     },
     toRawBytes(e) {
-      return yr(e);
+      return br(e);
     },
     toHex(e) {
-      return ln(yr(e));
+      return ln(br(e));
     }
   }
 }, Xa = {
@@ -2469,9 +2469,9 @@ const Ka = {
 }), Qa = {
   mapToG1: ic,
   mapToG2: oc,
-  hasherOpts: wr,
-  hasherOptsG1: { ...wr, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
-  hasherOptsG2: { ...wr }
+  hasherOpts: gr,
+  hasherOptsG1: { ...gr, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
+  hasherOptsG2: { ...gr }
 }, tc = {
   ateLoopSize: xe,
   // The BLS parameter x for BLS12-381
@@ -2639,7 +2639,7 @@ function oc(e) {
 function ac(e, t, n) {
   return kr(e), n === void 0 && (n = new Uint8Array(e.outputLen)), Lr(e, n, t);
 }
-const br = /* @__PURE__ */ Uint8Array.of(0), ps = /* @__PURE__ */ Uint8Array.of();
+const mr = /* @__PURE__ */ Uint8Array.of(0), ps = /* @__PURE__ */ Uint8Array.of();
 function cc(e, t, n, r = 32) {
   kr(e), Je(r, "length");
   const s = e.outputLen;
@@ -2649,8 +2649,8 @@ function cc(e, t, n, r = 32) {
   n === void 0 ? n = ps : ft(n, void 0, "info");
   const o = new Uint8Array(i * s), a = Lr.create(e, t), c = a._cloneInto(), u = new Uint8Array(a.outputLen);
   for (let l = 0; l < i; l++)
-    br[0] = l + 1, c.update(l === 0 ? ps : u).update(n).update(br).digestInto(u), o.set(u, s * l), a._cloneInto(c);
-  return a.destroy(), c.destroy(), un(u, br), o.slice(0, r);
+    mr[0] = l + 1, c.update(l === 0 ? ps : u).update(n).update(mr).digestInto(u), o.set(u, s * l), a._cloneInto(c);
+  return a.destroy(), c.destroy(), un(u, mr), o.slice(0, r);
 }
 const uc = (e, t, n, r, s) => cc(e, ac(e, t, n), r, s), lc = "6.16.0";
 function fc(e, t, n) {
@@ -2834,7 +2834,7 @@ function Ci(e, t, n) {
   const s = new Uint8Array(t);
   return s.fill(0), n ? s.set(r, t - r.length) : s.set(r, 0), bt(s);
 }
-function Ln(e, t) {
+function An(e, t) {
   return Ci(e, t, !0);
 }
 function $i(e, t) {
@@ -2842,7 +2842,7 @@ function $i(e, t) {
 }
 const En = BigInt(0), Mt = BigInt(1), ze = 9007199254740991;
 function pc(e, t) {
-  const n = Jn(e, "value"), r = BigInt(Ee(t, "width"));
+  const n = jn(e, "value"), r = BigInt(Ee(t, "width"));
   if (at(n >> r === En, "overflow", "NUMERIC_FAULT", {
     operation: "fromTwos",
     fault: "overflow",
@@ -2873,7 +2873,7 @@ function Li(e, t) {
   return n;
 }
 function In(e, t) {
-  const n = Jn(e, "value"), r = BigInt(Ee(t, "bits"));
+  const n = jn(e, "value"), r = BigInt(Ee(t, "bits"));
   return n & (Mt << r) - Mt;
 }
 function nn(e, t) {
@@ -2893,7 +2893,7 @@ function nn(e, t) {
   }
   m(!1, "invalid BigNumberish value", t || "value", e);
 }
-function Jn(e, t) {
+function jn(e, t) {
   const n = nn(e, t);
   return at(n >= En, "unsigned value cannot be negative", "NUMERIC_FAULT", {
     fault: "overflow",
@@ -2932,7 +2932,7 @@ function hc(e) {
   return Ee(Ai(e));
 }
 function Pi(e, t) {
-  const n = Jn(e, "value");
+  const n = jn(e, "value");
   let r = n.toString(16);
   if (t == null)
     r.length % 2 && (r = "0" + r);
@@ -2950,7 +2950,7 @@ function Pi(e, t) {
   return "0x" + r;
 }
 function Fi(e, t) {
-  const n = Jn(e, "value");
+  const n = jn(e, "value");
   if (n === En)
     return new Uint8Array(0);
   let r = n.toString(16);
@@ -4600,18 +4600,18 @@ const uu = new RegExp("^bytes([0-9]+)$"), lu = new RegExp("^(u?int)([0-9]*)$"),
 function Ji(e, t, n) {
   switch (e) {
     case "address":
-      return yt(n ? Ln(t, 32) : dn(t));
+      return yt(n ? An(t, 32) : dn(t));
     case "string":
       return qr(t);
     case "bytes":
       return yt(t);
     case "bool":
-      return t = t ? "0x01" : "0x00", yt(n ? Ln(t, 32) : t);
+      return t = t ? "0x01" : "0x00", yt(n ? An(t, 32) : t);
   }
   let r = e.match(lu);
   if (r) {
     let s = r[1] === "int", i = parseInt(r[2] || "256");
-    return m((!r[2] || r[2] === String(i)) && i % 8 === 0 && i !== 0 && i <= 256, "invalid number type", "type", e), n && (i = 256), s && (t = Li(t, i)), yt(Ln(Fi(t), i / 8));
+    return m((!r[2] || r[2] === String(i)) && i % 8 === 0 && i !== 0 && i <= 256, "invalid number type", "type", e), n && (i = 256), s && (t = Li(t, i)), yt(An(Fi(t), i / 8));
   }
   if (r = e.match(uu), r) {
     const s = parseInt(r[1]);
@@ -4798,7 +4798,7 @@ function Is(e, t) {
   if (n.length > 1)
     throw new Error(`conflicting types: ${n.join(", ")}`);
 }
-function jn(e, t) {
+function Qn(e, t) {
   if (t.peekKeyword(to)) {
     const n = t.pop().text;
     if (n !== e)
@@ -5211,7 +5211,7 @@ class Ae {
     return $e.isFragment(t);
   }
 }
-class Qn extends Ae {
+class tr extends Ae {
   /**
    *  The name of the fragment.
    */
@@ -5226,7 +5226,7 @@ class Qn extends Ae {
 function hn(e, t) {
   return "(" + t.map((n) => n.format(e)).join(e === "full" ? ", " : ",") + ")";
 }
-class Rt extends Qn {
+class Rt extends tr {
   /**
    *  @private
    */
@@ -5261,7 +5261,7 @@ class Rt extends Qn {
     if (typeof t == "string")
       return Rt.from(Se(t));
     if (t instanceof Dt) {
-      const n = jn("error", t), r = ue(t);
+      const n = Qn("error", t), r = ue(t);
       return Le(t), new Rt(ot, n, r);
     }
     return new Rt(ot, t.name, t.inputs ? t.inputs.map(nt.from) : []);
@@ -5274,7 +5274,7 @@ class Rt extends Qn {
     return t && t[kt] === Ns;
   }
 }
-class Vt extends Qn {
+class Vt extends tr {
   /**
    *  Whether this event is anonymous.
    */
@@ -5324,7 +5324,7 @@ class Vt extends Qn {
         m(!1, "invalid event fragment", "obj", t);
       }
     else if (t instanceof Dt) {
-      const n = jn("event", t), r = ue(t, !0), s = !!le(t, Ot(["anonymous"])).has("anonymous");
+      const n = Qn("event", t), r = ue(t, !0), s = !!le(t, Ot(["anonymous"])).has("anonymous");
       return Le(t), new Vt(ot, n, r, s);
     }
     return new Vt(ot, t.name, t.inputs ? t.inputs.map((n) => nt.from(n, !0)) : [], !!t.anonymous);
@@ -5456,7 +5456,7 @@ class ie extends Ae {
     return t && t[kt] === Ls;
   }
 }
-class Zt extends Qn {
+class Zt extends tr {
   /**
    *  If the function is constant (e.g. ``pure`` or ``view`` functions).
    */
@@ -5527,7 +5527,7 @@ class Zt extends Qn {
         m(!1, "invalid function fragment", "obj", t);
       }
     else if (t instanceof Dt) {
-      const r = jn("function", t), s = ue(t), i = so(t);
+      const r = Qn("function", t), s = ue(t), i = so(t);
       let o = [];
       le(t, Ot(["returns"])).has("returns") && (o = ue(t));
       const a = io(t);
@@ -5544,7 +5544,7 @@ class Zt extends Qn {
     return t && t[kt] === As;
   }
 }
-class $e extends Qn {
+class $e extends tr {
   /**
    *  @private
    */
@@ -5568,7 +5568,7 @@ class $e extends Qn {
         m(!1, "invalid struct fragment", "obj", t);
       }
     else if (t instanceof Dt) {
-      const n = jn("struct", t), r = ue(t);
+      const n = Qn("struct", t), r = ue(t);
       return Le(t), new $e(ot, n, r);
     }
     return new $e(ot, t.name, t.inputs ? t.inputs.map(nt.from) : []);
@@ -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 mr = null, Fs = 1024;
+let xr = 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 mr == null && (mr = new fe()), mr;
+    return xr == null && (xr = new fe()), xr;
   }
   /**
    *  Returns an ethers-compatible [[CallExceptionError]] Error for the given
@@ -6420,7 +6420,7 @@ class ge {
     at(n.length <= t.inputs.length, `too many arguments for ${t.format()}`, "UNEXPECTED_ARGUMENT", { count: n.length, expectedCount: t.inputs.length });
     const r = [];
     t.anonymous || r.push(t.topicHash);
-    const s = (i, o) => i.type === "string" ? pn(o) : i.type === "bytes" ? tt(bt(o)) : (i.type === "bool" && typeof o == "boolean" ? o = o ? "0x01" : "0x00" : i.type.match(/^u?int/) ? o = Pi(o) : i.type.match(/^bytes/) ? o = $i(o, 32) : i.type === "address" && this.#r.encode(["address"], [o]), Ln(bt(o), 32));
+    const s = (i, o) => i.type === "string" ? pn(o) : i.type === "bytes" ? tt(bt(o)) : (i.type === "bool" && typeof o == "boolean" ? o = o ? "0x01" : "0x00" : i.type.match(/^u?int/) ? o = Pi(o) : i.type.match(/^bytes/) ? o = $i(o, 32) : i.type === "address" && this.#r.encode(["address"], [o]), An(bt(o), 32));
     for (n.forEach((i, o) => {
       const a = t.inputs[o];
       if (!a.indexed) {
@@ -6623,7 +6623,7 @@ function uo(e, t, n, r, s, i) {
   return Number(o) / 100;
 }
 let wt = "", Gr = "";
-function tr(e, t) {
+function er(e, t) {
   wt = e.toLowerCase(), Gr = t.toLowerCase();
 }
 function Pu(e) {
@@ -6637,7 +6637,7 @@ function Pu(e) {
   }
   return t(e, 1n);
 }
-function er(e, t) {
+function nr(e, t) {
   e.toLowerCase() > t.toLowerCase() && ([e, t] = [t, e]);
   const n = Ts(
     ["uint8", "address", "bytes32", "bytes32"],
@@ -6657,7 +6657,7 @@ async function Ws(e, t, n) {
 }
 async function Fu(e, t, n) {
   t.toLowerCase() > n.toLowerCase() && ([t, n] = [n, t]);
-  const r = await e.reservesOf(er(t, n));
+  const r = await e.reservesOf(nr(t, n));
   if (r === null)
     throw new Error("Token pair does not exist");
   return r;
@@ -6685,7 +6685,7 @@ class Uu {
       const s = await Ws(this.proxy, t, n);
       return this.map[r] = s, s;
     } else {
-      const s = `0x${n.slice(2, 42)}`, i = `0x${n.slice(44, 84)}`, o = er(s, i), a = await Ws(this.proxy, t, o);
+      const s = `0x${n.slice(2, 42)}`, i = `0x${n.slice(44, 84)}`, o = nr(s, i), a = await Ws(this.proxy, t, o);
       return this.map[r] = a, a;
     }
   }
@@ -7363,7 +7363,7 @@ function J(e) {
     return `https://sa-proxy.bestinslot.xyz/${e}`;
   throw new Error("Unsupported network for orderbook backend URL");
 }
-function nr() {
+function rr() {
   const e = tn();
   if (e === "signet")
     return "0xf41B09041DC546F0466D6F74cda81971012B589D";
@@ -7484,10 +7484,10 @@ async function Jt() {
   };
   return o.fee_policy !== null && Zs.set(e, { info: o, fetchedAt: Date.now() }), o;
 }
-async function rr(e, t) {
+async function sr(e, t) {
   const n = await Jt();
-  tr(n.wbtc_address, n.factory_address);
-  const r = er(e, t);
+  er(n.wbtc_address, n.factory_address);
+  const r = nr(e, t);
   let s;
   try {
     s = await Ue(r);
@@ -7646,7 +7646,7 @@ async function _l() {
     method: "GET"
   })).tokens;
 }
-function xr(e) {
+function Cn(e) {
   return e === null ? null : BigInt(e);
 }
 async function El(e = {}) {
@@ -7666,10 +7666,11 @@ async function El(e = {}) {
     total: o.total,
     data: o.data.map((a) => ({
       ...a,
-      volume_24h: xr(a.volume_24h),
-      volume_7d: xr(a.volume_7d),
-      tvl: xr(a.tvl),
-      exposure_sats: BigInt(a.exposure_sats)
+      volume_24h: Cn(a.volume_24h),
+      volume_7d: Cn(a.volume_7d),
+      tvl: Cn(a.tvl),
+      exposure_sats: BigInt(a.exposure_sats),
+      market_cap: Cn(a.market_cap ?? null)
     }))
   };
 }
@@ -7762,7 +7763,7 @@ Token Address: ${e.token_address}
 By signing this message, you authorize the creation of a deposit order with the above parameters.`;
   return await Pe(t, "ordinals");
 }
-async function sr(e) {
+async function ir(e) {
   e.pubkey = e.pubkey.startsWith("0x") ? e.pubkey.slice(2) : e.pubkey;
   let t = e.pk_idx.toString(16).padStart(16, "0");
   t += e.pubkey;
@@ -7828,7 +7829,7 @@ function vo(e) {
 async function Rl(e, t, n, r = !0, s, i = {}) {
   const o = yn();
   if (!o || !o.wallets) throw new Error("Wallets not found");
-  const a = Ke(), c = Vn(), u = Wt();
+  const a = Ke(), 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");
@@ -7855,7 +7856,7 @@ 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 = nr(), 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), x = K.str(
     `{"p":"brc20-prog","op":"c","c":"${e}","b":"${I}"}`
   ), D = new ce(
     K.str("text/plain"),
@@ -7881,7 +7882,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     token_address: e.toLowerCase(),
     bip322_signature: U,
     bls12_signature: _
-  }), R = B.edcsa_signature, P = B.pubkey_idx, $ = B.token_idx, q = await sr({
+  }), R = B.edcsa_signature, P = B.pubkey_idx, $ = B.token_idx, q = await ir({
     pubkey: H,
     pk_idx: BigInt(P)
   }), W = wo().encodeFunctionData("deposit", [
@@ -7962,7 +7963,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
         null,
         null
       );
-      Me = await $n(
+      Me = await Ln(
         G,
         [],
         On,
@@ -8018,7 +8019,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
         null,
         null
       );
-      ee = await $n(
+      ee = await Ln(
         lt,
         [],
         Me,
@@ -8040,7 +8041,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       throw new Error("Failed to send inscription to OP_RETURN");
     ve = ee.signedTxHex, rn = ee.txId;
   }
-  const or = [], De = [];
+  const ar = [], De = [];
   if (w > 0n) {
     if (!Q || !rt || !jt)
       throw new Error("Base deposit transaction hexes are missing");
@@ -8048,37 +8049,37 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       Q,
       rt,
       jt
-    ), or.push({
+    ), ar.push({
       utxo: `${Be}:1`,
       value: be,
-      script_type: An(p.outputScript, a),
+      script_type: Pn(p.outputScript, a),
       wallet: p
     });
   }
   if (O) {
     if (!St || !Nt || !ve)
       throw new Error("Allowance transaction hexes are missing");
-    De.push(St, Nt, ve), or.push({
+    De.push(St, Nt, ve), ar.push({
       utxo: `${rn}:1`,
       value: be,
-      script_type: An(p.outputScript, a),
+      script_type: Pn(p.outputScript, a),
       wallet: p
     });
   }
-  let vn = null, Te = null, sn = "", Yr = "", ar = "", cr = "";
+  let vn = null, Te = null, sn = "", Yr = "", cr = "", ur = "";
   try {
     De.length > 0 && Ft(De, null), Te = await Js(
       j,
-      or,
+      ar,
       n,
       null,
       null,
       0,
       !0,
       M
-    ), ar = Te.signedCommitTxHex, cr = Te.signedRevealTxHex, sn = Te.inscriptionId;
+    ), cr = Te.signedCommitTxHex, ur = Te.signedRevealTxHex, sn = Te.inscriptionId;
     const At = `${sn.split("i")[0]}:0:0`;
-    Yr = Te.secret, De.push(ar, cr), Ft(De, [sn, At]);
+    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)),
@@ -8086,7 +8087,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
       null,
       null
     );
-    vn = await $n(
+    vn = await Ln(
       sn,
       [],
       te,
@@ -8103,9 +8104,9 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
     throw new Error("Failed to send inscription to OP_RETURN");
   const Fo = vn.signedTxHex, Uo = vn.txId, qo = {
     commit_txid: Te.commitTxId,
-    commit_txhex: ar,
+    commit_txhex: cr,
     reveal_txid: Te.revealTxId,
-    reveal_txhex: cr,
+    reveal_txhex: ur,
     send_to_opreturn_txid: Uo,
     send_to_opreturn_txhex: Fo,
     secret: Yr,
@@ -8139,7 +8140,7 @@ async function Rl(e, t, n, r = !0, s, i = {}) {
 async function kl(e, t, n, r = !0, s) {
   const i = yn();
   if (!i || !i.wallets) throw new Error("Wallets not found");
-  const o = Ke(), a = Vn();
+  const o = Ke(), 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);
@@ -8161,7 +8162,7 @@ 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 = nr(), 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 = K.str(
     `{"p":"brc20-prog","op":"c","c":"${e}","b":"${O}"}`
   ), M = new ce(
     K.str("text/plain"),
@@ -8173,7 +8174,7 @@ 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 sr({
+  const C = `0x${"00".repeat(64)}`, I = 1, x = 1, D = await ir({
     pubkey: A,
     pk_idx: BigInt(I)
   }), U = wo().encodeFunctionData("deposit", [
@@ -8248,7 +8249,7 @@ async function kl(e, t, n, r = !0, s) {
         null,
         null
       );
-      St = await Cn(
+      St = await $n(
         P,
         [],
         Nt,
@@ -8304,7 +8305,7 @@ async function kl(e, t, n, r = !0, s) {
         null,
         null
       );
-      dt = await Cn(
+      dt = await $n(
         ct,
         [],
         Et,
@@ -8336,7 +8337,7 @@ async function kl(e, t, n, r = !0, s) {
     ), Q.push({
       utxo: `${W}:1`,
       value: be,
-      script_type: An(l.outputScript, o),
+      script_type: Pn(l.outputScript, o),
       wallet: l
     });
   }
@@ -8346,7 +8347,7 @@ async function kl(e, t, n, r = !0, s) {
     rt.push(j, G, ut), Q.push({
       utxo: `${gt}:1`,
       value: be,
-      script_type: An(l.outputScript, o),
+      script_type: Pn(l.outputScript, o),
       wallet: l
     });
   }
@@ -8370,7 +8371,7 @@ async function kl(e, t, n, r = !0, s) {
       null,
       null
     );
-    Be = await Cn(
+    Be = await $n(
       Et,
       [],
       Nt,
@@ -8415,12 +8416,12 @@ async function Cl(e) {
 async function $l(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 = Vn(), c = Wt();
+  const i = new Hr(n), o = i.wrap(Ir(s.provider)), a = Zn(), c = Wt();
   if (!a) throw new Error("Payment wallet not found");
   if (!a.address) throw new Error("Payment wallet address not found");
   if (!c) throw new Error("Ordinals wallet not found");
   if (!c.address) throw new Error("Ordinals wallet address not found");
-  const u = c.address, l = nr(), f = (await et())?.swapPubkey;
+  const u = c.address, l = rr(), f = (await et())?.swapPubkey;
   if (!f)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   i.next();
@@ -8437,7 +8438,7 @@ async function $l(e, t, n = {}) {
     token_address: r.wbtc_address.toLowerCase(),
     bip322_signature: d,
     bls12_signature: w
-  }), g = h.edcsa_signature, b = h.pubkey_idx, v = h.token_idx, O = await sr({
+  }), g = h.edcsa_signature, b = h.pubkey_idx, v = h.token_idx, O = await ir({
     pubkey: f,
     pk_idx: BigInt(b)
   }), F = fe.defaultAbiCoder().encode(
@@ -8496,7 +8497,7 @@ async function $l(e, t, n = {}) {
           value: Number.parseInt(e.toString())
         }
       ];
-      W = await $n(
+      W = await Ln(
         $,
         [],
         _t,
@@ -8536,13 +8537,13 @@ async function $l(e, t, n = {}) {
 async function Ll(e, t) {
   const n = await Jt(), r = yn();
   if (!r || !r.wallets) throw new Error("Wallets not found");
-  const s = Vn();
+  const s = Zn();
   if (!s) throw new Error("Payment wallet not found");
   if (!s.address) throw new Error("Payment wallet address not found");
-  const i = nr(), o = (await et())?.swapPubkey;
+  const i = rr(), o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  const a = `0x${"00".repeat(64)}`, c = 1, u = 1, l = await sr({
+  const a = `0x${"00".repeat(64)}`, c = 1, u = 1, l = await ir({
     pubkey: o,
     pk_idx: BigInt(c)
   }), f = fe.defaultAbiCoder().encode(
@@ -8598,7 +8599,7 @@ async function Ll(e, t) {
         value: Number.parseInt(e.toString())
       }
     ];
-    I = await Cn(
+    I = await $n(
       A,
       [],
       D,
@@ -8619,7 +8620,7 @@ async function Ll(e, t) {
 }
 async function Al(e, t, n, r) {
   const s = await Jt();
-  tr(s.wbtc_address, s.factory_address);
+  er(s.wbtc_address, s.factory_address);
   const i = (await et())?.swapPubkey;
   if (!i)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -8736,7 +8737,7 @@ async function ql(e, t, n, r, s) {
 }
 async function Dl(e, t, n) {
   const r = await Jt();
-  tr(r.wbtc_address, r.factory_address);
+  er(r.wbtc_address, r.factory_address);
   const s = (await et())?.swapPubkey;
   if (!s)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -8846,7 +8847,7 @@ async function Hl(e, t, n, r, s, i) {
     bip322_signature: p
   });
 }
-async function ir(e, t) {
+async function or(e, t) {
   const n = await Jt();
   if (n.fee_policy === null) {
     const r = Or.get(tn());
@@ -8856,14 +8857,14 @@ async function ir(e, t) {
 }
 async function Vl(e, t, n) {
   const r = await Jt();
-  await rr(e, t);
+  await sr(e, t);
   const s = (await et())?.swapPubkey;
   if (!s)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   const i = {
     balanceOf: Bn,
     reservesOf: Ue
-  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await ir(e, t), u = await sl(
+  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await or(e, t), u = await sl(
     i,
     s,
     e,
@@ -8944,8 +8945,8 @@ async function Kl(e, t, n, r, s, i) {
   const o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  await rr(e, t);
-  const a = r * (10000n - s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await ir(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Zl({
+  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({
     token1_addr: e,
     token2_addr: t,
     in_amt: n.toString(),
@@ -8985,14 +8986,14 @@ async function Kl(e, t, n, r, s, i) {
 }
 async function Xl(e, t, n) {
   const r = await Jt();
-  await rr(e, t);
+  await sr(e, t);
   const s = (await et())?.swapPubkey;
   if (!s)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
   const i = {
     balanceOf: Bn,
     reservesOf: Ue
-  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await ir(e, t), u = await ol(
+  }, o = await $t("swap"), { token1FeeBps: a, token2FeeBps: c } = await or(e, t), u = await ol(
     i,
     s,
     e,
@@ -9073,8 +9074,8 @@ async function tf(e, t, n, r, s, i) {
   const o = (await et())?.swapPubkey;
   if (!o)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
-  await rr(e, t);
-  const a = n * (10000n + s) / 10000n, c = await qe(), u = await $t("swap"), { token1FeeBps: l, token2FeeBps: f } = await ir(e, t), { referrerPubkey: d, refReturnBps: p } = i ? await Vr(o, i) : { referrerPubkey: void 0, refReturnBps: void 0 }, w = await Jl({
+  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({
     token1_addr: e,
     token2_addr: t,
     max_in_amt: a.toString(),
@@ -9218,7 +9219,7 @@ async function nf(e, t) {
 }
 async function rf(e, t) {
   const n = await Jt();
-  tr(n.wbtc_address, n.factory_address);
+  er(n.wbtc_address, n.factory_address);
   const r = (await et())?.swapPubkey;
   if (!r)
     throw new Error("Smart wallet not found. Please generate a smart wallet first.");
@@ -9389,7 +9390,7 @@ const Mf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   getMinerFee: $t,
   getMinerFeesOfDepositOrder: kl,
   getMinerFeesOfWrapOrder: Ll,
-  getPairAddress: er,
+  getPairAddress: nr,
   getPairReserves: Ue,
   getPairVolumeOverDays: Sl,
   getRemoveLiquidityResult: Dl,
@@ -9427,7 +9428,7 @@ function Tr(e, t) {
   if (typeof e != "string" || !xf.test(e))
     throw new Error(`${t} must be a non-empty hex string`);
 }
-function Hn(e, t) {
+function Vn(e, t) {
   if (typeof e != "string" || e.length === 0)
     throw new Error(`${t} must be a non-empty string`);
 }
@@ -9442,7 +9443,7 @@ function gn(e) {
   );
 }
 function No(e, t, n) {
-  Hn(e.max, "max"), e.lim != null && Hn(e.lim, "lim");
+  Vn(e.max, "max"), e.lim != null && Vn(e.lim, "lim");
   const r = t === 5 || n != null;
   if (r && e.selfMint === !1)
     throw new Error(
@@ -9462,12 +9463,12 @@ function _f(e) {
 function Ef(e) {
   const t = Zr(e.tick);
   if (t < 4 || t > 6) throw new Error(`ticker must be 4-6 bytes, got ${t}`);
-  return Hn(e.amt, "amt"), gn({ p: "brc-20", op: "mint", tick: e.tick, amt: e.amt });
+  return Vn(e.amt, "amt"), gn({ p: "brc-20", op: "mint", tick: e.tick, amt: e.amt });
 }
 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 Hn(e.amt, "amt"), gn({ p: "brc-20", op: "transfer", tick: e.tick, amt: e.amt });
+  return Vn(e.amt, "amt"), gn({ p: "brc-20", op: "transfer", tick: e.tick, amt: e.amt });
 }
 function Co(e = 16) {
   if (!Number.isInteger(e) || e <= 0)