@lombard.finance/sdk-starknet 0.3.1 → 0.3.2

package/dist/index2.js

@@ -1059,7 +1059,7 @@ const b1 = /* @__PURE__ */ new Uint32Array([
   2756734187,
   3204031479,
   3329325298
-]), Hn = /* @__PURE__ */ new Uint32Array([
+]), Ln = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1068,10 +1068,10 @@ const b1 = /* @__PURE__ */ new Uint32Array([
   2600822924,
   528734635,
   1541459225
-]), Ln = /* @__PURE__ */ new Uint32Array(64);
+]), Dn = /* @__PURE__ */ new Uint32Array(64);
 let w1 = class extends y1 {
   constructor() {
-    super(64, 32, 8, !1), this.A = Hn[0] | 0, this.B = Hn[1] | 0, this.C = Hn[2] | 0, this.D = Hn[3] | 0, this.E = Hn[4] | 0, this.F = Hn[5] | 0, this.G = Hn[6] | 0, this.H = Hn[7] | 0;
+    super(64, 32, 8, !1), this.A = Ln[0] | 0, this.B = Ln[1] | 0, this.C = Ln[2] | 0, this.D = Ln[3] | 0, this.E = Ln[4] | 0, this.F = Ln[5] | 0, this.G = Ln[6] | 0, this.H = Ln[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: a, E: o, F: i, G: s, H: c } = this;
@@ -1083,20 +1083,20 @@ let w1 = class extends y1 {
   }
   process(t, n) {
     for (let h = 0; h < 16; h++, n += 4)
-      Ln[h] = t.getUint32(n, !1);
+      Dn[h] = t.getUint32(n, !1);
     for (let h = 16; h < 64; h++) {
-      const f = Ln[h - 15], l = Ln[h - 2], g = rn(f, 7) ^ rn(f, 18) ^ f >>> 3, b = rn(l, 17) ^ rn(l, 19) ^ l >>> 10;
-      Ln[h] = b + Ln[h - 7] + g + Ln[h - 16] | 0;
+      const f = Dn[h - 15], l = Dn[h - 2], g = rn(f, 7) ^ rn(f, 18) ^ f >>> 3, b = rn(l, 17) ^ rn(l, 19) ^ l >>> 10;
+      Dn[h] = b + Dn[h - 7] + g + Dn[h - 16] | 0;
     }
     let { A: r, B: a, C: o, D: i, E: s, F: c, G: u, H: d } = this;
     for (let h = 0; h < 64; h++) {
-      const f = rn(s, 6) ^ rn(s, 11) ^ rn(s, 25), l = d + f + m1(s, c, u) + b1[h] + Ln[h] | 0, b = (rn(r, 2) ^ rn(r, 13) ^ rn(r, 22)) + g1(r, a, o) | 0;
+      const f = rn(s, 6) ^ rn(s, 11) ^ rn(s, 25), l = d + f + m1(s, c, u) + b1[h] + Dn[h] | 0, b = (rn(r, 2) ^ rn(r, 13) ^ rn(r, 22)) + g1(r, a, o) | 0;
       d = u, u = c, c = s, s = i + l | 0, i = o, o = a, a = r, r = l + b | 0;
     }
     r = r + this.A | 0, a = a + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, s = s + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, d = d + this.H | 0, this.set(r, a, o, i, s, c, u, d);
   }
   roundClean() {
-    Ln.fill(0);
+    Dn.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -1386,7 +1386,7 @@ const q1 = /* @__PURE__ */ new Uint32Array([
   2756734187,
   3204031479,
   3329325298
-]), Dn = /* @__PURE__ */ new Uint32Array([
+]), Fn = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1395,10 +1395,10 @@ const q1 = /* @__PURE__ */ new Uint32Array([
   2600822924,
   528734635,
   1541459225
-]), Fn = /* @__PURE__ */ new Uint32Array(64);
+]), Mn = /* @__PURE__ */ new Uint32Array(64);
 class $1 extends V1 {
   constructor() {
-    super(64, 32, 8, !1), this.A = Dn[0] | 0, this.B = Dn[1] | 0, this.C = Dn[2] | 0, this.D = Dn[3] | 0, this.E = Dn[4] | 0, this.F = Dn[5] | 0, this.G = Dn[6] | 0, this.H = Dn[7] | 0;
+    super(64, 32, 8, !1), this.A = Fn[0] | 0, this.B = Fn[1] | 0, this.C = Fn[2] | 0, this.D = Fn[3] | 0, this.E = Fn[4] | 0, this.F = Fn[5] | 0, this.G = Fn[6] | 0, this.H = Fn[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: a, E: o, F: i, G: s, H: c } = this;
@@ -1410,20 +1410,20 @@ class $1 extends V1 {
   }
   process(t, n) {
     for (let h = 0; h < 16; h++, n += 4)
-      Fn[h] = t.getUint32(n, !1);
+      Mn[h] = t.getUint32(n, !1);
     for (let h = 16; h < 64; h++) {
-      const f = Fn[h - 15], l = Fn[h - 2], g = an(f, 7) ^ an(f, 18) ^ f >>> 3, b = an(l, 17) ^ an(l, 19) ^ l >>> 10;
-      Fn[h] = b + Fn[h - 7] + g + Fn[h - 16] | 0;
+      const f = Mn[h - 15], l = Mn[h - 2], g = an(f, 7) ^ an(f, 18) ^ f >>> 3, b = an(l, 17) ^ an(l, 19) ^ l >>> 10;
+      Mn[h] = b + Mn[h - 7] + g + Mn[h - 16] | 0;
     }
     let { A: r, B: a, C: o, D: i, E: s, F: c, G: u, H: d } = this;
     for (let h = 0; h < 64; h++) {
-      const f = an(s, 6) ^ an(s, 11) ^ an(s, 25), l = d + f + F1(s, c, u) + q1[h] + Fn[h] | 0, b = (an(r, 2) ^ an(r, 13) ^ an(r, 22)) + M1(r, a, o) | 0;
+      const f = an(s, 6) ^ an(s, 11) ^ an(s, 25), l = d + f + F1(s, c, u) + q1[h] + Mn[h] | 0, b = (an(r, 2) ^ an(r, 13) ^ an(r, 22)) + M1(r, a, o) | 0;
       d = u, u = c, c = s, s = i + l | 0, i = o, o = a, a = r, r = l + b | 0;
     }
     r = r + this.A | 0, a = a + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, s = s + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, d = d + this.H | 0, this.set(r, a, o, i, s, c, u, d);
   }
   roundClean() {
-    Fn.fill(0);
+    Mn.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -3758,7 +3758,7 @@ const { bytesToNumberBE: b2, hexToBytes: w2 } = i1, ln = {
     const { _tlv: t, _int: n } = ln, r = t.encode(2, n.encode(e.r)), a = t.encode(2, n.encode(e.s)), o = r + a;
     return t.encode(48, o);
   }
-}, Xt = BigInt(0), ze = BigInt(1), Mn = BigInt(2), cs = BigInt(3), op = BigInt(4);
+}, Xt = BigInt(0), ze = BigInt(1), Vn = BigInt(2), cs = BigInt(3), op = BigInt(4);
 function x0(e) {
   const t = y2(e), { Fp: n } = t, r = k0(t.n, t.nBitLength), a = t.toBytes || ((b, y, _) => {
     const k = y.toAffine();
@@ -4272,9 +4272,9 @@ function T0(e) {
 function I0(e, t) {
   const n = e.ORDER;
   let r = Xt;
-  for (let g = n - ze; g % Mn === Xt; g /= Mn)
+  for (let g = n - ze; g % Vn === Xt; g /= Vn)
     r += ze;
-  const a = r, o = Mn << a - ze - ze, i = o * Mn, s = (n - ze) / i, c = (s - ze) / Mn, u = i - ze, d = o, h = e.pow(t, s), f = e.pow(t, (s + ze) / Mn);
+  const a = r, o = Vn << a - ze - ze, i = o * Vn, s = (n - ze) / i, c = (s - ze) / Vn, u = i - ze, d = o, h = e.pow(t, s), f = e.pow(t, (s + ze) / Vn);
   let l = (g, b) => {
     let y = h, _ = e.pow(b, u), k = e.sqr(_);
     k = e.mul(k, b);
@@ -4285,8 +4285,8 @@ function I0(e, t) {
     let A = e.eql(w, e.ONE);
     _ = e.mul(k, f), w = e.mul(v, y), k = e.cmov(_, k, A), v = e.cmov(w, v, A);
     for (let T = a; T > ze; T--) {
-      let I = T - Mn;
-      I = Mn << I - ze;
+      let I = T - Vn;
+      I = Vn << I - ze;
       let z = e.pow(v, I);
       const S = e.eql(z, e.ONE);
       _ = e.mul(k, y), y = e.mul(y, y), z = e.mul(v, y), k = e.cmov(_, k, S), v = e.cmov(z, v, S);
@@ -4635,8 +4635,8 @@ var tt = Y2, qr = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: J2, _tr_stored_block: Al, _tr_flush_block: Q2, _tr_tally: sr, _tr_align: eE } = K2, {
-  Z_NO_FLUSH: cr,
+const { _tr_init: J2, _tr_stored_block: Al, _tr_flush_block: Q2, _tr_tally: cr, _tr_align: eE } = K2, {
+  Z_NO_FLUSH: ur,
   Z_PARTIAL_FLUSH: tE,
   Z_FULL_FLUSH: nE,
   Z_FINISH: Ft,
@@ -4654,7 +4654,7 @@ const { _tr_init: J2, _tr_stored_block: Al, _tr_flush_block: Q2, _tr_tally: sr,
   Z_DEFAULT_STRATEGY: cE,
   Z_UNKNOWN: uE,
   Z_DEFLATED: Ss
-} = As, lE = 9, dE = 15, fE = 8, pE = 29, hE = 256, Sl = hE + 1 + pE, mE = 30, gE = 19, yE = 2 * Sl + 1, bE = 15, ve = 3, ar = 258, wn = ar + ve + 1, wE = 32, Ca = 42, xd = 57, jl = 69, xl = 73, Tl = 91, Il = 103, zr = 113, uo = 666, kt = 1, Ua = 2, $r = 3, Ha = 4, kE = 3, Pr = (e, t) => (e.msg = qr[t], t), mp = (e) => e * 2 - (e > 4 ? 9 : 0), rr = (e) => {
+} = As, lE = 9, dE = 15, fE = 8, pE = 29, hE = 256, Sl = hE + 1 + pE, mE = 30, gE = 19, yE = 2 * Sl + 1, bE = 15, ve = 3, or = 258, wn = or + ve + 1, wE = 32, Ca = 42, xd = 57, jl = 69, xl = 73, Tl = 91, Il = 103, zr = 113, uo = 666, kt = 1, Ua = 2, $r = 3, Ha = 4, kE = 3, Pr = (e, t) => (e.msg = qr[t], t), mp = (e) => e * 2 - (e > 4 ? 9 : 0), ar = (e) => {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
@@ -4669,7 +4669,7 @@ const { _tr_init: J2, _tr_stored_block: Al, _tr_flush_block: Q2, _tr_tally: sr,
     n = e.prev[--r], e.prev[r] = n >= a ? n - a : 0;
   while (--t);
 };
-let vE = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ur = vE;
+let vE = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, lr = vE;
 const Ot = (e) => {
   const t = e.state;
   let n = t.pending;
@@ -4685,7 +4685,7 @@ const Ot = (e) => {
   return a > r && (a = r), a === 0 ? 0 : (e.avail_in -= a, t.set(e.input.subarray(e.next_in, e.next_in + a), n), e.state.wrap === 1 ? e.adler = Co(e.adler, t, a, n) : e.state.wrap === 2 && (e.adler = tt(e.adler, t, a, n)), e.next_in += a, e.total_in += a, a);
 }, $0 = (e, t) => {
   let n = e.max_chain_length, r = e.strstart, a, o, i = e.prev_length, s = e.nice_match;
-  const c = e.strstart > e.w_size - wn ? e.strstart - (e.w_size - wn) : 0, u = e.window, d = e.w_mask, h = e.prev, f = e.strstart + ar;
+  const c = e.strstart > e.w_size - wn ? e.strstart - (e.w_size - wn) : 0, u = e.window, d = e.w_mask, h = e.prev, f = e.strstart + or;
   let l = u[r + i - 1], g = u[r + i];
   e.prev_length >= e.good_match && (n >>= 2), s > e.lookahead && (s = e.lookahead);
   do
@@ -4694,7 +4694,7 @@ const Ot = (e) => {
       do
         ;
       while (u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && u[++r] === u[++a] && r < f);
-      if (o = ar - (f - r), r = f - ar, o > i) {
+      if (o = or - (f - r), r = f - or, o > i) {
         if (e.match_start = t, i = o, o >= s)
           break;
         l = u[r + i - 1], g = u[r + i];
@@ -4709,37 +4709,37 @@ const Ot = (e) => {
     if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - wn) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), _E(e), r += t), e.strm.avail_in === 0)
       break;
     if (n = Cl(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= ve)
-      for (a = e.strstart - e.insert, e.ins_h = e.window[a], e.ins_h = ur(e, e.ins_h, e.window[a + 1]); e.insert && (e.ins_h = ur(e, e.ins_h, e.window[a + ve - 1]), e.prev[a & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = a, a++, e.insert--, !(e.lookahead + e.insert < ve)); )
+      for (a = e.strstart - e.insert, e.ins_h = e.window[a], e.ins_h = lr(e, e.ins_h, e.window[a + 1]); e.insert && (e.ins_h = lr(e, e.ins_h, e.window[a + ve - 1]), e.prev[a & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = a, a++, e.insert--, !(e.lookahead + e.insert < ve)); )
         ;
   } while (e.lookahead < wn && e.strm.avail_in !== 0);
 }, G0 = (e, t) => {
   let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, a, o, i = 0, s = e.strm.avail_in;
   do {
-    if (r = 65535, o = e.bi_valid + 42 >> 3, e.strm.avail_out < o || (o = e.strm.avail_out - o, a = e.strstart - e.block_start, r > a + e.strm.avail_in && (r = a + e.strm.avail_in), r > o && (r = o), r < n && (r === 0 && t !== Ft || t === cr || r !== a + e.strm.avail_in)))
+    if (r = 65535, o = e.bi_valid + 42 >> 3, e.strm.avail_out < o || (o = e.strm.avail_out - o, a = e.strstart - e.block_start, r > a + e.strm.avail_in && (r = a + e.strm.avail_in), r > o && (r = o), r < n && (r === 0 && t !== Ft || t === ur || r !== a + e.strm.avail_in)))
       break;
     i = t === Ft && r === a + e.strm.avail_in ? 1 : 0, Al(e, 0, 0, i), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, Ot(e.strm), a && (a > r && (a = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + a), e.strm.next_out), e.strm.next_out += a, e.strm.avail_out -= a, e.strm.total_out += a, e.block_start += a, r -= a), r && (Cl(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
   } while (i === 0);
-  return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), i ? Ha : t !== cr && t !== Ft && e.strm.avail_in === 0 && e.strstart === e.block_start ? Ua : (o = e.window_size - e.strstart, e.strm.avail_in > o && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, o += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), o > e.strm.avail_in && (o = e.strm.avail_in), o && (Cl(e.strm, e.window, e.strstart, o), e.strstart += o, e.insert += o > e.w_size - e.insert ? e.w_size - e.insert : o), e.high_water < e.strstart && (e.high_water = e.strstart), o = e.bi_valid + 42 >> 3, o = e.pending_buf_size - o > 65535 ? 65535 : e.pending_buf_size - o, n = o > e.w_size ? e.w_size : o, a = e.strstart - e.block_start, (a >= n || (a || t === Ft) && t !== cr && e.strm.avail_in === 0 && a <= o) && (r = a > o ? o : a, i = t === Ft && e.strm.avail_in === 0 && r === a ? 1 : 0, Al(e, e.block_start, r, i), e.block_start += r, Ot(e.strm)), i ? $r : kt);
+  return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), i ? Ha : t !== ur && t !== Ft && e.strm.avail_in === 0 && e.strstart === e.block_start ? Ua : (o = e.window_size - e.strstart, e.strm.avail_in > o && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, o += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), o > e.strm.avail_in && (o = e.strm.avail_in), o && (Cl(e.strm, e.window, e.strstart, o), e.strstart += o, e.insert += o > e.w_size - e.insert ? e.w_size - e.insert : o), e.high_water < e.strstart && (e.high_water = e.strstart), o = e.bi_valid + 42 >> 3, o = e.pending_buf_size - o > 65535 ? 65535 : e.pending_buf_size - o, n = o > e.w_size ? e.w_size : o, a = e.strstart - e.block_start, (a >= n || (a || t === Ft) && t !== ur && e.strm.avail_in === 0 && a <= o) && (r = a > o ? o : a, i = t === Ft && e.strm.avail_in === 0 && r === a ? 1 : 0, Al(e, e.block_start, r, i), e.block_start += r, Ot(e.strm)), i ? $r : kt);
 }, mc = (e, t) => {
   let n, r;
   for (; ; ) {
     if (e.lookahead < wn) {
-      if (Oa(e), e.lookahead < wn && t === cr)
+      if (Oa(e), e.lookahead < wn && t === ur)
         return kt;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= ve && (e.ins_h = ur(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - wn && (e.match_length = $0(e, n)), e.match_length >= ve)
-      if (r = sr(e, e.strstart - e.match_start, e.match_length - ve), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= ve) {
+    if (n = 0, e.lookahead >= ve && (e.ins_h = lr(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - wn && (e.match_length = $0(e, n)), e.match_length >= ve)
+      if (r = cr(e, e.strstart - e.match_start, e.match_length - ve), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= ve) {
         e.match_length--;
         do
-          e.strstart++, e.ins_h = ur(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          e.strstart++, e.ins_h = lr(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
         while (--e.match_length !== 0);
         e.strstart++;
       } else
-        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = ur(e, e.ins_h, e.window[e.strstart + 1]);
+        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = lr(e, e.ins_h, e.window[e.strstart + 1]);
     else
-      r = sr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+      r = cr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
     if (r && (Nt(e, !1), e.strm.avail_out === 0))
       return kt;
   }
@@ -4748,43 +4748,43 @@ const Ot = (e) => {
   let n, r, a;
   for (; ; ) {
     if (e.lookahead < wn) {
-      if (Oa(e), e.lookahead < wn && t === cr)
+      if (Oa(e), e.lookahead < wn && t === ur)
         return kt;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= ve && (e.ins_h = ur(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = ve - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - wn && (e.match_length = $0(e, n), e.match_length <= 5 && (e.strategy === oE || e.match_length === ve && e.strstart - e.match_start > 4096) && (e.match_length = ve - 1)), e.prev_length >= ve && e.match_length <= e.prev_length) {
-      a = e.strstart + e.lookahead - ve, r = sr(e, e.strstart - 1 - e.prev_match, e.prev_length - ve), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+    if (n = 0, e.lookahead >= ve && (e.ins_h = lr(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = ve - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - wn && (e.match_length = $0(e, n), e.match_length <= 5 && (e.strategy === oE || e.match_length === ve && e.strstart - e.match_start > 4096) && (e.match_length = ve - 1)), e.prev_length >= ve && e.match_length <= e.prev_length) {
+      a = e.strstart + e.lookahead - ve, r = cr(e, e.strstart - 1 - e.prev_match, e.prev_length - ve), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
       do
-        ++e.strstart <= a && (e.ins_h = ur(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+        ++e.strstart <= a && (e.ins_h = lr(e, e.ins_h, e.window[e.strstart + ve - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
       while (--e.prev_length !== 0);
       if (e.match_available = 0, e.match_length = ve - 1, e.strstart++, r && (Nt(e, !1), e.strm.avail_out === 0))
         return kt;
     } else if (e.match_available) {
-      if (r = sr(e, 0, e.window[e.strstart - 1]), r && Nt(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+      if (r = cr(e, 0, e.window[e.strstart - 1]), r && Nt(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
         return kt;
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (r = sr(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < ve - 1 ? e.strstart : ve - 1, t === Ft ? (Nt(e, !0), e.strm.avail_out === 0 ? $r : Ha) : e.sym_next && (Nt(e, !1), e.strm.avail_out === 0) ? kt : Ua;
+  return e.match_available && (r = cr(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < ve - 1 ? e.strstart : ve - 1, t === Ft ? (Nt(e, !0), e.strm.avail_out === 0 ? $r : Ha) : e.sym_next && (Nt(e, !1), e.strm.avail_out === 0) ? kt : Ua;
 }, EE = (e, t) => {
   let n, r, a, o;
   const i = e.window;
   for (; ; ) {
-    if (e.lookahead <= ar) {
-      if (Oa(e), e.lookahead <= ar && t === cr)
+    if (e.lookahead <= or) {
+      if (Oa(e), e.lookahead <= or && t === ur)
         return kt;
       if (e.lookahead === 0)
         break;
     }
     if (e.match_length = 0, e.lookahead >= ve && e.strstart > 0 && (a = e.strstart - 1, r = i[a], r === i[++a] && r === i[++a] && r === i[++a])) {
-      o = e.strstart + ar;
+      o = e.strstart + or;
       do
         ;
       while (r === i[++a] && r === i[++a] && r === i[++a] && r === i[++a] && r === i[++a] && r === i[++a] && r === i[++a] && r === i[++a] && a < o);
-      e.match_length = ar - (o - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      e.match_length = or - (o - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
-    if (e.match_length >= ve ? (n = sr(e, 1, e.match_length - ve), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = sr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (Nt(e, !1), e.strm.avail_out === 0))
+    if (e.match_length >= ve ? (n = cr(e, 1, e.match_length - ve), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = cr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (Nt(e, !1), e.strm.avail_out === 0))
       return kt;
   }
   return e.insert = 0, t === Ft ? (Nt(e, !0), e.strm.avail_out === 0 ? $r : Ha) : e.sym_next && (Nt(e, !1), e.strm.avail_out === 0) ? kt : Ua;
@@ -4792,11 +4792,11 @@ const Ot = (e) => {
   let n;
   for (; ; ) {
     if (e.lookahead === 0 && (Oa(e), e.lookahead === 0)) {
-      if (t === cr)
+      if (t === ur)
         return kt;
       break;
     }
-    if (e.match_length = 0, n = sr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (Nt(e, !1), e.strm.avail_out === 0))
+    if (e.match_length = 0, n = cr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (Nt(e, !1), e.strm.avail_out === 0))
       return kt;
   }
   return e.insert = 0, t === Ft ? (Nt(e, !0), e.strm.avail_out === 0 ? $r : Ha) : e.sym_next && (Nt(e, !1), e.strm.avail_out === 0) ? kt : Ua;
@@ -4827,10 +4827,10 @@ const lo = [
   new on(32, 258, 258, 4096, ca)
   /* 9 max compression */
 ], SE = (e) => {
-  e.window_size = 2 * e.w_size, rr(e.head), e.max_lazy_match = lo[e.level].max_lazy, e.good_match = lo[e.level].good_length, e.nice_match = lo[e.level].nice_length, e.max_chain_length = lo[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ve - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, ar(e.head), e.max_lazy_match = lo[e.level].max_lazy, e.good_match = lo[e.level].good_length, e.nice_match = lo[e.level].nice_length, e.max_chain_length = lo[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ve - 1, e.match_available = 0, e.ins_h = 0;
 };
 function jE() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Ss, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(yE * 2), this.dyn_dtree = new Uint16Array((2 * mE + 1) * 2), this.bl_tree = new Uint16Array((2 * gE + 1) * 2), rr(this.dyn_ltree), rr(this.dyn_dtree), rr(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(bE + 1), this.heap = new Uint16Array(2 * Sl + 1), rr(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Sl + 1), rr(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Ss, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(yE * 2), this.dyn_dtree = new Uint16Array((2 * mE + 1) * 2), this.bl_tree = new Uint16Array((2 * gE + 1) * 2), ar(this.dyn_ltree), ar(this.dyn_dtree), ar(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(bE + 1), this.heap = new Uint16Array(2 * Sl + 1), ar(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Sl + 1), ar(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
 const Jo = (e) => {
   if (!e)
@@ -4942,11 +4942,11 @@ const Jo = (e) => {
     if (n.status = zr, Ot(e), n.pending !== 0)
       return n.last_flush = -1, ct;
   }
-  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== cr && n.status !== uo) {
+  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== ur && n.status !== uo) {
     let a = n.level === 0 ? G0(n, t) : n.strategy === wi ? AE(n, t) : n.strategy === iE ? EE(n, t) : lo[n.level].func(n, t);
     if ((a === $r || a === Ha) && (n.status = uo), a === kt || a === $r)
       return e.avail_out === 0 && (n.last_flush = -1), ct;
-    if (a === Ua && (t === tE ? eE(n) : t !== pp && (Al(n, 0, 0, !1), t === nE && (rr(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), Ot(e), e.avail_out === 0))
+    if (a === Ua && (t === tE ? eE(n) : t !== pp && (Al(n, 0, 0, !1), t === nE && (ar(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), Ot(e), e.avail_out === 0))
       return n.last_flush = -1, ct;
   }
   return t !== Ft ? ct : n.wrap <= 0 ? hp : (n.wrap === 2 ? (Te(n, e.adler & 255), Te(n, e.adler >> 8 & 255), Te(n, e.adler >> 16 & 255), Te(n, e.adler >> 24 & 255), Te(n, e.total_in & 255), Te(n, e.total_in >> 8 & 255), Te(n, e.total_in >> 16 & 255), Te(n, e.total_in >> 24 & 255)) : (qa(n, e.adler >>> 16), qa(n, e.adler & 65535)), Ot(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? ct : hp);
@@ -4963,7 +4963,7 @@ const Jo = (e) => {
   if (a === 2 || a === 1 && r.status !== Ca || r.lookahead)
     return bn;
   if (a === 1 && (e.adler = Co(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
-    a === 0 && (rr(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
+    a === 0 && (ar(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
     let c = new Uint8Array(r.w_size);
     c.set(t.subarray(n - r.w_size, n), 0), t = c, n = r.w_size;
   }
@@ -4971,7 +4971,7 @@ const Jo = (e) => {
   for (e.avail_in = n, e.next_in = 0, e.input = t, Oa(r); r.lookahead >= ve; ) {
     let c = r.strstart, u = r.lookahead - (ve - 1);
     do
-      r.ins_h = ur(r, r.ins_h, r.window[c + ve - 1]), r.prev[c & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = c, c++;
+      r.ins_h = lr(r, r.ins_h, r.window[c + ve - 1]), r.prev[c & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = c, c++;
     while (--u);
     r.strstart = c, r.lookahead = ve - 1, Oa(r);
   }
@@ -6178,7 +6178,7 @@ const ka = 2147483647, pn = 36, Id = 1, Po = 26, aS = 38, oS = 700, mb = 72, gb
   "not-basic": "Illegal input >= 0x80 (not a basic code point)",
   "invalid-input": "Invalid input"
 }, Ac = pn - Id, hn = Math.floor, Sc = String.fromCharCode;
-function nr(e) {
+function rr(e) {
   throw new RangeError(uS[e]);
 }
 function lS(e, t) {
@@ -6223,21 +6223,21 @@ const wb = (e) => String.fromCodePoint(...e), dS = function(e) {
   let r = 0, a = gb, o = mb, i = e.lastIndexOf(yb);
   i < 0 && (i = 0);
   for (let s = 0; s < i; ++s)
-    e.charCodeAt(s) >= 128 && nr("not-basic"), t.push(e.charCodeAt(s));
+    e.charCodeAt(s) >= 128 && rr("not-basic"), t.push(e.charCodeAt(s));
   for (let s = i > 0 ? i + 1 : 0; s < n; ) {
     const c = r;
     for (let d = 1, h = pn; ; h += pn) {
-      s >= n && nr("invalid-input");
+      s >= n && rr("invalid-input");
       const f = dS(e.charCodeAt(s++));
-      f >= pn && nr("invalid-input"), f > hn((ka - r) / d) && nr("overflow"), r += f * d;
+      f >= pn && rr("invalid-input"), f > hn((ka - r) / d) && rr("overflow"), r += f * d;
       const l = h <= o ? Id : h >= o + Po ? Po : h - o;
       if (f < l)
         break;
       const g = pn - l;
-      d > hn(ka / g) && nr("overflow"), d *= g;
+      d > hn(ka / g) && rr("overflow"), d *= g;
     }
     const u = t.length + 1;
-    o = kb(r - c, u, c == 0), hn(r / u) > ka - a && nr("overflow"), a += hn(r / u), r %= u, t.splice(r++, 0, a);
+    o = kb(r - c, u, c == 0), hn(r / u) > ka - a && rr("overflow"), a += hn(r / u), r %= u, t.splice(r++, 0, a);
   }
   return String.fromCodePoint(...t);
 }, Bd = function(e) {
@@ -6254,9 +6254,9 @@ const wb = (e) => String.fromCodePoint(...e), dS = function(e) {
     for (const d of e)
       d >= r && d < c && (c = d);
     const u = s + 1;
-    c - r > hn((ka - a) / u) && nr("overflow"), a += (c - r) * u, r = c;
+    c - r > hn((ka - a) / u) && rr("overflow"), a += (c - r) * u, r = c;
     for (const d of e)
-      if (d < r && ++a > ka && nr("overflow"), d === r) {
+      if (d < r && ++a > ka && rr("overflow"), d === r) {
         let h = a;
         for (let f = pn; ; f += pn) {
           const l = f <= o ? Id : f >= o + Po ? Po : f - o;
@@ -10347,10 +10347,10 @@ var Tx = class extends Error {
 }, Ix = {};
 Oe(Ix, {
   BlockStatus: () => zx,
-  BlockTag: () => lr,
+  BlockTag: () => Rn,
   ETH_ADDRESS: () => mw,
   EntryPointType: () => Cx,
-  Literal: () => ir,
+  Literal: () => sr,
   NON_ZERO_PREFIX: () => gw,
   OutsideExecutionTypesV1: () => yw,
   OutsideExecutionTypesV2: () => bw,
@@ -10362,7 +10362,7 @@ Oe(Ix, {
   TransactionType: () => Qt,
   TypedDataRevision: () => Ie,
   Uint: () => At,
-  ValidateType: () => or
+  ValidateType: () => ir
 });
 var Cx = {
   EXTERNAL: "EXTERNAL",
@@ -10394,10 +10394,10 @@ var Cx = {
   ACCEPTED_ON_L1: "ACCEPTED_ON_L1",
   ACCEPTED_ON_L2: "ACCEPTED_ON_L2",
   REJECTED: "REJECTED"
-}, lr = {
+}, Rn = {
   PENDING: "pending",
   LATEST: "latest"
-}, or = {
+}, ir = {
   DEPLOY: "DEPLOY",
   CALL: "CALL",
   INVOKE: "INVOKE"
@@ -10411,7 +10411,7 @@ var Cx = {
   // This one is struct
   u512: "core::integer::u512"
   // This one is struct
-}, ir = {
+}, sr = {
   ClassHash: "core::starknet::class_hash::ClassHash",
   ContractAddress: "core::starknet::contract_address::ContractAddress",
   Secp256k1Point: "core::starknet::secp256k1::Secp256k1Point",
@@ -10552,7 +10552,7 @@ function Wr(e) {
 function $d(e) {
   return typeof e == "boolean";
 }
-function Nn(e) {
+function Un(e) {
   return typeof e == "bigint";
 }
 function Qe(e) {
@@ -10635,7 +10635,7 @@ function Nx(e) {
   return Ps(ee(n));
 }
 function Ho(e) {
-  return Wr(e) || Nn(e) || Qe(e) && ($t(e) || ta(e));
+  return Wr(e) || Un(e) || Qe(e) && ($t(e) || ta(e));
 }
 var Ux = {};
 Oe(Ux, {
@@ -10660,7 +10660,7 @@ function Ke(e) {
   return ee(Wd(e));
 }
 function ni(e) {
-  return Wr(e) || Nn(e) ? ee(e) : $t(e) ? e : ta(e) ? ee(e) : Ke(e);
+  return Wr(e) || Un(e) ? ee(e) : $t(e) ? e : ta(e) ? ee(e) : Ke(e);
 }
 function Rs(e) {
   const t = Ce(
@@ -10751,7 +10751,7 @@ Oe(Bw, {
   isCairo1Abi: () => ef,
   isCairo1Type: () => mr,
   isLen: () => Zr,
-  isTypeArray: () => Rn,
+  isTypeArray: () => Nn,
   isTypeBool: () => Ls,
   isTypeByteArray: () => ii,
   isTypeBytes31: () => Ds,
@@ -10775,7 +10775,7 @@ Oe(Bw, {
   uint512: () => Jx
 });
 function Rr(e) {
-  if (Nn(e) || Number.isInteger(e))
+  if (Un(e) || Number.isInteger(e))
     return e.toString();
   if (Qe(e)) {
     if ($t(e))
@@ -10979,7 +10979,7 @@ var ga = (1n << 128n) - 1n, zw = (1n << 256n) - 1n, Mx = 0n, Vx = 34028236692093
       Rr(this.limb3)
     ];
   }
-}, ie(Jt, "abiSelector", "core::integer::u512"), Jt), Zr = (e) => /_len$/.test(e), Ba = (e) => e === "felt" || e === "core::felt252", Rn = (e) => /\*/.test(e) || e.startsWith("core::array::Array::") || e.startsWith("core::array::Span::"), gr = (e) => /^\(.*\)$/i.test(e), Pw = (e) => /\(.*\)/i.test(e) && e.includes(":"), oi = (e, t) => e in t, na = (e, t) => e in t, Us = (e) => e.startsWith("core::option::Option::"), Hs = (e) => e.startsWith("core::result::Result::"), Lo = (e) => Object.values(At).includes(e), Zx = (e) => Ye.isAbiType(e), Qd = (e) => Object.values(ir).includes(e), Ls = (e) => e === "core::bool", Yx = (e) => e === ir.ContractAddress, ra = (e) => e === mw, Ds = (e) => e === "core::bytes_31::bytes31", ii = (e) => e === "core::byte_array::ByteArray", Rw = (e) => e === "core::internal::bounded_int::BoundedInt::<0, 79228162514264337593543950335>", Fs = (e) => e === ir.Secp256k1Point, mr = (e) => e.includes("::"), _n = (e) => mr(e) ? e.substring(e.indexOf("<") + 1, e.lastIndexOf(">")) : e.replace("*", "");
+}, ie(Jt, "abiSelector", "core::integer::u512"), Jt), Zr = (e) => /_len$/.test(e), Ba = (e) => e === "felt" || e === "core::felt252", Nn = (e) => /\*/.test(e) || e.startsWith("core::array::Array::") || e.startsWith("core::array::Span::"), gr = (e) => /^\(.*\)$/i.test(e), Pw = (e) => /\(.*\)/i.test(e) && e.includes(":"), oi = (e, t) => e in t, na = (e, t) => e in t, Us = (e) => e.startsWith("core::option::Option::"), Hs = (e) => e.startsWith("core::result::Result::"), Lo = (e) => Object.values(At).includes(e), Zx = (e) => Ye.isAbiType(e), Qd = (e) => Object.values(sr).includes(e), Ls = (e) => e === "core::bool", Yx = (e) => e === sr.ContractAddress, ra = (e) => e === mw, Ds = (e) => e === "core::bytes_31::bytes31", ii = (e) => e === "core::byte_array::ByteArray", Rw = (e) => e === "core::internal::bounded_int::BoundedInt::<0, 79228162514264337593543950335>", Fs = (e) => e === sr.Secp256k1Point, mr = (e) => e.includes("::"), _n = (e) => mr(e) ? e.substring(e.indexOf("<") + 1, e.lastIndexOf(">")) : e.replace("*", "");
 function ef(e) {
   const { cairo: t } = tf(e);
   if (t === void 0)
@@ -11125,7 +11125,7 @@ var si = class {
    * @throws {Error} If the data type does not match the expected BigInt (BN) type.
    */
   isBN: (e, t, n) => {
-    if (!Nn(e[n]))
+    if (!Un(e[n]))
       throw new Error(
         `Data and formatter mismatch on ${n}:${t[n]}, expected response data ${n}:${e[n]} to be BN instead it is ${typeof e[n]}`
       );
@@ -11461,7 +11461,7 @@ function cT(e, t, n, r) {
   const a = (h, f) => {
     if (wt.isTypeFixedArray(f))
       return s(h, f);
-    if (Rn(f))
+    if (Nn(f))
       return i(h, f);
     if (na(f, r)) {
       const l = r[f];
@@ -11732,7 +11732,7 @@ function dT(e, t, n, r) {
         throw Error(`ABI expected parameter ${a} to be an array or an object, got ${i}`);
       return Dt(i, t.type, n, r);
     // Normal Array
-    case Rn(o):
+    case Nn(o):
       if (!Array.isArray(i) && !ai(i))
         throw Error(`ABI expected parameter ${a} to be array or long string, got ${i}`);
       return Qe(i) && (i = Jd(i)), Dt(i, t.type, n, r);
@@ -11805,7 +11805,7 @@ function Bt(e, t, n, r) {
       a.push(Bt(e, o, n, r));
     return a;
   }
-  if (Rn(t.type)) {
+  if (Nn(t.type)) {
     const a = [], o = { type: _n(t.type) }, i = BigInt(e.next().value);
     for (; a.length < i; )
       a.push(Bt(e, o, n, r));
@@ -11839,7 +11839,7 @@ function Bt(e, t, n, r) {
       const c = i != null && i.name ? i.name : s, d = { type: i != null && i.type ? i.type : i };
       return o[c] = Bt(e, d, n, r), o;
     }, {});
-  if (Rn(t.type)) {
+  if (Nn(t.type)) {
     const a = [], o = { type: _n(t.type) }, i = BigInt(e.next().value);
     for (; a.length < i; )
       a.push(Bt(e, o, n, r));
@@ -11859,7 +11859,7 @@ function ps(e, t, n, r, a) {
       return Bt(e, t, n, r);
     case wt.isTypeFixedArray(i):
       return Bt(e, t, n, r);
-    case Rn(i):
+    case Nn(i):
       if (mr(i))
         return Bt(e, t, n, r);
       const c = [];
@@ -11884,7 +11884,7 @@ function ps(e, t, n, r, a) {
 }
 var rf = (e, t) => {
   if (be(
-    Qe(e) || Wr(e) || Nn(e),
+    Qe(e) || Wr(e) || Un(e),
     `Validate: arg ${t.name} should be a felt typed as (String, Number or BigInt)`
   ), Qe(e) && !$t(e)) return;
   const n = BigInt(e.toString(10));
@@ -11905,7 +11905,7 @@ var rf = (e, t) => {
     e <= Number.MAX_SAFE_INTEGER,
     "Validation: Parameter is too large to be typed as Number use (BigInt or String)"
   ), be(
-    Qe(e) || Wr(e) || Nn(e) || kn(e) && "low" in e && "high" in e || kn(e) && ["limb0", "limb1", "limb2", "limb3"].every((r) => r in e),
+    Qe(e) || Wr(e) || Un(e) || kn(e) && "low" in e && "high" in e || kn(e) && ["limb0", "limb1", "limb2", "limb3"].every((r) => r in e),
     `Validate: arg ${t.name} of cairo type ${t.type} should be type (String, Number or BigInt), but is ${typeof e} ${e}.`
   );
   let n;
@@ -11962,28 +11962,28 @@ var rf = (e, t) => {
         `Validate: arg ${t.name} is ${t.type} should be in range 0 - 2^512-1`
       );
       break;
-    case ir.ClassHash:
+    case sr.ClassHash:
       be(
         // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1670
         n >= 0n && n <= 2n ** 252n - 1n,
         `Validate: arg ${t.name} cairo typed ${t.type} should be in range [0, 2^252-1]`
       );
       break;
-    case ir.ContractAddress:
+    case sr.ContractAddress:
       be(
         // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1245
         n >= 0n && n <= 2n ** 252n - 1n,
         `Validate: arg ${t.name} cairo typed ${t.type} should be in range [0, 2^252-1]`
       );
       break;
-    case ir.Secp256k1Point: {
+    case sr.Secp256k1Point: {
       be(
         n >= 0n && n <= 2n ** 512n - 1n,
         `Validate: arg ${t.name} must be ${t.type} : a 512 bits number.`
       );
       break;
     }
-    case ir.U96: {
+    case sr.U96: {
       be(
         n >= 0n && n <= 2n ** 96n - 1n,
         `Validate: arg ${t.name} must be ${t.type} : a 96 bits number.`
@@ -12033,7 +12033,7 @@ var rf = (e, t) => {
 }, Dw = (e, t) => {
   be(kn(e), `Validate: arg ${t.name} should be a tuple (defined as object)`);
 }, Fw = (e, t, n, r) => {
-  const a = Rn(t.type), o = a ? _n(t.type) : wt.getFixedArrayType(t.type);
+  const a = Nn(t.type), o = a ? _n(t.type) : wt.getFixedArrayType(t.type);
   if (a && Ba(o) && Yd(e))
     return;
   let i = [];
@@ -12057,7 +12057,7 @@ var rf = (e, t) => {
     case gr(o):
       i.forEach((s) => Dw(s, { name: t.name }));
       break;
-    case Rn(o):
+    case Nn(o):
       i.forEach(
         (s) => Fw(s, { name: "", type: o }, n, r)
       );
@@ -12135,7 +12135,7 @@ function vm(e, t, n, r) {
       case ii(o.type):
         pT(i, o);
         break;
-      case (Rn(o.type) || wt.isTypeFixedArray(o.type)):
+      case (Nn(o.type) || wt.isTypeFixedArray(o.type)):
         Fw(i, o, n, r);
         break;
       case oi(o.type, n):
@@ -12173,19 +12173,19 @@ var xe = class po {
    * @param args ArgsOrCalldata - arguments that are passed to the method
    */
   validate(t, n, r = []) {
-    if (t !== or.DEPLOY) {
+    if (t !== ir.DEPLOY) {
       const i = this.abi.filter((s) => {
         if (s.type !== "function") return !1;
         const c = s.stateMutability === "view" || s.state_mutability === "view";
-        return t === or.INVOKE ? !c : c;
+        return t === ir.INVOKE ? !c : c;
       }).map((s) => s.name);
       be(
         i.includes(n),
-        `${t === or.INVOKE ? "invocable" : "viewable"} method not found in abi`
+        `${t === ir.INVOKE ? "invocable" : "viewable"} method not found in abi`
       );
     }
     const a = this.abi.find(
-      (i) => t === or.DEPLOY ? i.name === n && i.type === "constructor" : i.name === n && i.type === "function"
+      (i) => t === ir.DEPLOY ? i.name === n && i.type === "constructor" : i.name === n && i.type === "function"
     );
     if (km(n, r, a))
       return;
@@ -12249,7 +12249,7 @@ var xe = class po {
           let f = h;
           d === "entrypoint" ? f = Ke(f) : Yd(f) && (f = Ns(f));
           const l = Array.isArray(u) && d === "0" ? "$$len" : d;
-          if (Nn(f)) return [[`${c}${l}`, Mt(f)]];
+          if (Un(f)) return [[`${c}${l}`, Mt(f)]];
           if (Object(f) === f) {
             const g = Object.getOwnPropertyNames(Object.getPrototypeOf(f)), b = [...Object.getOwnPropertyNames(f), ...g];
             if (b.includes("isSome") && b.includes("isNone")) {
@@ -12815,7 +12815,7 @@ function dk(e, t = 50) {
   return _o(e, t);
 }
 function sf(e, t = 50, n = 50) {
-  if (Nn(e))
+  if (Un(e))
     return {
       l2_gas: { max_amount: "0x0", max_price_per_unit: "0x0" },
       l1_gas: { max_amount: "0x0", max_price_per_unit: "0x0" }
@@ -13085,7 +13085,7 @@ var Mo = (e, t = !1) => {
     /* SN_SEPOLIA */
   ], r = Math.floor(Math.random() * n.length);
   return n[r];
-}, hk = Object.values(lr), je = class {
+}, hk = Object.values(Rn), je = class {
   /**
    * Create a Block instance
    * @param {BlockIdentifier} _identifier  hex string and BigInt are detected as block hashes.
@@ -13120,7 +13120,7 @@ var Mo = (e, t = !1) => {
         this.tag = e;
       else
         throw TypeError(`Block identifier unmanaged: ${e}`);
-    else Nn(e) ? this.hash = ee(e) : Wr(e) ? this.number = e : this.tag = lr.PENDING;
+    else Un(e) ? this.hash = ee(e) : Wr(e) ? this.number = e : this.tag = Rn.PENDING;
     if (Wr(this.number) && this.number < 0)
       throw TypeError(`Block number (${this.number}) can't be negative`);
   }
@@ -13262,7 +13262,7 @@ function df(e) {
 }
 var Mu = {
   headers: { "Content-Type": "application/json" },
-  blockIdentifier: lr.PENDING,
+  blockIdentifier: Rn.PENDING,
   retries: 200
 }, nI = class {
   constructor(e) {
@@ -13758,7 +13758,7 @@ Oe(rI, {
 });
 var Vu = {
   headers: { "Content-Type": "application/json" },
-  blockIdentifier: lr.PENDING,
+  blockIdentifier: Rn.PENDING,
   retries: 200
 }, yk = class {
   constructor(e) {
@@ -14759,8 +14759,8 @@ var jk = class {
    * ```
    */
   async waitForBlock(e = "pending", t = 5e3) {
-    if (e === lr.LATEST) return;
-    const n = await this.getBlockNumber(), r = e === lr.PENDING ? n + 1 : Number(ee(e));
+    if (e === Rn.LATEST) return;
+    const n = await this.getBlockNumber(), r = e === Rn.PENDING ? n + 1 : Number(ee(e));
     if (r <= n) return;
     const { retries: a } = this.channel;
     let o = a, i = !1;
@@ -14804,7 +14804,7 @@ var jk = class {
    * Utility method, same result can be achieved using getBlockWithTxHashes(BlockTag.pending);
    */
   async getPendingTransactions() {
-    const { transactions: e } = await this.getBlockWithTxHashes(lr.PENDING).then(
+    const { transactions: e } = await this.getBlockWithTxHashes(Rn.PENDING).then(
       this.responseParser.parseGetBlockResponse
     );
     return Promise.all(e.map((t) => this.getTransactionByHash(t)));
@@ -15821,7 +15821,7 @@ var FI = class {
     blockIdentifier: o = void 0
   } = {}) {
     be(this.address !== null, "contract is not connected to an address");
-    const i = Oi(t, () => n ? (this.callData.validate(or.CALL, e, t), this.callData.compile(e, t)) : (xt.warn("Call skipped parsing but provided rawArgs, possible malfunction request"), t));
+    const i = Oi(t, () => n ? (this.callData.validate(ir.CALL, e, t), this.callData.compile(e, t)) : (xt.warn("Call skipped parsing but provided rawArgs, possible malfunction request"), t));
     return this.providerOrAccount.callContract(
       {
         contractAddress: this.address,
@@ -15833,7 +15833,7 @@ var FI = class {
   }
   invoke(e, t = [], { parseRequest: n = !0, maxFee: r, nonce: a, signature: o } = {}) {
     be(this.address !== null, "contract is not connected to an address");
-    const i = Oi(t, () => n ? (this.callData.validate(or.INVOKE, e, t), this.callData.compile(e, t)) : (xt.warn("Invoke skipped parsing but provided rawArgs, possible malfunction request"), t)), s = {
+    const i = Oi(t, () => n ? (this.callData.validate(ir.INVOKE, e, t), this.callData.compile(e, t)) : (xt.warn("Invoke skipped parsing but provided rawArgs, possible malfunction request"), t)), s = {
       contractAddress: this.address,
       calldata: i,
       entrypoint: e
@@ -15855,7 +15855,7 @@ var FI = class {
     );
   }
   async estimate(e, t = []) {
-    be(this.address !== null, "contract is not connected to an address"), Oi(t, () => !1) || this.callData.validate(or.INVOKE, e, t);
+    be(this.address !== null, "contract is not connected to an address"), Oi(t, () => !1) || this.callData.validate(ir.INVOKE, e, t);
     const n = this.populate(e, t);
     if ("estimateInvokeFee" in this.providerOrAccount)
       return this.providerOrAccount.estimateInvokeFee(n);
@@ -15995,7 +15995,10 @@ const KI = (e) => new En(
   [_e.SN_SEPOLIA]: "https://starknet-sepolia.drpc.org"
 }, Cm = /* @__PURE__ */ new Map(), Yr = (e = _e.SN_MAIN) => {
   let t = Cm.get(e);
-  return t || (t = new lI({ nodeUrl: e3[e] }), Cm.set(e, t)), t;
+  return t || (t = new lI({
+    nodeUrl: e3[e],
+    blockIdentifier: Rn.LATEST
+  }), Cm.set(e, t)), t;
 }, gs = [
   {
     name: "LockingContract",
@@ -24424,7 +24427,7 @@ function e_() {
   return Kt.SHA256 = e.SHA256, Kt.sha256 = e.sha256, Kt.SHA224 = e.SHA224, Kt.sha224 = e.sha224, Kt;
 }
 var fg;
-function Un() {
+function Hn() {
   return fg || (fg = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.taggedHash = e.TAGGED_HASH_PREFIXES = e.TAGS = e.hash256 = e.hash160 = e.sha256 = e.sha1 = e.ripemd160 = void 0;
     const t = /* @__PURE__ */ V3(), n = /* @__PURE__ */ q3(), r = /* @__PURE__ */ e_();
@@ -25189,7 +25192,7 @@ var yg;
 function Z3() {
   if (yg) return Za;
   yg = 1, Object.defineProperty(Za, "__esModule", { value: !0 }), Za.p2pkh = void 0;
-  const e = Un(), t = nn(), n = It(), r = ht(), a = yr(), o = wf(), i = n.OPS;
+  const e = Hn(), t = nn(), n = It(), r = ht(), a = yr(), o = wf(), i = n.OPS;
   function s(c, u) {
     if (!c.address && !c.hash && !c.output && !c.pubkey && !c.input)
       throw new TypeError("Not enough data");
@@ -25289,7 +25292,7 @@ var Ja = {}, bg;
 function Y3() {
   if (bg) return Ja;
   bg = 1, Object.defineProperty(Ja, "__esModule", { value: !0 }), Ja.p2sh = void 0;
-  const e = Un(), t = nn(), n = It(), r = ht(), a = yr(), o = wf(), i = n.OPS;
+  const e = Hn(), t = nn(), n = It(), r = ht(), a = yr(), o = wf(), i = n.OPS;
   function s(u, d) {
     return u.length !== d.length ? !1 : u.every((h, f) => h.equals(d[f]));
   }
@@ -25572,7 +25575,7 @@ var kg;
 function J3() {
   if (kg) return Qa;
   kg = 1, Object.defineProperty(Qa, "__esModule", { value: !0 }), Qa.p2wpkh = void 0;
-  const e = Un(), t = nn(), n = It(), r = ht(), a = yr(), o = Gs(), i = n.OPS, s = Buffer.alloc(0);
+  const e = Hn(), t = nn(), n = It(), r = ht(), a = yr(), o = Gs(), i = n.OPS, s = Buffer.alloc(0);
   function c(u, d) {
     if (!u.address && !u.hash && !u.output && !u.pubkey && !u.witness)
       throw new TypeError("Not enough data");
@@ -25676,7 +25679,7 @@ var eo = {}, _g;
 function Q3() {
   if (_g) return eo;
   _g = 1, Object.defineProperty(eo, "__esModule", { value: !0 }), eo.p2wsh = void 0;
-  const e = Un(), t = nn(), n = It(), r = ht(), a = yr(), o = Gs(), i = n.OPS, s = Buffer.alloc(0);
+  const e = Hn(), t = nn(), n = It(), r = ht(), a = yr(), o = Gs(), i = n.OPS, s = Buffer.alloc(0);
   function c(h, f) {
     return h.length !== f.length ? !1 : h.every((l, g) => l.equals(f[g]));
   }
@@ -26079,7 +26082,7 @@ var jg;
 function _f() {
   return jg || (jg = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.tweakKey = e.tapTweakHash = e.tapleafHash = e.findScriptPath = e.toHashTree = e.rootHashFromPath = e.MAX_TAPTREE_DEPTH = e.LEAF_VERSION_TAPSCRIPT = void 0;
-    const t = $s(), n = kf(), r = Un(), a = Ks(), o = ht();
+    const t = $s(), n = kf(), r = Hn(), a = Ks(), o = ht();
     e.LEAF_VERSION_TAPSCRIPT = 192, e.MAX_TAPTREE_DEPTH = 128;
     const i = (b) => "left" in b && "right" in b;
     function s(b, y) {
@@ -26582,7 +26585,7 @@ var ao = {}, Og;
 function di() {
   if (Og) return ao;
   Og = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.Transaction = void 0;
-  const e = Ks(), t = Un(), n = It(), r = It(), a = ht(), { typeforce: o } = a;
+  const e = Ks(), t = Hn(), n = It(), r = It(), a = ht(), { typeforce: o } = a;
   function i(y) {
     const _ = y.length;
     return e.varuint.encodingLength(_) + _;
@@ -26867,7 +26870,7 @@ var Bg;
 function aC() {
   if (Bg) return no;
   Bg = 1, Object.defineProperty(no, "__esModule", { value: !0 }), no.Block = void 0;
-  const e = Ks(), t = Un(), n = rC(), r = di(), a = ht(), { typeforce: o } = a, i = new TypeError(
+  const e = Ks(), t = Hn(), n = rC(), r = di(), a = ht(), { typeforce: o } = a, i = new TypeError(
     "Cannot compute merkle root for zero transactions"
   ), s = new TypeError(
     "Cannot compute witness commit for non-segwit block"
@@ -27032,10 +27035,10 @@ function dt() {
     ];
   })(dl)), dl;
 }
-var Vn = {}, Pg;
+var qn = {}, Pg;
 function oC() {
-  if (Pg) return Vn;
-  Pg = 1, Object.defineProperty(Vn, "__esModule", { value: !0 });
+  if (Pg) return qn;
+  Pg = 1, Object.defineProperty(qn, "__esModule", { value: !0 });
   const e = dt(), t = (i) => [...Array(i).keys()];
   function n(i) {
     if (i.key[0] !== e.GlobalTypes.GLOBAL_XPUB)
@@ -27061,7 +27064,7 @@ function oC() {
     }
     return c;
   }
-  Vn.decode = n;
+  qn.decode = n;
   function r(i) {
     const s = Buffer.from([e.GlobalTypes.GLOBAL_XPUB]), c = Buffer.concat([s, i.extendedPubkey]), u = i.path.split("/"), d = Buffer.allocUnsafe(u.length * 4);
     i.masterFingerprint.copy(d, 0);
@@ -27075,17 +27078,17 @@ function oC() {
       value: d
     };
   }
-  Vn.encode = r, Vn.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
+  qn.encode = r, qn.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
   function a(i) {
     const s = i.extendedPubkey, c = i.masterFingerprint, u = i.path;
     return Buffer.isBuffer(s) && s.length === 78 && [2, 3].indexOf(s[45]) > -1 && Buffer.isBuffer(c) && c.length === 4 && typeof u == "string" && !!u.match(/^m(\/\d+'?)*$/);
   }
-  Vn.check = a;
+  qn.check = a;
   function o(i, s, c) {
     const u = s.extendedPubkey.toString("hex");
     return c.has(u) ? !1 : (c.add(u), i.filter((d) => d.extendedPubkey.equals(s.extendedPubkey)).length === 0);
   }
-  return Vn.canAddToArray = o, Vn;
+  return qn.canAddToArray = o, qn;
 }
 var Di = {}, Rg;
 function iC() {
@@ -27100,10 +27103,10 @@ function iC() {
   }
   return Di.encode = t, Di;
 }
-var qn = {}, Ng;
+var $n = {}, Ng;
 function sC() {
-  if (Ng) return qn;
-  Ng = 1, Object.defineProperty(qn, "__esModule", { value: !0 });
+  if (Ng) return $n;
+  Ng = 1, Object.defineProperty($n, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.FINAL_SCRIPTSIG)
@@ -27112,27 +27115,27 @@ function sC() {
       );
     return o.value;
   }
-  qn.decode = t;
+  $n.decode = t;
   function n(o) {
     return {
       key: Buffer.from([e.InputTypes.FINAL_SCRIPTSIG]),
       value: o
     };
   }
-  qn.encode = n, qn.expected = "Buffer";
+  $n.encode = n, $n.expected = "Buffer";
   function r(o) {
     return Buffer.isBuffer(o);
   }
-  qn.check = r;
+  $n.check = r;
   function a(o, i) {
     return !!o && !!i && o.finalScriptSig === void 0;
   }
-  return qn.canAdd = a, qn;
+  return $n.canAdd = a, $n;
 }
-var $n = {}, Ug;
+var Gn = {}, Ug;
 function cC() {
-  if (Ug) return $n;
-  Ug = 1, Object.defineProperty($n, "__esModule", { value: !0 });
+  if (Ug) return Gn;
+  Ug = 1, Object.defineProperty(Gn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.FINAL_SCRIPTWITNESS)
@@ -27141,27 +27144,27 @@ function cC() {
       );
     return o.value;
   }
-  $n.decode = t;
+  Gn.decode = t;
   function n(o) {
     return {
       key: Buffer.from([e.InputTypes.FINAL_SCRIPTWITNESS]),
       value: o
     };
   }
-  $n.encode = n, $n.expected = "Buffer";
+  Gn.encode = n, Gn.expected = "Buffer";
   function r(o) {
     return Buffer.isBuffer(o);
   }
-  $n.check = r;
+  Gn.check = r;
   function a(o, i) {
     return !!o && !!i && o.finalScriptWitness === void 0;
   }
-  return $n.canAdd = a, $n;
+  return Gn.canAdd = a, Gn;
 }
-var Gn = {}, Hg;
+var Kn = {}, Hg;
 function uC() {
-  if (Hg) return Gn;
-  Hg = 1, Object.defineProperty(Gn, "__esModule", { value: !0 });
+  if (Hg) return Kn;
+  Hg = 1, Object.defineProperty(Kn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.NON_WITNESS_UTXO)
@@ -27170,27 +27173,27 @@ function uC() {
       );
     return o.value;
   }
-  Gn.decode = t;
+  Kn.decode = t;
   function n(o) {
     return {
       key: Buffer.from([e.InputTypes.NON_WITNESS_UTXO]),
       value: o
     };
   }
-  Gn.encode = n, Gn.expected = "Buffer";
+  Kn.encode = n, Kn.expected = "Buffer";
   function r(o) {
     return Buffer.isBuffer(o);
   }
-  Gn.check = r;
+  Kn.check = r;
   function a(o, i) {
     return !!o && !!i && o.nonWitnessUtxo === void 0;
   }
-  return Gn.canAdd = a, Gn;
+  return Kn.canAdd = a, Kn;
 }
-var Kn = {}, Lg;
+var Wn = {}, Lg;
 function lC() {
-  if (Lg) return Kn;
-  Lg = 1, Object.defineProperty(Kn, "__esModule", { value: !0 });
+  if (Lg) return Wn;
+  Lg = 1, Object.defineProperty(Wn, "__esModule", { value: !0 });
   const e = dt();
   function t(i) {
     if (i.key[0] !== e.InputTypes.PARTIAL_SIG)
@@ -27206,7 +27209,7 @@ function lC() {
       signature: i.value
     };
   }
-  Kn.decode = t;
+  Wn.decode = t;
   function n(i) {
     const s = Buffer.from([e.InputTypes.PARTIAL_SIG]);
     return {
@@ -27214,11 +27217,11 @@ function lC() {
       value: i.signature
     };
   }
-  Kn.encode = n, Kn.expected = "{ pubkey: Buffer; signature: Buffer; }";
+  Wn.encode = n, Wn.expected = "{ pubkey: Buffer; signature: Buffer; }";
   function r(i) {
     return Buffer.isBuffer(i.pubkey) && Buffer.isBuffer(i.signature) && [33, 65].includes(i.pubkey.length) && [2, 3, 4].includes(i.pubkey[0]) && a(i.signature);
   }
-  Kn.check = r;
+  Wn.check = r;
   function a(i) {
     if (!Buffer.isBuffer(i) || i.length < 9 || i[0] !== 48 || i.length !== i[1] + 3 || i[2] !== 2) return !1;
     const s = i[3];
@@ -27230,12 +27233,12 @@ function lC() {
     const u = s.pubkey.toString("hex");
     return c.has(u) ? !1 : (c.add(u), i.filter((d) => d.pubkey.equals(s.pubkey)).length === 0);
   }
-  return Kn.canAddToArray = o, Kn;
+  return Wn.canAddToArray = o, Wn;
 }
-var Wn = {}, Dg;
+var Xn = {}, Dg;
 function dC() {
-  if (Dg) return Wn;
-  Dg = 1, Object.defineProperty(Wn, "__esModule", { value: !0 });
+  if (Dg) return Xn;
+  Dg = 1, Object.defineProperty(Xn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.POR_COMMITMENT)
@@ -27244,27 +27247,27 @@ function dC() {
       );
     return o.value.toString("utf8");
   }
-  Wn.decode = t;
+  Xn.decode = t;
   function n(o) {
     return {
       key: Buffer.from([e.InputTypes.POR_COMMITMENT]),
       value: Buffer.from(o, "utf8")
     };
   }
-  Wn.encode = n, Wn.expected = "string";
+  Xn.encode = n, Xn.expected = "string";
   function r(o) {
     return typeof o == "string";
   }
-  Wn.check = r;
+  Xn.check = r;
   function a(o, i) {
     return !!o && !!i && o.porCommitment === void 0;
   }
-  return Wn.canAdd = a, Wn;
+  return Xn.canAdd = a, Xn;
 }
-var Xn = {}, Fg;
+var Zn = {}, Fg;
 function fC() {
-  if (Fg) return Xn;
-  Fg = 1, Object.defineProperty(Xn, "__esModule", { value: !0 });
+  if (Fg) return Zn;
+  Fg = 1, Object.defineProperty(Zn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.SIGHASH_TYPE)
@@ -27273,7 +27276,7 @@ function fC() {
       );
     return o.value.readUInt32LE(0);
   }
-  Xn.decode = t;
+  Zn.decode = t;
   function n(o) {
     const i = Buffer.from([e.InputTypes.SIGHASH_TYPE]), s = Buffer.allocUnsafe(4);
     return s.writeUInt32LE(o, 0), {
@@ -27281,20 +27284,20 @@ function fC() {
       value: s
     };
   }
-  Xn.encode = n, Xn.expected = "number";
+  Zn.encode = n, Zn.expected = "number";
   function r(o) {
     return typeof o == "number";
   }
-  Xn.check = r;
+  Zn.check = r;
   function a(o, i) {
     return !!o && !!i && o.sighashType === void 0;
   }
-  return Xn.canAdd = a, Xn;
+  return Zn.canAdd = a, Zn;
 }
-var Zn = {}, Mg;
+var Yn = {}, Mg;
 function pC() {
-  if (Mg) return Zn;
-  Mg = 1, Object.defineProperty(Zn, "__esModule", { value: !0 });
+  if (Mg) return Yn;
+  Mg = 1, Object.defineProperty(Yn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.TAP_KEY_SIG || o.key.length !== 1)
@@ -27307,24 +27310,24 @@ function pC() {
       );
     return o.value;
   }
-  Zn.decode = t;
+  Yn.decode = t;
   function n(o) {
     return { key: Buffer.from([e.InputTypes.TAP_KEY_SIG]), value: o };
   }
-  Zn.encode = n, Zn.expected = "Buffer";
+  Yn.encode = n, Yn.expected = "Buffer";
   function r(o) {
     return Buffer.isBuffer(o) && (o.length === 64 || o.length === 65);
   }
-  Zn.check = r;
+  Yn.check = r;
   function a(o, i) {
     return !!o && !!i && o.tapKeySig === void 0;
   }
-  return Zn.canAdd = a, Zn;
+  return Yn.canAdd = a, Yn;
 }
-var Yn = {}, Vg;
+var Jn = {}, Vg;
 function hC() {
-  if (Vg) return Yn;
-  Vg = 1, Object.defineProperty(Yn, "__esModule", { value: !0 });
+  if (Vg) return Jn;
+  Vg = 1, Object.defineProperty(Jn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.TAP_LEAF_SCRIPT)
@@ -27343,7 +27346,7 @@ function hC() {
     const s = o.value.slice(0, -1);
     return { controlBlock: o.key.slice(1), script: s, leafVersion: i };
   }
-  Yn.decode = t;
+  Jn.decode = t;
   function n(o) {
     const i = Buffer.from([e.InputTypes.TAP_LEAF_SCRIPT]), s = Buffer.from([o.leafVersion]);
     return {
@@ -27351,21 +27354,21 @@ function hC() {
       value: Buffer.concat([o.script, s])
     };
   }
-  Yn.encode = n, Yn.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
+  Jn.encode = n, Jn.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
   function r(o) {
     return Buffer.isBuffer(o.controlBlock) && (o.controlBlock.length - 1) % 32 === 0 && (o.controlBlock[0] & 254) === o.leafVersion && Buffer.isBuffer(o.script);
   }
-  Yn.check = r;
+  Jn.check = r;
   function a(o, i, s) {
     const c = i.controlBlock.toString("hex");
     return s.has(c) ? !1 : (s.add(c), o.filter((u) => u.controlBlock.equals(i.controlBlock)).length === 0);
   }
-  return Yn.canAddToArray = a, Yn;
+  return Jn.canAddToArray = a, Jn;
 }
-var Jn = {}, qg;
+var Qn = {}, qg;
 function mC() {
-  if (qg) return Jn;
-  qg = 1, Object.defineProperty(Jn, "__esModule", { value: !0 });
+  if (qg) return Qn;
+  qg = 1, Object.defineProperty(Qn, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.TAP_MERKLE_ROOT || o.key.length !== 1)
@@ -27376,24 +27379,24 @@ function mC() {
       throw new Error("Decode Error: tapMerkleRoot not a 32-byte hash");
     return o.value;
   }
-  Jn.decode = t;
+  Qn.decode = t;
   function n(o) {
     return { key: Buffer.from([e.InputTypes.TAP_MERKLE_ROOT]), value: o };
   }
-  Jn.encode = n, Jn.expected = "Buffer";
+  Qn.encode = n, Qn.expected = "Buffer";
   function r(o) {
     return Buffer.isBuffer(o) && o.length === 32;
   }
-  Jn.check = r;
+  Qn.check = r;
   function a(o, i) {
     return !!o && !!i && o.tapMerkleRoot === void 0;
   }
-  return Jn.canAdd = a, Jn;
+  return Qn.canAdd = a, Qn;
 }
-var Qn = {}, $g;
+var er = {}, $g;
 function gC() {
-  if ($g) return Qn;
-  $g = 1, Object.defineProperty(Qn, "__esModule", { value: !0 });
+  if ($g) return er;
+  $g = 1, Object.defineProperty(er, "__esModule", { value: !0 });
   const e = dt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.TAP_SCRIPT_SIG)
@@ -27415,7 +27418,7 @@ function gC() {
       signature: o.value
     };
   }
-  Qn.decode = t;
+  er.decode = t;
   function n(o) {
     const i = Buffer.from([e.InputTypes.TAP_SCRIPT_SIG]);
     return {
@@ -27423,20 +27426,20 @@ function gC() {
       value: o.signature
     };
   }
-  Qn.encode = n, Qn.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
+  er.encode = n, er.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
   function r(o) {
     return Buffer.isBuffer(o.pubkey) && Buffer.isBuffer(o.leafHash) && Buffer.isBuffer(o.signature) && o.pubkey.length === 32 && o.leafHash.length === 32 && (o.signature.length === 64 || o.signature.length === 65);
   }
-  Qn.check = r;
+  er.check = r;
   function a(o, i, s) {
     const c = i.pubkey.toString("hex") + i.leafHash.toString("hex");
     return s.has(c) ? !1 : (s.add(c), o.filter(
       (u) => u.pubkey.equals(i.pubkey) && u.leafHash.equals(i.leafHash)
     ).length === 0);
   }
-  return Qn.canAddToArray = a, Qn;
+  return er.canAddToArray = a, er;
 }
-var er = {}, Cn = {}, pa = {}, Gg;
+var tr = {}, Cn = {}, pa = {}, Gg;
 function oa() {
   if (Gg) return pa;
   Gg = 1, Object.defineProperty(pa, "__esModule", { value: !0 });
@@ -27522,8 +27525,8 @@ function vf() {
 }
 var Wg;
 function yC() {
-  if (Wg) return er;
-  Wg = 1, Object.defineProperty(er, "__esModule", { value: !0 });
+  if (Wg) return tr;
+  Wg = 1, Object.defineProperty(tr, "__esModule", { value: !0 });
   const e = dt(), t = vf(), n = oa();
   function r(s) {
     if (s.key[0] !== e.InputTypes.WITNESS_UTXO)
@@ -27542,7 +27545,7 @@ function yC() {
       value: c
     };
   }
-  er.decode = r;
+  tr.decode = r;
   function a(s) {
     const { script: c, value: u } = s, d = n.encodingLength(c.length), h = Buffer.allocUnsafe(8 + d + c.length);
     return t.writeUInt64LE(h, u, 0), n.encode(c.length, h, 8), c.copy(h, 8 + d), {
@@ -27550,20 +27553,20 @@ function yC() {
       value: h
     };
   }
-  er.encode = a, er.expected = "{ script: Buffer; value: number; }";
+  tr.encode = a, tr.expected = "{ script: Buffer; value: number; }";
   function o(s) {
     return Buffer.isBuffer(s.script) && typeof s.value == "number";
   }
-  er.check = o;
+  tr.check = o;
   function i(s, c) {
     return !!s && !!c && s.witnessUtxo === void 0;
   }
-  return er.canAdd = i, er;
+  return tr.canAdd = i, tr;
 }
-var tr = {}, Xg;
+var nr = {}, Xg;
 function bC() {
-  if (Xg) return tr;
-  Xg = 1, Object.defineProperty(tr, "__esModule", { value: !0 });
+  if (Xg) return nr;
+  Xg = 1, Object.defineProperty(nr, "__esModule", { value: !0 });
   const e = dt(), t = oa();
   function n(i) {
     if (i.key[0] !== e.OutputTypes.TAP_TREE || i.key.length !== 1)
@@ -27582,7 +27585,7 @@ function bC() {
     }
     return { leaves: c };
   }
-  tr.decode = n;
+  nr.decode = n;
   function r(i) {
     const s = Buffer.from([e.OutputTypes.TAP_TREE]), c = [].concat(
       ...i.leaves.map((u) => [
@@ -27596,17 +27599,17 @@ function bC() {
       value: Buffer.concat(c)
     };
   }
-  tr.encode = r, tr.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
+  nr.encode = r, nr.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
   function a(i) {
     return Array.isArray(i.leaves) && i.leaves.every(
       (s) => s.depth >= 0 && s.depth <= 128 && (s.leafVersion & 254) === s.leafVersion && Buffer.isBuffer(s.script)
     );
   }
-  tr.check = a;
+  nr.check = a;
   function o(i, s) {
     return !!i && !!s && i.tapTree === void 0;
   }
-  return tr.canAdd = o, tr;
+  return nr.canAdd = o, nr;
 }
 var Fi = {}, Zg;
 function n_() {
@@ -28525,7 +28528,7 @@ var Ue = {}, Ne = {}, uy;
 function Zl() {
   if (uy) return Ne;
   uy = 1, Object.defineProperty(Ne, "__esModule", { value: !0 }), Ne.signatureBlocksAction = Ne.checkInputForSig = Ne.pubkeyInScript = Ne.pubkeyPositionInScript = Ne.witnessStackToScriptWitness = Ne.isP2TR = Ne.isP2SHScript = Ne.isP2WSHScript = Ne.isP2WPKH = Ne.isP2PKH = Ne.isP2PK = Ne.isP2MS = void 0;
-  const e = oa(), t = It(), n = di(), r = Un(), a = li();
+  const e = oa(), t = It(), n = di(), r = Hn(), a = li();
   function o(l) {
     return (g) => {
       try {
@@ -30031,7 +30034,7 @@ function CC() {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.initEccLib = e.Transaction = e.opcodes = e.Psbt = e.Block = e.script = e.payments = e.networks = e.crypto = e.address = void 0;
     const t = t_();
     e.address = t;
-    const n = Un();
+    const n = Hn();
     e.crypto = n;
     const r = nn();
     e.networks = r;