@nexus-cross/crossx-sdk-core 1.3.2 → 1.3.4

package/dist/index.js

@@ -371,15 +371,15 @@ class qs {
       c === "google" ? l = "/google" : c === "apple" && (l = "/apple");
       const { oauthServiceUrl: u, authApiUrl: h } = this.config, g = `${u}${l}`;
       d.log(`[CROSSx] OAuth 팝업 열기 (${c || "일반"} 로그인)`);
-      const _ = await this.oauth.openAuth({
+      const f = await this.oauth.openAuth({
         authUrl: g,
         expectedOrigin: new URL(u).origin
       });
-      d.log("[CROSSx] OAuth Firebase 토큰 받음 (length:", _.length, ")");
-      const { accessToken: w, refreshToken: v } = await this.exchangeFirebaseToken(_, h);
+      d.log("[CROSSx] OAuth Firebase 토큰 받음 (length:", f.length, ")");
+      const { accessToken: w, refreshToken: v } = await this.exchangeFirebaseToken(f, h);
       let y, S;
       try {
-        const U = this.crypto.decodeJWT(_);
+        const U = this.crypto.decodeJWT(f);
         S = (n = U.firebase) == null ? void 0 : n.sign_in_provider;
         const N = ((o = U.firebase) == null ? void 0 : o.identities) ?? {};
         S === "google.com" ? y = (i = N["google.com"]) == null ? void 0 : i[0] : S === "apple.com" && (y = (a = N["apple.com"]) == null ? void 0 : a[0]), d.log("[CROSSx] OAuth provider sub 추출 — provider:", S, "hasProviderSub:", !!y);
@@ -400,7 +400,7 @@ class qs {
           providerSub: y
         }, this.tokenStore.set(w), this.useCookieAuth || (await this.storage.set(this.STORAGE_KEY_ACCESS_TOKEN, w), v && this.config.secureStorageAvailable !== !1 ? await this.storage.set(this.STORAGE_KEY_REFRESH_TOKEN, v) : v && d.warn("[CROSSx] 안전한 스토리지 미사용 — refresh_token 영속 저장을 건너뜁니다"));
       } else {
-        const U = this.crypto.decodeJWT(_);
+        const U = this.crypto.decodeJWT(f);
         s = {
           id: U.sub,
           email: U.email,
@@ -860,7 +860,7 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
   }
   async _doInitialize(e) {
     var s, t;
-    d.log("[CROSSx SDK] v1.3.2 초기화 중..."), this.confirmation.setMessages(St(this._config.locale));
+    d.log("[CROSSx SDK] v1.3.4 초기화 중..."), this.confirmation.setMessages(St(this._config.locale));
     try {
       const n = Js();
       this.internalConfig.oauthServiceUrl = n.oauthServiceUrl, this.internalConfig.authApiUrl = n.authApiUrl, this.internalConfig.walletGatewayUrl = n.walletGatewayUrl, this.adapterConfig.gatewayUrl = n.walletGatewayUrl, (t = (s = this.crypto).setJWKSEndpoint) == null || t.call(s, `${n.authApiUrl}/.well-known/jwks.json`);
@@ -1605,7 +1605,7 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
   async sendTransactionWithWaitForReceipt(e, s, t = {}) {
     var v, y;
     const { intervalMs: n, timeoutMs: o, ...i } = t, { txHash: a } = await this.sendTransaction(e, s, i), c = n ?? ((v = this._config.receiptPolling) == null ? void 0 : v.intervalMs) ?? Xs, l = o ?? ((y = this._config.receiptPolling) == null ? void 0 : y.timeoutMs) ?? Tt, u = Je(e), h = s.from ?? "";
-    let g, _;
+    let g, f;
     const w = this.waitForTxAndGetReceipt(a, e, { intervalMs: c, timeoutMs: l }).then((S) => {
       g = S;
       const C = BigInt(S.gasUsed) * BigInt(S.effectiveGasPrice), U = s.value ? BigInt(s.value) : 0n, N = re.formatTxAmount(s.value, u.symbol, u.decimals), V = re.formatTxAmount("0x" + C.toString(16), u.symbol, u.decimals), W = re.formatTxAmount("0x" + (U + C).toString(16), u.symbol, u.decimals);
@@ -1620,7 +1620,7 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
         nativeSymbol: u.symbol,
         status: S.status === "0x1" ? "success" : "reverted"
       };
-    }).catch((S) => (_ = S instanceof Error ? S : new Error(String(S)), {
+    }).catch((S) => (f = S instanceof Error ? S : new Error(String(S)), {
       chainId: e,
       txHash: a,
       from: h,
@@ -1632,7 +1632,7 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
     if (await this.confirmation.showTransactionProgress(
       { chainId: e, txHash: a, from: h, to: s.to },
       w
-    ), _) throw _;
+    ), f) throw f;
     return { chainId: e, txHash: a, receipt: g };
   }
   // ============================================================================
@@ -1917,19 +1917,19 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
           d.log("[CROSSx][Migration Phase 4] PIN 검증 성공"), a = h;
           break;
         }
-        const _ = g.pinStatus;
-        if (i = _.maxAttempts, o = i - _.remainingAttempts, _.remainingAttempts === 0 && _.lockExpiresAt) {
-          const w = _.lockExpiresAt * 1e3, v = Math.max(1, Math.round((w - Date.now()) / 1e3)), y = v <= 1800 ? "Too many failed attempts. Please try again in 30 minutes." : "Too many failed attempts. Please try again in 24 hours.";
+        const f = g.pinStatus;
+        if (i = f.maxAttempts, o = i - f.remainingAttempts, f.remainingAttempts === 0 && f.lockExpiresAt) {
+          const w = f.lockExpiresAt * 1e3, v = Math.max(1, Math.round((w - Date.now()) / 1e3)), y = v <= 1800 ? "Too many failed attempts. Please try again in 30 minutes." : "Too many failed attempts. Please try again in 24 hours.";
           d.warn(`[CROSSx][Migration Phase 4] verify-recovery-pin 잠금 — ${v}초, 메시지: ${y}`), await this.confirmation.showRecoveryPinLockedPrompt(v, y), o = 0, n = "Your account lock has been lifted. You may try again.";
         } else
           d.warn(`[CROSSx][Migration Phase 4] PIN 불일치 (시도 ${o}/${i})`), n = "Incorrect PIN.";
       } catch (g) {
         if (!(g instanceof m)) throw g;
         if (g.code === p.MIGRATION_PIN_LOCKED) {
-          const _ = g.details;
-          if (i = (_ == null ? void 0 : _.maxAttempts) ?? 5, (_ == null ? void 0 : _.permanent) === !0)
+          const f = g.details;
+          if (i = (f == null ? void 0 : f.maxAttempts) ?? 5, (f == null ? void 0 : f.permanent) === !0)
             return d.warn("[CROSSx][Migration Phase 4] PIN 영구 잠금 (verify-recovery-pin)"), await this.confirmation.showRecoveryPinLockedPrompt(0, "Your account has been permanently locked due to too many failed attempts."), null;
-          const w = ((_ == null ? void 0 : _.lockExpiresAt) ?? 0) * 1e3, v = Math.max(1, Math.round((w - Date.now()) / 1e3)), y = v <= 1800 ? "Too many failed attempts. Please try again in 30 minutes." : "Too many failed attempts. Please try again in 24 hours.";
+          const w = ((f == null ? void 0 : f.lockExpiresAt) ?? 0) * 1e3, v = Math.max(1, Math.round((w - Date.now()) / 1e3)), y = v <= 1800 ? "Too many failed attempts. Please try again in 30 minutes." : "Too many failed attempts. Please try again in 24 hours.";
           d.warn(`[CROSSx][Migration Phase 4] verify-recovery-pin 이미 잠금 — ${v}초`), await this.confirmation.showRecoveryPinLockedPrompt(v, y), o = 0, n = "Your account lock has been lifted. You may try again.";
         } else
           throw d.error("[CROSSx][Migration Phase 4] verify-recovery-pin 실패 (복구 불가):", g), g;
@@ -1959,23 +1959,20 @@ const Xs = 2e3, Tt = 6e4, Zs = 1e3, Qs = 1e4, er = "0x77359400", Rt = "0x3B9ACA0
    * jsonRpc 서비스를 통해 nonce 및 가스 파라미터를 자동 조회합니다.
    */
   async withResolvedGasAndFee(e, s) {
-    const t = (l) => !(l != null && l.trim()), n = e.nonce === void 0 || e.nonce === null, o = t(e.gasLimit), i = t(e.gasPrice) && t(e.maxFeePerGas), a = !t(e.maxFeePerGas) && t(e.maxPriorityFeePerGas);
+    const t = (f) => !(f != null && f.trim()), n = e.nonce === void 0 || e.nonce === null, o = t(e.gasLimit), i = t(e.gasPrice) && t(e.maxFeePerGas), a = !t(e.maxFeePerGas) && t(e.maxPriorityFeePerGas);
     if (!n && !o && !i && !a) return e;
-    const c = { ...e };
-    if (n) {
-      const l = c.from ?? this.address;
-      if (l) {
-        d.log("[CROSSx] nonce 비어있음 → eth_getTransactionCount 호출 (from:", l, ")");
-        const u = await this.jsonRpc.call("eth_getTransactionCount", [l, "pending"], s);
-        c.nonce = parseInt(u ?? "0x0", 16), d.log("[CROSSx] nonce 결과:", c.nonce);
-      }
-    }
-    if (o && (d.log("[CROSSx] gasLimit 비어있음 → eth_estimateGas 호출"), c.gasLimit = await this.estimateGas(e, s), d.log("[CROSSx] estimateGas 결과:", c.gasLimit)), i) {
-      d.log("[CROSSx] gasPrice & maxFeePerGas 비어있음 → baseFee 조회로 Dynamic/Legacy 판별");
-      const l = await this.getBaseFeePerGas(s);
-      if (l) {
-        const u = Rt;
-        c.maxFeePerGas = "0x" + (BigInt(l) + BigInt(u)).toString(16), c.maxPriorityFeePerGas = u, d.log("[CROSSx] Dynamic 체인 감지 — baseFee:", l, "maxFeePerGas:", c.maxFeePerGas, "maxPriorityFeePerGas: 1 Gwei");
+    const c = { ...e }, l = n ? c.from ?? this.address : void 0;
+    l && d.log("[CROSSx] nonce 비어있음 → eth_getTransactionCount 호출 (from:", l, ")"), o && d.log("[CROSSx] gasLimit 비어있음 → eth_estimateGas 호출"), i && d.log("[CROSSx] gasPrice & maxFeePerGas 비어있음 → baseFee 조회로 Dynamic/Legacy 판별");
+    const [u, h, g] = await Promise.all([
+      l ? this.jsonRpc.call("eth_getTransactionCount", [l, "pending"], s) : null,
+      o ? this.estimateGas(e, s) : null,
+      i ? this.getBaseFeePerGas(s) : null
+    ]);
+    if (l && (c.nonce = parseInt(u ?? "0x0", 16), d.log("[CROSSx] nonce 결과:", c.nonce)), o && (c.gasLimit = h, d.log("[CROSSx] estimateGas 결과:", c.gasLimit)), i) {
+      const f = g;
+      if (f) {
+        const w = Rt;
+        c.maxFeePerGas = "0x" + (BigInt(f) + BigInt(w)).toString(16), c.maxPriorityFeePerGas = w, d.log("[CROSSx] Dynamic 체인 감지 — baseFee:", f, "maxFeePerGas:", c.maxFeePerGas, "maxPriorityFeePerGas: 1 Gwei");
       } else
         c.gasPrice = er, d.log("[CROSSx] Legacy 체인 감지 — gasPrice: 2 Gwei");
     }
@@ -2798,13 +2795,13 @@ class vr extends fr {
     for (let h = 0; h < 16; h++, s += 4)
       we[h] = e.getUint32(s, !1);
     for (let h = 16; h < 64; h++) {
-      const g = we[h - 15], _ = we[h - 2], w = ue(g, 7) ^ ue(g, 18) ^ g >>> 3, v = ue(_, 17) ^ ue(_, 19) ^ _ >>> 10;
+      const g = we[h - 15], f = we[h - 2], w = ue(g, 7) ^ ue(g, 18) ^ g >>> 3, v = ue(f, 17) ^ ue(f, 19) ^ f >>> 10;
       we[h] = v + we[h - 7] + w + we[h - 16] | 0;
     }
     let { A: t, B: n, C: o, D: i, E: a, F: c, G: l, H: u } = this;
     for (let h = 0; h < 64; h++) {
-      const g = ue(a, 6) ^ ue(a, 11) ^ ue(a, 25), _ = u + g + hr(a, c, l) + br[h] + we[h] | 0, v = (ue(t, 2) ^ ue(t, 13) ^ ue(t, 22)) + pr(t, n, o) | 0;
-      u = l, l = c, c = a, a = i + _ | 0, i = o, o = n, n = t, t = _ + v | 0;
+      const g = ue(a, 6) ^ ue(a, 11) ^ ue(a, 25), f = u + g + hr(a, c, l) + br[h] + we[h] | 0, v = (ue(t, 2) ^ ue(t, 13) ^ ue(t, 22)) + pr(t, n, o) | 0;
+      u = l, l = c, c = a, a = i + f | 0, i = o, o = n, n = t, t = f + v | 0;
     }
     t = t + this.A | 0, n = n + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, u = u + this.H | 0, this.set(t, n, o, i, a, c, l, u);
   }
@@ -2901,7 +2898,7 @@ function kr(r, e, s) {
   let c = t(r), l = t(r), u = 0;
   const h = () => {
     c.fill(1), l.fill(0), u = 0;
-  }, g = (...y) => s(l, ve(c, ...y)), _ = (y = n) => {
+  }, g = (...y) => s(l, ve(c, ...y)), f = (y = n) => {
     l = g(o, y), c = g(), y.length !== 0 && (l = g(i, y), c = g());
   }, w = () => {
     if (u++ >= a)
@@ -2916,10 +2913,10 @@ function kr(r, e, s) {
     return ve(...S);
   };
   return (y, S) => {
-    h(), _(y);
+    h(), f(y);
     let C;
     for (; !(C = S(w())); )
-      _();
+      f();
     return h(), C;
   };
 }
@@ -2989,8 +2986,8 @@ function Cr(r) {
   const e = je(r), s = xs(r), t = s(e, e.neg(e.ONE)), n = s(e, t), o = s(e, e.neg(t)), i = (r + Pr) / fs;
   return (a, c) => {
     let l = a.pow(c, i), u = a.mul(l, t);
-    const h = a.mul(l, n), g = a.mul(l, o), _ = a.eql(a.sqr(u), c), w = a.eql(a.sqr(h), c);
-    l = a.cmov(l, u, _), u = a.cmov(g, h, w);
+    const h = a.mul(l, n), g = a.mul(l, o), f = a.eql(a.sqr(u), c), w = a.eql(a.sqr(h), c);
+    l = a.cmov(l, u, f), u = a.cmov(g, h, w);
     const v = a.eql(a.sqr(u), c), y = a.cmov(l, u, v);
     return xt(a, y, c), y;
   };
@@ -3015,7 +3012,7 @@ function xs(r) {
       return l;
     if (Bt(c, l) !== 1)
       throw new Error("Cannot find square root");
-    let u = s, h = c.mul(c.ONE, o), g = c.pow(l, e), _ = c.pow(l, i);
+    let u = s, h = c.mul(c.ONE, o), g = c.pow(l, e), f = c.pow(l, i);
     for (; !c.eql(g, c.ONE); ) {
       if (c.is0(g))
         return c.ZERO;
@@ -3024,9 +3021,9 @@ function xs(r) {
         if (w++, v = c.sqr(v), w === u)
           throw new Error("Cannot find square root");
       const y = ee << BigInt(u - w - 1), S = c.pow(h, y);
-      u = w, h = c.sqr(S), g = c.mul(g, h), _ = c.mul(_, S);
+      u = w, h = c.sqr(S), g = c.mul(g, h), f = c.mul(f, S);
     }
-    return _;
+    return f;
   };
 }
 function Lr(r) {
@@ -3242,8 +3239,8 @@ function Ht(r, e, s) {
   const { windowSize: t, mask: n, maxNumber: o, shiftBy: i } = s;
   let a = Number(r & n), c = r >> i;
   a > t && (a -= o, c += Ae);
-  const l = e * t, u = l + Math.abs(a) - 1, h = a === 0, g = a < 0, _ = e % 2 !== 0;
-  return { nextN: c, offset: u, isZero: h, isNeg: g, isNegF: _, offsetF: l };
+  const l = e * t, u = l + Math.abs(a) - 1, h = a === 0, g = a < 0, f = e % 2 !== 0;
+  return { nextN: c, offset: u, isZero: h, isNeg: g, isNegF: f, offsetF: l };
 }
 const et = /* @__PURE__ */ new WeakMap(), bs = /* @__PURE__ */ new WeakMap();
 function tt(r) {
@@ -3304,8 +3301,8 @@ class Fr {
     let n = this.ZERO, o = this.BASE;
     const i = Qe(e, this.bits);
     for (let a = 0; a < i.windows; a++) {
-      const { nextN: c, offset: l, isZero: u, isNeg: h, isNegF: g, offsetF: _ } = Ht(t, a, i);
-      t = c, u ? o = o.add(Ke(g, s[_])) : n = n.add(Ke(h, s[l]));
+      const { nextN: c, offset: l, isZero: u, isNeg: h, isNegF: g, offsetF: f } = Ht(t, a, i);
+      t = c, u ? o = o.add(Ke(g, s[f])) : n = n.add(Ke(h, s[l]));
     }
     return Ft(t), { p: n, f: o };
   }
@@ -3432,8 +3429,8 @@ function Kr(r, e, s) {
   let l = r - a * t - c * o, u = -a * n - c * i;
   const h = l < _e, g = u < _e;
   h && (l = -l), g && (u = -u);
-  const _ = ft(Math.ceil(Rr(s) / 2)) + Re;
-  if (l < _e || l >= _ || u < _e || u >= _)
+  const f = ft(Math.ceil(Rr(s) / 2)) + Re;
+  if (l < _e || l >= f || u < _e || u >= f)
     throw new Error("splitScalar (endomorphism): failed, k=" + r);
   return { k1neg: h, k1: l, k2neg: g, k2: u };
 }
@@ -3561,8 +3558,8 @@ function jr(r, e = {}) {
     if (!t.isOdd)
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
-  function h(A, f, x) {
-    const { x: b, y: E } = f.toAffine(), M = t.toBytes(b);
+  function h(A, _, x) {
+    const { x: b, y: E } = _.toAffine(), M = t.toBytes(b);
     if (qe(x, "isCompressed"), x) {
       u();
       const O = !t.isOdd(E);
@@ -3572,8 +3569,8 @@ function jr(r, e = {}) {
   }
   function g(A) {
     z(A, void 0, "Point");
-    const { publicKey: f, publicKeyUncompressed: x } = l, b = A.length, E = A[0], M = A.subarray(1);
-    if (b === f && (E === 2 || E === 3)) {
+    const { publicKey: _, publicKeyUncompressed: x } = l, b = A.length, E = A[0], M = A.subarray(1);
+    if (b === _ && (E === 2 || E === 3)) {
       const O = t.fromBytes(M);
       if (!t.isValid(O))
         throw new Error("bad point: is not on curve, wrong x");
@@ -3594,15 +3591,15 @@ function jr(r, e = {}) {
         throw new Error("bad point: is not on curve");
       return { x: $, y: T };
     } else
-      throw new Error(`bad point: got length ${b}, expected compressed=${f} or uncompressed=${x}`);
+      throw new Error(`bad point: got length ${b}, expected compressed=${_} or uncompressed=${x}`);
   }
-  const _ = e.toBytes || h, w = e.fromBytes || g;
+  const f = e.toBytes || h, w = e.fromBytes || g;
   function v(A) {
-    const f = t.sqr(A), x = t.mul(f, A);
+    const _ = t.sqr(A), x = t.mul(_, A);
     return t.add(t.add(x, t.mul(A, o.a)), o.b);
   }
-  function y(A, f) {
-    const x = t.sqr(f), b = v(A);
+  function y(A, _) {
+    const x = t.sqr(_), b = v(A);
     return t.eql(x, b);
   }
   if (!y(o.Gx, o.Gy))
@@ -3610,10 +3607,10 @@ function jr(r, e = {}) {
   const S = t.mul(t.pow(o.a, He), zr), C = t.mul(t.sqr(o.b), BigInt(27));
   if (t.is0(t.add(S, C)))
     throw new Error("bad curve params: a or b");
-  function U(A, f, x = !1) {
-    if (!t.isValid(f) || x && t.is0(f))
+  function U(A, _, x = !1) {
+    if (!t.isValid(_) || x && t.is0(_))
       throw new Error(`bad point coordinate ${A}`);
-    return f;
+    return _;
   }
   function N(A) {
     if (!(A instanceof D))
@@ -3624,13 +3621,13 @@ function jr(r, e = {}) {
       throw new Error("no endo");
     return Kr(A, c.basises, n.ORDER);
   }
-  const W = Mt((A, f) => {
+  const W = Mt((A, _) => {
     const { X: x, Y: b, Z: E } = A;
     if (t.eql(E, t.ONE))
       return { x, y: b };
     const M = A.is0();
-    f == null && (f = M ? t.ONE : t.inv(E));
-    const O = t.mul(x, f), $ = t.mul(b, f), T = t.mul(E, f);
+    _ == null && (_ = M ? t.ONE : t.inv(E));
+    const O = t.mul(x, _), $ = t.mul(b, _), T = t.mul(E, _);
     if (M)
       return { x: t.ZERO, y: t.ZERO };
     if (!t.eql(T, t.ONE))
@@ -3642,44 +3639,44 @@ function jr(r, e = {}) {
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: f, y: x } = A.toAffine();
-    if (!t.isValid(f) || !t.isValid(x))
+    const { x: _, y: x } = A.toAffine();
+    if (!t.isValid(_) || !t.isValid(x))
       throw new Error("bad point: x or y not field elements");
-    if (!y(f, x))
+    if (!y(_, x))
       throw new Error("bad point: equation left != right");
     if (!A.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function k(A, f, x, b, E) {
-    return x = new D(t.mul(x.X, A), x.Y, x.Z), f = Ke(b, f), x = Ke(E, x), f.add(x);
+  function k(A, _, x, b, E) {
+    return x = new D(t.mul(x.X, A), x.Y, x.Z), _ = Ke(b, _), x = Ke(E, x), _.add(x);
   }
   const R = class R {
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(f, x, b) {
+    constructor(_, x, b) {
       I(this, "X");
       I(this, "Y");
       I(this, "Z");
-      this.X = U("x", f), this.Y = U("y", x, !0), this.Z = U("z", b), Object.freeze(this);
+      this.X = U("x", _), this.Y = U("y", x, !0), this.Z = U("z", b), Object.freeze(this);
     }
     static CURVE() {
       return o;
     }
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    static fromAffine(f) {
-      const { x, y: b } = f || {};
-      if (!f || !t.isValid(x) || !t.isValid(b))
+    static fromAffine(_) {
+      const { x, y: b } = _ || {};
+      if (!_ || !t.isValid(x) || !t.isValid(b))
         throw new Error("invalid affine point");
-      if (f instanceof R)
+      if (_ instanceof R)
         throw new Error("projective point not allowed");
       return t.is0(x) && t.is0(b) ? R.ZERO : new R(x, b, t.ONE);
     }
-    static fromBytes(f) {
-      const x = R.fromAffine(w(z(f, void 0, "point")));
+    static fromBytes(_) {
+      const x = R.fromAffine(w(z(_, void 0, "point")));
       return x.assertValidity(), x;
     }
-    static fromHex(f) {
-      return R.fromBytes(We(f));
+    static fromHex(_) {
+      return R.fromBytes(We(_));
     }
     get x() {
       return this.toAffine().x;
@@ -3693,8 +3690,8 @@ function jr(r, e = {}) {
      * @param isLazy true will defer table computation until the first multiplication
      * @returns
      */
-    precompute(f = 8, x = !0) {
-      return L.createCache(this, f), x || this.multiply(He), this;
+    precompute(_ = 8, x = !0) {
+      return L.createCache(this, _), x || this.multiply(He), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -3702,15 +3699,15 @@ function jr(r, e = {}) {
       P(this);
     }
     hasEvenY() {
-      const { y: f } = this.toAffine();
+      const { y: _ } = this.toAffine();
       if (!t.isOdd)
         throw new Error("Field doesn't support isOdd");
-      return !t.isOdd(f);
+      return !t.isOdd(_);
     }
     /** Compare one point to another. */
-    equals(f) {
-      N(f);
-      const { X: x, Y: b, Z: E } = this, { X: M, Y: O, Z: $ } = f, T = t.eql(t.mul(x, $), t.mul(M, E)), B = t.eql(t.mul(b, $), t.mul(O, E));
+    equals(_) {
+      N(_);
+      const { X: x, Y: b, Z: E } = this, { X: M, Y: O, Z: $ } = _, T = t.eql(t.mul(x, $), t.mul(M, E)), B = t.eql(t.mul(b, $), t.mul(O, E));
       return T && B;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -3722,17 +3719,17 @@ function jr(r, e = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: f, b: x } = o, b = t.mul(x, He), { X: E, Y: M, Z: O } = this;
+      const { a: _, b: x } = o, b = t.mul(x, He), { X: E, Y: M, Z: O } = this;
       let $ = t.ZERO, T = t.ZERO, B = t.ZERO, G = t.mul(E, E), J = t.mul(M, M), K = t.mul(O, O), F = t.mul(E, M);
-      return F = t.add(F, F), B = t.mul(E, O), B = t.add(B, B), $ = t.mul(f, B), T = t.mul(b, K), T = t.add($, T), $ = t.sub(J, T), T = t.add(J, T), T = t.mul($, T), $ = t.mul(F, $), B = t.mul(b, B), K = t.mul(f, K), F = t.sub(G, K), F = t.mul(f, F), F = t.add(F, B), B = t.add(G, G), G = t.add(B, G), G = t.add(G, K), G = t.mul(G, F), T = t.add(T, G), K = t.mul(M, O), K = t.add(K, K), G = t.mul(K, F), $ = t.sub($, G), B = t.mul(K, J), B = t.add(B, B), B = t.add(B, B), new R($, T, B);
+      return F = t.add(F, F), B = t.mul(E, O), B = t.add(B, B), $ = t.mul(_, B), T = t.mul(b, K), T = t.add($, T), $ = t.sub(J, T), T = t.add(J, T), T = t.mul($, T), $ = t.mul(F, $), B = t.mul(b, B), K = t.mul(_, K), F = t.sub(G, K), F = t.mul(_, F), F = t.add(F, B), B = t.add(G, G), G = t.add(B, G), G = t.add(G, K), G = t.mul(G, F), T = t.add(T, G), K = t.mul(M, O), K = t.add(K, K), G = t.mul(K, F), $ = t.sub($, G), B = t.mul(K, J), B = t.add(B, B), B = t.add(B, B), new R($, T, B);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
     // https://eprint.iacr.org/2015/1060, algorithm 1
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
-    add(f) {
-      N(f);
-      const { X: x, Y: b, Z: E } = this, { X: M, Y: O, Z: $ } = f;
+    add(_) {
+      N(_);
+      const { X: x, Y: b, Z: E } = this, { X: M, Y: O, Z: $ } = _;
       let T = t.ZERO, B = t.ZERO, G = t.ZERO;
       const J = o.a, K = t.mul(o.b, He);
       let F = t.mul(x, M), X = t.mul(b, O), Z = t.mul(E, $), oe = t.add(x, b), j = t.add(M, O);
@@ -3740,8 +3737,8 @@ function jr(r, e = {}) {
       let Q = t.add(M, $);
       return j = t.mul(j, Q), Q = t.add(F, Z), j = t.sub(j, Q), Q = t.add(b, E), T = t.add(O, $), Q = t.mul(Q, T), T = t.add(X, Z), Q = t.sub(Q, T), G = t.mul(J, j), T = t.mul(K, Z), G = t.add(T, G), T = t.sub(X, G), G = t.add(X, G), B = t.mul(T, G), X = t.add(F, F), X = t.add(X, F), Z = t.mul(J, Z), j = t.mul(K, j), X = t.add(X, Z), Z = t.sub(F, Z), Z = t.mul(J, Z), j = t.add(j, Z), F = t.mul(X, j), B = t.add(B, F), F = t.mul(Q, j), T = t.mul(oe, T), T = t.sub(T, F), F = t.mul(oe, X), G = t.mul(Q, G), G = t.add(G, F), new R(T, B, G);
     }
-    subtract(f) {
-      return this.add(f.negate());
+    subtract(_) {
+      return this.add(_.negate());
     }
     is0() {
       return this.equals(R.ZERO);
@@ -3755,17 +3752,17 @@ function jr(r, e = {}) {
      * @param scalar by which the point would be multiplied
      * @returns New point
      */
-    multiply(f) {
+    multiply(_) {
       const { endo: x } = e;
-      if (!n.isValidNot0(f))
+      if (!n.isValidNot0(_))
         throw new Error("invalid scalar: out of range");
       let b, E;
       const M = (O) => L.cached(this, O, ($) => Ut(R, $));
       if (x) {
-        const { k1neg: O, k1: $, k2neg: T, k2: B } = V(f), { p: G, f: J } = M($), { p: K, f: F } = M(B);
+        const { k1neg: O, k1: $, k2neg: T, k2: B } = V(_), { p: G, f: J } = M($), { p: K, f: F } = M(B);
         E = J.add(F), b = k(x.beta, G, K, O, T);
       } else {
-        const { p: O, f: $ } = M(f);
+        const { p: O, f: $ } = M(_);
         b = O, E = $;
       }
       return Ut(R, [b, E])[0];
@@ -3775,49 +3772,49 @@ function jr(r, e = {}) {
      * It's faster, but should only be used when you don't care about
      * an exposed secret key e.g. sig verification, which works over *public* keys.
      */
-    multiplyUnsafe(f) {
+    multiplyUnsafe(_) {
       const { endo: x } = e, b = this;
-      if (!n.isValid(f))
+      if (!n.isValid(_))
         throw new Error("invalid scalar: out of range");
-      if (f === _e || b.is0())
+      if (_ === _e || b.is0())
         return R.ZERO;
-      if (f === Re)
+      if (_ === Re)
         return b;
       if (L.hasCache(this))
-        return this.multiply(f);
+        return this.multiply(_);
       if (x) {
-        const { k1neg: E, k1: M, k2neg: O, k2: $ } = V(f), { p1: T, p2: B } = Gr(R, b, M, $);
+        const { k1neg: E, k1: M, k2neg: O, k2: $ } = V(_), { p1: T, p2: B } = Gr(R, b, M, $);
         return k(x.beta, T, B, E, O);
       } else
-        return L.unsafe(b, f);
+        return L.unsafe(b, _);
     }
     /**
      * Converts Projective point to affine (x, y) coordinates.
      * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
      */
-    toAffine(f) {
-      return W(this, f);
+    toAffine(_) {
+      return W(this, _);
     }
     /**
      * Checks whether Point is free of torsion elements (is in prime subgroup).
      * Always torsion-free for cofactor=1 curves.
      */
     isTorsionFree() {
-      const { isTorsionFree: f } = e;
-      return i === Re ? !0 : f ? f(R, this) : L.unsafe(this, a).is0();
+      const { isTorsionFree: _ } = e;
+      return i === Re ? !0 : _ ? _(R, this) : L.unsafe(this, a).is0();
     }
     clearCofactor() {
-      const { clearCofactor: f } = e;
-      return i === Re ? this : f ? f(R, this) : this.multiplyUnsafe(i);
+      const { clearCofactor: _ } = e;
+      return i === Re ? this : _ ? _(R, this) : this.multiplyUnsafe(i);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(i).is0();
     }
-    toBytes(f = !0) {
-      return qe(f, "isCompressed"), this.assertValidity(), _(R, this, f);
+    toBytes(_ = !0) {
+      return qe(_, "isCompressed"), this.assertValidity(), f(R, this, _);
     }
-    toHex(f = !0) {
-      return Me(this.toBytes(f));
+    toHex(_ = !0) {
+      return Me(this.toBytes(_));
     }
     toString() {
       return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
@@ -3847,42 +3844,42 @@ function As(r, e) {
 }
 function Yr(r, e = {}) {
   const { Fn: s } = r, t = e.randomBytes || os, n = Object.assign(As(r.Fp, s), { seed: ws(s.ORDER) });
-  function o(_) {
+  function o(f) {
     try {
-      const w = s.fromBytes(_);
+      const w = s.fromBytes(f);
       return s.isValidNot0(w);
     } catch {
       return !1;
     }
   }
-  function i(_, w) {
+  function i(f, w) {
     const { publicKey: v, publicKeyUncompressed: y } = n;
     try {
-      const S = _.length;
-      return w === !0 && S !== v || w === !1 && S !== y ? !1 : !!r.fromBytes(_);
+      const S = f.length;
+      return w === !0 && S !== v || w === !1 && S !== y ? !1 : !!r.fromBytes(f);
     } catch {
       return !1;
     }
   }
-  function a(_ = t(n.seed)) {
-    return Hr(z(_, n.seed, "seed"), s.ORDER);
+  function a(f = t(n.seed)) {
+    return Hr(z(f, n.seed, "seed"), s.ORDER);
   }
-  function c(_, w = !0) {
-    return r.BASE.multiply(s.fromBytes(_)).toBytes(w);
+  function c(f, w = !0) {
+    return r.BASE.multiply(s.fromBytes(f)).toBytes(w);
   }
-  function l(_) {
+  function l(f) {
     const { secretKey: w, publicKey: v, publicKeyUncompressed: y } = n;
-    if (!ut(_) || "_lengths" in s && s._lengths || w === v)
+    if (!ut(f) || "_lengths" in s && s._lengths || w === v)
       return;
-    const S = z(_, void 0, "key").length;
+    const S = z(f, void 0, "key").length;
     return S === v || S === y;
   }
-  function u(_, w, v = !0) {
-    if (l(_) === !0)
+  function u(f, w, v = !0) {
+    if (l(f) === !0)
       throw new Error("first arg must be private key");
     if (l(w) === !1)
       throw new Error("second arg must be public key");
-    const y = s.fromBytes(_);
+    const y = s.fromBytes(f);
     return r.fromBytes(w).multiply(y).toBytes(v);
   }
   const h = {
@@ -3900,29 +3897,29 @@ function Jr(r, e, s = {}) {
     bits2int: "function",
     bits2int_modN: "function"
   }), s = Object.assign({}, s);
-  const t = s.randomBytes || os, n = s.hmac || ((f, x) => Ss(e, f, x)), { Fp: o, Fn: i } = r, { ORDER: a, BITS: c } = i, { keygen: l, getPublicKey: u, getSharedSecret: h, utils: g, lengths: _ } = Yr(r, s), w = {
+  const t = s.randomBytes || os, n = s.hmac || ((_, x) => Ss(e, _, x)), { Fp: o, Fn: i } = r, { ORDER: a, BITS: c } = i, { keygen: l, getPublicKey: u, getSharedSecret: h, utils: g, lengths: f } = Yr(r, s), w = {
     prehash: !0,
     lowS: typeof s.lowS == "boolean" ? s.lowS : !0,
     format: "compact",
     extraEntropy: !1
   }, v = a * Es < o.ORDER;
-  function y(f) {
+  function y(_) {
     const x = a >> Re;
-    return f > x;
+    return _ > x;
   }
-  function S(f, x) {
+  function S(_, x) {
     if (!i.isValidNot0(x))
-      throw new Error(`invalid signature ${f}: out of range 1..Point.Fn.ORDER`);
+      throw new Error(`invalid signature ${_}: out of range 1..Point.Fn.ORDER`);
     return x;
   }
   function C() {
     if (v)
       throw new Error('"recovered" sig type is not supported for cofactor >2 curves');
   }
-  function U(f, x) {
+  function U(_, x) {
     ct(x);
-    const b = _.signature, E = x === "compact" ? b : x === "recovered" ? b + 1 : void 0;
-    return z(f, E);
+    const b = f.signature, E = x === "compact" ? b : x === "recovered" ? b + 1 : void 0;
+    return z(_, E);
   }
   class N {
     constructor(x, b, E) {
@@ -3944,7 +3941,7 @@ function Jr(r, e, s = {}) {
         return new N(T, B);
       }
       b === "recovered" && (E = x[0], b = "compact", x = x.subarray(1));
-      const M = _.signature / 2, O = x.subarray(0, M), $ = x.subarray(M, M * 2);
+      const M = f.signature / 2, O = x.subarray(0, M), $ = x.subarray(M, M * 2);
       return new N(i.fromBytes(O), i.fromBytes($), E);
     }
     static fromHex(x, b) {
@@ -3990,21 +3987,21 @@ function Jr(r, e, s = {}) {
   }, W = s.bits2int_modN || function(x) {
     return i.create(V(x));
   }, P = ft(c);
-  function k(f) {
-    return Tr("num < 2^" + c, f, _e, P), i.toBytes(f);
+  function k(_) {
+    return Tr("num < 2^" + c, _, _e, P), i.toBytes(_);
   }
-  function D(f, x) {
-    return z(f, void 0, "message"), x ? z(e(f), void 0, "prehashed message") : f;
+  function D(_, x) {
+    return z(_, void 0, "message"), x ? z(e(_), void 0, "prehashed message") : _;
   }
-  function q(f, x, b) {
+  function q(_, x, b) {
     const { lowS: E, prehash: M, extraEntropy: O } = st(b, w);
-    f = D(f, M);
-    const $ = W(f), T = i.fromBytes(x);
+    _ = D(_, M);
+    const $ = W(_), T = i.fromBytes(x);
     if (!i.isValidNot0(T))
       throw new Error("invalid private key");
     const B = [k(T), k($)];
     if (O != null && O !== !1) {
-      const F = O === !0 ? t(_.secretKey) : O;
+      const F = O === !0 ? t(f.secretKey) : O;
       B.push(z(F, void 0, "extraEntropy"));
     }
     const G = ve(...B), J = $;
@@ -4023,19 +4020,19 @@ function Jr(r, e, s = {}) {
     }
     return { seed: G, k2sig: K };
   }
-  function L(f, x, b = {}) {
-    const { seed: E, k2sig: M } = q(f, x, b);
+  function L(_, x, b = {}) {
+    const { seed: E, k2sig: M } = q(_, x, b);
     return kr(e.outputLen, i.BYTES, n)(E, M).toBytes(b.format);
   }
-  function R(f, x, b, E = {}) {
+  function R(_, x, b, E = {}) {
     const { lowS: M, prehash: O, format: $ } = st(E, w);
-    if (b = z(b, void 0, "publicKey"), x = D(x, O), !ut(f)) {
-      const T = f instanceof N ? ", use sig.toBytes()" : "";
+    if (b = z(b, void 0, "publicKey"), x = D(x, O), !ut(_)) {
+      const T = _ instanceof N ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + T);
     }
-    U(f, $);
+    U(_, $);
     try {
-      const T = N.fromBytes(f, $), B = r.fromBytes(b);
+      const T = N.fromBytes(_, $), B = r.fromBytes(b);
       if (M && T.hasHighS())
         return !1;
       const { r: G, s: J } = T, K = W(x), F = i.inv(J), X = i.create(K * F), Z = i.create(G * F), oe = r.BASE.multiplyUnsafe(X).add(B.multiplyUnsafe(Z));
@@ -4044,16 +4041,16 @@ function Jr(r, e, s = {}) {
       return !1;
     }
   }
-  function A(f, x, b = {}) {
+  function A(_, x, b = {}) {
     const { prehash: E } = st(b, w);
-    return x = D(x, E), N.fromBytes(f, "recovered").recoverPublicKey(x).toBytes();
+    return x = D(x, E), N.fromBytes(_, "recovered").recoverPublicKey(x).toBytes();
   }
   return Object.freeze({
     keygen: l,
     getPublicKey: u,
     getSharedSecret: h,
     utils: g,
-    lengths: _,
+    lengths: f,
     Point: r,
     sign: L,
     verify: R,
@@ -4079,7 +4076,7 @@ const gt = {
   ]
 }, qt = /* @__PURE__ */ BigInt(2);
 function Zr(r) {
-  const e = gt.p, s = BigInt(3), t = BigInt(6), n = BigInt(11), o = BigInt(22), i = BigInt(23), a = BigInt(44), c = BigInt(88), l = r * r * r % e, u = l * l * r % e, h = ae(u, s, e) * u % e, g = ae(h, s, e) * u % e, _ = ae(g, qt, e) * l % e, w = ae(_, n, e) * _ % e, v = ae(w, o, e) * w % e, y = ae(v, a, e) * v % e, S = ae(y, c, e) * y % e, C = ae(S, a, e) * v % e, U = ae(C, s, e) * u % e, N = ae(U, i, e) * w % e, V = ae(N, t, e) * l % e, W = ae(V, qt, e);
+  const e = gt.p, s = BigInt(3), t = BigInt(6), n = BigInt(11), o = BigInt(22), i = BigInt(23), a = BigInt(44), c = BigInt(88), l = r * r * r % e, u = l * l * r % e, h = ae(u, s, e) * u % e, g = ae(h, s, e) * u % e, f = ae(g, qt, e) * l % e, w = ae(f, n, e) * f % e, v = ae(w, o, e) * w % e, y = ae(v, a, e) * v % e, S = ae(y, c, e) * y % e, C = ae(S, a, e) * v % e, U = ae(C, s, e) * u % e, N = ae(U, i, e) * w % e, V = ae(N, t, e) * l % e, W = ae(V, qt, e);
   if (!lt.eql(lt.sqr(W), r))
     throw new Error("Cannot find square root");
   return W;
@@ -4103,8 +4100,8 @@ function ln(r, e = 24) {
       s[i] = r[i] ^ r[i + 10] ^ r[i + 20] ^ r[i + 30] ^ r[i + 40];
     for (let i = 0; i < 10; i += 2) {
       const a = (i + 8) % 10, c = (i + 2) % 10, l = s[c], u = s[c + 1], h = Kt(l, u, 1) ^ s[a], g = Vt(l, u, 1) ^ s[a + 1];
-      for (let _ = 0; _ < 50; _ += 10)
-        r[i + _] ^= h, r[i + _ + 1] ^= g;
+      for (let f = 0; f < 50; f += 10)
+        r[i + f] ^= h, r[i + f + 1] ^= g;
     }
     let n = r[2], o = r[3];
     for (let i = 0; i < 24; i++) {
@@ -4413,7 +4410,7 @@ class be {
         t(new Error("팝업 창을 열 수 없습니다. 팝업 차단을 해제해 주세요."));
         return;
       }
-      const _ = setTimeout(() => {
+      const f = setTimeout(() => {
         d.warn("[CROSSx] OAuth 타임아웃 (5분) — postMessage를 수신하지 못했습니다"), N(), t(new Error("Authentication timeout"));
       }, 5 * 60 * 1e3), w = 10, v = 30;
       let y = 0, S = null;
@@ -4431,7 +4428,7 @@ class be {
           C();
         }
       }, 1e3), N = () => {
-        clearTimeout(_), clearInterval(U), S && clearTimeout(S), window.removeEventListener("message", V);
+        clearTimeout(f), clearInterval(U), S && clearTimeout(S), window.removeEventListener("message", V);
       }, V = (W) => {
         var k, D, q, L, R;
         if (W.origin !== e.expectedOrigin) return;
@@ -4446,9 +4443,9 @@ class be {
           return;
         }
         if (W.data.status === "success") {
-          const A = (D = W.data.data) == null ? void 0 : D.idToken, f = (q = W.data.data) == null ? void 0 : q.accessToken, x = f ?? A;
+          const A = (D = W.data.data) == null ? void 0 : D.idToken, _ = (q = W.data.data) == null ? void 0 : q.accessToken, x = _ ?? A;
           if (d.log("[CROSSx] OAuth 토큰 수신:", {
-            hasAccessToken: !!f,
+            hasAccessToken: !!_,
             hasIdToken: !!A
           }), !x) {
             d.error("[CROSSx] 토큰을 찾을 수 없음:", W.data), t(new Error("Token not found in response"));
@@ -4456,7 +4453,7 @@ class be {
           }
           A ? be.verifyIdTokenNonce(A, l).then(() => s(x)).catch((b) => {
             d.error("[CROSSx] nonce 검증 실패:", b), t(b instanceof Error ? b : new Error("nonce verification failed"));
-          }) : f ? f.split(".").length === 3 ? be.verifyIdTokenNonce(f, l).then(() => s(x)).catch((E) => {
+          }) : _ ? _.split(".").length === 3 ? be.verifyIdTokenNonce(_, l).then(() => s(x)).catch((E) => {
             d.error("[CROSSx] accessToken nonce 검증 실패:", E), t(E instanceof Error ? E : new Error("nonce verification failed"));
           }) : (d.warn(
             "[CROSSx] opaque accessToken만 수신 (idToken 없음) — nonce 검증 불가.",
@@ -4661,7 +4658,7 @@ class Le {
             url: o,
             method: e
           });
-          const g = Le.mapGatewayError(u.code, u.data), _ = Le.getGatewayErrorMessage(u.code, h), w = u.data, v = g === p.PIN_LOCKED ? Le.extractLockDetails(w) : w ?? void 0, y = new m(g, _, v);
+          const g = Le.mapGatewayError(u.code, u.data), f = Le.getGatewayErrorMessage(u.code, h), w = u.data, v = g === p.PIN_LOCKED ? Le.extractLockDetails(w) : w ?? void 0, y = new m(g, f, v);
           throw g === p.AUTH_NOT_AUTHENTICATED && this._onUnauthorized && (d.warn("[CROSSx] Gateway -10002 감지 — 강제 로그아웃 실행"), this._onUnauthorized()), y;
         }
         return d.log("[CROSSx] Wallet Gateway API 성공:", { code: u.code, url: o, method: e }), u.data ?? u;
@@ -7228,7 +7225,7 @@ function Cn(r, e, s) {
   const c = e.from ? Y("From", `<span class="__crossx-addr-text">${se(e.from)}</span>
        <button class="__crossx-copy-btn" data-copy="${H(e.from)}" title="Copy address">${xe}</button>`) : "", l = e.to ? Y("To", `<span class="__crossx-addr-text">${se(e.to)}</span>
        <button class="__crossx-copy-btn" data-copy="${H(e.to)}" title="Copy address">${xe}</button>`) : "", u = e.amount ? Y("Transfer", `<span>${H(e.amount)}</span>`) : "", h = e.fees ? Y("Tx Fee", `<span>${H(e.fees)}</span>`) : "", g = e.txHash ? Y("Tx Hash", `<span class="__crossx-addr-text">${se(e.txHash)}</span>
-       <button class="__crossx-copy-btn" data-copy="${H(e.txHash)}" title="Copy hash">${xe}</button>`) : "", _ = e.total ? `<div class="__crossx-total-pill">
+       <button class="__crossx-copy-btn" data-copy="${H(e.txHash)}" title="Copy hash">${xe}</button>`) : "", f = e.total ? `<div class="__crossx-total-pill">
         <span class="__crossx-total-label">Total<br>(including fees)</span>
         <span class="__crossx-total-amount">${H(e.total)}</span>
        </div>` : "";
@@ -7240,7 +7237,7 @@ function Cn(r, e, s) {
       ${h}
       ${g}
     </div>
-    ${_}
+    ${f}
     <button class="__crossx-approve-btn" id="__crossx-done-btn">${t ? "All Done" : "Done"}</button>
   `, a.querySelectorAll(".__crossx-copy-btn").forEach((w) => {
     w.addEventListener("click", (v) => {
@@ -7300,12 +7297,12 @@ function Dn(r, e) {
       <span class="__crossx-td-value">${H(o)}</span>
     </div>`;
   for (const [l, u] of Object.entries(i)) {
-    const h = Pn(u), _ = kn(u) ? `<span class="__crossx-addr-text">${se(u)}</span>
+    const h = Pn(u), f = kn(u) ? `<span class="__crossx-addr-text">${se(u)}</span>
          <button class="__crossx-copy-btn" data-copy="${H(String(u))}" title="Copy">${xe}</button>` : `<span>${h}</span>`;
     a += `
     <div class="__crossx-td-row">
       <span class="__crossx-td-label">${H(l)}</span>
-      <div class="__crossx-td-value">${_}</div>
+      <div class="__crossx-td-value">${f}</div>
     </div>`;
   }
   const c = document.createElement("div");
@@ -7598,7 +7595,7 @@ function zn(r) {
 function ot(r, e, s, t, n, o) {
   var V, W;
   let i = !!(o && o > Date.now()), a = !1;
-  const c = () => Array.from(r.querySelectorAll(".__crossx-pin6-box")), l = () => r.querySelector("#__crossx-pin6-boxes"), u = () => r.querySelector("#__crossx-pin6-error"), h = () => r.querySelector("#__crossx-pin6-lock-msg"), g = () => r.querySelector("#__crossx-pin6-lock-countdown"), _ = () => r.querySelector(".__crossx-pin6-body"), w = () => c().map((P) => P.value).join(""), v = (P) => {
+  const c = () => Array.from(r.querySelectorAll(".__crossx-pin6-box")), l = () => r.querySelector("#__crossx-pin6-boxes"), u = () => r.querySelector("#__crossx-pin6-error"), h = () => r.querySelector("#__crossx-pin6-lock-msg"), g = () => r.querySelector("#__crossx-pin6-lock-countdown"), f = () => r.querySelector(".__crossx-pin6-body"), w = () => c().map((P) => P.value).join(""), v = (P) => {
     i = P, c().forEach((k) => {
       k.disabled = P, k.classList.toggle("--locked", P);
     });
@@ -7624,16 +7621,16 @@ function ot(r, e, s, t, n, o) {
     if (k && (k.textContent = "Too many failed attempts. Please wait."), !h()) {
       const A = document.createElement("p");
       A.className = "__crossx-pin6-lock-msg", A.id = "__crossx-pin6-lock-msg", A.innerHTML = `${Cs}<span id="__crossx-pin6-lock-countdown"></span>`;
-      const f = u();
-      f ? f.insertAdjacentElement("afterend", A) : (R = _()) == null || R.appendChild(A);
+      const _ = u();
+      _ ? _.insertAdjacentElement("afterend", A) : (R = f()) == null || R.appendChild(A);
     }
     const D = () => {
       var x;
-      const A = P - Date.now(), f = g();
+      const A = P - Date.now(), _ = g();
       A <= 0 ? (clearInterval(q), v(!1), (x = h()) == null || x.remove(), k && (k.textContent = ""), setTimeout(() => {
         var b;
         return (b = c()[0]) == null ? void 0 : b.focus();
-      }, 50)) : f && (f.textContent = ` ${zn(A)}`);
+      }, 50)) : _ && (_.textContent = ` ${zn(A)}`);
     }, q = setInterval(D, 1e3);
     D();
     const L = new MutationObserver(() => {
@@ -7673,7 +7670,7 @@ function ot(r, e, s, t, n, o) {
   };
   (V = l()) == null || V.addEventListener("click", (P) => {
     P.target.classList.contains("__crossx-pin6-box") || N();
-  }), (W = _()) == null || W.addEventListener("click", (P) => {
+  }), (W = f()) == null || W.addEventListener("click", (P) => {
     const k = P.target;
     k.classList.contains("__crossx-pin6-box") || k.closest("button") || N();
   }), c().forEach((P, k) => {
@@ -7697,8 +7694,8 @@ function ot(r, e, s, t, n, o) {
       const q = (((R = D.clipboardData) == null ? void 0 : R.getData("text")) ?? "").replace(/\D/g, "").slice(0, 6);
       if (!q) return;
       const L = c();
-      q.split("").forEach((f, x) => {
-        L[x] && (L[x].value = f);
+      q.split("").forEach((_, x) => {
+        L[x] && (L[x].value = _);
       }), (A = L[Math.min(q.length - 1, 5)]) == null || A.focus(), y(), w().length === 6 && setTimeout(U, 80);
     }), P.addEventListener("focus", () => P.select());
   });
@@ -7728,8 +7725,8 @@ function Jn(r, e, s) {
       c.preventDefault();
       const l = (((h = c.clipboardData) == null ? void 0 : h.getData("text")) ?? "").replace(/\D/g, "").slice(0, 4);
       if (!l) return;
-      l.split("").forEach((g, _) => {
-        t[_] && (t[_].value = g);
+      l.split("").forEach((g, f) => {
+        t[f] && (t[f].value = g);
       });
       const u = Math.min(l.length, 3);
       t[u].focus(), l.length === 4 && setTimeout(() => e(l), 200);
@@ -7783,9 +7780,9 @@ class Xn {
           });
         });
       })();
-      const _ = i.querySelector("#__crossx-add-wallet-btn");
-      _ && _.addEventListener("click", async () => {
-        _.disabled = !0;
+      const f = i.querySelector("#__crossx-add-wallet-btn");
+      f && f.addEventListener("click", async () => {
+        f.disabled = !0;
         try {
           const y = await s();
           o.push(y);
@@ -7796,7 +7793,7 @@ class Xn {
           }
         } catch {
         } finally {
-          _.disabled = !1;
+          f.disabled = !1;
         }
       }), (v = i.querySelector("#__crossx-close-btn")) == null || v.addEventListener("click", h), i.addEventListener("click", (y) => {
         y.target === i && h();
@@ -7827,7 +7824,7 @@ class Xn {
       (c = t.querySelector("#__crossx-apple-btn")) == null || c.addEventListener("click", () => o("apple")), (l = t.querySelector("#__crossx-google-btn")) == null || l.addEventListener("click", () => o("google")), (u = t.querySelector("#__crossx-connect-btn")) == null || u.addEventListener("click", () => o("external")), (h = t.querySelector("#__crossx-close-btn")) == null || h.addEventListener("click", i), t.addEventListener("click", (g) => {
         g.target === t && i();
       }), t.querySelectorAll(".__crossx-login-terms-link").forEach((g) => {
-        g.addEventListener("click", (_) => _.stopPropagation());
+        g.addEventListener("click", (f) => f.stopPropagation());
       });
       const a = (g) => {
         g.key === "Escape" && (document.removeEventListener("keydown", a), i());
@@ -7900,7 +7897,7 @@ class Xn {
         u(), s(C);
       }, g = () => {
         u(), s(null);
-      }, _ = a.querySelector(".__crossx-card"), w = {
+      }, f = a.querySelector(".__crossx-card"), w = {
         tooShort: (t == null ? void 0 : t.pinValidation_tooShort) ?? "Please enter a 6-digit PIN.",
         numbersOnly: (t == null ? void 0 : t.pinValidation_numbersOnly) ?? "Only numbers (0-9) are allowed.",
         repeatingDigit: (t == null ? void 0 : t.pinValidation_repeatingDigit) ?? "Cannot use the same number 3+ times in a row.",
@@ -7908,27 +7905,27 @@ class Xn {
         alternatingPattern: (t == null ? void 0 : t.pinValidation_alternatingPattern) ?? "Repeating patterns (e.g., 121212) are not allowed."
       }, v = (C) => {
         var U;
-        _.innerHTML = nt({
+        f.innerHTML = nt({
           title: i.title,
           headerSubtitle: i.headerSubtitle
-        }), (U = _.querySelector("#__crossx-close-btn")) == null || U.addEventListener("click", g), ot(_, (N) => {
+        }), (U = f.querySelector("#__crossx-close-btn")) == null || U.addEventListener("click", g), ot(f, (N) => {
           N === C ? h(C) : y(o.mismatchError);
         }, g);
       }, y = (C) => {
         var U;
-        _.innerHTML = nt({
+        f.innerHTML = nt({
           title: o.title,
           headerSubtitle: o.headerSubtitle,
           subtitle: o.subtitle,
           errorMessage: C
-        }), (U = _.querySelector("#__crossx-close-btn")) == null || U.addEventListener("click", g), ot(_, (N) => {
+        }), (U = f.querySelector("#__crossx-close-btn")) == null || U.addEventListener("click", g), ot(f, (N) => {
           const V = Vn(N, w);
           V ? y(V) : v(N);
         }, g);
       };
       (() => {
         var q;
-        const C = Array.from(_.querySelectorAll(".__crossx-pw-notice-item")), U = _.querySelector("#__crossx-pin-notice-next"), N = /* @__PURE__ */ new Set();
+        const C = Array.from(f.querySelectorAll(".__crossx-pw-notice-item")), U = f.querySelector("#__crossx-pin-notice-next"), N = /* @__PURE__ */ new Set();
         U.removeAttribute("disabled");
         const V = U.dataset.nextLabel ?? "Next", W = U.dataset.submitLabel ?? "I Understand", P = () => {
           const L = N.size === C.length;
@@ -7955,15 +7952,15 @@ class Xn {
             return;
           }
           const L = C.find((A) => {
-            const f = parseInt(A.dataset.checkIndex ?? "0", 10);
-            return !N.has(f);
+            const _ = parseInt(A.dataset.checkIndex ?? "0", 10);
+            return !N.has(_);
           });
           if (!L) return;
           const R = parseInt(L.dataset.checkIndex ?? "0", 10);
           L.scrollIntoView({ behavior: "smooth", block: "nearest" }), L.classList.add("--highlight"), setTimeout(() => {
             L.classList.remove("--highlight"), k(L, R);
           }, 400);
-        }), (q = _.querySelector("#__crossx-close-btn")) == null || q.addEventListener("click", g);
+        }), (q = f.querySelector("#__crossx-close-btn")) == null || q.addEventListener("click", g);
       })(), a.addEventListener("click", (C) => {
         C.target === a && g();
       });
@@ -7993,13 +7990,13 @@ class Xn {
         u || (u = !0, c.remove(), document.body.style.overflow = l);
       }, g = (S) => {
         h(), s(S);
-      }, _ = () => {
+      }, f = () => {
         h(), s(null);
       }, w = (S) => {
         h(), t(S);
       }, v = c.querySelector(".__crossx-card");
-      (y = v.querySelector("#__crossx-close-btn")) == null || y.addEventListener("click", _), ot(v, g, _, w, e == null ? void 0 : e.onSubmit, e == null ? void 0 : e.lockExpiresAt), c.addEventListener("click", (S) => {
-        S.target === c && _();
+      (y = v.querySelector("#__crossx-close-btn")) == null || y.addEventListener("click", f), ot(v, g, f, w, e == null ? void 0 : e.onSubmit, e == null ? void 0 : e.lockExpiresAt), c.addEventListener("click", (S) => {
+        S.target === c && f();
       });
     });
   }
@@ -8121,8 +8118,8 @@ class Xn {
         h.addEventListener("click", (g) => {
           var w;
           g.stopPropagation();
-          const _ = h.dataset.copy;
-          _ && ((w = navigator.clipboard) == null || w.writeText(_).catch(() => {
+          const f = h.dataset.copy;
+          f && ((w = navigator.clipboard) == null || w.writeText(f).catch(() => {
           }));
         });
       }), t.addEventListener("click", (h) => {
@@ -8183,7 +8180,7 @@ function so(r, e) {
     u,
     h
   ));
-  const _ = new De(n, c), w = new Xn(r.theme ?? "light", r.themeTokens), v = e != null && e.wrapConfirmation ? e.wrapConfirmation(w) : w;
+  const f = new De(n, c), w = new Xn(r.theme ?? "light", r.themeTokens), v = e != null && e.wrapConfirmation ? e.wrapConfirmation(w) : w;
   return new it(
     t,
     n,
@@ -8194,7 +8191,7 @@ function so(r, e) {
     g,
     u,
     v,
-    _,
+    f,
     h
   );
 }