module-develop-kit 0.1.0 → 0.1.1

package/dist/index.es.js

@@ -1,37 +1,37 @@
-var at = { exports: {} }, li = at.exports, Pt;
-function lt() {
+var lt = { exports: {} }, ai = lt.exports, Pt;
+function at() {
   return Pt || (Pt = 1, function(v, z) {
     (function() {
-      var S, T = 244837814094590, I = (T & 16777215) == 15715070;
+      var S, y = 244837814094590, I = (y & 16777215) == 15715070;
       function r(t, e, i) {
         t != null && (typeof t == "number" ? this.fromNumber(t, e, i) : e == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, e));
       }
       function g() {
         return new r(null);
       }
-      function c(t, e, i, n, u, a) {
-        for (; --a >= 0; ) {
-          var b = e * this[t++] + i[n] + u;
-          u = Math.floor(b / 67108864), i[n++] = b & 67108863;
+      function c(t, e, i, n, u, l) {
+        for (; --l >= 0; ) {
+          var T = e * this[t++] + i[n] + u;
+          u = Math.floor(T / 67108864), i[n++] = T & 67108863;
         }
         return u;
       }
-      function y(t, e, i, n, u, a) {
-        for (var b = e & 32767, F = e >> 15; --a >= 0; ) {
-          var V = this[t] & 32767, j = this[t++] >> 15, $ = F * V + j * b;
-          V = b * V + (($ & 32767) << 15) + i[n] + (u & 1073741823), u = (V >>> 30) + ($ >>> 15) + F * j + (u >>> 30), i[n++] = V & 1073741823;
+      function b(t, e, i, n, u, l) {
+        for (var T = e & 32767, F = e >> 15; --l >= 0; ) {
+          var V = this[t] & 32767, k = this[t++] >> 15, $ = F * V + k * T;
+          V = T * V + (($ & 32767) << 15) + i[n] + (u & 1073741823), u = (V >>> 30) + ($ >>> 15) + F * k + (u >>> 30), i[n++] = V & 1073741823;
         }
         return u;
       }
-      function p(t, e, i, n, u, a) {
-        for (var b = e & 16383, F = e >> 14; --a >= 0; ) {
-          var V = this[t] & 16383, j = this[t++] >> 14, $ = F * V + j * b;
-          V = b * V + (($ & 16383) << 14) + i[n] + u, u = (V >> 28) + ($ >> 14) + F * j, i[n++] = V & 268435455;
+      function p(t, e, i, n, u, l) {
+        for (var T = e & 16383, F = e >> 14; --l >= 0; ) {
+          var V = this[t] & 16383, k = this[t++] >> 14, $ = F * V + k * T;
+          V = T * V + (($ & 16383) << 14) + i[n] + u, u = (V >> 28) + ($ >> 14) + F * k, i[n++] = V & 268435455;
         }
         return u;
       }
       var d = typeof navigator < "u";
-      d && I && navigator.appName == "Microsoft Internet Explorer" ? (r.prototype.am = y, S = 30) : d && I && navigator.appName != "Netscape" ? (r.prototype.am = c, S = 26) : (r.prototype.am = p, S = 28), r.prototype.DB = S, r.prototype.DM = (1 << S) - 1, r.prototype.DV = 1 << S;
+      d && I && navigator.appName == "Microsoft Internet Explorer" ? (r.prototype.am = b, S = 30) : d && I && navigator.appName != "Netscape" ? (r.prototype.am = c, S = 26) : (r.prototype.am = p, S = 28), r.prototype.DB = S, r.prototype.DM = (1 << S) - 1, r.prototype.DV = 1 << S;
       var w = 52;
       r.prototype.FV = Math.pow(2, w), r.prototype.F1 = w - S, r.prototype.F2 = 2 * S - w;
       var B = "0123456789abcdefghijklmnopqrstuvwxyz", E = new Array(), D, M;
@@ -41,7 +41,7 @@ function lt() {
       function f(t) {
         return B.charAt(t);
       }
-      function l(t, e) {
+      function a(t, e) {
         var i = E[t.charCodeAt(e)];
         return i ?? -1;
       }
@@ -69,15 +69,15 @@ function lt() {
           return;
         }
         this.t = 0, this.s = 0;
-        for (var n = t.length, u = !1, a = 0; --n >= 0; ) {
-          var b = i == 8 ? t[n] & 255 : l(t, n);
-          if (b < 0) {
+        for (var n = t.length, u = !1, l = 0; --n >= 0; ) {
+          var T = i == 8 ? t[n] & 255 : a(t, n);
+          if (T < 0) {
             t.charAt(n) == "-" && (u = !0);
             continue;
           }
-          u = !1, a == 0 ? this[this.t++] = b : a + i > this.DB ? (this[this.t - 1] |= (b & (1 << this.DB - a) - 1) << a, this[this.t++] = b >> this.DB - a) : this[this.t - 1] |= b << a, a += i, a >= this.DB && (a -= this.DB);
+          u = !1, l == 0 ? this[this.t++] = T : l + i > this.DB ? (this[this.t - 1] |= (T & (1 << this.DB - l) - 1) << l, this[this.t++] = T >> this.DB - l) : this[this.t - 1] |= T << l, l += i, l >= this.DB && (l -= this.DB);
         }
-        i == 8 && (t[0] & 128) != 0 && (this.s = -1, a > 0 && (this[this.t - 1] |= (1 << this.DB - a) - 1 << a)), this.clamp(), u && r.ZERO.subTo(this, this);
+        i == 8 && (t[0] & 128) != 0 && (this.s = -1, l > 0 && (this[this.t - 1] |= (1 << this.DB - l) - 1 << l)), this.clamp(), u && r.ZERO.subTo(this, this);
       }
       function m() {
         for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
@@ -91,11 +91,11 @@ function lt() {
         else if (t == 32) e = 5;
         else if (t == 4) e = 2;
         else return this.toRadix(t);
-        var i = (1 << e) - 1, n, u = !1, a = "", b = this.t, F = this.DB - b * this.DB % e;
-        if (b-- > 0)
-          for (F < this.DB && (n = this[b] >> F) > 0 && (u = !0, a = f(n)); b >= 0; )
-            F < e ? (n = (this[b] & (1 << F) - 1) << e - F, n |= this[--b] >> (F += this.DB - e)) : (n = this[b] >> (F -= e) & i, F <= 0 && (F += this.DB, --b)), n > 0 && (u = !0), u && (a += f(n));
-        return u ? a : "0";
+        var i = (1 << e) - 1, n, u = !1, l = "", T = this.t, F = this.DB - T * this.DB % e;
+        if (T-- > 0)
+          for (F < this.DB && (n = this[T] >> F) > 0 && (u = !0, l = f(n)); T >= 0; )
+            F < e ? (n = (this[T] & (1 << F) - 1) << e - F, n |= this[--T] >> (F += this.DB - e)) : (n = this[T] >> (F -= e) & i, F <= 0 && (F += this.DB, --T)), n > 0 && (u = !0), u && (l += f(n));
+        return u ? l : "0";
       }
       function P() {
         var t = g();
@@ -130,11 +130,11 @@ function lt() {
         e.t = Math.max(this.t - t, 0), e.s = this.s;
       }
       function Z(t, e) {
-        var i = t % this.DB, n = this.DB - i, u = (1 << n) - 1, a = Math.floor(t / this.DB), b = this.s << i & this.DM, F;
+        var i = t % this.DB, n = this.DB - i, u = (1 << n) - 1, l = Math.floor(t / this.DB), T = this.s << i & this.DM, F;
         for (F = this.t - 1; F >= 0; --F)
-          e[F + a + 1] = this[F] >> n | b, b = (this[F] & u) << i;
-        for (F = a - 1; F >= 0; --F) e[F] = 0;
-        e[a] = b, e.t = this.t + a + 1, e.s = this.s, e.clamp();
+          e[F + l + 1] = this[F] >> n | T, T = (this[F] & u) << i;
+        for (F = l - 1; F >= 0; --F) e[F] = 0;
+        e[l] = T, e.t = this.t + l + 1, e.s = this.s, e.clamp();
       }
       function W(t, e) {
         e.s = this.s;
@@ -143,11 +143,11 @@ function lt() {
           e.t = 0;
           return;
         }
-        var n = t % this.DB, u = this.DB - n, a = (1 << n) - 1;
+        var n = t % this.DB, u = this.DB - n, l = (1 << n) - 1;
         e[0] = this[i] >> n;
-        for (var b = i + 1; b < this.t; ++b)
-          e[b - i - 1] |= (this[b] & a) << u, e[b - i] = this[b] >> n;
-        n > 0 && (e[this.t - i - 1] |= (this.s & a) << u), e.t = this.t - i, e.clamp();
+        for (var T = i + 1; T < this.t; ++T)
+          e[T - i - 1] |= (this[T] & l) << u, e[T - i] = this[T] >> n;
+        n > 0 && (e[this.t - i - 1] |= (this.s & l) << u), e.t = this.t - i, e.clamp();
       }
       function G(t, e) {
         for (var i = 0, n = 0, u = Math.min(t.t, this.t); i < u; )
@@ -186,18 +186,18 @@ function lt() {
             return;
           }
           i == null && (i = g());
-          var a = g(), b = this.s, F = t.s, V = this.DB - q(n[n.t - 1]);
-          V > 0 ? (n.lShiftTo(V, a), u.lShiftTo(V, i)) : (n.copyTo(a), u.copyTo(i));
-          var j = a.t, $ = a[j - 1];
+          var l = g(), T = this.s, F = t.s, V = this.DB - q(n[n.t - 1]);
+          V > 0 ? (n.lShiftTo(V, l), u.lShiftTo(V, i)) : (n.copyTo(l), u.copyTo(i));
+          var k = l.t, $ = l[k - 1];
           if ($ != 0) {
-            var X = $ * (1 << this.F1) + (j > 1 ? a[j - 2] >> this.F2 : 0), Q = this.FV / X, ut = (1 << this.F1) / X, K = 1 << this.F2, J = i.t, ct = J - j, tt = e ?? g();
-            for (a.dlShiftTo(ct, tt), i.compareTo(tt) >= 0 && (i[i.t++] = 1, i.subTo(tt, i)), r.ONE.dlShiftTo(j, tt), tt.subTo(a, a); a.t < j; ) a[a.t++] = 0;
+            var X = $ * (1 << this.F1) + (k > 1 ? l[k - 2] >> this.F2 : 0), Q = this.FV / X, ut = (1 << this.F1) / X, K = 1 << this.F2, J = i.t, ct = J - k, tt = e ?? g();
+            for (l.dlShiftTo(ct, tt), i.compareTo(tt) >= 0 && (i[i.t++] = 1, i.subTo(tt, i)), r.ONE.dlShiftTo(k, tt), tt.subTo(l, l); l.t < k; ) l[l.t++] = 0;
             for (; --ct >= 0; ) {
               var gt = i[--J] == $ ? this.DM : Math.floor(i[J] * Q + (i[J - 1] + K) * ut);
-              if ((i[J] += a.am(0, gt, i, ct, 0, j)) < gt)
-                for (a.dlShiftTo(ct, tt), i.subTo(tt, i); i[J] < --gt; ) i.subTo(tt, i);
+              if ((i[J] += l.am(0, gt, i, ct, 0, k)) < gt)
+                for (l.dlShiftTo(ct, tt), i.subTo(tt, i); i[J] < --gt; ) i.subTo(tt, i);
             }
-            e != null && (i.drShiftTo(j, e), b != F && r.ZERO.subTo(e, e)), i.t = j, i.clamp(), V > 0 && i.rShiftTo(V, i), b < 0 && r.ZERO.subTo(i, i);
+            e != null && (i.drShiftTo(k, e), T != F && r.ZERO.subTo(e, e)), i.t = k, i.clamp(), V > 0 && i.rShiftTo(V, i), T < 0 && r.ZERO.subTo(i, i);
           }
         }
       }
@@ -208,7 +208,7 @@ function lt() {
       function A(t) {
         this.m = t;
       }
-      function jt(t) {
+      function kt(t) {
         return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t;
       }
       function Ut(t) {
@@ -223,7 +223,7 @@ function lt() {
       function Xt(t, e) {
         t.squareTo(e), this.reduce(e);
       }
-      A.prototype.convert = jt, A.prototype.revert = Ut, A.prototype.reduce = Zt, A.prototype.mulTo = _t, A.prototype.sqrTo = Xt;
+      A.prototype.convert = kt, A.prototype.revert = Ut, A.prototype.reduce = Zt, A.prototype.mulTo = _t, A.prototype.sqrTo = Xt;
       function $t() {
         if (this.t < 1) return 0;
         var t = this[0];
@@ -264,12 +264,12 @@ function lt() {
       }
       function te(t, e) {
         if (t > 4294967295 || t < 1) return r.ONE;
-        var i = g(), n = g(), u = e.convert(this), a = q(t) - 1;
-        for (u.copyTo(i); --a >= 0; )
-          if (e.sqrTo(i, n), (t & 1 << a) > 0) e.mulTo(n, u, i);
+        var i = g(), n = g(), u = e.convert(this), l = q(t) - 1;
+        for (u.copyTo(i); --l >= 0; )
+          if (e.sqrTo(i, n), (t & 1 << l) > 0) e.mulTo(n, u, i);
           else {
-            var b = i;
-            i = n, n = b;
+            var T = i;
+            i = n, n = T;
           }
         return e.revert(i);
       }
@@ -306,22 +306,22 @@ function lt() {
       }
       function he(t) {
         if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
-        var e = this.chunkSize(t), i = Math.pow(t, e), n = x(i), u = g(), a = g(), b = "";
-        for (this.divRemTo(n, u, a); u.signum() > 0; )
-          b = (i + a.intValue()).toString(t).substr(1) + b, u.divRemTo(n, u, a);
-        return a.intValue().toString(t) + b;
+        var e = this.chunkSize(t), i = Math.pow(t, e), n = x(i), u = g(), l = g(), T = "";
+        for (this.divRemTo(n, u, l); u.signum() > 0; )
+          T = (i + l.intValue()).toString(t).substr(1) + T, u.divRemTo(n, u, l);
+        return l.intValue().toString(t) + T;
       }
       function ue(t, e) {
         this.fromInt(0), e == null && (e = 10);
-        for (var i = this.chunkSize(e), n = Math.pow(e, i), u = !1, a = 0, b = 0, F = 0; F < t.length; ++F) {
-          var V = l(t, F);
+        for (var i = this.chunkSize(e), n = Math.pow(e, i), u = !1, l = 0, T = 0, F = 0; F < t.length; ++F) {
+          var V = a(t, F);
           if (V < 0) {
             t.charAt(F) == "-" && this.signum() == 0 && (u = !0);
             continue;
           }
-          b = e * b + V, ++a >= i && (this.dMultiply(n), this.dAddOffset(b, 0), a = 0, b = 0);
+          T = e * T + V, ++l >= i && (this.dMultiply(n), this.dAddOffset(T, 0), l = 0, T = 0);
         }
-        a > 0 && (this.dMultiply(Math.pow(e, a)), this.dAddOffset(b, 0)), u && r.ZERO.subTo(this, this);
+        l > 0 && (this.dMultiply(Math.pow(e, l)), this.dAddOffset(T, 0)), u && r.ZERO.subTo(this, this);
       }
       function ce(t, e, i) {
         if (typeof e == "number")
@@ -334,7 +334,7 @@ function lt() {
           n.length = (t >> 3) + 1, e.nextBytes(n), u > 0 ? n[0] &= (1 << u) - 1 : n[0] = 0, this.fromString(n, 256);
         }
       }
-      function ae() {
+      function le() {
         var t = this.t, e = new Array();
         e[0] = this.s;
         var i = this.DB - t * this.DB % 8, n, u = 0;
@@ -343,7 +343,7 @@ function lt() {
             i < 8 ? (n = (this[t] & (1 << i) - 1) << 8 - i, n |= this[--t] >> (i += this.DB - 8)) : (n = this[t] >> (i -= 8) & 255, i <= 0 && (i += this.DB, --t)), (n & 128) != 0 && (n |= -256), u == 0 && (this.s & 128) != (n & 128) && ++u, (u > 0 || n != this.s) && (e[u++] = n);
         return e;
       }
-      function le(t) {
+      function ae(t) {
         return this.compareTo(t) == 0;
       }
       function xe(t) {
@@ -353,13 +353,13 @@ function lt() {
         return this.compareTo(t) > 0 ? this : t;
       }
       function de(t, e, i) {
-        var n, u, a = Math.min(t.t, this.t);
-        for (n = 0; n < a; ++n) i[n] = e(this[n], t[n]);
+        var n, u, l = Math.min(t.t, this.t);
+        for (n = 0; n < l; ++n) i[n] = e(this[n], t[n]);
         if (t.t < this.t) {
-          for (u = t.s & this.DM, n = a; n < this.t; ++n) i[n] = e(this[n], u);
+          for (u = t.s & this.DM, n = l; n < this.t; ++n) i[n] = e(this[n], u);
           i.t = this.t;
         } else {
-          for (u = this.s & this.DM, n = a; n < t.t; ++n) i[n] = e(u, t[n]);
+          for (u = this.s & this.DM, n = l; n < t.t; ++n) i[n] = e(u, t[n]);
           i.t = t.t;
         }
         i.s = e(this.s, t.s), i.clamp();
@@ -482,10 +482,10 @@ function lt() {
         var e = g(), i = g();
         return this.divRemTo(t, e, i), new Array(e, i);
       }
-      function ke(t) {
+      function je(t) {
         this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
       }
-      function je(t, e) {
+      function ke(t, e) {
         if (t != 0) {
           for (; this.t <= e; ) this[this.t++] = 0;
           for (this[e] += t; this[e] >= this.DV; )
@@ -547,30 +547,30 @@ function lt() {
       }
       it.prototype.convert = Ge, it.prototype.revert = Ye, it.prototype.reduce = Ke, it.prototype.mulTo = We, it.prototype.sqrTo = Je;
       function Qe(t, e) {
-        var i = t.bitLength(), n, u = x(1), a;
+        var i = t.bitLength(), n, u = x(1), l;
         if (i <= 0) return u;
-        i < 18 ? n = 1 : i < 48 ? n = 3 : i < 144 ? n = 4 : i < 768 ? n = 5 : n = 6, i < 8 ? a = new A(e) : e.isEven() ? a = new it(e) : a = new et(e);
-        var b = new Array(), F = 3, V = n - 1, j = (1 << n) - 1;
-        if (b[1] = a.convert(this), n > 1) {
+        i < 18 ? n = 1 : i < 48 ? n = 3 : i < 144 ? n = 4 : i < 768 ? n = 5 : n = 6, i < 8 ? l = new A(e) : e.isEven() ? l = new it(e) : l = new et(e);
+        var T = new Array(), F = 3, V = n - 1, k = (1 << n) - 1;
+        if (T[1] = l.convert(this), n > 1) {
           var $ = g();
-          for (a.sqrTo(b[1], $); F <= j; )
-            b[F] = g(), a.mulTo($, b[F - 2], b[F]), F += 2;
+          for (l.sqrTo(T[1], $); F <= k; )
+            T[F] = g(), l.mulTo($, T[F - 2], T[F]), F += 2;
         }
         var X = t.t - 1, Q, ut = !0, K = g(), J;
         for (i = q(t[X]) - 1; X >= 0; ) {
-          for (i >= V ? Q = t[X] >> i - V & j : (Q = (t[X] & (1 << i + 1) - 1) << V - i, X > 0 && (Q |= t[X - 1] >> this.DB + i - V)), F = n; (Q & 1) == 0; )
+          for (i >= V ? Q = t[X] >> i - V & k : (Q = (t[X] & (1 << i + 1) - 1) << V - i, X > 0 && (Q |= t[X - 1] >> this.DB + i - V)), F = n; (Q & 1) == 0; )
             Q >>= 1, --F;
           if ((i -= F) < 0 && (i += this.DB, --X), ut)
-            b[Q].copyTo(u), ut = !1;
+            T[Q].copyTo(u), ut = !1;
           else {
             for (; F > 1; )
-              a.sqrTo(u, K), a.sqrTo(K, u), F -= 2;
-            F > 0 ? a.sqrTo(u, K) : (J = u, u = K, K = J), a.mulTo(K, b[Q], u);
+              l.sqrTo(u, K), l.sqrTo(K, u), F -= 2;
+            F > 0 ? l.sqrTo(u, K) : (J = u, u = K, K = J), l.mulTo(K, T[Q], u);
           }
           for (; X >= 0 && (t[X] & 1 << i) == 0; )
-            a.sqrTo(u, K), J = u, u = K, K = J, --i < 0 && (i = this.DB - 1, --X);
+            l.sqrTo(u, K), J = u, u = K, K = J, --i < 0 && (i = this.DB - 1, --X);
         }
-        return a.revert(u);
+        return l.revert(u);
       }
       function ti(t) {
         var e = this.s < 0 ? this.negate() : this.clone(), i = t.s < 0 ? t.negate() : t.clone();
@@ -578,11 +578,11 @@ function lt() {
           var n = e;
           e = i, i = n;
         }
-        var u = e.getLowestSetBit(), a = i.getLowestSetBit();
-        if (a < 0) return e;
-        for (u < a && (a = u), a > 0 && (e.rShiftTo(a, e), i.rShiftTo(a, i)); e.signum() > 0; )
+        var u = e.getLowestSetBit(), l = i.getLowestSetBit();
+        if (l < 0) return e;
+        for (u < l && (l = u), l > 0 && (e.rShiftTo(l, e), i.rShiftTo(l, i)); e.signum() > 0; )
           (u = e.getLowestSetBit()) > 0 && e.rShiftTo(u, e), (u = i.getLowestSetBit()) > 0 && i.rShiftTo(u, i), e.compareTo(i) >= 0 ? (e.subTo(i, e), e.rShiftTo(1, e)) : (i.subTo(e, i), i.rShiftTo(1, i));
-        return a > 0 && i.lShiftTo(a, i), i;
+        return l > 0 && i.lShiftTo(l, i), i;
       }
       function ei(t) {
         if (t <= 0) return 0;
@@ -595,12 +595,12 @@ function lt() {
       function ii(t) {
         var e = t.isEven();
         if (this.isEven() && e || t.signum() == 0) return r.ZERO;
-        for (var i = t.clone(), n = this.clone(), u = x(1), a = x(0), b = x(0), F = x(1); i.signum() != 0; ) {
+        for (var i = t.clone(), n = this.clone(), u = x(1), l = x(0), T = x(0), F = x(1); i.signum() != 0; ) {
           for (; i.isEven(); )
-            i.rShiftTo(1, i), e ? ((!u.isEven() || !a.isEven()) && (u.addTo(this, u), a.subTo(t, a)), u.rShiftTo(1, u)) : a.isEven() || a.subTo(t, a), a.rShiftTo(1, a);
+            i.rShiftTo(1, i), e ? ((!u.isEven() || !l.isEven()) && (u.addTo(this, u), l.subTo(t, l)), u.rShiftTo(1, u)) : l.isEven() || l.subTo(t, l), l.rShiftTo(1, l);
           for (; n.isEven(); )
-            n.rShiftTo(1, n), e ? ((!b.isEven() || !F.isEven()) && (b.addTo(this, b), F.subTo(t, F)), b.rShiftTo(1, b)) : F.isEven() || F.subTo(t, F), F.rShiftTo(1, F);
-          i.compareTo(n) >= 0 ? (i.subTo(n, i), e && u.subTo(b, u), a.subTo(F, a)) : (n.subTo(i, n), e && b.subTo(u, b), F.subTo(a, F));
+            n.rShiftTo(1, n), e ? ((!T.isEven() || !F.isEven()) && (T.addTo(this, T), F.subTo(t, F)), T.rShiftTo(1, T)) : F.isEven() || F.subTo(t, F), F.rShiftTo(1, F);
+          i.compareTo(n) >= 0 ? (i.subTo(n, i), e && u.subTo(T, u), l.subTo(F, l)) : (n.subTo(i, n), e && T.subTo(u, T), F.subTo(l, F));
         }
         if (n.compareTo(r.ONE) != 0) return r.ZERO;
         if (F.compareTo(t) >= 0) return F.subtract(t);
@@ -628,48 +628,48 @@ function lt() {
         if (i <= 0) return !1;
         var n = e.shiftRight(i);
         t = t + 1 >> 1, t > U.length && (t = U.length);
-        for (var u = g(), a = 0; a < t; ++a) {
+        for (var u = g(), l = 0; l < t; ++l) {
           u.fromInt(U[Math.floor(Math.random() * U.length)]);
-          var b = u.modPow(n, this);
-          if (b.compareTo(r.ONE) != 0 && b.compareTo(e) != 0) {
-            for (var F = 1; F++ < i && b.compareTo(e) != 0; )
-              if (b = b.modPowInt(2, this), b.compareTo(r.ONE) == 0) return !1;
-            if (b.compareTo(e) != 0) return !1;
+          var T = u.modPow(n, this);
+          if (T.compareTo(r.ONE) != 0 && T.compareTo(e) != 0) {
+            for (var F = 1; F++ < i && T.compareTo(e) != 0; )
+              if (T = T.modPowInt(2, this), T.compareTo(r.ONE) == 0) return !1;
+            if (T.compareTo(e) != 0) return !1;
           }
         }
         return !0;
       }
-      r.prototype.chunkSize = oe, r.prototype.toRadix = he, r.prototype.fromRadix = ue, r.prototype.fromNumber = ce, r.prototype.bitwiseTo = de, r.prototype.changeBit = Ee, r.prototype.addTo = Me, r.prototype.dMultiply = ke, r.prototype.dAddOffset = je, r.prototype.multiplyLowerTo = Xe, r.prototype.multiplyUpperTo = $e, r.prototype.modInt = ei, r.prototype.millerRabin = si, r.prototype.clone = ie, r.prototype.intValue = ne, r.prototype.byteValue = re, r.prototype.shortValue = se, r.prototype.signum = fe, r.prototype.toByteArray = ae, r.prototype.equals = le, r.prototype.min = xe, r.prototype.max = pe, r.prototype.and = me, r.prototype.or = ve, r.prototype.xor = ye, r.prototype.andNot = be, r.prototype.not = Te, r.prototype.shiftLeft = we, r.prototype.shiftRight = Fe, r.prototype.getLowestSetBit = Se, r.prototype.bitCount = qe, r.prototype.testBit = Ie, r.prototype.setBit = Re, r.prototype.clearBit = Ae, r.prototype.flipBit = Pe, r.prototype.add = Ce, r.prototype.subtract = Oe, r.prototype.multiply = He, r.prototype.divide = Le, r.prototype.remainder = Ve, r.prototype.divideAndRemainder = ze, r.prototype.modPow = Qe, r.prototype.modInverse = ii, r.prototype.pow = _e, r.prototype.gcd = ti, r.prototype.isProbablePrime = ri, r.prototype.square = Ne, r.prototype.Barrett = it;
-      var ht, _, k;
+      r.prototype.chunkSize = oe, r.prototype.toRadix = he, r.prototype.fromRadix = ue, r.prototype.fromNumber = ce, r.prototype.bitwiseTo = de, r.prototype.changeBit = Ee, r.prototype.addTo = Me, r.prototype.dMultiply = je, r.prototype.dAddOffset = ke, r.prototype.multiplyLowerTo = Xe, r.prototype.multiplyUpperTo = $e, r.prototype.modInt = ei, r.prototype.millerRabin = si, r.prototype.clone = ie, r.prototype.intValue = ne, r.prototype.byteValue = re, r.prototype.shortValue = se, r.prototype.signum = fe, r.prototype.toByteArray = le, r.prototype.equals = ae, r.prototype.min = xe, r.prototype.max = pe, r.prototype.and = me, r.prototype.or = ve, r.prototype.xor = ye, r.prototype.andNot = be, r.prototype.not = Te, r.prototype.shiftLeft = we, r.prototype.shiftRight = Fe, r.prototype.getLowestSetBit = Se, r.prototype.bitCount = qe, r.prototype.testBit = Ie, r.prototype.setBit = Re, r.prototype.clearBit = Ae, r.prototype.flipBit = Pe, r.prototype.add = Ce, r.prototype.subtract = Oe, r.prototype.multiply = He, r.prototype.divide = Le, r.prototype.remainder = Ve, r.prototype.divideAndRemainder = ze, r.prototype.modPow = Qe, r.prototype.modInverse = ii, r.prototype.pow = _e, r.prototype.gcd = ti, r.prototype.isProbablePrime = ri, r.prototype.square = Ne, r.prototype.Barrett = it;
+      var ht, _, j;
       function oi(t) {
-        _[k++] ^= t & 255, _[k++] ^= t >> 8 & 255, _[k++] ^= t >> 16 & 255, _[k++] ^= t >> 24 & 255, k >= dt && (k -= dt);
+        _[j++] ^= t & 255, _[j++] ^= t >> 8 & 255, _[j++] ^= t >> 16 & 255, _[j++] ^= t >> 24 & 255, j >= dt && (j -= dt);
       }
       function It() {
         oi((/* @__PURE__ */ new Date()).getTime());
       }
       if (_ == null) {
-        _ = new Array(), k = 0;
+        _ = new Array(), j = 0;
         var Y;
         if (typeof window < "u" && window.crypto) {
           if (window.crypto.getRandomValues) {
             var Et = new Uint8Array(32);
             for (window.crypto.getRandomValues(Et), Y = 0; Y < 32; ++Y)
-              _[k++] = Et[Y];
+              _[j++] = Et[Y];
           } else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
             var Rt = window.crypto.random(32);
             for (Y = 0; Y < Rt.length; ++Y)
-              _[k++] = Rt.charCodeAt(Y) & 255;
+              _[j++] = Rt.charCodeAt(Y) & 255;
           }
         }
-        for (; k < dt; )
-          Y = Math.floor(65536 * Math.random()), _[k++] = Y >>> 8, _[k++] = Y & 255;
-        k = 0, It();
+        for (; j < dt; )
+          Y = Math.floor(65536 * Math.random()), _[j++] = Y >>> 8, _[j++] = Y & 255;
+        j = 0, It();
       }
       function fi() {
         if (ht == null) {
-          for (It(), ht = ai(), ht.init(_), k = 0; k < _.length; ++k)
-            _[k] = 0;
-          k = 0;
+          for (It(), ht = li(), ht.init(_), j = 0; j < _.length; ++j)
+            _[j] = 0;
+          j = 0;
         }
         return ht.next();
       }
@@ -696,7 +696,7 @@ function lt() {
         return this.i = this.i + 1 & 255, this.j = this.j + this.S[this.i] & 255, t = this.S[this.i], this.S[this.i] = this.S[this.j], this.S[this.j] = t, this.S[t + this.S[this.i] & 255];
       }
       pt.prototype.init = ui, pt.prototype.next = ci;
-      function ai() {
+      function li() {
         return new pt();
       }
       var dt = 256;
@@ -705,16 +705,16 @@ function lt() {
         BigInteger: r,
         SecureRandom: At
       };
-    }).call(li);
-  }(at)), at.exports;
+    }).call(ai);
+  }(lt)), lt.exports;
 }
 var mt, Mt;
 function xi() {
   if (Mt) return mt;
   Mt = 1;
-  const { BigInteger: v } = lt();
-  function z(y) {
-    let p = y.toString(16);
+  const { BigInteger: v } = at();
+  function z(b) {
+    let p = b.toString(16);
     if (p[0] !== "-")
       p.length % 2 === 1 ? p = "0" + p : p.match(/^[0-7]/) || (p = "00" + p);
     else {
@@ -723,7 +723,7 @@ function xi() {
       d % 2 === 1 ? d += 1 : p.match(/^[0-7]/) || (d += 2);
       let w = "";
       for (let B = 0; B < d; B++) w += "f";
-      w = new v(w, 16), p = w.xor(y).add(v.ONE), p = p.toString(16).replace(/^-/, "");
+      w = new v(w, 16), p = w.xor(b).add(v.ONE), p = p.toString(16).replace(/^-/, "");
     }
     return p;
   }
@@ -746,7 +746,7 @@ function xi() {
       return "";
     }
   }
-  class T extends S {
+  class y extends S {
     constructor(p) {
       super(), this.t = "02", p && (this.v = z(p));
     }
@@ -762,31 +762,31 @@ function xi() {
       return this.v = this.asn1Array.map((p) => p.getEncodedHex()).join(""), this.v;
     }
   }
-  function r(y, p) {
-    return +y[p + 2] < 8 ? 1 : +y.substr(p + 2, 2) & 128;
+  function r(b, p) {
+    return +b[p + 2] < 8 ? 1 : +b.substr(p + 2, 2) & 128;
   }
-  function g(y, p) {
-    const d = r(y, p), w = y.substr(p + 2, d * 2);
+  function g(b, p) {
+    const d = r(b, p), w = b.substr(p + 2, d * 2);
     return w ? (+w[0] < 8 ? new v(w, 16) : new v(w.substr(2), 16)).intValue() : -1;
   }
-  function c(y, p) {
-    const d = r(y, p);
+  function c(b, p) {
+    const d = r(b, p);
     return p + (d + 1) * 2;
   }
   return mt = {
     /**
      * ASN.1 der 编码，针对 sm2 签名
      */
-    encodeDer(y, p) {
-      const d = new T(y), w = new T(p);
+    encodeDer(b, p) {
+      const d = new y(b), w = new y(p);
       return new I([d, w]).getEncodedHex();
     },
     /**
      * 解析 ASN.1 der，针对 sm2 验签
      */
-    decodeDer(y) {
-      const p = c(y, 0), d = c(y, p), w = g(y, p), B = y.substr(d, w * 2), E = d + B.length, D = c(y, E), M = g(y, E), f = y.substr(D, M * 2), l = new v(B, 16), h = new v(f, 16);
-      return { r: l, s: h };
+    decodeDer(b) {
+      const p = c(b, 0), d = c(b, p), w = g(b, p), B = b.substr(d, w * 2), E = d + B.length, D = c(b, E), M = g(b, E), f = b.substr(D, M * 2), a = new v(B, 16), h = new v(f, 16);
+      return { r: a, s: h };
     }
   }, mt;
 }
@@ -794,10 +794,10 @@ var vt, Ct;
 function pi() {
   if (Ct) return vt;
   Ct = 1;
-  const { BigInteger: v } = lt(), z = new v("2"), S = new v("3");
-  class T {
-    constructor(c, y) {
-      this.x = y, this.q = c;
+  const { BigInteger: v } = at(), z = new v("2"), S = new v("3");
+  class y {
+    constructor(c, b) {
+      this.x = b, this.q = c;
     }
     /**
      * 判断相等
@@ -815,42 +815,42 @@ function pi() {
      * 取反
      */
     negate() {
-      return new T(this.q, this.x.negate().mod(this.q));
+      return new y(this.q, this.x.negate().mod(this.q));
     }
     /**
      * 相加
      */
     add(c) {
-      return new T(this.q, this.x.add(c.toBigInteger()).mod(this.q));
+      return new y(this.q, this.x.add(c.toBigInteger()).mod(this.q));
     }
     /**
      * 相减
      */
     subtract(c) {
-      return new T(this.q, this.x.subtract(c.toBigInteger()).mod(this.q));
+      return new y(this.q, this.x.subtract(c.toBigInteger()).mod(this.q));
     }
     /**
      * 相乘
      */
     multiply(c) {
-      return new T(this.q, this.x.multiply(c.toBigInteger()).mod(this.q));
+      return new y(this.q, this.x.multiply(c.toBigInteger()).mod(this.q));
     }
     /**
      * 相除
      */
     divide(c) {
-      return new T(this.q, this.x.multiply(c.toBigInteger().modInverse(this.q)).mod(this.q));
+      return new y(this.q, this.x.multiply(c.toBigInteger().modInverse(this.q)).mod(this.q));
     }
     /**
      * 平方
      */
     square() {
-      return new T(this.q, this.x.square().mod(this.q));
+      return new y(this.q, this.x.square().mod(this.q));
     }
   }
   class I {
-    constructor(c, y, p, d) {
-      this.curve = c, this.x = y, this.y = p, this.z = d ?? v.ONE, this.zinv = null;
+    constructor(c, b, p, d) {
+      this.curve = c, this.x = b, this.y = p, this.z = d ?? v.ONE, this.zinv = null;
     }
     getX() {
       return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
@@ -899,10 +899,10 @@ function pi() {
     add(c) {
       if (this.isInfinity()) return c;
       if (c.isInfinity()) return this;
-      const y = this.x.toBigInteger(), p = this.y.toBigInteger(), d = this.z, w = c.x.toBigInteger(), B = c.y.toBigInteger(), E = c.z, D = this.curve.q, M = y.multiply(E).mod(D), f = w.multiply(d).mod(D), l = M.subtract(f), h = p.multiply(E).mod(D), o = B.multiply(d).mod(D), x = h.subtract(o);
-      if (v.ZERO.equals(l))
+      const b = this.x.toBigInteger(), p = this.y.toBigInteger(), d = this.z, w = c.x.toBigInteger(), B = c.y.toBigInteger(), E = c.z, D = this.curve.q, M = b.multiply(E).mod(D), f = w.multiply(d).mod(D), a = M.subtract(f), h = p.multiply(E).mod(D), o = B.multiply(d).mod(D), x = h.subtract(o);
+      if (v.ZERO.equals(a))
         return v.ZERO.equals(x) ? this.twice() : this.curve.infinity;
-      const s = M.add(f), m = d.multiply(E).mod(D), R = l.square().mod(D), P = l.multiply(R).mod(D), C = m.multiply(x.square()).subtract(s.multiply(R)).mod(D), N = l.multiply(C).mod(D), q = x.multiply(R.multiply(M).subtract(C)).subtract(h.multiply(P)).mod(D), O = P.multiply(m).mod(D);
+      const s = M.add(f), m = d.multiply(E).mod(D), R = a.square().mod(D), P = a.multiply(R).mod(D), C = m.multiply(x.square()).subtract(s.multiply(R)).mod(D), N = a.multiply(C).mod(D), q = x.multiply(R.multiply(M).subtract(C)).subtract(h.multiply(P)).mod(D), O = P.multiply(m).mod(D);
       return new I(this.curve, this.curve.fromBigInteger(N), this.curve.fromBigInteger(q), O);
     }
     /**
@@ -923,7 +923,7 @@ function pi() {
     twice() {
       if (this.isInfinity()) return this;
       if (!this.y.toBigInteger().signum()) return this.curve.infinity;
-      const c = this.x.toBigInteger(), y = this.y.toBigInteger(), p = this.z, d = this.curve.q, w = this.curve.a.toBigInteger(), B = c.square().multiply(S).add(w.multiply(p.square())).mod(d), E = y.shiftLeft(1).multiply(p).mod(d), D = y.square().mod(d), M = D.multiply(c).multiply(p).mod(d), f = E.square().mod(d), l = B.square().subtract(M.shiftLeft(3)).mod(d), h = E.multiply(l).mod(d), o = B.multiply(M.shiftLeft(2).subtract(l)).subtract(f.shiftLeft(1).multiply(D)).mod(d), x = E.multiply(f).mod(d);
+      const c = this.x.toBigInteger(), b = this.y.toBigInteger(), p = this.z, d = this.curve.q, w = this.curve.a.toBigInteger(), B = c.square().multiply(S).add(w.multiply(p.square())).mod(d), E = b.shiftLeft(1).multiply(p).mod(d), D = b.square().mod(d), M = D.multiply(c).multiply(p).mod(d), f = E.square().mod(d), a = B.square().subtract(M.shiftLeft(3)).mod(d), h = E.multiply(a).mod(d), o = B.multiply(M.shiftLeft(2).subtract(a)).subtract(f.shiftLeft(1).multiply(D)).mod(d), x = E.multiply(f).mod(d);
       return new I(this.curve, this.curve.fromBigInteger(h), this.curve.fromBigInteger(o), x);
     }
     /**
@@ -932,19 +932,19 @@ function pi() {
     multiply(c) {
       if (this.isInfinity()) return this;
       if (!c.signum()) return this.curve.infinity;
-      const y = c.multiply(S), p = this.negate();
+      const b = c.multiply(S), p = this.negate();
       let d = this;
-      for (let w = y.bitLength() - 2; w > 0; w--) {
+      for (let w = b.bitLength() - 2; w > 0; w--) {
         d = d.twice();
-        const B = y.testBit(w), E = c.testBit(w);
+        const B = b.testBit(w), E = c.testBit(w);
         B !== E && (d = d.add(B ? this : p));
       }
       return d;
     }
   }
   class r {
-    constructor(c, y, p) {
-      this.q = c, this.a = this.fromBigInteger(y), this.b = this.fromBigInteger(p), this.infinity = new I(this, null, null);
+    constructor(c, b, p) {
+      this.q = c, this.a = this.fromBigInteger(b), this.b = this.fromBigInteger(p), this.infinity = new I(this, null, null);
     }
     /**
      * 判断两个椭圆曲线是否相等
@@ -956,7 +956,7 @@ function pi() {
      * 生成椭圆曲线域元素
      */
     fromBigInteger(c) {
-      return new T(this.q, c);
+      return new y(this.q, c);
     }
     /**
      * 解析 16 进制串为椭圆曲线点
@@ -968,14 +968,14 @@ function pi() {
           return this.infinity;
         case 2:
         case 3:
-          const y = this.fromBigInteger(new v(c.substr(2), 16));
-          let p = this.fromBigInteger(y.multiply(y.square()).add(
-            y.multiply(this.a)
+          const b = this.fromBigInteger(new v(c.substr(2), 16));
+          let p = this.fromBigInteger(b.multiply(b.square()).add(
+            b.multiply(this.a)
           ).add(this.b).toBigInteger().modPow(
             this.q.divide(new v("4")).add(v.ONE),
             this.q
           ));
-          return p.toBigInteger().mod(z).equals(new v(c.substr(0, 2), 16).subtract(z)) || (p = p.negate()), new I(this, y, p);
+          return p.toBigInteger().mod(z).equals(new v(c.substr(0, 2), 16).subtract(z)) || (p = p.negate()), new I(this, b, p);
         case 4:
         case 6:
         case 7:
@@ -995,16 +995,16 @@ var yt, Ot;
 function di() {
   if (Ot) return yt;
   Ot = 1;
-  const { BigInteger: v, SecureRandom: z } = lt(), { ECCurveFp: S } = pi(), T = new z(), { curve: I, G: r, n: g } = y();
+  const { BigInteger: v, SecureRandom: z } = at(), { ECCurveFp: S } = pi(), y = new z(), { curve: I, G: r, n: g } = b();
   function c() {
     return I;
   }
-  function y() {
+  function b() {
     const h = new v("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), o = new v("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), x = new v("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), s = new S(h, o, x), P = s.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), C = new v("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
     return { curve: s, G: P, n: C };
   }
   function p(h, o, x) {
-    const m = (h ? new v(h, o, x) : new v(g.bitLength(), T)).mod(g.subtract(v.ONE)).add(v.ONE), R = B(m.toString(16), 64), P = r.multiply(m), C = B(P.getX().toBigInteger().toString(16), 64), N = B(P.getY().toBigInteger().toString(16), 64), q = "04" + C + N;
+    const m = (h ? new v(h, o, x) : new v(g.bitLength(), y)).mod(g.subtract(v.ONE)).add(v.ONE), R = B(m.toString(16), 64), P = r.multiply(m), C = B(P.getX().toBigInteger().toString(16), 64), N = B(P.getY().toBigInteger().toString(16), 64), q = "04" + C + N;
     return { privateKey: R, publicKey: q };
   }
   function d(h) {
@@ -1061,7 +1061,7 @@ function di() {
     const x = o.getX();
     return o.getY().square().equals(x.multiply(x.square()).add(x.multiply(I.a)).add(I.b));
   }
-  function l(h, o) {
+  function a(h, o) {
     const x = I.decodePointHex(h);
     if (!x) return !1;
     const s = I.decodePointHex(o);
@@ -1069,7 +1069,7 @@ function di() {
   }
   return yt = {
     getGlobalCurve: c,
-    generateEcparam: y,
+    generateEcparam: b,
     generateKeyPairHex: p,
     compressPublicKeyHex: d,
     utf8ToHex: w,
@@ -1078,11 +1078,11 @@ function di() {
     arrayToUtf8: D,
     hexToArray: M,
     verifyPublicKey: f,
-    comparePublicKeyHex: l
+    comparePublicKeyHex: a
   }, yt;
 }
 var bt, Ht;
-function kt() {
+function jt() {
   if (Ht) return bt;
   Ht = 1;
   const v = new Uint32Array(68), z = new Uint32Array(64);
@@ -1090,7 +1090,7 @@ function kt() {
     const E = B & 31;
     return w << E | w >>> 32 - E;
   }
-  function T(w, B) {
+  function y(w, B) {
     const E = [];
     for (let D = w.length - 1; D >= 0; D--) E[D] = (w[D] ^ B[D]) & 255;
     return E;
@@ -1113,12 +1113,12 @@ function kt() {
         const m = B.length - 8;
         M[s] = parseInt(B.substr(m), 2), B = B.substr(0, m);
       } else B.length > 0 && (M[s] = parseInt(B, 2), B = "");
-    const f = new Uint8Array([...w, 128, ...D, ...M]), l = new DataView(f.buffer, 0), h = f.length / 64, o = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
+    const f = new Uint8Array([...w, 128, ...D, ...M]), a = new DataView(f.buffer, 0), h = f.length / 64, o = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
     for (let s = 0; s < h; s++) {
       v.fill(0), z.fill(0);
       const m = 16 * s;
       for (let A = 0; A < 16; A++)
-        v[A] = l.getUint32((m + A) * 4, !1);
+        v[A] = a.getUint32((m + A) * 4, !1);
       for (let A = 16; A < 68; A++)
         v[A] = r(v[A - 16] ^ v[A - 9] ^ S(v[A - 3], 15)) ^ S(v[A - 13], 7) ^ v[A - 6];
       for (let A = 0; A < 64; A++)
@@ -1136,12 +1136,12 @@ function kt() {
     }
     return x;
   }
-  const c = 64, y = new Uint8Array(c), p = new Uint8Array(c);
+  const c = 64, b = new Uint8Array(c), p = new Uint8Array(c);
   for (let w = 0; w < c; w++)
-    y[w] = 54, p[w] = 92;
+    b[w] = 54, p[w] = 92;
   function d(w, B) {
     for (B.length > c && (B = g(B)); B.length < c; ) B.push(0);
-    const E = T(B, y), D = T(B, p), M = g([...E, ...w]);
+    const E = y(B, b), D = y(B, p), M = g([...E, ...w]);
     return g([...D, ...M]);
   }
   return bt = {
@@ -1153,13 +1153,13 @@ var Tt, Nt;
 function gi() {
   if (Nt) return Tt;
   Nt = 1;
-  const { BigInteger: v } = lt(), { encodeDer: z, decodeDer: S } = xi(), T = di(), I = kt().sm3, { G: r, curve: g, n: c } = T.generateEcparam(), y = 0;
-  function p(f, l, h = 1) {
-    f = typeof f == "string" ? T.hexToArray(T.utf8ToHex(f)) : Array.prototype.slice.call(f), l = T.getGlobalCurve().decodePointHex(l);
-    const o = T.generateKeyPairHex(), x = new v(o.privateKey, 16);
+  const { BigInteger: v } = at(), { encodeDer: z, decodeDer: S } = xi(), y = di(), I = jt().sm3, { G: r, curve: g, n: c } = y.generateEcparam(), b = 0;
+  function p(f, a, h = 1) {
+    f = typeof f == "string" ? y.hexToArray(y.utf8ToHex(f)) : Array.prototype.slice.call(f), a = y.getGlobalCurve().decodePointHex(a);
+    const o = y.generateKeyPairHex(), x = new v(o.privateKey, 16);
     let s = o.publicKey;
     s.length > 128 && (s = s.substr(s.length - 128));
-    const m = l.multiply(x), R = T.hexToArray(T.leftPad(m.getX().toBigInteger().toRadix(16), 64)), P = T.hexToArray(T.leftPad(m.getY().toBigInteger().toRadix(16), 64)), C = T.arrayToHex(I([].concat(R, f, P)));
+    const m = a.multiply(x), R = y.hexToArray(y.leftPad(m.getX().toBigInteger().toRadix(16), 64)), P = y.hexToArray(y.leftPad(m.getY().toBigInteger().toRadix(16), 64)), C = y.arrayToHex(I([].concat(R, f, P)));
     let N = 1, q = 0, O = [];
     const H = [].concat(R, P), L = () => {
       O = I([...H, N >> 24 & 255, N >> 16 & 255, N >> 8 & 255, N & 255]), N++, q = 0;
@@ -1167,16 +1167,16 @@ function gi() {
     L();
     for (let W = 0, G = f.length; W < G; W++)
       q === O.length && L(), f[W] ^= O[q++] & 255;
-    const Z = T.arrayToHex(f);
-    return h === y ? s + Z + C : s + C + Z;
+    const Z = y.arrayToHex(f);
+    return h === b ? s + Z + C : s + C + Z;
   }
-  function d(f, l, h = 1, {
+  function d(f, a, h = 1, {
     output: o = "string"
   } = {}) {
-    l = new v(l, 16);
+    a = new v(a, 16);
     let x = f.substr(128, 64), s = f.substr(192);
-    h === y && (x = f.substr(f.length - 64), s = f.substr(128, f.length - 128 - 64));
-    const m = T.hexToArray(s), P = T.getGlobalCurve().decodePointHex("04" + f.substr(0, 128)).multiply(l), C = T.hexToArray(T.leftPad(P.getX().toBigInteger().toRadix(16), 64)), N = T.hexToArray(T.leftPad(P.getY().toBigInteger().toRadix(16), 64));
+    h === b && (x = f.substr(f.length - 64), s = f.substr(128, f.length - 128 - 64));
+    const m = y.hexToArray(s), P = y.getGlobalCurve().decodePointHex("04" + f.substr(0, 128)).multiply(a), C = y.hexToArray(y.leftPad(P.getX().toBigInteger().toRadix(16), 64)), N = y.hexToArray(y.leftPad(P.getY().toBigInteger().toRadix(16), 64));
     let q = 1, O = 0, H = [];
     const L = [].concat(C, N), Z = () => {
       H = I([...L, q >> 24 & 255, q >> 16 & 255, q >> 8 & 255, q & 255]), q++, O = 0;
@@ -1184,18 +1184,18 @@ function gi() {
     Z();
     for (let G = 0, nt = m.length; G < nt; G++)
       O === H.length && Z(), m[G] ^= H[O++] & 255;
-    return T.arrayToHex(I([].concat(C, m, N))) === x.toLowerCase() ? o === "array" ? m : T.arrayToUtf8(m) : o === "array" ? [] : "";
+    return y.arrayToHex(I([].concat(C, m, N))) === x.toLowerCase() ? o === "array" ? m : y.arrayToUtf8(m) : o === "array" ? [] : "";
   }
-  function w(f, l, {
+  function w(f, a, {
     pointPool: h,
     der: o,
     hash: x,
     publicKey: s,
     userId: m
   } = {}) {
-    let R = typeof f == "string" ? T.utf8ToHex(f) : T.arrayToHex(f);
-    x && (s = s || D(l), R = E(R, s, m));
-    const P = new v(l, 16), C = new v(R, 16);
+    let R = typeof f == "string" ? y.utf8ToHex(f) : y.arrayToHex(f);
+    x && (s = s || D(a), R = E(R, s, m));
+    const P = new v(a, 16), C = new v(R, 16);
     let N = null, q = null, O = null;
     do {
       do {
@@ -1204,81 +1204,81 @@ function gi() {
       } while (q.equals(v.ZERO) || q.add(N).equals(c));
       O = P.add(v.ONE).modInverse(c).multiply(N.subtract(q.multiply(P))).mod(c);
     } while (O.equals(v.ZERO));
-    return o ? z(q, O) : T.leftPad(q.toString(16), 64) + T.leftPad(O.toString(16), 64);
+    return o ? z(q, O) : y.leftPad(q.toString(16), 64) + y.leftPad(O.toString(16), 64);
   }
-  function B(f, l, h, { der: o, hash: x, userId: s } = {}) {
-    let m = typeof f == "string" ? T.utf8ToHex(f) : T.arrayToHex(f);
+  function B(f, a, h, { der: o, hash: x, userId: s } = {}) {
+    let m = typeof f == "string" ? y.utf8ToHex(f) : y.arrayToHex(f);
     x && (m = E(m, h, s));
     let R, P;
     if (o) {
-      const L = S(l);
+      const L = S(a);
       R = L.r, P = L.s;
     } else
-      R = new v(l.substring(0, 64), 16), P = new v(l.substring(64), 16);
+      R = new v(a.substring(0, 64), 16), P = new v(a.substring(64), 16);
     const C = g.decodePointHex(h), N = new v(m, 16), q = R.add(P).mod(c);
     if (q.equals(v.ZERO)) return !1;
     const O = r.multiply(P).add(C.multiply(q)), H = N.add(O.getX().toBigInteger()).mod(c);
     return R.equals(H);
   }
-  function E(f, l, h = "1234567812345678") {
-    h = T.utf8ToHex(h);
-    const o = T.leftPad(r.curve.a.toBigInteger().toRadix(16), 64), x = T.leftPad(r.curve.b.toBigInteger().toRadix(16), 64), s = T.leftPad(r.getX().toBigInteger().toRadix(16), 64), m = T.leftPad(r.getY().toBigInteger().toRadix(16), 64);
+  function E(f, a, h = "1234567812345678") {
+    h = y.utf8ToHex(h);
+    const o = y.leftPad(r.curve.a.toBigInteger().toRadix(16), 64), x = y.leftPad(r.curve.b.toBigInteger().toRadix(16), 64), s = y.leftPad(r.getX().toBigInteger().toRadix(16), 64), m = y.leftPad(r.getY().toBigInteger().toRadix(16), 64);
     let R, P;
-    if (l.length === 128)
-      R = l.substr(0, 64), P = l.substr(64, 64);
+    if (a.length === 128)
+      R = a.substr(0, 64), P = a.substr(64, 64);
     else {
-      const O = r.curve.decodePointHex(l);
-      R = T.leftPad(O.getX().toBigInteger().toRadix(16), 64), P = T.leftPad(O.getY().toBigInteger().toRadix(16), 64);
+      const O = r.curve.decodePointHex(a);
+      R = y.leftPad(O.getX().toBigInteger().toRadix(16), 64), P = y.leftPad(O.getY().toBigInteger().toRadix(16), 64);
     }
-    const C = T.hexToArray(h + o + x + s + m + R + P), N = h.length * 4;
+    const C = y.hexToArray(h + o + x + s + m + R + P), N = h.length * 4;
     C.unshift(N & 255), C.unshift(N >> 8 & 255);
     const q = I(C);
-    return T.arrayToHex(I(q.concat(T.hexToArray(f))));
+    return y.arrayToHex(I(q.concat(y.hexToArray(f))));
   }
   function D(f) {
-    const l = r.multiply(new v(f, 16)), h = T.leftPad(l.getX().toBigInteger().toString(16), 64), o = T.leftPad(l.getY().toBigInteger().toString(16), 64);
+    const a = r.multiply(new v(f, 16)), h = y.leftPad(a.getX().toBigInteger().toString(16), 64), o = y.leftPad(a.getY().toBigInteger().toString(16), 64);
     return "04" + h + o;
   }
   function M() {
-    const f = T.generateKeyPairHex(), l = g.decodePointHex(f.publicKey);
-    return f.k = new v(f.privateKey, 16), f.x1 = l.getX().toBigInteger(), f;
+    const f = y.generateKeyPairHex(), a = g.decodePointHex(f.publicKey);
+    return f.k = new v(f.privateKey, 16), f.x1 = a.getX().toBigInteger(), f;
   }
   return Tt = {
-    generateKeyPairHex: T.generateKeyPairHex,
-    compressPublicKeyHex: T.compressPublicKeyHex,
-    comparePublicKeyHex: T.comparePublicKeyHex,
+    generateKeyPairHex: y.generateKeyPairHex,
+    compressPublicKeyHex: y.compressPublicKeyHex,
+    comparePublicKeyHex: y.comparePublicKeyHex,
     doEncrypt: p,
     doDecrypt: d,
     doSignature: w,
     doVerifySignature: B,
     getPublicKeyFromPrivateKey: D,
     getPoint: M,
-    verifyPublicKey: T.verifyPublicKey
+    verifyPublicKey: y.verifyPublicKey
   }, Tt;
 }
 var wt, Lt;
 function mi() {
   if (Lt) return wt;
   Lt = 1;
-  const { sm3: v, hmac: z } = kt();
+  const { sm3: v, hmac: z } = jt();
   function S(g, c) {
     return g.length >= c ? g : new Array(c - g.length + 1).join("0") + g;
   }
-  function T(g) {
+  function y(g) {
     return g.map((c) => (c = c.toString(16), c.length === 1 ? "0" + c : c)).join("");
   }
   function I(g) {
     const c = [];
-    let y = g.length;
-    y % 2 !== 0 && (g = S(g, y + 1)), y = g.length;
-    for (let p = 0; p < y; p += 2)
+    let b = g.length;
+    b % 2 !== 0 && (g = S(g, b + 1)), b = g.length;
+    for (let p = 0; p < b; p += 2)
       c.push(parseInt(g.substr(p, 2), 16));
     return c;
   }
   function r(g) {
     const c = [];
-    for (let y = 0, p = g.length; y < p; y++) {
-      const d = g.codePointAt(y);
+    for (let b = 0, p = g.length; b < p; b++) {
+      const d = g.codePointAt(b);
       if (d <= 127)
         c.push(d);
       else if (d <= 2047)
@@ -1286,7 +1286,7 @@ function mi() {
       else if (d <= 55295 || d >= 57344 && d <= 65535)
         c.push(224 | d >>> 12), c.push(128 | d >>> 6 & 63), c.push(128 | d & 63);
       else if (d >= 65536 && d <= 1114111)
-        y++, c.push(240 | d >>> 18 & 28), c.push(128 | d >>> 12 & 63), c.push(128 | d >>> 6 & 63), c.push(128 | d & 63);
+        b++, c.push(240 | d >>> 18 & 28), c.push(128 | d >>> 12 & 63), c.push(128 | d >>> 6 & 63), c.push(128 | d & 63);
       else
         throw c.push(d), new Error("input is not supported");
     }
@@ -1297,16 +1297,16 @@ function mi() {
       if ((c.mode || "hmac") !== "hmac") throw new Error("invalid mode");
       let p = c.key;
       if (!p) throw new Error("invalid key");
-      return p = typeof p == "string" ? I(p) : Array.prototype.slice.call(p), T(z(g, p));
+      return p = typeof p == "string" ? I(p) : Array.prototype.slice.call(p), y(z(g, p));
     }
-    return T(v(g));
+    return y(v(g));
   }, wt;
 }
 var Ft, Vt;
 function vi() {
   if (Vt) return Ft;
   Vt = 1;
-  const v = 0, z = 32, S = 16, T = [
+  const v = 0, z = 32, S = 16, y = [
     214,
     144,
     233,
@@ -1598,43 +1598,43 @@ function vi() {
     1684763257
   ];
   function r(f) {
-    const l = [];
+    const a = [];
     for (let h = 0, o = f.length; h < o; h += 2)
-      l.push(parseInt(f.substr(h, 2), 16));
-    return l;
+      a.push(parseInt(f.substr(h, 2), 16));
+    return a;
   }
   function g(f) {
-    return f.map((l) => (l = l.toString(16), l.length === 1 ? "0" + l : l)).join("");
+    return f.map((a) => (a = a.toString(16), a.length === 1 ? "0" + a : a)).join("");
   }
   function c(f) {
-    const l = [];
+    const a = [];
     for (let h = 0, o = f.length; h < o; h++) {
       const x = f.codePointAt(h);
       if (x <= 127)
-        l.push(x);
+        a.push(x);
       else if (x <= 2047)
-        l.push(192 | x >>> 6), l.push(128 | x & 63);
+        a.push(192 | x >>> 6), a.push(128 | x & 63);
       else if (x <= 55295 || x >= 57344 && x <= 65535)
-        l.push(224 | x >>> 12), l.push(128 | x >>> 6 & 63), l.push(128 | x & 63);
+        a.push(224 | x >>> 12), a.push(128 | x >>> 6 & 63), a.push(128 | x & 63);
       else if (x >= 65536 && x <= 1114111)
-        h++, l.push(240 | x >>> 18 & 28), l.push(128 | x >>> 12 & 63), l.push(128 | x >>> 6 & 63), l.push(128 | x & 63);
+        h++, a.push(240 | x >>> 18 & 28), a.push(128 | x >>> 12 & 63), a.push(128 | x >>> 6 & 63), a.push(128 | x & 63);
       else
-        throw l.push(x), new Error("input is not supported");
+        throw a.push(x), new Error("input is not supported");
     }
-    return l;
+    return a;
   }
-  function y(f) {
-    const l = [];
+  function b(f) {
+    const a = [];
     for (let h = 0, o = f.length; h < o; h++)
-      f[h] >= 240 && f[h] <= 247 ? (l.push(String.fromCodePoint(((f[h] & 7) << 18) + ((f[h + 1] & 63) << 12) + ((f[h + 2] & 63) << 6) + (f[h + 3] & 63))), h += 3) : f[h] >= 224 && f[h] <= 239 ? (l.push(String.fromCodePoint(((f[h] & 15) << 12) + ((f[h + 1] & 63) << 6) + (f[h + 2] & 63))), h += 2) : f[h] >= 192 && f[h] <= 223 ? (l.push(String.fromCodePoint(((f[h] & 31) << 6) + (f[h + 1] & 63))), h++) : l.push(String.fromCodePoint(f[h]));
-    return l.join("");
+      f[h] >= 240 && f[h] <= 247 ? (a.push(String.fromCodePoint(((f[h] & 7) << 18) + ((f[h + 1] & 63) << 12) + ((f[h + 2] & 63) << 6) + (f[h + 3] & 63))), h += 3) : f[h] >= 224 && f[h] <= 239 ? (a.push(String.fromCodePoint(((f[h] & 15) << 12) + ((f[h + 1] & 63) << 6) + (f[h + 2] & 63))), h += 2) : f[h] >= 192 && f[h] <= 223 ? (a.push(String.fromCodePoint(((f[h] & 31) << 6) + (f[h + 1] & 63))), h++) : a.push(String.fromCodePoint(f[h]));
+    return a.join("");
   }
-  function p(f, l) {
-    const h = l & 31;
+  function p(f, a) {
+    const h = a & 31;
     return f << h | f >>> 32 - h;
   }
   function d(f) {
-    return (T[f >>> 24 & 255] & 255) << 24 | (T[f >>> 16 & 255] & 255) << 16 | (T[f >>> 8 & 255] & 255) << 8 | T[f & 255] & 255;
+    return (y[f >>> 24 & 255] & 255) << 24 | (y[f >>> 16 & 255] & 255) << 16 | (y[f >>> 8 & 255] & 255) << 8 | y[f & 255] & 255;
   }
   function w(f) {
     return f ^ p(f, 2) ^ p(f, 10) ^ p(f, 18) ^ p(f, 24);
@@ -1642,27 +1642,27 @@ function vi() {
   function B(f) {
     return f ^ p(f, 13) ^ p(f, 23);
   }
-  function E(f, l, h) {
+  function E(f, a, h) {
     const o = new Array(4), x = new Array(4);
     for (let s = 0; s < 4; s++)
       x[0] = f[4 * s] & 255, x[1] = f[4 * s + 1] & 255, x[2] = f[4 * s + 2] & 255, x[3] = f[4 * s + 3] & 255, o[s] = x[0] << 24 | x[1] << 16 | x[2] << 8 | x[3];
     for (let s = 0, m; s < 32; s += 4)
       m = o[1] ^ o[2] ^ o[3] ^ h[s + 0], o[0] ^= w(d(m)), m = o[2] ^ o[3] ^ o[0] ^ h[s + 1], o[1] ^= w(d(m)), m = o[3] ^ o[0] ^ o[1] ^ h[s + 2], o[2] ^= w(d(m)), m = o[0] ^ o[1] ^ o[2] ^ h[s + 3], o[3] ^= w(d(m));
     for (let s = 0; s < 16; s += 4)
-      l[s] = o[3 - s / 4] >>> 24 & 255, l[s + 1] = o[3 - s / 4] >>> 16 & 255, l[s + 2] = o[3 - s / 4] >>> 8 & 255, l[s + 3] = o[3 - s / 4] & 255;
+      a[s] = o[3 - s / 4] >>> 24 & 255, a[s + 1] = o[3 - s / 4] >>> 16 & 255, a[s + 2] = o[3 - s / 4] >>> 8 & 255, a[s + 3] = o[3 - s / 4] & 255;
   }
-  function D(f, l, h) {
+  function D(f, a, h) {
     const o = new Array(4), x = new Array(4);
     for (let s = 0; s < 4; s++)
       x[0] = f[0 + 4 * s] & 255, x[1] = f[1 + 4 * s] & 255, x[2] = f[2 + 4 * s] & 255, x[3] = f[3 + 4 * s] & 255, o[s] = x[0] << 24 | x[1] << 16 | x[2] << 8 | x[3];
     o[0] ^= 2746333894, o[1] ^= 1453994832, o[2] ^= 1736282519, o[3] ^= 2993693404;
     for (let s = 0, m; s < 32; s += 4)
-      m = o[1] ^ o[2] ^ o[3] ^ I[s + 0], l[s + 0] = o[0] ^= B(d(m)), m = o[2] ^ o[3] ^ o[0] ^ I[s + 1], l[s + 1] = o[1] ^= B(d(m)), m = o[3] ^ o[0] ^ o[1] ^ I[s + 2], l[s + 2] = o[2] ^= B(d(m)), m = o[0] ^ o[1] ^ o[2] ^ I[s + 3], l[s + 3] = o[3] ^= B(d(m));
+      m = o[1] ^ o[2] ^ o[3] ^ I[s + 0], a[s + 0] = o[0] ^= B(d(m)), m = o[2] ^ o[3] ^ o[0] ^ I[s + 1], a[s + 1] = o[1] ^= B(d(m)), m = o[3] ^ o[0] ^ o[1] ^ I[s + 2], a[s + 2] = o[2] ^= B(d(m)), m = o[0] ^ o[1] ^ o[2] ^ I[s + 3], a[s + 3] = o[3] ^= B(d(m));
     if (h === v)
       for (let s = 0, m; s < 16; s++)
-        m = l[s], l[s] = l[31 - s], l[31 - s] = m;
+        m = a[s], a[s] = a[31 - s], a[31 - s] = m;
   }
-  function M(f, l, h, {
+  function M(f, a, h, {
     padding: o = "pkcs#7",
     mode: x,
     iv: s = [],
@@ -1670,14 +1670,14 @@ function vi() {
   } = {}) {
     if (x === "cbc" && (typeof s == "string" && (s = r(s)), s.length !== 128 / 8))
       throw new Error("iv is invalid");
-    if (typeof l == "string" && (l = r(l)), l.length !== 128 / 8)
+    if (typeof a == "string" && (a = r(a)), a.length !== 128 / 8)
       throw new Error("key is invalid");
     if (typeof f == "string" ? h !== v ? f = c(f) : f = r(f) : f = [...f], (o === "pkcs#5" || o === "pkcs#7") && h !== v) {
       const O = S - f.length % S;
       for (let H = 0; H < O; H++) f.push(O);
     }
     const R = new Array(z);
-    D(l, R, h);
+    D(a, R, h);
     const P = [];
     let C = s, N = f.length, q = 0;
     for (; N >= S; ) {
@@ -1696,14 +1696,14 @@ function vi() {
         if (P[O - L] !== H) throw new Error("padding is invalid");
       P.splice(O - H, H);
     }
-    return m !== "array" ? h !== v ? g(P) : y(P) : P;
+    return m !== "array" ? h !== v ? g(P) : b(P) : P;
   }
   return Ft = {
-    encrypt(f, l, h) {
-      return M(f, l, 1, h);
+    encrypt(f, a, h) {
+      return M(f, a, 1, h);
     },
-    decrypt(f, l, h) {
-      return M(f, l, 0, h);
+    decrypt(f, a, h) {
+      return M(f, a, 0, h);
     }
   }, Ft;
 }
@@ -1720,22 +1720,22 @@ function Ti({
   uid: v = "",
   salt: z = "",
   ts: S = 0,
-  data: T
+  data: y
 }) {
-  const I = Date.now() + S, r = Math.random().toString(36).substring(2, 15), g = JSON.stringify(T ?? ""), c = `${I}${v}${r}${g}${z}`, y = bi.sm3(c);
+  const I = Date.now() + S, r = Math.random().toString(36).substring(2, 15), g = typeof y == "object" ? JSON.stringify(y ?? {}) : y ?? "", c = `${I}${v}${r}${g}${z}`, b = bi.sm3(c);
   return {
     headers: {
       "X-Sign-Timestamp": String(I),
       "X-Sign-Nonce": r,
-      "X-Sign-Client": y
+      "X-Sign-Client": b
     }
   };
 }
 function wi(v) {
-  const z = ["script", "iframe", "object", "embed", "link", "meta", "style"], S = ["onerror", "onload", "onclick", "onmouseover", "onfocus", "onmouseenter", "onmouseleave"], T = (y) => /^javascript:/i.test(y) || /^data:text\/html/i.test(y), r = new DOMParser().parseFromString(`<div>${v}</div>`, "text/html"), g = r.body.firstChild;
-  function c(y) {
-    if (y.nodeType === Node.ELEMENT_NODE) {
-      const p = y, d = p.tagName.toLowerCase();
+  const z = ["script", "iframe", "object", "embed", "link", "meta", "style"], S = ["onerror", "onload", "onclick", "onmouseover", "onfocus", "onmouseenter", "onmouseleave"], y = (b) => /^javascript:/i.test(b) || /^data:text\/html/i.test(b), r = new DOMParser().parseFromString(`<div>${v}</div>`, "text/html"), g = r.body.firstChild;
+  function c(b) {
+    if (b.nodeType === Node.ELEMENT_NODE) {
+      const p = b, d = p.tagName.toLowerCase();
       if (z.includes(d)) {
         const w = p.outerHTML, B = r.createTextNode(w);
         p.replaceWith(B);
@@ -1743,7 +1743,7 @@ function wi(v) {
       }
       [...p.attributes].forEach((w) => {
         const B = w.name.toLowerCase(), E = w.value;
-        (S.includes(B) || T(E)) && p.removeAttribute(w.name);
+        (S.includes(B) || y(E)) && p.removeAttribute(w.name);
       }), [...p.childNodes].forEach(c);
     }
   }