@omnisat/lasereyes 0.0.111 → 0.0.113

package/dist/index.js

@@ -17,9 +17,9 @@ function kB(e, t) {
   }
   return Object.freeze(Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }));
 }
-let ab = Symbol("clean"), Qo = [], ls = 0;
+let a1 = Symbol("clean"), Qo = [], ls = 0;
 const Yh = 4;
-let sb = (e) => {
+let s1 = (e) => {
   let t = [], r = {
     get() {
       return r.lc || r.listen(() => {
@@ -67,7 +67,7 @@ let sb = (e) => {
     },
     value: e
   };
-  return process.env.NODE_ENV !== "production" && (r[ab] = () => {
+  return process.env.NODE_ENV !== "production" && (r[a1] = () => {
     t = [], r.lc = 0, r.off();
   }), r;
 };
@@ -96,8 +96,8 @@ let AB = (e, t, r, n) => (e.events = e.events || {}, e.events[r + Jh] || (e.even
       }
     }, _B);
   }, process.env.NODE_ENV !== "production") {
-    let i = e[ab];
-    e[ab] = () => {
+    let i = e[a1];
+    e[a1] = () => {
       for (let a of e.events[Ju]) a();
       e.events[Ju] = [], e.active = !1, i();
     };
@@ -117,7 +117,7 @@ function zE(e, t, r) {
   return r(e.value), n;
 }
 let q6 = (e = {}) => {
-  let t = sb(e);
+  let t = s1(e);
   return t.setKey = function(r, n) {
     let o = t.value;
     typeof n > "u" && r in t.value ? (t.value = { ...t.value }, delete t.value[r], t.notify(o, r)) : t.value[r] !== n && (t.value = {
@@ -126,7 +126,7 @@ let q6 = (e = {}) => {
     }, t.notify(o, r));
   }, t;
 };
-const Vc = "oyl", uc = "unisat", Pa = "xverse", dl = "phantom", Gc = "leather", ac = "magic-eden", hl = "okx", pl = "wizz", Dc = "orange", $B = "op_net", nd = "p2tr", TB = "p2pkh", IB = "p2sh-p2wpkh", cb = "p2wpkh", q1e = "p2psh", PB = "p2wsh", M6 = "p2sh", M1e = {
+const Vc = "oyl", uc = "unisat", Pa = "xverse", dl = "phantom", Gc = "leather", ac = "magic-eden", hl = "okx", pl = "wizz", Dc = "orange", $B = "op_net", nd = "p2tr", TB = "p2pkh", IB = "p2sh-p2wpkh", c1 = "p2wpkh", qbe = "p2psh", PB = "p2wsh", M6 = "p2sh", Mbe = {
   oyl: {
     name: Vc,
     icon: "data:image/svg+xml,%3Csvg%20width%3D%2296%22%20height%3D%2216%22%20fill%3D%22none%22%20xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg%22%3E%3Cpath%20d%3D%22M17.27.318c2.947%200%205.72.26%208.32.78%202.6.507%204.714%201.307%206.34%202.4%201.64%201.094%202.46%202.467%202.46%204.12%200%201.654-.82%203.047-2.46%204.18-1.64%201.12-3.766%201.954-6.38%202.5-2.6.547-5.36.82-8.28.82-2.946%200-5.72-.253-8.32-.76-2.6-.52-4.72-1.326-6.36-2.42C.964%2010.845.15%209.472.15%207.818c0-1.653.82-3.04%202.46-4.16%201.64-1.133%203.76-1.973%206.36-2.52%202.614-.546%205.38-.82%208.3-.82Zm.04%2011.96c1.4%200%202.8-.146%204.2-.44%201.414-.293%202.6-.78%203.56-1.46.96-.68%201.44-1.566%201.44-2.66%200-1.093-.48-1.98-1.44-2.66-.96-.68-2.146-1.166-3.56-1.46-1.4-.293-2.8-.44-4.2-.44h-.08c-1.4%200-2.806.147-4.22.44-1.4.294-2.58.78-3.54%201.46-.96.68-1.44%201.567-1.44%202.66%200%201.094.48%201.98%201.44%202.66.96.68%202.14%201.167%203.54%201.46%201.414.294%202.82.44%204.22.44h.08ZM61.293.758c.08-.026.14-.04.18-.04h8.24c.12%200%20.214.04.28.12.08.08.12.174.12.28%200%20.147-.066.26-.2.34l-14%207.7c-.133.067-.2.18-.2.34v4.82c0%20.107-.04.2-.12.28a.384.384%200%200%201-.28.12h-6.94c-.106%200-.2-.04-.28-.12a.384.384%200%200%201-.12-.28v-4.82c0-.16-.066-.273-.2-.34l-13.98-7.7a.376.376%200%200%201-.2-.34c0-.106.034-.2.1-.28.067-.08.16-.12.28-.12h8.24c.054%200%20.12.014.2.04l9.24%205.1c.08.027.147.04.2.04.04%200%20.1-.013.18-.04l9.26-5.1Zm11.232.36c0-.106.033-.2.1-.28.08-.08.173-.12.28-.12h6.84c.106%200%20.193.04.26.12.08.08.12.174.12.28v10.32c0%20.107.04.2.12.28.08.08.173.12.28.12h14.46c.106%200%20.193.04.26.12.08.08.12.174.12.28v2.08c0%20.107-.04.2-.12.28a.322.322%200%200%201-.26.12h-22.08c-.107%200-.2-.04-.28-.12a.424.424%200%200%201-.1-.28v-13.2Z%22%20fill%3D%22%23fff%22%2F%3E%3C%2Fsvg%3E",
@@ -809,11 +809,11 @@ function zg(e, t) {
     }
   };
 }
-function ub(e, ...t) {
+function u1(e, ...t) {
   const r = {
     kind: "schema",
     type: "nullable",
-    reference: ub,
+    reference: u1,
     expects: `(${e.expects} | null)`,
     async: !1,
     wrapped: e,
@@ -3049,7 +3049,7 @@ const id = {};
 function bk(e) {
   e ? e !== id.eccLib && (RU(e), id.eccLib = e) : id.eccLib = e;
 }
-function lb() {
+function l1() {
   if (!id.eccLib)
     throw new Error(
       "No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance"
@@ -3362,7 +3362,7 @@ let qn = class kk {
   }
 };
 const xk = 192, JU = 128, QU = (e) => "left" in e && "right" in e;
-function fb(e, t) {
+function f1(e, t) {
   if (e.length < 33)
     throw new TypeError(
       `The control-block length is too small. Got ${e.length}, expected min 33.`
@@ -3371,17 +3371,17 @@ function fb(e, t) {
   let n = t;
   for (let o = 0; o < r; o++) {
     const i = e.slice(33 + 32 * o, 65 + 32 * o);
-    ge(n, i) < 0 ? n = hb(n, i) : n = hb(i, n);
+    ge(n, i) < 0 ? n = h1(n, i) : n = h1(i, n);
   }
   return n;
 }
-function db(e) {
+function d1(e) {
   if (vv(e)) return { hash: za(e) };
-  const t = [db(e[0]), db(e[1])];
+  const t = [d1(e[0]), d1(e[1])];
   t.sort((o, i) => ge(o.hash, i.hash));
   const [r, n] = t;
   return {
-    hash: hb(r.hash, n.hash),
+    hash: h1(r.hash, n.hash),
     left: r,
     right: n
   };
@@ -3410,13 +3410,13 @@ function eC(e, t) {
 }
 function np(e, t) {
   if (!(e instanceof Uint8Array) || e.length !== 32 || t && t.length !== 32) return null;
-  const r = eC(e, t), n = lb().xOnlyPointAddTweak(e, r);
+  const r = eC(e, t), n = l1().xOnlyPointAddTweak(e, r);
   return !n || n.xOnlyPubkey === null ? null : {
     parity: n.parity,
     x: Uint8Array.from(n.xOnlyPubkey)
   };
 }
-function hb(e, t) {
+function h1(e, t) {
   return Hg("TapBranch", pr([e, t]));
 }
 function tC(e) {
@@ -3463,7 +3463,7 @@ function hh(e, t) {
     if (!(!e.witness || !e.witness.length))
       return e.witness.length >= 2 && e.witness[e.witness.length - 1][0] === rC ? e.witness.slice(0, -1) : e.witness.slice();
   }), o = Ko(() => {
-    if (e.scriptTree) return db(e.scriptTree);
+    if (e.scriptTree) return d1(e.scriptTree);
     if (e.hash) return { hash: e.hash };
   }), i = e.network || Xo, a = { name: "p2tr", network: i };
   if (Re(a, "address", () => {
@@ -3476,7 +3476,7 @@ function hh(e, t) {
     const c = n();
     if (c && c.length > 1) {
       const l = c[c.length - 1], u = l[0] & Hp, f = c[c.length - 2], h = za({ output: f, version: u });
-      return fb(l, h);
+      return f1(l, h);
     }
     return null;
   }), Re(a, "output", () => {
@@ -3557,7 +3557,7 @@ function hh(e, t) {
         throw new TypeError("Pubkey mismatch");
       s = u.x;
     }
-    if (s && s.length && !lb().isXOnlyPoint(s))
+    if (s && s.length && !l1().isXOnlyPoint(s))
       throw new TypeError("Invalid pubkey for p2tr");
     const c = o();
     if (e.hash && c && ge(e.hash, c.hash) !== 0)
@@ -3605,9 +3605,9 @@ function hh(e, t) {
         const h = u.slice(1, 33);
         if (e.internalPubkey && ge(e.internalPubkey, h) !== 0)
           throw new TypeError("Internal pubkey mismatch");
-        if (!lb().isXOnlyPoint(h))
+        if (!l1().isXOnlyPoint(h))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
-        const g = u[0] & Hp, y = l[l.length - 2], m = za({ output: y, version: g }), w = fb(u, m), v = np(h, w);
+        const g = u[0] & Hp, y = l[l.length - 2], m = za({ output: y, version: g }), w = f1(u, m), v = np(h, w);
         if (!v)
           throw new TypeError("Invalid outputKey for p2tr witness");
         if (s.length && ge(s, v.x) !== 0)
@@ -3794,8 +3794,8 @@ const ti = class Wt {
       Fi([
         DE,
         Sa,
-        ub(o0(Sa)),
-        ub(o0(Ht))
+        u1(o0(Sa)),
+        u1(o0(Ht))
       ]),
       [t, r, n, o]
     ), n == null && (n = Wt.DEFAULT_SEQUENCE), this.ins.push({
@@ -4950,7 +4950,7 @@ function zk(e, { globalMapKeyVals: t, inputKeyVals: r, outputKeyVals: n }) {
   return { globalMap: o, inputs: c, outputs: l };
 }
 function DN({ globalMap: e, inputs: t, outputs: r }) {
-  const { globalKeyVals: n, inputKeyVals: o, outputKeyVals: i } = pb({
+  const { globalKeyVals: n, inputKeyVals: o, outputKeyVals: i } = p1({
     globalMap: e,
     inputs: t,
     outputs: r
@@ -4976,7 +4976,7 @@ function Hy(e, t) {
   }, []), o = e.unknownKeyVals ? e.unknownKeyVals.filter((i) => !r.has(Ge(i.key))) : [];
   return n.concat(o).sort(KN);
 }
-function pb({ globalMap: e, inputs: t, outputs: r }) {
+function p1({ globalMap: e, inputs: t, outputs: r }) {
   return {
     globalKeyVals: Hy(e, Cv),
     inputKeyVals: t.map((n) => Hy(n, Hr)),
@@ -4984,7 +4984,7 @@ function pb({ globalMap: e, inputs: t, outputs: r }) {
   };
 }
 function qN(e) {
-  const t = e[0], r = pb(t), n = e.slice(1);
+  const t = e[0], r = p1(t), n = e.slice(1);
   if (n.length === 0) throw new Error("Combine: Nothing to combine");
   const o = a4(t);
   if (o === void 0)
@@ -4996,7 +4996,7 @@ function qN(e) {
       throw new Error(
         "Combine: One of the Psbts does not have the same transaction."
       );
-    const u = pb(c);
+    const u = p1(c);
     el(u.globalKeyVals).forEach(
       Dy(
         i,
@@ -5362,10 +5362,10 @@ function aj(e) {
 function sj(e) {
   let t;
   for (const r of e)
-    if (t = gb(r, t), !t) throw new Error("No room left to insert tapleaf in tree");
+    if (t = g1(r, t), !t) throw new Error("No room left to insert tapleaf in tree");
   return t;
 }
-function gb(e, t, r = 0) {
+function g1(e, t, r = 0) {
   if (r > JU) throw new Error("Max taptree depth exceeded.");
   if (e.depth === r)
     return t ? void 0 : {
@@ -5373,9 +5373,9 @@ function gb(e, t, r = 0) {
       version: e.leafVersion
     };
   if (vv(t)) return;
-  const n = gb(e, t && t[0], r + 1);
+  const n = g1(e, t && t[0], r + 1);
   if (n) return [n, t && t[1]];
-  const o = gb(e, t && t[1], r + 1);
+  const o = g1(e, t && t[1], r + 1);
   if (o) return [t && t[0], o];
 }
 function cj(e, t, r) {
@@ -5415,7 +5415,7 @@ function Fy(e, t) {
   const r = za({
     output: e.script,
     version: e.leafVersion
-  }), n = fb(e.controlBlock, r);
+  }), n = f1(e.controlBlock, r);
   return ge(n, t) === 0;
 }
 function fj(e, t) {
@@ -5471,7 +5471,7 @@ const gj = {
   maximumFeeRate: 5e3
   // satoshi per byte
 };
-let Wr = class mb {
+let Wr = class m1 {
   constructor(t = {}, r = new c4(new Mk())) {
     $e(this, "data"), $e(this, "__CACHE"), $e(this, "opts"), this.data = r, this.opts = Object.assign({}, gj, t), this.__CACHE = {
       __NON_WITNESS_UTXO_TX_CACHE: [],
@@ -5503,7 +5503,7 @@ let Wr = class mb {
     return this.fromBuffer(n, r);
   }
   static fromBuffer(t, r = {}) {
-    const n = c4.fromBuffer(t, mj), o = new mb(r, n);
+    const n = c4.fromBuffer(t, mj), o = new m1(r, n);
     return Ej(o.__CACHE.__TX, o.__CACHE), o;
   }
   get inputCount() {
@@ -5546,7 +5546,7 @@ let Wr = class mb {
     return this.data.combine(...t.map((r) => r.data)), this;
   }
   clone() {
-    const t = mb.fromBuffer(this.data.toBuffer());
+    const t = m1.fromBuffer(this.data.toBuffer());
     return t.opts = JSON.parse(JSON.stringify(this.opts)), t;
   }
   setMaximumFeeRate(t) {
@@ -5583,7 +5583,7 @@ let Wr = class mb {
     const n = r.__TX.ins[r.__TX.ins.length - 1];
     Gk(r, n);
     const o = this.data.inputs.length - 1, i = this.data.inputs[o];
-    return i.nonWitnessUtxo && bb(this.__CACHE, i, o), r.__FEE = void 0, r.__FEE_RATE = void 0, r.__EXTRACTED_TX = void 0, this;
+    return i.nonWitnessUtxo && b1(this.__CACHE, i, o), r.__FEE = void 0, r.__FEE_RATE = void 0, r.__EXTRACTED_TX = void 0, this;
   }
   addOutputs(t) {
     return t.forEach((r) => this.addOutput(r)), this;
@@ -5752,7 +5752,7 @@ let Wr = class mb {
     if (typeof r != "function")
       throw new Error("Need validator function to validate signatures");
     n = n && ad(n);
-    const s = n ? yb(
+    const s = n ? y1(
       t,
       o,
       this.data.inputs,
@@ -6032,7 +6032,7 @@ let Wr = class mb {
       throw new Error(
         `Need Schnorr Signer to sign taproot input #${t}.`
       );
-    const a = yb(
+    const a = y1(
       t,
       r,
       this.data.inputs,
@@ -6064,7 +6064,7 @@ let Wr = class mb {
       this.data.inputs[t],
       r,
       "updateInput"
-    ), this.data.updateInput(t, r), r.nonWitnessUtxo && bb(
+    ), this.data.updateInput(t, r), r.nonWitnessUtxo && b1(
       this.__CACHE,
       this.data.inputs[t],
       t
@@ -6333,7 +6333,7 @@ function Aj(e, t, r, n) {
     o.push(...i);
   }
   return o.map(
-    (i) => yb(e, t, r, i, n)
+    (i) => y1(e, t, r, i, n)
   ).flat();
 }
 function Xk(e, t, r) {
@@ -6343,7 +6343,7 @@ function Xk(e, t, r) {
 function w4(e) {
   return e.length === 64 ? e : e.subarray(0, 64);
 }
-function yb(e, t, r, n, o, i, a) {
+function y1(e, t, r, n, o, i, a) {
   const s = o.__TX, c = t.sighashType || _r.SIGHASH_DEFAULT;
   Yk(c, a);
   const l = r.map(
@@ -6503,7 +6503,7 @@ function Tj(e) {
   }
   return t;
 }
-function bb(e, t, r) {
+function b1(e, t, r) {
   e.__NON_WITNESS_UTXO_BUF_CACHE[r] = t.nonWitnessUtxo;
   const n = _r.fromBuffer(t.nonWitnessUtxo);
   e.__NON_WITNESS_UTXO_TX_CACHE[r] = n;
@@ -6544,7 +6544,7 @@ function Qk(e, t, r, n) {
 }
 function qg(e, t, r) {
   const n = e.__NON_WITNESS_UTXO_TX_CACHE;
-  return n[r] || bb(e, t, r), n[r];
+  return n[r] || b1(e, t, r), n[r];
 }
 function ex(e, t, r) {
   const { script: n } = jv(e, t, r);
@@ -6870,7 +6870,7 @@ function mh(e, t, r = {}) {
 const qj = () => {
   throw new Error("not implemented");
 };
-function wb(e) {
+function w1(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (r, ...n) => {
     const o = t.get(r);
@@ -6900,7 +6900,7 @@ const Mj = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   hexToNumber: Lv,
   inRange: Vg,
   isBytes: yu,
-  memoized: wb,
+  memoized: w1,
   notImplemented: qj,
   numberToBytesBE: Nl,
   numberToBytesLE: Dv,
@@ -6910,7 +6910,7 @@ const Mj = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateObject: mh
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const nn = BigInt(0), $r = BigInt(1), Kc = BigInt(2), Fj = BigInt(3), vb = BigInt(4), x4 = BigInt(5), A4 = BigInt(8);
+const nn = BigInt(0), $r = BigInt(1), Kc = BigInt(2), Fj = BigInt(3), v1 = BigInt(4), x4 = BigInt(5), A4 = BigInt(8);
 BigInt(9);
 BigInt(16);
 function Sn(e, t) {
@@ -6933,7 +6933,7 @@ function Uo(e, t, r) {
     n *= n, n %= r;
   return n;
 }
-function Eb(e, t) {
+function E1(e, t) {
   if (e === nn || t <= nn)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let r = Sn(e, t), n = t, o = nn, i = $r;
@@ -6953,7 +6953,7 @@ function Gj(e) {
   for (o = Kc; o < e && Vj(o, t, e) !== e - $r; o++)
     ;
   if (n === 1) {
-    const a = (e + $r) / vb;
+    const a = (e + $r) / v1;
     return function(s, c) {
       const l = s.pow(c, a);
       if (!s.eql(s.sqr(l), c))
@@ -6979,8 +6979,8 @@ function Gj(e) {
   };
 }
 function Zj(e) {
-  if (e % vb === Fj) {
-    const t = (e + $r) / vb;
+  if (e % v1 === Fj) {
+    const t = (e + $r) / v1;
     return function(r, n) {
       const o = r.pow(n, t);
       if (!r.eql(r.sqr(o), n))
@@ -7075,13 +7075,13 @@ function qv(e, t, r = !1, n = {}) {
     sub: (c, l) => Sn(c - l, e),
     mul: (c, l) => Sn(c * l, e),
     pow: (c, l) => Yj(s, c, l),
-    div: (c, l) => Sn(c * Eb(l, e), e),
+    div: (c, l) => Sn(c * E1(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (c) => c * c,
     addN: (c, l) => c + l,
     subN: (c, l) => c - l,
     mulN: (c, l) => c * l,
-    inv: (c) => Eb(c, e),
+    inv: (c) => E1(c, e),
     sqrt: n.sqrt || ((c) => a(s, c)),
     invertBatch: (c) => Jj(s, c),
     // TODO: do we really need constant cmov?
@@ -7392,7 +7392,7 @@ function az(e) {
     if (!(m instanceof h))
       throw new Error("ProjectivePoint expected");
   }
-  const u = wb((m, w) => {
+  const u = w1((m, w) => {
     const { px: v, py: x, pz: E } = m;
     if (r.eql(E, r.ONE))
       return { x: v, y: x };
@@ -7404,7 +7404,7 @@ function az(e) {
     if (!r.eql(j, r.ONE))
       throw new Error("invZ was invalid");
     return { x: O, y: T };
-  }), f = wb((m) => {
+  }), f = w1((m) => {
     if (m.is0()) {
       if (t.allowInfinityPoint && !r.is0(m.py))
         return;
@@ -7639,7 +7639,7 @@ function cz(e) {
     return Sn(H, n);
   }
   function s(H) {
-    return Eb(H, n);
+    return E1(H, n);
   }
   const { ProjectivePoint: c, normPrivateKeyToScalar: l, weierstrassEquation: u, isWithinCurveOrder: f } = az({
     ...t,
@@ -7876,19 +7876,19 @@ function lz(e, t) {
   return Object.freeze({ ...r(t), create: r });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const lx = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), T4 = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), fz = BigInt(1), kb = BigInt(2), I4 = (e, t) => (e + t / kb) / t;
+const lx = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), T4 = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), fz = BigInt(1), k1 = BigInt(2), I4 = (e, t) => (e + t / k1) / t;
 function dz(e) {
-  const t = lx, r = BigInt(3), n = BigInt(6), o = BigInt(11), i = BigInt(22), a = BigInt(23), s = BigInt(44), c = BigInt(88), l = e * e * e % t, u = l * l * e % t, f = Uo(u, r, t) * u % t, h = Uo(f, r, t) * u % t, g = Uo(h, kb, t) * l % t, y = Uo(g, o, t) * g % t, m = Uo(y, i, t) * y % t, w = Uo(m, s, t) * m % t, v = Uo(w, c, t) * w % t, x = Uo(v, s, t) * m % t, E = Uo(x, r, t) * u % t, S = Uo(E, a, t) * y % t, O = Uo(S, n, t) * l % t, T = Uo(O, kb, t);
-  if (!xb.eql(xb.sqr(T), e))
+  const t = lx, r = BigInt(3), n = BigInt(6), o = BigInt(11), i = BigInt(22), a = BigInt(23), s = BigInt(44), c = BigInt(88), l = e * e * e % t, u = l * l * e % t, f = Uo(u, r, t) * u % t, h = Uo(f, r, t) * u % t, g = Uo(h, k1, t) * l % t, y = Uo(g, o, t) * g % t, m = Uo(y, i, t) * y % t, w = Uo(m, s, t) * m % t, v = Uo(w, c, t) * w % t, x = Uo(v, s, t) * m % t, E = Uo(x, r, t) * u % t, S = Uo(E, a, t) * y % t, O = Uo(S, n, t) * l % t, T = Uo(O, k1, t);
+  if (!x1.eql(x1.sqr(T), e))
     throw new Error("Cannot find square root");
   return T;
 }
-const xb = qv(lx, void 0, void 0, { sqrt: dz }), bu = lz({
+const x1 = qv(lx, void 0, void 0, { sqrt: dz }), bu = lz({
   a: BigInt(0),
   // equation params: a, b
   b: BigInt(7),
   // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
-  Fp: xb,
+  Fp: x1,
   // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n
   n: T4,
   // Curve order, total count of valid points in the field
@@ -8125,7 +8125,7 @@ let _z = class extends Ez {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Ab = /* @__PURE__ */ wz(() => new _z());
+const A1 = /* @__PURE__ */ wz(() => new _z());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 // @__NO_SIDE_EFFECTS__
 function yh(...e) {
@@ -8247,7 +8247,7 @@ function O4(e, t, r) {
 }
 const hx = /* @__NO_SIDE_EFFECTS__ */ (e, t) => t ? /* @__PURE__ */ hx(t, e % t) : e, h0 = /* @__NO_SIDE_EFFECTS__ */ (e, t) => e + (t - /* @__PURE__ */ hx(e, t));
 // @__NO_SIDE_EFFECTS__
-function _b(e, t, r, n) {
+function _1(e, t, r, n) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -8298,12 +8298,12 @@ function Mv(e, t = !1) {
     encode: (r) => {
       if (!(r instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return /* @__PURE__ */ _b(Array.from(r), 8, e, !t);
+      return /* @__PURE__ */ _1(Array.from(r), 8, e, !t);
     },
     decode: (r) => {
       if (!Array.isArray(r) || r.length && typeof r[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(/* @__PURE__ */ _b(r, e, 8, t));
+      return Uint8Array.from(/* @__PURE__ */ _1(r, e, 8, t));
     }
   };
 }
@@ -8340,7 +8340,7 @@ function $z(e, t) {
     }
   };
 }
-const U4 = /* @__PURE__ */ yh(/* @__PURE__ */ Mv(6), /* @__PURE__ */ Gg("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ dx(6), /* @__PURE__ */ Zg("")), C4 = /* @__PURE__ */ yh(/* @__PURE__ */ Mv(6), /* @__PURE__ */ Gg("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), /* @__PURE__ */ dx(6), /* @__PURE__ */ Zg("")), Tz = (e) => /* @__PURE__ */ yh(/* @__PURE__ */ Sz(58), /* @__PURE__ */ Gg(e), /* @__PURE__ */ Zg("")), Iz = /* @__PURE__ */ Tz("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), N4 = (e) => /* @__PURE__ */ yh(/* @__PURE__ */ $z(4, (t) => e(e(t))), Iz), Sb = /* @__PURE__ */ yh(/* @__PURE__ */ Gg("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ Zg("")), j4 = [996825010, 642813549, 513874426, 1027748829, 705979059];
+const U4 = /* @__PURE__ */ yh(/* @__PURE__ */ Mv(6), /* @__PURE__ */ Gg("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ dx(6), /* @__PURE__ */ Zg("")), C4 = /* @__PURE__ */ yh(/* @__PURE__ */ Mv(6), /* @__PURE__ */ Gg("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), /* @__PURE__ */ dx(6), /* @__PURE__ */ Zg("")), Tz = (e) => /* @__PURE__ */ yh(/* @__PURE__ */ Sz(58), /* @__PURE__ */ Gg(e), /* @__PURE__ */ Zg("")), Iz = /* @__PURE__ */ Tz("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), N4 = (e) => /* @__PURE__ */ yh(/* @__PURE__ */ $z(4, (t) => e(e(t))), Iz), S1 = /* @__PURE__ */ yh(/* @__PURE__ */ Gg("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ Zg("")), j4 = [996825010, 642813549, 513874426, 1027748829, 705979059];
 // @__NO_SIDE_EFFECTS__
 function Hf(e) {
   const t = e >> 25;
@@ -8366,7 +8366,7 @@ function z4(e, t, r = 1) {
     o = /* @__PURE__ */ Hf(o) ^ i;
   for (let i = 0; i < 6; i++)
     o = /* @__PURE__ */ Hf(o);
-  return o ^= r, Sb.encode(/* @__PURE__ */ _b([o % 2 ** 30], 30, 5, !1));
+  return o ^= r, S1.encode(/* @__PURE__ */ _1([o % 2 ** 30], 30, 5, !1));
 }
 // @__NO_SIDE_EFFECTS__
 function px(e) {
@@ -8380,7 +8380,7 @@ function px(e) {
     if (h !== !1 && g > h)
       throw new TypeError(`Length ${g} exceeds limit ${h}`);
     const y = u.toLowerCase(), m = /* @__PURE__ */ z4(y, f, t);
-    return `${y}1${Sb.encode(f)}${m}`;
+    return `${y}1${S1.encode(f)}${m}`;
   }
   function s(u, f = 90) {
     if (typeof u != "string")
@@ -8397,7 +8397,7 @@ function px(e) {
     const y = u.slice(0, g), m = u.slice(g + 1);
     if (m.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const w = Sb.decode(m).slice(0, -6), v = /* @__PURE__ */ z4(y, w, t);
+    const w = S1.decode(m).slice(0, -6), v = /* @__PURE__ */ z4(y, w, t);
     if (!m.endsWith(v))
       throw new Error(`Invalid checksum in ${u}: expected "${v}"`);
     return { prefix: y, words: w };
@@ -8411,8 +8411,8 @@ function px(e) {
 }
 const ap = /* @__PURE__ */ px("bech32"), sp = /* @__PURE__ */ px("bech32m"), Gi = {
   b58chk: {
-    encode: (e) => N4(Ab).encode(e),
-    decode: (e) => N4(Ab).decode(e)
+    encode: (e) => N4(A1).encode(e),
+    decode: (e) => N4(A1).decode(e)
   },
   base64: {
     encode: (e) => U4.encode(e),
@@ -8704,7 +8704,7 @@ let Vt = (Ye = class extends Uint8Array {
     return Lz(this);
   }
   to_hash() {
-    const e = Ab(this);
+    const e = A1(this);
     return new Ye(e);
   }
   to_json(e) {
@@ -9057,9 +9057,9 @@ function kR(e) {
     return Vt.bytes(e, 32);
   throw new TypeError(`Unknown type: ${typeof e}`);
 }
-const cp = /* @__PURE__ */ BigInt(2 ** 32 - 1), $b = /* @__PURE__ */ BigInt(32);
+const cp = /* @__PURE__ */ BigInt(2 ** 32 - 1), $1 = /* @__PURE__ */ BigInt(32);
 function vx(e, t = !1) {
-  return t ? { h: Number(e & cp), l: Number(e >> $b & cp) } : { h: Number(e >> $b & cp) | 0, l: Number(e & cp) | 0 };
+  return t ? { h: Number(e & cp), l: Number(e >> $1 & cp) } : { h: Number(e >> $1 & cp) | 0, l: Number(e & cp) | 0 };
 }
 function xR(e, t = !1) {
   let r = new Uint32Array(e.length), n = new Uint32Array(e.length);
@@ -9069,7 +9069,7 @@ function xR(e, t = !1) {
   }
   return [r, n];
 }
-const AR = (e, t) => BigInt(e >>> 0) << $b | BigInt(t >>> 0), _R = (e, t, r) => e >>> r, SR = (e, t, r) => e << 32 - r | t >>> r, $R = (e, t, r) => e >>> r | t << 32 - r, TR = (e, t, r) => e << 32 - r | t >>> r, IR = (e, t, r) => e << 64 - r | t >>> r - 32, PR = (e, t, r) => e >>> r - 32 | t << 64 - r, OR = (e, t) => t, BR = (e, t) => e, UR = (e, t, r) => e << r | t >>> 32 - r, CR = (e, t, r) => t << r | e >>> 32 - r, NR = (e, t, r) => t << r - 32 | e >>> 64 - r, jR = (e, t, r) => e << r - 32 | t >>> 64 - r;
+const AR = (e, t) => BigInt(e >>> 0) << $1 | BigInt(t >>> 0), _R = (e, t, r) => e >>> r, SR = (e, t, r) => e << 32 - r | t >>> r, $R = (e, t, r) => e >>> r | t << 32 - r, TR = (e, t, r) => e << 32 - r | t >>> r, IR = (e, t, r) => e << 64 - r | t >>> r - 32, PR = (e, t, r) => e >>> r - 32 | t << 64 - r, OR = (e, t) => t, BR = (e, t) => e, UR = (e, t, r) => e << r | t >>> 32 - r, CR = (e, t, r) => t << r | e >>> 32 - r, NR = (e, t, r) => t << r - 32 | e >>> 64 - r, jR = (e, t, r) => e << r - 32 | t >>> 64 - r;
 function zR(e, t, r, n) {
   const o = (t >>> 0) + (n >>> 0);
   return { h: e + r + (o / 2 ** 32 | 0) | 0, l: o | 0 };
@@ -9225,7 +9225,7 @@ function Ex(e, t = !1) {
   return t ? r.x : r.buff;
 }
 bu.ProjectivePoint;
-function Tb(e) {
+function T1(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -9242,7 +9242,7 @@ function kx(e, ...t) {
 function XR(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Tb(e.outputLen), Tb(e.blockLen);
+  T1(e.outputLen), T1(e.blockLen);
 }
 function YR(e, t = !0) {
   if (e.destroyed)
@@ -9257,7 +9257,7 @@ function JR(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
 const QR = {
-  number: Tb,
+  number: T1,
   bool: WR,
   bytes: kx,
   hash: XR,
@@ -9266,7 +9266,7 @@ const QR = {
 };
 var Qy = QR;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const e1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ui = (e, t) => e << 32 - t | e >>> t, eL = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const eb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ui = (e, t) => e << 32 - t | e >>> t, eL = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!eL)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -9298,7 +9298,7 @@ function nL(e, t, r, n) {
 }
 let oL = class extends rL {
   constructor(t, r, n, o) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = e1(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = eb(this.buffer);
   }
   update(t) {
     Qy.exists(this);
@@ -9308,7 +9308,7 @@ let oL = class extends rL {
     for (let a = 0; a < i; ) {
       const s = Math.min(o - this.pos, i - a);
       if (s === o) {
-        const c = e1(t);
+        const c = eb(t);
         for (; o <= i - a; a += o)
           this.process(c, a);
         continue;
@@ -9325,7 +9325,7 @@ let oL = class extends rL {
     for (let f = a; f < o; f++)
       r[f] = 0;
     nL(n, o - 8, BigInt(this.length * 8), i), this.process(n, 0);
-    const s = e1(t), c = this.outputLen;
+    const s = eb(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, u = this.get();
@@ -9458,7 +9458,7 @@ let _x = class extends oL {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 };
-const Ib = Ax(() => new _x());
+const I1 = Ax(() => new _x());
 Ax(() => new cL());
 function uL(e, t) {
   if (e.length > t)
@@ -9532,7 +9532,7 @@ function bL(e, t) {
   return new Uint8Array(i);
 }
 function Tx(e) {
-  return Ib(Ib(e));
+  return I1(I1(e));
 }
 function wL(e) {
   const t = Tx(e);
@@ -9787,7 +9787,7 @@ const HL = new TextEncoder(), DL = new TextDecoder();
 function Zv(e) {
   return HL.encode(e);
 }
-function t1(e) {
+function tb(e) {
   return DL.decode(e);
 }
 function KL(e, t) {
@@ -9893,18 +9893,18 @@ let X = ($t = class extends Uint8Array {
     return CL(t);
   }
   toHash() {
-    const e = Ib(this);
+    const e = I1(this);
     return new $t(e);
   }
   toJson() {
-    const e = t1(this);
+    const e = tb(this);
     return JSON.parse(e);
   }
   toBech32(e, t = 0) {
     return jx.encode(this, e, t);
   }
   toStr() {
-    return t1(this);
+    return tb(this);
   }
   toHex() {
     return ML(this);
@@ -9968,7 +9968,7 @@ let X = ($t = class extends Uint8Array {
       return $t.of(255, ...$t.num(e, 8, t));
     throw new Error(`Value is too large: ${e}`);
   }
-}, $t.num = GL, $t.big = WL, $t.bin = ZL, $t.raw = XL, $t.str = YL, $t.hex = JL, $t.bytes = QL, $t.json = eH, $t.base64 = tH, $t.b64url = rH, $t.bech32 = nH, $t.b58chk = oH, $t.encode = Zv, $t.decode = t1, $t);
+}, $t.num = GL, $t.big = WL, $t.bin = ZL, $t.raw = XL, $t.str = YL, $t.hex = JL, $t.bytes = QL, $t.json = eH, $t.base64 = tH, $t.b64url = rH, $t.bech32 = nH, $t.b58chk = oH, $t.encode = Zv, $t.decode = tb, $t);
 function GL(e, t, r) {
   return new X(e, t, r);
 }
@@ -10318,7 +10318,7 @@ const mH = {
   decode: Wv,
   fmt: mH
 };
-function Pb(e) {
+function P1(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -10335,7 +10335,7 @@ function Gx(e, ...t) {
 function bH(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Pb(e.outputLen), Pb(e.blockLen);
+  P1(e.outputLen), P1(e.blockLen);
 }
 function wH(e, t = !0) {
   if (e.destroyed)
@@ -10350,7 +10350,7 @@ function vH(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
 const EH = {
-  number: Pb,
+  number: P1,
   bool: yH,
   bytes: Gx,
   hash: bH,
@@ -10358,9 +10358,9 @@ const EH = {
   output: vH
 };
 var Zc = EH;
-const r1 = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const rb = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const n1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ci = (e, t) => e << 32 - t | e >>> t, kH = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const nb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ci = (e, t) => e << 32 - t | e >>> t, kH = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!kH)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -10397,8 +10397,8 @@ function Wx(e) {
   return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
 }
 function Xx(e = 32) {
-  if (r1 && typeof r1.getRandomValues == "function")
-    return r1.getRandomValues(new Uint8Array(e));
+  if (rb && typeof rb.getRandomValues == "function")
+    return rb.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function _H(e, t, r, n) {
@@ -10409,7 +10409,7 @@ function _H(e, t, r, n) {
 }
 let SH = class extends Zx {
   constructor(t, r, n, o) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = n1(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = nb(this.buffer);
   }
   update(t) {
     Zc.exists(this);
@@ -10419,7 +10419,7 @@ let SH = class extends Zx {
     for (let a = 0; a < i; ) {
       const s = Math.min(o - this.pos, i - a);
       if (s === o) {
-        const c = n1(t);
+        const c = nb(t);
         for (; o <= i - a; a += o)
           this.process(c, a);
         continue;
@@ -10436,7 +10436,7 @@ let SH = class extends Zx {
     for (let f = a; f < o; f++)
       r[f] = 0;
     _H(n, o - 8, BigInt(this.length * 8), i), this.process(n, 0);
-    const s = n1(t), c = this.outputLen;
+    const s = nb(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, u = this.get();
@@ -10658,7 +10658,7 @@ function jH(e) {
     ;
   return t;
 }
-const zH = (e, t) => e >> BigInt(t) & 1n, RH = (e, t, r) => e | (r ? Yv : OH) << BigInt(t), e2 = (e) => (BH << BigInt(e - 1)) - Yv, o1 = (e) => new Uint8Array(e), K4 = (e) => Uint8Array.from(e);
+const zH = (e, t) => e >> BigInt(t) & 1n, RH = (e, t, r) => e | (r ? Yv : OH) << BigInt(t), e2 = (e) => (BH << BigInt(e - 1)) - Yv, ob = (e) => new Uint8Array(e), K4 = (e) => Uint8Array.from(e);
 function e7(e, t, r) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -10666,10 +10666,10 @@ function e7(e, t, r) {
     throw new Error("qByteLen must be a number");
   if (typeof r != "function")
     throw new Error("hmacFn must be a function");
-  let n = o1(e), o = o1(e), i = 0;
+  let n = ob(e), o = ob(e), i = 0;
   const a = () => {
     n.fill(1), o.fill(0), i = 0;
-  }, s = (...u) => r(o, n, ...u), c = (u = o1()) => {
+  }, s = (...u) => r(o, n, ...u), c = (u = ob()) => {
     o = s(K4([0]), u), n = s(), u.length !== 0 && (o = s(K4([1]), u), n = s());
   }, l = () => {
     if (i++ >= 1e3)
@@ -10739,7 +10739,7 @@ var HH = /* @__PURE__ */ Object.freeze({
   validateObject: pf
 });
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const on = BigInt(0), Tr = BigInt(1), qc = BigInt(2), DH = BigInt(3), Ob = BigInt(4), q4 = BigInt(5), M4 = BigInt(8);
+const on = BigInt(0), Tr = BigInt(1), qc = BigInt(2), DH = BigInt(3), O1 = BigInt(4), q4 = BigInt(5), M4 = BigInt(8);
 BigInt(9);
 BigInt(16);
 function Fr(e, t) {
@@ -10762,7 +10762,7 @@ function Co(e, t, r) {
     n *= n, n %= r;
   return n;
 }
-function Bb(e, t) {
+function B1(e, t) {
   if (e === on || t <= on)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let r = Fr(e, t), n = t, o = on, i = Tr;
@@ -10782,7 +10782,7 @@ function qH(e) {
   for (o = qc; o < e && KH(o, t, e) !== e - Tr; o++)
     ;
   if (n === 1) {
-    const a = (e + Tr) / Ob;
+    const a = (e + Tr) / O1;
     return function(s, c) {
       const l = s.pow(c, a);
       if (!s.eql(s.sqr(l), c))
@@ -10808,8 +10808,8 @@ function qH(e) {
   };
 }
 function MH(e) {
-  if (e % Ob === DH) {
-    const t = (e + Tr) / Ob;
+  if (e % O1 === DH) {
+    const t = (e + Tr) / O1;
     return function(r, n) {
       const o = r.pow(n, t);
       if (!r.eql(r.sqr(o), n))
@@ -10904,13 +10904,13 @@ function r7(e, t, r = !1, n = {}) {
     sub: (c, l) => Fr(c - l, e),
     mul: (c, l) => Fr(c * l, e),
     pow: (c, l) => VH(s, c, l),
-    div: (c, l) => Fr(c * Bb(l, e), e),
+    div: (c, l) => Fr(c * B1(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (c) => c * c,
     addN: (c, l) => c + l,
     subN: (c, l) => c - l,
     mulN: (c, l) => c * l,
-    inv: (c) => Bb(c, e),
+    inv: (c) => B1(c, e),
     sqrt: n.sqrt || ((c) => a(s, c)),
     invertBatch: (c) => GH(s, c),
     // TODO: do we really need constant cmov?
@@ -10934,7 +10934,7 @@ function ZH(e, t, r = !1) {
   return Fr(i, t - Tr) + Tr;
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const WH = BigInt(0), i1 = BigInt(1);
+const WH = BigInt(0), ib = BigInt(1);
 function XH(e, t) {
   const r = (o, i) => {
     const a = i.negate();
@@ -10949,7 +10949,7 @@ function XH(e, t) {
     unsafeLadder(o, i) {
       let a = e.ZERO, s = o;
       for (; i > WH; )
-        i & i1 && (a = a.add(s)), s = s.double(), i >>= i1;
+        i & ib && (a = a.add(s)), s = s.double(), i >>= ib;
       return a;
     },
     /**
@@ -10987,7 +10987,7 @@ function XH(e, t) {
       for (let y = 0; y < s; y++) {
         const m = y * c;
         let w = Number(a & f);
-        a >>= g, w > c && (w -= h, a += i1);
+        a >>= g, w > c && (w -= h, a += ib);
         const v = m, x = m + Math.abs(w) - 1, E = y % 2 !== 0, S = w < 0;
         w === 0 ? u = u.add(r(E, i[v])) : l = l.add(r(S, i[x]));
       }
@@ -11356,7 +11356,7 @@ function rD(e) {
     return Fr(P, n);
   }
   function c(P) {
-    return Bb(P, n);
+    return B1(P, n);
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: u, weierstrassEquation: f, isWithinCurveOrder: h } = eD({
     ...t,
@@ -11832,17 +11832,17 @@ function E0(e, ...t) {
   }
   return y0(co(r, ...t));
 }
-const n2 = (e) => e.toRawBytes(!0).slice(1), Ub = (e) => pc(e, 32), a1 = (e) => Fr(e, Jg), vd = (e) => Fr(e, w0), o2 = aa.ProjectivePoint, gD = (e, t, r) => o2.BASE.multiplyAndAddUnsafe(e, t, r);
-function Cb(e) {
+const n2 = (e) => e.toRawBytes(!0).slice(1), U1 = (e) => pc(e, 32), ab = (e) => Fr(e, Jg), vd = (e) => Fr(e, w0), o2 = aa.ProjectivePoint, gD = (e, t, r) => o2.BASE.multiplyAndAddUnsafe(e, t, r);
+function C1(e) {
   let t = aa.utils.normPrivateKeyToScalar(e), r = o2.fromPrivateKey(t);
   return { scalar: r.hasEvenY() ? t : vd(-t), bytes: n2(r) };
 }
 function u7(e) {
   if (!c7(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = a1(e * e), r = a1(t * e + BigInt(7));
+  const t = ab(e * e), r = ab(t * e + BigInt(7));
   let n = s7(r);
-  n % v0 !== Qg && (n = a1(-n));
+  n % v0 !== Qg && (n = ab(-n));
   const o = new o2(e, n, a7);
   return o.assertValidity(), o;
 }
@@ -11850,14 +11850,14 @@ function l7(...e) {
   return vd(Bn(E0("BIP0340/challenge", ...e)));
 }
 function mD(e) {
-  return Cb(e).bytes;
+  return C1(e).bytes;
 }
 function yD(e, t, r = Xx(32)) {
-  const n = fn("message", e), { bytes: o, scalar: i } = Cb(t), a = fn("auxRand", r, 32), s = Ub(i ^ Bn(E0("BIP0340/aux", a))), c = E0("BIP0340/nonce", s, o, n), l = vd(Bn(c));
+  const n = fn("message", e), { bytes: o, scalar: i } = C1(t), a = fn("auxRand", r, 32), s = U1(i ^ Bn(E0("BIP0340/aux", a))), c = E0("BIP0340/nonce", s, o, n), l = vd(Bn(c));
   if (l === Qg)
     throw new Error("sign failed: k is zero");
-  const { bytes: u, scalar: f } = Cb(l), h = l7(u, o, n), g = new Uint8Array(64);
-  if (g.set(u, 0), g.set(Ub(vd(f + h * i)), 32), !f7(g, n, o))
+  const { bytes: u, scalar: f } = C1(l), h = l7(u, o, n), g = new Uint8Array(64);
+  if (g.set(u, 0), g.set(U1(vd(f + h * i)), 32), !f7(g, n, o))
     throw new Error("sign: Invalid signature produced");
   return g;
 }
@@ -11870,7 +11870,7 @@ function f7(e, t, r) {
     const c = Bn(n.subarray(32, 64));
     if (!pD(c))
       return !1;
-    const l = l7(Ub(s), n2(a), o), u = gD(a, c, vd(-l));
+    const l = l7(U1(s), n2(a), o), u = gD(a, c, vd(-l));
     return !(!u || !u.hasEvenY() || u.toAffine().x !== s);
   } catch {
     return !1;
@@ -11936,7 +11936,7 @@ fD(aa.ProjectivePoint, (e) => {
   expand: "xmd",
   hash: y0
 });
-function Nb(e) {
+function N1(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -11953,7 +11953,7 @@ function d7(e, ...t) {
 function kD(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Nb(e.outputLen), Nb(e.blockLen);
+  N1(e.outputLen), N1(e.blockLen);
 }
 function xD(e, t = !0) {
   if (e.destroyed)
@@ -11968,16 +11968,16 @@ function AD(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
 const _D = {
-  number: Nb,
+  number: N1,
   bool: ED,
   bytes: d7,
   hash: kD,
   exists: xD,
   output: AD
 };
-var s1 = _D;
+var sb = _D;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const c1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ni = (e, t) => e << 32 - t | e >>> t, SD = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const cb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ni = (e, t) => e << 32 - t | e >>> t, SD = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!SD)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -12009,17 +12009,17 @@ function ID(e, t, r, n) {
 }
 let PD = class extends TD {
   constructor(t, r, n, o) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = c1(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = cb(this.buffer);
   }
   update(t) {
-    s1.exists(this);
+    sb.exists(this);
     const { view: r, buffer: n, blockLen: o } = this;
     t = h7(t);
     const i = t.length;
     for (let a = 0; a < i; ) {
       const s = Math.min(o - this.pos, i - a);
       if (s === o) {
-        const c = c1(t);
+        const c = cb(t);
         for (; o <= i - a; a += o)
           this.process(c, a);
         continue;
@@ -12029,14 +12029,14 @@ let PD = class extends TD {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    s1.exists(this), s1.output(t, this), this.finished = !0;
+    sb.exists(this), sb.output(t, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: o, isLE: i } = this;
     let { pos: a } = this;
     r[a++] = 128, this.buffer.subarray(a).fill(0), this.padOffset > o - a && (this.process(n, 0), a = 0);
     for (let f = a; f < o; f++)
       r[f] = 0;
     ID(n, o - 8, BigInt(this.length * 8), i), this.process(n, 0);
-    const s = c1(t), c = this.outputLen;
+    const s = cb(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, u = this.get();
@@ -12169,7 +12169,7 @@ let g7 = class extends PD {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 };
-const jb = p7(() => new g7());
+const j1 = p7(() => new g7());
 p7(() => new CD());
 function ND(e, t) {
   if (e.length > t)
@@ -12243,7 +12243,7 @@ function MD(e, t) {
   return new Uint8Array(i);
 }
 function b7(e) {
-  return jb(jb(e));
+  return j1(j1(e));
 }
 function FD(e) {
   const t = b7(e);
@@ -12498,7 +12498,7 @@ const dK = new TextEncoder(), hK = new TextDecoder();
 function i2(e) {
   return dK.encode(e);
 }
-function zb(e) {
+function z1(e) {
   return hK.decode(e);
 }
 function pK(e, t) {
@@ -12603,18 +12603,18 @@ const An = class Qt extends Uint8Array {
     return aK(r);
   }
   toHash() {
-    const t = jb(this);
+    const t = j1(this);
     return new Qt(t);
   }
   toJson() {
-    const t = zb(this);
+    const t = z1(this);
     return JSON.parse(t);
   }
   toBech32(t, r = 0) {
     return S7.encode(this, t, r);
   }
   toStr() {
-    return zb(this);
+    return z1(this);
   }
   toHex() {
     return mK(this);
@@ -12679,7 +12679,7 @@ const An = class Qt extends Uint8Array {
     throw new Error(`Value is too large: ${t}`);
   }
 };
-An.num = wK, An.big = EK, An.bin = vK, An.raw = kK, An.str = xK, An.hex = AK, An.bytes = _K, An.json = SK, An.base64 = $K, An.b64url = TK, An.bech32 = IK, An.b58chk = PK, An.encode = i2, An.decode = zb;
+An.num = wK, An.big = EK, An.bin = vK, An.raw = kK, An.str = xK, An.hex = AK, An.bytes = _K, An.json = SK, An.base64 = $K, An.b64url = TK, An.bech32 = IK, An.b58chk = PK, An.encode = i2, An.decode = z1;
 let Qe = An;
 function wK(e, t, r) {
   return new Qe(e, t, r);
@@ -12747,7 +12747,7 @@ let OK = class {
     }
   }
 };
-const x0 = aa.CURVE, a2 = x0.n, BK = x0.p, UK = { x: x0.Gx, y: x0.Gy }, CK = BigInt(0), NK = BigInt(1), jK = BigInt(2), zK = BigInt(3), RK = BigInt(4), Rb = { N: a2, P: BK, G: UK, _0n: CK, _1n: NK, _2n: jK, _3n: zK, _4n: RK }, Kf = r7(a2, 32, !0), C7 = (e) => Fr(e, a2);
+const x0 = aa.CURVE, a2 = x0.n, BK = x0.p, UK = { x: x0.Gx, y: x0.Gy }, CK = BigInt(0), NK = BigInt(1), jK = BigInt(2), zK = BigInt(3), RK = BigInt(4), R1 = { N: a2, P: BK, G: UK, _0n: CK, _1n: NK, _2n: jK, _3n: zK, _4n: RK }, Kf = r7(a2, 32, !0), C7 = (e) => Fr(e, a2);
 function s2(e, t = !1) {
   if (t)
     throw new Error(e);
@@ -12766,7 +12766,7 @@ var HK = /* @__PURE__ */ Object.freeze({
   mod_bytes: LK,
   random: N7
 });
-const { N: DK, P: vbe, _0n: KK } = Rb;
+const { N: DK, P: v1e, _0n: KK } = R1;
 function qK(e, t, r) {
   const n = Qe.bytes(e);
   return n.length !== t ? s2(`Invalid byte size: ${n.hex} !== ${t}`, r) : !0;
@@ -12908,7 +12908,7 @@ const Kp = class Br {
     return Br.import(this.p.negate());
   }
 };
-Kp.P = Rb.P, Kp.G = Rb.G, Kp.base = aa.ProjectivePoint.BASE;
+Kp.P = R1.P, Kp.G = R1.G, Kp.base = aa.ProjectivePoint.BASE;
 let Ru = Kp;
 function FK(e) {
   if (e instanceof Pn)
@@ -12936,7 +12936,7 @@ function VK(e) {
     return Qe.bytes(e, 32);
   throw new TypeError(`Unknown type: ${typeof e}`);
 }
-function Lb(e) {
+function L1(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -12953,7 +12953,7 @@ function z7(e, ...t) {
 function ZK(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Lb(e.outputLen), Lb(e.blockLen);
+  L1(e.outputLen), L1(e.blockLen);
 }
 function WK(e, t = !0) {
   if (e.destroyed)
@@ -12968,7 +12968,7 @@ function XK(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
 const YK = {
-  number: Lb,
+  number: L1,
   bool: GK,
   bytes: z7,
   hash: ZK,
@@ -12977,7 +12977,7 @@ const YK = {
 };
 var Xc = YK;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const JK = (e) => e instanceof Uint8Array, u1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ji = (e, t) => e << 32 - t | e >>> t, QK = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const JK = (e) => e instanceof Uint8Array, ub = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ji = (e, t) => e << 32 - t | e >>> t, QK = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!QK)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -13009,7 +13009,7 @@ function tq(e, t, r, n) {
 }
 let u2 = class extends R7 {
   constructor(t, r, n, o) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = u1(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = ub(this.buffer);
   }
   update(t) {
     Xc.exists(this);
@@ -13019,7 +13019,7 @@ let u2 = class extends R7 {
     for (let a = 0; a < i; ) {
       const s = Math.min(o - this.pos, i - a);
       if (s === o) {
-        const c = u1(t);
+        const c = ub(t);
         for (; o <= i - a; a += o)
           this.process(c, a);
         continue;
@@ -13036,7 +13036,7 @@ let u2 = class extends R7 {
     for (let f = a; f < o; f++)
       r[f] = 0;
     tq(n, o - 8, BigInt(this.length * 8), i), this.process(n, 0);
-    const s = u1(t), c = this.outputLen;
+    const s = ub(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, u = this.get();
@@ -13171,9 +13171,9 @@ let L7 = class extends u2 {
 };
 const A0 = Lu(() => new L7());
 Lu(() => new iq());
-const up = BigInt(2 ** 32 - 1), Hb = BigInt(32);
+const up = BigInt(2 ** 32 - 1), H1 = BigInt(32);
 function H7(e, t = !1) {
-  return t ? { h: Number(e & up), l: Number(e >> Hb & up) } : { h: Number(e >> Hb & up) | 0, l: Number(e & up) | 0 };
+  return t ? { h: Number(e & up), l: Number(e >> H1 & up) } : { h: Number(e >> H1 & up) | 0, l: Number(e & up) | 0 };
 }
 function aq(e, t = !1) {
   let r = new Uint32Array(e.length), n = new Uint32Array(e.length);
@@ -13183,7 +13183,7 @@ function aq(e, t = !1) {
   }
   return [r, n];
 }
-const sq = (e, t) => BigInt(e >>> 0) << Hb | BigInt(t >>> 0), cq = (e, t, r) => e >>> r, uq = (e, t, r) => e << 32 - r | t >>> r, lq = (e, t, r) => e >>> r | t << 32 - r, fq = (e, t, r) => e << 32 - r | t >>> r, dq = (e, t, r) => e << 64 - r | t >>> r - 32, hq = (e, t, r) => e >>> r - 32 | t << 64 - r, pq = (e, t) => t, gq = (e, t) => e, mq = (e, t, r) => e << r | t >>> 32 - r, yq = (e, t, r) => t << r | e >>> 32 - r, bq = (e, t, r) => t << r - 32 | e >>> 64 - r, wq = (e, t, r) => e << r - 32 | t >>> 64 - r;
+const sq = (e, t) => BigInt(e >>> 0) << H1 | BigInt(t >>> 0), cq = (e, t, r) => e >>> r, uq = (e, t, r) => e << 32 - r | t >>> r, lq = (e, t, r) => e >>> r | t << 32 - r, fq = (e, t, r) => e << 32 - r | t >>> r, dq = (e, t, r) => e << 64 - r | t >>> r - 32, hq = (e, t, r) => e >>> r - 32 | t << 64 - r, pq = (e, t) => t, gq = (e, t) => e, mq = (e, t, r) => e << r | t >>> 32 - r, yq = (e, t, r) => t << r | e >>> 32 - r, bq = (e, t, r) => t << r - 32 | e >>> 64 - r, wq = (e, t, r) => e << r - 32 | t >>> 64 - r;
 function vq(e, t, r, n) {
   const o = (t >>> 0) + (n >>> 0);
   return { h: e + r + (o / 2 ** 32 | 0) | 0, l: o | 0 };
@@ -13509,7 +13509,7 @@ var Wq = /* @__PURE__ */ Object.freeze({
   xonly_pub: Zq
 });
 Qe.random(32);
-const G7 = { secp: aa, schnorr: bD }, Db = { ...Wq, ...HK };
+const G7 = { secp: aa, schnorr: bD }, D1 = { ...Wq, ...HK };
 function tm(e) {
   const t = X.bytes(e);
   return ia(t, 33), d2(t);
@@ -14283,7 +14283,7 @@ function _F(e, t = {}) {
   return wA(e, { ...t, isPrivate: !1 });
 }
 function wA(e, t = {}) {
-  const { isPrivate: r = !1, tree: n = [], version: o = xF } = t, i = r ? Db.getPublicKey(e, !0) : wu(e);
+  const { isPrivate: r = !1, tree: n = [], version: o = xF } = t, i = r ? D1.getPublicKey(e, !0) : wu(e);
   let { target: a } = t;
   a !== void 0 && (a = X.bytes(a).hex);
   let s, c = [];
@@ -14292,7 +14292,7 @@ function wA(e, t = {}) {
     c = y, s = xl(e, h, r);
   } else
     a !== void 0 ? s = xl(e, a, r) : s = xl(e, void 0, r);
-  const l = r ? Db.getPublicKey(s)[0] : s[0], u = [X.num(o + EA(l)), i];
+  const l = r ? D1.getPublicKey(s)[0] : s[0], u = [X.num(o + EA(l)), i];
   c.length > 0 && c.forEach((h) => u.push(X.hex(h)));
   const f = X.join(u);
   if (a !== void 0 && !A2(s, a, f, t))
@@ -14300,7 +14300,7 @@ function wA(e, t = {}) {
   return [wu(s).hex, f.hex];
 }
 function A2(e, t, r, n = {}) {
-  const { isPrivate: o = !1, throws: i = !1 } = n, { parity: a, paths: s, intkey: c } = vA(r), l = o ? Db.getPublicKey(e, !0) : wu(e), u = X.join([a, l]);
+  const { isPrivate: o = !1, throws: i = !1 } = n, { parity: a, paths: s, intkey: c } = vA(r), l = o ? D1.getPublicKey(e, !0) : wu(e), u = X.join([a, l]);
   if (u.length !== 33)
     return mn("Invalid tapkey: " + u.hex, i);
   let f = X.bytes(t).hex;
@@ -14418,14 +14418,14 @@ var Ct;
   }
   e.joinValues = n, e.jsonStringifyReplacer = (o, i) => typeof i == "bigint" ? i.toString() : i;
 })(Ct || (Ct = {}));
-var Kb;
+var K1;
 (function(e) {
   e.mergeShapes = (t, r) => ({
     ...t,
     ...r
     // second overwrites first
   });
-})(Kb || (Kb = {}));
+})(K1 || (K1 = {}));
 const be = Ct.arrayToEnum([
   "string",
   "nan",
@@ -14676,7 +14676,7 @@ let no = class xA {
 };
 const ut = Object.freeze({
   status: "aborted"
-}), AA = (e) => ({ status: "dirty", value: e }), zn = (e) => ({ status: "valid", value: e }), qb = (e) => e.status === "aborted", Mb = (e) => e.status === "dirty", I0 = (e) => e.status === "valid", P0 = (e) => typeof Promise < "u" && e instanceof Promise;
+}), AA = (e) => ({ status: "dirty", value: e }), zn = (e) => ({ status: "valid", value: e }), q1 = (e) => e.status === "aborted", M1 = (e) => e.status === "dirty", I0 = (e) => e.status === "valid", P0 = (e) => typeof Promise < "u" && e instanceof Promise;
 var Ce;
 (function(e) {
   e.errToObj = (t) => typeof t == "string" ? { message: t } : t || {}, e.toString = (t) => typeof t == "string" ? t : t == null ? void 0 : t.message;
@@ -15184,7 +15184,7 @@ function FF(e, t) {
   const r = (e.toString().split(".")[1] || "").length, n = (t.toString().split(".")[1] || "").length, o = r > n ? r : n, i = parseInt(e.toFixed(o).replace(".", "")), a = parseInt(t.toFixed(o).replace(".", ""));
   return i % a / Math.pow(10, o);
 }
-let kd = class Fb extends It {
+let kd = class F1 extends It {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte, this.step = this.multipleOf;
   }
@@ -15242,7 +15242,7 @@ let kd = class Fb extends It {
     return this.setLimit("max", t, !1, Ce.toString(r));
   }
   setLimit(t, r, n, o) {
-    return new Fb({
+    return new F1({
       ...this._def,
       checks: [
         ...this._def.checks,
@@ -15256,7 +15256,7 @@ let kd = class Fb extends It {
     });
   }
   _addCheck(t) {
-    return new Fb({
+    return new F1({
       ...this._def,
       checks: [...this._def.checks, t]
     });
@@ -15356,7 +15356,7 @@ kd.create = (e) => new kd({
   coerce: (e == null ? void 0 : e.coerce) || !1,
   ...mt(e)
 });
-let xd = class Vb extends It {
+let xd = class V1 extends It {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte;
   }
@@ -15404,7 +15404,7 @@ let xd = class Vb extends It {
     return this.setLimit("max", t, !1, Ce.toString(r));
   }
   setLimit(t, r, n, o) {
-    return new Vb({
+    return new V1({
       ...this._def,
       checks: [
         ...this._def.checks,
@@ -15418,7 +15418,7 @@ let xd = class Vb extends It {
     });
   }
   _addCheck(t) {
-    return new Vb({
+    return new V1({
       ...this._def,
       checks: [...this._def.checks, t]
     });
@@ -16198,14 +16198,14 @@ let SA = class $A extends It {
     });
   }
 };
-function Gb(e, t) {
+function G1(e, t) {
   const r = lc(e), n = lc(t);
   if (e === t)
     return { valid: !0, data: e };
   if (r === be.object && n === be.object) {
     const o = Ct.objectKeys(t), i = Ct.objectKeys(e).filter((s) => o.indexOf(s) !== -1), a = { ...e, ...t };
     for (const s of i) {
-      const c = Gb(e[s], t[s]);
+      const c = G1(e[s], t[s]);
       if (!c.valid)
         return { valid: !1 };
       a[s] = c.data;
@@ -16216,7 +16216,7 @@ function Gb(e, t) {
       return { valid: !1 };
     const o = [];
     for (let i = 0; i < e.length; i++) {
-      const a = e[i], s = t[i], c = Gb(a, s);
+      const a = e[i], s = t[i], c = G1(a, s);
       if (!c.valid)
         return { valid: !1 };
       o.push(c.data);
@@ -16227,10 +16227,10 @@ function Gb(e, t) {
 let Id = class extends It {
   _parse(t) {
     const { status: r, ctx: n } = this._processInputParams(t), o = (i, a) => {
-      if (qb(i) || qb(a))
+      if (q1(i) || q1(a))
         return ut;
-      const s = Gb(i.value, a.value);
-      return s.valid ? ((Mb(i) || Mb(a)) && r.dirty(), { status: r.value, value: s.data }) : (Ee(n, {
+      const s = G1(i.value, a.value);
+      return s.valid ? ((M1(i) || M1(a)) && r.dirty(), { status: r.value, value: s.data }) : (Ee(n, {
         code: fe.invalid_intersection_types
       }), ut);
     };
@@ -16312,7 +16312,7 @@ vc.create = (e, t) => {
     ...mt(t)
   });
 };
-let IA = class Zb extends It {
+let IA = class Z1 extends It {
   get keySchema() {
     return this._def.keyType;
   }
@@ -16339,12 +16339,12 @@ let IA = class Zb extends It {
     return this._def.valueType;
   }
   static create(t, r, n) {
-    return r instanceof It ? new Zb({
+    return r instanceof It ? new Z1({
       keyType: t,
       valueType: r,
       typeName: Fe.ZodRecord,
       ...mt(n)
-    }) : new Zb({
+    }) : new Z1({
       keyType: Dl.create(),
       valueType: t,
       typeName: Fe.ZodRecord,
@@ -16594,7 +16594,7 @@ function PA(e, t) {
     ...mt(t)
   });
 }
-let Eh = class Wb extends It {
+let Eh = class W1 extends It {
   _parse(t) {
     if (typeof t.data != "string") {
       const r = this._getOrReturnCtx(t), n = this._def.values;
@@ -16636,10 +16636,10 @@ let Eh = class Wb extends It {
     return t;
   }
   extract(t) {
-    return Wb.create(t);
+    return W1.create(t);
   }
   exclude(t) {
-    return Wb.create(this.options.filter((r) => !t.includes(r)));
+    return W1.create(this.options.filter((r) => !t.includes(r)));
   }
 };
 Eh.create = PA;
@@ -16971,15 +16971,15 @@ var Un = /* @__PURE__ */ Object.freeze({
   INVALID: ut,
   DIRTY: AA,
   OK: zn,
-  isAborted: qb,
-  isDirty: Mb,
+  isAborted: q1,
+  isDirty: M1,
   isValid: I0,
   isAsync: P0,
   get util() {
     return Ct;
   },
   get objectUtil() {
-    return Kb;
+    return K1;
   },
   ZodParsedType: be,
   getParsedType: lc,
@@ -18170,7 +18170,7 @@ om.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
 var hi = {}, Da = {};
 Object.defineProperty(Da, "__esModule", { value: !0 });
 Da.HashMD = Da.Maj = Da.Chi = void 0;
-const l1 = ko, qf = Pc;
+const lb = ko, qf = Pc;
 function RV(e, t, r, n) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, r, n);
@@ -18186,7 +18186,7 @@ let DV = class extends qf.Hash {
     super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = (0, qf.createView)(this.buffer);
   }
   update(t) {
-    (0, l1.exists)(this);
+    (0, lb.exists)(this);
     const { view: r, buffer: n, blockLen: o } = this;
     t = (0, qf.toBytes)(t);
     const i = t.length;
@@ -18203,7 +18203,7 @@ let DV = class extends qf.Hash {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    (0, l1.exists)(this), (0, l1.output)(t, this), this.finished = !0;
+    (0, lb.exists)(this), (0, lb.output)(t, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: o, isLE: i } = this;
     let { pos: a } = this;
     r[a++] = 128, this.buffer.subarray(a).fill(0), this.padOffset > o - a && (this.process(n, 0), a = 0);
@@ -18234,7 +18234,7 @@ let DV = class extends qf.Hash {
 Da.HashMD = DV;
 Object.defineProperty(hi, "__esModule", { value: !0 });
 hi.sha224 = hi.sha256 = hi.SHA256 = void 0;
-const f1 = Da, Ro = Pc, KV = /* @__PURE__ */ new Uint32Array([
+const fb = Da, Ro = Pc, KV = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -18309,7 +18309,7 @@ const f1 = Da, Ro = Pc, KV = /* @__PURE__ */ new Uint32Array([
   528734635,
   1541459225
 ]), Is = /* @__PURE__ */ new Uint32Array(64);
-let I2 = class extends f1.HashMD {
+let I2 = class extends fb.HashMD {
   constructor() {
     super(64, 32, 8, !1), this.A = Ts[0] | 0, this.B = Ts[1] | 0, this.C = Ts[2] | 0, this.D = Ts[3] | 0, this.E = Ts[4] | 0, this.F = Ts[5] | 0, this.G = Ts[6] | 0, this.H = Ts[7] | 0;
   }
@@ -18330,7 +18330,7 @@ let I2 = class extends f1.HashMD {
     }
     let { A: n, B: o, C: i, D: a, E: s, F: c, G: l, H: u } = this;
     for (let f = 0; f < 64; f++) {
-      const h = (0, Ro.rotr)(s, 6) ^ (0, Ro.rotr)(s, 11) ^ (0, Ro.rotr)(s, 25), g = u + h + (0, f1.Chi)(s, c, l) + KV[f] + Is[f] | 0, y = ((0, Ro.rotr)(n, 2) ^ (0, Ro.rotr)(n, 13) ^ (0, Ro.rotr)(n, 22)) + (0, f1.Maj)(n, o, i) | 0;
+      const h = (0, Ro.rotr)(s, 6) ^ (0, Ro.rotr)(s, 11) ^ (0, Ro.rotr)(s, 25), g = u + h + (0, fb.Chi)(s, c, l) + KV[f] + Is[f] | 0, y = ((0, Ro.rotr)(n, 2) ^ (0, Ro.rotr)(n, 13) ^ (0, Ro.rotr)(n, 22)) + (0, fb.Maj)(n, o, i) | 0;
       u = l, l = c, c = s, s = a + g | 0, a = i, i = o, o = n, n = g + y | 0;
     }
     n = n + this.A | 0, o = o + this.B | 0, i = i + this.C | 0, a = a + this.D | 0, s = s + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, u = u + this.H | 0, this.set(n, o, i, a, s, c, l, u);
@@ -18369,7 +18369,7 @@ var Ot = /* @__PURE__ */ VV(MV);
 const Oc = "Expected Private", Bc = "Expected Point", kh = "Expected Tweak", GV = "Expected Hash", z0 = "Expected Signature", P2 = "Expected Extra Data (32 bytes)", xh = "Expected Scalar", ZV = "Bad Recovery Id";
 Ot.utils.hmacSha256Sync = (e, ...t) => FV.hmac(VA.sha256, e, Ot.utils.concatBytes(...t));
 Ot.utils.sha256Sync = (...e) => VA.sha256(Ot.utils.concatBytes(...e));
-const O2 = Ot.utils._normalizePrivateKey, WV = 32, XV = 32, Xb = new Uint8Array([
+const O2 = Ot.utils._normalizePrivateKey, WV = 32, XV = 32, X1 = new Uint8Array([
   255,
   255,
   255,
@@ -18449,10 +18449,10 @@ function t8(e) {
   return Cd(e, JV) === 0;
 }
 function Ah(e) {
-  return !(!(e instanceof Uint8Array) || e.length !== XV || Cd(e, Xb) >= 0);
+  return !(!(e instanceof Uint8Array) || e.length !== XV || Cd(e, X1) >= 0);
 }
 function B2(e) {
-  return e instanceof Uint8Array && e.length === 64 && Cd(e.subarray(0, 32), Xb) < 0 && Cd(e.subarray(32, 64), Xb) < 0;
+  return e instanceof Uint8Array && e.length === 64 && Cd(e.subarray(0, 32), X1) < 0 && Cd(e.subarray(32, 64), X1) < 0;
 }
 function tG(e) {
   return eG(e) && e.length === 64 && Cd(e.subarray(0, 32), QV) < 0;
@@ -18704,9 +18704,9 @@ var JA = {}, yf = {};
 yf.byteLength = VG;
 yf.toByteArray = ZG;
 yf.fromByteArray = YG;
-var Zi = [], Ho = [], MG = typeof Uint8Array < "u" ? Uint8Array : Array, d1 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var tl = 0, FG = d1.length; tl < FG; ++tl)
-  Zi[tl] = d1[tl], Ho[d1.charCodeAt(tl)] = tl;
+var Zi = [], Ho = [], MG = typeof Uint8Array < "u" ? Uint8Array : Array, db = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var tl = 0, FG = db.length; tl < FG; ++tl)
+  Zi[tl] = db[tl], Ho[db.charCodeAt(tl)] = tl;
 Ho[45] = 62;
 Ho[95] = 63;
 function QA(e) {
@@ -19717,7 +19717,7 @@ z2.write = function(e, t, r, n, o, i) {
     throw new Error("BigInt not supported");
   }
 })(JA);
-const owe = "Mainnet", Yb = "BITCOIN_MAINNET", e_ = "BITCOIN_TESTNET", t_ = "BITCOIN_TESTNET4", r_ = "BITCOIN_SIGNET", n_ = "FRACTAL_BITCOIN_MAINNET", o_ = "FRACTAL_BITCOIN_TESTNET", iwe = "livenet", awe = "testnet", Jb = "Mainnet", i_ = "Testnet", JG = "Signet", QG = "livenet", eZ = "testnet", R0 = "livenet", Qb = "testnet", a_ = "testnet4", s_ = "signet", r8 = "Mainnet", tZ = "Testnet", ew = "mainnet", c_ = "testnet", Bt = "mainnet", Xn = "signet", ur = "testnet", Fn = "testnet4", bf = "fractal mainnet", Vn = "fractal testnet", swe = "regtest", sd = (e) => e === Bt ? Jb : e === ur ? i_ : e === Xn ? JG : Jb, cwe = (e) => e === Bt ? ew : e === ur ? c_ : ew, u_ = (e) => e === Bt ? Yb : e === ur ? e_ : e === Fn ? t_ : e === Xn ? r_ : e === bf ? n_ : e === Vn ? o_ : Yb, uwe = (e) => e === Bt ? R0 : e === ur ? Qb : e === Fn ? a_ : e === Xn ? s_ : e === Vn ? Qb : R0, dp = (e) => e === Bt ? r8 : e === ur ? tZ : r8, n8 = (e) => e === Yb ? Bt : e === e_ ? ur : e === t_ ? Fn : e === r_ ? Xn : e === n_ ? bf : e === o_ ? Vn : Bt, lwe = (e) => e === Jb ? Bt : e === i_ ? ur : Bt, fwe = (e) => e === ew ? Bt : e === c_ ? ur : Bt, rZ = (e) => e === QG ? Bt : e === eZ ? ur : Bt, o8 = (e) => e === R0 ? Bt : e === Qb ? ur : e === a_ ? Fn : e === s_ ? Xn : e === Vn ? ur : Bt;
+const owe = "Mainnet", Y1 = "BITCOIN_MAINNET", e_ = "BITCOIN_TESTNET", t_ = "BITCOIN_TESTNET4", r_ = "BITCOIN_SIGNET", n_ = "FRACTAL_BITCOIN_MAINNET", o_ = "FRACTAL_BITCOIN_TESTNET", iwe = "livenet", awe = "testnet", J1 = "Mainnet", i_ = "Testnet", JG = "Signet", QG = "livenet", eZ = "testnet", R0 = "livenet", Q1 = "testnet", a_ = "testnet4", s_ = "signet", r8 = "Mainnet", tZ = "Testnet", ew = "mainnet", c_ = "testnet", Bt = "mainnet", Xn = "signet", ur = "testnet", Fn = "testnet4", bf = "fractal mainnet", Vn = "fractal testnet", swe = "regtest", sd = (e) => e === Bt ? J1 : e === ur ? i_ : e === Xn ? JG : J1, cwe = (e) => e === Bt ? ew : e === ur ? c_ : ew, u_ = (e) => e === Bt ? Y1 : e === ur ? e_ : e === Fn ? t_ : e === Xn ? r_ : e === bf ? n_ : e === Vn ? o_ : Y1, uwe = (e) => e === Bt ? R0 : e === ur ? Q1 : e === Fn ? a_ : e === Xn ? s_ : e === Vn ? Q1 : R0, dp = (e) => e === Bt ? r8 : e === ur ? tZ : r8, n8 = (e) => e === Y1 ? Bt : e === e_ ? ur : e === t_ ? Fn : e === r_ ? Xn : e === n_ ? bf : e === o_ ? Vn : Bt, lwe = (e) => e === J1 ? Bt : e === i_ ? ur : Bt, fwe = (e) => e === ew ? Bt : e === c_ ? ur : Bt, rZ = (e) => e === QG ? Bt : e === eZ ? ur : Bt, o8 = (e) => e === R0 ? Bt : e === Q1 ? ur : e === a_ ? Fn : e === s_ ? Xn : e === Vn ? ur : Bt;
 function l_(e, t) {
   return function() {
     return e.apply(t, arguments);
@@ -19854,10 +19854,10 @@ const vZ = (e, t, r, { allOwnKeys: n } = {}) => (_h(t, (o, i) => {
   };
   return wf(e) ? n(e) : n(String(e).split(t)), r;
 }, CZ = () => {
-}, NZ = (e, t) => e != null && Number.isFinite(e = +e) ? e : t, h1 = "abcdefghijklmnopqrstuvwxyz", a8 = "0123456789", m_ = {
+}, NZ = (e, t) => e != null && Number.isFinite(e = +e) ? e : t, hb = "abcdefghijklmnopqrstuvwxyz", a8 = "0123456789", m_ = {
   DIGIT: a8,
-  ALPHA: h1,
-  ALPHA_DIGIT: h1 + h1.toUpperCase() + a8
+  ALPHA: hb,
+  ALPHA_DIGIT: hb + hb.toUpperCase() + a8
 }, jZ = (e = 16, t = m_.ALPHA_DIGIT) => {
   let r = "";
   const { length: n } = t;
@@ -20355,7 +20355,7 @@ function aW(e) {
   return t;
 }
 const sW = (e) => /^[-_a-zA-Z0-9^`|~,!#$%&'*+.]+$/.test(e.trim());
-function p1(e, t, r, n, o) {
+function pb(e, t, r, n, o) {
   if (te.isFunction(n))
     return n.call(this, t, r);
   if (o && (t = r), !!te.isString(t)) {
@@ -20424,7 +20424,7 @@ let Jn = class {
   has(t, r) {
     if (t = Mf(t), t) {
       const n = te.findKey(this, t);
-      return !!(n && this[n] !== void 0 && (!r || p1(this, this[n], n, r)));
+      return !!(n && this[n] !== void 0 && (!r || pb(this, this[n], n, r)));
     }
     return !1;
   }
@@ -20434,7 +20434,7 @@ let Jn = class {
     function i(a) {
       if (a = Mf(a), a) {
         const s = te.findKey(n, a);
-        s && (!r || p1(n, n[s], s, r)) && (delete n[s], o = !0);
+        s && (!r || pb(n, n[s], s, r)) && (delete n[s], o = !0);
       }
     }
     return te.isArray(t) ? t.forEach(i) : i(t), o;
@@ -20444,7 +20444,7 @@ let Jn = class {
     let n = r.length, o = !1;
     for (; n--; ) {
       const i = r[n];
-      (!t || p1(this, this[i], i, t, !0)) && (delete this[i], o = !0);
+      (!t || pb(this, this[i], i, t, !0)) && (delete this[i], o = !0);
     }
     return o;
   }
@@ -20508,7 +20508,7 @@ te.reduceDescriptors(Jn.prototype, ({ value: e }, t) => {
   };
 });
 te.freezeMethods(Jn);
-function g1(e, t) {
+function gb(e, t) {
   const r = this || Sh, n = t || r, o = Jn.from(n.headers);
   let i = n.data;
   return te.forEach(e, function(a) {
@@ -21052,22 +21052,22 @@ const m8 = (e) => `- ${e}`, TW = (e) => te.isFunction(e) || e === null || e ===
   },
   adapters: iw
 };
-function m1(e) {
+function mb(e) {
   if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
     throw new vf(null, e);
 }
 function y8(e) {
-  return m1(e), e.headers = Jn.from(e.headers), e.data = g1.call(
+  return mb(e), e.headers = Jn.from(e.headers), e.data = gb.call(
     e,
     e.transformRequest
   ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), O_.getAdapter(e.adapter || Sh.adapter)(e).then(function(t) {
-    return m1(e), t.data = g1.call(
+    return mb(e), t.data = gb.call(
       e,
       e.transformResponse,
       t
     ), t.headers = Jn.from(t.headers), t;
   }, function(t) {
-    return __(t) || (m1(e), t && t.response && (t.response.data = g1.call(
+    return __(t) || (mb(e), t && t.response && (t.response.data = gb.call(
       e,
       e.transformResponse,
       t.response
@@ -21519,7 +21519,7 @@ const DW = (e, t) => {
   } catch {
     try {
       const r = Pv(e);
-      if (r.version === 0 && r.data.length === 20) return cb;
+      if (r.version === 0 && r.data.length === 20) return c1;
       if (r.version === 0 && r.data.length === 32) return PB;
       if (r.version === 1 && r.data.length === 32) return nd;
     } catch {
@@ -42829,7 +42829,7 @@ function Ef(...e) {
     }
   };
 }
-const fw = Ef(ym(), hm(), gm(0), pm(4294967295)), PX = Ef(ym(), hm(), gm(0), pm(2147483647)), OX = Ef(ym(), hm(), gm(0), pm(255)), y1 = Ef(mm(Uint8Array), G2(32)), BX = Ef(mm(Uint8Array), G2(33)), UX = lw({
+const fw = Ef(ym(), hm(), gm(0), pm(4294967295)), PX = Ef(ym(), hm(), gm(0), pm(2147483647)), OX = Ef(ym(), hm(), gm(0), pm(255)), yb = Ef(mm(Uint8Array), G2(32)), BX = Ef(mm(Uint8Array), G2(33)), UX = lw({
   wif: OX,
   bip32: lw({
     public: fw,
@@ -43056,7 +43056,7 @@ function zX(e) {
     return c(h, g, y);
   }
   function c(h, g, y, m, w, v) {
-    if (va(y1, h), va(y1, g), y = y || t, !e.isPrivate(h))
+    if (va(yb, h), va(yb, g), y = y || t, !e.isPrivate(h))
       throw new TypeError("Private key not in range [1, n)");
     return new i(h, void 0, g, y, m, w, v);
   }
@@ -43064,7 +43064,7 @@ function zX(e) {
     return u(h, g, y);
   }
   function u(h, g, y, m, w, v) {
-    if (va(BX, h), va(y1, g), y = y || t, !e.isPoint(h))
+    if (va(BX, h), va(yb, g), y = y || t, !e.isPoint(h))
       throw new TypeError("Point is not on the curve");
     return new i(void 0, h, g, y, m, w, v);
   }
@@ -43089,60 +43089,68 @@ bk(j2);
 const HX = async ({
   contentBase64: e,
   mimeType: t,
-  ordinalAddress: r,
-  paymentAddress: n,
-  paymentPublicKey: o,
-  signPsbt: i
+  quantity: r = 1,
+  inscriptions: n,
+  ordinalAddress: o,
+  paymentAddress: i,
+  paymentPublicKey: a,
+  signPsbt: s
 }) => {
   try {
-    const a = await qX(), s = Buffer.from(a).toString("hex"), c = await DX({
-      contentBase64: e,
-      mimeType: t,
-      paymentAddress: n,
-      paymentPublicKey: o,
-      privKey: s
+    if (!e && !n)
+      throw new Error("contentBase64 or inscriptions is required");
+    const c = await qX(), l = Buffer.from(c).toString("hex"), u = n || Array(r).fill({
+      content: e,
+      mimeType: t
     });
-    if (!c || !(c != null && c.psbtHex))
+    console.log("INSCRIPTIONS", u);
+    const f = await DX({
+      inscriptions: u,
+      paymentAddress: i,
+      paymentPublicKey: a,
+      privKey: l
+    });
+    if (!f || !(f != null && f.psbtHex))
       throw new Error("couldn't get commit tx");
-    const l = String(c == null ? void 0 : c.psbtHex), u = String(c == null ? void 0 : c.psbtBase64), f = await i(
+    const h = String(f == null ? void 0 : f.psbtHex), g = String(f == null ? void 0 : f.psbtBase64), y = await s(
       "",
-      l,
-      u,
+      h,
+      g,
       !0,
       !1
     );
-    if (!f) throw new Error("sign psbt failed");
-    const h = Wr.fromHex((f == null ? void 0 : f.signedPsbtHex) || "").extractTransaction(), g = await F2(h.toHex(), Bt);
-    if (!g) throw new Error("commit tx failed");
+    if (!y) throw new Error("sign psbt failed");
+    const m = Wr.fromHex((y == null ? void 0 : y.signedPsbtHex) || "").extractTransaction(), w = await F2(m.toHex(), Bt);
+    if (!w) throw new Error("commit tx failed");
     return await KX({
-      contentBase64: e,
-      mimeType: t,
-      ordinalAddress: r,
-      privKey: s,
-      commitTxId: g
+      inscriptions: u,
+      ordinalAddress: o,
+      privKey: l,
+      commitTxId: w
     });
-  } catch (a) {
-    throw a;
+  } catch (c) {
+    throw c;
   }
 }, DX = async ({
-  contentBase64: e,
-  mimeType: t,
-  paymentAddress: r,
-  paymentPublicKey: n,
-  privKey: o
+  inscriptions: e,
+  paymentAddress: t,
+  paymentPublicKey: r,
+  privKey: n
 }) => {
   try {
-    const i = Buffer.from(e).length;
+    const o = e.length, i = e.reduce(
+      (S, O) => S + Buffer.from(O.content).length,
+      0
+    );
     if (i > 39e4)
       throw new Error("Content size is too large, must be less than 390kb");
-    const { fastestFee: a } = await ZX(Bt), s = Ex(String(o), !0), c = new Wr({
+    const { fastestFee: a } = await ZX(Bt), s = Ex(String(n), !0), c = new Wr({
       network: Xo
     }), { inscriberAddress: l } = MX(
       s,
-      e,
-      t
-    ), u = 5 * 34, f = Math.floor(u * a), h = Math.floor(i * a / 3) + 1e3 + 546, g = Math.floor(f + h), y = (await M2(
-      r,
+      e
+    ), u = 5 * 34 * o, f = Math.floor(u * a * o), h = Math.floor(i * a / 3) + 1e3 + 546 * o, g = Math.floor(f + h), y = (await M2(
+      t,
       Bt
     )).filter((S) => S.value > 3e3).sort((S, O) => O.value - S.value), m = HW(y);
     if (m === 0)
@@ -43150,18 +43158,18 @@ const HX = async ({
     if (m < g)
       throw new Error("insufficient funds");
     let w = 0;
-    const v = await Ov(r);
+    const v = await Ov(t);
     let x = 0;
     for await (const S of y) {
-      const O = DW(r, Bt);
+      const O = DW(t, Bt);
       if (console.log({ paymentAddressType: O }), c.addInput({
         hash: S.txid,
         index: S.vout,
         witnessUtxo: { value: BigInt(S.value), script: v }
       }), O === nd && c.updateInput(x, {
-        tapInternalKey: ad(Buffer.from(n, "hex"))
+        tapInternalKey: ad(Buffer.from(r, "hex"))
       }), O === M6) {
-        let T = j_(n, Bt);
+        let T = j_(r, Bt);
         c.updateInput(x, { redeemScript: T });
       }
       if (x++, w += S.value, w > g)
@@ -43173,85 +43181,82 @@ const HX = async ({
       address: l
     }), E > 546 && c.addOutput({
       value: BigInt(E),
-      address: r
+      address: t
     }), {
       psbtHex: c.toHex(),
       psbtBase64: c.toBase64()
     };
-  } catch (i) {
-    throw i;
+  } catch (o) {
+    throw o;
   }
 }, KX = async ({
-  contentBase64: e,
-  mimeType: t,
-  ordinalAddress: r,
-  commitTxId: n,
-  privKey: o,
-  isDry: i
+  inscriptions: e,
+  ordinalAddress: t,
+  commitTxId: r,
+  privKey: n,
+  isDry: o
 }) => {
   try {
-    const a = ZR(o), s = Ex(o, !0), c = k9(s, e, t), l = S0.encodeScript(c), [u, f] = S0.getPubKey(s, { target: l });
-    if (!await GX(String(n)))
+    const i = ZR(n), a = Ex(n, !0), s = k9(a, e), c = S0.encodeScript(s), [l, u] = S0.getPubKey(a, { target: c });
+    if (!await GX(String(r)))
       throw new Error("ERROR WAITING FOR COMMIT TX");
-    const h = await WX(n, 0);
-    if (h === 0 || !h)
+    const f = await WX(r, 0);
+    if (f === 0 || !f)
       throw new Error("ERROR GETTING FIRST INPUT VALUE");
-    const g = fi.create({
+    const h = fi.create({
       vin: [
         {
-          txid: n,
+          txid: r,
           vout: 0,
           prevout: {
-            value: h,
-            scriptPubKey: ["OP_1", u]
+            value: f,
+            scriptPubKey: ["OP_1", l]
           }
         }
       ],
       vout: [
-        {
+        ...Array(e.length).fill({
           value: 546,
-          scriptPubKey: gA.toScriptPubKey(r)
-        }
+          scriptPubKey: gA.toScriptPubKey(t)
+        })
       ]
-    }), y = TF.taproot.sign(a, g, 0, { extension: l });
-    return g.vin[0].witness = [y, c, f], i ? fi.util.getTxid(g) : await F2(fi.encode(g).hex, Bt);
-  } catch (a) {
-    throw a;
+    }), g = TF.taproot.sign(i, h, 0, { extension: c });
+    return h.vin[0].witness = [g, s, u], o ? fi.util.getTxid(h) : await F2(fi.encode(h).hex, Bt);
+  } catch (i) {
+    throw i;
   }
 };
 async function qX() {
   const e = crypto.getRandomValues(new Uint8Array(32)), t = fX(Buffer.from(e)), r = await lX(t), n = LX.fromSeed(r);
   return n == null ? void 0 : n.derivePath("m/44'/0'/0'/0/0").privateKey;
 }
-const k9 = (e, t, r) => {
-  const n = new TextEncoder(), o = n.encode("ord");
-  let i;
-  if (r === RX) {
-    const s = Buffer.from(t, "base64").toString("utf-8");
-    i = Buffer.from(s, "utf-8");
-  } else
-    i = Buffer.from(t, "base64");
-  const a = [];
-  for (let s = 0; s < i.length; s += 520)
-    a.push(i.slice(s, s + 520));
-  return [
-    e,
-    "OP_CHECKSIG",
-    "OP_0",
-    "OP_IF",
-    o,
-    "01",
-    n.encode(r),
-    "OP_0",
-    ...a.map((s) => s),
-    "OP_ENDIF"
-  ];
-}, MX = (e, t, r) => {
-  const n = k9(e, t, r), o = S0.encodeScript(n), [i] = S0.getPubKey(e, { target: o });
+const k9 = (e, t) => {
+  const r = new TextEncoder(), n = r.encode("ord"), o = 546, i = (s, c) => {
+    let l;
+    if (c === RX) {
+      const f = Buffer.from(s, "base64").toString("utf-8");
+      l = Buffer.from(f, "utf-8");
+    } else
+      l = Buffer.from(s, "base64");
+    const u = [];
+    for (let f = 0; f < l.length; f += 520)
+      u.push(l.slice(f, f + 520));
+    return u;
+  }, a = [e, "OP_CHECKSIG"];
+  return t.forEach((s, c) => {
+    const { content: l, mimeType: u } = s, f = i(l, u);
+    if (a.push("OP_0", "OP_IF", n, "01", r.encode(u), "OP_0"), c > 0) {
+      const h = o * (c + 1), g = Buffer.from([h]);
+      a.push(Buffer.from([2])), a.push(g);
+    }
+    a.push(...f.map((h) => h), "OP_ENDIF");
+  }), a;
+}, MX = (e, t) => {
+  const r = k9(e, t), n = S0.encodeScript(r), [o] = S0.getPubKey(e, { target: n });
   return {
-    inscriberAddress: gA.p2tr.fromPubKey(i),
-    tpubkey: i,
-    tapleaf: o
+    inscriberAddress: gA.p2tr.fromPubKey(o),
+    tpubkey: o,
+    tapleaf: n
   };
 };
 async function FX(e, t = Bt) {
@@ -43501,8 +43506,8 @@ function Ewe() {
         [Dc]: !1
       }
     }),
-    $network: sb(Bt),
-    $library: sb(void 0)
+    $network: s1(Bt),
+    $library: s1(void 0)
   };
 }
 function kwe({ network: e }) {
@@ -43942,13 +43947,13 @@ var Em = {}, km = {}, Vl = {};
 Object.defineProperty(Vl, "__esModule", { value: !0 });
 Vl.joseToDer = Vl.derToJose = void 0;
 const P9 = yf, O9 = Tn;
-function b1(e) {
+function bb(e) {
   return (e / 8 | 0) + (e % 8 === 0 ? 0 : 1);
 }
 const aY = {
-  ES256: b1(256),
-  ES384: b1(384),
-  ES512: b1(521)
+  ES256: bb(256),
+  ES384: bb(384),
+  ES512: bb(521)
 };
 function B9(e) {
   const t = aY[e];
@@ -44312,7 +44317,7 @@ var U8 = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
   const e = Array(256).fill(-1);
   for (let t = 0; t < U8.length; ++t) e[U8.charCodeAt(t)] = t;
 })();
-var C8, w1, yp, Y2 = (C8 = function(e, t) {
+var C8, wb, yp, Y2 = (C8 = function(e, t) {
   Object.defineProperty(t, "__esModule", { value: !0 }), t.bech32m = t.bech32 = void 0;
   const r = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", n = {};
   for (let f = 0; f < 32; f++) {
@@ -44406,7 +44411,7 @@ var C8, w1, yp, Y2 = (C8 = function(e, t) {
     }, toWords: s, fromWordsUnsafe: c, fromWords: l };
   }
   t.bech32 = u("bech32"), t.bech32m = u("bech32m");
-}, C8(w1 = { exports: {} }, w1.exports), w1.exports);
+}, C8(wb = { exports: {} }, wb.exports), wb.exports);
 (yp = Y2) && yp.__esModule && Object.prototype.hasOwnProperty.call(yp, "default") && yp.default;
 Y2.bech32m;
 Y2.bech32;
@@ -44884,7 +44889,7 @@ function kf(e, t = {}, r = {}) {
   }), i;
 }
 const lJ = "XVERSE_CONNECTED_WALLET_STATE";
-let fJ = class extends ns {
+class fJ extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       lJ,
@@ -45059,7 +45064,8 @@ let fJ = class extends ns {
       txId: y
     };
   }
-}, dJ = class extends ns {
+}
+class dJ extends ns {
   constructor() {
     super(...arguments), $e(this, "observer");
   }
@@ -45168,9 +45174,9 @@ let fJ = class extends ns {
       txId: l
     };
   }
-};
+}
 const hJ = "OYL_CONNECTED_WALLET_STATE";
-let pJ = class extends ns {
+class pJ extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       hJ,
@@ -45289,9 +45295,9 @@ let pJ = class extends ns {
   async switchNetwork() {
     throw dw;
   }
-};
+}
 const gJ = "LEATHER_CONNECTED_WALLET_STATE";
-let mJ = class extends ns {
+class mJ extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       gJ,
@@ -45355,7 +45361,7 @@ let mJ = class extends ns {
     ), a = o.find(
       (c) => c.type === nd
     ), s = o.find(
-      (c) => c.type === cb
+      (c) => c.type === c1
     );
     if (!(a != null && a.publicKey) || !(s != null && s.publicKey))
       throw new Error("No accounts found");
@@ -45386,7 +45392,7 @@ let mJ = class extends ns {
   }
   async signMessage(t, r) {
     var n;
-    const o = r === this.$store.get().address ? nd : cb;
+    const o = r === this.$store.get().address ? nd : c1;
     if (r !== this.$store.get().address && r !== this.$store.get().paymentAddress)
       throw new Error("Invalid address to sign message");
     const i = await this.library.request("signMessage", {
@@ -45448,7 +45454,7 @@ let mJ = class extends ns {
     ), r = t.addresses.map((n) => n.address);
     return this.$store.setKey("accounts", r), r;
   }
-};
+}
 var Q2 = {}, M9 = {}, Ti = {}, F9 = {};
 Object.defineProperty(F9, "__esModule", { value: !0 });
 (function(e) {
@@ -45828,7 +45834,7 @@ const RJ = /* @__PURE__ */ BU(Q2), {
   sendBtcTransaction: HJ,
   signTransaction: DJ
 } = RJ, KJ = "ORANGE_CONNECTED_WALLET_STATE";
-class qJ extends ns {
+let qJ = class extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       KJ,
@@ -46027,9 +46033,9 @@ class qJ extends ns {
       txId: y
     };
   }
-}
+};
 const MJ = "OKX_CONNECTED_WALLET_STATE";
-class FJ extends ns {
+let FJ = class extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       MJ,
@@ -46143,9 +46149,9 @@ class FJ extends ns {
       txId: void 0
     };
   }
-}
+};
 const VJ = "MAGIC_EDEN_CONNECTED_WALLET_STATE";
-class GJ extends ns {
+let GJ = class extends ns {
   constructor() {
     super(...arguments), $e(this, "observer"), $e(this, "$valueStore", kf(
       VJ,
@@ -46356,8 +46362,7 @@ class GJ extends ns {
       txId: y
     };
   }
-}
-class ZJ extends ns {
+}, ZJ = class extends ns {
   constructor() {
     super(...arguments), $e(this, "observer");
   }
@@ -46474,7 +46479,7 @@ class ZJ extends ns {
     const n = u_(t);
     await ((r = this.library) == null ? void 0 : r.switchChain(n)), this.$network.set(t), await this.getBalance();
   }
-}
+};
 class Twe {
   constructor(t, r) {
     $e(this, "$store"), $e(this, "$network"), $e(this, "$providerMap"), this.config = r, this.$store = t.$store, this.$network = t.$network, this.$providerMap = {
@@ -46793,7 +46798,7 @@ let aS = (e = {}) => {
     }, t.notify(o, r));
   }, t;
 };
-const Jc = "oyl", fc = "unisat", Ba = "xverse", Qc = "phantom", eu = "leather", Ua = "magic-eden", tu = "okx", ru = "wizz", dc = "orange", sS = "op_net", cd = "p2tr", rQ = "p2pkh", nQ = "p2sh-p2wpkh", yw = "p2wpkh", oQ = "p2wsh", cS = "p2sh", v1 = "defaultWallet", Yo = {
+const Jc = "oyl", fc = "unisat", Ba = "xverse", Qc = "phantom", eu = "leather", Ua = "magic-eden", tu = "okx", ru = "wizz", dc = "orange", sS = "op_net", cd = "p2tr", rQ = "p2pkh", nQ = "p2sh-p2wpkh", yw = "p2wpkh", oQ = "p2wsh", cS = "p2sh", vb = "defaultWallet", Yo = {
   /**
    * The message prefix used for signing Bitcoin messages.
    */
@@ -47732,7 +47737,7 @@ const TQ = Af(
   e3(),
   Cm(0),
   Um(4294967295)
-), E1 = Af(
+), Eb = Af(
   ES(),
   Cm(0n),
   Um(0x7fffffffffffffffn)
@@ -48075,7 +48080,7 @@ function LQ(e, t) {
 }
 const nl = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const k1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), zi = (e, t) => e << 32 - t | e >>> t, Ep = (e, t) => e << t | e >>> 32 - t >>> 0;
+const kb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), zi = (e, t) => e << 32 - t | e >>> t, Ep = (e, t) => e << t | e >>> 32 - t >>> 0;
 new Uint8Array(new Uint32Array([287454020]).buffer)[0];
 function HQ(e) {
   if (typeof e != "string")
@@ -48124,7 +48129,7 @@ function qQ(e, t, r, n) {
 const MQ = (e, t, r) => e & t ^ ~e & r, FQ = (e, t, r) => e & t ^ e & r ^ t & r;
 let c3 = class extends PS {
   constructor(e, t, r, n) {
-    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = k1(this.buffer);
+    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = kb(this.buffer);
   }
   update(e) {
     Y0(this);
@@ -48134,7 +48139,7 @@ let c3 = class extends PS {
     for (let i = 0; i < o; ) {
       const a = Math.min(n - this.pos, o - i);
       if (a === n) {
-        const s = k1(e);
+        const s = kb(e);
         for (; n <= o - i; i += n)
           this.process(s, i);
         continue;
@@ -48151,7 +48156,7 @@ let c3 = class extends PS {
     for (let u = i; u < n; u++)
       t[u] = 0;
     qQ(r, n - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = k1(e), s = this.outputLen;
+    const a = kb(e), s = this.outputLen;
     if (s % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const c = s / 4, l = this.get();
@@ -49030,11 +49035,11 @@ function ree(e) {
   };
 }
 var nee = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-const x1 = ree(nee);
+const xb = ree(nee);
 function oee(e) {
   function t(i) {
     var a = Uint8Array.from(i), s = e(a), c = a.length + 4, l = new Uint8Array(c);
-    return l.set(a, 0), l.set(s.subarray(0, 4), a.length), x1.encode(l);
+    return l.set(a, 0), l.set(s.subarray(0, 4), a.length), xb.encode(l);
   }
   function r(i) {
     var a = i.slice(0, -4), s = i.slice(-4), c = e(a);
@@ -49042,12 +49047,12 @@ function oee(e) {
       return a;
   }
   function n(i) {
-    var a = x1.decodeUnsafe(i);
+    var a = xb.decodeUnsafe(i);
     if (a != null)
       return r(a);
   }
   function o(i) {
-    var a = x1.decode(i), s = r(a);
+    var a = xb.decode(i), s = r(a);
     if (s == null)
       throw new Error("Invalid checksum");
     return s;
@@ -49550,7 +49555,7 @@ function Bh(e, t) {
   }
   return Object.assign(o, e);
 }
-const Y8 = qt, A1 = new Uint8Array(0);
+const Y8 = qt, Ab = new Uint8Array(0);
 function xp(e) {
   return !!(e instanceof Uint8Array && e.length === 65 && e[0] === 4 && pi(e));
 }
@@ -49600,16 +49605,16 @@ function Uh(e, t) {
     if (e.witness)
       return {
         output: e.witness[e.witness.length - 1],
-        input: A1,
+        input: Ab,
         witness: e.witness.slice(0, -1)
       };
   }), He(i, "input", () => {
     if (i.witness)
-      return A1;
+      return Ab;
   }), He(i, "witness", () => {
     if (e.redeem && e.redeem.input && e.redeem.input.length > 0 && e.redeem.output && e.redeem.output.length > 0) {
       const a = NQ(n());
-      return i.redeem = Object.assign({ witness: a }, e.redeem), i.redeem.input = A1, [].concat(a, e.redeem.output);
+      return i.redeem = Object.assign({ witness: a }, e.redeem), i.redeem.input = Ab, [].concat(a, e.redeem.output);
     }
     if (e.redeem && e.redeem.output && e.redeem.witness)
       return [].concat(e.redeem.witness, e.redeem.output);
@@ -50369,7 +50374,7 @@ function Uee(e) {
   const t = e.length;
   return Go(t) + e.reduce((r, n) => r + Mi(n), 0);
 }
-const oc = new Uint8Array(0), n5 = [], _1 = os(
+const oc = new Uint8Array(0), n5 = [], _b = os(
   "0000000000000000000000000000000000000000000000000000000000000000"
 ), o5 = os(
   "0000000000000000000000000000000000000000000000000000000000000001"
@@ -50446,7 +50451,7 @@ const ri = class Xt {
     }) - 1;
   }
   addOutput(t, r) {
-    return cr(Vi([Dt, E1]), [
+    return cr(Vi([Dt, Eb]), [
       t,
       r
     ]), this.outs.push({
@@ -50522,7 +50527,7 @@ const ri = class Xt {
       Vi([
         Ta,
         Qn(Dt),
-        Qn(E1),
+        Qn(Eb),
         Ta
       ]),
       [t, r, n, o]
@@ -50575,12 +50580,12 @@ const ri = class Xt {
       Vi([
         Ta,
         Dt,
-        E1,
+        Eb,
         Ta
       ]),
       [t, r, n, o]
     );
-    let i = Uint8Array.from([]), a, s = _1, c = _1, l = _1;
+    let i = Uint8Array.from([]), a, s = _b, c = _b, l = _b;
     if (o & Xt.SIGHASH_ANYONECANPAY || (i = new Uint8Array(36 * this.ins.length), a = new gn(i, 0), this.ins.forEach((f) => {
       a.writeSlice(f.hash), a.writeUInt32(f.index);
     }), c = Rc(i)), !(o & Xt.SIGHASH_ANYONECANPAY) && (o & 31) !== Xt.SIGHASH_SINGLE && (o & 31) !== Xt.SIGHASH_NONE && (i = new Uint8Array(4 * this.ins.length), a = new gn(i, 0), this.ins.forEach((f) => {
@@ -51599,7 +51604,7 @@ function gre({ globalMap: e, inputs: t, outputs: r }) {
   );
 }
 const mre = (e, t) => me(e.key, t.key);
-function S1(e, t) {
+function Sb(e, t) {
   const r = /* @__PURE__ */ new Set(), n = Object.entries(e).reduce((i, [a, s]) => {
     if (a === "unknownKeyVals") return i;
     const c = t[a];
@@ -51617,9 +51622,9 @@ function S1(e, t) {
 }
 function xw({ globalMap: e, inputs: t, outputs: r }) {
   return {
-    globalKeyVals: S1(e, y3),
-    inputKeyVals: t.map((n) => S1(n, Dr)),
-    outputKeyVals: r.map((n) => S1(n, Ia))
+    globalKeyVals: Sb(e, y3),
+    inputKeyVals: t.map((n) => Sb(n, Dr)),
+    outputKeyVals: r.map((n) => Sb(n, Ia))
   };
 }
 function yre(e) {
@@ -51637,14 +51642,14 @@ function yre(e) {
       );
     const u = xw(c);
     ol(u.globalKeyVals).forEach(
-      $1(
+      $b(
         i,
         r.globalKeyVals,
         u.globalKeyVals
       )
     ), u.inputKeyVals.map(ol).forEach(
       (f, h) => f.forEach(
-        $1(
+        $b(
           a[h],
           r.inputKeyVals[h],
           u.inputKeyVals[h]
@@ -51652,7 +51657,7 @@ function yre(e) {
       )
     ), u.outputKeyVals.map(ol).forEach(
       (f, h) => f.forEach(
-        $1(
+        $b(
           s[h],
           r.outputKeyVals[h],
           u.outputKeyVals[h]
@@ -51666,7 +51671,7 @@ function yre(e) {
     outputKeyVals: r.outputKeyVals
   });
 }
-function $1(e, t, r) {
+function $b(e, t, r) {
   return (n) => {
     if (e.has(n)) return;
     const o = r.filter((i) => Ze(i.key) === n)[0];
@@ -51695,7 +51700,7 @@ function qd(e, t) {
   if (r === void 0) throw new Error(`No output #${t}`);
   return r;
 }
-function T1(e, t, r) {
+function Tb(e, t, r) {
   if (e.key[0] < r)
     throw new Error(
       "Use the method for your specific key instead of addUnknownKeyVal*"
@@ -51703,7 +51708,7 @@ function T1(e, t, r) {
   if (t && t.filter((n) => me(n.key, e.key) === 0).length !== 0)
     throw new Error(`Duplicate Key: ${Ze(e.key)}`);
 }
-function I1(e) {
+function Ib(e) {
   let t = 0;
   return Object.keys(e).forEach((r) => {
     Number(isNaN(Number(r))) && t++;
@@ -51800,19 +51805,19 @@ let c5 = class {
     return r$(t, r), this;
   }
   addUnknownKeyValToGlobal(e) {
-    return T1(
+    return Tb(
       e,
       this.globalMap.unknownKeyVals,
-      I1(ea)
+      Ib(ea)
     ), this.globalMap.unknownKeyVals || (this.globalMap.unknownKeyVals = []), this.globalMap.unknownKeyVals.push(e), this;
   }
   addUnknownKeyValToInput(e, t) {
     const r = ln(this.inputs, e);
-    return T1(t, r.unknownKeyVals, I1(Se)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(t), this;
+    return Tb(t, r.unknownKeyVals, Ib(Se)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(t), this;
   }
   addUnknownKeyValToOutput(e, t) {
     const r = qd(this.outputs, e);
-    return T1(t, r.unknownKeyVals, I1(Ar)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(t), this;
+    return Tb(t, r.unknownKeyVals, Ib(Ar)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(t), this;
   }
   addInput(e) {
     this.globalMap.unsignedTx.addInput(e), this.inputs.push({
@@ -51943,7 +51948,7 @@ function _p(e, t) {
 function ai(e) {
   return e && !!(e.tapInternalKey || e.tapMerkleRoot || e.tapLeafScript && e.tapLeafScript.length || e.tapBip32Derivation && e.tapBip32Derivation.length || e.witnessUtxo && o$(e.witnessUtxo.script));
 }
-function P1(e, t) {
+function Pb(e, t) {
   return e && !!(e.tapInternalKey || e.tapTree || e.tapBip32Derivation && e.tapBip32Derivation.length || t);
 }
 function f5(e, t, r) {
@@ -52025,7 +52030,7 @@ function jre(e, t, r) {
     );
 }
 function zre(e, t, r) {
-  const n = P1(e) && $l(t), o = $l(e) && P1(t), i = e === t && P1(t) && $l(t);
+  const n = Pb(e) && $l(t), o = $l(e) && Pb(t), i = e === t && Pb(t) && $l(t);
   if (n || o || i)
     throw new Error(
       `Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`
@@ -52034,22 +52039,22 @@ function zre(e, t, r) {
 function Rre(e, t, r) {
   if (t.tapMerkleRoot) {
     const n = (t.tapLeafScript || []).every(
-      (i) => O1(i, t.tapMerkleRoot)
+      (i) => Ob(i, t.tapMerkleRoot)
     ), o = (e.tapLeafScript || []).every(
-      (i) => O1(i, t.tapMerkleRoot)
+      (i) => Ob(i, t.tapMerkleRoot)
     );
     if (!n || !o)
       throw new Error(
         `Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`
       );
   } else if (e.tapMerkleRoot && !(t.tapLeafScript || []).every(
-    (n) => O1(n, e.tapMerkleRoot)
+    (n) => Ob(n, e.tapMerkleRoot)
   ))
     throw new Error(
       `Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`
     );
 }
-function O1(e, t) {
+function Ob(e, t) {
   if (!t) return !0;
   const r = Ra({
     output: e.script,
@@ -52687,13 +52692,13 @@ class vr {
     return a;
   }
   toBuffer() {
-    return B1(this.__CACHE), this.data.toBuffer();
+    return Bb(this.__CACHE), this.data.toBuffer();
   }
   toHex() {
-    return B1(this.__CACHE), this.data.toHex();
+    return Bb(this.__CACHE), this.data.toHex();
   }
   toBase64() {
-    return B1(this.__CACHE), this.data.toBase64();
+    return Bb(this.__CACHE), this.data.toBase64();
   }
   updateGlobal(t) {
     return this.data.updateGlobal(t), this;
@@ -52768,7 +52773,7 @@ function Fre(e, t, r) {
       return !1;
   }
 }
-function B1(e) {
+function Bb(e) {
   if (e.__UNSAFE_SIGN_NONSEGWIT !== !1)
     throw new Error("Not BIP174 compliant, can not export");
 }
@@ -53427,9 +53432,9 @@ function hne(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-const U1 = (e) => typeof e == "bigint" && E3 <= e;
+const Ub = (e) => typeof e == "bigint" && E3 <= e;
 function Fm(e, t, r) {
-  return U1(e) && U1(t) && U1(r) && t <= e && e < r;
+  return Ub(e) && Ub(t) && Ub(r) && t <= e && e < r;
 }
 function hu(e, t, r, n) {
   if (!Fm(t, r, n))
@@ -53447,7 +53452,7 @@ function pne(e, t) {
 function gne(e, t, r) {
   return e | (r ? Mm : E3) << BigInt(t);
 }
-const _3 = (e) => (une << BigInt(e - 1)) - Mm, C1 = (e) => new Uint8Array(e), k5 = (e) => Uint8Array.from(e);
+const _3 = (e) => (une << BigInt(e - 1)) - Mm, Cb = (e) => new Uint8Array(e), k5 = (e) => Uint8Array.from(e);
 function k$(e, t, r) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -53455,10 +53460,10 @@ function k$(e, t, r) {
     throw new Error("qByteLen must be a number");
   if (typeof r != "function")
     throw new Error("hmacFn must be a function");
-  let n = C1(e), o = C1(e), i = 0;
+  let n = Cb(e), o = Cb(e), i = 0;
   const a = () => {
     n.fill(1), o.fill(0), i = 0;
-  }, s = (...u) => r(o, n, ...u), c = (u = C1()) => {
+  }, s = (...u) => r(o, n, ...u), c = (u = Cb()) => {
     o = s(k5([0]), u), n = s(), u.length !== 0 && (o = s(k5([1]), u), n = s());
   }, l = () => {
     if (i++ >= 1e3)
@@ -53753,7 +53758,7 @@ function $ne(e, t, r = !1) {
   return r ? A3(s, o) : Yl(s, o);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Tne = BigInt(0), N1 = BigInt(1), j1 = /* @__PURE__ */ new WeakMap(), _5 = /* @__PURE__ */ new WeakMap();
+const Tne = BigInt(0), Nb = BigInt(1), jb = /* @__PURE__ */ new WeakMap(), _5 = /* @__PURE__ */ new WeakMap();
 function Ine(e, t) {
   const r = (i, a) => {
     const s = a.negate();
@@ -53772,7 +53777,7 @@ function Ine(e, t) {
     unsafeLadder(i, a) {
       let s = e.ZERO, c = i;
       for (; a > Tne; )
-        a & N1 && (s = s.add(c)), c = c.double(), a >>= N1;
+        a & Nb && (s = s.add(c)), c = c.double(), a >>= Nb;
       return s;
     },
     /**
@@ -53810,7 +53815,7 @@ function Ine(e, t) {
       for (let m = 0; m < c; m++) {
         const w = m * l;
         let v = Number(s & h);
-        s >>= y, v > l && (v -= g, s += N1);
+        s >>= y, v > l && (v -= g, s += Nb);
         const x = w, E = w + Math.abs(v) - 1, S = m % 2 !== 0, O = v < 0;
         v === 0 ? f = f.add(r(S, a[x])) : u = u.add(r(O, a[E]));
       }
@@ -53818,14 +53823,14 @@ function Ine(e, t) {
     },
     wNAFCached(i, a, s) {
       const c = _5.get(i) || 1;
-      let l = j1.get(i);
-      return l || (l = this.precomputeWindow(i, c), c !== 1 && j1.set(i, s(l))), this.wNAF(c, l, a);
+      let l = jb.get(i);
+      return l || (l = this.precomputeWindow(i, c), c !== 1 && jb.set(i, s(l))), this.wNAF(c, l, a);
     },
     // 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.
     setWindowSize(i, a) {
-      n(a), _5.set(i, a), j1.delete(i);
+      n(a), _5.set(i, a), jb.delete(i);
     }
   };
 }
@@ -54577,7 +54582,7 @@ function Kne(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const qne = (e) => e instanceof Uint8Array, z1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ri = (e, t) => e << 32 - t | e >>> t, Mne = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const qne = (e) => e instanceof Uint8Array, zb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ri = (e, t) => e << 32 - t | e >>> t, Mne = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Mne)
   throw new Error("Non little-endian hardware is not supported");
 function Fne(e) {
@@ -54608,7 +54613,7 @@ function Zne(e, t, r, n) {
 }
 let Wne = class extends Vne {
   constructor(e, t, r, n) {
-    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = z1(this.buffer);
+    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = zb(this.buffer);
   }
   update(e) {
     P5(this);
@@ -54618,7 +54623,7 @@ let Wne = class extends Vne {
     for (let i = 0; i < o; ) {
       const a = Math.min(n - this.pos, o - i);
       if (a === n) {
-        const s = z1(e);
+        const s = zb(e);
         for (; n <= o - i; i += n)
           this.process(s, i);
         continue;
@@ -54635,7 +54640,7 @@ let Wne = class extends Vne {
     for (let u = i; u < n; u++)
       t[u] = 0;
     Zne(r, n - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = z1(e), s = this.outputLen;
+    const a = zb(e), s = this.outputLen;
     if (s % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const c = s / 4, l = this.get();
@@ -55183,7 +55188,7 @@ const yoe = new TextEncoder(), boe = new TextDecoder();
 function T3(e) {
   return yoe.encode(e);
 }
-function R1(e) {
+function Rb(e) {
   return boe.decode(e);
 }
 function woe(e, t) {
@@ -55348,7 +55353,7 @@ let Gt = (Je = class extends Uint8Array {
   }
   to_json(e) {
     e === void 0 && (e = $oe);
-    const t = R1(this);
+    const t = Rb(this);
     return JSON.parse(t, e);
   }
   to_bech32(e, t) {
@@ -55360,7 +55365,7 @@ let Gt = (Je = class extends Uint8Array {
     return r(e, o, t);
   }
   to_str() {
-    return R1(this);
+    return Rb(this);
   }
   to_hex() {
     return Eoe(this);
@@ -55431,7 +55436,7 @@ let Gt = (Je = class extends Uint8Array {
       return Je.of(255, ...Je.num(e, 8, t));
     throw new Error(`Value is too large: ${e}`);
   }
-}, Je.num = Ioe, Je.big = Ooe, Je.bin = Poe, Je.raw = Boe, Je.str = Uoe, Je.hex = Coe, Je.bytes = R5, Je.json = Noe, Je.base64 = joe, Je.b64url = zoe, Je.bech32 = Roe, Je.bech32m = Loe, Je.b58chk = Hoe, Je.encode = T3, Je.decode = R1, Je.parse = Doe, Je.is_bytes = Aoe, Je.is_hex = C$, Je);
+}, Je.num = Ioe, Je.big = Ooe, Je.bin = Poe, Je.raw = Boe, Je.str = Uoe, Je.hex = Coe, Je.bytes = R5, Je.json = Noe, Je.base64 = joe, Je.b64url = zoe, Je.bech32 = Roe, Je.bech32m = Loe, Je.b58chk = Hoe, Je.encode = T3, Je.decode = Rb, Je.parse = Doe, Je.is_bytes = Aoe, Je.is_hex = C$, Je);
 function Ioe(e, t, r) {
   return new Gt(e, t, r);
 }
@@ -55903,9 +55908,9 @@ const $ie = {
   exists: _ie,
   output: Sie
 };
-var L1 = $ie;
+var Lb = $ie;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const H1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Li = (e, t) => e << 32 - t | e >>> t, Tie = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Hb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Li = (e, t) => e << 32 - t | e >>> t, Tie = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Tie)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -55937,17 +55942,17 @@ function Oie(e, t, r, n) {
 }
 let Bie = class extends Pie {
   constructor(e, t, r, n) {
-    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = H1(this.buffer);
+    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Hb(this.buffer);
   }
   update(e) {
-    L1.exists(this);
+    Lb.exists(this);
     const { view: t, buffer: r, blockLen: n } = this;
     e = H$(e);
     const o = e.length;
     for (let i = 0; i < o; ) {
       const a = Math.min(n - this.pos, o - i);
       if (a === n) {
-        const s = H1(e);
+        const s = Hb(e);
         for (; n <= o - i; i += n)
           this.process(s, i);
         continue;
@@ -55957,14 +55962,14 @@ let Bie = class extends Pie {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    L1.exists(this), L1.output(e, this), this.finished = !0;
+    Lb.exists(this), Lb.output(e, this), this.finished = !0;
     const { buffer: t, view: r, blockLen: n, isLE: o } = this;
     let { pos: i } = this;
     t[i++] = 128, this.buffer.subarray(i).fill(0), this.padOffset > n - i && (this.process(r, 0), i = 0);
     for (let u = i; u < n; u++)
       t[u] = 0;
     Oie(r, n - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = H1(e), s = this.outputLen;
+    const a = Hb(e), s = this.outputLen;
     if (s % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const c = s / 4, l = this.get();
@@ -56426,7 +56431,7 @@ const pae = new TextEncoder(), gae = new TextDecoder();
 function O3(e) {
   return pae.encode(e);
 }
-function D1(e) {
+function Db(e) {
   return gae.decode(e);
 }
 function mae(e, t) {
@@ -56536,14 +56541,14 @@ let Y = (Tt = class extends Uint8Array {
     return new Tt(e);
   }
   toJson() {
-    const e = D1(this);
+    const e = Db(this);
     return JSON.parse(e);
   }
   toBech32(e, t = 0) {
     return Q$.encode(this, e, t);
   }
   toStr() {
-    return D1(this);
+    return Db(this);
   }
   toHex() {
     return bae(this);
@@ -56607,7 +56612,7 @@ let Y = (Tt = class extends Uint8Array {
       return Tt.of(255, ...Tt.num(e, 8, t));
     throw new Error(`Value is too large: ${e}`);
   }
-}, Tt.num = Eae, Tt.big = xae, Tt.bin = kae, Tt.raw = Aae, Tt.str = _ae, Tt.hex = Sae, Tt.bytes = $ae, Tt.json = Tae, Tt.base64 = Iae, Tt.b64url = Pae, Tt.bech32 = Oae, Tt.b58chk = Bae, Tt.encode = O3, Tt.decode = D1, Tt);
+}, Tt.num = Eae, Tt.big = xae, Tt.bin = kae, Tt.raw = Aae, Tt.str = _ae, Tt.hex = Sae, Tt.bytes = $ae, Tt.json = Tae, Tt.base64 = Iae, Tt.b64url = Pae, Tt.bech32 = Oae, Tt.b58chk = Bae, Tt.encode = O3, Tt.decode = Db, Tt);
 function Eae(e, t, r) {
   return new Y(e, t, r);
 }
@@ -56997,9 +57002,9 @@ const Wae = {
   output: Zae
 };
 var nu = Wae;
-const K1 = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const Kb = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const q1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Hi = (e, t) => e << 32 - t | e >>> t, Xae = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const qb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Hi = (e, t) => e << 32 - t | e >>> t, Xae = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Xae)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -57036,8 +57041,8 @@ function dT(e) {
   return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
 }
 function hT(e = 32) {
-  if (K1 && typeof K1.getRandomValues == "function")
-    return K1.getRandomValues(new Uint8Array(e));
+  if (Kb && typeof Kb.getRandomValues == "function")
+    return Kb.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function Qae(e, t, r, n) {
@@ -57048,7 +57053,7 @@ function Qae(e, t, r, n) {
 }
 let ese = class extends fT {
   constructor(e, t, r, n) {
-    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = q1(this.buffer);
+    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = qb(this.buffer);
   }
   update(e) {
     nu.exists(this);
@@ -57058,7 +57063,7 @@ let ese = class extends fT {
     for (let i = 0; i < o; ) {
       const a = Math.min(n - this.pos, o - i);
       if (a === n) {
-        const s = q1(e);
+        const s = qb(e);
         for (; n <= o - i; i += n)
           this.process(s, i);
         continue;
@@ -57075,7 +57080,7 @@ let ese = class extends fT {
     for (let u = i; u < n; u++)
       t[u] = 0;
     Qae(r, n - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = q1(e), s = this.outputLen;
+    const a = qb(e), s = this.outputLen;
     if (s % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const c = s / 4, l = this.get();
@@ -57297,7 +57302,7 @@ function lse(e) {
     ;
   return t;
 }
-const fse = (e, t) => e >> BigInt(t) & 1n, dse = (e, t, r) => e | (r ? C3 : ise) << BigInt(t), z3 = (e) => (ase << BigInt(e - 1)) - C3, M1 = (e) => new Uint8Array(e), K5 = (e) => Uint8Array.from(e);
+const fse = (e, t) => e >> BigInt(t) & 1n, dse = (e, t, r) => e | (r ? C3 : ise) << BigInt(t), z3 = (e) => (ase << BigInt(e - 1)) - C3, Mb = (e) => new Uint8Array(e), K5 = (e) => Uint8Array.from(e);
 function yT(e, t, r) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -57305,10 +57310,10 @@ function yT(e, t, r) {
     throw new Error("qByteLen must be a number");
   if (typeof r != "function")
     throw new Error("hmacFn must be a function");
-  let n = M1(e), o = M1(e), i = 0;
+  let n = Mb(e), o = Mb(e), i = 0;
   const a = () => {
     n.fill(1), o.fill(0), i = 0;
-  }, s = (...u) => r(o, n, ...u), c = (u = M1()) => {
+  }, s = (...u) => r(o, n, ...u), c = (u = Mb()) => {
     o = s(K5([0]), u), n = s(), u.length !== 0 && (o = s(K5([1]), u), n = s());
   }, l = () => {
     if (i++ >= 1e3)
@@ -57573,7 +57578,7 @@ function kse(e, t, r = !1) {
   return Gr(i, t - Pr) + Pr;
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const xse = BigInt(0), F1 = BigInt(1);
+const xse = BigInt(0), Fb = BigInt(1);
 function Ase(e, t) {
   const r = (o, i) => {
     const a = i.negate();
@@ -57588,7 +57593,7 @@ function Ase(e, t) {
     unsafeLadder(o, i) {
       let a = e.ZERO, s = o;
       for (; i > xse; )
-        i & F1 && (a = a.add(s)), s = s.double(), i >>= F1;
+        i & Fb && (a = a.add(s)), s = s.double(), i >>= Fb;
       return a;
     },
     /**
@@ -57626,7 +57631,7 @@ function Ase(e, t) {
       for (let y = 0; y < s; y++) {
         const m = y * c;
         let w = Number(a & f);
-        a >>= g, w > c && (w -= h, a += F1);
+        a >>= g, w > c && (w -= h, a += Fb);
         const v = m, x = m + Math.abs(w) - 1, E = y % 2 !== 0, S = w < 0;
         w === 0 ? u = u.add(r(E, i[v])) : l = l.add(r(S, i[x]));
       }
@@ -58471,7 +58476,7 @@ function fg(e, ...t) {
   }
   return sg(uo(r, ...t));
 }
-const H3 = (e) => e.toRawBytes(!0).slice(1), Dw = (e) => gc(e, 32), V1 = (e) => Gr(e, Ym), Vd = (e) => Gr(e, ug), D3 = fa.ProjectivePoint, qse = (e, t, r) => D3.BASE.multiplyAndAddUnsafe(e, t, r);
+const H3 = (e) => e.toRawBytes(!0).slice(1), Dw = (e) => gc(e, 32), Vb = (e) => Gr(e, Ym), Vd = (e) => Gr(e, ug), D3 = fa.ProjectivePoint, qse = (e, t, r) => D3.BASE.multiplyAndAddUnsafe(e, t, r);
 function Kw(e) {
   let t = fa.utils.normPrivateKeyToScalar(e), r = D3.fromPrivateKey(t);
   return { scalar: r.hasEvenY() ? t : Vd(-t), bytes: H3(r) };
@@ -58479,9 +58484,9 @@ function Kw(e) {
 function ST(e) {
   if (!_T(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = V1(e * e), r = V1(t * e + BigInt(7));
+  const t = Vb(e * e), r = Vb(t * e + BigInt(7));
   let n = AT(r);
-  n % lg !== Jm && (n = V1(-n));
+  n % lg !== Jm && (n = Vb(-n));
   const o = new D3(e, n, xT);
   return o.assertValidity(), o;
 }
@@ -58614,9 +58619,9 @@ const Qse = {
   exists: Yse,
   output: Jse
 };
-var G1 = Qse;
+var Gb = Qse;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Z1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Di = (e, t) => e << 32 - t | e >>> t, ece = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Zb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Di = (e, t) => e << 32 - t | e >>> t, ece = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!ece)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -58648,17 +58653,17 @@ function nce(e, t, r, n) {
 }
 let oce = class extends rce {
   constructor(e, t, r, n) {
-    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Z1(this.buffer);
+    super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Zb(this.buffer);
   }
   update(e) {
-    G1.exists(this);
+    Gb.exists(this);
     const { view: t, buffer: r, blockLen: n } = this;
     e = PT(e);
     const o = e.length;
     for (let i = 0; i < o; ) {
       const a = Math.min(n - this.pos, o - i);
       if (a === n) {
-        const s = Z1(e);
+        const s = Zb(e);
         for (; n <= o - i; i += n)
           this.process(s, i);
         continue;
@@ -58668,14 +58673,14 @@ let oce = class extends rce {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    G1.exists(this), G1.output(e, this), this.finished = !0;
+    Gb.exists(this), Gb.output(e, this), this.finished = !0;
     const { buffer: t, view: r, blockLen: n, isLE: o } = this;
     let { pos: i } = this;
     t[i++] = 128, this.buffer.subarray(i).fill(0), this.padOffset > n - i && (this.process(r, 0), i = 0);
     for (let u = i; u < n; u++)
       t[u] = 0;
     nce(r, n - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = Z1(e), s = this.outputLen;
+    const a = Zb(e), s = this.outputLen;
     if (s % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const c = s / 4, l = this.get();
@@ -59616,7 +59621,7 @@ const _ue = {
 };
 var iu = _ue;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Sue = (e) => e instanceof Uint8Array, W1 = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ki = (e, t) => e << 32 - t | e >>> t, $ue = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Sue = (e) => e instanceof Uint8Array, Wb = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), Ki = (e, t) => e << 32 - t | e >>> t, $ue = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!$ue)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -59648,7 +59653,7 @@ function Iue(e, t, r, n) {
 }
 class V3 extends tI {
   constructor(t, r, n, o) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = W1(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Wb(this.buffer);
   }
   update(t) {
     iu.exists(this);
@@ -59658,7 +59663,7 @@ class V3 extends tI {
     for (let a = 0; a < i; ) {
       const s = Math.min(o - this.pos, i - a);
       if (s === o) {
-        const c = W1(t);
+        const c = Wb(t);
         for (; o <= i - a; a += o)
           this.process(c, a);
         continue;
@@ -59675,7 +59680,7 @@ class V3 extends tI {
     for (let f = a; f < o; f++)
       r[f] = 0;
     Iue(n, o - 8, BigInt(this.length * 8), i), this.process(n, 0);
-    const s = W1(t), c = this.outputLen;
+    const s = Wb(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, u = this.get();
@@ -64811,7 +64816,7 @@ oy.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
 var bi = {}, Ma = {};
 Object.defineProperty(Ma, "__esModule", { value: !0 });
 Ma.HashMD = Ma.Maj = Ma.Chi = void 0;
-const X1 = Ao, Yf = Uc;
+const Xb = Ao, Yf = Uc;
 function dhe(e, t, r, n) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, r, n);
@@ -64827,7 +64832,7 @@ class ghe extends Yf.Hash {
     super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = o, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = (0, Yf.createView)(this.buffer);
   }
   update(t) {
-    (0, X1.exists)(this);
+    (0, Xb.exists)(this);
     const { view: r, buffer: n, blockLen: o } = this;
     t = (0, Yf.toBytes)(t);
     const i = t.length;
@@ -64844,7 +64849,7 @@ class ghe extends Yf.Hash {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    (0, X1.exists)(this), (0, X1.output)(t, this), this.finished = !0;
+    (0, Xb.exists)(this), (0, Xb.output)(t, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: o, isLE: i } = this;
     let { pos: a } = this;
     r[a++] = 128, this.buffer.subarray(a).fill(0), this.padOffset > o - a && (this.process(n, 0), a = 0);
@@ -64875,7 +64880,7 @@ class ghe extends Yf.Hash {
 Ma.HashMD = ghe;
 Object.defineProperty(bi, "__esModule", { value: !0 });
 bi.sha224 = bi.sha256 = bi.SHA256 = void 0;
-const Y1 = Ma, Lo = Uc, mhe = /* @__PURE__ */ new Uint32Array([
+const Yb = Ma, Lo = Uc, mhe = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -64950,7 +64955,7 @@ const Y1 = Ma, Lo = Uc, mhe = /* @__PURE__ */ new Uint32Array([
   528734635,
   1541459225
 ]), Js = /* @__PURE__ */ new Uint32Array(64);
-class fE extends Y1.HashMD {
+class fE extends Yb.HashMD {
   constructor() {
     super(64, 32, 8, !1), this.A = Ys[0] | 0, this.B = Ys[1] | 0, this.C = Ys[2] | 0, this.D = Ys[3] | 0, this.E = Ys[4] | 0, this.F = Ys[5] | 0, this.G = Ys[6] | 0, this.H = Ys[7] | 0;
   }
@@ -64971,7 +64976,7 @@ class fE extends Y1.HashMD {
     }
     let { A: n, B: o, C: i, D: a, E: s, F: c, G: l, H: u } = this;
     for (let f = 0; f < 64; f++) {
-      const h = (0, Lo.rotr)(s, 6) ^ (0, Lo.rotr)(s, 11) ^ (0, Lo.rotr)(s, 25), g = u + h + (0, Y1.Chi)(s, c, l) + mhe[f] + Js[f] | 0, y = ((0, Lo.rotr)(n, 2) ^ (0, Lo.rotr)(n, 13) ^ (0, Lo.rotr)(n, 22)) + (0, Y1.Maj)(n, o, i) | 0;
+      const h = (0, Lo.rotr)(s, 6) ^ (0, Lo.rotr)(s, 11) ^ (0, Lo.rotr)(s, 25), g = u + h + (0, Yb.Chi)(s, c, l) + mhe[f] + Js[f] | 0, y = ((0, Lo.rotr)(n, 2) ^ (0, Lo.rotr)(n, 13) ^ (0, Lo.rotr)(n, 22)) + (0, Yb.Maj)(n, o, i) | 0;
       u = l, l = c, c = s, s = a + g | 0, a = i, i = o, o = n, n = g + y | 0;
     }
     n = n + this.A | 0, o = o + this.B | 0, i = i + this.C | 0, a = a + this.D | 0, s = s + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, u = u + this.H | 0, this.set(n, o, i, a, s, c, l, u);
@@ -65345,9 +65350,9 @@ var cP = {}, Of = {};
 Of.byteLength = vpe;
 Of.toByteArray = kpe;
 Of.fromByteArray = _pe;
-var Yi = [], Do = [], bpe = typeof Uint8Array < "u" ? Uint8Array : Array, J1 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var il = 0, wpe = J1.length; il < wpe; ++il)
-  Yi[il] = J1[il], Do[J1.charCodeAt(il)] = il;
+var Yi = [], Do = [], bpe = typeof Uint8Array < "u" ? Uint8Array : Array, Jb = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var il = 0, wpe = Jb.length; il < wpe; ++il)
+  Yi[il] = Jb[il], Do[Jb.charCodeAt(il)] = il;
 Do[45] = 62;
 Do[95] = 63;
 function uP(e) {
@@ -66495,10 +66500,10 @@ const Jpe = (e, t, r, { allOwnKeys: n } = {}) => (Vh(t, (o, i) => {
   };
   return Uf(e) ? n(e) : n(String(e).split(t)), r;
 }, d0e = () => {
-}, h0e = (e, t) => e != null && Number.isFinite(e = +e) ? e : t, Q1 = "abcdefghijklmnopqrstuvwxyz", s6 = "0123456789", xP = {
+}, h0e = (e, t) => e != null && Number.isFinite(e = +e) ? e : t, Qb = "abcdefghijklmnopqrstuvwxyz", s6 = "0123456789", xP = {
   DIGIT: s6,
-  ALPHA: Q1,
-  ALPHA_DIGIT: Q1 + Q1.toUpperCase() + s6
+  ALPHA: Qb,
+  ALPHA_DIGIT: Qb + Qb.toUpperCase() + s6
 }, p0e = (e = 16, t = xP.ALPHA_DIGIT) => {
   let r = "";
   const { length: n } = t;
@@ -66996,7 +67001,7 @@ function R0e(e) {
   return t;
 }
 const L0e = (e) => /^[-_a-zA-Z0-9^`|~,!#$%&'*+.]+$/.test(e.trim());
-function eb(e, t, r, n, o) {
+function e1(e, t, r, n, o) {
   if (re.isFunction(n))
     return n.call(this, t, r);
   if (o && (t = r), !!re.isString(t)) {
@@ -67065,7 +67070,7 @@ class ro {
   has(t, r) {
     if (t = Jf(t), t) {
       const n = re.findKey(this, t);
-      return !!(n && this[n] !== void 0 && (!r || eb(this, this[n], n, r)));
+      return !!(n && this[n] !== void 0 && (!r || e1(this, this[n], n, r)));
     }
     return !1;
   }
@@ -67075,7 +67080,7 @@ class ro {
     function i(a) {
       if (a = Jf(a), a) {
         const s = re.findKey(n, a);
-        s && (!r || eb(n, n[s], s, r)) && (delete n[s], o = !0);
+        s && (!r || e1(n, n[s], s, r)) && (delete n[s], o = !0);
       }
     }
     return re.isArray(t) ? t.forEach(i) : i(t), o;
@@ -67085,7 +67090,7 @@ class ro {
     let n = r.length, o = !1;
     for (; n--; ) {
       const i = r[n];
-      (!t || eb(this, this[i], i, t, !0)) && (delete this[i], o = !0);
+      (!t || e1(this, this[i], i, t, !0)) && (delete this[i], o = !0);
     }
     return o;
   }
@@ -67149,7 +67154,7 @@ re.reduceDescriptors(ro.prototype, ({ value: e }, t) => {
   };
 });
 re.freezeMethods(ro);
-function tb(e, t) {
+function t1(e, t) {
   const r = this || Gh, n = t || r, o = ro.from(n.headers);
   let i = n.data;
   return re.forEach(e, function(a) {
@@ -67693,22 +67698,22 @@ const y6 = (e) => `- ${e}`, age = (e) => re.isFunction(e) || e === null || e ===
   },
   adapters: av
 };
-function rb(e) {
+function r1(e) {
   if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
     throw new Cf(null, e);
 }
 function b6(e) {
-  return rb(e), e.headers = ro.from(e.headers), e.data = tb.call(
+  return r1(e), e.headers = ro.from(e.headers), e.data = t1.call(
     e,
     e.transformRequest
   ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), RP.getAdapter(e.adapter || Gh.adapter)(e).then(function(t) {
-    return rb(e), t.data = tb.call(
+    return r1(e), t.data = t1.call(
       e,
       e.transformResponse,
       t
     ), t.headers = ro.from(t.headers), t;
   }, function(t) {
-    return BP(t) || (rb(e), t && t.response && (t.response.data = tb.call(
+    return BP(t) || (r1(e), t && t.response && (t.response.data = t1.call(
       e,
       e.transformResponse,
       t.response
@@ -89470,7 +89475,7 @@ function Nf(...e) {
     }
   };
 }
-const dv = Nf(yy(), hy(), gy(0), py(4294967295)), sme = Nf(yy(), hy(), gy(0), py(2147483647)), cme = Nf(yy(), hy(), gy(0), py(255)), nb = Nf(my(Uint8Array), PE(32)), ume = Nf(my(Uint8Array), PE(33)), lme = fv({
+const dv = Nf(yy(), hy(), gy(0), py(4294967295)), sme = Nf(yy(), hy(), gy(0), py(2147483647)), cme = Nf(yy(), hy(), gy(0), py(255)), n1 = Nf(my(Uint8Array), PE(32)), ume = Nf(my(Uint8Array), PE(33)), lme = fv({
   wif: cme,
   bip32: fv({
     public: dv,
@@ -89697,7 +89702,7 @@ function pme(e) {
     return c(h, g, y);
   }
   function c(h, g, y, m, w, v) {
-    if (_a(nb, h), _a(nb, g), y = y || t, !e.isPrivate(h))
+    if (_a(n1, h), _a(n1, g), y = y || t, !e.isPrivate(h))
       throw new TypeError("Private key not in range [1, n)");
     return new i(h, void 0, g, y, m, w, v);
   }
@@ -89705,7 +89710,7 @@ function pme(e) {
     return u(h, g, y);
   }
   function u(h, g, y, m, w, v) {
-    if (_a(ume, h), _a(nb, g), y = y || t, !e.isPoint(h))
+    if (_a(ume, h), _a(n1, g), y = y || t, !e.isPoint(h))
       throw new TypeError("Point is not on the curve");
     return new i(void 0, h, g, y, m, w, v);
   }
@@ -89730,60 +89735,68 @@ jS(bE);
 const yme = async ({
   contentBase64: e,
   mimeType: t,
-  ordinalAddress: r,
-  paymentAddress: n,
-  paymentPublicKey: o,
-  signPsbt: i
+  quantity: r = 1,
+  inscriptions: n,
+  ordinalAddress: o,
+  paymentAddress: i,
+  paymentPublicKey: a,
+  signPsbt: s
 }) => {
   try {
-    const a = await vme(), s = Buffer.from(a).toString("hex"), c = await bme({
-      contentBase64: e,
-      mimeType: t,
-      paymentAddress: n,
-      paymentPublicKey: o,
-      privKey: s
+    if (!e && !n)
+      throw new Error("contentBase64 or inscriptions is required");
+    const c = await vme(), l = Buffer.from(c).toString("hex"), u = n || Array(r).fill({
+      content: e,
+      mimeType: t
+    });
+    console.log("INSCRIPTIONS", u);
+    const f = await bme({
+      inscriptions: u,
+      paymentAddress: i,
+      paymentPublicKey: a,
+      privKey: l
     });
-    if (!c || !(c != null && c.psbtHex))
+    if (!f || !(f != null && f.psbtHex))
       throw new Error("couldn't get commit tx");
-    const l = String(c == null ? void 0 : c.psbtHex), u = String(c == null ? void 0 : c.psbtBase64), f = await i(
+    const h = String(f == null ? void 0 : f.psbtHex), g = String(f == null ? void 0 : f.psbtBase64), y = await s(
       "",
-      l,
-      u,
+      h,
+      g,
       !0,
       !1
     );
-    if (!f) throw new Error("sign psbt failed");
-    const h = vr.fromHex((f == null ? void 0 : f.signedPsbtHex) || "").extractTransaction(), g = await TE(h.toHex(), Rt);
-    if (!g) throw new Error("commit tx failed");
+    if (!y) throw new Error("sign psbt failed");
+    const m = vr.fromHex((y == null ? void 0 : y.signedPsbtHex) || "").extractTransaction(), w = await TE(m.toHex(), Rt);
+    if (!w) throw new Error("commit tx failed");
     return await wme({
-      contentBase64: e,
-      mimeType: t,
-      ordinalAddress: r,
-      privKey: s,
-      commitTxId: g
+      inscriptions: u,
+      ordinalAddress: o,
+      privKey: l,
+      commitTxId: w
     });
-  } catch (a) {
-    throw a;
+  } catch (c) {
+    throw c;
   }
 }, bme = async ({
-  contentBase64: e,
-  mimeType: t,
-  paymentAddress: r,
-  paymentPublicKey: n,
-  privKey: o
+  inscriptions: e,
+  paymentAddress: t,
+  paymentPublicKey: r,
+  privKey: n
 }) => {
   try {
-    const i = Buffer.from(e).length;
+    const o = e.length, i = e.reduce(
+      (S, O) => S + Buffer.from(O.content).length,
+      0
+    );
     if (i > 39e4)
       throw new Error("Content size is too large, must be less than 390kb");
-    const { fastestFee: a } = await _me(Rt), s = R$(String(o), !0), c = new vr({
+    const { fastestFee: a } = await _me(Rt), s = R$(String(n), !0), c = new vr({
       network: Yo
     }), { inscriberAddress: l } = Eme(
       s,
-      e,
-      t
-    ), u = 5 * 34, f = Math.floor(u * a), h = Math.floor(i * a / 3) + 1e3 + 546, g = Math.floor(f + h), y = (await $E(
-      r,
+      e
+    ), u = 5 * 34 * o, f = Math.floor(u * a * o), h = Math.floor(i * a / 3) + 1e3 + 546 * o, g = Math.floor(f + h), y = (await $E(
+      t,
       Rt
     )).filter((S) => S.value > 3e3).sort((S, O) => O.value - S.value), m = yge(y);
     if (m === 0)
@@ -89791,18 +89804,18 @@ const yme = async ({
     if (m < g)
       throw new Error("insufficient funds");
     let w = 0;
-    const v = await p3(r);
+    const v = await p3(t);
     let x = 0;
     for await (const S of y) {
-      const O = bge(r, Rt);
+      const O = bge(t, Rt);
       if (console.log({ paymentAddressType: O }), c.addInput({
         hash: S.txid,
         index: S.vout,
         witnessUtxo: { value: BigInt(S.value), script: v }
       }), O === cd && c.updateInput(x, {
-        tapInternalKey: fd(Buffer.from(n, "hex"))
+        tapInternalKey: fd(Buffer.from(r, "hex"))
       }), O === cS) {
-        let T = KP(n, Rt);
+        let T = KP(r, Rt);
         c.updateInput(x, { redeemScript: T });
       }
       if (x++, w += S.value, w > g)
@@ -89814,85 +89827,82 @@ const yme = async ({
       address: l
     }), E > 546 && c.addOutput({
       value: BigInt(E),
-      address: r
+      address: t
     }), {
       psbtHex: c.toHex(),
       psbtBase64: c.toBase64()
     };
-  } catch (i) {
-    throw i;
+  } catch (o) {
+    throw o;
   }
 }, wme = async ({
-  contentBase64: e,
-  mimeType: t,
-  ordinalAddress: r,
-  commitTxId: n,
-  privKey: o,
-  isDry: i
+  inscriptions: e,
+  ordinalAddress: t,
+  commitTxId: r,
+  privKey: n,
+  isDry: o
 }) => {
   try {
-    const a = kie(o), s = R$(o, !0), c = TO(s, e, t), l = mg.encodeScript(c), [u, f] = mg.getPubKey(s, { target: l });
-    if (!await Ame(String(n)))
+    const i = kie(n), a = R$(n, !0), s = TO(a, e), c = mg.encodeScript(s), [l, u] = mg.getPubKey(a, { target: c });
+    if (!await Ame(String(r)))
       throw new Error("ERROR WAITING FOR COMMIT TX");
-    const h = await Sme(n, 0);
-    if (h === 0 || !h)
+    const f = await Sme(r, 0);
+    if (f === 0 || !f)
       throw new Error("ERROR GETTING FIRST INPUT VALUE");
-    const g = gi.create({
+    const h = gi.create({
       vin: [
         {
-          txid: n,
+          txid: r,
           vout: 0,
           prevout: {
-            value: h,
-            scriptPubKey: ["OP_1", u]
+            value: f,
+            scriptPubKey: ["OP_1", l]
           }
         }
       ],
       vout: [
-        {
+        ...Array(e.length).fill({
           value: 546,
-          scriptPubKey: BI.toScriptPubKey(r)
-        }
+          scriptPubKey: BI.toScriptPubKey(t)
+        })
       ]
-    }), y = rde.taproot.sign(a, g, 0, { extension: l });
-    return g.vin[0].witness = [y, c, f], i ? gi.util.getTxid(g) : await TE(gi.encode(g).hex, Rt);
-  } catch (a) {
-    throw a;
+    }), g = rde.taproot.sign(i, h, 0, { extension: c });
+    return h.vin[0].witness = [g, s, u], o ? gi.util.getTxid(h) : await TE(gi.encode(h).hex, Rt);
+  } catch (i) {
+    throw i;
   }
 };
 async function vme() {
   const e = crypto.getRandomValues(new Uint8Array(32)), t = Kge(Buffer.from(e)), r = await Dge(t), n = mme.fromSeed(r);
   return n == null ? void 0 : n.derivePath("m/44'/0'/0'/0/0").privateKey;
 }
-const TO = (e, t, r) => {
-  const n = new TextEncoder(), o = n.encode("ord");
-  let i;
-  if (r === gme) {
-    const s = Buffer.from(t, "base64").toString("utf-8");
-    i = Buffer.from(s, "utf-8");
-  } else
-    i = Buffer.from(t, "base64");
-  const a = [];
-  for (let s = 0; s < i.length; s += 520)
-    a.push(i.slice(s, s + 520));
-  return [
-    e,
-    "OP_CHECKSIG",
-    "OP_0",
-    "OP_IF",
-    o,
-    "01",
-    n.encode(r),
-    "OP_0",
-    ...a.map((s) => s),
-    "OP_ENDIF"
-  ];
-}, Eme = (e, t, r) => {
-  const n = TO(e, t, r), o = mg.encodeScript(n), [i] = mg.getPubKey(e, { target: o });
+const TO = (e, t) => {
+  const r = new TextEncoder(), n = r.encode("ord"), o = 546, i = (s, c) => {
+    let l;
+    if (c === gme) {
+      const f = Buffer.from(s, "base64").toString("utf-8");
+      l = Buffer.from(f, "utf-8");
+    } else
+      l = Buffer.from(s, "base64");
+    const u = [];
+    for (let f = 0; f < l.length; f += 520)
+      u.push(l.slice(f, f + 520));
+    return u;
+  }, a = [e, "OP_CHECKSIG"];
+  return t.forEach((s, c) => {
+    const { content: l, mimeType: u } = s, f = i(l, u);
+    if (a.push("OP_0", "OP_IF", n, "01", r.encode(u), "OP_0"), c > 0) {
+      const h = o * (c + 1), g = Buffer.from([h]);
+      a.push(Buffer.from([2])), a.push(g);
+    }
+    a.push(...f.map((h) => h), "OP_ENDIF");
+  }), a;
+}, Eme = (e, t) => {
+  const r = TO(e, t), n = mg.encodeScript(r), [o] = mg.getPubKey(e, { target: n });
   return {
-    inscriberAddress: BI.p2tr.fromPubKey(i),
-    tpubkey: i,
-    tapleaf: o
+    inscriberAddress: BI.p2tr.fromPubKey(o),
+    tpubkey: o,
+    tapleaf: n
   };
 };
 async function kme(e, t = Rt) {
@@ -90583,13 +90593,13 @@ var Ey = {}, ky = {}, cf = {};
 Object.defineProperty(cf, "__esModule", { value: !0 });
 cf.joseToDer = cf.derToJose = void 0;
 const jO = Of, zO = In;
-function ob(e) {
+function o1(e) {
   return (e / 8 | 0) + (e % 8 === 0 ? 0 : 1);
 }
 const Lme = {
-  ES256: ob(256),
-  ES384: ob(384),
-  ES512: ob(521)
+  ES256: o1(256),
+  ES384: o1(384),
+  ES512: o1(521)
 };
 function RO(e) {
   const t = Lme[e];
@@ -90953,7 +90963,7 @@ var C6 = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
   const e = Array(256).fill(-1);
   for (let t = 0; t < C6.length; ++t) e[C6.charCodeAt(t)] = t;
 })();
-var N6, ib, Rp, CE = (N6 = function(e, t) {
+var N6, i1, Rp, CE = (N6 = function(e, t) {
   Object.defineProperty(t, "__esModule", { value: !0 }), t.bech32m = t.bech32 = void 0;
   const r = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", n = {};
   for (let f = 0; f < 32; f++) {
@@ -91047,7 +91057,7 @@ var N6, ib, Rp, CE = (N6 = function(e, t) {
     }, toWords: s, fromWordsUnsafe: c, fromWords: l };
   }
   t.bech32 = u("bech32"), t.bech32m = u("bech32m");
-}, N6(ib = { exports: {} }, ib.exports), ib.exports);
+}, N6(i1 = { exports: {} }, i1.exports), i1.exports);
 (Rp = CE) && Rp.__esModule && Object.prototype.hasOwnProperty.call(Rp, "default") && Rp.default;
 CE.bech32m;
 CE.bech32;
@@ -92286,10 +92296,10 @@ const Xye = 4e5, Yye = 6e4, Jye = (e) => {
 Xh.validateInscriptionPayload = Jye;
 Object.defineProperty(Ty, "__esModule", { value: !0 });
 Ty.createInscription = void 0;
-const Qye = _o, e1e = Pi, t1e = Xh, r1e = async (e) => {
+const Qye = _o, ebe = Pi, tbe = Xh, rbe = async (e) => {
   var t, r;
-  const { getProvider: n } = e, o = await (0, e1e.getProviderOrThrow)(n);
-  (0, t1e.validateInscriptionPayload)(e.payload);
+  const { getProvider: n } = e, o = await (0, ebe.getProviderOrThrow)(n);
+  (0, tbe.validateInscriptionPayload)(e.payload);
   try {
     const i = (0, Qye.createUnsecuredToken)(e.payload), a = await o.createInscription(i);
     (t = e.onFinish) == null || t.call(e, a);
@@ -92297,22 +92307,22 @@ const Qye = _o, e1e = Pi, t1e = Xh, r1e = async (e) => {
     console.error("[Connect] Error during create inscription", i), (r = e.onCancel) == null || r.call(e);
   }
 };
-Ty.createInscription = r1e;
+Ty.createInscription = rbe;
 var Iy = {};
 Object.defineProperty(Iy, "__esModule", { value: !0 });
 Iy.createRepeatInscriptions = void 0;
-const n1e = Pi, o1e = _o, i1e = Xh, a1e = async (e) => {
+const nbe = Pi, obe = _o, ibe = Xh, abe = async (e) => {
   var t, r;
-  const { getProvider: n } = e, o = await (0, n1e.getProviderOrThrow)(n);
-  (0, i1e.validateInscriptionPayload)(e.payload);
+  const { getProvider: n } = e, o = await (0, nbe.getProviderOrThrow)(n);
+  (0, ibe.validateInscriptionPayload)(e.payload);
   try {
-    const i = (0, o1e.createUnsecuredToken)(e.payload), a = await o.createRepeatInscriptions(i);
+    const i = (0, obe.createUnsecuredToken)(e.payload), a = await o.createRepeatInscriptions(i);
     (t = e.onFinish) == null || t.call(e, a);
   } catch (i) {
     console.error("[Connect] Error during create repeat inscriptions", i), (r = e.onCancel) == null || r.call(e);
   }
 };
-Iy.createRepeatInscriptions = a1e;
+Iy.createRepeatInscriptions = abe;
 var aB = {};
 Object.defineProperty(aB, "__esModule", { value: !0 });
 (function(e) {
@@ -92363,15 +92373,15 @@ Object.defineProperty(cB, "__esModule", { value: !0 });
 var uB = {}, Py = {};
 Object.defineProperty(Py, "__esModule", { value: !0 });
 Py.sendBtcTransaction = void 0;
-const s1e = _o, c1e = Pi, u1e = (e) => e.map((t) => {
+const sbe = _o, cbe = Pi, ube = (e) => e.map((t) => {
   const { address: r, amountSats: n } = t;
   return {
     address: r,
     amountSats: n.toString()
   };
-}), l1e = async (e) => {
+}), lbe = async (e) => {
   var t, r;
-  const n = await (0, c1e.getProviderOrThrow)(e.getProvider), { recipients: o, senderAddress: i, network: a, message: s } = e.payload;
+  const n = await (0, cbe.getProviderOrThrow)(e.getProvider), { recipients: o, senderAddress: i, network: a, message: s } = e.payload;
   if (!o || o.length === 0)
     throw new Error("At least one recipient is required");
   if (o.some((c) => typeof c.address != "string" || typeof c.amountSats != "bigint"))
@@ -92379,54 +92389,54 @@ const s1e = _o, c1e = Pi, u1e = (e) => e.map((t) => {
   if (!i)
     throw new Error("The sender address is required");
   try {
-    const c = u1e(o), l = {
+    const c = ube(o), l = {
       network: a,
       senderAddress: i,
       message: s,
       recipients: c
-    }, u = (0, s1e.createUnsecuredToken)(l), f = await n.sendBtcTransaction(u);
+    }, u = (0, sbe.createUnsecuredToken)(l), f = await n.sendBtcTransaction(u);
     (t = e.onFinish) == null || t.call(e, f);
   } catch (c) {
     console.error("[Connect] Error during send BTC transaction request", c), (r = e.onCancel) == null || r.call(e);
   }
 };
-Py.sendBtcTransaction = l1e;
+Py.sendBtcTransaction = lbe;
 var Oy = {};
 Object.defineProperty(Oy, "__esModule", { value: !0 });
 Oy.signTransaction = void 0;
-const f1e = _o, d1e = Pi, h1e = async (e) => {
+const fbe = _o, dbe = Pi, hbe = async (e) => {
   var t, r;
-  const n = await (0, d1e.getProviderOrThrow)(e.getProvider), { psbtBase64: o, inputsToSign: i } = e.payload;
+  const n = await (0, dbe.getProviderOrThrow)(e.getProvider), { psbtBase64: o, inputsToSign: i } = e.payload;
   if (!o)
     throw new Error("A value for psbtBase64 representing the tx hash is required");
   if (!i)
     throw new Error("An array specifying the inputs to be signed by the wallet is required");
   try {
-    const a = (0, f1e.createUnsecuredToken)(e.payload), s = await n.signTransaction(a);
+    const a = (0, fbe.createUnsecuredToken)(e.payload), s = await n.signTransaction(a);
     (t = e.onFinish) == null || t.call(e, s);
   } catch (a) {
     console.error("[Connect] Error during sign transaction request", a), (r = e.onCancel) == null || r.call(e);
   }
 };
-Oy.signTransaction = h1e;
+Oy.signTransaction = hbe;
 var By = {};
 Object.defineProperty(By, "__esModule", { value: !0 });
 By.signMultipleTransactions = void 0;
-const p1e = _o, g1e = Pi, m1e = async (e) => {
+const pbe = _o, gbe = Pi, mbe = async (e) => {
   var t, r;
-  const n = await (0, g1e.getProviderOrThrow)(e.getProvider), { psbts: o } = e.payload;
+  const n = await (0, gbe.getProviderOrThrow)(e.getProvider), { psbts: o } = e.payload;
   if (!o || !o.length)
     throw new Error("psbts array is required");
   if (o.length > 100)
     throw new Error("psbts array must contain less than 100 psbts");
   try {
-    const i = (0, p1e.createUnsecuredToken)(e.payload), a = await n.signMultipleTransactions(i);
+    const i = (0, pbe.createUnsecuredToken)(e.payload), a = await n.signMultipleTransactions(i);
     (t = e.onFinish) == null || t.call(e, a);
   } catch (i) {
     console.error("[Connect] Error during sign Multiple transactions request", i), (r = e.onCancel) == null || r.call(e);
   }
 };
-By.signMultipleTransactions = m1e;
+By.signMultipleTransactions = mbe;
 var lB = {};
 Object.defineProperty(lB, "__esModule", { value: !0 });
 (function(e) {
@@ -92465,15 +92475,15 @@ var fB = {};
   };
   Object.defineProperty(e, "__esModule", { value: !0 }), r(XO, e), r(QO, e), r(nB, e), r(iB, e), r(sB, e), r(Pi, e), r(uB, e), r(fB, e);
 })(jE);
-const y1e = /* @__PURE__ */ aee(jE), {
-  signMessage: b1e,
-  sendBtcTransaction: w1e,
-  signTransaction: v1e
-} = y1e, E1e = "ORANGE_CONNECTED_WALLET_STATE";
-class k1e extends cs {
+const ybe = /* @__PURE__ */ aee(jE), {
+  signMessage: bbe,
+  sendBtcTransaction: wbe,
+  signTransaction: vbe
+} = ybe, Ebe = "ORANGE_CONNECTED_WALLET_STATE";
+class kbe extends cs {
   constructor() {
     super(...arguments), Te(this, "observer"), Te(this, "$valueStore", jf(
-      E1e,
+      Ebe,
       {
         address: "",
         paymentAddress: "",
@@ -92593,7 +92603,7 @@ class k1e extends cs {
         throw new Error("User canceled the request");
       }
     };
-    return await w1e(o), n;
+    return await wbe(o), n;
   }
   async signMessage(t, r) {
     let n = "";
@@ -92612,7 +92622,7 @@ class k1e extends cs {
         throw new Error("User canceled the request");
       }
     };
-    return await b1e(i), n;
+    return await bbe(i), n;
   }
   async signPsbt(t, r, n, o, i) {
     const a = vr.fromBase64(String(n), {
@@ -92661,7 +92671,7 @@ class k1e extends cs {
         throw console.error("Error signing psbt:", E), new Error("Error signing psbt");
       }
     };
-    if (await v1e(x), !v)
+    if (await vbe(x), !v)
       throw new Error("Error signing psbt");
     return o && (v.finalizeAllInputs(), m = v.toHex(), w = v.toBase64()), {
       signedPsbtHex: m,
@@ -92670,11 +92680,11 @@ class k1e extends cs {
     };
   }
 }
-const x1e = "OKX_CONNECTED_WALLET_STATE";
-class A1e extends cs {
+const xbe = "OKX_CONNECTED_WALLET_STATE";
+class Abe extends cs {
   constructor() {
     super(...arguments), Te(this, "observer"), Te(this, "$valueStore", jf(
-      x1e,
+      xbe,
       {
         address: "",
         paymentAddress: "",
@@ -92786,11 +92796,11 @@ class A1e extends cs {
     };
   }
 }
-const _1e = "MAGIC_EDEN_CONNECTED_WALLET_STATE";
-class S1e extends cs {
+const _be = "MAGIC_EDEN_CONNECTED_WALLET_STATE";
+class Sbe extends cs {
   constructor() {
     super(...arguments), Te(this, "observer"), Te(this, "$valueStore", jf(
-      _1e,
+      _be,
       {
         address: "",
         paymentAddress: "",
@@ -92999,7 +93009,7 @@ class S1e extends cs {
     };
   }
 }
-class $1e extends cs {
+class $be extends cs {
   constructor() {
     super(...arguments), Te(this, "observer");
   }
@@ -93117,16 +93127,16 @@ class $1e extends cs {
     await ((r = this.library) == null ? void 0 : r.switchChain(n)), this.$network.set(t), await this.getBalance();
   }
 }
-class T1e {
+class Tbe {
   constructor(t, r) {
     Te(this, "$store"), Te(this, "$network"), Te(this, "$providerMap"), this.config = r, this.$store = t.$store, this.$network = t.$network, this.$providerMap = {
       [eu]: new Wye(t, this, r),
-      [Ua]: new S1e(t, this, r),
-      [tu]: new A1e(t, this, r),
+      [Ua]: new Sbe(t, this, r),
+      [tu]: new Abe(t, this, r),
       // [OP_NET]: new OpNetProvider(stores, this, config),
-      [dc]: new k1e(t, this, r),
+      [dc]: new kbe(t, this, r),
       [Jc]: new Gye(t, this, r),
-      [Qc]: new $1e(t, this, r),
+      [Qc]: new $be(t, this, r),
       [fc]: new Tme(t, this, r),
       [Ba]: new Mye(t, this, r),
       [ru]: new Fye(t, this, r)
@@ -93152,7 +93162,7 @@ class T1e {
   handleIsInitializingChanged(t) {
     if (typeof window < "u" && typeof localStorage < "u" && !t) {
       const r = localStorage == null ? void 0 : localStorage.getItem(
-        v1
+        vb
       );
       r && (this.$store.setKey("provider", r), this.connect(r));
     }
@@ -93160,7 +93170,7 @@ class T1e {
   async connect(t) {
     this.$store.setKey("isConnecting", !0);
     try {
-      if (localStorage == null || localStorage.setItem(v1, t), !this.$providerMap[t])
+      if (localStorage == null || localStorage.setItem(vb, t), !this.$providerMap[t])
         throw new Error("Unsupported wallet provider");
       const r = this.$providerMap[t];
       await (r == null ? void 0 : r.connect(t)), this.$store.setKey("connected", !0);
@@ -93183,7 +93193,7 @@ class T1e {
     }
   }
   disconnect() {
-    this.$store.setKey("connected", !1), this.$store.setKey("provider", void 0), this.$store.setKey("address", ""), this.$store.setKey("paymentAddress", ""), this.$store.setKey("publicKey", ""), this.$store.setKey("paymentPublicKey", ""), this.$store.setKey("balance", void 0), this.$store.setKey("accounts", []), localStorage == null || localStorage.removeItem(v1);
+    this.$store.setKey("connected", !1), this.$store.setKey("provider", void 0), this.$store.setKey("address", ""), this.$store.setKey("paymentAddress", ""), this.$store.setKey("publicKey", ""), this.$store.setKey("paymentPublicKey", ""), this.$store.setKey("balance", void 0), this.$store.setKey("accounts", []), localStorage == null || localStorage.removeItem(vb);
   }
   switchNetwork(t) {
     var r;
@@ -93309,7 +93319,7 @@ class T1e {
       }
   }
 }
-const I1e = {
+const Ibe = {
   hasUnisat: !1,
   hasXverse: !1,
   hasOyl: !1,
@@ -93354,7 +93364,7 @@ const I1e = {
   inscribe: async (e, t) => "",
   isCreatingCommit: !1,
   isInscribing: !1
-}, dB = gB(I1e), Pwe = () => mB(dB);
+}, dB = gB(Ibe), Pwe = () => mB(dB);
 var mv = { exports: {} }, Qf = {};
 /**
  * @license React
@@ -93366,7 +93376,7 @@ var mv = { exports: {} }, Qf = {};
  * LICENSE file in the root directory of this source tree.
  */
 var R6;
-function P1e() {
+function Pbe() {
   if (R6) return Qf;
   R6 = 1;
   var e = K6, t = Symbol.for("react.element"), r = Symbol.for("react.fragment"), n = Object.prototype.hasOwnProperty, o = e.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner, i = { key: !0, ref: !0, __self: !0, __source: !0 };
@@ -93390,7 +93400,7 @@ var Lp = {};
  * LICENSE file in the root directory of this source tree.
  */
 var L6;
-function O1e() {
+function Obe() {
   return L6 || (L6 = 1, process.env.NODE_ENV !== "production" && function() {
     var e = K6, t = Symbol.for("react.element"), r = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), o = Symbol.for("react.strict_mode"), i = Symbol.for("react.profiler"), a = Symbol.for("react.provider"), s = Symbol.for("react.context"), c = Symbol.for("react.forward_ref"), l = Symbol.for("react.suspense"), u = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"), h = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), y = Symbol.iterator, m = "@@iterator";
     function w(z) {
@@ -93983,9 +93993,9 @@ React keys must be passed directly to JSX without using spread:
     Lp.Fragment = n, Lp.jsx = pe, Lp.jsxs = ye;
   }()), Lp;
 }
-process.env.NODE_ENV === "production" ? mv.exports = P1e() : mv.exports = O1e();
+process.env.NODE_ENV === "production" ? mv.exports = Pbe() : mv.exports = Obe();
 var G = mv.exports;
-function B1e(e, t, r) {
+function Bbe(e, t, r) {
   let n = /* @__PURE__ */ new Set([...t, void 0]);
   return e.listen((o, i, a) => {
     n.has(a) && r(o, i, a);
@@ -93993,7 +94003,7 @@ function B1e(e, t, r) {
 }
 function H6(e, t = {}) {
   let r = bB(
-    (o) => t.keys ? B1e(e, t.keys, o) : e.listen(o),
+    (o) => t.keys ? Bbe(e, t.keys, o) : e.listen(o),
     [t.keys, e]
   ), n = e.get.bind(e);
   return wB(r, n, n);
@@ -94002,7 +94012,7 @@ function Owe({
   config: e,
   children: t
 }) {
-  const r = yB(() => new T1e(
+  const r = yB(() => new Tbe(
     Bme(),
     Ume(e ?? { network: Rt })
   ), [e]), {
@@ -94067,7 +94077,7 @@ function Owe({
     }
   );
 }
-const U1e = ({
+const Ube = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94181,7 +94191,7 @@ const U1e = ({
       )
     ]
   }
-), C1e = ({
+), Cbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94250,7 +94260,7 @@ const U1e = ({
       /* @__PURE__ */ G.jsx("defs", { children: /* @__PURE__ */ G.jsx("clipPath", { id: "a", children: /* @__PURE__ */ G.jsx("path", { fill: "#fff", d: "M0 0h42v42H0z" }) }) })
     ]
   }
-), N1e = ({
+), Nbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94292,7 +94302,7 @@ const U1e = ({
       /* @__PURE__ */ G.jsx("defs", { children: /* @__PURE__ */ G.jsx("clipPath", { id: "clip0_3_53", children: /* @__PURE__ */ G.jsx("rect", { width: "42", height: "42", fill: "white" }) }) })
     ]
   }
-), j1e = ({
+), jbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94394,7 +94404,7 @@ const U1e = ({
       ] })
     ]
   }
-), z1e = ({
+), zbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94455,7 +94465,7 @@ const U1e = ({
       ] })
     ]
   }
-), R1e = ({
+), Rbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94487,7 +94497,7 @@ const U1e = ({
       ] })
     ]
   }
-), L1e = ({
+), Lbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94550,7 +94560,7 @@ const U1e = ({
       ] })
     ]
   }
-), H1e = ({
+), Hbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94764,7 +94774,7 @@ const U1e = ({
       ] }) })
     ]
   }
-), D1e = ({
+), Dbe = ({
   size: e = 42,
   variant: t = "first",
   className: r,
@@ -94807,7 +94817,7 @@ const U1e = ({
   className: t,
   variant: r,
   walletName: n
-}) => n === Ba ? /* @__PURE__ */ G.jsx(N1e, { size: e, className: t, variant: r }) : n === ru ? /* @__PURE__ */ G.jsx(z1e, { size: e, className: t, variant: r }) : n === eu ? /* @__PURE__ */ G.jsx(D6, { size: e, className: t, variant: r }) : n === Ua ? /* @__PURE__ */ G.jsx(L1e, { size: e, className: t, variant: r }) : n === tu ? /* @__PURE__ */ G.jsx(R1e, { size: e, className: t, variant: r }) : n === Qc ? /* @__PURE__ */ G.jsx(C1e, { size: e, className: t, variant: r }) : n === fc ? /* @__PURE__ */ G.jsx(j1e, { size: e, className: t, variant: r }) : n === Jc ? /* @__PURE__ */ G.jsx(U1e, { size: e, className: t, variant: r }) : n === dc ? /* @__PURE__ */ G.jsx(H1e, { size: e, className: t, variant: r }) : n === sS ? /* @__PURE__ */ G.jsx(D1e, { size: e, className: t, variant: r }) : /* @__PURE__ */ G.jsx(D6, { size: e, className: t, variant: r });
+}) => n === Ba ? /* @__PURE__ */ G.jsx(Nbe, { size: e, className: t, variant: r }) : n === ru ? /* @__PURE__ */ G.jsx(zbe, { size: e, className: t, variant: r }) : n === eu ? /* @__PURE__ */ G.jsx(D6, { size: e, className: t, variant: r }) : n === Ua ? /* @__PURE__ */ G.jsx(Lbe, { size: e, className: t, variant: r }) : n === tu ? /* @__PURE__ */ G.jsx(Rbe, { size: e, className: t, variant: r }) : n === Qc ? /* @__PURE__ */ G.jsx(Cbe, { size: e, className: t, variant: r }) : n === fc ? /* @__PURE__ */ G.jsx(jbe, { size: e, className: t, variant: r }) : n === Jc ? /* @__PURE__ */ G.jsx(Ube, { size: e, className: t, variant: r }) : n === dc ? /* @__PURE__ */ G.jsx(Hbe, { size: e, className: t, variant: r }) : n === sS ? /* @__PURE__ */ G.jsx(Dbe, { size: e, className: t, variant: r }) : /* @__PURE__ */ G.jsx(D6, { size: e, className: t, variant: r });
 export {
   bf as FRACTAL_MAINNET,
   Vn as FRACTAL_TESTNET,
@@ -94817,8 +94827,10 @@ export {
   Cy as LOCAL_STORAGE_DEFAULT_WALLET,
   Twe as LaserEyesClient,
   Owe as LaserEyesProvider,
+  D6 as LeatherLogo,
   ac as MAGIC_EDEN,
   Bt as MAINNET,
+  Lbe as MagicEdenLogo,
   hl as OKX,
   QG as OKX_MAINNET,
   eZ as OKX_TESTNET,
@@ -94829,14 +94841,17 @@ export {
   r8 as ORANGE_MAINNET,
   tZ as ORANGE_TESTNET,
   Vc as OYL,
+  Rbe as OkxLogo,
+  Ube as OylLogo,
   TB as P2PKH,
-  q1e as P2PSH,
+  qbe as P2PSH,
   M6 as P2SH,
   IB as P2SH_P2WPKH,
   nd as P2TR,
-  cb as P2WPKH,
+  c1 as P2WPKH,
   PB as P2WSH,
   dl as PHANTOM,
+  Cbe as PhantomLogo,
   swe as REGTEST,
   Xn as SIGNET,
   ur as TESTNET,
@@ -94844,25 +94859,28 @@ export {
   uc as UNISAT,
   n_ as UNISAT_FRACTAL_MAINNET,
   o_ as UNISAT_FRACTAL_TESTNET,
-  Yb as UNISAT_MAINNET,
+  Y1 as UNISAT_MAINNET,
   r_ as UNISAT_SIGNET,
   e_ as UNISAT_TESTNET,
   t_ as UNISAT_TESTNET4,
   dw as UNSUPPORTED_PROVIDER_METHOD_ERROR,
-  M1e as WALLETS,
+  jbe as UnisatLogo,
+  Mbe as WALLETS,
   XX as WALLET_NOT_INSTALLED_ERROR,
   pl as WIZZ,
   R0 as WIZZ_MAINNET,
   s_ as WIZZ_SIGNET,
-  Qb as WIZZ_TESTNET,
+  Q1 as WIZZ_TESTNET,
   a_ as WIZZ_TESTNET4,
   Bwe as WalletIcon,
   ns as WalletProvider,
+  zbe as WizzLogo,
   Pa as XVERSE,
-  Jb as XVERSE_MAINNET,
+  J1 as XVERSE_MAINNET,
   owe as XVERSE_NETWORK,
   JG as XVERSE_SIGNET,
   i_ as XVERSE_TESTNET,
+  Nbe as XverseLogo,
   kwe as createConfig,
   Ewe as createStores,
   cwe as getLeatherNetwork,