@omnity/ree-client-ts-sdk 0.2.6 → 0.2.7

package/dist/ree-sdk.es.js

@@ -1,12 +1,12 @@
 import * as Ze from "bitcoinjs-lib";
 import "@dfinity/candid";
-import Ln from "axios";
+import Dn from "axios";
 import { Actor as Dt, HttpAgent as en } from "@dfinity/agent";
-import { RuneId as Dn, Edict as tn, Runestone as er, none as St } from "runelib";
-import { Kind as tr, print as nr, parse as rr } from "graphql";
-import { jsx as ir } from "react/jsx-runtime";
-import { createContext as or, useState as Se, useCallback as We, useMemo as nn, useContext as sr, useEffect as Ge } from "react";
-function cr(e, t) {
+import { RuneId as er, Edict as tn, Runestone as tr, none as St } from "runelib";
+import { Kind as nr, print as rr, parse as ir } from "graphql";
+import { jsx as or } from "react/jsx-runtime";
+import { createContext as sr, useState as Se, useCallback as We, useMemo as nn, useContext as cr, useEffect as Ge } from "react";
+function ar(e, t) {
   for (var r = 0; r < t.length; r++) {
     const i = t[r];
     if (typeof i != "string" && !Array.isArray(i)) {
@@ -26,7 +26,7 @@ function Cn(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
 var Nt = {}, ct = {}, rn;
-function ar() {
+function ur() {
   if (rn) return ct;
   rn = 1, ct.byteLength = a, ct.toByteArray = d, ct.fromByteArray = B;
   for (var e = [], t = [], r = typeof Uint8Array < "u" ? Uint8Array : Array, i = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", c = 0, s = i.length; c < s; ++c)
@@ -76,7 +76,7 @@ function ar() {
 var pt = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var on;
-function ur() {
+function fr() {
   return on || (on = 1, pt.read = function(e, t, r, i, c) {
     var s, u, a = c * 8 - i - 1, h = (1 << a) - 1, d = h >> 1, w = -7, y = r ? c - 1 : 0, B = r ? -1 : 1, _ = e[t + y];
     for (y += B, s = _ & (1 << -w) - 1, _ >>= -w, w += a; w > 0; s = s * 256 + e[t + y], y += B, w -= 8)
@@ -107,9 +107,9 @@ function ur() {
  * @license  MIT
  */
 var sn;
-function fr() {
+function lr() {
   return sn || (sn = 1, (function(e) {
-    const t = ar(), r = ur(), i = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
+    const t = ur(), r = fr(), i = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
     e.Buffer = a, e.SlowBuffer = D, e.INSPECT_MAX_BYTES = 50;
     const c = 2147483647;
     e.kMaxLength = c, a.TYPED_ARRAY_SUPPORT = s(), !a.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
@@ -357,7 +357,7 @@ function fr() {
             return E(this, n, o);
           case "utf8":
           case "utf-8":
-            return F(this, n, o);
+            return I(this, n, o);
           case "ascii":
             return x(this, n, o);
           case "latin1":
@@ -403,7 +403,7 @@ function fr() {
       return this;
     }, a.prototype.toString = function() {
       const n = this.length;
-      return n === 0 ? "" : arguments.length === 0 ? F(this, 0, n) : te.apply(this, arguments);
+      return n === 0 ? "" : arguments.length === 0 ? I(this, 0, n) : te.apply(this, arguments);
     }, a.prototype.toLocaleString = a.prototype.toString, a.prototype.equals = function(n) {
       if (!a.isBuffer(n)) throw new TypeError("Argument must be a Buffer");
       return this === n ? !0 : a.compare(this, n) === 0;
@@ -434,7 +434,7 @@ function fr() {
         }
       return O < ae ? -1 : ae < O ? 1 : 0;
     };
-    function I(f, n, o, l, b) {
+    function F(f, n, o, l, b) {
       if (f.length === 0) return -1;
       if (typeof o == "string" ? (l = o, o = 0) : o > 2147483647 ? o = 2147483647 : o < -2147483648 && (o = -2147483648), o = +o, Ee(o) && (o = b ? 0 : f.length - 1), o < 0 && (o = f.length + o), o >= f.length) {
         if (b) return -1;
@@ -481,9 +481,9 @@ function fr() {
     a.prototype.includes = function(n, o, l) {
       return this.indexOf(n, o, l) !== -1;
     }, a.prototype.indexOf = function(n, o, l) {
-      return I(this, n, o, l, !0);
+      return F(this, n, o, l, !0);
     }, a.prototype.lastIndexOf = function(n, o, l) {
-      return I(this, n, o, l, !1);
+      return F(this, n, o, l, !1);
     };
     function Z(f, n, o, l) {
       o = Number(o) || 0;
@@ -558,7 +558,7 @@ function fr() {
     function C(f, n, o) {
       return n === 0 && o === f.length ? t.fromByteArray(f) : t.fromByteArray(f.slice(n, o));
     }
-    function F(f, n, o) {
+    function I(f, n, o) {
       o = Math.min(f.length, o);
       const l = [];
       let b = n;
@@ -1047,8 +1047,8 @@ function fr() {
     }
   })(Nt)), Nt;
 }
-var lr = fr(), Rt = { exports: {} }, cn;
-function dr() {
+var dr = lr(), Rt = { exports: {} }, cn;
+function hr() {
   if (cn) return Rt.exports;
   cn = 1;
   var e = Rt.exports = {}, t, r;
@@ -1143,13 +1143,13 @@ function dr() {
     return 0;
   }, Rt.exports;
 }
-var hr = dr();
-const pr = /* @__PURE__ */ Cn(hr);
+var pr = hr();
+const gr = /* @__PURE__ */ Cn(pr);
 typeof globalThis > "u" && (globalThis.global = globalThis);
-typeof globalThis.Buffer > "u" && (globalThis.Buffer = lr.Buffer);
-typeof globalThis.process > "u" && (globalThis.process = pr);
+typeof globalThis.Buffer > "u" && (globalThis.Buffer = dr.Buffer);
+typeof globalThis.process > "u" && (globalThis.process = gr);
 var Ae = {}, Ht = {}, Be = {}, Pe = {}, Ut = {}, at = {}, an;
-function gr() {
+function wr() {
   return an || (an = 1, Object.defineProperty(at, "__esModule", { value: !0 }), at.crypto = void 0, at.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), at;
 }
 var un;
@@ -1157,7 +1157,7 @@ function tt() {
   return un || (un = 1, (function(e) {
     /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
     Object.defineProperty(e, "__esModule", { value: !0 }), e.wrapXOFConstructorWithOpts = e.wrapConstructorWithOpts = e.wrapConstructor = e.Hash = e.nextTick = e.swap32IfBE = e.byteSwapIfBE = e.swap8IfBE = e.isLE = void 0, e.isBytes = r, e.anumber = i, e.abytes = c, e.ahash = s, e.aexists = u, e.aoutput = a, e.u8 = h, e.u32 = d, e.clean = w, e.createView = y, e.rotr = B, e.rotl = _, e.byteSwap = T, e.byteSwap32 = S, e.bytesToHex = D, e.hexToBytes = J, e.asyncLoop = P, e.utf8ToBytes = Z, e.bytesToUtf8 = H, e.toBytes = q, e.kdfInputToBytes = k, e.concatBytes = ee, e.checkOpts = C, e.createHasher = m, e.createOptHasher = N, e.createXOFer = x, e.randomBytes = p;
-    const t = /* @__PURE__ */ gr();
+    const t = /* @__PURE__ */ wr();
     function r(E) {
       return E instanceof Uint8Array || ArrayBuffer.isView(E) && E.constructor.name === "Uint8Array";
     }
@@ -1255,9 +1255,9 @@ function tt() {
       }
       return v;
     }
-    const I = async () => {
+    const F = async () => {
     };
-    e.nextTick = I;
+    e.nextTick = F;
     async function P(E, U, g) {
       let v = Date.now();
       for (let R = 0; R < E; R++) {
@@ -1298,9 +1298,9 @@ function tt() {
         throw new Error("options should be object or undefined");
       return Object.assign(E, U);
     }
-    class F {
+    class I {
     }
-    e.Hash = F;
+    e.Hash = I;
     function m(E) {
       const U = (v) => E().update(q(v)).digest(), g = E();
       return U.outputLen = g.outputLen, U.blockLen = g.blockLen, U.create = () => E(), U;
@@ -1324,7 +1324,7 @@ function tt() {
   })(Ut)), Ut;
 }
 var fn;
-function wr() {
+function mr() {
   if (fn) return Pe;
   fn = 1, Object.defineProperty(Pe, "__esModule", { value: !0 }), Pe.SHA512_IV = Pe.SHA384_IV = Pe.SHA224_IV = Pe.SHA256_IV = Pe.HashMD = void 0, Pe.setBigUint64 = t, Pe.Chi = r, Pe.Maj = i;
   const e = /* @__PURE__ */ tt();
@@ -1446,7 +1446,7 @@ function wr() {
   ]), Pe;
 }
 var me = {}, ln;
-function mr() {
+function yr() {
   if (ln) return me;
   ln = 1, Object.defineProperty(me, "__esModule", { value: !0 }), me.toBig = me.shrSL = me.shrSH = me.rotrSL = me.rotrSH = me.rotrBL = me.rotrBH = me.rotr32L = me.rotr32H = me.rotlSL = me.rotlSH = me.rotlBL = me.rotlBH = me.add5L = me.add5H = me.add4L = me.add4H = me.add3L = me.add3H = void 0, me.add = Q, me.fromBig = r, me.split = i;
   const e = /* @__PURE__ */ BigInt(2 ** 32 - 1), t = /* @__PURE__ */ BigInt(32);
@@ -1456,9 +1456,9 @@ function mr() {
   function i(H, q = !1) {
     const k = H.length;
     let ee = new Uint32Array(k), C = new Uint32Array(k);
-    for (let F = 0; F < k; F++) {
-      const { h: m, l: N } = r(H[F], q);
-      [ee[F], C[F]] = [m, N];
+    for (let I = 0; I < k; I++) {
+      const { h: m, l: N } = r(H[I], q);
+      [ee[I], C[I]] = [m, N];
     }
     return [ee, C];
   }
@@ -1500,9 +1500,9 @@ function mr() {
   me.add4L = te;
   const J = (H, q, k, ee, C) => q + k + ee + C + (H / 2 ** 32 | 0) | 0;
   me.add4H = J;
-  const I = (H, q, k, ee, C) => (H >>> 0) + (q >>> 0) + (k >>> 0) + (ee >>> 0) + (C >>> 0);
-  me.add5L = I;
-  const P = (H, q, k, ee, C, F) => q + k + ee + C + F + (H / 2 ** 32 | 0) | 0;
+  const F = (H, q, k, ee, C) => (H >>> 0) + (q >>> 0) + (k >>> 0) + (ee >>> 0) + (C >>> 0);
+  me.add5L = F;
+  const P = (H, q, k, ee, C, I) => q + k + ee + C + I + (H / 2 ** 32 | 0) | 0;
   me.add5H = P;
   const Z = {
     fromBig: r,
@@ -1526,15 +1526,15 @@ function mr() {
     add4L: te,
     add4H: J,
     add5H: P,
-    add5L: I
+    add5L: F
   };
   return me.default = Z, me;
 }
 var dn;
-function yr() {
+function br() {
   if (dn) return Be;
   dn = 1, Object.defineProperty(Be, "__esModule", { value: !0 }), Be.sha512_224 = Be.sha512_256 = Be.sha384 = Be.sha512 = Be.sha224 = Be.sha256 = Be.SHA512_256 = Be.SHA512_224 = Be.SHA384 = Be.SHA512 = Be.SHA224 = Be.SHA256 = void 0;
-  const e = /* @__PURE__ */ wr(), t = /* @__PURE__ */ mr(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ Uint32Array.from([
+  const e = /* @__PURE__ */ mr(), t = /* @__PURE__ */ yr(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ Uint32Array.from([
     1116352408,
     1899447441,
     3049323471,
@@ -1605,26 +1605,26 @@ function yr() {
       super(64, $, 8, !1), this.A = e.SHA256_IV[0] | 0, this.B = e.SHA256_IV[1] | 0, this.C = e.SHA256_IV[2] | 0, this.D = e.SHA256_IV[3] | 0, this.E = e.SHA256_IV[4] | 0, this.F = e.SHA256_IV[5] | 0, this.G = e.SHA256_IV[6] | 0, this.H = e.SHA256_IV[7] | 0;
     }
     get() {
-      const { A: $, B: te, C: J, D: I, E: P, F: Z, G: H, H: q } = this;
-      return [$, te, J, I, P, Z, H, q];
+      const { A: $, B: te, C: J, D: F, E: P, F: Z, G: H, H: q } = this;
+      return [$, te, J, F, P, Z, H, q];
     }
     // prettier-ignore
-    set($, te, J, I, P, Z, H, q) {
-      this.A = $ | 0, this.B = te | 0, this.C = J | 0, this.D = I | 0, this.E = P | 0, this.F = Z | 0, this.G = H | 0, this.H = q | 0;
+    set($, te, J, F, P, Z, H, q) {
+      this.A = $ | 0, this.B = te | 0, this.C = J | 0, this.D = F | 0, this.E = P | 0, this.F = Z | 0, this.G = H | 0, this.H = q | 0;
     }
     process($, te) {
       for (let C = 0; C < 16; C++, te += 4)
         c[C] = $.getUint32(te, !1);
       for (let C = 16; C < 64; C++) {
-        const F = c[C - 15], m = c[C - 2], N = (0, r.rotr)(F, 7) ^ (0, r.rotr)(F, 18) ^ F >>> 3, x = (0, r.rotr)(m, 17) ^ (0, r.rotr)(m, 19) ^ m >>> 10;
+        const I = c[C - 15], m = c[C - 2], N = (0, r.rotr)(I, 7) ^ (0, r.rotr)(I, 18) ^ I >>> 3, x = (0, r.rotr)(m, 17) ^ (0, r.rotr)(m, 19) ^ m >>> 10;
         c[C] = x + c[C - 7] + N + c[C - 16] | 0;
       }
-      let { A: J, B: I, C: P, D: Z, E: H, F: q, G: k, H: ee } = this;
+      let { A: J, B: F, C: P, D: Z, E: H, F: q, G: k, H: ee } = this;
       for (let C = 0; C < 64; C++) {
-        const F = (0, r.rotr)(H, 6) ^ (0, r.rotr)(H, 11) ^ (0, r.rotr)(H, 25), m = ee + F + (0, e.Chi)(H, q, k) + i[C] + c[C] | 0, x = ((0, r.rotr)(J, 2) ^ (0, r.rotr)(J, 13) ^ (0, r.rotr)(J, 22)) + (0, e.Maj)(J, I, P) | 0;
-        ee = k, k = q, q = H, H = Z + m | 0, Z = P, P = I, I = J, J = m + x | 0;
+        const I = (0, r.rotr)(H, 6) ^ (0, r.rotr)(H, 11) ^ (0, r.rotr)(H, 25), m = ee + I + (0, e.Chi)(H, q, k) + i[C] + c[C] | 0, x = ((0, r.rotr)(J, 2) ^ (0, r.rotr)(J, 13) ^ (0, r.rotr)(J, 22)) + (0, e.Maj)(J, F, P) | 0;
+        ee = k, k = q, q = H, H = Z + m | 0, Z = P, P = F, F = J, J = m + x | 0;
       }
-      J = J + this.A | 0, I = I + this.B | 0, P = P + this.C | 0, Z = Z + this.D | 0, H = H + this.E | 0, q = q + this.F | 0, k = k + this.G | 0, ee = ee + this.H | 0, this.set(J, I, P, Z, H, q, k, ee);
+      J = J + this.A | 0, F = F + this.B | 0, P = P + this.C | 0, Z = Z + this.D | 0, H = H + this.E | 0, q = q + this.F | 0, k = k + this.G | 0, ee = ee + this.H | 0, this.set(J, F, P, Z, H, q, k, ee);
     }
     roundClean() {
       (0, r.clean)(c);
@@ -1728,12 +1728,12 @@ function yr() {
     }
     // prettier-ignore
     get() {
-      const { Ah: $, Al: te, Bh: J, Bl: I, Ch: P, Cl: Z, Dh: H, Dl: q, Eh: k, El: ee, Fh: C, Fl: F, Gh: m, Gl: N, Hh: x, Hl: p } = this;
-      return [$, te, J, I, P, Z, H, q, k, ee, C, F, m, N, x, p];
+      const { Ah: $, Al: te, Bh: J, Bl: F, Ch: P, Cl: Z, Dh: H, Dl: q, Eh: k, El: ee, Fh: C, Fl: I, Gh: m, Gl: N, Hh: x, Hl: p } = this;
+      return [$, te, J, F, P, Z, H, q, k, ee, C, I, m, N, x, p];
     }
     // prettier-ignore
-    set($, te, J, I, P, Z, H, q, k, ee, C, F, m, N, x, p) {
-      this.Ah = $ | 0, this.Al = te | 0, this.Bh = J | 0, this.Bl = I | 0, this.Ch = P | 0, this.Cl = Z | 0, this.Dh = H | 0, this.Dl = q | 0, this.Eh = k | 0, this.El = ee | 0, this.Fh = C | 0, this.Fl = F | 0, this.Gh = m | 0, this.Gl = N | 0, this.Hh = x | 0, this.Hl = p | 0;
+    set($, te, J, F, P, Z, H, q, k, ee, C, I, m, N, x, p) {
+      this.Ah = $ | 0, this.Al = te | 0, this.Bh = J | 0, this.Bl = F | 0, this.Ch = P | 0, this.Cl = Z | 0, this.Dh = H | 0, this.Dl = q | 0, this.Eh = k | 0, this.El = ee | 0, this.Fh = C | 0, this.Fl = I | 0, this.Gh = m | 0, this.Gl = N | 0, this.Hh = x | 0, this.Hl = p | 0;
     }
     process($, te) {
       for (let g = 0; g < 16; g++, te += 4)
@@ -1742,14 +1742,14 @@ function yr() {
         const v = w[g - 15] | 0, R = y[g - 15] | 0, V = t.rotrSH(v, R, 1) ^ t.rotrSH(v, R, 8) ^ t.shrSH(v, R, 7), Y = t.rotrSL(v, R, 1) ^ t.rotrSL(v, R, 8) ^ t.shrSL(v, R, 7), ne = w[g - 2] | 0, ie = y[g - 2] | 0, z = t.rotrSH(ne, ie, 19) ^ t.rotrBH(ne, ie, 61) ^ t.shrSH(ne, ie, 6), X = t.rotrSL(ne, ie, 19) ^ t.rotrBL(ne, ie, 61) ^ t.shrSL(ne, ie, 6), re = t.add4L(Y, X, y[g - 7], y[g - 16]), le = t.add4H(re, V, z, w[g - 7], w[g - 16]);
         w[g] = le | 0, y[g] = re | 0;
       }
-      let { Ah: J, Al: I, Bh: P, Bl: Z, Ch: H, Cl: q, Dh: k, Dl: ee, Eh: C, El: F, Fh: m, Fl: N, Gh: x, Gl: p, Hh: E, Hl: U } = this;
+      let { Ah: J, Al: F, Bh: P, Bl: Z, Ch: H, Cl: q, Dh: k, Dl: ee, Eh: C, El: I, Fh: m, Fl: N, Gh: x, Gl: p, Hh: E, Hl: U } = this;
       for (let g = 0; g < 80; g++) {
-        const v = t.rotrSH(C, F, 14) ^ t.rotrSH(C, F, 18) ^ t.rotrBH(C, F, 41), R = t.rotrSL(C, F, 14) ^ t.rotrSL(C, F, 18) ^ t.rotrBL(C, F, 41), V = C & m ^ ~C & x, Y = F & N ^ ~F & p, ne = t.add5L(U, R, Y, d[g], y[g]), ie = t.add5H(ne, E, v, V, h[g], w[g]), z = ne | 0, X = t.rotrSH(J, I, 28) ^ t.rotrBH(J, I, 34) ^ t.rotrBH(J, I, 39), re = t.rotrSL(J, I, 28) ^ t.rotrBL(J, I, 34) ^ t.rotrBL(J, I, 39), le = J & P ^ J & H ^ P & H, ce = I & Z ^ I & q ^ Z & q;
-        E = x | 0, U = p | 0, x = m | 0, p = N | 0, m = C | 0, N = F | 0, { h: C, l: F } = t.add(k | 0, ee | 0, ie | 0, z | 0), k = H | 0, ee = q | 0, H = P | 0, q = Z | 0, P = J | 0, Z = I | 0;
+        const v = t.rotrSH(C, I, 14) ^ t.rotrSH(C, I, 18) ^ t.rotrBH(C, I, 41), R = t.rotrSL(C, I, 14) ^ t.rotrSL(C, I, 18) ^ t.rotrBL(C, I, 41), V = C & m ^ ~C & x, Y = I & N ^ ~I & p, ne = t.add5L(U, R, Y, d[g], y[g]), ie = t.add5H(ne, E, v, V, h[g], w[g]), z = ne | 0, X = t.rotrSH(J, F, 28) ^ t.rotrBH(J, F, 34) ^ t.rotrBH(J, F, 39), re = t.rotrSL(J, F, 28) ^ t.rotrBL(J, F, 34) ^ t.rotrBL(J, F, 39), le = J & P ^ J & H ^ P & H, ce = F & Z ^ F & q ^ Z & q;
+        E = x | 0, U = p | 0, x = m | 0, p = N | 0, m = C | 0, N = I | 0, { h: C, l: I } = t.add(k | 0, ee | 0, ie | 0, z | 0), k = H | 0, ee = q | 0, H = P | 0, q = Z | 0, P = J | 0, Z = F | 0;
         const j = t.add3L(z, re, ce);
-        J = t.add3H(j, ie, X, le), I = j | 0;
+        J = t.add3H(j, ie, X, le), F = j | 0;
       }
-      ({ h: J, l: I } = t.add(this.Ah | 0, this.Al | 0, J | 0, I | 0)), { h: P, l: Z } = t.add(this.Bh | 0, this.Bl | 0, P | 0, Z | 0), { h: H, l: q } = t.add(this.Ch | 0, this.Cl | 0, H | 0, q | 0), { h: k, l: ee } = t.add(this.Dh | 0, this.Dl | 0, k | 0, ee | 0), { h: C, l: F } = t.add(this.Eh | 0, this.El | 0, C | 0, F | 0), { h: m, l: N } = t.add(this.Fh | 0, this.Fl | 0, m | 0, N | 0), { h: x, l: p } = t.add(this.Gh | 0, this.Gl | 0, x | 0, p | 0), { h: E, l: U } = t.add(this.Hh | 0, this.Hl | 0, E | 0, U | 0), this.set(J, I, P, Z, H, q, k, ee, C, F, m, N, x, p, E, U);
+      ({ h: J, l: F } = t.add(this.Ah | 0, this.Al | 0, J | 0, F | 0)), { h: P, l: Z } = t.add(this.Bh | 0, this.Bl | 0, P | 0, Z | 0), { h: H, l: q } = t.add(this.Ch | 0, this.Cl | 0, H | 0, q | 0), { h: k, l: ee } = t.add(this.Dh | 0, this.Dl | 0, k | 0, ee | 0), { h: C, l: I } = t.add(this.Eh | 0, this.El | 0, C | 0, I | 0), { h: m, l: N } = t.add(this.Fh | 0, this.Fl | 0, m | 0, N | 0), { h: x, l: p } = t.add(this.Gh | 0, this.Gl | 0, x | 0, p | 0), { h: E, l: U } = t.add(this.Hh | 0, this.Hl | 0, E | 0, U | 0), this.set(J, F, P, Z, H, q, k, ee, C, I, m, N, x, p, E, U);
     }
     roundClean() {
       (0, r.clean)(w, y);
@@ -1814,7 +1814,7 @@ function yr() {
   return Be.SHA512_256 = Q, Be.sha256 = (0, r.createHasher)(() => new s()), Be.sha224 = (0, r.createHasher)(() => new u()), Be.sha512 = (0, r.createHasher)(() => new B()), Be.sha384 = (0, r.createHasher)(() => new _()), Be.sha512_256 = (0, r.createHasher)(() => new Q()), Be.sha512_224 = (0, r.createHasher)(() => new M()), Be;
 }
 var ut = {}, Ot = {}, qt = {}, hn;
-function br() {
+function Er() {
   return hn || (hn = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.hmac = e.HMAC = void 0;
     const t = /* @__PURE__ */ tt();
@@ -1864,7 +1864,7 @@ function br() {
 var Ct = {}, pn;
 function st() {
   return pn || (pn = 1, (function(e) {
-    Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = s, e._abool2 = u, e._abytes2 = a, e.numberToHexUnpadded = h, e.hexToNumber = d, e.bytesToNumberBE = w, e.bytesToNumberLE = y, e.numberToBytesBE = B, e.numberToBytesLE = _, e.numberToVarBytesBE = T, e.ensureBytes = S, e.equalBytes = M, e.copyBytes = Q, e.asciiToBytes = D, e.inRange = te, e.aInRange = J, e.bitLen = I, e.bitGet = P, e.bitSet = Z, e.createHmacDrbg = q, e.validateObject = ee, e.isHash = C, e._validateObject = F, e.memoized = N;
+    Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = s, e._abool2 = u, e._abytes2 = a, e.numberToHexUnpadded = h, e.hexToNumber = d, e.bytesToNumberBE = w, e.bytesToNumberLE = y, e.numberToBytesBE = B, e.numberToBytesLE = _, e.numberToVarBytesBE = T, e.ensureBytes = S, e.equalBytes = M, e.copyBytes = Q, e.asciiToBytes = D, e.inRange = te, e.aInRange = J, e.bitLen = F, e.bitGet = P, e.bitSet = Z, e.createHmacDrbg = q, e.validateObject = ee, e.isHash = C, e._validateObject = I, e.memoized = N;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
     const t = /* @__PURE__ */ tt();
     var r = /* @__PURE__ */ tt();
@@ -1975,7 +1975,7 @@ function st() {
       if (!te(p, E, U))
         throw new Error("expected valid " + x + ": " + E + " <= n < " + U + ", got " + p);
     }
-    function I(x) {
+    function F(x) {
       let p;
       for (p = 0; x > i; x >>= c, p += 1)
         ;
@@ -2051,7 +2051,7 @@ function st() {
     function C(x) {
       return typeof x == "function" && Number.isSafeInteger(x.outputLen);
     }
-    function F(x, p, E = {}) {
+    function I(x, p, E = {}) {
       if (!x || typeof x != "object")
         throw new Error("expected valid options object");
       function U(g, v, R) {
@@ -2083,7 +2083,7 @@ function st() {
 var Ve = {}, ve = {}, gn;
 function dt() {
   if (gn) return ve;
-  gn = 1, Object.defineProperty(ve, "__esModule", { value: !0 }), ve.isNegativeLE = void 0, ve.mod = y, ve.pow = B, ve.pow2 = _, ve.invert = T, ve.tonelliShanks = $, ve.FpSqrt = te, ve.validateField = P, ve.FpPow = Z, ve.FpInvertBatch = H, ve.FpDiv = q, ve.FpLegendre = k, ve.FpIsSquare = ee, ve.nLength = C, ve.Field = F, ve.FpSqrtOdd = m, ve.FpSqrtEven = N, ve.hashToPrivateScalar = x, ve.getFieldBytesLength = p, ve.getMinHashLength = E, ve.mapHashToField = U;
+  gn = 1, Object.defineProperty(ve, "__esModule", { value: !0 }), ve.isNegativeLE = void 0, ve.mod = y, ve.pow = B, ve.pow2 = _, ve.invert = T, ve.tonelliShanks = $, ve.FpSqrt = te, ve.validateField = P, ve.FpPow = Z, ve.FpInvertBatch = H, ve.FpDiv = q, ve.FpLegendre = k, ve.FpIsSquare = ee, ve.nLength = C, ve.Field = I, ve.FpSqrtOdd = m, ve.FpSqrtEven = N, ve.hashToPrivateScalar = x, ve.getFieldBytesLength = p, ve.getMinHashLength = E, ve.mapHashToField = U;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   const e = /* @__PURE__ */ st(), t = BigInt(0), r = BigInt(1), i = /* @__PURE__ */ BigInt(2), c = /* @__PURE__ */ BigInt(3), s = /* @__PURE__ */ BigInt(4), u = /* @__PURE__ */ BigInt(5), a = /* @__PURE__ */ BigInt(7), h = /* @__PURE__ */ BigInt(8), d = /* @__PURE__ */ BigInt(9), w = /* @__PURE__ */ BigInt(16);
   function y(g, v) {
@@ -2091,7 +2091,7 @@ function dt() {
     return R >= t ? R : v + R;
   }
   function B(g, v, R) {
-    return Z(F(R), g, v);
+    return Z(I(R), g, v);
   }
   function _(g, v, R) {
     let V = g;
@@ -2126,7 +2126,7 @@ function dt() {
     return S(g, z, v), z;
   }
   function D(g) {
-    const v = F(g), R = $(g), V = R(v, v.neg(v.ONE)), Y = R(v, V), ne = R(v, v.neg(V)), ie = (g + a) / w;
+    const v = I(g), R = $(g), V = R(v, v.neg(v.ONE)), Y = R(v, V), ne = R(v, v.neg(V)), ie = (g + a) / w;
     return (z, X) => {
       let re = z.pow(X, ie), le = z.mul(re, V);
       const ce = z.mul(re, Y), j = z.mul(re, ne), oe = z.eql(z.sqr(le), X), ye = z.eql(z.sqr(ce), X);
@@ -2142,7 +2142,7 @@ function dt() {
     for (; v % i === t; )
       v /= i, R++;
     let V = i;
-    const Y = F(g);
+    const Y = I(g);
     for (; k(Y, V) === 1; )
       if (V++ > 1e3)
         throw new Error("Cannot find square root: probably non-prime P");
@@ -2174,7 +2174,7 @@ function dt() {
   }
   const J = (g, v) => (y(g, v) & r) === r;
   ve.isNegativeLE = J;
-  const I = [
+  const F = [
     "create",
     "isValid",
     "is0",
@@ -2199,7 +2199,7 @@ function dt() {
       MASK: "bigint",
       BYTES: "number",
       BITS: "number"
-    }, R = I.reduce((V, Y) => (V[Y] = "function", V), v);
+    }, R = F.reduce((V, Y) => (V[Y] = "function", V), v);
     return (0, e._validateObject)(g, R), g;
   }
   function Z(g, v, R) {
@@ -2235,7 +2235,7 @@ function dt() {
     const R = v !== void 0 ? v : g.toString(2).length, V = Math.ceil(R / 8);
     return { nBitLength: R, nByteLength: V };
   }
-  function F(g, v, R = !1, V = {}) {
+  function I(g, v, R = !1, V = {}) {
     if (g <= t)
       throw new Error("invalid field: expected ORDER > 0, got " + g);
     let Y, ne, ie = !1, z;
@@ -2347,57 +2347,57 @@ function dt() {
   return ve;
 }
 var wn;
-function Er() {
+function Br() {
   if (wn) return Ve;
   wn = 1, Object.defineProperty(Ve, "__esModule", { value: !0 }), Ve.wNAF = void 0, Ve.negateCt = c, Ve.normalizeZ = s, Ve.mulEndoUnsafe = M, Ve.pippenger = Q, Ve.precomputeMSMUnsafe = D, Ve.validateBasic = $, Ve._createCurveFields = J;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   const e = /* @__PURE__ */ st(), t = /* @__PURE__ */ dt(), r = BigInt(0), i = BigInt(1);
-  function c(I, P) {
+  function c(F, P) {
     const Z = P.negate();
-    return I ? Z : P;
+    return F ? Z : P;
   }
-  function s(I, P) {
-    const Z = (0, t.FpInvertBatch)(I.Fp, P.map((H) => H.Z));
-    return P.map((H, q) => I.fromAffine(H.toAffine(Z[q])));
+  function s(F, P) {
+    const Z = (0, t.FpInvertBatch)(F.Fp, P.map((H) => H.Z));
+    return P.map((H, q) => F.fromAffine(H.toAffine(Z[q])));
   }
-  function u(I, P) {
-    if (!Number.isSafeInteger(I) || I <= 0 || I > P)
-      throw new Error("invalid window size, expected [1.." + P + "], got W=" + I);
+  function u(F, P) {
+    if (!Number.isSafeInteger(F) || F <= 0 || F > P)
+      throw new Error("invalid window size, expected [1.." + P + "], got W=" + F);
   }
-  function a(I, P) {
-    u(I, P);
-    const Z = Math.ceil(P / I) + 1, H = 2 ** (I - 1), q = 2 ** I, k = (0, e.bitMask)(I), ee = BigInt(I);
+  function a(F, P) {
+    u(F, P);
+    const Z = Math.ceil(P / F) + 1, H = 2 ** (F - 1), q = 2 ** F, k = (0, e.bitMask)(F), ee = BigInt(F);
     return { windows: Z, windowSize: H, mask: k, maxNumber: q, shiftBy: ee };
   }
-  function h(I, P, Z) {
+  function h(F, P, Z) {
     const { windowSize: H, mask: q, maxNumber: k, shiftBy: ee } = Z;
-    let C = Number(I & q), F = I >> ee;
-    C > H && (C -= k, F += i);
+    let C = Number(F & q), I = F >> ee;
+    C > H && (C -= k, I += i);
     const m = P * H, N = m + Math.abs(C) - 1, x = C === 0, p = C < 0, E = P % 2 !== 0;
-    return { nextN: F, offset: N, isZero: x, isNeg: p, isNegF: E, offsetF: m };
+    return { nextN: I, offset: N, isZero: x, isNeg: p, isNegF: E, offsetF: m };
   }
-  function d(I, P) {
-    if (!Array.isArray(I))
+  function d(F, P) {
+    if (!Array.isArray(F))
       throw new Error("array expected");
-    I.forEach((Z, H) => {
+    F.forEach((Z, H) => {
       if (!(Z instanceof P))
         throw new Error("invalid point at index " + H);
     });
   }
-  function w(I, P) {
-    if (!Array.isArray(I))
+  function w(F, P) {
+    if (!Array.isArray(F))
       throw new Error("array of scalars expected");
-    I.forEach((Z, H) => {
+    F.forEach((Z, H) => {
       if (!P.isValid(Z))
         throw new Error("invalid scalar at index " + H);
     });
   }
   const y = /* @__PURE__ */ new WeakMap(), B = /* @__PURE__ */ new WeakMap();
-  function _(I) {
-    return B.get(I) || 1;
+  function _(F) {
+    return B.get(F) || 1;
   }
-  function T(I) {
-    if (I !== r)
+  function T(F) {
+    if (F !== r)
       throw new Error("invalid wNAF");
   }
   class S {
@@ -2427,7 +2427,7 @@ function Er() {
     precomputeWindow(P, Z) {
       const { windows: H, windowSize: q } = a(Z, this.bits), k = [];
       let ee = P, C = ee;
-      for (let F = 0; F < H; F++) {
+      for (let I = 0; I < H; I++) {
         C = ee, k.push(C);
         for (let m = 1; m < q; m++)
           C = C.add(ee), k.push(C);
@@ -2447,8 +2447,8 @@ function Er() {
       let q = this.ZERO, k = this.BASE;
       const ee = a(P, this.bits);
       for (let C = 0; C < ee.windows; C++) {
-        const { nextN: F, offset: m, isZero: N, isNeg: x, isNegF: p, offsetF: E } = h(H, C, ee);
-        H = F, N ? k = k.add(c(p, Z[E])) : q = q.add(c(x, Z[m]));
+        const { nextN: I, offset: m, isZero: N, isNeg: x, isNegF: p, offsetF: E } = h(H, C, ee);
+        H = I, N ? k = k.add(c(p, Z[E])) : q = q.add(c(x, Z[m]));
       }
       return T(H), { p: q, f: k };
     }
@@ -2460,9 +2460,9 @@ function Er() {
     wNAFUnsafe(P, Z, H, q = this.ZERO) {
       const k = a(P, this.bits);
       for (let ee = 0; ee < k.windows && H !== r; ee++) {
-        const { nextN: C, offset: F, isZero: m, isNeg: N } = h(H, ee, k);
+        const { nextN: C, offset: I, isZero: m, isNeg: N } = h(H, ee, k);
         if (H = C, !m) {
-          const x = Z[F];
+          const x = Z[I];
           q = q.add(N ? x.negate() : x);
         }
       }
@@ -2491,23 +2491,23 @@ function Er() {
     }
   }
   Ve.wNAF = S;
-  function M(I, P, Z, H) {
-    let q = P, k = I.ZERO, ee = I.ZERO;
+  function M(F, P, Z, H) {
+    let q = P, k = F.ZERO, ee = F.ZERO;
     for (; Z > r || H > r; )
       Z & i && (k = k.add(q)), H & i && (ee = ee.add(q)), q = q.double(), Z >>= i, H >>= i;
     return { p1: k, p2: ee };
   }
-  function Q(I, P, Z, H) {
-    d(Z, I), w(H, P);
+  function Q(F, P, Z, H) {
+    d(Z, F), w(H, P);
     const q = Z.length, k = H.length;
     if (q !== k)
       throw new Error("arrays of points and scalars must have equal length");
-    const ee = I.ZERO, C = (0, e.bitLen)(BigInt(q));
-    let F = 1;
-    C > 12 ? F = C - 3 : C > 4 ? F = C - 2 : C > 0 && (F = 2);
-    const m = (0, e.bitMask)(F), N = new Array(Number(m) + 1).fill(ee), x = Math.floor((P.BITS - 1) / F) * F;
+    const ee = F.ZERO, C = (0, e.bitLen)(BigInt(q));
+    let I = 1;
+    C > 12 ? I = C - 3 : C > 4 ? I = C - 2 : C > 0 && (I = 2);
+    const m = (0, e.bitMask)(I), N = new Array(Number(m) + 1).fill(ee), x = Math.floor((P.BITS - 1) / I) * I;
     let p = ee;
-    for (let E = x; E >= 0; E -= F) {
+    for (let E = x; E >= 0; E -= I) {
       N.fill(ee);
       for (let g = 0; g < k; g++) {
         const v = H[g], R = Number(v >> BigInt(E) & m);
@@ -2517,14 +2517,14 @@ function Er() {
       for (let g = N.length - 1, v = ee; g > 0; g--)
         v = v.add(N[g]), U = U.add(v);
       if (p = p.add(U), E !== 0)
-        for (let g = 0; g < F; g++)
+        for (let g = 0; g < I; g++)
           p = p.double();
     }
     return p;
   }
-  function D(I, P, Z, H) {
-    u(H, P.BITS), d(Z, I);
-    const q = I.ZERO, k = 2 ** H - 1, ee = Math.ceil(P.BITS / H), C = (0, e.bitMask)(H), F = Z.map((m) => {
+  function D(F, P, Z, H) {
+    u(H, P.BITS), d(Z, F);
+    const q = F.ZERO, k = 2 ** H - 1, ee = Math.ceil(P.BITS / H), C = (0, e.bitMask)(H), I = Z.map((m) => {
       const N = [];
       for (let x = 0, p = m; x < k; x++)
         N.push(p), p = p.add(m);
@@ -2541,14 +2541,14 @@ function Er() {
         const p = BigInt(ee * H - (x + 1) * H);
         for (let E = 0; E < m.length; E++) {
           const U = m[E], g = Number(U >> p & C);
-          g && (N = N.add(F[E][g - 1]));
+          g && (N = N.add(I[E][g - 1]));
         }
       }
       return N;
     };
   }
-  function $(I) {
-    return (0, t.validateField)(I.Fp), (0, e.validateObject)(I, {
+  function $(F) {
+    return (0, t.validateField)(F.Fp), (0, e.validateObject)(F, {
       n: "bigint",
       h: "bigint",
       Gx: "field",
@@ -2557,31 +2557,31 @@ function Er() {
       nBitLength: "isSafeInteger",
       nByteLength: "isSafeInteger"
     }), Object.freeze({
-      ...(0, t.nLength)(I.n, I.nBitLength),
-      ...I,
-      p: I.Fp.ORDER
+      ...(0, t.nLength)(F.n, F.nBitLength),
+      ...F,
+      p: F.Fp.ORDER
     });
   }
-  function te(I, P, Z) {
+  function te(F, P, Z) {
     if (P) {
-      if (P.ORDER !== I)
+      if (P.ORDER !== F)
         throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
       return (0, t.validateField)(P), P;
     } else
-      return (0, t.Field)(I, { isLE: Z });
+      return (0, t.Field)(F, { isLE: Z });
   }
-  function J(I, P, Z = {}, H) {
-    if (H === void 0 && (H = I === "edwards"), !P || typeof P != "object")
-      throw new Error(`expected valid ${I} CURVE object`);
-    for (const F of ["p", "n", "h"]) {
-      const m = P[F];
+  function J(F, P, Z = {}, H) {
+    if (H === void 0 && (H = F === "edwards"), !P || typeof P != "object")
+      throw new Error(`expected valid ${F} CURVE object`);
+    for (const I of ["p", "n", "h"]) {
+      const m = P[I];
       if (!(typeof m == "bigint" && m > r))
-        throw new Error(`CURVE.${F} must be positive bigint`);
+        throw new Error(`CURVE.${I} must be positive bigint`);
     }
-    const q = te(P.p, Z.Fp, H), k = te(P.n, Z.Fn, H), C = ["Gx", "Gy", "a", I === "weierstrass" ? "b" : "d"];
-    for (const F of C)
-      if (!q.isValid(P[F]))
-        throw new Error(`CURVE.${F} must be valid field element of CURVE.Fp`);
+    const q = te(P.p, Z.Fp, H), k = te(P.n, Z.Fn, H), C = ["Gx", "Gy", "a", F === "weierstrass" ? "b" : "d"];
+    for (const I of C)
+      if (!q.isValid(P[I]))
+        throw new Error(`CURVE.${I} must be valid field element of CURVE.Fp`);
     return P = Object.freeze(Object.assign({}, P)), { CURVE: P, Fp: q, Fn: k };
   }
   return Ve;
@@ -2589,9 +2589,9 @@ function Er() {
 var mn;
 function Pn() {
   return mn || (mn = 1, (function(e) {
-    Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = a, e._normFnElement = M, e.weierstrassN = Q, e.SWUFpSqrtRatio = $, e.mapToCurveSimpleSWU = te, e.ecdh = I, e.ecdsa = P, e.weierstrassPoints = Z, e._legacyHelperEquat = k, e.weierstrass = F;
+    Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = a, e._normFnElement = M, e.weierstrassN = Q, e.SWUFpSqrtRatio = $, e.mapToCurveSimpleSWU = te, e.ecdh = F, e.ecdsa = P, e.weierstrassPoints = Z, e._legacyHelperEquat = k, e.weierstrass = I;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ br(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ st(), c = /* @__PURE__ */ Er(), s = /* @__PURE__ */ dt(), u = (m, N) => (m + (m >= 0 ? N : -N) / _) / N;
+    const t = /* @__PURE__ */ Er(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ st(), c = /* @__PURE__ */ Br(), s = /* @__PURE__ */ dt(), u = (m, N) => (m + (m >= 0 ? N : -N) / _) / N;
     function a(m, N, x) {
       const [[p, E], [U, g]] = N, v = u(g * m, x), R = u(-E * m, x);
       let V = m - v * p - R * U, Y = -v * E - R * g;
@@ -2916,10 +2916,10 @@ function Pn() {
           const { X: W, Y: K, Z: f } = this, { X: n, Y: o, Z: l } = L;
           let b = p.ZERO, A = p.ZERO, O = p.ZERO;
           const ae = U.a, he = p.mul(U.b, T);
-          let ue = p.mul(W, n), we = p.mul(K, o), pe = p.mul(f, l), Fe = p.add(W, K), Te = p.add(n, o);
-          Fe = p.mul(Fe, Te), Te = p.add(ue, we), Fe = p.sub(Fe, Te), Te = p.add(W, f);
+          let ue = p.mul(W, n), we = p.mul(K, o), pe = p.mul(f, l), Ie = p.add(W, K), Te = p.add(n, o);
+          Ie = p.mul(Ie, Te), Te = p.add(ue, we), Ie = p.sub(Ie, Te), Te = p.add(W, f);
           let Ce = p.add(n, l);
-          return Te = p.mul(Te, Ce), Ce = p.add(ue, pe), Te = p.sub(Te, Ce), Ce = p.add(K, f), b = p.add(o, l), Ce = p.mul(Ce, b), b = p.add(we, pe), Ce = p.sub(Ce, b), O = p.mul(ae, Te), b = p.mul(he, pe), O = p.add(b, O), b = p.sub(we, O), O = p.add(we, O), A = p.mul(b, O), we = p.add(ue, ue), we = p.add(we, ue), pe = p.mul(ae, pe), Te = p.mul(he, Te), we = p.add(we, pe), pe = p.sub(ue, pe), pe = p.mul(ae, pe), Te = p.add(Te, pe), ue = p.mul(we, Te), A = p.add(A, ue), ue = p.mul(Ce, Te), b = p.mul(Fe, b), b = p.sub(b, ue), ue = p.mul(Fe, we), O = p.mul(Ce, O), O = p.add(O, ue), new be(b, A, O);
+          return Te = p.mul(Te, Ce), Ce = p.add(ue, pe), Te = p.sub(Te, Ce), Ce = p.add(K, f), b = p.add(o, l), Ce = p.mul(Ce, b), b = p.add(we, pe), Ce = p.sub(Ce, b), O = p.mul(ae, Te), b = p.mul(he, pe), O = p.add(b, O), b = p.sub(we, O), O = p.add(we, O), A = p.mul(b, O), we = p.add(ue, ue), we = p.add(we, ue), pe = p.mul(ae, pe), Te = p.mul(he, Te), we = p.add(we, pe), pe = p.sub(ue, pe), pe = p.mul(ae, pe), Te = p.add(Te, pe), ue = p.mul(we, Te), A = p.add(A, ue), ue = p.mul(Ce, Te), b = p.mul(Ie, b), b = p.sub(b, ue), ue = p.mul(Ie, we), O = p.mul(Ce, O), O = p.add(O, ue), new be(b, A, O);
         }
         subtract(L) {
           return this.add(L.negate());
@@ -3107,7 +3107,7 @@ function Pn() {
         signature: 2 * N.BYTES
       };
     }
-    function I(m, N = {}) {
+    function F(m, N = {}) {
       const { Fn: x } = m, p = N.randomBytes || i.randomBytes, E = Object.assign(J(m.Fp, x), { seed: (0, s.getMinHashLength)(x.ORDER) });
       function U(z) {
         try {
@@ -3175,7 +3175,7 @@ function Pn() {
         bits2int: "function",
         bits2int_modN: "function"
       });
-      const p = x.randomBytes || i.randomBytes, E = x.hmac || ((W, ...K) => (0, t.hmac)(N, W, (0, i.concatBytes)(...K))), { Fp: U, Fn: g } = m, { ORDER: v, BITS: R } = g, { keygen: V, getPublicKey: Y, getSharedSecret: ne, utils: ie, lengths: z } = I(m, x), X = {
+      const p = x.randomBytes || i.randomBytes, E = x.hmac || ((W, ...K) => (0, t.hmac)(N, W, (0, i.concatBytes)(...K))), { Fp: U, Fn: g } = m, { ORDER: v, BITS: R } = g, { keygen: V, getPublicKey: Y, getSharedSecret: ne, utils: ie, lengths: z } = F(m, x), X = {
         prehash: !1,
         lowS: typeof x.lowS == "boolean" ? x.lowS : !1,
         format: void 0,
@@ -3226,10 +3226,10 @@ function Pn() {
           const A = l === 2 || l === 3 ? n + v : n;
           if (!U.isValid(A))
             throw new Error("recovery id 2 or 3 invalid");
-          const O = U.toBytes(A), ae = m.fromBytes((0, i.concatBytes)(D((l & 1) === 0), O)), he = g.inv(A), ue = _e((0, i.ensureBytes)("msgHash", K)), we = g.create(-ue * he), pe = g.create(o * he), Fe = m.BASE.multiplyUnsafe(we).add(ae.multiplyUnsafe(pe));
-          if (Fe.is0())
+          const O = U.toBytes(A), ae = m.fromBytes((0, i.concatBytes)(D((l & 1) === 0), O)), he = g.inv(A), ue = _e((0, i.ensureBytes)("msgHash", K)), we = g.create(-ue * he), pe = g.create(o * he), Ie = m.BASE.multiplyUnsafe(we).add(ae.multiplyUnsafe(pe));
+          if (Ie.is0())
             throw new Error("point at infinify");
-          return Fe.assertValidity(), Fe;
+          return Ie.assertValidity(), Ie;
         }
         // Signatures should be low-s, to prevent malleability.
         hasHighS() {
@@ -3303,10 +3303,10 @@ function Pn() {
           const pe = ye(we);
           if (!g.isValidNot0(pe))
             return;
-          const Fe = g.inv(pe), Te = m.BASE.multiply(pe).toAffine(), Ce = g.create(Te.x);
+          const Ie = g.inv(pe), Te = m.BASE.multiply(pe).toAffine(), Ce = g.create(Te.x);
           if (Ce === y)
             return;
-          const ht = g.create(Fe * g.create(he + Ce * A));
+          const ht = g.create(Ie * g.create(he + Ce * A));
           if (ht === y)
             return;
           let Jt = (Te.x === Ce ? 0 : 2) | Number(Te.y & B), Lt = ht;
@@ -3353,7 +3353,7 @@ function Pn() {
           const O = m.fromBytes(f);
           if (o && A.hasHighS())
             return !1;
-          const { r: ae, s: he } = A, ue = _e(K), we = g.inv(he), pe = g.create(ue * we), Fe = g.create(ae * we), Te = m.BASE.multiplyUnsafe(pe).add(O.multiplyUnsafe(Fe));
+          const { r: ae, s: he } = A, ue = _e(K), we = g.inv(he), pe = g.create(ue * we), Ie = g.create(ae * we), Te = m.BASE.multiplyUnsafe(pe).add(O.multiplyUnsafe(Ie));
           return Te.is0() ? !1 : g.create(Te.x) === ae;
         } catch {
           return !1;
@@ -3447,14 +3447,14 @@ function Pn() {
         CURVE: Object.assign({}, m, (0, s.nLength)(x.Fn.ORDER, x.Fn.BITS))
       });
     }
-    function F(m) {
+    function I(m) {
       const { CURVE: N, curveOpts: x, hash: p, ecdsaOpts: E } = q(m), U = Q(N, x), g = P(U, p, E);
       return C(m, g);
     }
   })(Ot)), Ot;
 }
 var yn;
-function Br() {
+function xr() {
   if (yn) return ut;
   yn = 1, Object.defineProperty(ut, "__esModule", { value: !0 }), ut.getHash = t, ut.createCurve = r;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -3469,7 +3469,7 @@ function Br() {
   return ut;
 }
 var Pt = {}, bn;
-function xr() {
+function _r() {
   return bn || (bn = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e._DST_scalar = void 0, e.expand_message_xmd = h, e.expand_message_xof = d, e.hash_to_field = w, e.isogenyMap = y, e.createHasher = B;
     const t = /* @__PURE__ */ st(), r = /* @__PURE__ */ dt(), i = t.bytesToNumberBE;
@@ -3501,7 +3501,7 @@ function xr() {
       const { outputLen: Q, blockLen: D } = M, $ = Math.ceil(S / Q);
       if (S > 65535 || $ > 255)
         throw new Error("expand_message_xmd: invalid lenInBytes");
-      const te = (0, t.concatBytes)(T, c(T.length, 1)), J = c(0, D), I = c(S, 2), P = new Array($), Z = M((0, t.concatBytes)(J, _, I, c(0, 1), te));
+      const te = (0, t.concatBytes)(T, c(T.length, 1)), J = c(0, D), F = c(S, 2), P = new Array($), Z = M((0, t.concatBytes)(J, _, F, c(0, 1), te));
       P[0] = M((0, t.concatBytes)(Z, c(1, 1), te));
       for (let q = 1; q <= $; q++) {
         const k = [s(Z, P[q - 1]), c(q + 1, 1), te];
@@ -3529,7 +3529,7 @@ function xr() {
       if (!(0, t.isHash)(S.hash))
         throw new Error("expected valid hash");
       (0, t.abytes)(_), u(T);
-      const I = M.toString(2).length, P = Math.ceil((I + Q) / 8), Z = T * D * P;
+      const F = M.toString(2).length, P = Math.ceil((F + Q) / 8), Z = T * D * P;
       let H;
       if (te === "xmd")
         H = h(_, J, Z, $);
@@ -3543,7 +3543,7 @@ function xr() {
       for (let k = 0; k < T; k++) {
         const ee = new Array(D);
         for (let C = 0; C < D; C++) {
-          const F = P * (C + k * D), m = H.subarray(F, F + P);
+          const I = P * (C + k * D), m = H.subarray(I, I + P);
           ee[C] = (0, r.mod)(i(m), M);
         }
         q[k] = ee;
@@ -3553,8 +3553,8 @@ function xr() {
     function y(_, T) {
       const S = T.map((M) => Array.from(M).reverse());
       return (M, Q) => {
-        const [D, $, te, J] = S.map((Z) => Z.reduce((H, q) => _.add(_.mul(H, M), q))), [I, P] = (0, r.FpInvertBatch)(_, [$, J], !0);
-        return M = _.mul(D, I), Q = _.mul(Q, _.mul(te, P)), { x: M, y: Q };
+        const [D, $, te, J] = S.map((Z) => Z.reduce((H, q) => _.add(_.mul(H, M), q))), [F, P] = (0, r.FpInvertBatch)(_, [$, J], !0);
+        return M = _.mul(D, F), Q = _.mul(Q, _.mul(te, P)), { x: M, y: Q };
       };
     }
     e._DST_scalar = (0, t.utf8ToBytes)("HashToScalar-");
@@ -3571,11 +3571,11 @@ function xr() {
       return {
         defaults: S,
         hashToCurve(D, $) {
-          const te = Object.assign({}, S, $), J = w(D, 2, te), I = M(J[0]), P = M(J[1]);
-          return Q(I.add(P));
+          const te = Object.assign({}, S, $), J = w(D, 2, te), F = M(J[0]), P = M(J[1]);
+          return Q(F.add(P));
         },
         encodeToCurve(D, $) {
-          const te = S.encodeDST ? { DST: S.encodeDST } : {}, J = Object.assign({}, S, te, $), I = w(D, 1, J), P = M(I[0]);
+          const te = S.encodeDST ? { DST: S.encodeDST } : {}, J = Object.assign({}, S, te, $), F = w(D, 1, J), P = M(F[0]);
           return Q(P);
         },
         /** See {@link H2CHasher} */
@@ -3598,11 +3598,11 @@ function xr() {
   })(Pt)), Pt;
 }
 var En;
-function _r() {
+function vr() {
   return En || (En = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.encodeToCurve = e.hashToCurve = e.secp256k1_hasher = e.schnorr = e.secp256k1 = void 0;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ yr(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ Br(), c = /* @__PURE__ */ xr(), s = /* @__PURE__ */ dt(), u = /* @__PURE__ */ Pn(), a = /* @__PURE__ */ st(), h = {
+    const t = /* @__PURE__ */ br(), r = /* @__PURE__ */ tt(), i = /* @__PURE__ */ xr(), c = /* @__PURE__ */ _r(), s = /* @__PURE__ */ dt(), u = /* @__PURE__ */ Pn(), a = /* @__PURE__ */ st(), h = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -3618,7 +3618,7 @@ function _r() {
       ]
     }, w = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), B = /* @__PURE__ */ BigInt(2);
     function _(C) {
-      const F = h.p, m = BigInt(3), N = BigInt(6), x = BigInt(11), p = BigInt(22), E = BigInt(23), U = BigInt(44), g = BigInt(88), v = C * C * C % F, R = v * v * C % F, V = (0, s.pow2)(R, m, F) * R % F, Y = (0, s.pow2)(V, m, F) * R % F, ne = (0, s.pow2)(Y, B, F) * v % F, ie = (0, s.pow2)(ne, x, F) * ne % F, z = (0, s.pow2)(ie, p, F) * ie % F, X = (0, s.pow2)(z, U, F) * z % F, re = (0, s.pow2)(X, g, F) * X % F, le = (0, s.pow2)(re, U, F) * z % F, ce = (0, s.pow2)(le, m, F) * R % F, j = (0, s.pow2)(ce, E, F) * ie % F, oe = (0, s.pow2)(j, N, F) * v % F, ye = (0, s.pow2)(oe, B, F);
+      const I = h.p, m = BigInt(3), N = BigInt(6), x = BigInt(11), p = BigInt(22), E = BigInt(23), U = BigInt(44), g = BigInt(88), v = C * C * C % I, R = v * v * C % I, V = (0, s.pow2)(R, m, I) * R % I, Y = (0, s.pow2)(V, m, I) * R % I, ne = (0, s.pow2)(Y, B, I) * v % I, ie = (0, s.pow2)(ne, x, I) * ne % I, z = (0, s.pow2)(ie, p, I) * ie % I, X = (0, s.pow2)(z, U, I) * z % I, re = (0, s.pow2)(X, g, I) * X % I, le = (0, s.pow2)(re, U, I) * z % I, ce = (0, s.pow2)(le, m, I) * R % I, j = (0, s.pow2)(ce, E, I) * ie % I, oe = (0, s.pow2)(j, N, I) * v % I, ye = (0, s.pow2)(oe, B, I);
       if (!T.eql(T.sqr(ye), C))
         throw new Error("Cannot find square root");
       return ye;
@@ -3626,49 +3626,49 @@ function _r() {
     const T = (0, s.Field)(h.p, { sqrt: _ });
     e.secp256k1 = (0, i.createCurve)({ ...h, Fp: T, lowS: !0, endo: d }, t.sha256);
     const S = {};
-    function M(C, ...F) {
+    function M(C, ...I) {
       let m = S[C];
       if (m === void 0) {
         const N = (0, t.sha256)((0, a.utf8ToBytes)(C));
         m = (0, a.concatBytes)(N, N), S[C] = m;
       }
-      return (0, t.sha256)((0, a.concatBytes)(m, ...F));
+      return (0, t.sha256)((0, a.concatBytes)(m, ...I));
     }
     const Q = (C) => C.toBytes(!0).slice(1), D = e.secp256k1.Point, $ = (C) => C % B === w;
     function te(C) {
-      const { Fn: F, BASE: m } = D, N = (0, u._normFnElement)(F, C), x = m.multiply(N);
-      return { scalar: $(x.y) ? N : F.neg(N), bytes: Q(x) };
+      const { Fn: I, BASE: m } = D, N = (0, u._normFnElement)(I, C), x = m.multiply(N);
+      return { scalar: $(x.y) ? N : I.neg(N), bytes: Q(x) };
     }
     function J(C) {
-      const F = T;
-      if (!F.isValidNot0(C))
+      const I = T;
+      if (!I.isValidNot0(C))
         throw new Error("invalid x: Fail if x ≥ p");
-      const m = F.create(C * C), N = F.create(m * C + BigInt(7));
-      let x = F.sqrt(N);
-      $(x) || (x = F.neg(x));
+      const m = I.create(C * C), N = I.create(m * C + BigInt(7));
+      let x = I.sqrt(N);
+      $(x) || (x = I.neg(x));
       const p = D.fromAffine({ x: C, y: x });
       return p.assertValidity(), p;
     }
-    const I = a.bytesToNumberBE;
+    const F = a.bytesToNumberBE;
     function P(...C) {
-      return D.Fn.create(I(M("BIP0340/challenge", ...C)));
+      return D.Fn.create(F(M("BIP0340/challenge", ...C)));
     }
     function Z(C) {
       return te(C).bytes;
     }
-    function H(C, F, m = (0, r.randomBytes)(32)) {
-      const { Fn: N } = D, x = (0, a.ensureBytes)("message", C), { bytes: p, scalar: E } = te(F), U = (0, a.ensureBytes)("auxRand", m, 32), g = N.toBytes(E ^ I(M("BIP0340/aux", U))), v = M("BIP0340/nonce", g, p, x), { bytes: R, scalar: V } = te(v), Y = P(R, p, x), ne = new Uint8Array(64);
+    function H(C, I, m = (0, r.randomBytes)(32)) {
+      const { Fn: N } = D, x = (0, a.ensureBytes)("message", C), { bytes: p, scalar: E } = te(I), U = (0, a.ensureBytes)("auxRand", m, 32), g = N.toBytes(E ^ F(M("BIP0340/aux", U))), v = M("BIP0340/nonce", g, p, x), { bytes: R, scalar: V } = te(v), Y = P(R, p, x), ne = new Uint8Array(64);
       if (ne.set(R, 0), ne.set(N.toBytes(N.create(V + Y * E)), 32), !q(ne, x, p))
         throw new Error("sign: Invalid signature produced");
       return ne;
     }
-    function q(C, F, m) {
-      const { Fn: N, BASE: x } = D, p = (0, a.ensureBytes)("signature", C, 64), E = (0, a.ensureBytes)("message", F), U = (0, a.ensureBytes)("publicKey", m, 32);
+    function q(C, I, m) {
+      const { Fn: N, BASE: x } = D, p = (0, a.ensureBytes)("signature", C, 64), E = (0, a.ensureBytes)("message", I), U = (0, a.ensureBytes)("publicKey", m, 32);
       try {
-        const g = J(I(U)), v = I(p.subarray(0, 32));
+        const g = J(F(U)), v = F(p.subarray(0, 32));
         if (!(0, a.inRange)(v, y, h.p))
           return !1;
-        const R = I(p.subarray(32, 64));
+        const R = F(p.subarray(32, 64));
         if (!(0, a.inRange)(R, y, h.n))
           return !1;
         const V = P(N.toBytes(v), Q(g), E), Y = x.multiplyUnsafe(R).add(g.multiplyUnsafe(N.neg(V))), { x: ne, y: ie } = Y.toAffine();
@@ -3740,14 +3740,14 @@ function _r() {
         "0x0000000000000000000000000000000000000000000000000000000000000001"
         // LAST 1
       ]
-    ].map((C) => C.map((F) => BigInt(F)))), ee = (0, u.mapToCurveSimpleSWU)(T, {
+    ].map((C) => C.map((I) => BigInt(I)))), ee = (0, u.mapToCurveSimpleSWU)(T, {
       A: BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),
       B: BigInt("1771"),
       Z: T.create(BigInt("-11"))
     });
     e.secp256k1_hasher = (0, c.createHasher)(e.secp256k1.Point, (C) => {
-      const { x: F, y: m } = ee(T.create(C[0]));
-      return k(F, m);
+      const { x: I, y: m } = ee(T.create(C[0]));
+      return k(I, m);
     }, {
       DST: "secp256k1_XMD:SHA-256_SSWU_RO_",
       encodeDST: "secp256k1_XMD:SHA-256_SSWU_NU_",
@@ -3760,17 +3760,17 @@ function _r() {
   })(Ht)), Ht;
 }
 var se = {}, Bn;
-function vr() {
+function Ar() {
   if (Bn) return se;
   Bn = 1, Object.defineProperty(se, "__esModule", { value: !0 }), se.isHash = se.validateObject = se.memoized = se.notImplemented = se.createHmacDrbg = se.bitMask = se.bitSet = se.bitGet = se.bitLen = se.aInRange = se.inRange = se.asciiToBytes = se.copyBytes = se.equalBytes = se.ensureBytes = se.numberToVarBytesBE = se.numberToBytesLE = se.numberToBytesBE = se.bytesToNumberLE = se.bytesToNumberBE = se.hexToNumber = se.numberToHexUnpadded = se.abool = se.utf8ToBytes = se.randomBytes = se.isBytes = se.hexToBytes = se.concatBytes = se.bytesToUtf8 = se.bytesToHex = se.anumber = se.abytes = void 0;
   const e = /* @__PURE__ */ st();
   return se.abytes = e.abytes, se.anumber = e.anumber, se.bytesToHex = e.bytesToHex, se.bytesToUtf8 = e.bytesToUtf8, se.concatBytes = e.concatBytes, se.hexToBytes = e.hexToBytes, se.isBytes = e.isBytes, se.randomBytes = e.randomBytes, se.utf8ToBytes = e.utf8ToBytes, se.abool = e.abool, se.numberToHexUnpadded = e.numberToHexUnpadded, se.hexToNumber = e.hexToNumber, se.bytesToNumberBE = e.bytesToNumberBE, se.bytesToNumberLE = e.bytesToNumberLE, se.numberToBytesBE = e.numberToBytesBE, se.numberToBytesLE = e.numberToBytesLE, se.numberToVarBytesBE = e.numberToVarBytesBE, se.ensureBytes = e.ensureBytes, se.equalBytes = e.equalBytes, se.copyBytes = e.copyBytes, se.asciiToBytes = e.asciiToBytes, se.inRange = e.inRange, se.aInRange = e.aInRange, se.bitLen = e.bitLen, se.bitGet = e.bitGet, se.bitSet = e.bitSet, se.bitMask = e.bitMask, se.createHmacDrbg = e.createHmacDrbg, se.notImplemented = e.notImplemented, se.memoized = e.memoized, se.validateObject = e.validateObject, se.isHash = e.isHash, se;
 }
 var xn;
-function Ar() {
+function Tr() {
   if (xn) return Ae;
   xn = 1;
-  var e = /* @__PURE__ */ _r(), t = /* @__PURE__ */ dt(), r = /* @__PURE__ */ vr();
+  var e = /* @__PURE__ */ vr(), t = /* @__PURE__ */ dt(), r = /* @__PURE__ */ Ar();
   function i(n) {
     var o = /* @__PURE__ */ Object.create(null);
     return n && Object.keys(n).forEach(function(l) {
@@ -3853,7 +3853,7 @@ function Ar() {
     186,
     238
   ]), J = BigInt(1);
-  function I(n) {
+  function F(n) {
     return n instanceof Uint8Array;
   }
   function P(n, o) {
@@ -3872,7 +3872,7 @@ function Ar() {
     return n instanceof Uint8Array && n.length === 64 && P(n.subarray(0, 32), Q) < 0 && P(n.subarray(32, 64), Q) < 0;
   }
   function k(n) {
-    return I(n) && n.length === 64 && P(n.subarray(0, 32), te) < 0;
+    return F(n) && n.length === 64 && P(n.subarray(0, 32), te) < 0;
   }
   function ee(n) {
     return !(Z(n.subarray(0, 32)) || Z(n.subarray(32, 64)));
@@ -3880,7 +3880,7 @@ function Ar() {
   function C(n) {
     return n instanceof Uint8Array && n.length === S;
   }
-  function F(n) {
+  function I(n) {
     return n === void 0 || n instanceof Uint8Array && n.length === D;
   }
   function m(n) {
@@ -4044,7 +4044,7 @@ function Ar() {
       throw new Error(a);
     if (!C(n))
       throw new Error(_);
-    if (!F(l))
+    if (!I(l))
       throw new Error(B);
     return e.secp256k1.sign(n, o, { extraEntropy: l }).toCompactRawBytes();
   }
@@ -4053,7 +4053,7 @@ function Ar() {
       throw new Error(a);
     if (!C(n))
       throw new Error(_);
-    if (!F(l))
+    if (!I(l))
       throw new Error(B);
     const b = e.secp256k1.sign(n, o, { extraEntropy: l });
     return {
@@ -4066,7 +4066,7 @@ function Ar() {
       throw new Error(a);
     if (!C(n))
       throw new Error(_);
-    if (!F(l))
+    if (!I(l))
       throw new Error(B);
     return e.schnorr.sign(n, o, l);
   }
@@ -4103,20 +4103,20 @@ function Ar() {
   }
   return Ae.isPoint = ie, Ae.isPointCompressed = z, Ae.isPrivate = X, Ae.isXOnlyPoint = re, Ae.pointAdd = Ne, Ae.pointAddScalar = Ue, Ae.pointCompress = ye, Ae.pointFromScalar = j, Ae.pointMultiply = _e, Ae.privateAdd = qe, Ae.privateNegate = je, Ae.privateSub = be, Ae.recover = W, Ae.sign = Re, Ae.signRecoverable = Ee, Ae.signSchnorr = L, Ae.verify = K, Ae.verifySchnorr = f, Ae.xOnlyPointAddTweak = le, Ae.xOnlyPointFromPoint = ce, Ae.xOnlyPointFromScalar = oe, Ae;
 }
-var kn = Ar();
-const Tr = /* @__PURE__ */ Cn(kn), Sr = /* @__PURE__ */ cr({
+var kn = Tr();
+const Sr = /* @__PURE__ */ Cn(kn), Nr = /* @__PURE__ */ ar({
   __proto__: null,
-  default: Tr
+  default: Sr
 }, [kn]);
-Ze.initEccLib(Sr);
+Ze.initEccLib(Nr);
 const Et = {
   Mainnet: "mainnet",
   Testnet: "testnet"
 };
-class Nr {
+class Rr {
   axios;
   constructor(t) {
-    this.axios = Ln.create({
+    this.axios = Dn.create({
       baseURL: t.baseUrl,
       headers: {
         Accept: "application/json",
@@ -4146,7 +4146,7 @@ class Nr {
     ).then((s) => s.data);
   }
 }
-function Rr(e) {
+function In(e) {
   if (e.length % 2 !== 0)
     throw new Error("Hex string must have even length");
   const t = new Uint8Array(e.length / 2);
@@ -4194,7 +4194,7 @@ const eo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bytesToHex: Vt,
   getAddressType: ft,
   getScriptByAddress: Mt,
-  hexToBytes: Rr,
+  hexToBytes: In,
   toBitcoinNetwork: zt
 }, Symbol.toStringTag, { value: "Module" })), Hr = "kqs64-paaaa-aaaar-qamza-cai", Ur = "hvyp5-5yaaa-aaaao-qjxha-cai", gt = BigInt(546), wt = "0:0", Or = "https://runescan-hasura-mainnet.omnity.network/v1/graphql", qr = "https://runescan-hasura-testnet.omnity.network/v1/graphql";
 class Cr {
@@ -4225,8 +4225,8 @@ class Cr {
       hash: t.txid,
       index: t.vout,
       witnessUtxo: {
-        value: Number(t.satoshis),
-        script: Buffer.from(t.scriptPk, "hex")
+        value: BigInt(t.satoshis),
+        script: In(t.scriptPk)
       }
     }), this.inputAddressTypes.push(ft(r)), this.inputUtxos.push(t), (r === this.config.address || r === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
   }
@@ -4238,7 +4238,7 @@ class Cr {
   addOutput(t, r) {
     this.psbt.addOutput({
       address: t,
-      value: Number(r)
+      value: r
     }), this.outputAddressTypes.push(ft(t));
   }
   /**
@@ -4248,7 +4248,7 @@ class Cr {
   addScriptOutput(t) {
     this.psbt.addOutput({
       script: t,
-      value: 0
+      value: BigInt(0)
     }), this.outputAddressTypes.push({ OpReturn: BigInt(t.length) });
   }
   /**
@@ -4343,7 +4343,7 @@ class Cr {
       throw new Error("Insufficient UTXO(s)");
     B > gt ? this.psbt.addOutput({
       address: i,
-      value: Number(B)
+      value: B
     }) : B > BigInt(0) && (d = B), this.txFee = d + u;
   }
   /**
@@ -4429,7 +4429,7 @@ class Cr {
     const u = Array.from(c), a = [], h = [];
     let d = 1;
     u.forEach((y) => {
-      const B = new Dn(
+      const B = new er(
         Number(y.split(":")[0]),
         Number(y.split(":")[1])
       ), _ = t[y] ?? BigInt(0);
@@ -4438,8 +4438,8 @@ class Cr {
         S > BigInt(0) && (a.push(new tn(B, S, d)), h.push(T), d++);
       });
     }), console.log("edicts", a);
-    const w = new er(a, St(), St(), St());
-    return this.addScriptOutput(w.encipher()), h.forEach((y) => {
+    const w = new tr(a, St(), St(), St());
+    return this.addScriptOutput(new Uint8Array(w.encipher())), h.forEach((y) => {
       let B = gt;
       !i[y] || y === this.config.address ? this.additionalDustNeeded += gt : (B = i[y], delete i[y]), this.addOutput(y, B);
     }), i;
@@ -4600,13 +4600,13 @@ const _n = (e) => e.toUpperCase(), kt = (e) => typeof e == "function" ? e() : e,
 }, kr = (e) => {
   try {
     const t = e();
-    return Fr(t) ? t.catch((r) => vn(r)) : t;
+    return Ir(t) ? t.catch((r) => vn(r)) : t;
   } catch (t) {
     return vn(t);
   }
-}, vn = (e) => e instanceof Error ? e : new Error(String(e)), Fr = (e) => typeof e == "object" && e !== null && "then" in e && typeof e.then == "function" && "catch" in e && typeof e.catch == "function" && "finally" in e && typeof e.finally == "function", Xt = (e) => {
+}, vn = (e) => e instanceof Error ? e : new Error(String(e)), Ir = (e) => typeof e == "object" && e !== null && "then" in e && typeof e.then == "function" && "catch" in e && typeof e.catch == "function" && "finally" in e && typeof e.finally == "function", Xt = (e) => {
   throw new Error(`Unhandled case: ${String(e)}`);
-}, mt = (e) => typeof e == "object" && e !== null && !Array.isArray(e), Ir = (e, t) => e.documents ? e : {
+}, mt = (e) => typeof e == "object" && e !== null && !Array.isArray(e), Fr = (e, t) => e.documents ? e : {
   documents: e,
   requestHeaders: t,
   signal: void 0
@@ -4615,9 +4615,9 @@ const _n = (e) => e.toUpperCase(), kt = (e) => typeof e == "function" ? e() : e,
   variables: t,
   requestHeaders: r,
   signal: void 0
-}, An = "Accept", jt = "Content-Type", $t = "application/json", In = "application/graphql-response+json", Tn = (e) => e.replace(/([\s,]|#[^\n\r]+)+/g, " ").trim(), Mr = (e) => {
+}, An = "Accept", jt = "Content-Type", $t = "application/json", Vn = "application/graphql-response+json", Tn = (e) => e.replace(/([\s,]|#[^\n\r]+)+/g, " ").trim(), Mr = (e) => {
   const t = e.toLowerCase();
-  return t.includes(In) || t.includes($t);
+  return t.includes(Vn) || t.includes($t);
 }, Sn = (e) => {
   try {
     if (Array.isArray(e))
@@ -4660,22 +4660,22 @@ ${String(e)}`);
     errors: t,
     extensions: i
   };
-}, jr = (e) => e._tag === "Batch" ? e.executionResults.some(Rn) : Rn(e.executionResult), Rn = (e) => Array.isArray(e.errors) ? e.errors.length > 0 : !!e.errors, Vn = (e) => typeof e == "object" && e !== null && "kind" in e && e.kind === tr.OPERATION_DEFINITION, $r = (e) => {
+}, jr = (e) => e._tag === "Batch" ? e.executionResults.some(Rn) : Rn(e.executionResult), Rn = (e) => Array.isArray(e.errors) ? e.errors.length > 0 : !!e.errors, Mn = (e) => typeof e == "object" && e !== null && "kind" in e && e.kind === nr.OPERATION_DEFINITION, $r = (e) => {
   let t;
-  const r = e.definitions.filter(Vn);
+  const r = e.definitions.filter(Mn);
   return r.length === 1 && (t = r[0].name?.value), t;
 }, Zr = (e) => {
   let t = !1;
-  const r = e.definitions.filter(Vn);
+  const r = e.definitions.filter(Mn);
   return r.length === 1 && (t = r[0].operation === "mutation"), t;
-}, Ft = (e, t) => {
-  const r = typeof e == "string" ? e : nr(e);
+}, It = (e, t) => {
+  const r = typeof e == "string" ? e : rr(e);
   let i = !1, c;
   if (t)
     return { expression: r, isMutation: i, operationName: c };
-  const s = kr(() => typeof e == "string" ? rr(e) : e);
+  const s = kr(() => typeof e == "string" ? ir(e) : e);
   return s instanceof Error ? { expression: r, isMutation: i, operationName: c } : (c = $r(s), i = Zr(s), { expression: r, operationName: c, isMutation: i });
-}, Yt = JSON, It = async (e) => {
+}, Yt = JSON, Ft = async (e) => {
   const t = {
     ...e,
     method: e.request._tag === "Single" ? e.request.document.isMutation ? "POST" : _n(e.method ?? "post") : e.request.hasMutations ? "POST" : _n(e.method ?? "post"),
@@ -4730,7 +4730,7 @@ ${String(e)}`);
 }, Wr = (e) => async (t) => {
   const r = new Headers(t.headers);
   let i = null, c;
-  r.has(An) || r.set(An, [In, $t].join(", ")), e === "POST" ? (c = (t.fetchOptions.jsonSerializer ?? Yt).stringify(Gr(t)), typeof c == "string" && !r.has(jt) && r.set(jt, $t)) : i = zr(t);
+  r.has(An) || r.set(An, [Vn, $t].join(", ")), e === "POST" ? (c = (t.fetchOptions.jsonSerializer ?? Yt).stringify(Gr(t)), typeof c == "string" && !r.has(jt) && r.set(jt, $t)) : i = zr(t);
   const s = { method: e, headers: r, body: c, ...t.fetchOptions };
   let u = new URL(t.url), a = s;
   if (t.middleware) {
@@ -4789,7 +4789,7 @@ class Xr {
   rawRequest = async (...t) => {
     const [r, i, c] = t, s = Vr(r, i, c), { headers: u, fetch: a = globalThis.fetch, method: h = "POST", requestMiddleware: d, responseMiddleware: w, excludeOperationName: y, ...B } = this.requestConfig, { url: _ } = this;
     s.signal !== void 0 && (B.signal = s.signal);
-    const T = Ft(s.query, y), S = await It({
+    const T = It(s.query, y), S = await Ft({
       url: _,
       request: {
         _tag: "Single",
@@ -4816,7 +4816,7 @@ class Xr {
   async request(t, ...r) {
     const [i, c] = r, s = Yr(t, i, c), { headers: u, fetch: a = globalThis.fetch, method: h = "POST", requestMiddleware: d, responseMiddleware: w, excludeOperationName: y, ...B } = this.requestConfig, { url: _ } = this;
     s.signal !== void 0 && (B.signal = s.signal);
-    const T = Ft(s.document, y), S = await It({
+    const T = It(s.document, y), S = await Ft({
       url: _,
       request: {
         _tag: "Single",
@@ -4841,9 +4841,9 @@ class Xr {
     return S.data;
   }
   async batchRequests(t, r) {
-    const i = Ir(t, r), { headers: c, excludeOperationName: s, ...u } = this.requestConfig;
+    const i = Fr(t, r), { headers: c, excludeOperationName: s, ...u } = this.requestConfig;
     i.signal !== void 0 && (u.signal = i.signal);
-    const a = i.documents.map(({ document: B }) => Ft(B, s)), h = a.map(({ expression: B }) => B), d = a.some(({ isMutation: B }) => B), w = i.documents.map(({ variables: B }) => B), y = await It({
+    const a = i.documents.map(({ document: B }) => It(B, s)), h = a.map(({ expression: B }) => B), d = a.some(({ isMutation: B }) => B), w = i.documents.map(({ variables: B }) => B), y = await Ft({
       url: this.url,
       request: {
         _tag: "Batch",
@@ -4957,7 +4957,7 @@ var rt = 9e15, Le = 1e9, Zt = "0123456789abcdef", Bt = "2.3025850929940456840179
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
   // true/false
-}, Mn, Xe, ge = !0, vt = "[DecimalError] ", Je = vt + "Invalid argument: ", jn = vt + "Precision limit exceeded", $n = vt + "crypto unavailable", Zn = "[object Decimal]", ke = Math.floor, He = Math.pow, Jr = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Lr = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Dr = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, Kn = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, $e = 1e7, de = 7, ei = 9007199254740991, ti = Bt.length - 1, Wt = xt.length - 1, G = { toStringTag: Zn };
+}, jn, Xe, ge = !0, vt = "[DecimalError] ", Je = vt + "Invalid argument: ", $n = vt + "Precision limit exceeded", Zn = vt + "crypto unavailable", Kn = "[object Decimal]", ke = Math.floor, He = Math.pow, Jr = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Lr = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Dr = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, Wn = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, $e = 1e7, de = 7, ei = 9007199254740991, ti = Bt.length - 1, Wt = xt.length - 1, G = { toStringTag: Kn };
 G.absoluteValue = G.abs = function() {
   var e = new this.constructor(this);
   return e.s < 0 && (e.s = 1), fe(e);
@@ -4984,7 +4984,7 @@ G.comparedTo = G.cmp = function(e) {
 };
 G.cosine = G.cos = function() {
   var e, t, r = this, i = r.constructor;
-  return r.d ? r.d[0] ? (e = i.precision, t = i.rounding, i.precision = e + Math.max(r.e, r.sd()) + de, i.rounding = 1, r = ni(i, Yn(i, r)), i.precision = e, i.rounding = t, fe(Xe == 2 || Xe == 3 ? r.neg() : r, e, t, !0)) : new i(1) : new i(NaN);
+  return r.d ? r.d[0] ? (e = i.precision, t = i.rounding, i.precision = e + Math.max(r.e, r.sd()) + de, i.rounding = 1, r = ni(i, Qn(i, r)), i.precision = e, i.rounding = t, fe(Xe == 2 || Xe == 3 ? r.neg() : r, e, t, !0)) : new i(1) : new i(NaN);
 };
 G.cubeRoot = G.cbrt = function() {
   var e, t, r, i, c, s, u, a, h, d, w = this, y = w.constructor;
@@ -5212,7 +5212,7 @@ G.plus = G.add = function(e) {
 G.precision = G.sd = function(e) {
   var t, r = this;
   if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(Je + e);
-  return r.d ? (t = Wn(r.d), e && r.e + 1 > t && (t = r.e + 1)) : t = NaN, t;
+  return r.d ? (t = Gn(r.d), e && r.e + 1 > t && (t = r.e + 1)) : t = NaN, t;
 };
 G.round = function() {
   var e = this, t = e.constructor;
@@ -5220,7 +5220,7 @@ G.round = function() {
 };
 G.sine = G.sin = function() {
   var e, t, r = this, i = r.constructor;
-  return r.isFinite() ? r.isZero() ? new i(r) : (e = i.precision, t = i.rounding, i.precision = e + Math.max(r.e, r.sd()) + de, i.rounding = 1, r = ii(i, Yn(i, r)), i.precision = e, i.rounding = t, fe(Xe > 2 ? r.neg() : r, e, t, !0)) : new i(NaN);
+  return r.isFinite() ? r.isZero() ? new i(r) : (e = i.precision, t = i.rounding, i.precision = e + Math.max(r.e, r.sd()) + de, i.rounding = 1, r = ii(i, Qn(i, r)), i.precision = e, i.rounding = t, fe(Xe > 2 ? r.neg() : r, e, t, !0)) : new i(NaN);
 };
 G.squareRoot = G.sqrt = function() {
   var e, t, r, i, c, s, u = this, a = u.d, h = u.e, d = u.s, w = u.constructor;
@@ -5262,20 +5262,20 @@ G.toBinary = function(e, t) {
 };
 G.toDecimalPlaces = G.toDP = function(e, t) {
   var r = this, i = r.constructor;
-  return r = new i(r), e === void 0 ? r : (Ie(e, 0, Le), t === void 0 ? t = i.rounding : Ie(t, 0, 8), fe(r, e + r.e + 1, t));
+  return r = new i(r), e === void 0 ? r : (Fe(e, 0, Le), t === void 0 ? t = i.rounding : Fe(t, 0, 8), fe(r, e + r.e + 1, t));
 };
 G.toExponential = function(e, t) {
   var r, i = this, c = i.constructor;
-  return e === void 0 ? r = ze(i, !0) : (Ie(e, 0, Le), t === void 0 ? t = c.rounding : Ie(t, 0, 8), i = fe(new c(i), e + 1, t), r = ze(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + r : r;
+  return e === void 0 ? r = ze(i, !0) : (Fe(e, 0, Le), t === void 0 ? t = c.rounding : Fe(t, 0, 8), i = fe(new c(i), e + 1, t), r = ze(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + r : r;
 };
 G.toFixed = function(e, t) {
   var r, i, c = this, s = c.constructor;
-  return e === void 0 ? r = ze(c) : (Ie(e, 0, Le), t === void 0 ? t = s.rounding : Ie(t, 0, 8), i = fe(new s(c), e + c.e + 1, t), r = ze(i, !1, e + i.e + 1)), c.isNeg() && !c.isZero() ? "-" + r : r;
+  return e === void 0 ? r = ze(c) : (Fe(e, 0, Le), t === void 0 ? t = s.rounding : Fe(t, 0, 8), i = fe(new s(c), e + c.e + 1, t), r = ze(i, !1, e + i.e + 1)), c.isNeg() && !c.isZero() ? "-" + r : r;
 };
 G.toFraction = function(e) {
   var t, r, i, c, s, u, a, h, d, w, y, B, _ = this, T = _.d, S = _.constructor;
   if (!T) return new S(_);
-  if (d = r = new S(1), i = h = new S(0), t = new S(i), s = t.e = Wn(T) - _.e - 1, u = s % de, t.d[0] = He(10, u < 0 ? de + u : u), e == null)
+  if (d = r = new S(1), i = h = new S(0), t = new S(i), s = t.e = Gn(T) - _.e - 1, u = s % de, t.d[0] = He(10, u < 0 ? de + u : u), e == null)
     e = s > 0 ? t : d;
   else {
     if (a = new S(e), !a.isInt() || a.lt(d)) throw Error(Je + a);
@@ -5294,7 +5294,7 @@ G.toNearest = function(e, t) {
     if (!r.d) return r;
     e = new i(1), t = i.rounding;
   } else {
-    if (e = new i(e), t === void 0 ? t = i.rounding : Ie(t, 0, 8), !r.d) return e.s ? r : e;
+    if (e = new i(e), t === void 0 ? t = i.rounding : Fe(t, 0, 8), !r.d) return e.s ? r : e;
     if (!e.d)
       return e.s && (e.s = r.s), e;
   }
@@ -5312,7 +5312,7 @@ G.toPower = G.pow = function(e) {
   if (a = new h(a), a.eq(1)) return a;
   if (i = h.precision, s = h.rounding, e.eq(1)) return fe(a, i, s);
   if (t = ke(e.e / de), t >= e.d.length - 1 && (r = d < 0 ? -d : d) <= ei)
-    return c = Gn(h, a, r, i), e.s < 0 ? new h(1).div(c) : fe(c, i, s);
+    return c = zn(h, a, r, i), e.s < 0 ? new h(1).div(c) : fe(c, i, s);
   if (u = a.s, u < 0) {
     if (t < e.d.length - 1) return new h(NaN);
     if ((e.d[t] & 1) == 0 && (u = 1), a.e == 0 && a.d[0] == 1 && a.d.length == 1)
@@ -5322,11 +5322,11 @@ G.toPower = G.pow = function(e) {
 };
 G.toPrecision = function(e, t) {
   var r, i = this, c = i.constructor;
-  return e === void 0 ? r = ze(i, i.e <= c.toExpNeg || i.e >= c.toExpPos) : (Ie(e, 1, Le), t === void 0 ? t = c.rounding : Ie(t, 0, 8), i = fe(new c(i), e, t), r = ze(i, e <= i.e || i.e <= c.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + r : r;
+  return e === void 0 ? r = ze(i, i.e <= c.toExpNeg || i.e >= c.toExpPos) : (Fe(e, 1, Le), t === void 0 ? t = c.rounding : Fe(t, 0, 8), i = fe(new c(i), e, t), r = ze(i, e <= i.e || i.e <= c.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + r : r;
 };
 G.toSignificantDigits = G.toSD = function(e, t) {
   var r = this, i = r.constructor;
-  return e === void 0 ? (e = i.precision, t = i.rounding) : (Ie(e, 1, Le), t === void 0 ? t = i.rounding : Ie(t, 0, 8)), fe(new i(r), e, t);
+  return e === void 0 ? (e = i.precision, t = i.rounding) : (Fe(e, 1, Le), t === void 0 ? t = i.rounding : Fe(t, 0, 8)), fe(new i(r), e, t);
 };
 G.toString = function() {
   var e = this, t = e.constructor, r = ze(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
@@ -5350,7 +5350,7 @@ function Oe(e) {
   for (; u % 10 === 0; ) u /= 10;
   return s + u;
 }
-function Ie(e, t, r) {
+function Fe(e, t, r) {
   if (e !== ~~e || e < t || e > r)
     throw Error(Je + e);
 }
@@ -5402,21 +5402,21 @@ var xe = /* @__PURE__ */ (function() {
     for (; !i[0] && i.length > 1; ) i.shift();
   }
   return function(i, c, s, u, a, h) {
-    var d, w, y, B, _, T, S, M, Q, D, $, te, J, I, P, Z, H, q, k, ee, C = i.constructor, F = i.s == c.s ? 1 : -1, m = i.d, N = c.d;
+    var d, w, y, B, _, T, S, M, Q, D, $, te, J, F, P, Z, H, q, k, ee, C = i.constructor, I = i.s == c.s ? 1 : -1, m = i.d, N = c.d;
     if (!m || !m[0] || !N || !N[0])
       return new C(
         // Return NaN if either NaN, or both Infinity or 0.
         !i.s || !c.s || (m ? N && m[0] == N[0] : !N) ? NaN : (
           // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
-          m && m[0] == 0 || !N ? F * 0 : F / 0
+          m && m[0] == 0 || !N ? I * 0 : I / 0
         )
       );
-    for (h ? (_ = 1, w = i.e - c.e) : (h = $e, _ = de, w = ke(i.e / _) - ke(c.e / _)), k = N.length, H = m.length, Q = new C(F), D = Q.d = [], y = 0; N[y] == (m[y] || 0); y++) ;
-    if (N[y] > (m[y] || 0) && w--, s == null ? (I = s = C.precision, u = C.rounding) : a ? I = s + (i.e - c.e) + 1 : I = s, I < 0)
+    for (h ? (_ = 1, w = i.e - c.e) : (h = $e, _ = de, w = ke(i.e / _) - ke(c.e / _)), k = N.length, H = m.length, Q = new C(I), D = Q.d = [], y = 0; N[y] == (m[y] || 0); y++) ;
+    if (N[y] > (m[y] || 0) && w--, s == null ? (F = s = C.precision, u = C.rounding) : a ? F = s + (i.e - c.e) + 1 : F = s, F < 0)
       D.push(1), T = !0;
     else {
-      if (I = I / _ + 2 | 0, y = 0, k == 1) {
-        for (B = 0, N = N[0], I++; (y < H || B) && I--; y++)
+      if (F = F / _ + 2 | 0, y = 0, k == 1) {
+        for (B = 0, N = N[0], F++; (y < H || B) && F--; y++)
           P = B * h + (m[y] || 0), D[y] = P / N | 0, B = P % N | 0;
         T = B || y < H;
       } else {
@@ -5424,13 +5424,13 @@ var xe = /* @__PURE__ */ (function() {
         ee = N.slice(), ee.unshift(0), q = N[0], N[1] >= h / 2 && ++q;
         do
           B = 0, d = t(N, $, k, te), d < 0 ? (J = $[0], k != te && (J = J * h + ($[1] || 0)), B = J / q | 0, B > 1 ? (B >= h && (B = h - 1), S = e(N, B, h), M = S.length, te = $.length, d = t(S, $, M, te), d == 1 && (B--, r(S, k < M ? ee : N, M, h))) : (B == 0 && (d = B = 1), S = N.slice()), M = S.length, M < te && S.unshift(0), r($, S, te, h), d == -1 && (te = $.length, d = t(N, $, k, te), d < 1 && (B++, r($, k < te ? ee : N, te, h))), te = $.length) : d === 0 && (B++, $ = [0]), D[y++] = B, d && $[0] ? $[te++] = m[Z] || 0 : ($ = [m[Z]], te = 1);
-        while ((Z++ < H || $[0] !== void 0) && I--);
+        while ((Z++ < H || $[0] !== void 0) && F--);
         T = $[0] !== void 0;
       }
       D[0] || D.shift();
     }
     if (_ == 1)
-      Q.e = w, Mn = T;
+      Q.e = w, jn = T;
     else {
       for (y = 1, B = D[0]; B >= 10; B /= 10) y++;
       Q.e = y + w * _ - 1, fe(Q, a ? s + Q.e + 1 : s, u, T);
@@ -5474,7 +5474,7 @@ function fe(e, t, r, i) {
   return ge && (e.e > _.maxE ? (e.d = null, e.e = NaN) : e.e < _.minE && (e.e = 0, e.d = [0])), e;
 }
 function ze(e, t, r) {
-  if (!e.isFinite()) return Xn(e);
+  if (!e.isFinite()) return Yn(e);
   var i, c = e.e, s = Oe(e.d), u = s.length;
   return t ? (r && (i = r - u) > 0 ? s = s.charAt(0) + "." + s.slice(1) + Ye(i) : u > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (e.e < 0 ? "e" : "e+") + e.e) : c < 0 ? (s = "0." + Ye(-c - 1) + s, r && (i = r - u) > 0 && (s += Ye(i))) : c >= u ? (s += Ye(c + 1 - u), r && (i = r - c - 1) > 0 && (s = s + "." + Ye(i))) : ((i = c + 1) < u && (s = s.slice(0, i) + "." + s.slice(i)), r && (i = r - u) > 0 && (c + 1 === u && (s += "."), s += Ye(i))), s;
 }
@@ -5485,14 +5485,14 @@ function At(e, t) {
 }
 function _t(e, t, r) {
   if (t > ti)
-    throw ge = !0, r && (e.precision = r), Error(jn);
+    throw ge = !0, r && (e.precision = r), Error($n);
   return fe(new e(Bt), t, 1, !0);
 }
 function Ke(e, t, r) {
-  if (t > Wt) throw Error(jn);
+  if (t > Wt) throw Error($n);
   return fe(new e(xt), t, r, !0);
 }
-function Wn(e) {
+function Gn(e) {
   var t = e.length - 1, r = t * de + 1;
   if (t = e[t], t) {
     for (; t % 10 == 0; t /= 10) r--;
@@ -5504,7 +5504,7 @@ function Ye(e) {
   for (var t = ""; e--; ) t += "0";
   return t;
 }
-function Gn(e, t, r, i) {
+function zn(e, t, r, i) {
   var c, s = new e(1), u = Math.ceil(i / de + 4);
   for (ge = !1; ; ) {
     if (r % 2 && (s = s.times(t), On(s.d, u) && (c = !0)), r = ke(r / 2), r === 0) {
@@ -5518,7 +5518,7 @@ function Gn(e, t, r, i) {
 function Un(e) {
   return e.d[e.d.length - 1] & 1;
 }
-function zn(e, t, r) {
+function Xn(e, t, r) {
   for (var i, c, s = new e(t[0]), u = 0; ++u < t.length; ) {
     if (c = new e(t[u]), !c.s) {
       s = c;
@@ -5570,7 +5570,7 @@ function Qe(e, t) {
     h = d, c += 2;
   }
 }
-function Xn(e) {
+function Yn(e) {
   return String(e.s * e.s / 0);
 }
 function bt(e, t) {
@@ -5592,7 +5592,7 @@ function bt(e, t) {
 function ri(e, t) {
   var r, i, c, s, u, a, h, d, w;
   if (t.indexOf("_") > -1) {
-    if (t = t.replace(/(\d)_(?=\d)/g, "$1"), Kn.test(t)) return bt(e, t);
+    if (t = t.replace(/(\d)_(?=\d)/g, "$1"), Wn.test(t)) return bt(e, t);
   } else if (t === "Infinity" || t === "NaN")
     return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
   if (Lr.test(t))
@@ -5603,7 +5603,7 @@ function ri(e, t) {
     r = 8;
   else
     throw Error(Je + t);
-  for (s = t.search(/p/i), s > 0 ? (h = +t.slice(s + 1), t = t.substring(2, s)) : t = t.slice(2), s = t.indexOf("."), u = s >= 0, i = e.constructor, u && (t = t.replace(".", ""), a = t.length, s = a - s, c = Gn(i, new i(r), s, s * 2)), d = yt(t, r, $e), w = d.length - 1, s = w; d[s] === 0; --s) d.pop();
+  for (s = t.search(/p/i), s > 0 ? (h = +t.slice(s + 1), t = t.substring(2, s)) : t = t.slice(2), s = t.indexOf("."), u = s >= 0, i = e.constructor, u && (t = t.replace(".", ""), a = t.length, s = a - s, c = zn(i, new i(r), s, s * 2)), d = yt(t, r, $e), w = d.length - 1, s = w; d[s] === 0; --s) d.pop();
   return s < 0 ? new i(e.s * 0) : (e.e = At(d, w), e.d = d, ge = !1, u && (e = xe(e, c, a * 4)), h && (e = e.times(Math.abs(h) < 54 ? He(2, h) : et.pow(2, h))), ge = !0, e);
 }
 function ii(e, t) {
@@ -5630,7 +5630,7 @@ function Tt(e, t) {
   for (var r = e; --t; ) r *= e;
   return r;
 }
-function Yn(e, t) {
+function Qn(e, t) {
   var r, i = t.s < 0, c = Ke(e, e.precision, 1), s = c.times(0.5);
   if (t = t.abs(), t.lte(s))
     return Xe = i ? 4 : 1, t;
@@ -5645,14 +5645,14 @@ function Yn(e, t) {
 }
 function Qt(e, t, r, i) {
   var c, s, u, a, h, d, w, y, B, _ = e.constructor, T = r !== void 0;
-  if (T ? (Ie(r, 1, Le), i === void 0 ? i = _.rounding : Ie(i, 0, 8)) : (r = _.precision, i = _.rounding), !e.isFinite())
-    w = Xn(e);
+  if (T ? (Fe(r, 1, Le), i === void 0 ? i = _.rounding : Fe(i, 0, 8)) : (r = _.precision, i = _.rounding), !e.isFinite())
+    w = Yn(e);
   else {
     for (w = ze(e), u = w.indexOf("."), T ? (c = 2, t == 16 ? r = r * 4 - 3 : t == 8 && (r = r * 3 - 2)) : c = t, u >= 0 && (w = w.replace(".", ""), B = new _(1), B.e = w.length - u, B.d = yt(ze(B), 10, c), B.e = B.d.length), y = yt(w, 10, c), s = h = y.length; y[--h] == 0; ) y.pop();
     if (!y[0])
       w = T ? "0p+0" : "0";
     else {
-      if (u < 0 ? s-- : (e = new _(e), e.d = y, e.e = s, e = xe(e, B, r, i, 0, c), y = e.d, s = e.e, d = Mn), u = y[r], a = c / 2, d = d || y[r + 1] !== void 0, d = i < 4 ? (u !== void 0 || d) && (i === 0 || i === (e.s < 0 ? 3 : 2)) : u > a || u === a && (i === 4 || d || i === 6 && y[r - 1] & 1 || i === (e.s < 0 ? 8 : 7)), y.length = r, d)
+      if (u < 0 ? s-- : (e = new _(e), e.d = y, e.e = s, e = xe(e, B, r, i, 0, c), y = e.d, s = e.e, d = jn), u = y[r], a = c / 2, d = d || y[r + 1] !== void 0, d = i < 4 ? (u !== void 0 || d) && (i === 0 || i === (e.s < 0 ? 3 : 2)) : u > a || u === a && (i === 4 || d || i === 6 && y[r - 1] & 1 || i === (e.s < 0 ? 8 : 7)), y.length = r, d)
         for (; ++y[--r] > c - 1; )
           y[r] = 0, r || (++s, y.unshift(1));
       for (h = y.length; !y[h - 1]; --h) ;
@@ -5753,7 +5753,7 @@ function mi(e) {
         if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
           this[r] = !0;
         else
-          throw Error($n);
+          throw Error(Zn);
       else
         this[r] = !1;
     else
@@ -5766,7 +5766,7 @@ function yi(e) {
 function bi(e) {
   return new this(e).cosh();
 }
-function Qn(e) {
+function Jn(e) {
   var t, r, i;
   function c(s) {
     var u, a, h, d = this;
@@ -5792,12 +5792,12 @@ function Qn(e) {
       return bt(d, s.toString());
     }
     if (h === "string")
-      return (a = s.charCodeAt(0)) === 45 ? (s = s.slice(1), d.s = -1) : (a === 43 && (s = s.slice(1)), d.s = 1), Kn.test(s) ? bt(d, s) : ri(d, s);
+      return (a = s.charCodeAt(0)) === 45 ? (s = s.slice(1), d.s = -1) : (a === 43 && (s = s.slice(1)), d.s = 1), Wn.test(s) ? bt(d, s) : ri(d, s);
     if (h === "bigint")
       return s < 0 ? (s = -s, d.s = -1) : d.s = 1, bt(d, s.toString());
     throw Error(Je + s);
   }
-  if (c.prototype = G, c.ROUND_UP = 0, c.ROUND_DOWN = 1, c.ROUND_CEIL = 2, c.ROUND_FLOOR = 3, c.ROUND_HALF_UP = 4, c.ROUND_HALF_DOWN = 5, c.ROUND_HALF_EVEN = 6, c.ROUND_HALF_CEIL = 7, c.ROUND_HALF_FLOOR = 8, c.EUCLID = 9, c.config = c.set = mi, c.clone = Qn, c.isDecimal = qn, c.abs = oi, c.acos = si, c.acosh = ci, c.add = ai, c.asin = ui, c.asinh = fi, c.atan = li, c.atanh = di, c.atan2 = hi, c.cbrt = pi, c.ceil = gi, c.clamp = wi, c.cos = yi, c.cosh = bi, c.div = Ei, c.exp = Bi, c.floor = xi, c.hypot = _i, c.ln = vi, c.log = Ai, c.log10 = Si, c.log2 = Ti, c.max = Ni, c.min = Ri, c.mod = Hi, c.mul = Ui, c.pow = Oi, c.random = qi, c.round = Ci, c.sign = Pi, c.sin = ki, c.sinh = Fi, c.sqrt = Ii, c.sub = Vi, c.sum = Mi, c.tan = ji, c.tanh = $i, c.trunc = Zi, e === void 0 && (e = {}), e && e.defaults !== !0)
+  if (c.prototype = G, c.ROUND_UP = 0, c.ROUND_DOWN = 1, c.ROUND_CEIL = 2, c.ROUND_FLOOR = 3, c.ROUND_HALF_UP = 4, c.ROUND_HALF_DOWN = 5, c.ROUND_HALF_EVEN = 6, c.ROUND_HALF_CEIL = 7, c.ROUND_HALF_FLOOR = 8, c.EUCLID = 9, c.config = c.set = mi, c.clone = Jn, c.isDecimal = qn, c.abs = oi, c.acos = si, c.acosh = ci, c.add = ai, c.asin = ui, c.asinh = fi, c.atan = li, c.atanh = di, c.atan2 = hi, c.cbrt = pi, c.ceil = gi, c.clamp = wi, c.cos = yi, c.cosh = bi, c.div = Ei, c.exp = Bi, c.floor = xi, c.hypot = _i, c.ln = vi, c.log = Ai, c.log10 = Si, c.log2 = Ti, c.max = Ni, c.min = Ri, c.mod = Hi, c.mul = Ui, c.pow = Oi, c.random = qi, c.round = Ci, c.sign = Pi, c.sin = ki, c.sinh = Ii, c.sqrt = Fi, c.sub = Vi, c.sum = Mi, c.tan = ji, c.tanh = $i, c.trunc = Zi, e === void 0 && (e = {}), e && e.defaults !== !0)
     for (i = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], t = 0; t < i.length; ) e.hasOwnProperty(r = i[t++]) || (e[r] = this[r]);
   return c.config(e), c;
 }
@@ -5823,7 +5823,7 @@ function _i() {
   return ge = !0, r.sqrt();
 }
 function qn(e) {
-  return e instanceof et || e && e.toStringTag === Zn || !1;
+  return e instanceof et || e && e.toStringTag === Kn || !1;
 }
 function vi(e) {
   return new this(e).ln();
@@ -5838,10 +5838,10 @@ function Si(e) {
   return new this(e).log(10);
 }
 function Ni() {
-  return zn(this, arguments, -1);
+  return Xn(this, arguments, -1);
 }
 function Ri() {
-  return zn(this, arguments, 1);
+  return Xn(this, arguments, 1);
 }
 function Hi(e, t) {
   return new this(e).mod(t);
@@ -5854,7 +5854,7 @@ function Oi(e, t) {
 }
 function qi(e) {
   var t, r, i, c, s = 0, u = new this(1), a = [];
-  if (e === void 0 ? e = this.precision : Ie(e, 1, Le), i = Math.ceil(e / de), this.crypto)
+  if (e === void 0 ? e = this.precision : Fe(e, 1, Le), i = Math.ceil(e / de), this.crypto)
     if (crypto.getRandomValues)
       for (t = crypto.getRandomValues(new Uint32Array(i)); s < i; )
         c = t[s], c >= 429e7 ? t[s] = crypto.getRandomValues(new Uint32Array(1))[0] : a[s++] = c % 1e7;
@@ -5863,7 +5863,7 @@ function qi(e) {
         c = t[s] + (t[s + 1] << 8) + (t[s + 2] << 16) + ((t[s + 3] & 127) << 24), c >= 214e7 ? crypto.randomBytes(4).copy(t, s) : (a.push(c % 1e7), s += 4);
       s = i / 4;
     } else
-      throw Error($n);
+      throw Error(Zn);
   else for (; s < i; ) a[s++] = Math.random() * 1e7 | 0;
   for (i = a[--s], e %= de, i && e && (c = He(10, de - e), a[s] = (i / c | 0) * c); a[s] === 0; s--) a.pop();
   if (s < 0)
@@ -5884,10 +5884,10 @@ function Pi(e) {
 function ki(e) {
   return new this(e).sin();
 }
-function Fi(e) {
+function Ii(e) {
   return new this(e).sinh();
 }
-function Ii(e) {
+function Fi(e) {
   return new this(e).sqrt();
 }
 function Vi(e, t) {
@@ -5909,7 +5909,7 @@ function Zi(e) {
 }
 G[Symbol.for("nodejs.util.inspect.custom")] = G.toString;
 G[Symbol.toStringTag] = "Decimal";
-var et = G.constructor = Qn(Kt);
+var et = G.constructor = Jn(Kt);
 Bt = new et(Bt);
 xt = new et(xt);
 const Ki = ({ IDL: e }) => {
@@ -5987,7 +5987,7 @@ const Ki = ({ IDL: e }) => {
   }), J = e.Record({
     block_hash: e.Text,
     block_height: e.Nat32
-  }), I = e.Record({
+  }), F = e.Record({
     processing_results: e.Vec(e.Text),
     block_basic: J,
     txids: e.Vec(e.Text),
@@ -6030,7 +6030,7 @@ const Ki = ({ IDL: e }) => {
     Enabled: e.Null,
     Disabled: e.Null,
     AllowEmpty: e.Null
-  }), F = e.Record({
+  }), I = e.Record({
     last_block: e.Opt(J),
     pending_tx_count: e.Nat64,
     mempool_tx_fee_rate: ee,
@@ -6116,7 +6116,7 @@ const Ki = ({ IDL: e }) => {
     ),
     get_received_blocks: e.Func(
       [e.Opt(e.Bool)],
-      [e.Vec(I)],
+      [e.Vec(F)],
       ["query"]
     ),
     get_registered_exchanges: e.Func([], [e.Vec(Z)], ["query"]),
@@ -6126,7 +6126,7 @@ const Ki = ({ IDL: e }) => {
       ["query"]
     ),
     get_settings: e.Func([], [k], ["query"]),
-    get_status: e.Func([], [F], ["query"]),
+    get_status: e.Func([], [I], ["query"]),
     get_tx_for_outpoint: e.Func(
       [e.Text],
       [e.Opt(N)],
@@ -6198,7 +6198,7 @@ class Wi {
   constructor(t) {
     this.config = t;
     const r = t.network === Et.Testnet, i = r ? "https://xbt-testnet.gomaestro-api.org/v0" : "https://xbt-mainnet.gomaestro-api.org/v0";
-    this.maestro = new Nr({
+    this.maestro = new Rr({
       baseUrl: i,
       apiKey: t.maestroApiKey
     });
@@ -6459,7 +6459,7 @@ class Wi {
     );
   }
 }
-const Jn = or(null);
+const Ln = sr(null);
 function to({ children: e, config: t }) {
   if (!t)
     throw new Error("ReeProvider: config is required");
@@ -6500,10 +6500,10 @@ function to({ children: e, config: t }) {
     }),
     [s, r, c, u]
   );
-  return /* @__PURE__ */ ir(Jn.Provider, { value: a, children: e });
+  return /* @__PURE__ */ or(Ln.Provider, { value: a, children: e });
 }
 function De() {
-  const e = sr(Jn);
+  const e = cr(Ln);
   if (!e)
     throw new Error("useRee must be used within ReeProvider");
   return e;