@nexus-cross/crossx-sdk-core 2.2.3-beta.1 → 2.2.3-beta.3

package/dist/index.js

@@ -657,18 +657,18 @@ const Bt = "crossx_access_token", Mt = "crossx_refresh_token", Ft = "crossx_user
       try {
         const I = this.crypto.decodeJWT(e);
         d.log("[CROSSx] Firebase JWT 필드:", Object.keys(I).join(", ")), x = (i = I.firebase) == null ? void 0 : i.sign_in_provider;
-        const O = ((o = I.firebase) == null ? void 0 : o.identities) ?? {};
-        w = I.email ?? ((a = O.email) == null ? void 0 : a[0]), x === "google.com" ? _ = (c = O["google.com"]) == null ? void 0 : c[0] : x === "apple.com" && (_ = (l = O["apple.com"]) == null ? void 0 : l[0]), d.log("[CROSSx] OAuth provider sub 추출 — provider:", x, "hasProviderSub:", !!_, "email:", w ?? "(없음)");
+        const C = ((o = I.firebase) == null ? void 0 : o.identities) ?? {};
+        w = I.email ?? ((a = C.email) == null ? void 0 : a[0]), x === "google.com" ? _ = (c = C["google.com"]) == null ? void 0 : c[0] : x === "apple.com" && (_ = (l = C["apple.com"]) == null ? void 0 : l[0]), d.log("[CROSSx] OAuth provider sub 추출 — provider:", x, "hasProviderSub:", !!_, "email:", w ?? "(없음)");
       } catch {
         d.warn("[CROSSx] firebaseToken에서 providerSub 추출 실패");
       }
       if (p) {
         const I = this.crypto.decodeJWT(p);
         d.log("[CROSSx] access_token 디코딩 — sub:", I.sub, "exp:", I.exp, "필드:", Object.keys(I).join(", "));
-        const O = await this.crypto.verifyJWT(p);
-        if (n = O.signatureVerified ?? !1, !O.valid)
+        const C = await this.crypto.verifyJWT(p);
+        if (n = C.signatureVerified ?? !1, !C.valid)
           throw d.error("[CROSSx] access_token 검증 실패"), new Error("유효하지 않은 access token");
-        const R = O.payload, L = R.email ?? w ?? r;
+        const R = C.payload, L = R.email ?? w ?? r;
         d.log(
           "[CROSSx] email 소스 — CROSSx JWT:",
           R.email ?? "(없음)",
@@ -1406,7 +1406,7 @@ function Ge(s, e, r, t = Et) {
       return;
     }
 }
-function Os(s) {
+function Cs(s) {
   const e = s.startsWith("0x") ? s.slice(2) : s;
   if (!/^[0-9a-fA-F]+$/.test(e))
     throw new f(
@@ -1419,7 +1419,7 @@ function Os(s) {
       `서명 길이가 유효하지 않습니다: ${Wt} hex 문자(65 바이트) 예상, 현재 ${e.length}`
     );
 }
-function Cs(s) {
+function Os(s) {
   const e = s.startsWith("0x") ? s.slice(2) : s;
   if (!/^[0-9a-fA-F]+$/.test(e))
     throw new f(
@@ -1466,7 +1466,7 @@ function Ls(s) {
   const t = Number(r);
   return Number.isFinite(t) ? t : void 0;
 }
-class Ce {
+class Oe {
   constructor(e) {
     this.deps = e, this.verifyPinMutex = null;
   }
@@ -1539,7 +1539,7 @@ class Ce {
               if (u.code === h.PIN_INVALID)
                 return { ok: !1, error: u.message };
               if (u.code === h.PIN_LOCKED)
-                return Ce.buildPinLockedResult(u, a);
+                return Oe.buildPinLockedResult(u, a);
             }
             throw u;
           }
@@ -1573,7 +1573,7 @@ class Ce {
       return await e();
     } catch (n) {
       if (n instanceof f) {
-        if (t = Ce.parsePinError(n, r), !t) throw n;
+        if (t = Oe.parsePinError(n, r), !t) throw n;
       } else
         throw n;
     }
@@ -1587,7 +1587,7 @@ class Ce {
       try {
         return await e();
       } catch (n) {
-        if (n instanceof f && (t = Ce.parsePinError(n, r), t))
+        if (n instanceof f && (t = Oe.parsePinError(n, r), t))
           continue;
         throw n;
       }
@@ -1612,7 +1612,7 @@ class Ce {
     return null;
   }
   static buildPinLockedResult(e, r) {
-    const t = Ce.parsePinError(e, r);
+    const t = Oe.parsePinError(e, r);
     if (!t) return { ok: !1, error: e.message };
     const { errorMessage: n, ...i } = t;
     return { ok: !1, error: n, ...i };
@@ -2322,7 +2322,7 @@ const Te = class Te extends ys {
       walletPreferenceKey: Te.WALLET_PREF_KEY,
       storage: this.storage,
       pinStore: this.pinStore
-    }), this.pinOrchestrator = new Ce({
+    }), this.pinOrchestrator = new Oe({
       confirmation: this.confirmation,
       walletProvider: this.walletProvider,
       pinStore: this.pinStore,
@@ -3174,7 +3174,7 @@ const Te = class Te extends ys {
           n.address
         )
       });
-      return Os(i.signature), {
+      return Cs(i.signature), {
         chainId: e,
         signature: i.signature,
         address: n.address
@@ -3252,7 +3252,7 @@ const Te = class Te extends ys {
           a
         )
       });
-      return Cs(o.signature), {
+      return Os(o.signature), {
         chainId: e,
         signedTx: o.signature,
         txHash: o.txHash ?? ""
@@ -3391,7 +3391,7 @@ const Te = class Te extends ys {
     let g, _;
     const x = this.waitForTxAndGetReceipt(a, e, { intervalMs: c, timeoutMs: l }).then((I) => {
       g = I;
-      const O = BigInt(I.gasUsed) * BigInt(I.effectiveGasPrice), R = r.value ? BigInt(r.value) : 0n, L = Ge(r.value, u.symbol, u.decimals, this._config.displayDecimals), M = Ge("0x" + O.toString(16), u.symbol, u.decimals, this._config.displayDecimals), q = Ge("0x" + (R + O).toString(16), u.symbol, u.decimals, this._config.displayDecimals);
+      const C = BigInt(I.gasUsed) * BigInt(I.effectiveGasPrice), R = r.value ? BigInt(r.value) : 0n, L = Ge(r.value, u.symbol, u.decimals, this._config.displayDecimals), M = Ge("0x" + C.toString(16), u.symbol, u.decimals, this._config.displayDecimals), q = Ge("0x" + (R + C).toString(16), u.symbol, u.decimals, this._config.displayDecimals);
       return {
         chainId: e,
         txHash: a,
@@ -4480,17 +4480,17 @@ function bn(s, e, r) {
     const I = [];
     for (; S < e; ) {
       c = g();
-      const O = c.slice();
-      I.push(O), S += c.length;
+      const C = c.slice();
+      I.push(C), S += c.length;
     }
     return Se(...I);
   };
   return (S, I) => {
     p(), _(S);
-    let O;
-    for (; !(O = I(x())); )
+    let C;
+    for (; !(C = I(x())); )
       _();
-    return p(), O;
+    return p(), C;
   };
 }
 function Rt(s, e = {}, r = {}) {
@@ -4547,7 +4547,7 @@ function Nt(s, e, r) {
   if (!s.eql(s.sqr(e), r))
     throw new Error("Cannot find square root");
 }
-function Or(s, e) {
+function Cr(s, e) {
   const r = (s.ORDER + te) / Tr, t = s.pow(e, r);
   return Nt(s, t, e), t;
 }
@@ -4556,7 +4556,7 @@ function En(s, e) {
   return Nt(s, a, e), a;
 }
 function An(s) {
-  const e = rt(s), r = Cr(s), t = r(e, e.neg(e.ONE)), n = r(e, t), i = r(e, e.neg(t)), o = (s + vn) / Nr;
+  const e = rt(s), r = Or(s), t = r(e, e.neg(e.ONE)), n = r(e, t), i = r(e, e.neg(t)), o = (s + vn) / Nr;
   return (a, c) => {
     let l = a.pow(c, o), u = a.mul(l, t);
     const p = a.mul(l, n), g = a.mul(l, i), _ = a.eql(a.sqr(u), c), x = a.eql(a.sqr(p), c);
@@ -4565,7 +4565,7 @@ function An(s) {
     return Nt(a, S, c), S;
   };
 }
-function Cr(s) {
+function Or(s) {
   if (s < Ir)
     throw new Error("sqrt is not defined for small field");
   let e = s - te, r = 0;
@@ -4577,7 +4577,7 @@ function Cr(s) {
     if (t++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
   if (r === 1)
-    return Or;
+    return Cr;
   let i = n.pow(t, e);
   const o = (e + te) / ke;
   return function(c, l) {
@@ -4600,7 +4600,7 @@ function Cr(s) {
   };
 }
 function In(s) {
-  return s % Tr === Ir ? Or : s % Rr === kr ? En : s % Nr === Sn ? An(s) : Cr(s);
+  return s % Tr === Ir ? Cr : s % Rr === kr ? En : s % Nr === Sn ? An(s) : Or(s);
 }
 const Tn = [
   "create",
@@ -4656,7 +4656,7 @@ function Nn(s, e) {
   const r = e !== void 0 ? e : s.toString(2).length, t = Math.ceil(r / 8);
   return { nBitLength: r, nByteLength: t };
 }
-class On {
+class Cn {
   constructor(e, r = {}) {
     P(this, "ORDER");
     P(this, "BITS");
@@ -4769,7 +4769,7 @@ class On {
   }
 }
 function rt(s, e = {}) {
-  return new On(s, e);
+  return new Cn(s, e);
 }
 function Lr(s) {
   if (typeof s != "bigint")
@@ -4781,7 +4781,7 @@ function Dr(s) {
   const e = Lr(s);
   return e + Math.ceil(e / 2);
 }
-function Cn(s, e, r = !1) {
+function On(s, e, r = !1) {
   V(s);
   const t = s.length, n = Lr(e), i = Dr(e);
   if (t < 16 || t < i || t > 1024)
@@ -5132,18 +5132,18 @@ function Un(s, e = {}) {
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
   function p(F, m, y) {
-    const { x: k, y: C } = m.toAffine(), B = t.toBytes(k);
+    const { x: k, y: O } = m.toAffine(), B = t.toBytes(k);
     if (Xe(y, "isCompressed"), y) {
       u();
-      const b = !t.isOdd(C);
+      const b = !t.isOdd(O);
       return Se(Hr(b), B);
     } else
-      return Se(Uint8Array.of(4), B, t.toBytes(C));
+      return Se(Uint8Array.of(4), B, t.toBytes(O));
   }
   function g(F) {
     V(F, void 0, "Point");
-    const { publicKey: m, publicKeyUncompressed: y } = l, k = F.length, C = F[0], B = F.subarray(1);
-    if (k === m && (C === 2 || C === 3)) {
+    const { publicKey: m, publicKeyUncompressed: y } = l, k = F.length, O = F[0], B = F.subarray(1);
+    if (k === m && (O === 2 || O === 3)) {
       const b = t.fromBytes(B);
       if (!t.isValid(b))
         throw new Error("bad point: is not on curve, wrong x");
@@ -5157,8 +5157,8 @@ function Un(s, e = {}) {
       }
       u();
       const T = t.isOdd(E);
-      return (C & 1) === 1 !== T && (E = t.neg(E)), { x: b, y: E };
-    } else if (k === y && C === 4) {
+      return (O & 1) === 1 !== T && (E = t.neg(E)), { x: b, y: E };
+    } else if (k === y && O === 4) {
       const b = t.BYTES, v = t.fromBytes(B.subarray(0, b)), E = t.fromBytes(B.subarray(b, b * 2));
       if (!S(v, E))
         throw new Error("bad point: is not on curve");
@@ -5177,8 +5177,8 @@ function Un(s, e = {}) {
   }
   if (!S(i.Gx, i.Gy))
     throw new Error("bad curve params: generator point");
-  const I = t.mul(t.pow(i.a, ze), Fn), O = t.mul(t.sqr(i.b), BigInt(27));
-  if (t.is0(t.add(I, O)))
+  const I = t.mul(t.pow(i.a, ze), Fn), C = t.mul(t.sqr(i.b), BigInt(27));
+  if (t.is0(t.add(I, C)))
     throw new Error("bad curve params: a or b");
   function R(F, m, y = !1) {
     if (!t.isValid(m) || y && t.is0(m))
@@ -5195,12 +5195,12 @@ function Un(s, e = {}) {
     return Bn(F, c.basises, n.ORDER);
   }
   const q = Xt((F, m) => {
-    const { X: y, Y: k, Z: C } = F;
-    if (t.eql(C, t.ONE))
+    const { X: y, Y: k, Z: O } = F;
+    if (t.eql(O, t.ONE))
       return { x: y, y: k };
     const B = F.is0();
-    m == null && (m = B ? t.ONE : t.inv(C));
-    const b = t.mul(y, m), v = t.mul(k, m), E = t.mul(C, m);
+    m == null && (m = B ? t.ONE : t.inv(O));
+    const b = t.mul(y, m), v = t.mul(k, m), E = t.mul(O, m);
     if (B)
       return { x: t.ZERO, y: t.ZERO };
     if (!t.eql(E, t.ONE))
@@ -5221,8 +5221,8 @@ function Un(s, e = {}) {
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function G(F, m, y, k, C) {
-    return y = new X(t.mul(y.X, F), y.Y, y.Z), m = Je(k, m), y = Je(C, y), m.add(y);
+  function G(F, m, y, k, O) {
+    return y = new X(t.mul(y.X, F), y.Y, y.Z), m = Je(k, m), y = Je(O, y), m.add(y);
   }
   const D = class D {
     /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
@@ -5280,7 +5280,7 @@ function Un(s, e = {}) {
     /** Compare one point to another. */
     equals(m) {
       L(m);
-      const { X: y, Y: k, Z: C } = this, { X: B, Y: b, Z: v } = m, E = t.eql(t.mul(y, v), t.mul(B, C)), T = t.eql(t.mul(k, v), t.mul(b, C));
+      const { X: y, Y: k, Z: O } = this, { X: B, Y: b, Z: v } = m, E = t.eql(t.mul(y, v), t.mul(B, O)), T = t.eql(t.mul(k, v), t.mul(b, O));
       return E && T;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -5292,9 +5292,9 @@ function Un(s, e = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: m, b: y } = i, k = t.mul(y, ze), { X: C, Y: B, Z: b } = this;
-      let v = t.ZERO, E = t.ZERO, T = t.ZERO, N = t.mul(C, C), W = t.mul(B, B), U = t.mul(b, b), $ = t.mul(C, B);
-      return $ = t.add($, $), T = t.mul(C, b), T = t.add(T, T), v = t.mul(m, T), E = t.mul(k, U), E = t.add(v, E), v = t.sub(W, E), E = t.add(W, E), E = t.mul(v, E), v = t.mul($, v), T = t.mul(k, T), U = t.mul(m, U), $ = t.sub(N, U), $ = t.mul(m, $), $ = t.add($, T), T = t.add(N, N), N = t.add(T, N), N = t.add(N, U), N = t.mul(N, $), E = t.add(E, N), U = t.mul(B, b), U = t.add(U, U), N = t.mul(U, $), v = t.sub(v, N), T = t.mul(U, W), T = t.add(T, T), T = t.add(T, T), new D(v, E, T);
+      const { a: m, b: y } = i, k = t.mul(y, ze), { X: O, Y: B, Z: b } = this;
+      let v = t.ZERO, E = t.ZERO, T = t.ZERO, N = t.mul(O, O), W = t.mul(B, B), U = t.mul(b, b), $ = t.mul(O, B);
+      return $ = t.add($, $), T = t.mul(O, b), T = t.add(T, T), v = t.mul(m, T), E = t.mul(k, U), E = t.add(v, E), v = t.sub(W, E), E = t.add(W, E), E = t.mul(v, E), v = t.mul($, v), T = t.mul(k, T), U = t.mul(m, U), $ = t.sub(N, U), $ = t.mul(m, $), $ = t.add($, T), T = t.add(N, N), N = t.add(T, N), N = t.add(N, U), N = t.mul(N, $), E = t.add(E, N), U = t.mul(B, b), U = t.add(U, U), N = t.mul(U, $), v = t.sub(v, N), T = t.mul(U, W), T = t.add(T, T), T = t.add(T, T), new D(v, E, T);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -5302,13 +5302,13 @@ function Un(s, e = {}) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(m) {
       L(m);
-      const { X: y, Y: k, Z: C } = this, { X: B, Y: b, Z: v } = m;
+      const { X: y, Y: k, Z: O } = this, { X: B, Y: b, Z: v } = m;
       let E = t.ZERO, T = t.ZERO, N = t.ZERO;
       const W = i.a, U = t.mul(i.b, ze);
-      let $ = t.mul(y, B), K = t.mul(k, b), Y = t.mul(C, v), ne = t.add(y, k), z = t.add(B, b);
-      ne = t.mul(ne, z), z = t.add($, K), ne = t.sub(ne, z), z = t.add(y, C);
+      let $ = t.mul(y, B), K = t.mul(k, b), Y = t.mul(O, v), ne = t.add(y, k), z = t.add(B, b);
+      ne = t.mul(ne, z), z = t.add($, K), ne = t.sub(ne, z), z = t.add(y, O);
       let ee = t.add(B, v);
-      return z = t.mul(z, ee), ee = t.add($, Y), z = t.sub(z, ee), ee = t.add(k, C), E = t.add(b, v), ee = t.mul(ee, E), E = t.add(K, Y), ee = t.sub(ee, E), N = t.mul(W, z), E = t.mul(U, Y), N = t.add(E, N), E = t.sub(K, N), N = t.add(K, N), T = t.mul(E, N), K = t.add($, $), K = t.add(K, $), Y = t.mul(W, Y), z = t.mul(U, z), K = t.add(K, Y), Y = t.sub($, Y), Y = t.mul(W, Y), z = t.add(z, Y), $ = t.mul(K, z), T = t.add(T, $), $ = t.mul(ee, z), E = t.mul(ne, E), E = t.sub(E, $), $ = t.mul(ne, K), N = t.mul(ee, N), N = t.add(N, $), new D(E, T, N);
+      return z = t.mul(z, ee), ee = t.add($, Y), z = t.sub(z, ee), ee = t.add(k, O), E = t.add(b, v), ee = t.mul(ee, E), E = t.add(K, Y), ee = t.sub(ee, E), N = t.mul(W, z), E = t.mul(U, Y), N = t.add(E, N), E = t.sub(K, N), N = t.add(K, N), T = t.mul(E, N), K = t.add($, $), K = t.add(K, $), Y = t.mul(W, Y), z = t.mul(U, z), K = t.add(K, Y), Y = t.sub($, Y), Y = t.mul(W, Y), z = t.add(z, Y), $ = t.mul(K, z), T = t.add(T, $), $ = t.mul(ee, z), E = t.mul(ne, E), E = t.sub(E, $), $ = t.mul(ne, K), N = t.mul(ee, N), N = t.add(N, $), new D(E, T, N);
     }
     subtract(m) {
       return this.add(m.negate());
@@ -5329,16 +5329,16 @@ function Un(s, e = {}) {
       const { endo: y } = e;
       if (!n.isValidNot0(m))
         throw new Error("invalid scalar: out of range");
-      let k, C;
+      let k, O;
       const B = (b) => H.cached(this, b, (v) => Qt(D, v));
       if (y) {
         const { k1neg: b, k1: v, k2neg: E, k2: T } = M(m), { p: N, f: W } = B(v), { p: U, f: $ } = B(T);
-        C = W.add($), k = G(y.beta, N, U, b, E);
+        O = W.add($), k = G(y.beta, N, U, b, E);
       } else {
         const { p: b, f: v } = B(m);
-        k = b, C = v;
+        k = b, O = v;
       }
-      return Qt(D, [k, C])[0];
+      return Qt(D, [k, O])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -5356,8 +5356,8 @@ function Un(s, e = {}) {
       if (H.hasCache(this))
         return this.multiply(m);
       if (y) {
-        const { k1neg: C, k1: B, k2neg: b, k2: v } = M(m), { p1: E, p2: T } = Ln(D, k, B, v);
-        return G(y.beta, E, T, C, b);
+        const { k1neg: O, k1: B, k2neg: b, k2: v } = M(m), { p1: E, p2: T } = Ln(D, k, B, v);
+        return G(y.beta, E, T, O, b);
       } else
         return H.unsafe(k, m);
     }
@@ -5435,7 +5435,7 @@ function Hn(s, e = {}) {
     }
   }
   function a(_ = t(n.seed)) {
-    return Cn(V(_, n.seed, "seed"), r.ORDER);
+    return On(V(_, n.seed, "seed"), r.ORDER);
   }
   function c(_, x = !0) {
     return s.BASE.multiply(r.fromBytes(_)).toBytes(x);
@@ -5485,37 +5485,37 @@ function Wn(s, e, r = {}) {
       throw new Error(`invalid signature ${m}: out of range 1..Point.Fn.ORDER`);
     return y;
   }
-  function O() {
+  function C() {
     if (w)
       throw new Error('"recovered" sig type is not supported for cofactor >2 curves');
   }
   function R(m, y) {
     mt(y);
-    const k = _.signature, C = y === "compact" ? k : y === "recovered" ? k + 1 : void 0;
-    return V(m, C);
+    const k = _.signature, O = y === "compact" ? k : y === "recovered" ? k + 1 : void 0;
+    return V(m, O);
   }
   class L {
-    constructor(y, k, C) {
+    constructor(y, k, O) {
       P(this, "r");
       P(this, "s");
       P(this, "recovery");
-      if (this.r = I("r", y), this.s = I("s", k), C != null) {
-        if (O(), ![0, 1, 2, 3].includes(C))
+      if (this.r = I("r", y), this.s = I("s", k), O != null) {
+        if (C(), ![0, 1, 2, 3].includes(O))
           throw new Error("invalid recovery id");
-        this.recovery = C;
+        this.recovery = O;
       }
       Object.freeze(this);
     }
     static fromBytes(y, k = x.format) {
       R(y, k);
-      let C;
+      let O;
       if (k === "der") {
         const { r: E, s: T } = ve.toSig(V(y));
         return new L(E, T);
       }
-      k === "recovered" && (C = y[0], k = "compact", y = y.subarray(1));
+      k === "recovered" && (O = y[0], k = "compact", y = y.subarray(1));
       const B = _.signature / 2, b = y.subarray(0, B), v = y.subarray(B, B * 2);
-      return new L(o.fromBytes(b), o.fromBytes(v), C);
+      return new L(o.fromBytes(b), o.fromBytes(v), O);
     }
     static fromHex(y, k) {
       return this.fromBytes(Ye(y), k);
@@ -5530,10 +5530,10 @@ function Wn(s, e, r = {}) {
       return new L(this.r, this.s, y);
     }
     recoverPublicKey(y) {
-      const { r: k, s: C } = this, B = this.assertRecovery(), b = B === 2 || B === 3 ? k + a : k;
+      const { r: k, s: O } = this, B = this.assertRecovery(), b = B === 2 || B === 3 ? k + a : k;
       if (!i.isValid(b))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const v = i.toBytes(b), E = s.fromBytes(Se(Hr((B & 1) === 0), v)), T = o.inv(b), N = q(V(y, void 0, "msgHash")), W = o.create(-N * T), U = o.create(C * T), $ = s.BASE.multiplyUnsafe(W).add(E.multiplyUnsafe(U));
+      const v = i.toBytes(b), E = s.fromBytes(Se(Hr((B & 1) === 0), v)), T = o.inv(b), N = q(V(y, void 0, "msgHash")), W = o.create(-N * T), U = o.create(O * T), $ = s.BASE.multiplyUnsafe(W).add(E.multiplyUnsafe(U));
       if ($.is0())
         throw new Error("invalid recovery: point at infinify");
       return $.assertValidity(), $;
@@ -5545,8 +5545,8 @@ function Wn(s, e, r = {}) {
     toBytes(y = x.format) {
       if (mt(y), y === "der")
         return Ye(ve.hexFromSig(this));
-      const { r: k, s: C } = this, B = o.toBytes(k), b = o.toBytes(C);
-      return y === "recovered" ? (O(), Se(Uint8Array.of(this.assertRecovery()), B, b)) : Se(B, b);
+      const { r: k, s: O } = this, B = o.toBytes(k), b = o.toBytes(O);
+      return y === "recovered" ? (C(), Se(Uint8Array.of(this.assertRecovery()), B, b)) : Se(B, b);
     }
     toHex(y) {
       return We(this.toBytes(y));
@@ -5555,8 +5555,8 @@ function Wn(s, e, r = {}) {
   const M = r.bits2int || function(y) {
     if (y.length > 8192)
       throw new Error("input is too large");
-    const k = tt(y), C = y.length * 8 - c;
-    return C > 0 ? k >> BigInt(C) : k;
+    const k = tt(y), O = y.length * 8 - c;
+    return O > 0 ? k >> BigInt(O) : k;
   }, q = r.bits2int_modN || function(y) {
     return o.create(M(y));
   }, J = kt(c);
@@ -5567,7 +5567,7 @@ function Wn(s, e, r = {}) {
     return V(m, void 0, "message"), y ? V(e(m), void 0, "prehashed message") : m;
   }
   function Q(m, y, k) {
-    const { lowS: C, prehash: B, extraEntropy: b } = ut(k, x);
+    const { lowS: O, prehash: B, extraEntropy: b } = ut(k, x);
     m = X(m, B);
     const v = q(m), E = o.fromBytes(y);
     if (!o.isValidNot0(E))
@@ -5589,16 +5589,16 @@ function Wn(s, e, r = {}) {
       if (ee === ge)
         return;
       let Lt = (ne.x === z ? 0 : 2) | Number(ne.y & Le), Dt = ee;
-      return C && S(ee) && (Dt = o.neg(ee), Lt ^= 1), new L(z, Dt, w ? void 0 : Lt);
+      return O && S(ee) && (Dt = o.neg(ee), Lt ^= 1), new L(z, Dt, w ? void 0 : Lt);
     }
     return { seed: N, k2sig: U };
   }
   function H(m, y, k = {}) {
-    const { seed: C, k2sig: B } = Q(m, y, k);
-    return bn(e.outputLen, o.BYTES, n)(C, B).toBytes(k.format);
+    const { seed: O, k2sig: B } = Q(m, y, k);
+    return bn(e.outputLen, o.BYTES, n)(O, B).toBytes(k.format);
   }
-  function D(m, y, k, C = {}) {
-    const { lowS: B, prehash: b, format: v } = ut(C, x);
+  function D(m, y, k, O = {}) {
+    const { lowS: B, prehash: b, format: v } = ut(O, x);
     if (k = V(k, void 0, "publicKey"), y = X(y, b), !At(m)) {
       const E = m instanceof L ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + E);
@@ -5615,8 +5615,8 @@ function Wn(s, e, r = {}) {
     }
   }
   function F(m, y, k = {}) {
-    const { prehash: C } = ut(k, x);
-    return y = X(y, C), L.fromBytes(m, "recovered").recoverPublicKey(y).toBytes();
+    const { prehash: O } = ut(k, x);
+    return y = X(y, O), L.fromBytes(m, "recovered").recoverPublicKey(y).toBytes();
   }
   return Object.freeze({
     keygen: l,
@@ -5633,7 +5633,7 @@ function Wn(s, e, r = {}) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Ot = {
+const Ct = {
   p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
   n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
   h: BigInt(1),
@@ -5649,12 +5649,12 @@ const Ot = {
   ]
 }, nr = /* @__PURE__ */ BigInt(2);
 function qn(s) {
-  const e = Ot.p, r = BigInt(3), t = BigInt(6), n = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = s * s * s % e, u = l * l * s % e, p = oe(u, r, e) * u % e, g = oe(p, r, e) * u % e, _ = oe(g, nr, e) * l % e, x = oe(_, n, e) * _ % e, w = oe(x, i, e) * x % e, S = oe(w, a, e) * w % e, I = oe(S, c, e) * S % e, O = oe(I, a, e) * w % e, R = oe(O, r, e) * u % e, L = oe(R, o, e) * x % e, M = oe(L, t, e) * l % e, q = oe(M, nr, e);
+  const e = Ct.p, r = BigInt(3), t = BigInt(6), n = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = s * s * s % e, u = l * l * s % e, p = oe(u, r, e) * u % e, g = oe(p, r, e) * u % e, _ = oe(g, nr, e) * l % e, x = oe(_, n, e) * _ % e, w = oe(x, i, e) * x % e, S = oe(w, a, e) * w % e, I = oe(S, c, e) * S % e, C = oe(I, a, e) * w % e, R = oe(C, r, e) * u % e, L = oe(R, o, e) * x % e, M = oe(L, t, e) * l % e, q = oe(M, nr, e);
   if (!yt.eql(yt.sqr(q), s))
     throw new Error("Cannot find square root");
   return q;
 }
-const yt = rt(Ot.p, { sqrt: qn }), Kn = /* @__PURE__ */ Un(Ot, {
+const yt = rt(Ct.p, { sqrt: qn }), Kn = /* @__PURE__ */ Un(Ct, {
   Fp: yt,
   endo: Gn
 }), Vn = /* @__PURE__ */ Wn(Kn, gn), zn = BigInt(0), Me = BigInt(1), jn = BigInt(2), Yn = BigInt(7), Xn = BigInt(256), Jn = BigInt(113), Gr = [], qr = [], Kr = [];
@@ -5691,7 +5691,7 @@ function ei(s, e = 24) {
   }
   $e(r);
 }
-class Ct {
+class Ot {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(e, r, t, n = !1, i = 24) {
     P(this, "state");
@@ -5764,10 +5764,10 @@ class Ct {
   }
   _cloneInto(e) {
     const { blockLen: r, suffix: t, outputLen: n, rounds: i, enableXOF: o } = this;
-    return e || (e = new Ct(r, t, n, o, i)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = i, e.suffix = t, e.outputLen = n, e.enableXOF = o, e.destroyed = this.destroyed, e;
+    return e || (e = new Ot(r, t, n, o, i)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = i, e.suffix = t, e.outputLen = n, e.enableXOF = o, e.destroyed = this.destroyed, e;
   }
 }
-const ti = (s, e, r, t = {}) => yr(() => new Ct(e, s, r), t), ar = /* @__PURE__ */ ti(1, 136, 32), ri = 60;
+const ti = (s, e, r, t = {}) => yr(() => new Ot(e, s, r), t), ar = /* @__PURE__ */ ti(1, 136, 32), ri = 60;
 class si {
   constructor() {
     this.jwks = null;
@@ -5987,7 +5987,7 @@ class Ae {
         d.warn("[CROSSx] OAuth 타임아웃 (5분) — postMessage를 수신하지 못했습니다"), L(), t(new Error("Authentication timeout"));
       }, 5 * 60 * 1e3), x = 10, w = 30;
       let S = 0, I = null;
-      const O = () => {
+      const C = () => {
         clearInterval(R), d.warn("[CROSSx] COOP 감지 — OAuth 서버 응답을 " + w + "초간 대기합니다"), I = setTimeout(() => {
           L(), t(new Error(
             "OAuth 서버로부터 응답을 받지 못했습니다. 브라우저 보안 정책(COOP)으로 인해 팝업 통신이 차단되었을 수 있습니다. 다시 시도해 주세요."
@@ -5996,9 +5996,9 @@ class Ae {
       }, R = setInterval(() => {
         S++;
         try {
-          g.closed && (S <= x ? O() : (L(), t(new Error("로그인이 취소되었습니다"))));
+          g.closed && (S <= x ? C() : (L(), t(new Error("로그인이 취소되었습니다"))));
         } catch {
-          O();
+          C();
         }
       }, 1e3), L = () => {
         clearTimeout(_), clearInterval(R), I && clearTimeout(I), window.removeEventListener("message", M);
@@ -6037,8 +6037,8 @@ class Ae {
           return;
         }
         const m = { token: D, email: F }, y = (k) => {
-          Ae.verifyIdTokenNonce(k, l).then(() => r(m)).catch((C) => {
-            d.error("[CROSSx] nonce 검증 실패:", C), t(C instanceof Error ? C : new Error("nonce verification failed"));
+          Ae.verifyIdTokenNonce(k, l).then(() => r(m)).catch((O) => {
+            d.error("[CROSSx] nonce 검증 실패:", O), t(O instanceof Error ? O : new Error("nonce verification failed"));
           });
         };
         H ? H.split(".").length === 3 ? y(H) : Q ? y(Q) : (d.warn(
@@ -6284,9 +6284,9 @@ class Ie {
               h.USER_NOT_FOUND,
               Ie.getGatewayErrorMessage(_.code, x)
             );
-          const S = w === h.AUTH_NOT_AUTHENTICATED ? h.SESSION_EXPIRED : w, I = S === h.SESSION_EXPIRED ? "인증 세션이 만료되었습니다. 다시 로그인해 주세요." : Ie.getGatewayErrorMessage(_.code, x), O = _.data;
+          const S = w === h.AUTH_NOT_AUTHENTICATED ? h.SESSION_EXPIRED : w, I = S === h.SESSION_EXPIRED ? "인증 세션이 만료되었습니다. 다시 로그인해 주세요." : Ie.getGatewayErrorMessage(_.code, x), C = _.data;
           let R;
-          throw w === h.PIN_LOCKED ? R = Ie.extractLockDetails(O) : w === h.ADDRESS_LIMIT_EXCEEDED ? R = { limit: gt, raw: O } : R = O ?? void 0, new f(S, I, R);
+          throw w === h.PIN_LOCKED ? R = Ie.extractLockDetails(C) : w === h.ADDRESS_LIMIT_EXCEEDED ? R = { limit: gt, raw: C } : R = C ?? void 0, new f(S, I, R);
         }
         return d.log("[CROSSx] Wallet Gateway API 성공:", { code: _.code, url: o, method: e }), _.data ?? _;
       }
@@ -8829,6 +8829,8 @@ button.__crossx-connect-other-block:active {
   letter-spacing: 0;
   -webkit-tap-highlight-color: transparent;
   transition: background 0.12s, box-shadow 0.12s;
+  -webkit-text-security: disc;
+  text-security: disc;
 }
 .__crossx-pin6-box:focus {
   background: var(--cx-input-border);
@@ -9173,7 +9175,7 @@ function _i(s) {
   }, { passive: !0 });
 }
 const fi = () => /iPad|iPhone|iPod/.test(navigator.userAgent) || navigator.platform === "MacIntel" && navigator.maxTouchPoints > 1;
-function Oe() {
+function Ce() {
   if (fi()) {
     const e = window.scrollY;
     return document.body.style.position = "fixed", document.body.style.top = `-${e}px`, document.body.style.left = "0", document.body.style.right = "0", () => {
@@ -9451,7 +9453,7 @@ function Ri(s) {
 function Ni(s) {
   return `https://www.crossscan.io/address/${s}?tab=txs`;
 }
-function Oi(s, e) {
+function Ci(s, e) {
   return `https://explorer.crosstoken.io/${Ri(s)}/tx/${e}`;
 }
 function Jr(s, e) {
@@ -9461,9 +9463,9 @@ function Ze(s) {
   return Jr(de(s), Ni(s));
 }
 function Zr(s, e) {
-  return Jr(de(e), Oi(s, e));
+  return Jr(de(e), Ci(s, e));
 }
-function Ci(s, e, r) {
+function Oi(s, e, r) {
   const t = j(
     (r == null ? void 0 : r.label_from) ?? "From",
     `${Ze(s.from)}
@@ -9543,10 +9545,10 @@ function Li(s, e, r, t) {
     <button class="__crossx-approve-btn" id="__crossx-done-btn">${A((t == null ? void 0 : t.tx_complete_done_button) ?? (n ? "All Done" : "Done"))}</button>
   `, c.querySelectorAll(".__crossx-copy-btn").forEach((w) => {
     w.addEventListener("click", (S) => {
-      var O;
+      var C;
       S.stopPropagation();
       const I = w.dataset.copy;
-      I && ((O = navigator.clipboard) == null || O.writeText(I).catch(() => {
+      I && ((C = navigator.clipboard) == null || C.writeText(I).catch(() => {
       }));
     });
   });
@@ -9915,7 +9917,7 @@ function pt(s) {
         <span id="__crossx-pin6-lock-countdown"></span>
        </p>` : "", a = s.warningMessage && s.attemptCount != null && s.attemptCount > 0 ? `<p class="__crossx-pin6-warning" id="__crossx-pin6-warning">${A(s.warningMessage)}</p>` : '<p class="__crossx-pin6-warning" id="__crossx-pin6-warning"></p>', c = s.attemptCount != null && s.attemptCount > 0 ? `<p class="__crossx-pin6-attempt" id="__crossx-pin6-attempt">${s.attemptCount}/${s.maxAttempts ?? "?"}</p>` : '<p class="__crossx-pin6-attempt" id="__crossx-pin6-attempt"></p>', l = e ? " --locked" : "", u = Array.from(
     { length: 6 },
-    (w, S) => `<input class="__crossx-pin6-box${l}" type="password" maxlength="1" inputmode="numeric" pattern="[0-9]" autocomplete="off" aria-label="PIN digit ${S + 1}"${e ? " disabled" : ""}>`
+    (w, S) => `<input class="__crossx-pin6-box${l}" type="tel" maxlength="1" inputmode="numeric" pattern="[0-9]" autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false" aria-label="PIN digit ${S + 1}"${e ? " disabled" : ""}>`
   ).join(""), p = e ? " --locked" : "", g = Array.from(
     { length: 6 },
     (w, S) => `<div class="__crossx-pin6-dot${p}" data-dot-index="${S}" aria-label="PIN digit ${S + 1}"></div>`
@@ -9985,7 +9987,7 @@ function to(s) {
   return r > 0 ? `${r}h ${String(t).padStart(2, "0")}m` : `${String(t).padStart(2, "0")}:${String(n).padStart(2, "0")}`;
 }
 function _t(s, e, r, t, n, i, o) {
-  var C, B;
+  var O, B;
   let a = !!(i && i > Date.now()), c = !1;
   const l = () => Array.from(s.querySelectorAll(".__crossx-pin6-box")), u = () => s.querySelector("#__crossx-pin6-boxes"), p = () => s.querySelector("#__crossx-pin6-error"), g = () => s.querySelector("#__crossx-pin6-lock-msg"), _ = () => s.querySelector("#__crossx-pin6-lock-countdown"), x = () => s.querySelector(".__crossx-pin6-body"), w = () => l().map((b) => b.value).join(""), S = () => Array.from(s.querySelectorAll(".__crossx-pin6-dot")), I = () => {
     var E;
@@ -9997,7 +9999,7 @@ function _t(s, e, r, t, n, i, o) {
       const T = b.findIndex((W) => !W.value);
       (E = v[T === -1 ? 5 : T]) == null || E.classList.add("--active");
     }
-  }, O = () => {
+  }, C = () => {
     s.querySelectorAll(".__crossx-pin6-numpad-key[data-key]").forEach((v) => v.classList.toggle("--disabled", a)), S().forEach((v) => v.classList.toggle("--locked", a)), I();
   }, R = (b) => {
     a = b, l().forEach((v) => {
@@ -10044,7 +10046,7 @@ function _t(s, e, r, t, n, i, o) {
     var W;
     R(!0), l().forEach((U) => {
       U.value = "";
-    }), O();
+    }), C();
     const v = p();
     if (v && (v.textContent = "Too many failed attempts. Please wait."), !g()) {
       const U = document.createElement("p");
@@ -10055,7 +10057,7 @@ function _t(s, e, r, t, n, i, o) {
     const E = () => {
       var K;
       const U = b - Date.now(), $ = _();
-      U <= 0 ? (clearInterval(T), R(!1), (K = g()) == null || K.remove(), v && (v.textContent = ""), O(), setTimeout(() => {
+      U <= 0 ? (clearInterval(T), R(!1), (K = g()) == null || K.remove(), v && (v.textContent = ""), C(), setTimeout(() => {
         var Y;
         return (Y = l()[0]) == null ? void 0 : Y.focus();
       }, 50)) : $ && ($.textContent = ` ${to(U)}`);
@@ -10096,7 +10098,7 @@ function _t(s, e, r, t, n, i, o) {
     const b = l(), v = b.find((E) => !E.value) ?? b[b.length - 1];
     v == null || v.focus();
   };
-  (C = u()) == null || C.addEventListener("click", (b) => {
+  (O = u()) == null || O.addEventListener("click", (b) => {
     b.target.classList.contains("__crossx-pin6-box") || y();
   }), (B = x()) == null || B.addEventListener("click", (b) => {
     const v = b.target;
@@ -10156,7 +10158,7 @@ function _t(s, e, r, t, n, i, o) {
       v();
       const W = N.getBoundingClientRect();
       T.clientX >= W.left && T.clientX <= W.right && T.clientY >= W.top && T.clientY <= W.bottom && !a && !c && E(N);
-    }), k.addEventListener("pointercancel", v), k.addEventListener("pointerleave", v, !0), I(), i && i > Date.now() && O();
+    }), k.addEventListener("pointercancel", v), k.addEventListener("pointerleave", v, !0), I(), i && i > Date.now() && C();
   }
 }
 const ro = `<svg width="22" height="17" viewBox="0 0 22 17" fill="none" xmlns="http://www.w3.org/2000/svg">
@@ -10246,9 +10248,9 @@ class oo {
    */
   showWalletSelector(e, r, t) {
     return new Promise((n, i) => {
-      var O;
+      var C;
       ae();
-      const o = [...e], a = Wi(o, this.tokens, t, this.messages), c = Oe();
+      const o = [...e], a = Wi(o, this.tokens, t, this.messages), c = Ce();
       ce(a);
       let l = !1;
       const u = () => {
@@ -10288,7 +10290,7 @@ class oo {
           const L = R instanceof f && R.code === h.ADDRESS_LIMIT_EXCEEDED, M = this.resolveAddWalletErrorMessage(R);
           w && (w.textContent = M, w.hidden = !1), L ? (S.disabled = !0, S.setAttribute("aria-disabled", "true")) : S.disabled = !1, p = R;
         }
-      }), (O = a.querySelector("#__crossx-close-btn")) == null || O.addEventListener("click", _), a.addEventListener("click", (R) => {
+      }), (C = a.querySelector("#__crossx-close-btn")) == null || C.addEventListener("click", _), a.addEventListener("click", (R) => {
         R.target === a && _();
       });
       const I = (R) => {
@@ -10325,7 +10327,7 @@ class oo {
     return new Promise((n) => {
       var g, _, x, w;
       ae();
-      const i = zi(this.tokens, r, this.messages), o = Oe();
+      const i = zi(this.tokens, r, this.messages), o = Ce();
       ce(i);
       const a = () => {
         i.remove(), o();
@@ -10337,8 +10339,8 @@ class oo {
         a(), n(null);
       };
       (g = i.querySelector("#__crossx-apple-btn")) == null || g.addEventListener("click", () => c("apple")), (_ = i.querySelector("#__crossx-google-btn")) == null || _.addEventListener("click", () => c("google")), (x = i.querySelector("#__crossx-connect-other-wallet-btn")) == null || x.addEventListener("click", (S) => {
-        const O = S.currentTarget.dataset.walletId ?? "";
-        O && l(O);
+        const C = S.currentTarget.dataset.walletId ?? "";
+        C && l(C);
       }), (w = i.querySelector("#__crossx-close-btn")) == null || w.addEventListener("click", u), i.addEventListener("click", (S) => {
         S.target === i && u();
       }), i.querySelectorAll(".__crossx-login-terms-link").forEach((S) => {
@@ -10361,7 +10363,7 @@ class oo {
         accountLabel: (t == null ? void 0 : t.session_alert_account_label) ?? "Account",
         signOutLabel: (t == null ? void 0 : t.session_alert_sign_out_button) ?? "Sign out",
         signInAgainLabel: (t == null ? void 0 : t.session_alert_sign_in_again_button) ?? "Sign in again"
-      }), i = Oe();
+      }), i = Ce();
       ce(n);
       let o = !1;
       const a = () => {
@@ -10430,13 +10432,13 @@ class oo {
       }, o = {
         title: (t == null ? void 0 : t.pin_setup_confirm_title) ?? "Confirm PIN",
         headerSubtitle: (t == null ? void 0 : t.pin_setup_confirm_subtitle) ?? "Enter your PIN again to confirm."
-      }, a = hr(this.tokens, Qi(n)), c = Oe();
+      }, a = hr(this.tokens, Qi(n)), c = Ce();
       ce(a);
       let l = !1;
       const u = () => {
         l || (l = !0, a.remove(), c());
-      }, p = (O) => {
-        u(), r(O);
+      }, p = (C) => {
+        u(), r(C);
       }, g = () => {
         u(), r(null);
       }, _ = a.querySelector(".__crossx-card"), x = {
@@ -10445,21 +10447,21 @@ class oo {
         repeatingDigit: (t == null ? void 0 : t.pin_validation_repeating_digit) ?? "Cannot use the same number 3+ times in a row.",
         sequential: (t == null ? void 0 : t.pin_validation_sequential) ?? "Sequential numbers (e.g., 123456) are not allowed.",
         alternatingPattern: (t == null ? void 0 : t.pin_validation_alternating_pattern) ?? "Repeating patterns (e.g., 121212) are not allowed."
-      }, w = (O) => {
+      }, w = (C) => {
         var R;
         _.innerHTML = pt({
           title: o.title,
           headerSubtitle: o.headerSubtitle
         }), this.applyPinKeyboardMode(_), (R = _.querySelector("#__crossx-close-btn")) == null || R.addEventListener("click", g), _t(_, (L) => {
-          L === O ? p(O) : S(i.mismatchError);
+          L === C ? p(C) : S(i.mismatchError);
         }, g);
-      }, S = (O) => {
+      }, S = (C) => {
         var R;
         _.innerHTML = pt({
           title: i.title,
           headerSubtitle: i.headerSubtitle,
           subtitle: i.subtitle,
-          errorMessage: O
+          errorMessage: C
         }), this.applyPinKeyboardMode(_), (R = _.querySelector("#__crossx-close-btn")) == null || R.addEventListener("click", g), _t(_, (L) => {
           const M = eo(L, x);
           M ? S(M) : w(L);
@@ -10467,10 +10469,10 @@ class oo {
       };
       (() => {
         var Q;
-        const O = Array.from(_.querySelectorAll(".__crossx-pw-notice-item")), R = _.querySelector("#__crossx-pin-notice-next"), L = /* @__PURE__ */ new Set();
+        const C = Array.from(_.querySelectorAll(".__crossx-pw-notice-item")), R = _.querySelector("#__crossx-pin-notice-next"), L = /* @__PURE__ */ new Set();
         R.removeAttribute("disabled");
         const M = R.dataset.nextLabel ?? "Next", q = R.dataset.submitLabel ?? "I Understand", J = () => {
-          const H = L.size === O.length;
+          const H = L.size === C.length;
           R.classList.toggle("--disabled", !H), R.textContent = H ? q : M;
         }, G = (H, D) => {
           if (L.has(D)) return;
@@ -10481,7 +10483,7 @@ class oo {
           const F = H.querySelector(`#__crossx-notice-check-${D}`);
           L.delete(D), F.classList.remove("--checked"), H.setAttribute("aria-checked", "false"), J();
         };
-        O.forEach((H) => {
+        C.forEach((H) => {
           const D = parseInt(H.dataset.checkIndex ?? "0", 10);
           H.addEventListener("click", () => {
             L.has(D) ? X(H, D) : G(H, D);
@@ -10489,11 +10491,11 @@ class oo {
             (F.key === " " || F.key === "Enter") && (F.preventDefault(), L.has(D) ? X(H, D) : G(H, D));
           });
         }), R.addEventListener("click", () => {
-          if (L.size === O.length) {
+          if (L.size === C.length) {
             S(e == null ? void 0 : e.errorMessage);
             return;
           }
-          const H = O.find((F) => {
+          const H = C.find((F) => {
             const m = parseInt(F.dataset.checkIndex ?? "0", 10);
             return !L.has(m);
           });
@@ -10503,8 +10505,8 @@ class oo {
             H.classList.remove("--highlight"), G(H, D);
           }, 400);
         }), (Q = _.querySelector("#__crossx-close-btn")) == null || Q.addEventListener("click", g);
-      })(), a.addEventListener("click", (O) => {
-        O.target === a && g();
+      })(), a.addEventListener("click", (C) => {
+        C.target === a && g();
       });
     });
   }
@@ -10528,20 +10530,20 @@ class oo {
           attemptCount: e == null ? void 0 : e.attemptCount,
           maxAttempts: e == null ? void 0 : e.maxAttempts
         })
-      ), u = Oe();
+      ), u = Ce();
       ce(l);
       let p = !1;
       const g = () => {
         p || (p = !0, l.remove(), u());
-      }, _ = (O) => {
-        g(), r(O);
+      }, _ = (C) => {
+        g(), r(C);
       }, x = () => {
         g(), r(null);
-      }, w = (O) => {
-        g(), t(O);
+      }, w = (C) => {
+        g(), t(C);
       }, S = l.querySelector(".__crossx-card");
-      this.applyPinKeyboardMode(S), (I = S.querySelector("#__crossx-close-btn")) == null || I.addEventListener("click", x), _t(S, _, x, w, e == null ? void 0 : e.onSubmit, e == null ? void 0 : e.lockExpiresAt, c), l.addEventListener("click", (O) => {
-        O.target === l && x();
+      this.applyPinKeyboardMode(S), (I = S.querySelector("#__crossx-close-btn")) == null || I.addEventListener("click", x), _t(S, _, x, w, e == null ? void 0 : e.onSubmit, e == null ? void 0 : e.lockExpiresAt, c), l.addEventListener("click", (C) => {
+        C.target === l && x();
       });
     });
   }
@@ -10598,7 +10600,7 @@ class oo {
     return new Promise((r) => {
       var a, c;
       ae();
-      const t = Ci(e, this.tokens, this.messages);
+      const t = Oi(e, this.tokens, this.messages);
       ce(t);
       const n = () => t.remove(), i = () => {
         n(), r();
@@ -10654,7 +10656,7 @@ class oo {
       ae();
       let t;
       e.type === "sign-message" ? t = Di(e, this.tokens, this.messages) : e.type === "sign-typed-data" ? t = $i(e, this.tokens, this.messages) : e.type === "sign" ? t = Ai(e, this.tokens, this.displayDecimals, this.messages) : t = Ii(e, this.tokens, this.displayDecimals, this.messages);
-      const n = Oe();
+      const n = Ce();
       ce(t);
       const i = () => {
         t.remove(), n();
@@ -10841,6 +10843,10 @@ class ao {
   setMessages(e) {
     return this.browserConfirmation.setMessages(e);
   }
+  setPinKeyboard(e) {
+    var r, t;
+    (t = (r = this.browserConfirmation).setPinKeyboard) == null || t.call(r, e);
+  }
 }
 class co {
   constructor() {
@@ -10931,7 +10937,7 @@ Example: createCROSSxSDK({ projectId: "your-project-id", ... })`
     },
     () => typeof window < "u" ? window.location.origin : "http://localhost",
     x
-  ), O = e != null && e.wrapConfirmation ? e.wrapConfirmation(I) : I, R = new xt(
+  ), C = e != null && e.wrapConfirmation ? e.wrapConfirmation(I) : I, R = new xt(
     t,
     n,
     o,
@@ -10940,7 +10946,7 @@ Example: createCROSSxSDK({ projectId: "your-project-id", ... })`
     l,
     g,
     u,
-    O,
+    C,
     w,
     p
   );