@nexus-cross/crossx-sdk-core 1.4.1 → 1.4.2-beta.1

package/dist/index.js

@@ -894,11 +894,11 @@ class Zs {
     this.listeners.clear();
   }
 }
-const Ke = {
+const Oe = {
   production: {
-    oauthServiceUrl: "https://stg-cross-wallet-oauth.crosstoken.io",
-    authApiUrl: "https://stg-cross-auth.crosstoken.io",
-    walletGatewayUrl: "https://stg-embedded-wallet-gateway.crosstoken.io/api/v1"
+    oauthServiceUrl: "https://cross-wallet-oauth.crosstoken.io",
+    authApiUrl: "https://cross-auth.crosstoken.io",
+    walletGatewayUrl: "https://embedded-wallet-gateway.crosstoken.io/api/v1"
   },
   staging: {
     oauthServiceUrl: "https://stg-cross-wallet-oauth.crosstoken.io",
@@ -913,7 +913,7 @@ const Ke = {
 };
 function Qs(r) {
   const e = r.environment;
-  return e && e in Ke ? Ke[e] : null;
+  return e && e in Oe ? Oe[e] : null;
 }
 function er() {
   try {
@@ -923,10 +923,16 @@ function er() {
     }
   } catch {
   }
-  return Ke.production;
+  try {
+    const r = process.env.NEXT_PUBLIC_CROSSX_ENVIRONMENT;
+    if (r && r in Oe)
+      return Oe[r];
+  } catch {
+  }
+  return Oe.production;
 }
 const tr = 2e3, Pt = 6e4, sr = 1e3, rr = 1e4, nr = "0x77359400", Ct = "0x3B9ACA00", Nt = 130, Lt = 6, Dt = 18, Mt = 3e4, ir = 5 * 60 * 1e3, or = 30 * 1e3;
-function Le(r) {
+function De(r) {
   const e = r.indexOf("@");
   if (e < 0) return "***";
   const s = r.substring(0, e), t = r.substring(e);
@@ -2108,7 +2114,7 @@ const te = class te extends Zs {
           if (await this.confirmation.showSessionAlert({
             title: f.sessionAlert_title,
             message: f.alert_sessionExpired,
-            email: this.userEmail ? Le(this.userEmail) : void 0
+            email: this.userEmail ? De(this.userEmail) : void 0
           }) === "signin-again" && (await this.signInAgain()).success) {
             d.log("[CROSSx][Migration Phase 4] 재로그인 성공 — PIN 입력 루프 계속"), i--;
             continue;
@@ -2139,7 +2145,7 @@ const te = class te extends Zs {
         if (await this.confirmation.showSessionAlert({
           title: _.sessionAlert_title,
           message: _.alert_sessionExpired,
-          email: this.userEmail ? Le(this.userEmail) : void 0
+          email: this.userEmail ? De(this.userEmail) : void 0
         }) === "signin-again" && (await this.signInAgain()).success) {
           d.log("[CROSSx][Migration Phase 5] 재로그인 성공 — 마이그레이션 재시도 (검증된 PIN 유지)");
           try {
@@ -2331,7 +2337,7 @@ const te = class te extends Zs {
         return await this.confirmation.showSessionAlert({
           title: p.sessionAlert_title,
           message: p.alert_differentAccount,
-          email: this.userEmail ? Le(this.userEmail) : void 0
+          email: this.userEmail ? De(this.userEmail) : void 0
         }) === "signin-again" ? (this._isRecoveringSession = !1, this.signInAgain()) : (this.clearAuthState(), { success: !1, error: "Different account signed in" });
       }
       this.applyAuthResult(a);
@@ -2355,7 +2361,7 @@ const te = class te extends Zs {
     try {
       return await e();
     } catch (s) {
-      const t = fe(this._config.locale ?? "en"), n = this.userEmail ? Le(this.userEmail) : void 0;
+      const t = fe(this._config.locale ?? "en"), n = this.userEmail ? De(this.userEmail) : void 0;
       if (s instanceof g && s.code === h.WITHDRAW_FAILED) {
         if (d.warn("[CROSSx] WITHDRAW_FAILED — 로컬 인증 초기화"), await this.confirmation.showSessionAlert({
           title: t.sessionAlert_title,
@@ -2501,7 +2507,7 @@ const te = class te extends Zs {
         if (await this.confirmation.showSessionAlert({
           title: l.sessionAlert_title,
           message: l.alert_sessionExpired,
-          email: this.userEmail ? Le(this.userEmail) : void 0
+          email: this.userEmail ? De(this.userEmail) : void 0
         }) === "signin-again" && (await this.signInAgain()).success)
           throw o(c), c;
       }
@@ -2695,7 +2701,7 @@ class ar {
     }
   }
 }
-const tt = "crossx-sdk", cr = 1, he = "data", Ee = "keys", Ue = "aes-primary", lr = 12;
+const tt = "crossx-sdk", cr = 1, he = "data", Ee = "keys", He = "aes-primary", lr = 12;
 class $t {
   constructor(e) {
     this.db = null, this.cryptoKey = null, this.initPromise = null, this.dbName = `crossx-sdk-${e}`;
@@ -2738,7 +2744,7 @@ class $t {
   }
   async init() {
     this.db = await this.openDB();
-    const e = await this.idbGet(Ee, Ue);
+    const e = await this.idbGet(Ee, He);
     if (e) {
       this.cryptoKey = e;
       return;
@@ -2752,7 +2758,7 @@ class $t {
       { name: "AES-GCM", length: 256 },
       !1,
       ["encrypt", "decrypt"]
-    ), await this.idbPut(Ee, Ue, this.cryptoKey);
+    ), await this.idbPut(Ee, He, this.cryptoKey);
   }
   /**
    * 레거시 DB('crossx-sdk')에서 projectId 스코프 DB로 암호키·데이터 마이그레이션.
@@ -2761,7 +2767,7 @@ class $t {
   async migrateFromLegacyDB() {
     if (this.dbName === tt) return null;
     try {
-      const e = await this.openDB(tt), s = e.transaction([Ee, he], "readonly"), t = s.objectStore(Ee).get(Ue), n = await new Promise((l, u) => {
+      const e = await this.openDB(tt), s = e.transaction([Ee, he], "readonly"), t = s.objectStore(Ee).get(He), n = await new Promise((l, u) => {
         t.onsuccess = () => l(t.result), t.onerror = () => u(t.error);
       });
       if (!n)
@@ -2774,7 +2780,7 @@ class $t {
           o.onsuccess = () => l(o.result), o.onerror = () => u(o.error);
         })
       ]);
-      e.close(), await this.idbPut(Ee, Ue, n);
+      e.close(), await this.idbPut(Ee, He, n);
       for (let l = 0; l < c.length; l++)
         await this.idbPut(he, String(c[l]), a[l]);
       return indexedDB.deleteDatabase(tt), d.log("[CROSSx] IndexedDB 레거시 DB 마이그레이션 완료"), n;
@@ -2864,7 +2870,7 @@ function os(r) {
     throw new Error("Hash must wrapped by utils.createHasher");
   we(r.outputLen), we(r.blockLen);
 }
-function Pe(r, e = !0) {
+function Ce(r, e = !0) {
   if (r.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (e && r.finished)
@@ -2879,7 +2885,7 @@ function as(r, e) {
 function dr(r) {
   return new Uint32Array(r.buffer, r.byteOffset, Math.floor(r.byteLength / 4));
 }
-function Ce(...r) {
+function Ne(...r) {
   for (let e = 0; e < r.length; e++)
     r[e].fill(0);
 }
@@ -2899,7 +2905,7 @@ function pr(r) {
   return r;
 }
 const Bt = ur ? (r) => r : pr, cs = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", fr = /* @__PURE__ */ Array.from({ length: 256 }, (r, e) => e.toString(16).padStart(2, "0"));
-function Be(r) {
+function Ue(r) {
   if (q(r), cs)
     return r.toHex();
   let e = "";
@@ -2983,7 +2989,7 @@ class mr {
     this.blockLen = e, this.outputLen = s, this.padOffset = t, this.isLE = n, this.buffer = new Uint8Array(e), this.view = st(this.buffer);
   }
   update(e) {
-    Pe(this), q(e);
+    Ce(this), q(e);
     const { view: s, buffer: t, blockLen: n } = this, i = e.length;
     for (let o = 0; o < i; ) {
       const a = Math.min(n - this.pos, i - o);
@@ -2998,10 +3004,10 @@ class mr {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    Pe(this), as(e, this), this.finished = !0;
+    Ce(this), as(e, this), this.finished = !0;
     const { buffer: s, view: t, blockLen: n, isLE: i } = this;
     let { pos: o } = this;
-    s[o++] = 128, Ce(this.buffer.subarray(o)), this.padOffset > n - o && (this.process(t, 0), o = 0);
+    s[o++] = 128, Ne(this.buffer.subarray(o)), this.padOffset > n - o && (this.process(t, 0), o = 0);
     for (let p = o; p < n; p++)
       s[p] = 0;
     t.setBigUint64(n - 8, BigInt(this.length * 8), i), this.process(t, 0);
@@ -3038,9 +3044,9 @@ const ye = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), He = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ht = /* @__PURE__ */ BigInt(32);
+]), Fe = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ht = /* @__PURE__ */ BigInt(32);
 function wr(r, e = !1) {
-  return e ? { h: Number(r & He), l: Number(r >> Ht & He) } : { h: Number(r >> Ht & He) | 0, l: Number(r & He) | 0 };
+  return e ? { h: Number(r & Fe), l: Number(r >> Ht & Fe) } : { h: Number(r >> Ht & Fe) | 0, l: Number(r & Fe) | 0 };
 }
 function yr(r, e = !1) {
   const s = r.length;
@@ -3144,10 +3150,10 @@ class Ar extends mr {
     t = t + this.A | 0, n = n + this.B | 0, i = i + this.C | 0, o = o + 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, i, o, a, c, l, u);
   }
   roundClean() {
-    Ce(be);
+    Ne(be);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), Ce(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), Ne(this.buffer);
   }
 }
 class Tr extends Ar {
@@ -3180,13 +3186,13 @@ function ze(r, e = "") {
 }
 function us(r) {
   if (typeof r == "bigint") {
-    if (!qe(r))
+    if (!Ke(r))
       throw new Error("positive bigint expected, got " + r);
   } else
     we(r);
   return r;
 }
-function Fe(r) {
+function Ge(r) {
   const e = us(r).toString(16);
   return e.length & 1 ? "0" + e : e;
 }
@@ -3196,10 +3202,10 @@ function hs(r) {
   return r === "" ? gt : BigInt("0x" + r);
 }
 function Je(r) {
-  return hs(Be(r));
+  return hs(Ue(r));
 }
 function ps(r) {
-  return hs(Be(kr(q(r)).reverse()));
+  return hs(Ue(kr(q(r)).reverse()));
 }
 function mt(r, e) {
   we(e), r = us(r);
@@ -3214,9 +3220,9 @@ function fs(r, e) {
 function kr(r) {
   return Uint8Array.from(r);
 }
-const qe = (r) => typeof r == "bigint" && gt <= r;
+const Ke = (r) => typeof r == "bigint" && gt <= r;
 function Or(r, e, s) {
-  return qe(r) && qe(e) && qe(s) && e <= r && r < s;
+  return Ke(r) && Ke(e) && Ke(s) && e <= r && r < s;
 }
 function Pr(r, e, s, t) {
   if (!Or(e, s, t))
@@ -3555,7 +3561,7 @@ function qr(r, e, s = !1) {
   return s ? fs(a, n) : mt(a, n);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Ne = /* @__PURE__ */ BigInt(0), Re = /* @__PURE__ */ BigInt(1);
+const Le = /* @__PURE__ */ BigInt(0), Re = /* @__PURE__ */ BigInt(1);
 function je(r, e) {
   const s = e.negate();
   return r ? s : e;
@@ -3585,7 +3591,7 @@ function it(r) {
   return As.get(r) || 1;
 }
 function Vt(r) {
-  if (r !== Ne)
+  if (r !== Le)
     throw new Error("invalid wNAF");
 }
 class Kr {
@@ -3600,7 +3606,7 @@ class Kr {
   // non-const time multiplication ladder
   _unsafeLadder(e, s, t = this.ZERO) {
     let n = e;
-    for (; s > Ne; )
+    for (; s > Le; )
       s & Re && (t = t.add(n)), n = n.double(), s >>= Re;
     return t;
   }
@@ -3651,7 +3657,7 @@ class Kr {
    */
   wNAFUnsafe(e, s, t, n = this.ZERO) {
     const i = rt(e, this.bits);
-    for (let o = 0; o < i.windows && t !== Ne; o++) {
+    for (let o = 0; o < i.windows && t !== Le; o++) {
       const { nextN: a, offset: c, isZero: l, isNeg: u } = Kt(t, o, i);
       if (t = a, !l) {
         const p = s[c];
@@ -3684,7 +3690,7 @@ class Kr {
 }
 function Vr(r, e, s, t) {
   let n = e, i = r.ZERO, o = r.ZERO;
-  for (; s > Ne || t > Ne; )
+  for (; s > Le || t > Le; )
     s & Re && (i = i.add(n)), t & Re && (o = o.add(n)), n = n.double(), s >>= Re, t >>= Re;
   return { p1: i, p2: o };
 }
@@ -3701,7 +3707,7 @@ function zr(r, e, s = {}, t) {
     throw new Error(`expected valid ${r} CURVE object`);
   for (const c of ["p", "n", "h"]) {
     const l = e[c];
-    if (!(typeof l == "bigint" && l > Ne))
+    if (!(typeof l == "bigint" && l > Le))
       throw new Error(`CURVE.${c} must be positive bigint`);
   }
   const n = zt(e.p, s.Fp, t), i = zt(e.n, s.Fn, t), a = ["Gx", "Gy", "a", "b"];
@@ -3734,13 +3740,13 @@ class Ts {
     this.iHash.update(n), this.oHash = e.create();
     for (let i = 0; i < n.length; i++)
       n[i] ^= 106;
-    this.oHash.update(n), Ce(n);
+    this.oHash.update(n), Ne(n);
   }
   update(e) {
-    return Pe(this), this.iHash.update(e), this;
+    return Ce(this), this.iHash.update(e), this;
   }
   digestInto(e) {
-    Pe(this), q(e, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
+    Ce(this), q(e, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
   }
   digest() {
     const e = new Uint8Array(this.oHash.outputLen);
@@ -3767,7 +3773,7 @@ function Yr(r, e, s) {
   let l = r - a * t - c * i, u = -a * n - c * o;
   const p = l < ge, _ = u < ge;
   p && (l = -l), _ && (u = -u);
-  const f = wt(Math.ceil(Cr(s) / 2)) + Oe;
+  const f = wt(Math.ceil(Cr(s) / 2)) + Pe;
   if (l < ge || l >= f || u < ge || u >= f)
     throw new Error("splitScalar (endomorphism): failed, k=" + r);
   return { k1neg: p, k1: l, k2neg: _, k2: u };
@@ -3799,11 +3805,11 @@ const Se = {
         throw new s("tlv.encode: wrong tag");
       if (e.length & 1)
         throw new s("tlv.encode: unpadded data");
-      const t = e.length / 2, n = Fe(t);
+      const t = e.length / 2, n = Ge(t);
       if (n.length / 2 & 128)
         throw new s("tlv.encode: long form length too big");
-      const i = t > 127 ? Fe(n.length / 2 | 128) : "";
-      return Fe(r) + i + n + e;
+      const i = t > 127 ? Ge(n.length / 2 | 128) : "";
+      return Ge(r) + i + n + e;
     },
     // v - value, l - left bytes (unparsed)
     decode(r, e) {
@@ -3848,7 +3854,7 @@ const Se = {
       const { Err: e } = Se;
       if (r < ge)
         throw new e("integer: negative integers are not allowed");
-      let s = Fe(r);
+      let s = Ge(r);
       if (Number.parseInt(s[0], 16) & 8 && (s = "00" + s), s.length & 1)
         throw new e("unexpected DER parsing assertion: unpadded hex");
       return s;
@@ -3875,7 +3881,7 @@ const Se = {
     const { _tlv: e, _int: s } = Se, t = e.encode(2, s.encode(r.r)), n = e.encode(2, s.encode(r.s)), i = t + n;
     return e.encode(48, i);
   }
-}, ge = BigInt(0), Oe = BigInt(1), ks = BigInt(2), Ge = BigInt(3), Jr = BigInt(4);
+}, ge = BigInt(0), Pe = BigInt(1), ks = BigInt(2), We = BigInt(3), Jr = BigInt(4);
 function Zr(r, e = {}) {
   const s = zr("weierstrass", r, e), { Fp: t, Fn: n } = s;
   let i = s.CURVE;
@@ -3942,7 +3948,7 @@ function Zr(r, e = {}) {
   }
   if (!y(i.Gx, i.Gy))
     throw new Error("bad curve params: generator point");
-  const I = t.mul(t.pow(i.a, Ge), Jr), P = t.mul(t.sqr(i.b), BigInt(27));
+  const I = t.mul(t.pow(i.a, We), Jr), P = t.mul(t.sqr(i.b), BigInt(27));
   if (t.is0(t.add(I, P)))
     throw new Error("bad curve params: a or b");
   function H(T, x, m = !1) {
@@ -4029,7 +4035,7 @@ function Zr(r, e = {}) {
      * @returns
      */
     precompute(x = 8, m = !0) {
-      return v.createCache(this, x), m || this.multiply(Ge), this;
+      return v.createCache(this, x), m || this.multiply(We), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -4057,7 +4063,7 @@ function Zr(r, e = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: x, b: m } = i, b = t.mul(m, Ge), { X: A, Y: N, Z: C } = this;
+      const { a: x, b: m } = i, b = t.mul(m, We), { X: A, Y: N, Z: C } = this;
       let M = t.ZERO, O = t.ZERO, $ = t.ZERO, F = t.mul(A, A), Y = t.mul(N, N), W = t.mul(C, C), B = t.mul(A, N);
       return B = t.add(B, B), $ = t.mul(A, C), $ = t.add($, $), M = t.mul(x, $), O = t.mul(b, W), O = t.add(M, O), M = t.sub(Y, O), O = t.add(Y, O), O = t.mul(M, O), M = t.mul(B, M), $ = t.mul(b, $), W = t.mul(x, W), B = t.sub(F, W), B = t.mul(x, B), B = t.add(B, $), $ = t.add(F, F), F = t.add($, F), F = t.add(F, W), F = t.mul(F, B), O = t.add(O, F), W = t.mul(N, C), W = t.add(W, W), F = t.mul(W, B), M = t.sub(M, F), $ = t.mul(W, Y), $ = t.add($, $), $ = t.add($, $), new E(M, O, $);
     }
@@ -4069,7 +4075,7 @@ function Zr(r, e = {}) {
       D(x);
       const { X: m, Y: b, Z: A } = this, { X: N, Y: C, Z: M } = x;
       let O = t.ZERO, $ = t.ZERO, F = t.ZERO;
-      const Y = i.a, W = t.mul(i.b, Ge);
+      const Y = i.a, W = t.mul(i.b, We);
       let B = t.mul(m, N), X = t.mul(b, C), Q = t.mul(A, M), oe = t.add(m, b), V = t.add(N, C);
       oe = t.mul(oe, V), V = t.add(B, X), oe = t.sub(oe, V), V = t.add(m, A);
       let ee = t.add(N, M);
@@ -4116,7 +4122,7 @@ function Zr(r, e = {}) {
         throw new Error("invalid scalar: out of range");
       if (x === ge || b.is0())
         return E.ZERO;
-      if (x === Oe)
+      if (x === Pe)
         return b;
       if (v.hasCache(this))
         return this.multiply(x);
@@ -4139,11 +4145,11 @@ function Zr(r, e = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: x } = e;
-      return o === Oe ? !0 : x ? x(E, this) : v.unsafe(this, a).is0();
+      return o === Pe ? !0 : x ? x(E, this) : v.unsafe(this, a).is0();
     }
     clearCofactor() {
       const { clearCofactor: x } = e;
-      return o === Oe ? this : x ? x(E, this) : this.multiplyUnsafe(o);
+      return o === Pe ? this : x ? x(E, this) : this.multiplyUnsafe(o);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(o).is0();
@@ -4152,7 +4158,7 @@ function Zr(r, e = {}) {
       return ze(x, "isCompressed"), this.assertValidity(), f(E, this, x);
     }
     toHex(x = !0) {
-      return Be(this.toBytes(x));
+      return Ue(this.toBytes(x));
     }
     toString() {
       return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
@@ -4242,7 +4248,7 @@ function en(r, e, s = {}) {
     extraEntropy: !1
   }, S = a * ks < i.ORDER;
   function y(x) {
-    const m = a >> Oe;
+    const m = a >> Pe;
     return x > m;
   }
   function I(x, m) {
@@ -4314,7 +4320,7 @@ function en(r, e, s = {}) {
       return m === "recovered" ? (P(), ve(Uint8Array.of(this.assertRecovery()), N, C)) : ve(N, C);
     }
     toHex(m) {
-      return Be(this.toBytes(m));
+      return Ue(this.toBytes(m));
     }
   }
   const K = s.bits2int || function(m) {
@@ -4353,7 +4359,7 @@ function en(r, e, s = {}) {
       const ee = o.create(Q * o.create(Y + V * O));
       if (ee === ge)
         return;
-      let It = (oe.x === V ? 0 : 2) | Number(oe.y & Oe), At = ee;
+      let It = (oe.x === V ? 0 : 2) | Number(oe.y & Pe), At = ee;
       return A && y(ee) && (At = o.neg(ee), It ^= 1), new D(V, At, S ? void 0 : It);
     }
     return { seed: F, k2sig: W };
@@ -4422,12 +4428,12 @@ function sn(r) {
 const ft = Ze(St.p, { sqrt: sn }), rn = /* @__PURE__ */ Zr(St, {
   Fp: ft,
   endo: tn
-}), nn = /* @__PURE__ */ en(rn, Rr), on = BigInt(0), De = BigInt(1), an = BigInt(2), cn = BigInt(7), ln = BigInt(256), dn = BigInt(113), Cs = [], Ns = [], Ls = [];
-for (let r = 0, e = De, s = 1, t = 0; r < 24; r++) {
+}), nn = /* @__PURE__ */ en(rn, Rr), on = BigInt(0), Me = BigInt(1), an = BigInt(2), cn = BigInt(7), ln = BigInt(256), dn = BigInt(113), Cs = [], Ns = [], Ls = [];
+for (let r = 0, e = Me, s = 1, t = 0; r < 24; r++) {
   [s, t] = [t, (2 * s + 3 * t) % 5], Cs.push(2 * (5 * t + s)), Ns.push((r + 1) * (r + 2) / 2 % 64);
   let n = on;
   for (let i = 0; i < 7; i++)
-    e = (e << De ^ (e >> cn) * dn) % ln, e & an && (n ^= De << (De << BigInt(i)) - De);
+    e = (e << Me ^ (e >> cn) * dn) % ln, e & an && (n ^= Me << (Me << BigInt(i)) - Me);
   Ls.push(n);
 }
 const Ds = yr(Ls, !0), un = Ds[0], hn = Ds[1], Xt = (r, e, s) => s > 32 ? vr(r, e, s) : br(r, e, s), Jt = (r, e, s) => s > 32 ? Er(r, e, s) : Sr(r, e, s);
@@ -4454,7 +4460,7 @@ function pn(r, e = 24) {
     }
     r[0] ^= un[t], r[1] ^= hn[t];
   }
-  Ce(s);
+  Ne(s);
 }
 class vt {
   // NOTE: we accept arguments in bytes instead of bits here.
@@ -4481,7 +4487,7 @@ class vt {
     Bt(this.state32), pn(this.state32, this.rounds), Bt(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(e) {
-    Pe(this), q(e);
+    Ce(this), q(e);
     const { blockLen: s, state: t } = this, n = e.length;
     for (let i = 0; i < n; ) {
       const o = Math.min(s - this.pos, n - i);
@@ -4499,7 +4505,7 @@ class vt {
     e[t] ^= s, s & 128 && t === n - 1 && this.keccak(), e[n - 1] ^= 128, this.keccak();
   }
   writeInto(e) {
-    Pe(this, !1), q(e), this.finish();
+    Ce(this, !1), q(e), this.finish();
     const s = this.state, { blockLen: t } = this;
     for (let n = 0, i = e.length; n < i; ) {
       this.posOut >= t && this.keccak();
@@ -4525,7 +4531,7 @@ class vt {
     return this.digestInto(new Uint8Array(this.outputLen));
   }
   destroy() {
-    this.destroyed = !0, Ce(this.state);
+    this.destroyed = !0, Ne(this.state);
   }
   _cloneInto(e) {
     const { blockLen: s, suffix: t, outputLen: n, rounds: i, enableXOF: o } = this;
@@ -4604,7 +4610,7 @@ ${t.length}`
       Qt(l),
       Qt(u)
     ).addRecoveryBit(_).recoverPublicKey(o).toBytes(!1).slice(1), y = Zt(S);
-    return "0x" + Be(y.slice(12));
+    return "0x" + Ue(y.slice(12));
   }
 }
 function gn(r) {
@@ -4815,7 +4821,7 @@ class Ie {
     });
   }
 }
-const Me = "crossx_wallet_data", ke = "crossx_mock_pin_hash";
+const $e = "crossx_wallet_data", ke = "crossx_mock_pin_hash";
 class Sn {
   constructor(e, s) {
     this.storage = e, this.pinStore = s ?? null;
@@ -4829,13 +4835,13 @@ class Sn {
   async checkWallet() {
     if (this.migrateScenario !== void 0)
       return d.log("[Mock] checkWallet → migration_required"), "migration_required";
-    const s = await this.storage.get(Me) ? "exists" : "not_found";
+    const s = await this.storage.get($e) ? "exists" : "not_found";
     return d.log(`[Mock] checkWallet → ${s}`), s;
   }
   async getOrCreateWallet(e) {
     var s;
     try {
-      const t = await this.storage.get(Me);
+      const t = await this.storage.get($e);
       if (t) return t;
       const n = {
         id: e,
@@ -4843,7 +4849,7 @@ class Sn {
         derivationPath: "m/44'/60'/0'/0/0",
         createdAt: Date.now()
       };
-      await this.storage.set(Me, n);
+      await this.storage.set($e, n);
       const i = (s = this.pinStore) == null ? void 0 : s.get();
       return i && (await this.storage.set(ke, i), d.log("[Mock] 지갑 생성 — PIN 저장됨")), n;
     } catch (t) {
@@ -4852,7 +4858,7 @@ class Sn {
   }
   /** GET /mnemonic/addresses 모킹 — PIN 불필요, 캐시된 주소 반환 */
   async getAddresses(e) {
-    const s = await this.storage.get(Me);
+    const s = await this.storage.get($e);
     return s ? [{ address: s.address, index: 0 }] : [];
   }
   async getAddress(e, s) {
@@ -4932,7 +4938,7 @@ class Sn {
       derivationPath: "m/44'/60'/0'/0/0",
       createdAt: Date.now()
     };
-    await this.storage.set(Me, t);
+    await this.storage.set($e, t);
     const n = (i = this.pinStore) == null ? void 0 : i.get();
     return n && (await this.storage.set(ke, n), d.log("[Mock] 마이그레이션 — PIN 저장됨")), t;
   }
@@ -5418,7 +5424,7 @@ class Ae {
     }
   }
 }
-class $e {
+class Be {
   constructor(e, s) {
     this.cache = /* @__PURE__ */ new Map(), this.loadedAt = 0, this.usingFallback = !1, this.adapterConfig = e, this.projectId = e.projectId, this.transport = s;
   }
@@ -5436,7 +5442,7 @@ class $e {
       const s = e.data.chains;
       return this.populateCache(s, !1), s;
     } catch {
-      const e = $e.fallbackChains();
+      const e = Be.fallbackChains();
       return this.populateCache(e, !0), e;
     }
   }
@@ -5472,13 +5478,13 @@ class $e {
     if (e.code < 0) {
       const s = typeof e.data == "string" ? e.data : e.message ?? "체인 레지스트리 요청에 실패했습니다";
       throw new g(
-        $e.mapErrorCode(e.code),
+        Be.mapErrorCode(e.code),
         s
       );
     }
   }
   fallbackOrThrow(e) {
-    const s = $e.fallbackChains().find(
+    const s = Be.fallbackChains().find(
       (t) => t.chainId === e
     );
     if (s) return s;
@@ -7455,7 +7461,7 @@ function de(r) {
   }, { passive: !1 }), document.body.appendChild(r);
 }
 const In = () => /iPad|iPhone|iPod/.test(navigator.userAgent) || navigator.platform === "MacIntel" && navigator.maxTouchPoints > 1;
-function We() {
+function qe() {
   if (In()) {
     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", () => {
@@ -8352,7 +8358,7 @@ class ri {
     return new Promise((n) => {
       var S;
       le();
-      const i = [...e], o = Gn(i, this.tokens, t), a = We();
+      const i = [...e], o = Gn(i, this.tokens, t), a = qe();
       de(o);
       let c = !1;
       const l = () => {
@@ -8433,7 +8439,7 @@ class ri {
         accountLabel: (t == null ? void 0 : t.sessionAlert_accountLabel) ?? "Account",
         signOutLabel: (t == null ? void 0 : t.sessionAlert_signOutButton) ?? "Sign out",
         signInAgainLabel: (t == null ? void 0 : t.sessionAlert_signInAgainButton) ?? "Sign in again"
-      }), i = We();
+      }), i = qe();
       de(n);
       let o = !1;
       const a = () => {
@@ -8502,7 +8508,7 @@ class ri {
       }, o = {
         title: (t == null ? void 0 : t.pinSetup_confirmTitle) ?? "Confirm PIN",
         headerSubtitle: (t == null ? void 0 : t.pinSetup_confirmSubtitle) ?? "Enter your PIN again to confirm."
-      }, a = rs(this.tokens, Jn(n)), c = We();
+      }, a = rs(this.tokens, Jn(n)), c = qe();
       de(a);
       let l = !1;
       const u = () => {
@@ -8599,7 +8605,7 @@ class ri {
           attemptCount: e == null ? void 0 : e.attemptCount,
           maxAttempts: e == null ? void 0 : e.maxAttempts
         })
-      ), l = We();
+      ), l = qe();
       de(c);
       let u = !1;
       const p = () => {
@@ -8782,7 +8788,7 @@ class ni {
 }
 function hi(r, e) {
   r.debug;
-  const s = Ke.production, t = {
+  const s = Oe.production, t = {
     ...r,
     oauthServiceUrl: s.oauthServiceUrl,
     authApiUrl: s.authApiUrl,
@@ -8805,7 +8811,7 @@ function hi(r, e) {
     u,
     p
   ));
-  const f = new $e(n, c), w = new ri(r.theme ?? "light", r.themeTokens), S = e != null && e.wrapConfirmation ? e.wrapConfirmation(w) : w, y = new ut(
+  const f = new Be(n, c), w = new ri(r.theme ?? "light", r.themeTokens), S = e != null && e.wrapConfirmation ? e.wrapConfirmation(w) : w, y = new ut(
     t,
     n,
     o,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@nexus-cross/crossx-sdk-core",
-  "version": "1.4.1",
+  "version": "1.4.2-beta.1",
   "description": "CROSSx Core SDK - Vanilla JavaScript Embedded Wallet SDK",
   "type": "module",
   "main": "./dist/index.cjs",