@nexus-cross/crossx-sdk-core 1.2.3 → 1.2.4-beta.1

package/dist/index.js

@@ -167,26 +167,26 @@ class $s {
     };
   }
 }
-let be = null;
+let ye = null;
 function vt(r) {
-  be = r;
+  ye = r;
 }
 const u = {
   log(...r) {
-    if (be) {
-      be.log(...r);
+    if (ye) {
+      ye.log(...r);
       return;
     }
   },
   warn(...r) {
-    if (be) {
-      be.warn(...r);
+    if (ye) {
+      ye.warn(...r);
       return;
     }
   },
   error(...r) {
-    if (be) {
-      be.error(...r);
+    if (ye) {
+      ye.error(...r);
       return;
     }
   }
@@ -375,18 +375,18 @@ class Hs {
       try {
         const B = this.crypto.decodeJWT(x);
         S = (n = B.firebase) == null ? void 0 : n.sign_in_provider;
-        const v = ((o = B.firebase) == null ? void 0 : o.identities) ?? {};
-        S === "google.com" ? y = (i = v["google.com"]) == null ? void 0 : i[0] : S === "apple.com" && (y = (a = v["apple.com"]) == null ? void 0 : a[0]), u.log("[CROSSx] OAuth provider sub 추출 — provider:", S, "hasProviderSub:", !!y);
+        const b = ((o = B.firebase) == null ? void 0 : o.identities) ?? {};
+        S === "google.com" ? y = (i = b["google.com"]) == null ? void 0 : i[0] : S === "apple.com" && (y = (a = b["apple.com"]) == null ? void 0 : a[0]), u.log("[CROSSx] OAuth provider sub 추출 — provider:", S, "hasProviderSub:", !!y);
       } catch {
         u.warn("[CROSSx] firebaseToken에서 providerSub 추출 실패");
       }
       if (w) {
         const B = this.crypto.decodeJWT(w);
         u.log("[CROSSx] access_token 디코딩 — sub:", B.sub, "exp:", B.exp);
-        const v = await this.crypto.verifyJWT(w);
-        if (t = v.signatureVerified ?? !1, !v.valid)
+        const b = await this.crypto.verifyJWT(w);
+        if (t = b.signatureVerified ?? !1, !b.valid)
           throw u.error("[CROSSx] access_token 검증 실패"), new Error("유효하지 않은 access token");
-        const P = v.payload;
+        const P = b.payload;
         s = {
           id: P.sub,
           email: P.email,
@@ -836,7 +836,7 @@ const Js = 2e3, It = 6e4, Zs = 1e3, Xs = 1e4, Qs = "0x77359400", Et = "0x3B9ACA0
     }), this._initPromise);
   }
   async _doInitialize(e) {
-    console.log("[CROSSx SDK] v1.2.3 초기화 중..."), this.confirmation.setMessages(St(this._config.locale));
+    console.log("[CROSSx SDK] v1.2.4 초기화 중..."), this.confirmation.setMessages(St(this._config.locale));
     try {
       const s = Ys();
       this.internalConfig.oauthServiceUrl = s.oauthServiceUrl, this.internalConfig.authApiUrl = s.authApiUrl, this.internalConfig.walletGatewayUrl = s.walletGatewayUrl, this.adapterConfig.gatewayUrl = s.walletGatewayUrl;
@@ -1023,7 +1023,7 @@ const Js = 2e3, It = 6e4, Zs = 1e3, Xs = 1e4, Qs = "0x77359400", Et = "0x3B9ACA0
    * create 시 -10012 에러(기존 백업 발견)가 발생하면 자동으로 호출됩니다.
    *
    * @param pin 4자리 PIN (클라우드 백업 복호화용)
-   * @returns 마이그레이션 결과 (address, shareC)
+   * @returns 마이그레이션 결과 (address)
    */
   async migrateWallet(e) {
     if (this.ensureAuthenticated(), !this.userId)
@@ -1557,15 +1557,15 @@ const Js = 2e3, It = 6e4, Zs = 1e3, Xs = 1e4, Qs = "0x77359400", Et = "0x3B9ACA0
     let m, x;
     const w = this.waitForTxAndGetReceipt(a, e, { intervalMs: c, timeoutMs: l }).then((S) => {
       m = S;
-      const O = BigInt(S.gasUsed) * BigInt(S.effectiveGasPrice), B = s.value ? BigInt(s.value) : 0n, v = re.formatTxAmount(s.value, d.symbol, d.decimals), P = re.formatTxAmount("0x" + O.toString(16), d.symbol, d.decimals), R = re.formatTxAmount("0x" + (B + O).toString(16), d.symbol, d.decimals);
+      const O = BigInt(S.gasUsed) * BigInt(S.effectiveGasPrice), B = s.value ? BigInt(s.value) : 0n, b = re.formatTxAmount(s.value, d.symbol, d.decimals), P = re.formatTxAmount("0x" + O.toString(16), d.symbol, d.decimals), N = re.formatTxAmount("0x" + (B + O).toString(16), d.symbol, d.decimals);
       return {
         chainId: e,
         txHash: a,
         from: S.from,
         to: S.to ?? s.to,
-        amount: v,
+        amount: b,
         fees: P,
-        total: R,
+        total: N,
         nativeSymbol: d.symbol,
         status: S.status === "0x1" ? "success" : "reverted"
       };
@@ -1855,7 +1855,7 @@ const Js = 2e3, It = 6e4, Zs = 1e3, Xs = 1e4, Qs = "0x77359400", Et = "0x3B9ACA0
       });
       if (l === null)
         return u.log("[CROSSx][Migration Phase 4] 사용자가 PIN 입력을 취소함 → 종료"), null;
-      u.log(`[CROSSx][Migration Phase 4] PIN 입력 완료 (${l.length}자리) — verify-recovery-pin API 호출`), t = void 0;
+      u.log("[CROSSx][Migration Phase 4] PIN 입력 완료 — verify-recovery-pin API 호출"), t = void 0;
       try {
         const d = await ((c = (a = this.walletProvider).verifyRecoveryPin) == null ? void 0 : c.call(a, l, e));
         if (!d) {
@@ -2499,7 +2499,7 @@ function qe(r) {
   }
   return t;
 }
-function ye(...r) {
+function we(...r) {
   let e = 0;
   for (let t = 0; t < r.length; t++) {
     const n = r[t];
@@ -2800,7 +2800,7 @@ function Pr(r, e, s) {
   let c = t(r), l = t(r), d = 0;
   const h = () => {
     c.fill(1), l.fill(0), d = 0;
-  }, m = (...y) => s(l, ye(c, ...y)), x = (y = n) => {
+  }, m = (...y) => s(l, we(c, ...y)), x = (y = n) => {
     l = m(o, y), c = m(), y.length !== 0 && (l = m(i, y), c = m());
   }, w = () => {
     if (d++ >= a)
@@ -2812,7 +2812,7 @@ function Pr(r, e, s) {
       const O = c.slice();
       S.push(O), y += c.length;
     }
-    return ye(...S);
+    return we(...S);
   };
   return (y, S) => {
     h(), x(y);
@@ -3460,19 +3460,19 @@ function jr(r, e = {}) {
     if (!t.isOdd)
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
-  function h(N, f, _) {
-    const { x: b, y: A } = f.toAffine(), L = t.toBytes(b);
+  function h(R, f, _) {
+    const { x: v, y: A } = f.toAffine(), L = t.toBytes(v);
     if (Ve(_, "isCompressed"), _) {
       d();
       const C = !t.isOdd(A);
-      return ye(Ss(C), L);
+      return we(Ss(C), L);
     } else
-      return ye(Uint8Array.of(4), L, t.toBytes(A));
+      return we(Uint8Array.of(4), L, t.toBytes(A));
   }
-  function m(N) {
-    z(N, void 0, "Point");
-    const { publicKey: f, publicKeyUncompressed: _ } = l, b = N.length, A = N[0], L = N.subarray(1);
-    if (b === f && (A === 2 || A === 3)) {
+  function m(R) {
+    z(R, void 0, "Point");
+    const { publicKey: f, publicKeyUncompressed: _ } = l, v = R.length, A = R[0], L = R.subarray(1);
+    if (v === f && (A === 2 || A === 3)) {
       const C = t.fromBytes(L);
       if (!t.isValid(C))
         throw new Error("bad point: is not on curve, wrong x");
@@ -3487,91 +3487,91 @@ function jr(r, e = {}) {
       d();
       const $ = t.isOdd(T);
       return (A & 1) === 1 !== $ && (T = t.neg(T)), { x: C, y: T };
-    } else if (b === _ && A === 4) {
+    } else if (v === _ && A === 4) {
       const C = t.BYTES, M = t.fromBytes(L.subarray(0, C)), T = t.fromBytes(L.subarray(C, C * 2));
       if (!y(M, T))
         throw new Error("bad point: is not on curve");
       return { x: M, y: T };
     } else
-      throw new Error(`bad point: got length ${b}, expected compressed=${f} or uncompressed=${_}`);
+      throw new Error(`bad point: got length ${v}, expected compressed=${f} or uncompressed=${_}`);
   }
   const x = e.toBytes || h, w = e.fromBytes || m;
-  function E(N) {
-    const f = t.sqr(N), _ = t.mul(f, N);
-    return t.add(t.add(_, t.mul(N, o.a)), o.b);
+  function E(R) {
+    const f = t.sqr(R), _ = t.mul(f, R);
+    return t.add(t.add(_, t.mul(R, o.a)), o.b);
   }
-  function y(N, f) {
-    const _ = t.sqr(f), b = E(N);
-    return t.eql(_, b);
+  function y(R, f) {
+    const _ = t.sqr(f), v = E(R);
+    return t.eql(_, v);
   }
   if (!y(o.Gx, o.Gy))
     throw new Error("bad curve params: generator point");
   const S = t.mul(t.pow(o.a, Fe), Kr), O = t.mul(t.sqr(o.b), BigInt(27));
   if (t.is0(t.add(S, O)))
     throw new Error("bad curve params: a or b");
-  function B(N, f, _ = !1) {
+  function B(R, f, _ = !1) {
     if (!t.isValid(f) || _ && t.is0(f))
-      throw new Error(`bad point coordinate ${N}`);
+      throw new Error(`bad point coordinate ${R}`);
     return f;
   }
-  function v(N) {
-    if (!(N instanceof W))
+  function b(R) {
+    if (!(R instanceof W))
       throw new Error("Weierstrass Point expected");
   }
-  function P(N) {
+  function P(R) {
     if (!c || !c.basises)
       throw new Error("no endo");
-    return Vr(N, c.basises, n.ORDER);
+    return Vr(R, c.basises, n.ORDER);
   }
-  const R = Lt((N, f) => {
-    const { X: _, Y: b, Z: A } = N;
+  const N = Lt((R, f) => {
+    const { X: _, Y: v, Z: A } = R;
     if (t.eql(A, t.ONE))
-      return { x: _, y: b };
-    const L = N.is0();
+      return { x: _, y: v };
+    const L = R.is0();
     f == null && (f = L ? t.ONE : t.inv(A));
-    const C = t.mul(_, f), M = t.mul(b, f), T = t.mul(A, f);
+    const C = t.mul(_, f), M = t.mul(v, f), T = t.mul(A, f);
     if (L)
       return { x: t.ZERO, y: t.ZERO };
     if (!t.eql(T, t.ONE))
       throw new Error("invZ was invalid");
     return { x: C, y: M };
-  }), G = Lt((N) => {
-    if (N.is0()) {
-      if (e.allowInfinityPoint && !t.is0(N.Y))
+  }), G = Lt((R) => {
+    if (R.is0()) {
+      if (e.allowInfinityPoint && !t.is0(R.Y))
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: f, y: _ } = N.toAffine();
+    const { x: f, y: _ } = R.toAffine();
     if (!t.isValid(f) || !t.isValid(_))
       throw new Error("bad point: x or y not field elements");
     if (!y(f, _))
       throw new Error("bad point: equation left != right");
-    if (!N.isTorsionFree())
+    if (!R.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function K(N, f, _, b, A) {
-    return _ = new W(t.mul(_.X, N), _.Y, _.Z), f = ze(b, f), _ = ze(A, _), f.add(_);
+  function K(R, f, _, v, A) {
+    return _ = new W(t.mul(_.X, R), _.Y, _.Z), f = ze(v, f), _ = ze(A, _), f.add(_);
   }
   const k = class k {
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(f, _, b) {
+    constructor(f, _, v) {
       I(this, "X");
       I(this, "Y");
       I(this, "Z");
-      this.X = B("x", f), this.Y = B("y", _, !0), this.Z = B("z", b), Object.freeze(this);
+      this.X = B("x", f), this.Y = B("y", _, !0), this.Z = B("z", v), 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(_) || !t.isValid(b))
+      const { x: _, y: v } = f || {};
+      if (!f || !t.isValid(_) || !t.isValid(v))
         throw new Error("invalid affine point");
       if (f instanceof k)
         throw new Error("projective point not allowed");
-      return t.is0(_) && t.is0(b) ? k.ZERO : new k(_, b, t.ONE);
+      return t.is0(_) && t.is0(v) ? k.ZERO : new k(_, v, t.ONE);
     }
     static fromBytes(f) {
       const _ = k.fromAffine(w(z(f, void 0, "point")));
@@ -3608,8 +3608,8 @@ function jr(r, e = {}) {
     }
     /** Compare one point to another. */
     equals(f) {
-      v(f);
-      const { X: _, Y: b, Z: A } = this, { X: L, Y: C, Z: M } = f, T = t.eql(t.mul(_, M), t.mul(L, A)), $ = t.eql(t.mul(b, M), t.mul(C, A));
+      b(f);
+      const { X: _, Y: v, Z: A } = this, { X: L, Y: C, Z: M } = f, T = t.eql(t.mul(_, M), t.mul(L, A)), $ = t.eql(t.mul(v, M), t.mul(C, A));
       return T && $;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -3621,23 +3621,23 @@ 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: _ } = o, b = t.mul(_, Fe), { X: A, Y: L, Z: C } = this;
+      const { a: f, b: _ } = o, v = t.mul(_, Fe), { X: A, Y: L, Z: C } = this;
       let M = t.ZERO, T = t.ZERO, $ = t.ZERO, F = t.mul(A, A), J = t.mul(L, L), V = t.mul(C, C), H = t.mul(A, L);
-      return H = t.add(H, H), $ = t.mul(A, C), $ = t.add($, $), M = t.mul(f, $), T = t.mul(b, V), T = t.add(M, T), M = t.sub(J, T), T = t.add(J, T), T = t.mul(M, T), M = t.mul(H, M), $ = t.mul(b, $), V = t.mul(f, V), H = t.sub(F, V), H = t.mul(f, H), H = t.add(H, $), $ = t.add(F, F), F = t.add($, F), F = t.add(F, V), F = t.mul(F, H), T = t.add(T, F), V = t.mul(L, C), V = t.add(V, V), F = t.mul(V, H), M = t.sub(M, F), $ = t.mul(V, J), $ = t.add($, $), $ = t.add($, $), new k(M, T, $);
+      return H = t.add(H, H), $ = t.mul(A, C), $ = t.add($, $), M = t.mul(f, $), T = t.mul(v, V), T = t.add(M, T), M = t.sub(J, T), T = t.add(J, T), T = t.mul(M, T), M = t.mul(H, M), $ = t.mul(v, $), V = t.mul(f, V), H = t.sub(F, V), H = t.mul(f, H), H = t.add(H, $), $ = t.add(F, F), F = t.add($, F), F = t.add(F, V), F = t.mul(F, H), T = t.add(T, F), V = t.mul(L, C), V = t.add(V, V), F = t.mul(V, H), M = t.sub(M, F), $ = t.mul(V, J), $ = t.add($, $), $ = t.add($, $), new k(M, T, $);
     }
     // 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) {
-      v(f);
-      const { X: _, Y: b, Z: A } = this, { X: L, Y: C, Z: M } = f;
+      b(f);
+      const { X: _, Y: v, Z: A } = this, { X: L, Y: C, Z: M } = f;
       let T = t.ZERO, $ = t.ZERO, F = t.ZERO;
       const J = o.a, V = t.mul(o.b, Fe);
-      let H = t.mul(_, L), Z = t.mul(b, C), X = t.mul(A, M), oe = t.add(_, b), j = t.add(L, C);
+      let H = t.mul(_, L), Z = t.mul(v, C), X = t.mul(A, M), oe = t.add(_, v), j = t.add(L, C);
       oe = t.mul(oe, j), j = t.add(H, Z), oe = t.sub(oe, j), j = t.add(_, A);
       let Q = t.add(L, M);
-      return j = t.mul(j, Q), Q = t.add(H, X), j = t.sub(j, Q), Q = t.add(b, A), T = t.add(C, M), Q = t.mul(Q, T), T = t.add(Z, X), Q = t.sub(Q, T), F = t.mul(J, j), T = t.mul(V, X), F = t.add(T, F), T = t.sub(Z, F), F = t.add(Z, F), $ = t.mul(T, F), Z = t.add(H, H), Z = t.add(Z, H), X = t.mul(J, X), j = t.mul(V, j), Z = t.add(Z, X), X = t.sub(H, X), X = t.mul(J, X), j = t.add(j, X), H = t.mul(Z, j), $ = t.add($, H), H = t.mul(Q, j), T = t.mul(oe, T), T = t.sub(T, H), H = t.mul(oe, Z), F = t.mul(Q, F), F = t.add(F, H), new k(T, $, F);
+      return j = t.mul(j, Q), Q = t.add(H, X), j = t.sub(j, Q), Q = t.add(v, A), T = t.add(C, M), Q = t.mul(Q, T), T = t.add(Z, X), Q = t.sub(Q, T), F = t.mul(J, j), T = t.mul(V, X), F = t.add(T, F), T = t.sub(Z, F), F = t.add(Z, F), $ = t.mul(T, F), Z = t.add(H, H), Z = t.add(Z, H), X = t.mul(J, X), j = t.mul(V, j), Z = t.add(Z, X), X = t.sub(H, X), X = t.mul(J, X), j = t.add(j, X), H = t.mul(Z, j), $ = t.add($, H), H = t.mul(Q, j), T = t.mul(oe, T), T = t.sub(T, H), H = t.mul(oe, Z), F = t.mul(Q, F), F = t.add(F, H), new k(T, $, F);
     }
     subtract(f) {
       return this.add(f.negate());
@@ -3658,16 +3658,16 @@ function jr(r, e = {}) {
       const { endo: _ } = e;
       if (!n.isValidNot0(f))
         throw new Error("invalid scalar: out of range");
-      let b, A;
+      let v, A;
       const L = (C) => D.cached(this, C, (M) => $t(k, M));
       if (_) {
         const { k1neg: C, k1: M, k2neg: T, k2: $ } = P(f), { p: F, f: J } = L(M), { p: V, f: H } = L($);
-        A = J.add(H), b = K(_.beta, F, V, C, T);
+        A = J.add(H), v = K(_.beta, F, V, C, T);
       } else {
         const { p: C, f: M } = L(f);
-        b = C, A = M;
+        v = C, A = M;
       }
-      return $t(k, [b, A])[0];
+      return $t(k, [v, A])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -3675,27 +3675,27 @@ function jr(r, e = {}) {
      * an exposed secret key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(f) {
-      const { endo: _ } = e, b = this;
+      const { endo: _ } = e, v = this;
       if (!n.isValid(f))
         throw new Error("invalid scalar: out of range");
-      if (f === pe || b.is0())
+      if (f === pe || v.is0())
         return k.ZERO;
       if (f === Te)
-        return b;
+        return v;
       if (D.hasCache(this))
         return this.multiply(f);
       if (_) {
-        const { k1neg: A, k1: L, k2neg: C, k2: M } = P(f), { p1: T, p2: $ } = Gr(k, b, L, M);
+        const { k1neg: A, k1: L, k2neg: C, k2: M } = P(f), { p1: T, p2: $ } = Gr(k, v, L, M);
         return K(_.beta, T, $, A, C);
       } else
-        return D.unsafe(b, f);
+        return D.unsafe(v, f);
     }
     /**
      * Converts Projective point to affine (x, y) coordinates.
      * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
      */
     toAffine(f) {
-      return R(this, f);
+      return N(this, f);
     }
     /**
      * Checks whether Point is free of torsion elements (is in prime subgroup).
@@ -3820,34 +3820,34 @@ function Jr(r, e, s = {}) {
   }
   function B(f, _) {
     ct(_);
-    const b = x.signature, A = _ === "compact" ? b : _ === "recovered" ? b + 1 : void 0;
+    const v = x.signature, A = _ === "compact" ? v : _ === "recovered" ? v + 1 : void 0;
     return z(f, A);
   }
-  class v {
-    constructor(_, b, A) {
+  class b {
+    constructor(_, v, A) {
       I(this, "r");
       I(this, "s");
       I(this, "recovery");
-      if (this.r = S("r", _), this.s = S("s", b), A != null) {
+      if (this.r = S("r", _), this.s = S("s", v), A != null) {
         if (O(), ![0, 1, 2, 3].includes(A))
           throw new Error("invalid recovery id");
         this.recovery = A;
       }
       Object.freeze(this);
     }
-    static fromBytes(_, b = w.format) {
-      B(_, b);
+    static fromBytes(_, v = w.format) {
+      B(_, v);
       let A;
-      if (b === "der") {
+      if (v === "der") {
         const { r: T, s: $ } = me.toSig(z(_));
-        return new v(T, $);
+        return new b(T, $);
       }
-      b === "recovered" && (A = _[0], b = "compact", _ = _.subarray(1));
+      v === "recovered" && (A = _[0], v = "compact", _ = _.subarray(1));
       const L = x.signature / 2, C = _.subarray(0, L), M = _.subarray(L, L * 2);
-      return new v(i.fromBytes(C), i.fromBytes(M), A);
+      return new b(i.fromBytes(C), i.fromBytes(M), A);
     }
-    static fromHex(_, b) {
-      return this.fromBytes(qe(_), b);
+    static fromHex(_, v) {
+      return this.fromBytes(qe(_), v);
     }
     assertRecovery() {
       const { recovery: _ } = this;
@@ -3856,13 +3856,13 @@ function Jr(r, e, s = {}) {
       return _;
     }
     addRecoveryBit(_) {
-      return new v(this.r, this.s, _);
+      return new b(this.r, this.s, _);
     }
     recoverPublicKey(_) {
-      const { r: b, s: A } = this, L = this.assertRecovery(), C = L === 2 || L === 3 ? b + a : b;
+      const { r: v, s: A } = this, L = this.assertRecovery(), C = L === 2 || L === 3 ? v + a : v;
       if (!o.isValid(C))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const M = o.toBytes(C), T = r.fromBytes(ye(Ss((L & 1) === 0), M)), $ = i.inv(C), F = R(z(_, void 0, "msgHash")), J = i.create(-F * $), V = i.create(A * $), H = r.BASE.multiplyUnsafe(J).add(T.multiplyUnsafe(V));
+      const M = o.toBytes(C), T = r.fromBytes(we(Ss((L & 1) === 0), M)), $ = i.inv(C), F = N(z(_, void 0, "msgHash")), J = i.create(-F * $), V = i.create(A * $), H = r.BASE.multiplyUnsafe(J).add(T.multiplyUnsafe(V));
       if (H.is0())
         throw new Error("invalid recovery: point at infinify");
       return H.assertValidity(), H;
@@ -3874,8 +3874,8 @@ function Jr(r, e, s = {}) {
     toBytes(_ = w.format) {
       if (ct(_), _ === "der")
         return qe(me.hexFromSig(this));
-      const { r: b, s: A } = this, L = i.toBytes(b), C = i.toBytes(A);
-      return _ === "recovered" ? (O(), ye(Uint8Array.of(this.assertRecovery()), L, C)) : ye(L, C);
+      const { r: v, s: A } = this, L = i.toBytes(v), C = i.toBytes(A);
+      return _ === "recovered" ? (O(), we(Uint8Array.of(this.assertRecovery()), L, C)) : we(L, C);
     }
     toHex(_) {
       return Me(this.toBytes(_));
@@ -3884,9 +3884,9 @@ function Jr(r, e, s = {}) {
   const P = s.bits2int || function(_) {
     if (_.length > 8192)
       throw new Error("input is too large");
-    const b = je(_), A = _.length * 8 - c;
-    return A > 0 ? b >> BigInt(A) : b;
-  }, R = s.bits2int_modN || function(_) {
+    const v = je(_), A = _.length * 8 - c;
+    return A > 0 ? v >> BigInt(A) : v;
+  }, N = s.bits2int_modN || function(_) {
     return i.create(P(_));
   }, G = ft(c);
   function K(f) {
@@ -3895,10 +3895,10 @@ function Jr(r, e, s = {}) {
   function W(f, _) {
     return z(f, void 0, "message"), _ ? z(e(f), void 0, "prehashed message") : f;
   }
-  function q(f, _, b) {
-    const { lowS: A, prehash: L, extraEntropy: C } = st(b, w);
+  function q(f, _, v) {
+    const { lowS: A, prehash: L, extraEntropy: C } = st(v, w);
     f = W(f, L);
-    const M = R(f), T = i.fromBytes(_);
+    const M = N(f), T = i.fromBytes(_);
     if (!i.isValidNot0(T))
       throw new Error("invalid private key");
     const $ = [K(T), K(M)];
@@ -3906,7 +3906,7 @@ function Jr(r, e, s = {}) {
       const H = C === !0 ? t(x.secretKey) : C;
       $.push(z(H, void 0, "extraEntropy"));
     }
-    const F = ye(...$), J = M;
+    const F = we(...$), J = M;
     function V(H) {
       const Z = P(H);
       if (!i.isValidNot0(Z))
@@ -3918,34 +3918,34 @@ function Jr(r, e, s = {}) {
       if (Q === pe)
         return;
       let yt = (oe.x === j ? 0 : 2) | Number(oe.y & Te), bt = Q;
-      return A && y(Q) && (bt = i.neg(Q), yt ^= 1), new v(j, bt, E ? void 0 : yt);
+      return A && y(Q) && (bt = i.neg(Q), yt ^= 1), new b(j, bt, E ? void 0 : yt);
     }
     return { seed: F, k2sig: V };
   }
-  function D(f, _, b = {}) {
-    const { seed: A, k2sig: L } = q(f, _, b);
-    return Pr(e.outputLen, i.BYTES, n)(A, L).toBytes(b.format);
+  function D(f, _, v = {}) {
+    const { seed: A, k2sig: L } = q(f, _, v);
+    return Pr(e.outputLen, i.BYTES, n)(A, L).toBytes(v.format);
   }
-  function k(f, _, b, A = {}) {
+  function k(f, _, v, A = {}) {
     const { lowS: L, prehash: C, format: M } = st(A, w);
-    if (b = z(b, void 0, "publicKey"), _ = W(_, C), !ut(f)) {
-      const T = f instanceof v ? ", use sig.toBytes()" : "";
+    if (v = z(v, void 0, "publicKey"), _ = W(_, C), !ut(f)) {
+      const T = f instanceof b ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + T);
     }
     B(f, M);
     try {
-      const T = v.fromBytes(f, M), $ = r.fromBytes(b);
+      const T = b.fromBytes(f, M), $ = r.fromBytes(v);
       if (L && T.hasHighS())
         return !1;
-      const { r: F, s: J } = T, V = R(_), H = i.inv(J), Z = i.create(V * H), X = i.create(F * H), oe = r.BASE.multiplyUnsafe(Z).add($.multiplyUnsafe(X));
+      const { r: F, s: J } = T, V = N(_), H = i.inv(J), Z = i.create(V * H), X = i.create(F * H), oe = r.BASE.multiplyUnsafe(Z).add($.multiplyUnsafe(X));
       return oe.is0() ? !1 : i.create(oe.x) === F;
     } catch {
       return !1;
     }
   }
-  function N(f, _, b = {}) {
-    const { prehash: A } = st(b, w);
-    return _ = W(_, A), v.fromBytes(f, "recovered").recoverPublicKey(_).toBytes();
+  function R(f, _, v = {}) {
+    const { prehash: A } = st(v, w);
+    return _ = W(_, A), b.fromBytes(f, "recovered").recoverPublicKey(_).toBytes();
   }
   return Object.freeze({
     keygen: l,
@@ -3956,8 +3956,8 @@ function Jr(r, e, s = {}) {
     Point: r,
     sign: D,
     verify: k,
-    recoverPublicKey: N,
-    Signature: v,
+    recoverPublicKey: R,
+    Signature: b,
     hash: e
   });
 }
@@ -3978,10 +3978,10 @@ const gt = {
   ]
 }, Gt = /* @__PURE__ */ BigInt(2);
 function Xr(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, d = l * l * r % e, h = ae(d, s, e) * d % e, m = ae(h, s, e) * d % e, x = ae(m, Gt, e) * l % e, w = ae(x, n, e) * x % e, E = ae(w, o, e) * w % e, y = ae(E, a, e) * E % e, S = ae(y, c, e) * y % e, O = ae(S, a, e) * E % e, B = ae(O, s, e) * d % e, v = ae(B, i, e) * w % e, P = ae(v, t, e) * l % e, R = ae(P, Gt, e);
-  if (!lt.eql(lt.sqr(R), 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, d = l * l * r % e, h = ae(d, s, e) * d % e, m = ae(h, s, e) * d % e, x = ae(m, Gt, e) * l % e, w = ae(x, n, e) * x % e, E = ae(w, o, e) * w % e, y = ae(E, a, e) * E % e, S = ae(y, c, e) * y % e, O = ae(S, a, e) * E % e, B = ae(O, s, e) * d % e, b = ae(B, i, e) * w % e, P = ae(b, t, e) * l % e, N = ae(P, Gt, e);
+  if (!lt.eql(lt.sqr(N), r))
     throw new Error("Cannot find square root");
-  return R;
+  return N;
 }
 const lt = Ye(gt.p, { sqrt: Xr }), Qr = /* @__PURE__ */ jr(gt, {
   Fp: lt,
@@ -4187,7 +4187,7 @@ class fn {
     }
   }
 }
-class we {
+class be {
   static generateRandom16Hex() {
     const e = new Uint8Array(16);
     return crypto.getRandomValues(e), Array.from(e, (s) => s.toString(16).padStart(2, "0")).join("");
@@ -4211,7 +4211,7 @@ class we {
    * - Google 및 기타: originalNonce === jwt.nonce
    */
   static async verifyIdTokenNonce(e, s) {
-    const t = we.parseJwtPayload(e), n = t.nonce, o = typeof t.iss == "string" ? t.iss : "(unknown)";
+    const t = be.parseJwtPayload(e), n = t.nonce, o = typeof t.iss == "string" ? t.iss : "(unknown)";
     if (u.log("[CROSSx] nonce 검증 시작 —", {
       iss: o,
       nonceClaimType: typeof n,
@@ -4233,7 +4233,7 @@ class we {
         "ID Token에 nonce claim이 없습니다 — OAuth 서버 설정을 확인해 주세요"
       );
     if (o.includes("appleid.apple.com")) {
-      const i = await we.sha256Hex(s);
+      const i = await be.sha256Hex(s);
       if (u.log("[CROSSx] Apple nonce 검증 —", {
         expectedHashLength: i.length,
         receivedHashLength: n.length,
@@ -4250,7 +4250,7 @@ class we {
   }
   openAuth(e) {
     return new Promise((s, t) => {
-      const n = Math.max(e.width ?? 500, 500), o = Math.max(e.height ?? 700, 700), i = window.screenX + (window.outerWidth - n) / 2, a = window.screenY + (window.outerHeight - o) / 2, c = we.generateRandom16Hex(), l = we.generateRandom16Hex(), d = e.authUrl.includes("?") ? "&" : "?", h = `${e.authUrl}${d}state=${c}&nonce=${l}`;
+      const n = Math.max(e.width ?? 500, 500), o = Math.max(e.height ?? 700, 700), i = window.screenX + (window.outerWidth - n) / 2, a = window.screenY + (window.outerHeight - o) / 2, c = be.generateRandom16Hex(), l = be.generateRandom16Hex(), d = e.authUrl.includes("?") ? "&" : "?", h = `${e.authUrl}${d}state=${c}&nonce=${l}`;
       u.log("[CROSSx] OAuth 팝업 열기 — state, nonce 생성 완료:", {
         stateLength: c.length,
         nonceLength: l.length,
@@ -4266,62 +4266,47 @@ class we {
         return;
       }
       const x = setTimeout(() => {
-        u.warn("[CROSSx] OAuth 타임아웃 (5분) — postMessage를 수신하지 못했습니다"), v(), t(new Error("Authentication timeout"));
+        u.warn("[CROSSx] OAuth 타임아웃 (5분) — postMessage를 수신하지 못했습니다"), b(), t(new Error("Authentication timeout"));
       }, 5 * 60 * 1e3), w = 10, E = 30;
       let y = 0, S = null;
       const O = () => {
         clearInterval(B), u.warn("[CROSSx] COOP 감지 — OAuth 서버 응답을 " + E + "초간 대기합니다"), S = setTimeout(() => {
-          v(), t(new Error(
+          b(), t(new Error(
             "OAuth 서버로부터 응답을 받지 못했습니다. 브라우저 보안 정책(COOP)으로 인해 팝업 통신이 차단되었을 수 있습니다. 다시 시도해 주세요."
           ));
         }, E * 1e3);
       }, B = setInterval(() => {
         y++;
         try {
-          m.closed && (y <= w ? O() : (v(), t(new Error("로그인이 취소되었습니다"))));
+          m.closed && (y <= w ? O() : (b(), t(new Error("로그인이 취소되었습니다"))));
         } catch {
           O();
         }
-      }, 1e3), v = () => {
+      }, 1e3), b = () => {
         clearTimeout(x), clearInterval(B), S && clearTimeout(S), window.removeEventListener("message", P);
-      }, P = (R) => {
+      }, P = (N) => {
         var K, W, q, D, k;
-        if (R.origin !== e.expectedOrigin) return;
-        v(), u.log("[CROSSx] OAuth postMessage 수신 — status:", R.data.status);
-        const G = R.data.state ?? ((K = R.data.data) == null ? void 0 : K.state);
+        if (N.origin !== e.expectedOrigin) return;
+        b(), u.log("[CROSSx] OAuth postMessage 수신 — status:", N.data.status);
+        const G = N.data.state ?? ((K = N.data.data) == null ? void 0 : K.state);
         if (!G || G !== c) {
           t(new Error("OAuth state mismatch — possible CSRF attack"));
           return;
         }
-        if (R.data.status === "success") {
-          const N = (W = R.data.data) == null ? void 0 : W.idToken, f = (q = R.data.data) == null ? void 0 : q.accessToken, _ = f ?? N;
+        if (N.data.status === "success") {
+          const R = (W = N.data.data) == null ? void 0 : W.idToken, f = (q = N.data.data) == null ? void 0 : q.accessToken, _ = f ?? R;
           if (u.log("[CROSSx] OAuth 토큰 수신:", {
             hasAccessToken: !!f,
-            hasIdToken: !!N
+            hasIdToken: !!R
           }), !_) {
-            u.error("[CROSSx] 토큰을 찾을 수 없음:", R.data), t(new Error("Token not found in response"));
+            u.error("[CROSSx] 토큰을 찾을 수 없음:", N.data), t(new Error("Token not found in response"));
             return;
           }
-          if (N) {
-            try {
-              const b = we.parseJwtPayload(N);
-              u.log("[CROSSx] idToken JWT payload 요약:", {
-                iss: b.iss,
-                sub: typeof b.sub == "string" ? `${b.sub.slice(0, 6)}...` : "(absent)",
-                hasNonceClaim: "nonce" in b,
-                nonceClaimType: typeof b.nonce,
-                appleNonceSupported: b.nonce_supported ?? "(field absent)"
-              });
-            } catch {
-              u.warn("[CROSSx] idToken JWT payload 파싱 실패 — 토큰 형식을 확인하세요");
-            }
-            we.verifyIdTokenNonce(N, l).then(() => s(_)).catch((b) => {
-              u.error("[CROSSx] nonce 검증 실패:", b), t(b instanceof Error ? b : new Error("nonce verification failed"));
-            });
-          } else
-            s(_);
+          R ? be.verifyIdTokenNonce(R, l).then(() => s(_)).catch((v) => {
+            u.error("[CROSSx] nonce 검증 실패:", v), t(v instanceof Error ? v : new Error("nonce verification failed"));
+          }) : s(_);
         } else
-          u.error("[CROSSx] OAuth 실패:", (D = R.data.data) == null ? void 0 : D.error), t(new Error(((k = R.data.data) == null ? void 0 : k.error) || "Authentication failed"));
+          u.error("[CROSSx] OAuth 실패:", (D = N.data.data) == null ? void 0 : D.error), t(new Error(((k = N.data.data) == null ? void 0 : k.error) || "Authentication failed"));
       };
       window.addEventListener("message", P);
     });
@@ -4517,8 +4502,7 @@ class Le {
             code: d.code,
             message: h,
             url: o,
-            method: e,
-            fullResponse: d
+            method: e
           });
           const m = Le.mapGatewayError(d.code, d.data), x = Le.getGatewayErrorMessage(d.code, h), w = d.data, E = m === p.PIN_LOCKED ? Le.extractLockDetails(w) : w ?? void 0, y = new g(m, x, E);
           throw y.gatewayCode = d.code, y.gatewayMessage = h, m === p.AUTH_NOT_AUTHENTICATED && this._onUnauthorized && (u.warn("[CROSSx] Gateway -10002 감지 — 강제 로그아웃 실행"), this._onUnauthorized()), y;
@@ -4673,7 +4657,7 @@ class Le {
     )).txHash };
   }
   async migrateWallet(e, s) {
-    u.log("[CROSSx][Migration Phase 4] POST /mnemonic/migrate 호출 — sub:", s);
+    u.log("[CROSSx][Migration Phase 4] POST /mnemonic/migrate 호출");
     const t = { recoveryPin: e, sub: s, password: this.requirePin() }, n = await this.request(
       "POST",
       "/mnemonic/migrate",
@@ -7331,24 +7315,24 @@ function qn(r) {
 }
 function ot(r, e, s, t, n, o) {
   let i = !!(o && o > Date.now()), a = !1;
-  const c = () => Array.from(r.querySelectorAll(".__crossx-pin6-box")), l = () => r.querySelector("#__crossx-pin6-boxes"), d = () => r.querySelector("#__crossx-pin6-error"), h = () => r.querySelector("#__crossx-pin6-lock-msg"), m = () => r.querySelector("#__crossx-pin6-lock-countdown"), x = () => r.querySelector(".__crossx-pin6-body"), w = () => c().map((v) => v.value).join(""), E = (v) => {
-    i = v, c().forEach((P) => {
-      P.disabled = v, P.classList.toggle("--locked", v);
+  const c = () => Array.from(r.querySelectorAll(".__crossx-pin6-box")), l = () => r.querySelector("#__crossx-pin6-boxes"), d = () => r.querySelector("#__crossx-pin6-error"), h = () => r.querySelector("#__crossx-pin6-lock-msg"), m = () => r.querySelector("#__crossx-pin6-lock-countdown"), x = () => r.querySelector(".__crossx-pin6-body"), w = () => c().map((b) => b.value).join(""), E = (b) => {
+    i = b, c().forEach((P) => {
+      P.disabled = b, P.classList.toggle("--locked", b);
     });
   }, y = () => {
-    const v = d();
-    v && (v.textContent = "");
-  }, S = (v) => {
+    const b = d();
+    b && (b.textContent = "");
+  }, S = (b) => {
     const P = d();
-    P && (P.textContent = v);
-    const R = l();
-    R == null || R.classList.add("--shake"), setTimeout(() => R == null ? void 0 : R.classList.remove("--shake"), 500), c().forEach((G) => {
+    P && (P.textContent = b);
+    const N = l();
+    N == null || N.classList.add("--shake"), setTimeout(() => N == null ? void 0 : N.classList.remove("--shake"), 500), c().forEach((G) => {
       G.value = "";
     }), setTimeout(() => {
       var G;
       return (G = c()[0]) == null ? void 0 : G.focus();
     }, 50);
-  }, O = (v) => {
+  }, O = (b) => {
     var W;
     E(!0), c().forEach((q) => {
       q.value = "";
@@ -7360,32 +7344,32 @@ function ot(r, e, s, t, n, o) {
       const D = d();
       D ? D.insertAdjacentElement("afterend", q) : (W = x()) == null || W.appendChild(q);
     }
-    const R = () => {
+    const N = () => {
       var k;
-      const q = v - Date.now(), D = m();
+      const q = b - Date.now(), D = m();
       q <= 0 ? (clearInterval(G), E(!1), (k = h()) == null || k.remove(), P && (P.textContent = ""), setTimeout(() => {
-        var N;
-        return (N = c()[0]) == null ? void 0 : N.focus();
+        var R;
+        return (R = c()[0]) == null ? void 0 : R.focus();
       }, 50)) : D && (D.textContent = ` ${qn(q)}`);
-    }, G = setInterval(R, 1e3);
-    R();
+    }, G = setInterval(N, 1e3);
+    N();
     const K = new MutationObserver(() => {
       document.contains(r) || (clearInterval(G), K.disconnect());
     });
     K.observe(document.body, { childList: !0, subtree: !1 });
   }, B = async () => {
     if (i || a) return;
-    const v = w();
-    if (v.length === 6) {
+    const b = w();
+    if (b.length === 6) {
       a = !0, c().forEach((P) => {
         P.disabled = !0;
       });
       try {
         if (n) {
-          const P = await n(v);
-          P.ok ? e(v) : P.lockExpiresAt ? O(P.lockExpiresAt) : S(P.error ?? "Incorrect PIN. Please try again.");
+          const P = await n(b);
+          P.ok ? e(b) : P.lockExpiresAt ? O(P.lockExpiresAt) : S(P.error ?? "Incorrect PIN. Please try again.");
         } else
-          e(v);
+          e(b);
       } catch (P) {
         t && t(P);
       } finally {
@@ -7396,33 +7380,33 @@ function ot(r, e, s, t, n, o) {
     }
   };
   o && o > Date.now() ? O(o) : setTimeout(() => {
-    var v;
-    return (v = c()[0]) == null ? void 0 : v.focus();
-  }, 100), c().forEach((v, P) => {
-    v.addEventListener("input", () => {
+    var b;
+    return (b = c()[0]) == null ? void 0 : b.focus();
+  }, 100), c().forEach((b, P) => {
+    b.addEventListener("input", () => {
       var G;
-      const R = v.value.replace(/\D/g, "").slice(-1);
-      v.value = R, y(), R && P < 5 && ((G = c()[P + 1]) == null || G.focus()), w().length === 6 && setTimeout(B, 80);
-    }), v.addEventListener("keydown", (R) => {
+      const N = b.value.replace(/\D/g, "").slice(-1);
+      b.value = N, y(), N && P < 5 && ((G = c()[P + 1]) == null || G.focus()), w().length === 6 && setTimeout(B, 80);
+    }), b.addEventListener("keydown", (N) => {
       var G, K;
-      if (R.key === "Backspace") {
-        if (R.preventDefault(), v.value)
-          v.value = "";
+      if (N.key === "Backspace") {
+        if (N.preventDefault(), b.value)
+          b.value = "";
         else if (P > 0) {
           const W = c()[P - 1];
           W.value = "", W.focus();
         }
-      } else R.key === "ArrowLeft" && P > 0 ? (R.preventDefault(), (G = c()[P - 1]) == null || G.focus()) : R.key === "ArrowRight" && P < 5 ? (R.preventDefault(), (K = c()[P + 1]) == null || K.focus()) : R.key === "Escape" && s();
-    }), v.addEventListener("paste", (R) => {
+      } else N.key === "ArrowLeft" && P > 0 ? (N.preventDefault(), (G = c()[P - 1]) == null || G.focus()) : N.key === "ArrowRight" && P < 5 ? (N.preventDefault(), (K = c()[P + 1]) == null || K.focus()) : N.key === "Escape" && s();
+    }), b.addEventListener("paste", (N) => {
       var W, q;
-      R.preventDefault();
-      const G = (((W = R.clipboardData) == null ? void 0 : W.getData("text")) ?? "").replace(/\D/g, "").slice(0, 6);
+      N.preventDefault();
+      const G = (((W = N.clipboardData) == null ? void 0 : W.getData("text")) ?? "").replace(/\D/g, "").slice(0, 6);
       if (!G) return;
       const K = c();
       G.split("").forEach((D, k) => {
         K[k] && (K[k].value = D);
       }), (q = K[Math.min(G.length - 1, 5)]) == null || q.focus(), y(), w().length === 6 && setTimeout(B, 80);
-    }), v.addEventListener("focus", () => v.select());
+    }), b.addEventListener("focus", () => b.select());
   });
 }
 const Rs = `<svg width="20" height="20" viewBox="0 0 20 20" fill="none" xmlns="http://www.w3.org/2000/svg">
@@ -7620,8 +7604,8 @@ class jn {
         x.innerHTML = nt({
           title: i.title,
           headerSubtitle: i.headerSubtitle
-        }), (B = x.querySelector("#__crossx-close-btn")) == null || B.addEventListener("click", m), ot(x, (v) => {
-          v === O ? h(O) : y(o.mismatchError);
+        }), (B = x.querySelector("#__crossx-close-btn")) == null || B.addEventListener("click", m), ot(x, (b) => {
+          b === O ? h(O) : y(o.mismatchError);
         }, m);
       }, y = (O) => {
         var B;
@@ -7630,42 +7614,42 @@ class jn {
           headerSubtitle: o.headerSubtitle,
           subtitle: o.subtitle,
           errorMessage: O
-        }), (B = x.querySelector("#__crossx-close-btn")) == null || B.addEventListener("click", m), ot(x, (v) => {
-          const P = Wn(v, w);
-          P ? y(P) : E(v);
+        }), (B = x.querySelector("#__crossx-close-btn")) == null || B.addEventListener("click", m), ot(x, (b) => {
+          const P = Wn(b, w);
+          P ? y(P) : E(b);
         }, m);
       };
       (() => {
         var q;
-        const O = Array.from(x.querySelectorAll(".__crossx-pw-notice-item")), B = x.querySelector("#__crossx-pin-notice-next"), v = /* @__PURE__ */ new Set();
+        const O = Array.from(x.querySelectorAll(".__crossx-pw-notice-item")), B = x.querySelector("#__crossx-pin-notice-next"), b = /* @__PURE__ */ new Set();
         B.removeAttribute("disabled");
-        const P = B.dataset.nextLabel ?? "Next", R = B.dataset.submitLabel ?? "I Understand", G = () => {
-          const D = v.size === O.length;
-          B.classList.toggle("--disabled", !D), B.textContent = D ? R : P;
+        const P = B.dataset.nextLabel ?? "Next", N = B.dataset.submitLabel ?? "I Understand", G = () => {
+          const D = b.size === O.length;
+          B.classList.toggle("--disabled", !D), B.textContent = D ? N : P;
         }, K = (D, k) => {
-          if (v.has(k)) return;
-          const N = D.querySelector(`#__crossx-notice-check-${k}`);
-          v.add(k), N.classList.add("--checked"), D.setAttribute("aria-checked", "true"), G();
+          if (b.has(k)) return;
+          const R = D.querySelector(`#__crossx-notice-check-${k}`);
+          b.add(k), R.classList.add("--checked"), D.setAttribute("aria-checked", "true"), G();
         }, W = (D, k) => {
-          if (!v.has(k)) return;
-          const N = D.querySelector(`#__crossx-notice-check-${k}`);
-          v.delete(k), N.classList.remove("--checked"), D.setAttribute("aria-checked", "false"), G();
+          if (!b.has(k)) return;
+          const R = D.querySelector(`#__crossx-notice-check-${k}`);
+          b.delete(k), R.classList.remove("--checked"), D.setAttribute("aria-checked", "false"), G();
         };
         O.forEach((D) => {
           const k = parseInt(D.dataset.checkIndex ?? "0", 10);
           D.addEventListener("click", () => {
-            v.has(k) ? W(D, k) : K(D, k);
-          }), D.addEventListener("keydown", (N) => {
-            (N.key === " " || N.key === "Enter") && (N.preventDefault(), v.has(k) ? W(D, k) : K(D, k));
+            b.has(k) ? W(D, k) : K(D, k);
+          }), D.addEventListener("keydown", (R) => {
+            (R.key === " " || R.key === "Enter") && (R.preventDefault(), b.has(k) ? W(D, k) : K(D, k));
           });
         }), B.addEventListener("click", () => {
-          if (v.size === O.length) {
+          if (b.size === O.length) {
             y(e == null ? void 0 : e.errorMessage);
             return;
           }
-          const D = O.find((N) => {
-            const f = parseInt(N.dataset.checkIndex ?? "0", 10);
-            return !v.has(f);
+          const D = O.find((R) => {
+            const f = parseInt(R.dataset.checkIndex ?? "0", 10);
+            return !b.has(f);
           });
           if (!D) return;
           const k = parseInt(D.dataset.checkIndex ?? "0", 10);
@@ -7861,38 +7845,38 @@ class Yn {
     return this._accessToken !== null;
   }
 }
-function Qn(r) {
+function Qn(r, e) {
   r.debug;
-  const e = We.production, s = {
+  const s = We.production, t = {
     ...r,
-    oauthServiceUrl: e.oauthServiceUrl,
-    authApiUrl: e.authApiUrl,
-    walletGatewayUrl: e.walletGatewayUrl
-  }, t = {
-    gatewayUrl: e.walletGatewayUrl,
+    oauthServiceUrl: s.oauthServiceUrl,
+    authApiUrl: s.authApiUrl,
+    walletGatewayUrl: s.walletGatewayUrl
+  }, n = {
+    gatewayUrl: s.walletGatewayUrl,
     projectId: r.projectId
-  }, o = s.authMode !== "cookie" && Nt.isAvailable() ? new Nt() : new sr(), i = new un(), a = new fn(), c = new we(), l = new Yn(), d = new Xt();
-  let h;
-  r.useMockWallet ? (u.log("[CROSSx] Mock Wallet Provider 사용"), h = new _n(o, d)) : (u.log("[CROSSx] Remote Wallet Provider 사용"), h = new Le(
-    t,
-    o,
-    a,
-    l,
-    d
+  }, i = t.authMode !== "cookie" && Nt.isAvailable() ? new Nt() : new sr(), a = new un(), c = new fn(), l = new be(), d = new Yn(), h = new Xt();
+  let m;
+  r.useMockWallet ? (u.log("[CROSSx] Mock Wallet Provider 사용"), m = new _n(i, h)) : (u.log("[CROSSx] Remote Wallet Provider 사용"), m = new Le(
+    n,
+    i,
+    c,
+    d,
+    h
   ));
-  const m = new De(t, a), x = new jn(r.theme ?? "light", r.themeTokens);
+  const x = new De(n, c), w = new jn(r.theme ?? "light", r.themeTokens), E = e != null && e.wrapConfirmation ? e.wrapConfirmation(w) : w;
   return new it(
-    s,
     t,
-    o,
+    n,
     i,
     a,
     c,
-    h,
     l,
-    x,
     m,
-    d
+    d,
+    E,
+    x,
+    h
   );
 }
 export {