@wormhole-foundation/wormhole-connect 3.0.0-beta.11-development → 3.0.0-beta.13-development

package/lib/{provider-jsonrpc-BVvalXMV.mjs → provider-jsonrpc-pHUX5SqN.mjs}

@@ -5,7 +5,7 @@ var Ci = (r) => {
 var ma = (r, t, e) => t in r ? wa(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e;
 var W = (r, t, e) => ma(r, typeof t != "symbol" ? t + "" : t, e), Bs = (r, t, e) => t.has(r) || Ci("Cannot " + e);
 var l = (r, t, e) => (Bs(r, t, "read from private field"), e ? e.call(r) : t.get(r)), A = (r, t, e) => t.has(r) ? Ci("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(r) : t.set(r, e), h = (r, t, e, n) => (Bs(r, t, "write to private field"), n ? n.call(r, e) : t.set(r, e), e), I = (r, t, e) => (Bs(r, t, "access private method"), e);
-var Tr = (r, t, e, n) => ({
+var Dr = (r, t, e, n) => ({
   set _(s) {
     h(r, t, s, e);
   },
@@ -13,8 +13,8 @@ var Tr = (r, t, e, n) => ({
     return l(r, t, n);
   }
 });
-import { b7 as j, bg as b, bj as S, bz as rt, b8 as D, bf as Ut, bA as po, bB as Ao, bC as qr, bD as Wr, bE as ya, bF as Hr, bb as ba, bc as xs, bG as Ea, b9 as wo, bH as Qt, bI as F, d as Pi, bJ as Ba, bK as xa, bL as gn, be as ut, bk as Ca, ad as ct, au as Xn, bm as cr, ah as q, bo as at, az as kt, bp as Pa, bM as Ft, bi as Kt, bN as Ia, bh as Bt } from "./address-CrYNZ_Nj.mjs";
-import { b as Na, a as _e, j as Ls, g as J, f as R, d as yt, t as _n, k as ir, i as mo, m as ka, l as va, n as hn, C as dr, o as Sa, L as Ra, T as Oa, p as Da, c as Us, F as Ii, E as Ta, A as Fa } from "./contract-D8VzaUQJ.mjs";
+import { bj as j, bs as b, bv as S, bL as rt, bk as T, br as Ut, bM as po, bN as Ao, bO as qr, bP as Wr, bQ as ya, bR as Hr, bn as ba, bo as xs, bS as Ea, bl as wo, bT as Qt, bU as F, d as Pi, bV as Ba, bW as xa, bX as gn, bq as ut, bw as Ca, ad as ct, au as Xn, by as cr, ah as q, bA as at, az as kt, bB as Pa, bY as Ft, bu as Kt, bZ as Ia, bt as Bt } from "./address-BkeBsCZD.mjs";
+import { b as Na, a as _e, j as Ls, g as J, f as R, d as yt, t as _n, k as ir, i as mo, m as ka, l as va, n as hn, C as dr, o as Sa, L as Ra, T as Oa, p as Ta, c as Us, F as Ii, E as Da, A as Fa } from "./contract-C26uilM9.mjs";
 const Xr = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
 let Fr = null;
 function La(r) {
@@ -167,7 +167,7 @@ function Ur(r) {
     throw new Error("missing signal; should not happen");
   return r.checkSignal(), r;
 }
-var An, wn, Ot, Yt, mn, yn, $, At, qt, Ue, Me, Qe, Gt, Dt, pe, Ge, lr;
+var An, wn, Ot, Yt, mn, yn, $, At, qt, Ue, Me, Qe, Gt, Tt, pe, Ge, lr;
 const os = class os {
   /**
    *  Create a new FetchRequest instance with default values.
@@ -191,9 +191,9 @@ const os = class os {
     A(this, Me);
     A(this, Qe);
     A(this, Gt);
-    A(this, Dt);
+    A(this, Tt);
     A(this, pe);
-    h(this, yn, String(t)), h(this, An, !1), h(this, wn, !0), h(this, Ot, {}), h(this, Yt, ""), h(this, mn, 3e5), h(this, Dt, {
+    h(this, yn, String(t)), h(this, An, !1), h(this, wn, !0), h(this, Ot, {}), h(this, Yt, ""), h(this, mn, 3e5), h(this, Tt, {
       slotInterval: Ja,
       maxAttempts: Ha
     }), h(this, pe, null);
@@ -410,14 +410,14 @@ const os = class os {
     h(this, pe, t);
   }
   toString() {
-    return `<FetchRequest method=${JSON.stringify(this.method)} url=${JSON.stringify(this.url)} headers=${JSON.stringify(this.headers)} body=${l(this, $) ? D(l(this, $)) : "null"}>`;
+    return `<FetchRequest method=${JSON.stringify(this.method)} url=${JSON.stringify(this.url)} headers=${JSON.stringify(this.headers)} body=${l(this, $) ? T(l(this, $)) : "null"}>`;
   }
   /**
    *  Update the throttle parameters used to determine maximum
    *  attempts and exponential-backoff properties.
    */
   setThrottleParams(t) {
-    t.slotInterval != null && (l(this, Dt).slotInterval = t.slotInterval), t.maxAttempts != null && (l(this, Dt).maxAttempts = t.maxAttempts);
+    t.slotInterval != null && (l(this, Tt).slotInterval = t.slotInterval), t.maxAttempts != null && (l(this, Tt).maxAttempts = t.maxAttempts);
   }
   /**
    *  Resolves to the response by sending the request.
@@ -453,7 +453,7 @@ const os = class os {
    */
   clone() {
     const t = new os(this.url);
-    return h(t, Yt, l(this, Yt)), l(this, $) && h(t, $, l(this, $)), h(t, At, l(this, At)), h(t, Ot, Object.assign({}, l(this, Ot))), h(t, qt, l(this, qt)), this.allowGzip && (t.allowGzip = !0), t.timeout = this.timeout, this.allowInsecureAuthentication && (t.allowInsecureAuthentication = !0), h(t, Ue, l(this, Ue)), h(t, Me, l(this, Me)), h(t, Qe, l(this, Qe)), h(t, Dt, Object.assign({}, l(this, Dt))), h(t, pe, l(this, pe)), t;
+    return h(t, Yt, l(this, Yt)), l(this, $) && h(t, $, l(this, $)), h(t, At, l(this, At)), h(t, Ot, Object.assign({}, l(this, Ot))), h(t, qt, l(this, qt)), this.allowGzip && (t.allowGzip = !0), t.timeout = this.timeout, this.allowInsecureAuthentication && (t.allowInsecureAuthentication = !0), h(t, Ue, l(this, Ue)), h(t, Me, l(this, Me)), h(t, Qe, l(this, Qe)), h(t, Tt, Object.assign({}, l(this, Tt))), h(t, pe, l(this, pe)), t;
   }
   /**
    *  Locks all static configuration for gateways and FetchGetUrlFunc
@@ -533,9 +533,9 @@ const os = class os {
     return Eo(t);
   }
 };
-An = new WeakMap(), wn = new WeakMap(), Ot = new WeakMap(), Yt = new WeakMap(), mn = new WeakMap(), yn = new WeakMap(), $ = new WeakMap(), At = new WeakMap(), qt = new WeakMap(), Ue = new WeakMap(), Me = new WeakMap(), Qe = new WeakMap(), Gt = new WeakMap(), Dt = new WeakMap(), pe = new WeakMap(), Ge = new WeakSet(), lr = async function(t, e, n, s, i) {
+An = new WeakMap(), wn = new WeakMap(), Ot = new WeakMap(), Yt = new WeakMap(), mn = new WeakMap(), yn = new WeakMap(), $ = new WeakMap(), At = new WeakMap(), qt = new WeakMap(), Ue = new WeakMap(), Me = new WeakMap(), Qe = new WeakMap(), Gt = new WeakMap(), Tt = new WeakMap(), pe = new WeakMap(), Ge = new WeakSet(), lr = async function(t, e, n, s, i) {
   var d, f, p;
-  if (t >= l(this, Dt).maxAttempts)
+  if (t >= l(this, Tt).maxAttempts)
     return i.makeServerError("exceeded maximum retry limit");
   S(ki() <= e, "timeout", "TIMEOUT", {
     operation: "request.send",
@@ -572,7 +572,7 @@ An = new WeakMap(), wn = new WeakMap(), Ot = new WeakMap(), Yt = new WeakMap(),
     return u;
   } else if (u.statusCode === 429 && (this.retryFunc == null || await this.retryFunc(o, u, t))) {
     const w = u.headers["retry-after"];
-    let m = l(this, Dt).slotInterval * Math.trunc(Math.random() * Math.pow(2, t));
+    let m = l(this, Tt).slotInterval * Math.trunc(Math.random() * Math.pow(2, t));
     return typeof w == "string" && w.match(/^[1-9][0-9]*$/) && (m = parseInt(w)), I(f = o.clone(), Ge, lr).call(f, t + 1, e, m, s, u);
   }
   if (this.processFunc) {
@@ -581,7 +581,7 @@ An = new WeakMap(), wn = new WeakMap(), Ot = new WeakMap(), Yt = new WeakMap(),
       u = await this.processFunc(o, u);
     } catch (w) {
       (w.throttle == null || typeof w.stall != "number") && u.makeServerError("error in post-processing function", w).assertOk();
-      let m = l(this, Dt).slotInterval * Math.trunc(Math.random() * Math.pow(2, t));
+      let m = l(this, Tt).slotInterval * Math.trunc(Math.random() * Math.pow(2, t));
       return w.stall >= 0 && (m = w.stall), I(p = o.clone(), Ge, lr).call(p, t + 1, e, m, s, u);
     }
   }
@@ -600,7 +600,7 @@ const yi = class yi {
     h(this, Br, t), h(this, xr, e), h(this, Cr, Object.keys(n).reduce((o, a) => (o[a.toLowerCase()] = String(n[a]), o), {})), h(this, wt, s == null ? null : new Uint8Array(s)), h(this, bn, i || null), h(this, He, { message: "" });
   }
   toString() {
-    return `<FetchResponse status=${this.statusCode} body=${l(this, wt) ? D(l(this, wt)) : "null"}>`;
+    return `<FetchResponse status=${this.statusCode} body=${l(this, wt) ? T(l(this, wt)) : "null"}>`;
   }
   /**
    *  The response status code.
@@ -807,12 +807,12 @@ function xo(r, t) {
     e(t + 1 + n);
     const s = vi(r, t + 1, n);
     e(t + 1 + n + s);
-    const i = D(r.slice(t + 1 + n, t + 1 + n + s));
+    const i = T(r.slice(t + 1 + n, t + 1 + n + s));
     return { consumed: 1 + n + s, result: i };
   } else if (r[t] >= 128) {
     const n = r[t] - 128;
     e(t + 1 + n);
-    const s = D(r.slice(t + 1, t + 1 + n));
+    const s = T(r.slice(t + 1, t + 1 + n));
     return { consumed: 1 + n, result: s };
   }
   return { consumed: 1, result: Ya(r[t]) };
@@ -1178,12 +1178,12 @@ class ic extends Io {
     for (let x = 0; x < 16; x++, e += 4)
       he[x] = t.getUint32(e), fe[x] = t.getUint32(e += 4);
     for (let x = 16; x < 80; x++) {
-      const T = he[x - 15] | 0, v = fe[x - 15] | 0, C = F.rotrSH(T, v, 1) ^ F.rotrSH(T, v, 8) ^ F.shrSH(T, v, 7), O = F.rotrSL(T, v, 1) ^ F.rotrSL(T, v, 8) ^ F.shrSL(T, v, 7), k = he[x - 2] | 0, H = fe[x - 2] | 0, Q = F.rotrSH(k, H, 19) ^ F.rotrBH(k, H, 61) ^ F.shrSH(k, H, 6), G = F.rotrSL(k, H, 19) ^ F.rotrBL(k, H, 61) ^ F.shrSL(k, H, 6), X = F.add4L(O, G, fe[x - 7], fe[x - 16]), nt = F.add4H(X, C, Q, he[x - 7], he[x - 16]);
+      const D = he[x - 15] | 0, v = fe[x - 15] | 0, C = F.rotrSH(D, v, 1) ^ F.rotrSH(D, v, 8) ^ F.shrSH(D, v, 7), O = F.rotrSL(D, v, 1) ^ F.rotrSL(D, v, 8) ^ F.shrSL(D, v, 7), k = he[x - 2] | 0, H = fe[x - 2] | 0, Q = F.rotrSH(k, H, 19) ^ F.rotrBH(k, H, 61) ^ F.shrSH(k, H, 6), G = F.rotrSL(k, H, 19) ^ F.rotrBL(k, H, 61) ^ F.shrSL(k, H, 6), X = F.add4L(O, G, fe[x - 7], fe[x - 16]), nt = F.add4H(X, C, Q, he[x - 7], he[x - 16]);
       he[x] = nt | 0, fe[x] = X | 0;
     }
     let { Ah: n, Al: s, Bh: i, Bl: o, Ch: a, Cl: c, Dh: u, Dl: d, Eh: f, El: p, Fh: w, Fl: m, Gh: g, Gl: y, Hh: E, Hl: N } = this;
     for (let x = 0; x < 80; x++) {
-      const T = F.rotrSH(f, p, 14) ^ F.rotrSH(f, p, 18) ^ F.rotrBH(f, p, 41), v = F.rotrSL(f, p, 14) ^ F.rotrSL(f, p, 18) ^ F.rotrBL(f, p, 41), C = f & w ^ ~f & g, O = p & m ^ ~p & y, k = F.add5L(N, v, O, sc[x], fe[x]), H = F.add5H(k, E, T, C, rc[x], he[x]), Q = k | 0, G = F.rotrSH(n, s, 28) ^ F.rotrBH(n, s, 34) ^ F.rotrBH(n, s, 39), X = F.rotrSL(n, s, 28) ^ F.rotrBL(n, s, 34) ^ F.rotrBL(n, s, 39), nt = n & i ^ n & a ^ i & a, Mt = s & o ^ s & c ^ o & c;
+      const D = F.rotrSH(f, p, 14) ^ F.rotrSH(f, p, 18) ^ F.rotrBH(f, p, 41), v = F.rotrSL(f, p, 14) ^ F.rotrSL(f, p, 18) ^ F.rotrBL(f, p, 41), C = f & w ^ ~f & g, O = p & m ^ ~p & y, k = F.add5L(N, v, O, sc[x], fe[x]), H = F.add5H(k, E, D, C, rc[x], he[x]), Q = k | 0, G = F.rotrSH(n, s, 28) ^ F.rotrBH(n, s, 34) ^ F.rotrBH(n, s, 39), X = F.rotrSL(n, s, 28) ^ F.rotrBL(n, s, 34) ^ F.rotrBL(n, s, 39), nt = n & i ^ n & a ^ i & a, Mt = s & o ^ s & c ^ o & c;
       E = g | 0, N = y | 0, g = w | 0, y = m | 0, w = f | 0, m = p | 0, { h: f, l: p } = F.add(u | 0, d | 0, H | 0, Q | 0), u = a | 0, d = c | 0, a = i | 0, c = o | 0, i = n | 0, o = s | 0;
       const B = F.add3L(Q, X, Mt);
       n = F.add3H(B, H, G, nt), s = B | 0;
@@ -1207,7 +1207,7 @@ function oc() {
     return Pi.global;
   throw new Error("unable to locate global object");
 }
-const Di = oc(), Ti = Di.crypto || Di.msCrypto;
+const Ti = oc(), Di = Ti.crypto || Ti.msCrypto;
 function ac(r) {
   switch (r) {
     case "sha256":
@@ -1221,16 +1221,16 @@ function Ou(r, t) {
   const e = { sha256: ds, sha512: oi }[r];
   return b(e != null, "invalid hmac algorithm", "algorithm", r), fs.create(e, t);
 }
-function Du(r, t, e, n, s) {
+function Tu(r, t, e, n, s) {
   const i = { sha256: ds, sha512: oi }[s];
   return b(i != null, "invalid pbkdf2 algorithm", "algorithm", s), Xa(i, r, t, { c: e, dkLen: n });
 }
-function Tu(r) {
-  S(Ti != null, "platform does not support secure random numbers", "UNSUPPORTED_OPERATION", {
+function Du(r) {
+  S(Di != null, "platform does not support secure random numbers", "UNSUPPORTED_OPERATION", {
     operation: "randomBytes"
   }), b(Number.isInteger(r) && r > 0 && r <= 1024, "invalid length", "length", r);
   const t = new Uint8Array(r);
-  return Ti.getRandomValues(t), t;
+  return Di.getRandomValues(t), t;
 }
 const No = function(r) {
   return ac("sha256").update(r).digest();
@@ -1238,7 +1238,7 @@ const No = function(r) {
 let ko = No, vo = !1;
 function or(r) {
   const t = j(r, "data");
-  return D(ko(t));
+  return T(ko(t));
 }
 or._ = No;
 or.lock = function() {
@@ -1565,14 +1565,14 @@ function Pc(r, t) {
   const e = new Array(t.length), n = t.reduce((i, o, a) => r.is0(o) ? i : (e[a] = i, r.mul(i, o)), r.ONE), s = r.inv(n);
   return t.reduceRight((i, o, a) => r.is0(o) ? i : (e[a] = r.mul(i, e[a]), r.mul(i, o)), s), e;
 }
-function Do(r, t) {
+function To(r, t) {
   const e = t !== void 0 ? t : r.toString(2).length, n = Math.ceil(e / 8);
   return { nBitLength: e, nByteLength: n };
 }
 function Ic(r, t, e = !1, n = {}) {
   if (r <= et)
     throw new Error(`Expected Field ORDER > 0, got ${r}`);
-  const { nBitLength: s, nByteLength: i } = Do(r, t);
+  const { nBitLength: s, nByteLength: i } = To(r, t);
   if (i > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
   const o = Ec(r), a = Object.freeze({
@@ -1618,18 +1618,18 @@ function Ic(r, t, e = !1, n = {}) {
   });
   return Object.freeze(a);
 }
-function To(r) {
+function Do(r) {
   if (typeof r != "bigint")
     throw new Error("field order must be bigint");
   const t = r.toString(2).length;
   return Math.ceil(t / 8);
 }
 function Fo(r) {
-  const t = To(r);
+  const t = Do(r);
   return t + Math.ceil(t / 2);
 }
 function Nc(r, t, e = !1) {
-  const n = r.length, s = To(t), i = Fo(t);
+  const n = r.length, s = Do(t), i = Fo(t);
   if (n < 16 || n < i || n > 1024)
     throw new Error(`expected ${i}-1024 bytes of input, got ${n}`);
   const o = e ? $e(r) : ci(r), a = ft(o, t - Z) + Z;
@@ -1690,8 +1690,8 @@ function vc(r, t) {
         const g = m * c;
         let y = Number(o & f);
         o >>= w, y > c && (y -= p, o += Is);
-        const E = g, N = g + Math.abs(y) - 1, x = m % 2 !== 0, T = y < 0;
-        y === 0 ? d = d.add(e(x, i[E])) : u = u.add(e(T, i[N]));
+        const E = g, N = g + Math.abs(y) - 1, x = m % 2 !== 0, D = y < 0;
+        y === 0 ? d = d.add(e(x, i[E])) : u = u.add(e(D, i[N]));
       }
       return { p: u, f: d };
     },
@@ -1712,7 +1712,7 @@ function Lo(r) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...Do(r.n, r.nBitLength),
+    ...To(r.n, r.nBitLength),
     ...r,
     p: r.Fp.ORDER
   });
@@ -1741,7 +1741,7 @@ function Sc(r) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, Te = {
+const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, De = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -1749,7 +1749,7 @@ const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, Te = {
     }
   },
   _parseInt(r) {
-    const { Err: t } = Te;
+    const { Err: t } = De;
     if (r.length < 2 || r[0] !== 2)
       throw new t("Invalid signature integer tag");
     const e = r[1], n = r.subarray(2, e + 2);
@@ -1762,7 +1762,7 @@ const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, Te = {
     return { d: Rc(n), l: r.subarray(e + 2) };
   },
   toSig(r) {
-    const { Err: t } = Te, e = typeof r == "string" ? Oc(r) : r;
+    const { Err: t } = De, e = typeof r == "string" ? Oc(r) : r;
     if (!(e instanceof Uint8Array))
       throw new Error("ui8a expected");
     let n = e.length;
@@ -1770,7 +1770,7 @@ const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, Te = {
       throw new t("Invalid signature tag");
     if (e[1] !== n - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: s, l: i } = Te._parseInt(e.subarray(2)), { d: o, l: a } = Te._parseInt(i);
+    const { d: s, l: i } = De._parseInt(e.subarray(2)), { d: o, l: a } = De._parseInt(i);
     if (a.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: s, s: o };
@@ -1786,7 +1786,7 @@ const { bytesToNumberBE: Rc, hexToBytes: Oc } = wc, Te = {
 BigInt(2);
 const Mi = BigInt(3);
 BigInt(4);
-function Dc(r) {
+function Tc(r) {
   const t = Sc(r), { Fp: e } = t, n = t.toBytes || ((m, g, y) => {
     const E = g.toAffine();
     return pr(Uint8Array.from([4]), e.toBytes(E.x), e.toBytes(E.y));
@@ -1906,7 +1906,7 @@ function Dc(r) {
      */
     equals(g) {
       d(g);
-      const { px: y, py: E, pz: N } = this, { px: x, py: T, pz: v } = g, C = e.eql(e.mul(y, v), e.mul(x, N)), O = e.eql(e.mul(E, v), e.mul(T, N));
+      const { px: y, py: E, pz: N } = this, { px: x, py: D, pz: v } = g, C = e.eql(e.mul(y, v), e.mul(x, N)), O = e.eql(e.mul(E, v), e.mul(D, N));
       return C && O;
     }
     /**
@@ -1920,9 +1920,9 @@ function Dc(r) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: g, b: y } = t, E = e.mul(y, Mi), { px: N, py: x, pz: T } = this;
-      let v = e.ZERO, C = e.ZERO, O = e.ZERO, k = e.mul(N, N), H = e.mul(x, x), Q = e.mul(T, T), G = e.mul(N, x);
-      return G = e.add(G, G), O = e.mul(N, T), O = e.add(O, O), v = e.mul(g, O), C = e.mul(E, Q), C = e.add(v, C), v = e.sub(H, C), C = e.add(H, C), C = e.mul(v, C), v = e.mul(G, v), O = e.mul(E, O), Q = e.mul(g, Q), G = e.sub(k, Q), G = e.mul(g, G), G = e.add(G, O), O = e.add(k, k), k = e.add(O, k), k = e.add(k, Q), k = e.mul(k, G), C = e.add(C, k), Q = e.mul(x, T), Q = e.add(Q, Q), k = e.mul(Q, G), v = e.sub(v, k), O = e.mul(Q, H), O = e.add(O, O), O = e.add(O, O), new f(v, C, O);
+      const { a: g, b: y } = t, E = e.mul(y, Mi), { px: N, py: x, pz: D } = this;
+      let v = e.ZERO, C = e.ZERO, O = e.ZERO, k = e.mul(N, N), H = e.mul(x, x), Q = e.mul(D, D), G = e.mul(N, x);
+      return G = e.add(G, G), O = e.mul(N, D), O = e.add(O, O), v = e.mul(g, O), C = e.mul(E, Q), C = e.add(v, C), v = e.sub(H, C), C = e.add(H, C), C = e.mul(v, C), v = e.mul(G, v), O = e.mul(E, O), Q = e.mul(g, Q), G = e.sub(k, Q), G = e.mul(g, G), G = e.add(G, O), O = e.add(k, k), k = e.add(O, k), k = e.add(k, Q), k = e.mul(k, G), C = e.add(C, k), Q = e.mul(x, D), Q = e.add(Q, Q), k = e.mul(Q, G), v = e.sub(v, k), O = e.mul(Q, H), O = e.add(O, O), O = e.add(O, O), new f(v, C, O);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -1930,13 +1930,13 @@ function Dc(r) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(g) {
       d(g);
-      const { px: y, py: E, pz: N } = this, { px: x, py: T, pz: v } = g;
+      const { px: y, py: E, pz: N } = this, { px: x, py: D, pz: v } = g;
       let C = e.ZERO, O = e.ZERO, k = e.ZERO;
       const H = t.a, Q = e.mul(t.b, Mi);
-      let G = e.mul(y, x), X = e.mul(E, T), nt = e.mul(N, v), Mt = e.add(y, E), B = e.add(x, T);
+      let G = e.mul(y, x), X = e.mul(E, D), nt = e.mul(N, v), Mt = e.add(y, E), B = e.add(x, D);
       Mt = e.mul(Mt, B), B = e.add(G, X), Mt = e.sub(Mt, B), B = e.add(y, N);
       let P = e.add(x, v);
-      return B = e.mul(B, P), P = e.add(G, nt), B = e.sub(B, P), P = e.add(E, N), C = e.add(T, v), P = e.mul(P, C), C = e.add(X, nt), P = e.sub(P, C), k = e.mul(H, B), C = e.mul(Q, nt), k = e.add(C, k), C = e.sub(X, k), k = e.add(X, k), O = e.mul(C, k), X = e.add(G, G), X = e.add(X, G), nt = e.mul(H, nt), B = e.mul(Q, B), X = e.add(X, nt), nt = e.sub(G, nt), nt = e.mul(H, nt), B = e.add(B, nt), G = e.mul(X, B), O = e.add(O, G), G = e.mul(P, B), C = e.mul(Mt, C), C = e.sub(C, G), G = e.mul(Mt, X), k = e.mul(P, k), k = e.add(k, G), new f(C, O, k);
+      return B = e.mul(B, P), P = e.add(G, nt), B = e.sub(B, P), P = e.add(E, N), C = e.add(D, v), P = e.mul(P, C), C = e.add(X, nt), P = e.sub(P, C), k = e.mul(H, B), C = e.mul(Q, nt), k = e.add(C, k), C = e.sub(X, k), k = e.add(X, k), O = e.mul(C, k), X = e.add(G, G), X = e.add(X, G), nt = e.mul(H, nt), B = e.mul(Q, B), X = e.add(X, nt), nt = e.sub(G, nt), nt = e.mul(H, nt), B = e.add(B, nt), G = e.mul(X, B), O = e.add(O, G), G = e.mul(P, B), C = e.mul(Mt, C), C = e.sub(C, G), G = e.mul(Mt, X), k = e.mul(P, k), k = e.add(k, G), new f(C, O, k);
     }
     subtract(g) {
       return this.add(g.negate());
@@ -1964,10 +1964,10 @@ function Dc(r) {
       const { endo: E } = t;
       if (!E)
         return w.unsafeLadder(this, g);
-      let { k1neg: N, k1: x, k2neg: T, k2: v } = E.splitScalar(g), C = y, O = y, k = this;
+      let { k1neg: N, k1: x, k2neg: D, k2: v } = E.splitScalar(g), C = y, O = y, k = this;
       for (; x > se || v > se; )
         x & Nt && (C = C.add(k)), v & Nt && (O = O.add(k)), k = k.double(), x >>= Nt, v >>= Nt;
-      return N && (C = C.negate()), T && (O = O.negate()), O = new f(e.mul(O.px, E.beta), O.py, O.pz), C.add(O);
+      return N && (C = C.negate()), D && (O = O.negate()), O = new f(e.mul(O.px, E.beta), O.py, O.pz), C.add(O);
     }
     /**
      * Constant time multiplication.
@@ -1983,12 +1983,12 @@ function Dc(r) {
       let y = g, E, N;
       const { endo: x } = t;
       if (x) {
-        const { k1neg: T, k1: v, k2neg: C, k2: O } = x.splitScalar(y);
+        const { k1neg: D, k1: v, k2neg: C, k2: O } = x.splitScalar(y);
         let { p: k, f: H } = this.wNAF(v), { p: Q, f: G } = this.wNAF(O);
-        k = w.constTimeNegate(T, k), Q = w.constTimeNegate(C, Q), Q = new f(e.mul(Q.px, x.beta), Q.py, Q.pz), E = k.add(Q), N = H.add(G);
+        k = w.constTimeNegate(D, k), Q = w.constTimeNegate(C, Q), Q = new f(e.mul(Q.px, x.beta), Q.py, Q.pz), E = k.add(Q), N = H.add(G);
       } else {
-        const { p: T, f: v } = this.wNAF(y);
-        E = T, N = v;
+        const { p: D, f: v } = this.wNAF(y);
+        E = D, N = v;
       }
       return f.normalizeZ([E, N])[0];
     }
@@ -1999,8 +1999,8 @@ function Dc(r) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(g, y, E) {
-      const N = f.BASE, x = (v, C) => C === se || C === Nt || !v.equals(N) ? v.multiplyUnsafe(C) : v.multiply(C), T = x(this, y).add(x(g, E));
-      return T.is0() ? void 0 : T;
+      const N = f.BASE, x = (v, C) => C === se || C === Nt || !v.equals(N) ? v.multiplyUnsafe(C) : v.multiply(C), D = x(this, y).add(x(g, E));
+      return D.is0() ? void 0 : D;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
@@ -2008,12 +2008,12 @@ function Dc(r) {
     toAffine(g) {
       const { px: y, py: E, pz: N } = this, x = this.is0();
       g == null && (g = x ? e.ONE : e.inv(N));
-      const T = e.mul(y, g), v = e.mul(E, g), C = e.mul(N, g);
+      const D = e.mul(y, g), v = e.mul(E, g), C = e.mul(N, g);
       if (x)
         return { x: e.ZERO, y: e.ZERO };
       if (!e.eql(C, e.ONE))
         throw new Error("invZ was invalid");
-      return { x: T, y: v };
+      return { x: D, y: v };
     }
     isTorsionFree() {
       const { h: g, isTorsionFree: y } = t;
@@ -2044,7 +2044,7 @@ function Dc(r) {
     isWithinCurveOrder: o
   };
 }
-function Tc(r) {
+function Dc(r) {
   const t = Lo(r);
   return Sr(t, {
     hash: "hash",
@@ -2057,7 +2057,7 @@ function Tc(r) {
   }), Object.freeze({ lowS: !0, ...t });
 }
 function Fc(r) {
-  const t = Tc(r), { Fp: e, n } = t, s = e.BYTES + 1, i = 2 * e.BYTES + 1;
+  const t = Dc(r), { Fp: e, n } = t, s = e.BYTES + 1, i = 2 * e.BYTES + 1;
   function o(B) {
     return se < B && B < e.ORDER;
   }
@@ -2067,7 +2067,7 @@ function Fc(r) {
   function c(B) {
     return Gs(B, n);
   }
-  const { ProjectivePoint: u, normPrivateKeyToScalar: d, weierstrassEquation: f, isWithinCurveOrder: p } = Dc({
+  const { ProjectivePoint: u, normPrivateKeyToScalar: d, weierstrassEquation: f, isWithinCurveOrder: p } = Tc({
     ...t,
     toBytes(B, P, U) {
       const z = P.toAffine(), V = e.toBytes(z.x), _ = pr;
@@ -2110,7 +2110,7 @@ function Fc(r) {
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(P) {
-      const { r: U, s: z } = Te.toSig(Rt("DER", P));
+      const { r: U, s: z } = De.toSig(Rt("DER", P));
       return new E(U, z);
     }
     assertValidity() {
@@ -2146,7 +2146,7 @@ function Fc(r) {
       return tr(this.toDERHex());
     }
     toDERHex() {
-      return Te.hexFromSig({ r: this.r, s: this.s });
+      return De.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -2188,14 +2188,14 @@ function Fc(r) {
   function x(B, P = !0) {
     return u.fromPrivateKey(B).toRawBytes(P);
   }
-  function T(B) {
+  function D(B) {
     const P = B instanceof Uint8Array, U = typeof B == "string", z = (P || U) && B.length;
     return P ? z === s || z === i : U ? z === 2 * s || z === 2 * i : B instanceof u;
   }
   function v(B, P, U = !0) {
-    if (T(B))
+    if (D(B))
       throw new Error("first arg must be private key");
-    if (!T(P))
+    if (!D(P))
       throw new Error("second arg must be public key");
     return u.fromHex(P).multiply(d(B)).toRawBytes(U);
   }
@@ -2257,7 +2257,7 @@ function Fc(r) {
         try {
           gt = E.fromDER(V);
         } catch (vt) {
-          if (!(vt instanceof Te.Err))
+          if (!(vt instanceof De.Err))
             throw vt;
           gt = E.fromCompact(V);
         }
@@ -2304,7 +2304,7 @@ function Uc(r, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Uo = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Qi = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Mc = BigInt(1), Hs = BigInt(2), Gi = (r, t) => (r + t / Hs) / t;
 function Qc(r) {
-  const t = Uo, e = BigInt(3), n = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), u = r * r * r % t, d = u * u * r % t, f = bt(d, e, t) * d % t, p = bt(f, e, t) * d % t, w = bt(p, Hs, t) * u % t, m = bt(w, s, t) * w % t, g = bt(m, i, t) * m % t, y = bt(g, a, t) * g % t, E = bt(y, c, t) * y % t, N = bt(E, a, t) * g % t, x = bt(N, e, t) * d % t, T = bt(x, o, t) * m % t, v = bt(T, n, t) * u % t, C = bt(v, Hs, t);
+  const t = Uo, e = BigInt(3), n = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), u = r * r * r % t, d = u * u * r % t, f = bt(d, e, t) * d % t, p = bt(f, e, t) * d % t, w = bt(p, Hs, t) * u % t, m = bt(w, s, t) * w % t, g = bt(m, i, t) * m % t, y = bt(g, a, t) * g % t, E = bt(y, c, t) * y % t, N = bt(E, a, t) * g % t, x = bt(N, e, t) * d % t, D = bt(x, o, t) * m % t, v = bt(D, n, t) * u % t, C = bt(v, Hs, t);
   if (!Js.eql(Js.sqr(C), r))
     throw new Error("Cannot find square root");
   return C;
@@ -2365,7 +2365,7 @@ const St = class St {
     return l(this, En);
   }
   set r(t) {
-    b(gn(t) === 32, "invalid r", "value", t), h(this, En, D(t));
+    b(gn(t) === 32, "invalid r", "value", t), h(this, En, T(t));
   }
   /**
    *  The ``s`` value for a signature.
@@ -2375,7 +2375,7 @@ const St = class St {
   }
   set s(t) {
     b(gn(t) === 32, "invalid s", "value", t);
-    const e = D(t);
+    const e = T(t);
     b(parseInt(e.substring(0, 3)) < 8, "non-canonical s", "value", e), h(this, Bn, e);
   }
   /**
@@ -2424,7 +2424,7 @@ const St = class St {
    */
   get yParityAndS() {
     const t = j(this.s);
-    return this.yParity && (t[0] |= 128), D(t);
+    return this.yParity && (t[0] |= 128), T(t);
   }
   /**
    *  The [[link-eip-2098]] compact representation.
@@ -2534,14 +2534,14 @@ const St = class St {
     if (typeof t == "string") {
       const u = j(t, "signature");
       if (u.length === 64) {
-        const d = D(u.slice(0, 32)), f = u.slice(32, 64), p = f[0] & 128 ? 28 : 27;
-        return f[0] &= 127, new St(on, d, D(f), p);
+        const d = T(u.slice(0, 32)), f = u.slice(32, 64), p = f[0] & 128 ? 28 : 27;
+        return f[0] &= 127, new St(on, d, T(f), p);
       }
       if (u.length === 65) {
-        const d = D(u.slice(0, 32)), f = u.slice(32, 64);
+        const d = T(u.slice(0, 32)), f = u.slice(32, 64);
         e((f[0] & 128) === 0, "non-canonical s");
         const p = St.getNormalizedV(u[64]);
-        return new St(on, d, D(f), p);
+        return new St(on, d, T(f), p);
       }
       e(!1, "invalid raw signature length");
     }
@@ -2555,7 +2555,7 @@ const St = class St {
       if (d != null) {
         e(ct(d, 32), "invalid yParityAndS");
         const f = j(d);
-        return f[0] &= 127, D(f);
+        return f[0] &= 127, T(f);
       }
       e(!1, "missing s");
     }(t.s, t.yParityAndS);
@@ -2587,13 +2587,13 @@ const St = class St {
 En = new WeakMap(), Bn = new WeakMap(), xn = new WeakMap(), Je = new WeakMap();
 let Lt = St;
 var Wt;
-const De = class De {
+const Te = class Te {
   /**
    *  Creates a new **SigningKey** for %%privateKey%%.
    */
   constructor(t) {
     A(this, Wt);
-    b(gn(t) === 32, "invalid private key", "privateKey", "[REDACTED]"), h(this, Wt, D(t));
+    b(gn(t) === 32, "invalid private key", "privateKey", "[REDACTED]"), h(this, Wt, T(t));
   }
   /**
    *  The private key.
@@ -2608,7 +2608,7 @@ const De = class De {
    * characters long (the ``0x`` prefix and 130 hexadecimal nibbles).
    */
   get publicKey() {
-    return De.computePublicKey(l(this, Wt));
+    return Te.computePublicKey(l(this, Wt));
   }
   /**
    *  The compressed public key.
@@ -2618,7 +2618,7 @@ const De = class De {
    *  nibbles)
    */
   get compressedPublicKey() {
-    return De.computePublicKey(l(this, Wt), !0);
+    return Te.computePublicKey(l(this, Wt), !0);
   }
   /**
    *  Return the signature of the signed %%digest%%.
@@ -2657,8 +2657,8 @@ const De = class De {
    *    //_result:
    */
   computeSharedSecret(t) {
-    const e = De.computePublicKey(t);
-    return D(de.getSharedSecret(cr(l(this, Wt)), j(e), !1));
+    const e = Te.computePublicKey(t);
+    return T(de.getSharedSecret(cr(l(this, Wt)), j(e), !1));
   }
   /**
    *  Compute the public key for %%key%%, optionally %%compressed%%.
@@ -2689,14 +2689,14 @@ const De = class De {
     let n = j(t, "key");
     if (n.length === 32) {
       const i = de.getPublicKey(n, !!e);
-      return D(i);
+      return T(i);
     }
     if (n.length === 64) {
       const i = new Uint8Array(65);
       i[0] = 4, i.set(n, 1), n = i;
     }
     const s = de.ProjectivePoint.fromHex(n);
-    return D(s.toRawBytes(e));
+    return T(s.toRawBytes(e));
   }
   /**
    *  Returns the public key for the private key which produced the
@@ -2735,12 +2735,12 @@ const De = class De {
    *  addresses from parent public keys and chain codes.
    */
   static addPoints(t, e, n) {
-    const s = de.ProjectivePoint.fromHex(De.computePublicKey(t).substring(2)), i = de.ProjectivePoint.fromHex(De.computePublicKey(e).substring(2));
+    const s = de.ProjectivePoint.fromHex(Te.computePublicKey(t).substring(2)), i = de.ProjectivePoint.fromHex(Te.computePublicKey(e).substring(2));
     return "0x" + s.add(i).toHex(!!n);
   }
 };
 Wt = new WeakMap();
-let wr = De;
+let wr = Te;
 function Gc(r) {
   const t = q(r.from);
   let n = R(r.nonce, "tx.nonce").toString(16);
@@ -2781,15 +2781,15 @@ function Jc(r) {
       y = y & w | y << 1 & g >>> 1 | d(), k = k << 1 ^ w, H = (H ^ w) << 1 | w | 1;
     N = k, x = 1 + H - k;
   }
-  let T = n - 4;
+  let D = n - 4;
   return E.map((v) => {
-    switch (v - T) {
+    switch (v - D) {
       case 3:
-        return T + 65792 + (r[a++] << 16 | r[a++] << 8 | r[a++]);
+        return D + 65792 + (r[a++] << 16 | r[a++] << 8 | r[a++]);
       case 2:
-        return T + 256 + (r[a++] << 8 | r[a++]);
+        return D + 256 + (r[a++] << 8 | r[a++]);
       case 1:
-        return T + r[a++];
+        return D + r[a++];
       default:
         return v - 1;
     }
@@ -3304,11 +3304,11 @@ function Ys(r) {
   const e = sa(r);
   for (; e.length; )
     t = kt(ut([t, kt(e.pop())]));
-  return D(t);
+  return T(t);
 }
 function Cl(r, t) {
   const e = t;
-  return b(e <= 255, "DNS encoded label cannot exceed 255", "length", e), D(ut(sa(r).map((n) => {
+  return b(e <= 255, "DNS encoded label cannot exceed 255", "length", e), T(ut(sa(r).map((n) => {
     b(n.length <= e, `label ${JSON.stringify(r)} exceeds ${e} bytes`, "name", r);
     const s = new Uint8Array(n.length + 1);
     return s.set(n, 1), s[0] = s.length - 1, s;
@@ -3360,7 +3360,7 @@ function Ol(r, t) {
     b(ct(r[e], 32), "invalid ${ param } hash", `value[${e}]`, r[e]);
   return r;
 }
-function Dl(r) {
+function Tl(r) {
   const t = hs(r);
   b(Array.isArray(t) && (t.length === 9 || t.length === 6), "invalid field count for legacy transaction", "data", r);
   const e = {
@@ -3370,7 +3370,7 @@ function Dl(r) {
     gasLimit: Y(t[2], "gasLimit"),
     to: ws(t[3]),
     value: Y(t[4], "value"),
-    data: D(t[5]),
+    data: T(t[5]),
     chainId: tt
   };
   if (t.length === 6)
@@ -3388,7 +3388,7 @@ function Dl(r) {
   }
   return e;
 }
-function Tl(r, t) {
+function Dl(r, t) {
   const e = [
     K(r.nonce, "nonce"),
     K(r.gasPrice || 0, "gasPrice"),
@@ -3422,7 +3422,7 @@ function Ai(r, t) {
 }
 function Fl(r) {
   const t = hs(j(r).slice(1));
-  b(Array.isArray(t) && (t.length === 9 || t.length === 12), "invalid field count for transaction type: 2", "data", D(r));
+  b(Array.isArray(t) && (t.length === 9 || t.length === 12), "invalid field count for transaction type: 2", "data", T(r));
   const e = {
     type: 2,
     chainId: Y(t[0], "chainId"),
@@ -3433,7 +3433,7 @@ function Fl(r) {
     gasLimit: Y(t[4], "gasLimit"),
     to: ws(t[5]),
     value: Y(t[6], "value"),
-    data: D(t[7]),
+    data: T(t[7]),
     accessList: gi(t[8], "accessList")
   };
   return t.length === 9 || Ai(e, t.slice(9)), e;
@@ -3454,7 +3454,7 @@ function Ll(r, t) {
 }
 function Ul(r) {
   const t = hs(j(r).slice(1));
-  b(Array.isArray(t) && (t.length === 8 || t.length === 11), "invalid field count for transaction type: 1", "data", D(r));
+  b(Array.isArray(t) && (t.length === 8 || t.length === 11), "invalid field count for transaction type: 1", "data", T(r));
   const e = {
     type: 1,
     chainId: Y(t[0], "chainId"),
@@ -3463,7 +3463,7 @@ function Ul(r) {
     gasLimit: Y(t[3], "gasLimit"),
     to: ws(t[4]),
     value: Y(t[5], "value"),
-    data: D(t[6]),
+    data: T(t[6]),
     accessList: gi(t[7], "accessList")
   };
   return t.length === 8 || Ai(e, t.slice(8)), e;
@@ -3495,7 +3495,7 @@ function Ql(r) {
       });
     t = t[0];
   }
-  b(Array.isArray(t) && (t.length === 11 || t.length === 14), `invalid field count for transaction type: ${e}`, "data", D(r));
+  b(Array.isArray(t) && (t.length === 11 || t.length === 14), `invalid field count for transaction type: ${e}`, "data", T(r));
   const s = {
     type: 3,
     chainId: Y(t[0], "chainId"),
@@ -3506,7 +3506,7 @@ function Ql(r) {
     gasLimit: Y(t[4], "gasLimit"),
     to: ws(t[5]),
     value: Y(t[6], "value"),
-    data: D(t[7]),
+    data: T(t[7]),
     accessList: gi(t[8], "accessList"),
     maxFeePerBlobGas: Y(t[9], "maxFeePerBlobGas"),
     blobVersionedHashes: t[10]
@@ -3540,7 +3540,7 @@ function Gl(r, t, e) {
     ])
   ]) : ut(["0x03", tn(n)]);
 }
-var Ht, Cn, Pn, In, Nn, kn, vn, Sn, Rn, On, Dn, Tn, Ve, Ae, Xt, we, Fn, Vr;
+var Ht, Cn, Pn, In, Nn, kn, vn, Sn, Rn, On, Tn, Dn, Ve, Ae, Xt, we, Fn, Vr;
 const Zt = class Zt {
   /**
    *  Creates a new Transaction with default values.
@@ -3557,13 +3557,13 @@ const Zt = class Zt {
     A(this, Sn);
     A(this, Rn);
     A(this, On);
-    A(this, Dn);
     A(this, Tn);
+    A(this, Dn);
     A(this, Ve);
     A(this, Ae);
     A(this, Xt);
     A(this, we);
-    h(this, Ht, null), h(this, Cn, null), h(this, In, 0), h(this, Nn, tt), h(this, kn, null), h(this, vn, null), h(this, Sn, null), h(this, Pn, "0x"), h(this, Rn, tt), h(this, On, tt), h(this, Dn, null), h(this, Tn, null), h(this, Ve, null), h(this, Ae, null), h(this, we, null), h(this, Xt, null);
+    h(this, Ht, null), h(this, Cn, null), h(this, In, 0), h(this, Nn, tt), h(this, kn, null), h(this, vn, null), h(this, Sn, null), h(this, Pn, "0x"), h(this, Rn, tt), h(this, On, tt), h(this, Tn, null), h(this, Dn, null), h(this, Ve, null), h(this, Ae, null), h(this, we, null), h(this, Xt, null);
   }
   /**
    *  The transaction type.
@@ -3690,7 +3690,7 @@ const Zt = class Zt {
     return l(this, Pn);
   }
   set data(t) {
-    h(this, Pn, D(t));
+    h(this, Pn, T(t));
   }
   /**
    *  The amount of ether (in wei) to send in this transactions.
@@ -3714,10 +3714,10 @@ const Zt = class Zt {
    *  If signed, the signature for this transaction.
    */
   get signature() {
-    return l(this, Dn) || null;
+    return l(this, Tn) || null;
   }
   set signature(t) {
-    h(this, Dn, t == null ? null : Lt.from(t));
+    h(this, Tn, t == null ? null : Lt.from(t));
   }
   /**
    *  The access list.
@@ -3726,11 +3726,11 @@ const Zt = class Zt {
    *  bytecode and state variable access within contract execution.
    */
   get accessList() {
-    const t = l(this, Tn) || null;
+    const t = l(this, Dn) || null;
     return t ?? (this.type === 1 || this.type === 2 || this.type === 3 ? [] : null);
   }
   set accessList(t) {
-    h(this, Tn, t == null ? null : ir(t));
+    h(this, Dn, t == null ? null : ir(t));
   }
   /**
    *  The max fee per blob gas for Cancun transactions.
@@ -3805,18 +3805,18 @@ const Zt = class Zt {
           const u = new Uint8Array(ks);
           u.set(o), o = u;
         }
-        const a = l(this, Xt).blobToKzgCommitment(o), c = D(l(this, Xt).computeBlobKzgProof(o, a));
+        const a = l(this, Xt).blobToKzgCommitment(o), c = T(l(this, Xt).computeBlobKzgProof(o, a));
         e.push({
-          data: D(o),
-          commitment: D(a),
+          data: T(o),
+          commitment: T(a),
           proof: c
         }), n.push(to(1, a));
       } else {
-        const o = D(i.commitment);
+        const o = T(i.commitment);
         e.push({
-          data: D(i.data),
+          data: T(i.data),
           commitment: o,
-          proof: D(i.proof)
+          proof: T(i.proof)
         }), n.push(to(1, o));
       }
     }
@@ -3977,7 +3977,7 @@ const Zt = class Zt {
     if (typeof t == "string") {
       const n = j(t);
       if (n[0] >= 127)
-        return Zt.from(Dl(n));
+        return Zt.from(Tl(n));
       switch (n[0]) {
         case 1:
           return Zt.from(Ul(n));
@@ -3992,12 +3992,12 @@ const Zt = class Zt {
     return t.type != null && (e.type = t.type), t.to != null && (e.to = t.to), t.nonce != null && (e.nonce = t.nonce), t.gasLimit != null && (e.gasLimit = t.gasLimit), t.gasPrice != null && (e.gasPrice = t.gasPrice), t.maxPriorityFeePerGas != null && (e.maxPriorityFeePerGas = t.maxPriorityFeePerGas), t.maxFeePerGas != null && (e.maxFeePerGas = t.maxFeePerGas), t.maxFeePerBlobGas != null && (e.maxFeePerBlobGas = t.maxFeePerBlobGas), t.data != null && (e.data = t.data), t.value != null && (e.value = t.value), t.chainId != null && (e.chainId = t.chainId), t.signature != null && (e.signature = Lt.from(t.signature)), t.accessList != null && (e.accessList = t.accessList), t.blobVersionedHashes != null && (e.blobVersionedHashes = t.blobVersionedHashes), t.kzg != null && (e.kzg = t.kzg), t.blobs != null && (e.blobs = t.blobs), t.hash != null && (b(e.isSigned(), "unsigned transaction cannot define '.hash'", "tx", t), b(e.hash === t.hash, "hash mismatch", "tx", t)), t.from != null && (b(e.isSigned(), "unsigned transaction cannot define '.from'", "tx", t), b(e.from.toLowerCase() === (t.from || "").toLowerCase(), "from mismatch", "tx", t)), e;
   }
 };
-Ht = new WeakMap(), Cn = new WeakMap(), Pn = new WeakMap(), In = new WeakMap(), Nn = new WeakMap(), kn = new WeakMap(), vn = new WeakMap(), Sn = new WeakMap(), Rn = new WeakMap(), On = new WeakMap(), Dn = new WeakMap(), Tn = new WeakMap(), Ve = new WeakMap(), Ae = new WeakMap(), Xt = new WeakMap(), we = new WeakMap(), Fn = new WeakSet(), Vr = function(t, e) {
+Ht = new WeakMap(), Cn = new WeakMap(), Pn = new WeakMap(), In = new WeakMap(), Nn = new WeakMap(), kn = new WeakMap(), vn = new WeakMap(), Sn = new WeakMap(), Rn = new WeakMap(), On = new WeakMap(), Tn = new WeakMap(), Dn = new WeakMap(), Ve = new WeakMap(), Ae = new WeakMap(), Xt = new WeakMap(), we = new WeakMap(), Fn = new WeakSet(), Vr = function(t, e) {
   S(!t || this.signature != null, "cannot serialize unsigned transaction; maybe you meant .unsignedSerialized", "UNSUPPORTED_OPERATION", { operation: ".serialized" });
   const n = t ? this.signature : null;
   switch (this.inferType()) {
     case 0:
-      return Tl(this, n);
+      return Dl(this, n);
     case 1:
       return Ml(this, n);
     case 2:
@@ -4013,7 +4013,7 @@ ia.fill(0);
 const Hl = BigInt(-1), oa = BigInt(0), aa = BigInt(1), Jl = BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
 function Vl(r) {
   const t = j(r), e = t.length % 32;
-  return e ? ut([t, ia.slice(e)]) : D(t);
+  return e ? ut([t, ia.slice(e)]) : T(t);
 }
 const zl = _n(aa, 32), Kl = _n(oa, 32), eo = {
   name: "string",
@@ -4049,7 +4049,7 @@ const jl = {
   },
   salt: function(r) {
     const t = j(r, "domain.salt");
-    return b(t.length === 32, 'invalid domain value "salt"', "domain.salt", r), D(t);
+    return b(t.length === 32, 'invalid domain value "salt"', "domain.salt", r), T(t);
   }
 };
 function Ss(r) {
@@ -4319,7 +4319,7 @@ const Et = class Et {
       primaryType: o.primaryType,
       message: o.visit(n, (c, u) => {
         if (c.match(/^bytes(\d*)/))
-          return D(j(u));
+          return T(j(u));
         if (c.match(/^u?int/))
           return R(u).toString();
         switch (c) {
@@ -4598,7 +4598,7 @@ const fn = class fn {
                 t.push({ type: "!metadata", value: w.bodyText });
               } catch {
                 const E = w.body;
-                return E && t.push({ type: "!metadata", value: D(E) }), { url: null, linkage: t };
+                return E && t.push({ type: "!metadata", value: T(E) }), { url: null, linkage: t };
               }
               return { url: null, linkage: t };
             }
@@ -4800,7 +4800,7 @@ const eu = Or({
   contractAddress: M(q, null),
   // should be allowNull(hash), but broken-EIP-658 support is handled in receipt
   index: J,
-  root: M(D),
+  root: M(T),
   gasUsed: R,
   blobGasUsed: M(R, null),
   logsBloom: M(sr),
@@ -4859,7 +4859,7 @@ function ha(r) {
   return t.blockHash && R(t.blockHash) === io && (t.blockHash = null), t;
 }
 const ru = "0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e";
-class Dr {
+class Tr {
   /**
    *  Creates a new **NetworkPlugin**.
    */
@@ -4877,10 +4877,10 @@ class Dr {
    *  Creates a copy of this plugin.
    */
   clone() {
-    return new Dr(this.name);
+    return new Tr(this.name);
   }
 }
-class ys extends Dr {
+class ys extends Tr {
   /**
    *  Creates a new GasCostPlugin from %%effectiveBlock%% until the
    *  latest block or another GasCostPlugin supercedes that block number,
@@ -4931,7 +4931,7 @@ class ys extends Dr {
     return new ys(this.effectiveBlock, this);
   }
 }
-class bs extends Dr {
+class bs extends Tr {
   /**
    *  Creates a new **EnsPlugin** connected to %%address%% on the
    *  %%targetNetwork%%. The default ENS address and mainnet is used
@@ -4957,7 +4957,7 @@ class bs extends Dr {
   }
 }
 var Ir, Nr;
-class su extends Dr {
+class su extends Tr {
   /**
    *  Creates a new **FetchUrlFeeDataNetworkPlugin** which will
    *  be used when computing the fee data for the network.
@@ -5451,7 +5451,7 @@ function fu(r) {
 function Ws(r) {
   return r = Array.from(new Set(r).values()), r.sort(), r;
 }
-async function Ds(r, t) {
+async function Ts(r, t) {
   if (r == null)
     throw new Error("invalid event");
   if (Array.isArray(r) && (r = { topics: r }), typeof r == "string")
@@ -5489,7 +5489,7 @@ async function Ds(r, t) {
   }
   b(!1, "unknown ProviderEvent", "event", r);
 }
-function Ts() {
+function Ds() {
   return (/* @__PURE__ */ new Date()).getTime();
 }
 const du = {
@@ -5632,7 +5632,7 @@ class gu {
    *  alternate sub-class of [[TransactionResponse]].
    */
   _wrapTransactionResponse(t, e) {
-    return new Da(ha(t), this);
+    return new Ta(ha(t), this);
   }
   /**
    *  Resolves to the Network, forcing a network detection using whatever
@@ -5823,11 +5823,11 @@ class gu {
     return J(await I(this, L, hr).call(this, { method: "getTransactionCount" }, t, e), "%response");
   }
   async getCode(t, e) {
-    return D(await I(this, L, hr).call(this, { method: "getCode" }, t, e));
+    return T(await I(this, L, hr).call(this, { method: "getCode" }, t, e));
   }
   async getStorage(t, e, n) {
     const s = R(e, "position");
-    return D(await I(this, L, hr).call(this, { method: "getStorage", position: s }, t, n));
+    return T(await I(this, L, hr).call(this, { method: "getStorage", position: s }, t, n));
   }
   // Write
   async broadcastTransaction(t) {
@@ -5878,7 +5878,7 @@ class gu {
       network: this.getNetwork(),
       result: I(this, L, pt).call(this, { method: "getTransactionResult", hash: t })
     });
-    return e == null ? null : D(e);
+    return e == null ? null : T(e);
   }
   // Bloom-filter Queries
   async getLogs(t) {
@@ -5970,14 +5970,14 @@ class gu {
    */
   _setTimeout(t, e) {
     e == null && (e = 0);
-    const n = Tr(this, kr)._++, s = () => {
+    const n = Dr(this, kr)._++, s = () => {
       l(this, Pt).delete(n), t();
     };
     if (this.paused)
       l(this, Pt).set(n, { timer: null, func: s, time: e });
     else {
       const i = setTimeout(s, e);
-      l(this, Pt).set(n, { timer: i, func: s, time: Ts() });
+      l(this, Pt).set(n, { timer: i, func: s, time: Ds() });
     }
     return n;
   }
@@ -6044,7 +6044,7 @@ class gu {
       return !1;
     const s = n.listeners.length;
     return n.listeners = n.listeners.filter(({ listener: i, once: o }) => {
-      const a = new Ta(this, o ? null : i, t);
+      const a = new Da(this, o ? null : i, t);
       try {
         i.call(this, ...e, a);
       } catch {
@@ -6153,7 +6153,7 @@ class gu {
     }
     this._forEachSubscriber((e) => e.pause(t)), h(this, ot, !!t);
     for (const e of l(this, Pt).values())
-      e.timer && clearTimeout(e.timer), e.time = Ts() - e.time;
+      e.timer && clearTimeout(e.timer), e.time = Ds() - e.time;
   }
   /**
    *  Resume the provider.
@@ -6163,7 +6163,7 @@ class gu {
       this._forEachSubscriber((t) => t.resume()), h(this, ot, null);
       for (const t of l(this, Pt).values()) {
         let e = t.time;
-        e < 0 && (e = 0), t.time = Ts(), setTimeout(t.func, e);
+        e < 0 && (e = 0), t.time = Ds(), setTimeout(t.func, e);
       }
     }
   }
@@ -6184,7 +6184,7 @@ it = new WeakMap(), Ce = new WeakMap(), ot = new WeakMap(), zn = new WeakMap(),
   });
   const s = Us(t);
   try {
-    return D(await this._perform({ method: "call", transaction: s, blockTag: e }));
+    return T(await this._perform({ method: "call", transaction: s, blockTag: e }));
   } catch (i) {
     if (!this.disableCcipRead && Ia(i) && i.data && n >= 0 && e === "latest" && s.to != null && at(i.data, 0, 4) === "0x556f1830") {
       const o = i.data, a = await Kt(s.to, this);
@@ -6253,10 +6253,10 @@ it = new WeakMap(), Ce = new WeakMap(), ot = new WeakMap(), zn = new WeakMap(),
     includeTransactions: e
   });
 }, fr = async function(t, e) {
-  let n = await Ds(t, this);
-  return n.type === "event" && e && e.length > 0 && e[0].removed === !0 && (n = await Ds({ orphan: "drop-log", log: e[0] }, this)), l(this, it).get(n.tag) || null;
+  let n = await Ts(t, this);
+  return n.type === "event" && e && e.length > 0 && e[0].removed === !0 && (n = await Ts({ orphan: "drop-log", log: e[0] }, this)), l(this, it).get(n.tag) || null;
 }, jr = async function(t) {
-  const e = await Ds(t, this), n = e.tag;
+  const e = await Ts(t, this), n = e.tag;
   let s = l(this, it).get(n);
   return s || (s = { subscriber: this._getSubscriber(e), tag: n, addressableMap: /* @__PURE__ */ new WeakMap(), nameMap: /* @__PURE__ */ new Map(), started: !1, listeners: [] }, l(this, it).set(n, s)), s;
 };
@@ -6709,7 +6709,7 @@ class Fs extends ga {
   async signMessage(e) {
     const n = typeof e == "string" ? _e(e) : e;
     return await this.provider.send("personal_sign", [
-      D(n),
+      T(n),
       this.address.toLowerCase()
     ]);
   }
@@ -6735,11 +6735,11 @@ class Fs extends ga {
     const n = typeof e == "string" ? _e(e) : e;
     return await this.provider.send("eth_sign", [
       this.address.toLowerCase(),
-      D(n)
+      T(n)
     ]);
   }
 }
-var Xe, qn, re, zt, Tt, It, ht, vr, ri;
+var Xe, qn, re, zt, Dt, It, ht, vr, ri;
 class Pu extends gu {
   constructor(e, n) {
     super(e, n);
@@ -6750,7 +6750,7 @@ class Pu extends gu {
     // Payloads are queued and triggered in batches using the drainTimer
     A(this, re);
     A(this, zt);
-    A(this, Tt);
+    A(this, Dt);
     A(this, It);
     A(this, ht);
     h(this, qn, 1), h(this, Xe, Object.assign({}, Aa, n || {})), h(this, re, []), h(this, zt, null), h(this, It, null), h(this, ht, null);
@@ -6759,7 +6759,7 @@ class Pu extends gu {
       const o = new Promise((a) => {
         i = a;
       });
-      h(this, Tt, { promise: o, resolve: i });
+      h(this, Dt, { promise: o, resolve: i });
     }
     const s = this._getOption("staticNetwork");
     typeof s == "boolean" ? (b(!s || e !== "any", "staticNetwork cannot be used on special network 'any'", "options", n), s && e != null && h(this, It, jt.from(e))) : s && (b(e == null || s.matches(e), "staticNetwork MUST match network object", "options", n), h(this, It, s));
@@ -6822,7 +6822,7 @@ class Pu extends gu {
       }
     })()), await l(this, ht)) : (h(this, ht, (async () => {
       const n = {
-        id: Tr(this, qn)._++,
+        id: Dr(this, qn)._++,
         method: "eth_chainId",
         params: [],
         jsonrpc: "2.0"
@@ -6847,7 +6847,7 @@ class Pu extends gu {
    *  Calling it multiple times is safe and has no effect.
    */
   _start() {
-    l(this, Tt) == null || l(this, Tt).resolve == null || (l(this, Tt).resolve(), h(this, Tt, null), (async () => {
+    l(this, Dt) == null || l(this, Dt).resolve == null || (l(this, Dt).resolve(), h(this, Dt, null), (async () => {
       for (; l(this, It) == null && !this.destroyed; )
         try {
           h(this, It, await this._detectNetwork());
@@ -6865,8 +6865,8 @@ class Pu extends gu {
    *  established.
    */
   async _waitUntilReady() {
-    if (l(this, Tt) != null)
-      return await l(this, Tt).promise;
+    if (l(this, Dt) != null)
+      return await l(this, Dt).promise;
   }
   /**
    *  Return a Subscriber that will manage the %%sub%%.
@@ -6881,7 +6881,7 @@ class Pu extends gu {
    *  Returns true only if the [[_start]] has been called.
    */
   get ready() {
-    return l(this, Tt) == null;
+    return l(this, Dt) == null;
   }
   /**
    *  Returns %%tx%% as a normalized JSON-RPC transaction request,
@@ -6896,7 +6896,7 @@ class Pu extends gu {
       let i = s;
       s === "gasLimit" && (i = "gas"), n[i] = hn(R(e[s], `tx.${s}`));
     }), ["from", "to", "data"].forEach((s) => {
-      e[s] != null && (n[s] = D(e[s]));
+      e[s] != null && (n[s] = T(e[s]));
     }), e.accessList && (n.accessList = ir(e.accessList)), e.blobVersionedHashes && (n.blobVersionedHashes = e.blobVersionedHashes.map((s) => s.toLowerCase())), n;
   }
   /**
@@ -7053,7 +7053,7 @@ class Pu extends gu {
   send(e, n) {
     if (this.destroyed)
       return Promise.reject(rt("provider destroyed; cancelled request", "UNSUPPORTED_OPERATION", { operation: e }));
-    const s = Tr(this, qn)._++, i = new Promise((o, a) => {
+    const s = Dr(this, qn)._++, i = new Promise((o, a) => {
       l(this, re).push({
         resolve: o,
         reject: a,
@@ -7103,7 +7103,7 @@ class Pu extends gu {
     h(this, re, []), super.destroy();
   }
 }
-Xe = new WeakMap(), qn = new WeakMap(), re = new WeakMap(), zt = new WeakMap(), Tt = new WeakMap(), It = new WeakMap(), ht = new WeakMap(), vr = new WeakSet(), ri = function() {
+Xe = new WeakMap(), qn = new WeakMap(), re = new WeakMap(), zt = new WeakMap(), Dt = new WeakMap(), It = new WeakMap(), ht = new WeakMap(), vr = new WeakSet(), ri = function() {
   if (l(this, zt))
     return;
   const e = this._getOption("batchMaxCount") === 1 ? 0 : this._getOption("batchStallTime");
@@ -7256,7 +7256,7 @@ export {
   Ma as h,
   Gc as i,
   Iu as j,
-  Du as p,
-  Tu as r,
+  Tu as p,
+  Du as r,
   ds as s
 };