zigap-utils 3.1.0-preview.7 → 3.1.0-preview.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/hooks/useDeeplinkResume.d.ts +2 -1
- package/dist/index.es.js +828 -828
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -78,7 +78,7 @@ process.env.NODE_ENV === "production" ? Uo.exports = function() {
|
|
|
78
78
|
return (R = R.displayName) || (R = (R = j.displayName || j.name || "") !== "" ? "ForwardRef(" + R + ")" : "ForwardRef"), R;
|
|
79
79
|
case I:
|
|
80
80
|
return (j = R.displayName || null) !== null ? j : e(R.type) || "Memo";
|
|
81
|
-
case
|
|
81
|
+
case N:
|
|
82
82
|
j = R._payload, R = R._init;
|
|
83
83
|
try {
|
|
84
84
|
return e(R(j));
|
|
@@ -104,7 +104,7 @@ process.env.NODE_ENV === "production" ? Uo.exports = function() {
|
|
|
104
104
|
}
|
|
105
105
|
function n(R) {
|
|
106
106
|
if (R === w) return "<>";
|
|
107
|
-
if (typeof R == "object" && R !== null && R.$$typeof ===
|
|
107
|
+
if (typeof R == "object" && R !== null && R.$$typeof === N) return "<...>";
|
|
108
108
|
try {
|
|
109
109
|
var j = e(R);
|
|
110
110
|
return j ? "<" + j + ">" : "<...>";
|
|
@@ -120,7 +120,7 @@ process.env.NODE_ENV === "production" ? Uo.exports = function() {
|
|
|
120
120
|
return l[R] || (l[R] = !0, console.error("Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release.")), (R = this.props.ref) !== void 0 ? R : null;
|
|
121
121
|
}
|
|
122
122
|
function a(R, j, F, $, V, D, U, G) {
|
|
123
|
-
var
|
|
123
|
+
var Nt, dt = j.children;
|
|
124
124
|
if (dt !== void 0) if ($) if (y(dt)) {
|
|
125
125
|
for ($ = 0; $ < dt.length; $++) o(dt[$]);
|
|
126
126
|
Object.freeze && Object.freeze(dt);
|
|
@@ -131,12 +131,12 @@ process.env.NODE_ENV === "production" ? Uo.exports = function() {
|
|
|
131
131
|
var gt = Object.keys(j).filter(function(mt) {
|
|
132
132
|
return mt !== "key";
|
|
133
133
|
});
|
|
134
|
-
$ = 0 < gt.length ? "{key: someKey, " + gt.join(": ..., ") + ": ...}" : "{key: someKey}",
|
|
134
|
+
$ = 0 < gt.length ? "{key: someKey, " + gt.join(": ..., ") + ": ...}" : "{key: someKey}", O[dt + $] || (gt = 0 < gt.length ? "{" + gt.join(": ..., ") + ": ...}" : "{}", console.error(`A props object containing a "key" prop is being spread into JSX:
|
|
135
135
|
let props = %s;
|
|
136
136
|
<%s {...props} />
|
|
137
137
|
React keys must be passed directly to JSX without using spread:
|
|
138
138
|
let props = %s;
|
|
139
|
-
<%s key={someKey} {...props} />`, $, dt, gt, dt),
|
|
139
|
+
<%s key={someKey} {...props} />`, $, dt, gt, dt), O[dt + $] = !0);
|
|
140
140
|
}
|
|
141
141
|
if (dt = null, F !== void 0 && (r(F), dt = "" + F), function(mt) {
|
|
142
142
|
if (h.call(mt, "key")) {
|
|
@@ -153,16 +153,16 @@ React keys must be passed directly to JSX without using spread:
|
|
|
153
153
|
Zt.isReactWarning = !0, Object.defineProperty(mt, "key", { get: Zt, configurable: !0 });
|
|
154
154
|
}(F, typeof R == "function" ? R.displayName || R.name || "Unknown" : R), function(mt, Mt, Zt, jt, oe, Qe, Yt, ee) {
|
|
155
155
|
return Zt = Qe.ref, mt = { $$typeof: u, type: mt, key: Mt, props: Qe, _owner: oe }, (Zt !== void 0 ? Zt : null) !== null ? Object.defineProperty(mt, "ref", { enumerable: !1, get: s }) : Object.defineProperty(mt, "ref", { enumerable: !1, value: null }), mt._store = {}, Object.defineProperty(mt._store, "validated", { configurable: !1, enumerable: !1, writable: !0, value: 0 }), Object.defineProperty(mt, "_debugInfo", { configurable: !1, enumerable: !1, writable: !0, value: null }), Object.defineProperty(mt, "_debugStack", { configurable: !1, enumerable: !1, writable: !0, value: Yt }), Object.defineProperty(mt, "_debugTask", { configurable: !1, enumerable: !1, writable: !0, value: ee }), Object.freeze && (Object.freeze(mt.props), Object.freeze(mt)), mt;
|
|
156
|
-
}(R, dt, D, 0, (
|
|
156
|
+
}(R, dt, D, 0, (Nt = d.A) === null ? null : Nt.getOwner(), F, U, G);
|
|
157
157
|
}
|
|
158
158
|
function o(R) {
|
|
159
159
|
typeof R == "object" && R !== null && R.$$typeof === u && R._store && (R._store.validated = 1);
|
|
160
160
|
}
|
|
161
|
-
var c, f = Z1, u = Symbol.for("react.transitional.element"), p = Symbol.for("react.portal"), w = Symbol.for("react.fragment"), v = Symbol.for("react.strict_mode"), S = Symbol.for("react.profiler"), E = Symbol.for("react.consumer"), _ = Symbol.for("react.context"), k = Symbol.for("react.forward_ref"), A = Symbol.for("react.suspense"), P = Symbol.for("react.suspense_list"), I = Symbol.for("react.memo"),
|
|
161
|
+
var c, f = Z1, u = Symbol.for("react.transitional.element"), p = Symbol.for("react.portal"), w = Symbol.for("react.fragment"), v = Symbol.for("react.strict_mode"), S = Symbol.for("react.profiler"), E = Symbol.for("react.consumer"), _ = Symbol.for("react.context"), k = Symbol.for("react.forward_ref"), A = Symbol.for("react.suspense"), P = Symbol.for("react.suspense_list"), I = Symbol.for("react.memo"), N = Symbol.for("react.lazy"), z = Symbol.for("react.activity"), B = Symbol.for("react.client.reference"), d = f.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, h = Object.prototype.hasOwnProperty, y = Array.isArray, m = console.createTask ? console.createTask : function() {
|
|
162
162
|
return null;
|
|
163
163
|
}, l = {}, g = (f = { "react-stack-bottom-frame": function(R) {
|
|
164
164
|
return R();
|
|
165
|
-
} })["react-stack-bottom-frame"].bind(f, i)(), x = m(n(i)),
|
|
165
|
+
} })["react-stack-bottom-frame"].bind(f, i)(), x = m(n(i)), O = {};
|
|
166
166
|
ns.Fragment = w, ns.jsx = function(R, j, F, $, V) {
|
|
167
167
|
var D = 1e4 > d.recentlyCreatedOwnerStacks++;
|
|
168
168
|
return a(R, j, F, !1, 0, V, D ? Error("react-stack-top-frame") : g, D ? m(n(R)) : x);
|
|
@@ -171,21 +171,21 @@ React keys must be passed directly to JSX without using spread:
|
|
|
171
171
|
return a(R, j, F, !0, 0, V, D ? Error("react-stack-top-frame") : g, D ? m(n(R)) : x);
|
|
172
172
|
};
|
|
173
173
|
}()), ns);
|
|
174
|
-
var
|
|
174
|
+
var Ct = Uo.exports, sf = { exports: {} };
|
|
175
175
|
sf.exports = function() {
|
|
176
176
|
var e = 1e3, t = 6e4, r = 36e5, n = "millisecond", i = "second", s = "minute", a = "hour", o = "day", c = "week", f = "month", u = "quarter", p = "year", w = "date", v = "Invalid Date", S = /^(\d{4})[-/]?(\d{1,2})?[-/]?(\d{0,2})[Tt\s]*(\d{1,2})?:?(\d{1,2})?:?(\d{1,2})?[.:]?(\d+)?$/, E = /\[([^\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g, _ = { name: "en", weekdays: "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"), months: "January_February_March_April_May_June_July_August_September_October_November_December".split("_"), ordinal: function(l) {
|
|
177
177
|
var g = ["th", "st", "nd", "rd"], x = l % 100;
|
|
178
178
|
return "[" + l + (g[(x - 20) % 10] || g[x] || g[0]) + "]";
|
|
179
179
|
} }, k = function(l, g, x) {
|
|
180
|
-
var
|
|
181
|
-
return !
|
|
180
|
+
var O = String(l);
|
|
181
|
+
return !O || O.length >= g ? l : "" + Array(g + 1 - O.length).join(x) + l;
|
|
182
182
|
}, A = { s: k, z: function(l) {
|
|
183
|
-
var g = -l.utcOffset(), x = Math.abs(g),
|
|
184
|
-
return (g <= 0 ? "+" : "-") + k(
|
|
183
|
+
var g = -l.utcOffset(), x = Math.abs(g), O = Math.floor(x / 60), R = x % 60;
|
|
184
|
+
return (g <= 0 ? "+" : "-") + k(O, 2, "0") + ":" + k(R, 2, "0");
|
|
185
185
|
}, m: function l(g, x) {
|
|
186
186
|
if (g.date() < x.date()) return -l(x, g);
|
|
187
|
-
var
|
|
188
|
-
return +(-(
|
|
187
|
+
var O = 12 * (x.year() - g.year()) + (x.month() - g.month()), R = g.clone().add(O, f), j = x - R < 0, F = g.clone().add(O + (j ? -1 : 1), f);
|
|
188
|
+
return +(-(O + (x - R) / (j ? R - F : F - R)) || 0);
|
|
189
189
|
}, a: function(l) {
|
|
190
190
|
return l < 0 ? Math.ceil(l) || 0 : Math.floor(l);
|
|
191
191
|
}, p: function(l) {
|
|
@@ -194,9 +194,9 @@ sf.exports = function() {
|
|
|
194
194
|
return l === void 0;
|
|
195
195
|
} }, P = "en", I = {};
|
|
196
196
|
I[P] = _;
|
|
197
|
-
var
|
|
198
|
-
return l instanceof y || !(!l || !l[
|
|
199
|
-
}, B = function l(g, x,
|
|
197
|
+
var N = "$isDayjsObject", z = function(l) {
|
|
198
|
+
return l instanceof y || !(!l || !l[N]);
|
|
199
|
+
}, B = function l(g, x, O) {
|
|
200
200
|
var R;
|
|
201
201
|
if (!g) return P;
|
|
202
202
|
if (typeof g == "string") {
|
|
@@ -208,7 +208,7 @@ sf.exports = function() {
|
|
|
208
208
|
var $ = g.name;
|
|
209
209
|
I[$] = g, R = $;
|
|
210
210
|
}
|
|
211
|
-
return !
|
|
211
|
+
return !O && R && (P = R), R || !O && P;
|
|
212
212
|
}, d = function(l, g) {
|
|
213
213
|
if (z(l)) return l.clone();
|
|
214
214
|
var x = typeof g == "object" ? g : {};
|
|
@@ -219,12 +219,12 @@ sf.exports = function() {
|
|
|
219
219
|
};
|
|
220
220
|
var y = function() {
|
|
221
221
|
function l(x) {
|
|
222
|
-
this.$L = B(x.locale, null, !0), this.parse(x), this.$x = this.$x || x.x || {}, this[
|
|
222
|
+
this.$L = B(x.locale, null, !0), this.parse(x), this.$x = this.$x || x.x || {}, this[N] = !0;
|
|
223
223
|
}
|
|
224
224
|
var g = l.prototype;
|
|
225
225
|
return g.parse = function(x) {
|
|
226
|
-
this.$d = function(
|
|
227
|
-
var R =
|
|
226
|
+
this.$d = function(O) {
|
|
227
|
+
var R = O.date, j = O.utc;
|
|
228
228
|
if (R === null) return /* @__PURE__ */ new Date(NaN);
|
|
229
229
|
if (h.u(R)) return /* @__PURE__ */ new Date();
|
|
230
230
|
if (R instanceof Date) return new Date(R);
|
|
@@ -244,26 +244,26 @@ sf.exports = function() {
|
|
|
244
244
|
return h;
|
|
245
245
|
}, g.isValid = function() {
|
|
246
246
|
return this.$d.toString() !== v;
|
|
247
|
-
}, g.isSame = function(x,
|
|
247
|
+
}, g.isSame = function(x, O) {
|
|
248
248
|
var R = d(x);
|
|
249
|
-
return this.startOf(
|
|
250
|
-
}, g.isAfter = function(x,
|
|
251
|
-
return d(x) < this.startOf(
|
|
252
|
-
}, g.isBefore = function(x,
|
|
253
|
-
return this.endOf(
|
|
254
|
-
}, g.$g = function(x,
|
|
255
|
-
return h.u(x) ? this[
|
|
249
|
+
return this.startOf(O) <= R && R <= this.endOf(O);
|
|
250
|
+
}, g.isAfter = function(x, O) {
|
|
251
|
+
return d(x) < this.startOf(O);
|
|
252
|
+
}, g.isBefore = function(x, O) {
|
|
253
|
+
return this.endOf(O) < d(x);
|
|
254
|
+
}, g.$g = function(x, O, R) {
|
|
255
|
+
return h.u(x) ? this[O] : this.set(R, x);
|
|
256
256
|
}, g.unix = function() {
|
|
257
257
|
return Math.floor(this.valueOf() / 1e3);
|
|
258
258
|
}, g.valueOf = function() {
|
|
259
259
|
return this.$d.getTime();
|
|
260
|
-
}, g.startOf = function(x,
|
|
261
|
-
var R = this, j = !!h.u(
|
|
260
|
+
}, g.startOf = function(x, O) {
|
|
261
|
+
var R = this, j = !!h.u(O) || O, F = h.p(x), $ = function(Ft, mt) {
|
|
262
262
|
var Mt = h.w(R.$u ? Date.UTC(R.$y, mt, Ft) : new Date(R.$y, mt, Ft), R);
|
|
263
263
|
return j ? Mt : Mt.endOf(o);
|
|
264
264
|
}, V = function(Ft, mt) {
|
|
265
265
|
return h.w(R.toDate()[Ft].apply(R.toDate("s"), (j ? [0, 0, 0, 0] : [23, 59, 59, 999]).slice(mt)), R);
|
|
266
|
-
}, D = this.$W, U = this.$M, G = this.$D,
|
|
266
|
+
}, D = this.$W, U = this.$M, G = this.$D, Nt = "set" + (this.$u ? "UTC" : "");
|
|
267
267
|
switch (F) {
|
|
268
268
|
case p:
|
|
269
269
|
return j ? $(1, 0) : $(31, 11);
|
|
@@ -274,33 +274,33 @@ sf.exports = function() {
|
|
|
274
274
|
return $(j ? G - gt : G + (6 - gt), U);
|
|
275
275
|
case o:
|
|
276
276
|
case w:
|
|
277
|
-
return V(
|
|
277
|
+
return V(Nt + "Hours", 0);
|
|
278
278
|
case a:
|
|
279
|
-
return V(
|
|
279
|
+
return V(Nt + "Minutes", 1);
|
|
280
280
|
case s:
|
|
281
|
-
return V(
|
|
281
|
+
return V(Nt + "Seconds", 2);
|
|
282
282
|
case i:
|
|
283
|
-
return V(
|
|
283
|
+
return V(Nt + "Milliseconds", 3);
|
|
284
284
|
default:
|
|
285
285
|
return this.clone();
|
|
286
286
|
}
|
|
287
287
|
}, g.endOf = function(x) {
|
|
288
288
|
return this.startOf(x, !1);
|
|
289
|
-
}, g.$set = function(x,
|
|
290
|
-
var R, j = h.p(x), F = "set" + (this.$u ? "UTC" : ""), $ = (R = {}, R[o] = F + "Date", R[w] = F + "Date", R[f] = F + "Month", R[p] = F + "FullYear", R[a] = F + "Hours", R[s] = F + "Minutes", R[i] = F + "Seconds", R[n] = F + "Milliseconds", R)[j], V = j === o ? this.$D + (
|
|
289
|
+
}, g.$set = function(x, O) {
|
|
290
|
+
var R, j = h.p(x), F = "set" + (this.$u ? "UTC" : ""), $ = (R = {}, R[o] = F + "Date", R[w] = F + "Date", R[f] = F + "Month", R[p] = F + "FullYear", R[a] = F + "Hours", R[s] = F + "Minutes", R[i] = F + "Seconds", R[n] = F + "Milliseconds", R)[j], V = j === o ? this.$D + (O - this.$W) : O;
|
|
291
291
|
if (j === f || j === p) {
|
|
292
292
|
var D = this.clone().set(w, 1);
|
|
293
293
|
D.$d[$](V), D.init(), this.$d = D.set(w, Math.min(this.$D, D.daysInMonth())).$d;
|
|
294
294
|
} else $ && this.$d[$](V);
|
|
295
295
|
return this.init(), this;
|
|
296
|
-
}, g.set = function(x,
|
|
297
|
-
return this.clone().$set(x,
|
|
296
|
+
}, g.set = function(x, O) {
|
|
297
|
+
return this.clone().$set(x, O);
|
|
298
298
|
}, g.get = function(x) {
|
|
299
299
|
return this[h.p(x)]();
|
|
300
|
-
}, g.add = function(x,
|
|
300
|
+
}, g.add = function(x, O) {
|
|
301
301
|
var R, j = this;
|
|
302
302
|
x = Number(x);
|
|
303
|
-
var F = h.p(
|
|
303
|
+
var F = h.p(O), $ = function(U) {
|
|
304
304
|
var G = d(j);
|
|
305
305
|
return h.w(G.date(G.date() + Math.round(U * x)), j);
|
|
306
306
|
};
|
|
@@ -310,16 +310,16 @@ sf.exports = function() {
|
|
|
310
310
|
if (F === c) return $(7);
|
|
311
311
|
var V = (R = {}, R[s] = t, R[a] = r, R[i] = e, R)[F] || 1, D = this.$d.getTime() + x * V;
|
|
312
312
|
return h.w(D, this);
|
|
313
|
-
}, g.subtract = function(x,
|
|
314
|
-
return this.add(-1 * x,
|
|
313
|
+
}, g.subtract = function(x, O) {
|
|
314
|
+
return this.add(-1 * x, O);
|
|
315
315
|
}, g.format = function(x) {
|
|
316
|
-
var
|
|
316
|
+
var O = this, R = this.$locale();
|
|
317
317
|
if (!this.isValid()) return R.invalidDate || v;
|
|
318
|
-
var j = x || "YYYY-MM-DDTHH:mm:ssZ", F = h.z(this), $ = this.$H, V = this.$m, D = this.$M, U = R.weekdays, G = R.months,
|
|
319
|
-
return mt && (mt[Mt] || mt(
|
|
318
|
+
var j = x || "YYYY-MM-DDTHH:mm:ssZ", F = h.z(this), $ = this.$H, V = this.$m, D = this.$M, U = R.weekdays, G = R.months, Nt = R.meridiem, dt = function(mt, Mt, Zt, jt) {
|
|
319
|
+
return mt && (mt[Mt] || mt(O, j)) || Zt[Mt].slice(0, jt);
|
|
320
320
|
}, gt = function(mt) {
|
|
321
321
|
return h.s($ % 12 || 12, mt, "0");
|
|
322
|
-
}, Ft =
|
|
322
|
+
}, Ft = Nt || function(mt, Mt, Zt) {
|
|
323
323
|
var jt = mt < 12 ? "AM" : "PM";
|
|
324
324
|
return Zt ? jt.toLowerCase() : jt;
|
|
325
325
|
};
|
|
@@ -327,9 +327,9 @@ sf.exports = function() {
|
|
|
327
327
|
return Mt || function(Zt) {
|
|
328
328
|
switch (Zt) {
|
|
329
329
|
case "YY":
|
|
330
|
-
return String(
|
|
330
|
+
return String(O.$y).slice(-2);
|
|
331
331
|
case "YYYY":
|
|
332
|
-
return h.s(
|
|
332
|
+
return h.s(O.$y, 4, "0");
|
|
333
333
|
case "M":
|
|
334
334
|
return D + 1;
|
|
335
335
|
case "MM":
|
|
@@ -339,17 +339,17 @@ sf.exports = function() {
|
|
|
339
339
|
case "MMMM":
|
|
340
340
|
return dt(G, D);
|
|
341
341
|
case "D":
|
|
342
|
-
return
|
|
342
|
+
return O.$D;
|
|
343
343
|
case "DD":
|
|
344
|
-
return h.s(
|
|
344
|
+
return h.s(O.$D, 2, "0");
|
|
345
345
|
case "d":
|
|
346
|
-
return String(
|
|
346
|
+
return String(O.$W);
|
|
347
347
|
case "dd":
|
|
348
|
-
return dt(R.weekdaysMin,
|
|
348
|
+
return dt(R.weekdaysMin, O.$W, U, 2);
|
|
349
349
|
case "ddd":
|
|
350
|
-
return dt(R.weekdaysShort,
|
|
350
|
+
return dt(R.weekdaysShort, O.$W, U, 3);
|
|
351
351
|
case "dddd":
|
|
352
|
-
return U[
|
|
352
|
+
return U[O.$W];
|
|
353
353
|
case "H":
|
|
354
354
|
return String($);
|
|
355
355
|
case "HH":
|
|
@@ -367,11 +367,11 @@ sf.exports = function() {
|
|
|
367
367
|
case "mm":
|
|
368
368
|
return h.s(V, 2, "0");
|
|
369
369
|
case "s":
|
|
370
|
-
return String(
|
|
370
|
+
return String(O.$s);
|
|
371
371
|
case "ss":
|
|
372
|
-
return h.s(
|
|
372
|
+
return h.s(O.$s, 2, "0");
|
|
373
373
|
case "SSS":
|
|
374
|
-
return h.s(
|
|
374
|
+
return h.s(O.$ms, 3, "0");
|
|
375
375
|
case "Z":
|
|
376
376
|
return F;
|
|
377
377
|
}
|
|
@@ -380,8 +380,8 @@ sf.exports = function() {
|
|
|
380
380
|
});
|
|
381
381
|
}, g.utcOffset = function() {
|
|
382
382
|
return 15 * -Math.round(this.$d.getTimezoneOffset() / 15);
|
|
383
|
-
}, g.diff = function(x,
|
|
384
|
-
var j, F = this, $ = h.p(
|
|
383
|
+
}, g.diff = function(x, O, R) {
|
|
384
|
+
var j, F = this, $ = h.p(O), V = d(x), D = (V.utcOffset() - this.utcOffset()) * t, U = this - V, G = function() {
|
|
385
385
|
return h.m(F, V);
|
|
386
386
|
};
|
|
387
387
|
switch ($) {
|
|
@@ -417,9 +417,9 @@ sf.exports = function() {
|
|
|
417
417
|
return this.endOf(f).$D;
|
|
418
418
|
}, g.$locale = function() {
|
|
419
419
|
return I[this.$L];
|
|
420
|
-
}, g.locale = function(x,
|
|
420
|
+
}, g.locale = function(x, O) {
|
|
421
421
|
if (!x) return this.$L;
|
|
422
|
-
var R = this.clone(), j = B(x,
|
|
422
|
+
var R = this.clone(), j = B(x, O, !0);
|
|
423
423
|
return j && (R.$L = j), R;
|
|
424
424
|
}, g.clone = function() {
|
|
425
425
|
return h.w(this.$d, this);
|
|
@@ -564,14 +564,14 @@ var mn, pc, V1 = Object.defineProperty, _s = Object.getOwnPropertySymbols, of =
|
|
|
564
564
|
let _ = [];
|
|
565
565
|
const k = Dt.reedSolomonComputeDivisor(w);
|
|
566
566
|
for (let P = 0, I = 0; P < p; P++) {
|
|
567
|
-
let
|
|
568
|
-
I +=
|
|
569
|
-
const z = Dt.reedSolomonComputeRemainder(
|
|
570
|
-
P < S &&
|
|
567
|
+
let N = c.slice(I, I + E - w + (P < S ? 0 : 1));
|
|
568
|
+
I += N.length;
|
|
569
|
+
const z = Dt.reedSolomonComputeRemainder(N, k);
|
|
570
|
+
P < S && N.push(0), _.push(N.concat(z));
|
|
571
571
|
}
|
|
572
572
|
let A = [];
|
|
573
|
-
for (let P = 0; P < _[0].length; P++) _.forEach((I,
|
|
574
|
-
(P != E - w ||
|
|
573
|
+
for (let P = 0; P < _[0].length; P++) _.forEach((I, N) => {
|
|
574
|
+
(P != E - w || N >= S) && A.push(I[P]);
|
|
575
575
|
});
|
|
576
576
|
return i(A.length == v), A;
|
|
577
577
|
}
|
|
@@ -714,7 +714,7 @@ var mn, pc, V1 = Object.defineProperty, _s = Object.getOwnPropertySymbols, of =
|
|
|
714
714
|
if (!o) throw new Error("Assertion error");
|
|
715
715
|
}
|
|
716
716
|
t.MIN_VERSION = 1, t.MAX_VERSION = 40, t.PENALTY_N1 = 3, t.PENALTY_N2 = 3, t.PENALTY_N3 = 40, t.PENALTY_N4 = 10, t.ECC_CODEWORDS_PER_BLOCK = [[-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28], [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]], t.NUM_ERROR_CORRECTION_BLOCKS = [[-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25], [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49], [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68], [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]], e.QrCode = t;
|
|
717
|
-
const s = class
|
|
717
|
+
const s = class we {
|
|
718
718
|
constructor(c, f, u) {
|
|
719
719
|
if (this.mode = c, this.numChars = f, this.bitData = u, f < 0) throw new RangeError("Invalid argument");
|
|
720
720
|
this.bitData = u.slice();
|
|
@@ -722,28 +722,28 @@ var mn, pc, V1 = Object.defineProperty, _s = Object.getOwnPropertySymbols, of =
|
|
|
722
722
|
static makeBytes(c) {
|
|
723
723
|
let f = [];
|
|
724
724
|
for (const u of c) r(u, 8, f);
|
|
725
|
-
return new
|
|
725
|
+
return new we(we.Mode.BYTE, c.length, f);
|
|
726
726
|
}
|
|
727
727
|
static makeNumeric(c) {
|
|
728
|
-
if (!
|
|
728
|
+
if (!we.isNumeric(c)) throw new RangeError("String contains non-numeric characters");
|
|
729
729
|
let f = [];
|
|
730
730
|
for (let u = 0; u < c.length; ) {
|
|
731
731
|
const p = Math.min(c.length - u, 3);
|
|
732
732
|
r(parseInt(c.substring(u, u + p), 10), 3 * p + 1, f), u += p;
|
|
733
733
|
}
|
|
734
|
-
return new
|
|
734
|
+
return new we(we.Mode.NUMERIC, c.length, f);
|
|
735
735
|
}
|
|
736
736
|
static makeAlphanumeric(c) {
|
|
737
|
-
if (!
|
|
737
|
+
if (!we.isAlphanumeric(c)) throw new RangeError("String contains unencodable characters in alphanumeric mode");
|
|
738
738
|
let f, u = [];
|
|
739
739
|
for (f = 0; f + 2 <= c.length; f += 2) {
|
|
740
|
-
let p = 45 *
|
|
741
|
-
p +=
|
|
740
|
+
let p = 45 * we.ALPHANUMERIC_CHARSET.indexOf(c.charAt(f));
|
|
741
|
+
p += we.ALPHANUMERIC_CHARSET.indexOf(c.charAt(f + 1)), r(p, 11, u);
|
|
742
742
|
}
|
|
743
|
-
return f < c.length && r(
|
|
743
|
+
return f < c.length && r(we.ALPHANUMERIC_CHARSET.indexOf(c.charAt(f)), 6, u), new we(we.Mode.ALPHANUMERIC, c.length, u);
|
|
744
744
|
}
|
|
745
745
|
static makeSegments(c) {
|
|
746
|
-
return c == "" ? [] :
|
|
746
|
+
return c == "" ? [] : we.isNumeric(c) ? [we.makeNumeric(c)] : we.isAlphanumeric(c) ? [we.makeAlphanumeric(c)] : [we.makeBytes(we.toUtf8ByteArray(c))];
|
|
747
747
|
}
|
|
748
748
|
static makeEci(c) {
|
|
749
749
|
let f = [];
|
|
@@ -754,13 +754,13 @@ var mn, pc, V1 = Object.defineProperty, _s = Object.getOwnPropertySymbols, of =
|
|
|
754
754
|
if (!(c < 1e6)) throw new RangeError("ECI assignment value out of range");
|
|
755
755
|
r(6, 3, f), r(c, 21, f);
|
|
756
756
|
}
|
|
757
|
-
return new
|
|
757
|
+
return new we(we.Mode.ECI, 0, f);
|
|
758
758
|
}
|
|
759
759
|
static isNumeric(c) {
|
|
760
|
-
return
|
|
760
|
+
return we.NUMERIC_REGEX.test(c);
|
|
761
761
|
}
|
|
762
762
|
static isAlphanumeric(c) {
|
|
763
|
-
return
|
|
763
|
+
return we.ALPHANUMERIC_REGEX.test(c);
|
|
764
764
|
}
|
|
765
765
|
getData() {
|
|
766
766
|
return this.bitData.slice();
|
|
@@ -838,11 +838,11 @@ function bf({ value: e, level: t, minVersion: r, includeMargin: n, marginSize: i
|
|
|
838
838
|
return A != null ? Math.max(Math.floor(A), 0) : k ? 4 : 0;
|
|
839
839
|
}(n, i), E = v.length + 2 * S, _ = function(k, A, P, I) {
|
|
840
840
|
if (I == null) return null;
|
|
841
|
-
const
|
|
841
|
+
const N = k.length + 2 * P, z = Math.floor(0.1 * A), B = N / A, d = (I.width || z) * B, h = (I.height || z) * B, y = I.x == null ? k.length / 2 - d / 2 : I.x * B, m = I.y == null ? k.length / 2 - h / 2 : I.y * B, l = I.opacity == null ? 1 : I.opacity;
|
|
842
842
|
let g = null;
|
|
843
843
|
if (I.excavate) {
|
|
844
|
-
let x = Math.floor(y),
|
|
845
|
-
g = { x, y:
|
|
844
|
+
let x = Math.floor(y), O = Math.floor(m);
|
|
845
|
+
g = { x, y: O, w: Math.ceil(d + y - x), h: Math.ceil(h + m - O) };
|
|
846
846
|
}
|
|
847
847
|
return { x: y, y: m, h, w: d, excavation: g, opacity: l, crossOrigin: I.crossOrigin };
|
|
848
848
|
}(v, a, S, s);
|
|
@@ -857,16 +857,16 @@ var W1 = function() {
|
|
|
857
857
|
return !1;
|
|
858
858
|
}
|
|
859
859
|
return !0;
|
|
860
|
-
}(),
|
|
860
|
+
}(), Cn = Ie.forwardRef(function(e, t) {
|
|
861
861
|
const r = e, { value: n, size: i = cf, level: s = df, bgColor: a = ff, fgColor: o = uf, includeMargin: c = hf, minVersion: f = lf, boostLevel: u, marginSize: p, imageSettings: w } = r, v = Do(r, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "minVersion", "boostLevel", "marginSize", "imageSettings"]), { style: S } = v, E = Do(v, ["style"]), _ = w == null ? void 0 : w.src, k = Ie.useRef(null), A = Ie.useRef(null), P = Ie.useCallback((l) => {
|
|
862
862
|
k.current = l, typeof t == "function" ? t(l) : t && (t.current = l);
|
|
863
|
-
}, [t]), [I,
|
|
863
|
+
}, [t]), [I, N] = Ie.useState(!1), { margin: z, cells: B, numCells: d, calculatedImageSettings: h } = bf({ value: n, level: s, minVersion: f, boostLevel: u, includeMargin: c, marginSize: p, imageSettings: w, size: i });
|
|
864
864
|
Ie.useEffect(() => {
|
|
865
865
|
if (k.current != null) {
|
|
866
866
|
const l = k.current, g = l.getContext("2d");
|
|
867
867
|
if (!g) return;
|
|
868
868
|
let x = B;
|
|
869
|
-
const
|
|
869
|
+
const O = A.current, R = h != null && O !== null && O.complete && O.naturalHeight !== 0 && O.naturalWidth !== 0;
|
|
870
870
|
R && h.excavation != null && (x = mf(B, h.excavation));
|
|
871
871
|
const j = window.devicePixelRatio || 1;
|
|
872
872
|
l.height = l.width = i * j;
|
|
@@ -875,24 +875,24 @@ var W1 = function() {
|
|
|
875
875
|
$.forEach(function(D, U) {
|
|
876
876
|
D && g.fillRect(U + z, V + z, 1, 1);
|
|
877
877
|
});
|
|
878
|
-
}), h && (g.globalAlpha = h.opacity), R && g.drawImage(
|
|
878
|
+
}), h && (g.globalAlpha = h.opacity), R && g.drawImage(O, h.x + z, h.y + z, h.w, h.h);
|
|
879
879
|
}
|
|
880
880
|
}), Ie.useEffect(() => {
|
|
881
|
-
|
|
881
|
+
N(!1);
|
|
882
882
|
}, [_]);
|
|
883
883
|
const y = Ho({ height: i, width: i }, S);
|
|
884
884
|
let m = null;
|
|
885
885
|
return _ != null && (m = Ie.createElement("img", { src: _, key: _, style: { display: "none" }, onLoad: () => {
|
|
886
|
-
|
|
886
|
+
N(!0);
|
|
887
887
|
}, ref: A, crossOrigin: h == null ? void 0 : h.crossOrigin })), Ie.createElement(Ie.Fragment, null, Ie.createElement("canvas", Ho({ style: y, height: i, width: i, ref: P, role: "img" }, E)), m);
|
|
888
888
|
});
|
|
889
|
-
|
|
889
|
+
Cn.displayName = "QRCodeCanvas";
|
|
890
890
|
var Y1 = Ie.forwardRef(function(e, t) {
|
|
891
891
|
const r = e, { value: n, size: i = cf, level: s = df, bgColor: a = ff, fgColor: o = uf, includeMargin: c = hf, minVersion: f = lf, boostLevel: u, title: p, marginSize: w, imageSettings: v } = r, S = Do(r, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "minVersion", "boostLevel", "title", "marginSize", "imageSettings"]), { margin: E, cells: _, numCells: k, calculatedImageSettings: A } = bf({ value: n, level: s, minVersion: f, boostLevel: u, includeMargin: c, marginSize: w, imageSettings: v, size: i });
|
|
892
892
|
let P = _, I = null;
|
|
893
893
|
v != null && A != null && (A.excavation != null && (P = mf(_, A.excavation)), I = Ie.createElement("image", { href: v.src, height: A.h, width: A.w, x: A.x + E, y: A.y + E, preserveAspectRatio: "none", opacity: A.opacity, crossOrigin: A.crossOrigin }));
|
|
894
|
-
const
|
|
895
|
-
return Ie.createElement("svg", Ho({ height: i, width: i, viewBox: `0 0 ${k} ${k}`, ref: t, role: "img" }, S), !!p && Ie.createElement("title", null, p), Ie.createElement("path", { fill: a, d: `M0,0 h${k}v${k}H0z`, shapeRendering: "crispEdges" }), Ie.createElement("path", { fill: o, d:
|
|
894
|
+
const N = pf(P, E);
|
|
895
|
+
return Ie.createElement("svg", Ho({ height: i, width: i, viewBox: `0 0 ${k} ${k}`, ref: t, role: "img" }, S), !!p && Ie.createElement("title", null, p), Ie.createElement("path", { fill: a, d: `M0,0 h${k}v${k}H0z`, shapeRendering: "crispEdges" }), Ie.createElement("path", { fill: o, d: N, shapeRendering: "crispEdges" }), I);
|
|
896
896
|
});
|
|
897
897
|
Y1.displayName = "QRCodeSVG";
|
|
898
898
|
const Er = /* @__PURE__ */ Object.create(null);
|
|
@@ -1169,7 +1169,7 @@ class au extends iu {
|
|
|
1169
1169
|
}), this.pollXhr = t;
|
|
1170
1170
|
}
|
|
1171
1171
|
}
|
|
1172
|
-
class
|
|
1172
|
+
class Nr extends ke {
|
|
1173
1173
|
constructor(t, r, n) {
|
|
1174
1174
|
super(), this.createRequest = t, Hs(this, n), this._opts = n, this._method = n.method || "GET", this._uri = r, this._data = n.data !== void 0 ? n.data : null, this._create();
|
|
1175
1175
|
}
|
|
@@ -1206,7 +1206,7 @@ class Cr extends ke {
|
|
|
1206
1206
|
this._onError(i);
|
|
1207
1207
|
}, 0);
|
|
1208
1208
|
}
|
|
1209
|
-
typeof document < "u" && (this._index =
|
|
1209
|
+
typeof document < "u" && (this._index = Nr.requestsCount++, Nr.requests[this._index] = this);
|
|
1210
1210
|
}
|
|
1211
1211
|
_onError(t) {
|
|
1212
1212
|
this.emitReserved("error", t, this._xhr), this._cleanup(!0);
|
|
@@ -1217,7 +1217,7 @@ class Cr extends ke {
|
|
|
1217
1217
|
this._xhr.abort();
|
|
1218
1218
|
} catch {
|
|
1219
1219
|
}
|
|
1220
|
-
typeof document < "u" && delete
|
|
1220
|
+
typeof document < "u" && delete Nr.requests[this._index], this._xhr = null;
|
|
1221
1221
|
}
|
|
1222
1222
|
}
|
|
1223
1223
|
_onLoad() {
|
|
@@ -1228,9 +1228,9 @@ class Cr extends ke {
|
|
|
1228
1228
|
this._cleanup();
|
|
1229
1229
|
}
|
|
1230
1230
|
}
|
|
1231
|
-
|
|
1231
|
+
Nr.requestsCount = 0, Nr.requests = {}, typeof document < "u" && (typeof attachEvent == "function" ? attachEvent("onunload", vc) : typeof addEventListener == "function" && addEventListener("onpagehide" in ur ? "pagehide" : "unload", vc, !1));
|
|
1232
1232
|
function vc() {
|
|
1233
|
-
for (let e in
|
|
1233
|
+
for (let e in Nr.requests) Nr.requests.hasOwnProperty(e) && Nr.requests[e].abort();
|
|
1234
1234
|
}
|
|
1235
1235
|
const cu = function() {
|
|
1236
1236
|
const e = Af({ xdomain: !1 });
|
|
@@ -1383,7 +1383,7 @@ const fo = ur.WebSocket || ur.MozWebSocket, fu = { websocket: class extends du {
|
|
|
1383
1383
|
this.supportsBinary = cu && !t;
|
|
1384
1384
|
}
|
|
1385
1385
|
request(e = {}) {
|
|
1386
|
-
return Object.assign(e, { xd: this.xd }, this.opts), new
|
|
1386
|
+
return Object.assign(e, { xd: this.xd }, this.opts), new Nr(Af, this.uri(), e);
|
|
1387
1387
|
}
|
|
1388
1388
|
} }, uu = /^(?:(?![^:@\/?#]+:[^:@\/]*@)(http|https|ws|wss):\/\/)?((?:(([^:@\/?#]*)(?::([^:@\/?#]*))?)?@)?((?:[a-f0-9]{0,4}:){2,7}[a-f0-9]{0,4}|[^:\/?#]*)(?::(\d*))?)(((\/(?:[^?#](?![^?#\/]*\.[^?#\/.]+(?:[?#]|$)))*\/?)?([^?#\/]*))(?:\?([^#]*))?(?:#(.*))?)/, hu = ["source", "protocol", "authority", "userInfo", "user", "password", "host", "port", "relative", "path", "directory", "file", "query", "anchor"];
|
|
1389
1389
|
function Zo(e) {
|
|
@@ -2199,9 +2199,9 @@ function Jt() {
|
|
|
2199
2199
|
return (_ || p).stringify(this);
|
|
2200
2200
|
}, concat: function(_) {
|
|
2201
2201
|
var k = this.words, A = _.words, P = this.sigBytes, I = _.sigBytes;
|
|
2202
|
-
if (this.clamp(), P % 4) for (var
|
|
2203
|
-
var z = A[
|
|
2204
|
-
k[P +
|
|
2202
|
+
if (this.clamp(), P % 4) for (var N = 0; N < I; N++) {
|
|
2203
|
+
var z = A[N >>> 2] >>> 24 - N % 4 * 8 & 255;
|
|
2204
|
+
k[P + N >>> 2] |= z << 24 - (P + N) % 4 * 8;
|
|
2205
2205
|
}
|
|
2206
2206
|
else for (var B = 0; B < I; B += 4) k[P + B >>> 2] = A[B >>> 2];
|
|
2207
2207
|
return this.sigBytes += I, this;
|
|
@@ -2216,8 +2216,8 @@ function Jt() {
|
|
|
2216
2216
|
return new f.init(k, _);
|
|
2217
2217
|
} }), u = a.enc = {}, p = u.Hex = { stringify: function(_) {
|
|
2218
2218
|
for (var k = _.words, A = _.sigBytes, P = [], I = 0; I < A; I++) {
|
|
2219
|
-
var
|
|
2220
|
-
P.push((
|
|
2219
|
+
var N = k[I >>> 2] >>> 24 - I % 4 * 8 & 255;
|
|
2220
|
+
P.push((N >>> 4).toString(16)), P.push((15 & N).toString(16));
|
|
2221
2221
|
}
|
|
2222
2222
|
return P.join("");
|
|
2223
2223
|
}, parse: function(_) {
|
|
@@ -2225,8 +2225,8 @@ function Jt() {
|
|
|
2225
2225
|
return new f.init(A, k / 2);
|
|
2226
2226
|
} }, w = u.Latin1 = { stringify: function(_) {
|
|
2227
2227
|
for (var k = _.words, A = _.sigBytes, P = [], I = 0; I < A; I++) {
|
|
2228
|
-
var
|
|
2229
|
-
P.push(String.fromCharCode(
|
|
2228
|
+
var N = k[I >>> 2] >>> 24 - I % 4 * 8 & 255;
|
|
2229
|
+
P.push(String.fromCharCode(N));
|
|
2230
2230
|
}
|
|
2231
2231
|
return P.join("");
|
|
2232
2232
|
}, parse: function(_) {
|
|
@@ -2245,9 +2245,9 @@ function Jt() {
|
|
|
2245
2245
|
}, _append: function(_) {
|
|
2246
2246
|
typeof _ == "string" && (_ = v.parse(_)), this._data.concat(_), this._nDataBytes += _.sigBytes;
|
|
2247
2247
|
}, _process: function(_) {
|
|
2248
|
-
var k, A = this._data, P = A.words, I = A.sigBytes,
|
|
2248
|
+
var k, A = this._data, P = A.words, I = A.sigBytes, N = this.blockSize, z = I / (4 * N), B = (z = _ ? t.ceil(z) : t.max((0 | z) - this._minBufferSize, 0)) * N, d = t.min(4 * B, I);
|
|
2249
2249
|
if (B) {
|
|
2250
|
-
for (var h = 0; h < B; h +=
|
|
2250
|
+
for (var h = 0; h < B; h += N) this._doProcessBlock(P, h);
|
|
2251
2251
|
k = P.splice(0, B), A.sigBytes -= d;
|
|
2252
2252
|
}
|
|
2253
2253
|
return new f.init(k, d);
|
|
@@ -2381,9 +2381,9 @@ function yn() {
|
|
|
2381
2381
|
}(), e.enc.Base64;
|
|
2382
2382
|
}(Jt())), Rc.exports;
|
|
2383
2383
|
}
|
|
2384
|
-
var
|
|
2384
|
+
var Nc, Oc = { exports: {} };
|
|
2385
2385
|
function Mu() {
|
|
2386
|
-
return
|
|
2386
|
+
return Nc || (Nc = 1, Oc.exports = function(e) {
|
|
2387
2387
|
return function() {
|
|
2388
2388
|
var t = e, r = t.lib.WordArray;
|
|
2389
2389
|
function n(i, s, a) {
|
|
@@ -2416,11 +2416,11 @@ function Mu() {
|
|
|
2416
2416
|
return n(i, a, c);
|
|
2417
2417
|
}, _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", _safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_" };
|
|
2418
2418
|
}(), e.enc.Base64url;
|
|
2419
|
-
}(Jt())),
|
|
2419
|
+
}(Jt())), Oc.exports;
|
|
2420
2420
|
}
|
|
2421
|
-
var
|
|
2421
|
+
var Cc, Bc = { exports: {} };
|
|
2422
2422
|
function vn() {
|
|
2423
|
-
return
|
|
2423
|
+
return Cc || (Cc = 1, Bc.exports = function(e) {
|
|
2424
2424
|
return function(t) {
|
|
2425
2425
|
var r = e, n = r.lib, i = n.WordArray, s = n.Hasher, a = r.algo, o = [];
|
|
2426
2426
|
(function() {
|
|
@@ -2433,16 +2433,16 @@ function vn() {
|
|
|
2433
2433
|
var _ = S + E, k = v[_];
|
|
2434
2434
|
v[_] = 16711935 & (k << 8 | k >>> 24) | 4278255360 & (k << 24 | k >>> 8);
|
|
2435
2435
|
}
|
|
2436
|
-
var A = this._hash.words, P = v[S + 0], I = v[S + 1],
|
|
2437
|
-
$ = f($, V, D, U, P, 7, o[0]), U = f(U, $, V, D, I, 12, o[1]), D = f(D, U, $, V,
|
|
2436
|
+
var A = this._hash.words, P = v[S + 0], I = v[S + 1], N = v[S + 2], z = v[S + 3], B = v[S + 4], d = v[S + 5], h = v[S + 6], y = v[S + 7], m = v[S + 8], l = v[S + 9], g = v[S + 10], x = v[S + 11], O = v[S + 12], R = v[S + 13], j = v[S + 14], F = v[S + 15], $ = A[0], V = A[1], D = A[2], U = A[3];
|
|
2437
|
+
$ = f($, V, D, U, P, 7, o[0]), U = f(U, $, V, D, I, 12, o[1]), D = f(D, U, $, V, N, 17, o[2]), V = f(V, D, U, $, z, 22, o[3]), $ = f($, V, D, U, B, 7, o[4]), U = f(U, $, V, D, d, 12, o[5]), D = f(D, U, $, V, h, 17, o[6]), V = f(V, D, U, $, y, 22, o[7]), $ = f($, V, D, U, m, 7, o[8]), U = f(U, $, V, D, l, 12, o[9]), D = f(D, U, $, V, g, 17, o[10]), V = f(V, D, U, $, x, 22, o[11]), $ = f($, V, D, U, O, 7, o[12]), U = f(U, $, V, D, R, 12, o[13]), D = f(D, U, $, V, j, 17, o[14]), $ = u($, V = f(V, D, U, $, F, 22, o[15]), D, U, I, 5, o[16]), U = u(U, $, V, D, h, 9, o[17]), D = u(D, U, $, V, x, 14, o[18]), V = u(V, D, U, $, P, 20, o[19]), $ = u($, V, D, U, d, 5, o[20]), U = u(U, $, V, D, g, 9, o[21]), D = u(D, U, $, V, F, 14, o[22]), V = u(V, D, U, $, B, 20, o[23]), $ = u($, V, D, U, l, 5, o[24]), U = u(U, $, V, D, j, 9, o[25]), D = u(D, U, $, V, z, 14, o[26]), V = u(V, D, U, $, m, 20, o[27]), $ = u($, V, D, U, R, 5, o[28]), U = u(U, $, V, D, N, 9, o[29]), D = u(D, U, $, V, y, 14, o[30]), $ = p($, V = u(V, D, U, $, O, 20, o[31]), D, U, d, 4, o[32]), U = p(U, $, V, D, m, 11, o[33]), D = p(D, U, $, V, x, 16, o[34]), V = p(V, D, U, $, j, 23, o[35]), $ = p($, V, D, U, I, 4, o[36]), U = p(U, $, V, D, B, 11, o[37]), D = p(D, U, $, V, y, 16, o[38]), V = p(V, D, U, $, g, 23, o[39]), $ = p($, V, D, U, R, 4, o[40]), U = p(U, $, V, D, P, 11, o[41]), D = p(D, U, $, V, z, 16, o[42]), V = p(V, D, U, $, h, 23, o[43]), $ = p($, V, D, U, l, 4, o[44]), U = p(U, $, V, D, O, 11, o[45]), D = p(D, U, $, V, F, 16, o[46]), $ = w($, V = p(V, D, U, $, N, 23, o[47]), D, U, P, 6, o[48]), U = w(U, $, V, D, y, 10, o[49]), D = w(D, U, $, V, j, 15, o[50]), V = w(V, D, U, $, d, 21, o[51]), $ = w($, V, D, U, O, 6, o[52]), U = w(U, $, V, D, z, 10, o[53]), D = w(D, U, $, V, g, 15, o[54]), V = w(V, D, U, $, I, 21, o[55]), $ = w($, V, D, U, m, 6, o[56]), U = w(U, $, V, D, F, 10, o[57]), D = w(D, U, $, V, h, 15, o[58]), V = w(V, D, U, $, R, 21, o[59]), $ = w($, V, D, U, B, 6, o[60]), U = w(U, $, V, D, x, 10, o[61]), D = w(D, U, $, V, N, 15, o[62]), V = w(V, D, U, $, l, 21, o[63]), A[0] = A[0] + $ | 0, A[1] = A[1] + V | 0, A[2] = A[2] + D | 0, A[3] = A[3] + U | 0;
|
|
2438
2438
|
}, _doFinalize: function() {
|
|
2439
2439
|
var v = this._data, S = v.words, E = 8 * this._nDataBytes, _ = 8 * v.sigBytes;
|
|
2440
2440
|
S[_ >>> 5] |= 128 << 24 - _ % 32;
|
|
2441
2441
|
var k = t.floor(E / 4294967296), A = E;
|
|
2442
2442
|
S[15 + (_ + 64 >>> 9 << 4)] = 16711935 & (k << 8 | k >>> 24) | 4278255360 & (k << 24 | k >>> 8), S[14 + (_ + 64 >>> 9 << 4)] = 16711935 & (A << 8 | A >>> 24) | 4278255360 & (A << 24 | A >>> 8), v.sigBytes = 4 * (S.length + 1), this._process();
|
|
2443
|
-
for (var P = this._hash, I = P.words,
|
|
2444
|
-
var z = I[
|
|
2445
|
-
I[
|
|
2443
|
+
for (var P = this._hash, I = P.words, N = 0; N < 4; N++) {
|
|
2444
|
+
var z = I[N];
|
|
2445
|
+
I[N] = 16711935 & (z << 8 | z >>> 24) | 4278255360 & (z << 24 | z >>> 8);
|
|
2446
2446
|
}
|
|
2447
2447
|
return P;
|
|
2448
2448
|
}, clone: function() {
|
|
@@ -2515,16 +2515,16 @@ function uo() {
|
|
|
2515
2515
|
var f = [], u = a.SHA256 = s.extend({ _doReset: function() {
|
|
2516
2516
|
this._hash = new i.init(o.slice(0));
|
|
2517
2517
|
}, _doProcessBlock: function(p, w) {
|
|
2518
|
-
for (var v = this._hash.words, S = v[0], E = v[1], _ = v[2], k = v[3], A = v[4], P = v[5], I = v[6],
|
|
2518
|
+
for (var v = this._hash.words, S = v[0], E = v[1], _ = v[2], k = v[3], A = v[4], P = v[5], I = v[6], N = v[7], z = 0; z < 64; z++) {
|
|
2519
2519
|
if (z < 16) f[z] = 0 | p[w + z];
|
|
2520
2520
|
else {
|
|
2521
2521
|
var B = f[z - 15], d = (B << 25 | B >>> 7) ^ (B << 14 | B >>> 18) ^ B >>> 3, h = f[z - 2], y = (h << 15 | h >>> 17) ^ (h << 13 | h >>> 19) ^ h >>> 10;
|
|
2522
2522
|
f[z] = d + f[z - 7] + y + f[z - 16];
|
|
2523
2523
|
}
|
|
2524
|
-
var m = S & E ^ S & _ ^ E & _, l = (S << 30 | S >>> 2) ^ (S << 19 | S >>> 13) ^ (S << 10 | S >>> 22), g =
|
|
2525
|
-
|
|
2524
|
+
var m = S & E ^ S & _ ^ E & _, l = (S << 30 | S >>> 2) ^ (S << 19 | S >>> 13) ^ (S << 10 | S >>> 22), g = N + ((A << 26 | A >>> 6) ^ (A << 21 | A >>> 11) ^ (A << 7 | A >>> 25)) + (A & P ^ ~A & I) + c[z] + f[z];
|
|
2525
|
+
N = I, I = P, P = A, A = k + g | 0, k = _, _ = E, E = S, S = g + (l + m) | 0;
|
|
2526
2526
|
}
|
|
2527
|
-
v[0] = v[0] + S | 0, v[1] = v[1] + E | 0, v[2] = v[2] + _ | 0, v[3] = v[3] + k | 0, v[4] = v[4] + A | 0, v[5] = v[5] + P | 0, v[6] = v[6] + I | 0, v[7] = v[7] +
|
|
2527
|
+
v[0] = v[0] + S | 0, v[1] = v[1] + E | 0, v[2] = v[2] + _ | 0, v[3] = v[3] + k | 0, v[4] = v[4] + A | 0, v[5] = v[5] + P | 0, v[6] = v[6] + I | 0, v[7] = v[7] + N | 0;
|
|
2528
2528
|
}, _doFinalize: function() {
|
|
2529
2529
|
var p = this._data, w = p.words, v = 8 * this._nDataBytes, S = 8 * p.sigBytes;
|
|
2530
2530
|
return w[S >>> 5] |= 128 << 24 - S % 32, w[14 + (S + 64 >>> 9 << 4)] = t.floor(v / 4294967296), w[15 + (S + 64 >>> 9 << 4)] = v, p.sigBytes = 4 * w.length, this._process(), this._hash;
|
|
@@ -2551,17 +2551,17 @@ function Hc() {
|
|
|
2551
2551
|
var u = a.SHA512 = r.extend({ _doReset: function() {
|
|
2552
2552
|
this._hash = new s.init([new i.init(1779033703, 4089235720), new i.init(3144134277, 2227873595), new i.init(1013904242, 4271175723), new i.init(2773480762, 1595750129), new i.init(1359893119, 2917565137), new i.init(2600822924, 725511199), new i.init(528734635, 4215389547), new i.init(1541459225, 327033209)]);
|
|
2553
2553
|
}, _doProcessBlock: function(p, w) {
|
|
2554
|
-
for (var v = this._hash.words, S = v[0], E = v[1], _ = v[2], k = v[3], A = v[4], P = v[5], I = v[6],
|
|
2554
|
+
for (var v = this._hash.words, S = v[0], E = v[1], _ = v[2], k = v[3], A = v[4], P = v[5], I = v[6], N = v[7], z = S.high, B = S.low, d = E.high, h = E.low, y = _.high, m = _.low, l = k.high, g = k.low, x = A.high, O = A.low, R = P.high, j = P.low, F = I.high, $ = I.low, V = N.high, D = N.low, U = z, G = B, Nt = d, dt = h, gt = y, Ft = m, mt = l, Mt = g, Zt = x, jt = O, oe = R, Qe = j, Yt = F, ee = $, zr = V, ae = D, Vt = 0; Vt < 80; Vt++) {
|
|
2555
2555
|
var Ke, ie, ce = f[Vt];
|
|
2556
2556
|
if (Vt < 16) ie = ce.high = 0 | p[w + 2 * Vt], Ke = ce.low = 0 | p[w + 2 * Vt + 1];
|
|
2557
2557
|
else {
|
|
2558
|
-
var jr = f[Vt - 15], se = jr.high, de = jr.low, Yr = (se >>> 1 | de << 31) ^ (se >>> 8 | de << 24) ^ se >>> 7, fe = (de >>> 1 | se << 31) ^ (de >>> 8 | se << 24) ^ (de >>> 7 | se << 25), re = f[Vt - 2], $e = re.high, ne = re.low, pe = ($e >>> 19 | ne << 13) ^ ($e << 3 | ne >>> 29) ^ $e >>> 6, Me = (ne >>> 19 | $e << 13) ^ (ne << 3 | $e >>> 29) ^ (ne >>> 6 | $e << 26), he = f[Vt - 7], T = he.high,
|
|
2559
|
-
ie = (ie = (ie = Yr + T + ((Ke = fe +
|
|
2558
|
+
var jr = f[Vt - 15], se = jr.high, de = jr.low, Yr = (se >>> 1 | de << 31) ^ (se >>> 8 | de << 24) ^ se >>> 7, fe = (de >>> 1 | se << 31) ^ (de >>> 8 | se << 24) ^ (de >>> 7 | se << 25), re = f[Vt - 2], $e = re.high, ne = re.low, pe = ($e >>> 19 | ne << 13) ^ ($e << 3 | ne >>> 29) ^ $e >>> 6, Me = (ne >>> 19 | $e << 13) ^ (ne << 3 | $e >>> 29) ^ (ne >>> 6 | $e << 26), he = f[Vt - 7], T = he.high, C = he.low, L = f[Vt - 16], b = L.high, M = L.low;
|
|
2559
|
+
ie = (ie = (ie = Yr + T + ((Ke = fe + C) >>> 0 < fe >>> 0 ? 1 : 0)) + pe + ((Ke += Me) >>> 0 < Me >>> 0 ? 1 : 0)) + b + ((Ke += M) >>> 0 < M >>> 0 ? 1 : 0), ce.high = ie, ce.low = Ke;
|
|
2560
2560
|
}
|
|
2561
|
-
var H, Z = Zt & oe ^ ~Zt & Yt, W = jt & Qe ^ ~jt & ee, q = U &
|
|
2562
|
-
zr = Yt, ae = ee, Yt = oe, ee = Qe, oe = Zt, Qe = jt, Zt = mt + (ot = (ot = (ot = ot + Z + ((H += W) >>> 0 < W >>> 0 ? 1 : 0)) + ut + ((H += St) >>> 0 < St >>> 0 ? 1 : 0)) + ie + ((H += Ke) >>> 0 < Ke >>> 0 ? 1 : 0)) + ((jt = Mt + H | 0) >>> 0 < Mt >>> 0 ? 1 : 0) | 0, mt = gt, Mt = Ft, gt =
|
|
2561
|
+
var H, Z = Zt & oe ^ ~Zt & Yt, W = jt & Qe ^ ~jt & ee, q = U & Nt ^ U & gt ^ Nt & gt, Y = G & dt ^ G & Ft ^ dt & Ft, vt = (U >>> 28 | G << 4) ^ (U << 30 | G >>> 2) ^ (U << 25 | G >>> 7), X = (G >>> 28 | U << 4) ^ (G << 30 | U >>> 2) ^ (G << 25 | U >>> 7), ct = (Zt >>> 14 | jt << 18) ^ (Zt >>> 18 | jt << 14) ^ (Zt << 23 | jt >>> 9), _t = (jt >>> 14 | Zt << 18) ^ (jt >>> 18 | Zt << 14) ^ (jt << 23 | Zt >>> 9), nt = c[Vt], ut = nt.high, St = nt.low, ot = zr + ct + ((H = ae + _t) >>> 0 < ae >>> 0 ? 1 : 0), ht = X + Y;
|
|
2562
|
+
zr = Yt, ae = ee, Yt = oe, ee = Qe, oe = Zt, Qe = jt, Zt = mt + (ot = (ot = (ot = ot + Z + ((H += W) >>> 0 < W >>> 0 ? 1 : 0)) + ut + ((H += St) >>> 0 < St >>> 0 ? 1 : 0)) + ie + ((H += Ke) >>> 0 < Ke >>> 0 ? 1 : 0)) + ((jt = Mt + H | 0) >>> 0 < Mt >>> 0 ? 1 : 0) | 0, mt = gt, Mt = Ft, gt = Nt, Ft = dt, Nt = U, dt = G, U = ot + (vt + q + (ht >>> 0 < X >>> 0 ? 1 : 0)) + ((G = H + ht | 0) >>> 0 < H >>> 0 ? 1 : 0) | 0;
|
|
2563
2563
|
}
|
|
2564
|
-
B = S.low = B + G, S.high = z + U + (B >>> 0 < G >>> 0 ? 1 : 0), h = E.low = h + dt, E.high = d +
|
|
2564
|
+
B = S.low = B + G, S.high = z + U + (B >>> 0 < G >>> 0 ? 1 : 0), h = E.low = h + dt, E.high = d + Nt + (h >>> 0 < dt >>> 0 ? 1 : 0), m = _.low = m + Ft, _.high = y + gt + (m >>> 0 < Ft >>> 0 ? 1 : 0), g = k.low = g + Mt, k.high = l + mt + (g >>> 0 < Mt >>> 0 ? 1 : 0), O = A.low = O + jt, A.high = x + Zt + (O >>> 0 < jt >>> 0 ? 1 : 0), j = P.low = j + Qe, P.high = R + oe + (j >>> 0 < Qe >>> 0 ? 1 : 0), $ = I.low = $ + ee, I.high = F + Yt + ($ >>> 0 < ee >>> 0 ? 1 : 0), D = N.low = D + ae, N.high = V + zr + (D >>> 0 < ae >>> 0 ? 1 : 0);
|
|
2565
2565
|
}, _doFinalize: function() {
|
|
2566
2566
|
var p = this._data, w = p.words, v = 8 * this._nDataBytes, S = 8 * p.sigBytes;
|
|
2567
2567
|
return w[S >>> 5] |= 128 << 24 - S % 32, w[30 + (S + 128 >>> 10 << 5)] = Math.floor(v / 4294967296), w[31 + (S + 128 >>> 10 << 5)] = v, p.sigBytes = 4 * w.length, this._process(), this._hash.toX32();
|
|
@@ -2586,9 +2586,9 @@ function Tu() {
|
|
|
2586
2586
|
}
|
|
2587
2587
|
for (v = 0; v < 5; v++) for (S = 0; S < 5; S++) f[v + 5 * S] = S + (2 * v + 3 * S) % 5 * 5;
|
|
2588
2588
|
for (var k = 1, A = 0; A < 24; A++) {
|
|
2589
|
-
for (var P = 0, I = 0,
|
|
2589
|
+
for (var P = 0, I = 0, N = 0; N < 7; N++) {
|
|
2590
2590
|
if (1 & k) {
|
|
2591
|
-
var z = (1 <<
|
|
2591
|
+
var z = (1 << N) - 1;
|
|
2592
2592
|
z < 32 ? I ^= 1 << z : P ^= 1 << z - 32;
|
|
2593
2593
|
}
|
|
2594
2594
|
128 & k ? k = k << 1 ^ 113 : k <<= 1;
|
|
@@ -2609,25 +2609,25 @@ function Tu() {
|
|
|
2609
2609
|
A = 16711935 & (A << 8 | A >>> 24) | 4278255360 & (A << 24 | A >>> 8), P = 16711935 & (P << 8 | P >>> 24) | 4278255360 & (P << 24 | P >>> 8), (D = E[k]).high ^= P, D.low ^= A;
|
|
2610
2610
|
}
|
|
2611
2611
|
for (var I = 0; I < 24; I++) {
|
|
2612
|
-
for (var
|
|
2613
|
-
for (var z = 0, B = 0, d = 0; d < 5; d++) z ^= (D = E[
|
|
2614
|
-
var h = p[
|
|
2612
|
+
for (var N = 0; N < 5; N++) {
|
|
2613
|
+
for (var z = 0, B = 0, d = 0; d < 5; d++) z ^= (D = E[N + 5 * d]).high, B ^= D.low;
|
|
2614
|
+
var h = p[N];
|
|
2615
2615
|
h.high = z, h.low = B;
|
|
2616
2616
|
}
|
|
2617
|
-
for (
|
|
2618
|
-
var y = p[(
|
|
2619
|
-
for (z = y.high ^ (l << 1 | g >>> 31), B = y.low ^ (g << 1 | l >>> 31), d = 0; d < 5; d++) (D = E[
|
|
2617
|
+
for (N = 0; N < 5; N++) {
|
|
2618
|
+
var y = p[(N + 4) % 5], m = p[(N + 1) % 5], l = m.high, g = m.low;
|
|
2619
|
+
for (z = y.high ^ (l << 1 | g >>> 31), B = y.low ^ (g << 1 | l >>> 31), d = 0; d < 5; d++) (D = E[N + 5 * d]).high ^= z, D.low ^= B;
|
|
2620
2620
|
}
|
|
2621
2621
|
for (var x = 1; x < 25; x++) {
|
|
2622
|
-
var
|
|
2623
|
-
j < 32 ? (z =
|
|
2622
|
+
var O = (D = E[x]).high, R = D.low, j = c[x];
|
|
2623
|
+
j < 32 ? (z = O << j | R >>> 32 - j, B = R << j | O >>> 32 - j) : (z = R << j - 32 | O >>> 64 - j, B = O << j - 32 | R >>> 64 - j);
|
|
2624
2624
|
var F = p[f[x]];
|
|
2625
2625
|
F.high = z, F.low = B;
|
|
2626
2626
|
}
|
|
2627
2627
|
var $ = p[0], V = E[0];
|
|
2628
|
-
for ($.high = V.high, $.low = V.low,
|
|
2629
|
-
var D = E[x =
|
|
2630
|
-
D.high = U.high ^ ~G.high &
|
|
2628
|
+
for ($.high = V.high, $.low = V.low, N = 0; N < 5; N++) for (d = 0; d < 5; d++) {
|
|
2629
|
+
var D = E[x = N + 5 * d], U = p[x], G = p[(N + 1) % 5 + 5 * d], Nt = p[(N + 2) % 5 + 5 * d];
|
|
2630
|
+
D.high = U.high ^ ~G.high & Nt.high, D.low = U.low ^ ~G.low & Nt.low;
|
|
2631
2631
|
}
|
|
2632
2632
|
D = E[0];
|
|
2633
2633
|
var dt = u[I];
|
|
@@ -2638,8 +2638,8 @@ function Tu() {
|
|
|
2638
2638
|
this._nDataBytes;
|
|
2639
2639
|
var E = 8 * v.sigBytes, _ = 32 * this.blockSize;
|
|
2640
2640
|
S[E >>> 5] |= 1 << 24 - E % 32, S[(t.ceil((E + 1) / _) * _ >>> 5) - 1] |= 128, v.sigBytes = 4 * S.length, this._process();
|
|
2641
|
-
for (var k = this._state, A = this.cfg.outputLength / 8, P = A / 8, I = [],
|
|
2642
|
-
var z = k[
|
|
2641
|
+
for (var k = this._state, A = this.cfg.outputLength / 8, P = A / 8, I = [], N = 0; N < P; N++) {
|
|
2642
|
+
var z = k[N], B = z.high, d = z.low;
|
|
2643
2643
|
B = 16711935 & (B << 8 | B >>> 24) | 4278255360 & (B << 24 | B >>> 8), d = 16711935 & (d << 8 | d >>> 24) | 4278255360 & (d << 24 | d >>> 8), I.push(d), I.push(B);
|
|
2644
2644
|
}
|
|
2645
2645
|
return new i.init(I, A);
|
|
@@ -2674,7 +2674,7 @@ function Qo() {
|
|
|
2674
2674
|
})();
|
|
2675
2675
|
}(Jt())), Wc.exports;
|
|
2676
2676
|
}
|
|
2677
|
-
var Yc,
|
|
2677
|
+
var Yc, Nu = { exports: {} }, Qc, Jc = { exports: {} };
|
|
2678
2678
|
function nn() {
|
|
2679
2679
|
return Qc || (Qc = 1, Jc.exports = function(e) {
|
|
2680
2680
|
return function() {
|
|
@@ -2700,12 +2700,12 @@ function Be() {
|
|
|
2700
2700
|
e.lib.Cipher || function(t) {
|
|
2701
2701
|
var r = e, n = r.lib, i = n.Base, s = n.WordArray, a = n.BufferedBlockAlgorithm, o = r.enc;
|
|
2702
2702
|
o.Utf8;
|
|
2703
|
-
var c = o.Base64, f = r.algo.EvpKDF, u = n.Cipher = a.extend({ cfg: i.extend(), createEncryptor: function(I,
|
|
2704
|
-
return this.create(this._ENC_XFORM_MODE, I,
|
|
2705
|
-
}, createDecryptor: function(I,
|
|
2706
|
-
return this.create(this._DEC_XFORM_MODE, I,
|
|
2707
|
-
}, init: function(I,
|
|
2708
|
-
this.cfg = this.cfg.extend(z), this._xformMode = I, this._key =
|
|
2703
|
+
var c = o.Base64, f = r.algo.EvpKDF, u = n.Cipher = a.extend({ cfg: i.extend(), createEncryptor: function(I, N) {
|
|
2704
|
+
return this.create(this._ENC_XFORM_MODE, I, N);
|
|
2705
|
+
}, createDecryptor: function(I, N) {
|
|
2706
|
+
return this.create(this._DEC_XFORM_MODE, I, N);
|
|
2707
|
+
}, init: function(I, N, z) {
|
|
2708
|
+
this.cfg = this.cfg.extend(z), this._xformMode = I, this._key = N, this.reset();
|
|
2709
2709
|
}, reset: function() {
|
|
2710
2710
|
a.reset.call(this), this._doReset();
|
|
2711
2711
|
}, process: function(I) {
|
|
@@ -2713,97 +2713,97 @@ function Be() {
|
|
|
2713
2713
|
}, finalize: function(I) {
|
|
2714
2714
|
return I && this._append(I), this._doFinalize();
|
|
2715
2715
|
}, keySize: 4, ivSize: 4, _ENC_XFORM_MODE: 1, _DEC_XFORM_MODE: 2, _createHelper: /* @__PURE__ */ function() {
|
|
2716
|
-
function I(
|
|
2717
|
-
return typeof
|
|
2716
|
+
function I(N) {
|
|
2717
|
+
return typeof N == "string" ? P : k;
|
|
2718
2718
|
}
|
|
2719
|
-
return function(
|
|
2719
|
+
return function(N) {
|
|
2720
2720
|
return { encrypt: function(z, B, d) {
|
|
2721
|
-
return I(B).encrypt(
|
|
2721
|
+
return I(B).encrypt(N, z, B, d);
|
|
2722
2722
|
}, decrypt: function(z, B, d) {
|
|
2723
|
-
return I(B).decrypt(
|
|
2723
|
+
return I(B).decrypt(N, z, B, d);
|
|
2724
2724
|
} };
|
|
2725
2725
|
};
|
|
2726
2726
|
}() });
|
|
2727
2727
|
n.StreamCipher = u.extend({ _doFinalize: function() {
|
|
2728
2728
|
return this._process(!0);
|
|
2729
2729
|
}, blockSize: 1 });
|
|
2730
|
-
var p = r.mode = {}, w = n.BlockCipherMode = i.extend({ createEncryptor: function(I,
|
|
2731
|
-
return this.Encryptor.create(I,
|
|
2732
|
-
}, createDecryptor: function(I,
|
|
2733
|
-
return this.Decryptor.create(I,
|
|
2734
|
-
}, init: function(I,
|
|
2735
|
-
this._cipher = I, this._iv =
|
|
2730
|
+
var p = r.mode = {}, w = n.BlockCipherMode = i.extend({ createEncryptor: function(I, N) {
|
|
2731
|
+
return this.Encryptor.create(I, N);
|
|
2732
|
+
}, createDecryptor: function(I, N) {
|
|
2733
|
+
return this.Decryptor.create(I, N);
|
|
2734
|
+
}, init: function(I, N) {
|
|
2735
|
+
this._cipher = I, this._iv = N;
|
|
2736
2736
|
} }), v = p.CBC = function() {
|
|
2737
2737
|
var I = w.extend();
|
|
2738
|
-
function
|
|
2738
|
+
function N(z, B, d) {
|
|
2739
2739
|
var h, y = this._iv;
|
|
2740
2740
|
y ? (h = y, this._iv = t) : h = this._prevBlock;
|
|
2741
2741
|
for (var m = 0; m < d; m++) z[B + m] ^= h[m];
|
|
2742
2742
|
}
|
|
2743
2743
|
return I.Encryptor = I.extend({ processBlock: function(z, B) {
|
|
2744
2744
|
var d = this._cipher, h = d.blockSize;
|
|
2745
|
-
|
|
2745
|
+
N.call(this, z, B, h), d.encryptBlock(z, B), this._prevBlock = z.slice(B, B + h);
|
|
2746
2746
|
} }), I.Decryptor = I.extend({ processBlock: function(z, B) {
|
|
2747
2747
|
var d = this._cipher, h = d.blockSize, y = z.slice(B, B + h);
|
|
2748
|
-
d.decryptBlock(z, B),
|
|
2748
|
+
d.decryptBlock(z, B), N.call(this, z, B, h), this._prevBlock = y;
|
|
2749
2749
|
} }), I;
|
|
2750
|
-
}(), S = (r.pad = {}).Pkcs7 = { pad: function(I,
|
|
2751
|
-
for (var z = 4 *
|
|
2750
|
+
}(), S = (r.pad = {}).Pkcs7 = { pad: function(I, N) {
|
|
2751
|
+
for (var z = 4 * N, B = z - I.sigBytes % z, d = B << 24 | B << 16 | B << 8 | B, h = [], y = 0; y < B; y += 4) h.push(d);
|
|
2752
2752
|
var m = s.create(h, B);
|
|
2753
2753
|
I.concat(m);
|
|
2754
2754
|
}, unpad: function(I) {
|
|
2755
|
-
var
|
|
2756
|
-
I.sigBytes -=
|
|
2755
|
+
var N = 255 & I.words[I.sigBytes - 1 >>> 2];
|
|
2756
|
+
I.sigBytes -= N;
|
|
2757
2757
|
} };
|
|
2758
2758
|
n.BlockCipher = u.extend({ cfg: u.cfg.extend({ mode: v, padding: S }), reset: function() {
|
|
2759
2759
|
var I;
|
|
2760
2760
|
u.reset.call(this);
|
|
2761
|
-
var
|
|
2761
|
+
var N = this.cfg, z = N.iv, B = N.mode;
|
|
2762
2762
|
this._xformMode == this._ENC_XFORM_MODE ? I = B.createEncryptor : (I = B.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == I ? this._mode.init(this, z && z.words) : (this._mode = I.call(B, this, z && z.words), this._mode.__creator = I);
|
|
2763
|
-
}, _doProcessBlock: function(I,
|
|
2764
|
-
this._mode.processBlock(I,
|
|
2763
|
+
}, _doProcessBlock: function(I, N) {
|
|
2764
|
+
this._mode.processBlock(I, N);
|
|
2765
2765
|
}, _doFinalize: function() {
|
|
2766
|
-
var I,
|
|
2767
|
-
return this._xformMode == this._ENC_XFORM_MODE ? (
|
|
2766
|
+
var I, N = this.cfg.padding;
|
|
2767
|
+
return this._xformMode == this._ENC_XFORM_MODE ? (N.pad(this._data, this.blockSize), I = this._process(!0)) : (I = this._process(!0), N.unpad(I)), I;
|
|
2768
2768
|
}, blockSize: 4 });
|
|
2769
2769
|
var E = n.CipherParams = i.extend({ init: function(I) {
|
|
2770
2770
|
this.mixIn(I);
|
|
2771
2771
|
}, toString: function(I) {
|
|
2772
2772
|
return (I || this.formatter).stringify(this);
|
|
2773
2773
|
} }), _ = (r.format = {}).OpenSSL = { stringify: function(I) {
|
|
2774
|
-
var
|
|
2775
|
-
return (z ? s.create([1398893684, 1701076831]).concat(z).concat(
|
|
2774
|
+
var N = I.ciphertext, z = I.salt;
|
|
2775
|
+
return (z ? s.create([1398893684, 1701076831]).concat(z).concat(N) : N).toString(c);
|
|
2776
2776
|
}, parse: function(I) {
|
|
2777
|
-
var
|
|
2778
|
-
return B[0] == 1398893684 && B[1] == 1701076831 && (
|
|
2779
|
-
} }, k = n.SerializableCipher = i.extend({ cfg: i.extend({ format: _ }), encrypt: function(I,
|
|
2777
|
+
var N, z = c.parse(I), B = z.words;
|
|
2778
|
+
return B[0] == 1398893684 && B[1] == 1701076831 && (N = s.create(B.slice(2, 4)), B.splice(0, 4), z.sigBytes -= 16), E.create({ ciphertext: z, salt: N });
|
|
2779
|
+
} }, k = n.SerializableCipher = i.extend({ cfg: i.extend({ format: _ }), encrypt: function(I, N, z, B) {
|
|
2780
2780
|
B = this.cfg.extend(B);
|
|
2781
|
-
var d = I.createEncryptor(z, B), h = d.finalize(
|
|
2781
|
+
var d = I.createEncryptor(z, B), h = d.finalize(N), y = d.cfg;
|
|
2782
2782
|
return E.create({ ciphertext: h, key: z, iv: y.iv, algorithm: I, mode: y.mode, padding: y.padding, blockSize: I.blockSize, formatter: B.format });
|
|
2783
|
-
}, decrypt: function(I,
|
|
2784
|
-
return B = this.cfg.extend(B),
|
|
2785
|
-
}, _parse: function(I,
|
|
2786
|
-
return typeof I == "string" ?
|
|
2787
|
-
} }), A = (r.kdf = {}).OpenSSL = { execute: function(I,
|
|
2788
|
-
if (B || (B = s.random(8)), d) h = f.create({ keySize:
|
|
2789
|
-
else var h = f.create({ keySize:
|
|
2790
|
-
var y = s.create(h.words.slice(
|
|
2791
|
-
return h.sigBytes = 4 *
|
|
2792
|
-
} }, P = n.PasswordBasedCipher = k.extend({ cfg: k.cfg.extend({ kdf: A }), encrypt: function(I,
|
|
2783
|
+
}, decrypt: function(I, N, z, B) {
|
|
2784
|
+
return B = this.cfg.extend(B), N = this._parse(N, B.format), I.createDecryptor(z, B).finalize(N.ciphertext);
|
|
2785
|
+
}, _parse: function(I, N) {
|
|
2786
|
+
return typeof I == "string" ? N.parse(I, this) : I;
|
|
2787
|
+
} }), A = (r.kdf = {}).OpenSSL = { execute: function(I, N, z, B, d) {
|
|
2788
|
+
if (B || (B = s.random(8)), d) h = f.create({ keySize: N + z, hasher: d }).compute(I, B);
|
|
2789
|
+
else var h = f.create({ keySize: N + z }).compute(I, B);
|
|
2790
|
+
var y = s.create(h.words.slice(N), 4 * z);
|
|
2791
|
+
return h.sigBytes = 4 * N, E.create({ key: h, iv: y, salt: B });
|
|
2792
|
+
} }, P = n.PasswordBasedCipher = k.extend({ cfg: k.cfg.extend({ kdf: A }), encrypt: function(I, N, z, B) {
|
|
2793
2793
|
var d = (B = this.cfg.extend(B)).kdf.execute(z, I.keySize, I.ivSize, B.salt, B.hasher);
|
|
2794
2794
|
B.iv = d.iv;
|
|
2795
|
-
var h = k.encrypt.call(this, I,
|
|
2795
|
+
var h = k.encrypt.call(this, I, N, d.key, B);
|
|
2796
2796
|
return h.mixIn(d), h;
|
|
2797
|
-
}, decrypt: function(I,
|
|
2798
|
-
B = this.cfg.extend(B),
|
|
2799
|
-
var d = B.kdf.execute(z, I.keySize, I.ivSize,
|
|
2800
|
-
return B.iv = d.iv, k.decrypt.call(this, I,
|
|
2797
|
+
}, decrypt: function(I, N, z, B) {
|
|
2798
|
+
B = this.cfg.extend(B), N = this._parse(N, B.format);
|
|
2799
|
+
var d = B.kdf.execute(z, I.keySize, I.ivSize, N.salt, B.hasher);
|
|
2800
|
+
return B.iv = d.iv, k.decrypt.call(this, I, N, d.key, B);
|
|
2801
2801
|
} });
|
|
2802
2802
|
}();
|
|
2803
2803
|
}(Jt(), nn())), Xc.exports;
|
|
2804
2804
|
}
|
|
2805
2805
|
var t0, e0 = { exports: {} };
|
|
2806
|
-
function
|
|
2806
|
+
function Ou() {
|
|
2807
2807
|
return t0 || (t0 = 1, e0.exports = function(e) {
|
|
2808
2808
|
return e.mode.CFB = function() {
|
|
2809
2809
|
var t = e.lib.BlockCipherMode.extend();
|
|
@@ -2823,7 +2823,7 @@ function Nu() {
|
|
|
2823
2823
|
}(Jt(), Be())), e0.exports;
|
|
2824
2824
|
}
|
|
2825
2825
|
var r0, n0 = { exports: {} };
|
|
2826
|
-
function
|
|
2826
|
+
function Cu() {
|
|
2827
2827
|
return r0 || (r0 = 1, n0.exports = function(e) {
|
|
2828
2828
|
return e.mode.CTR = (t = e.lib.BlockCipherMode.extend(), r = t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
2829
2829
|
var s = this._cipher, a = s.blockSize, o = this._iv, c = this._counter;
|
|
@@ -2888,10 +2888,10 @@ function Fu() {
|
|
|
2888
2888
|
_[k] = E[A >>> 5] >>> 31 - A % 32 & 1;
|
|
2889
2889
|
}
|
|
2890
2890
|
for (var P = this._subKeys = [], I = 0; I < 16; I++) {
|
|
2891
|
-
var
|
|
2892
|
-
for (k = 0; k < 24; k++)
|
|
2893
|
-
for (
|
|
2894
|
-
|
|
2891
|
+
var N = P[I] = [], z = c[I];
|
|
2892
|
+
for (k = 0; k < 24; k++) N[k / 6 | 0] |= _[(o[k] - 1 + z) % 28] << 31 - k % 6, N[4 + (k / 6 | 0)] |= _[28 + (o[k + 24] - 1 + z) % 28] << 31 - k % 6;
|
|
2893
|
+
for (N[0] = N[0] << 1 | N[0] >>> 31, k = 1; k < 7; k++) N[k] = N[k] >>> 4 * (k - 1) + 3;
|
|
2894
|
+
N[7] = N[7] << 5 | N[7] >>> 27;
|
|
2895
2895
|
}
|
|
2896
2896
|
var B = this._invSubKeys = [];
|
|
2897
2897
|
for (k = 0; k < 16; k++) B[k] = P[15 - k];
|
|
@@ -2902,8 +2902,8 @@ function Fu() {
|
|
|
2902
2902
|
}, _doCryptBlock: function(E, _, k) {
|
|
2903
2903
|
this._lBlock = E[_], this._rBlock = E[_ + 1], w.call(this, 4, 252645135), w.call(this, 16, 65535), v.call(this, 2, 858993459), v.call(this, 8, 16711935), w.call(this, 1, 1431655765);
|
|
2904
2904
|
for (var A = 0; A < 16; A++) {
|
|
2905
|
-
for (var P = k[A], I = this._lBlock,
|
|
2906
|
-
this._lBlock =
|
|
2905
|
+
for (var P = k[A], I = this._lBlock, N = this._rBlock, z = 0, B = 0; B < 8; B++) z |= f[B][((N ^ P[B]) & u[B]) >>> 0];
|
|
2906
|
+
this._lBlock = N, this._rBlock = I ^ z;
|
|
2907
2907
|
}
|
|
2908
2908
|
var d = this._lBlock;
|
|
2909
2909
|
this._lBlock = this._rBlock, this._rBlock = d, w.call(this, 1, 1431655765), v.call(this, 8, 16711935), v.call(this, 2, 858993459), w.call(this, 16, 65535), w.call(this, 4, 252645135), E[_] = this._lBlock, E[_ + 1] = this._rBlock;
|
|
@@ -2955,13 +2955,13 @@ function Wu() {
|
|
|
2955
2955
|
function p(v, S, E) {
|
|
2956
2956
|
for (let I = 0; I < 4; I++) {
|
|
2957
2957
|
v.sbox[I] = [];
|
|
2958
|
-
for (let
|
|
2958
|
+
for (let N = 0; N < 256; N++) v.sbox[I][N] = a[I][N];
|
|
2959
2959
|
}
|
|
2960
2960
|
let _ = 0;
|
|
2961
2961
|
for (let I = 0; I < i + 2; I++) v.pbox[I] = s[I] ^ S[_], _++, _ >= E && (_ = 0);
|
|
2962
2962
|
let k = 0, A = 0, P = 0;
|
|
2963
2963
|
for (let I = 0; I < i + 2; I += 2) P = f(v, k, A), k = P.left, A = P.right, v.pbox[I] = k, v.pbox[I + 1] = A;
|
|
2964
|
-
for (let I = 0; I < 4; I++) for (let
|
|
2964
|
+
for (let I = 0; I < 4; I++) for (let N = 0; N < 256; N += 2) P = f(v, k, A), k = P.left, A = P.right, v.sbox[I][N] = k, v.sbox[I][N + 1] = A;
|
|
2965
2965
|
return !0;
|
|
2966
2966
|
}
|
|
2967
2967
|
var w = n.Blowfish = r.extend({ _doReset: function() {
|
|
@@ -3017,16 +3017,16 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3017
3017
|
var t = e, r = t.lib, n = r.WordArray, i = r.Hasher, s = t.algo, a = n.create([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]), o = n.create([5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]), c = n.create([11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6]), f = n.create([8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11]), u = n.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), p = n.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), w = s.RIPEMD160 = i.extend({ _doReset: function() {
|
|
3018
3018
|
this._hash = n.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
3019
3019
|
}, _doProcessBlock: function(P, I) {
|
|
3020
|
-
for (var
|
|
3021
|
-
var z = I +
|
|
3020
|
+
for (var N = 0; N < 16; N++) {
|
|
3021
|
+
var z = I + N, B = P[z];
|
|
3022
3022
|
P[z] = 16711935 & (B << 8 | B >>> 24) | 4278255360 & (B << 24 | B >>> 8);
|
|
3023
3023
|
}
|
|
3024
|
-
var d, h, y, m, l, g, x,
|
|
3025
|
-
for (g = d = $[0], x = h = $[1],
|
|
3026
|
-
F = $[1] + y + R | 0, $[1] = $[2] + m + j | 0, $[2] = $[3] + l + g | 0, $[3] = $[4] + d + x | 0, $[4] = $[0] + h +
|
|
3024
|
+
var d, h, y, m, l, g, x, O, R, j, F, $ = this._hash.words, V = u.words, D = p.words, U = a.words, G = o.words, Nt = c.words, dt = f.words;
|
|
3025
|
+
for (g = d = $[0], x = h = $[1], O = y = $[2], R = m = $[3], j = l = $[4], N = 0; N < 80; N += 1) F = d + P[I + U[N]] | 0, F += N < 16 ? v(h, y, m) + V[0] : N < 32 ? S(h, y, m) + V[1] : N < 48 ? E(h, y, m) + V[2] : N < 64 ? _(h, y, m) + V[3] : k(h, y, m) + V[4], F = (F = A(F |= 0, Nt[N])) + l | 0, d = l, l = m, m = A(y, 10), y = h, h = F, F = g + P[I + G[N]] | 0, F += N < 16 ? k(x, O, R) + D[0] : N < 32 ? _(x, O, R) + D[1] : N < 48 ? E(x, O, R) + D[2] : N < 64 ? S(x, O, R) + D[3] : v(x, O, R) + D[4], F = (F = A(F |= 0, dt[N])) + j | 0, g = j, j = R, R = A(O, 10), O = x, x = F;
|
|
3026
|
+
F = $[1] + y + R | 0, $[1] = $[2] + m + j | 0, $[2] = $[3] + l + g | 0, $[3] = $[4] + d + x | 0, $[4] = $[0] + h + O | 0, $[0] = F;
|
|
3027
3027
|
}, _doFinalize: function() {
|
|
3028
|
-
var P = this._data, I = P.words,
|
|
3029
|
-
I[z >>> 5] |= 128 << 24 - z % 32, I[14 + (z + 64 >>> 9 << 4)] = 16711935 & (
|
|
3028
|
+
var P = this._data, I = P.words, N = 8 * this._nDataBytes, z = 8 * P.sigBytes;
|
|
3029
|
+
I[z >>> 5] |= 128 << 24 - z % 32, I[14 + (z + 64 >>> 9 << 4)] = 16711935 & (N << 8 | N >>> 24) | 4278255360 & (N << 24 | N >>> 8), P.sigBytes = 4 * (I.length + 1), this._process();
|
|
3030
3030
|
for (var B = this._hash, d = B.words, h = 0; h < 5; h++) {
|
|
3031
3031
|
var y = d[h];
|
|
3032
3032
|
d[h] = 16711935 & (y << 8 | y >>> 24) | 4278255360 & (y << 24 | y >>> 8);
|
|
@@ -3036,27 +3036,27 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3036
3036
|
var P = i.clone.call(this);
|
|
3037
3037
|
return P._hash = this._hash.clone(), P;
|
|
3038
3038
|
} });
|
|
3039
|
-
function v(P, I,
|
|
3040
|
-
return P ^ I ^
|
|
3039
|
+
function v(P, I, N) {
|
|
3040
|
+
return P ^ I ^ N;
|
|
3041
3041
|
}
|
|
3042
|
-
function S(P, I,
|
|
3043
|
-
return P & I | ~P &
|
|
3042
|
+
function S(P, I, N) {
|
|
3043
|
+
return P & I | ~P & N;
|
|
3044
3044
|
}
|
|
3045
|
-
function E(P, I,
|
|
3046
|
-
return (P | ~I) ^
|
|
3045
|
+
function E(P, I, N) {
|
|
3046
|
+
return (P | ~I) ^ N;
|
|
3047
3047
|
}
|
|
3048
|
-
function _(P, I,
|
|
3049
|
-
return P &
|
|
3048
|
+
function _(P, I, N) {
|
|
3049
|
+
return P & N | I & ~N;
|
|
3050
3050
|
}
|
|
3051
|
-
function k(P, I,
|
|
3052
|
-
return P ^ (I | ~
|
|
3051
|
+
function k(P, I, N) {
|
|
3052
|
+
return P ^ (I | ~N);
|
|
3053
3053
|
}
|
|
3054
3054
|
function A(P, I) {
|
|
3055
3055
|
return P << I | P >>> 32 - I;
|
|
3056
3056
|
}
|
|
3057
3057
|
t.RIPEMD160 = i._createHelper(w), t.HmacRIPEMD160 = i._createHmacHelper(w);
|
|
3058
3058
|
}(), e.RIPEMD160;
|
|
3059
|
-
}(Jt())), Qo(), Yc || (Yc = 1,
|
|
3059
|
+
}(Jt())), Qo(), Yc || (Yc = 1, Nu.exports = function(e) {
|
|
3060
3060
|
return function() {
|
|
3061
3061
|
var t = e, r = t.lib, n = r.Base, i = r.WordArray, s = t.algo, a = s.SHA256, o = s.HMAC, c = s.PBKDF2 = n.extend({ cfg: n.extend({ keySize: 4, hasher: a, iterations: 25e4 }), init: function(f) {
|
|
3062
3062
|
this.cfg = this.cfg.extend(f);
|
|
@@ -3064,9 +3064,9 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3064
3064
|
for (var p = this.cfg, w = o.create(p.hasher, f), v = i.create(), S = i.create([1]), E = v.words, _ = S.words, k = p.keySize, A = p.iterations; E.length < k; ) {
|
|
3065
3065
|
var P = w.update(u).finalize(S);
|
|
3066
3066
|
w.reset();
|
|
3067
|
-
for (var I = P.words,
|
|
3067
|
+
for (var I = P.words, N = I.length, z = P, B = 1; B < A; B++) {
|
|
3068
3068
|
z = w.finalize(z), w.reset();
|
|
3069
|
-
for (var d = z.words, h = 0; h <
|
|
3069
|
+
for (var d = z.words, h = 0; h < N; h++) I[h] ^= d[h];
|
|
3070
3070
|
}
|
|
3071
3071
|
v.concat(P), _[0]++;
|
|
3072
3072
|
}
|
|
@@ -3076,7 +3076,7 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3076
3076
|
return c.create(p).compute(f, u);
|
|
3077
3077
|
};
|
|
3078
3078
|
}(), e.PBKDF2;
|
|
3079
|
-
}(Jt(), uo(), Qo())), nn(), Be(),
|
|
3079
|
+
}(Jt(), uo(), Qo())), nn(), Be(), Ou(), Cu(), Bu(), Pu(), c0 || (c0 = 1, Lu.exports = function(e) {
|
|
3080
3080
|
return e.mode.ECB = ((t = e.lib.BlockCipherMode.extend()).Encryptor = t.extend({ processBlock: function(r, n) {
|
|
3081
3081
|
this._cipher.encryptBlock(r, n);
|
|
3082
3082
|
} }), t.Decryptor = t.extend({ processBlock: function(r, n) {
|
|
@@ -3137,17 +3137,17 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3137
3137
|
for (k = 0; k < 256; k++) {
|
|
3138
3138
|
var I = P ^ P << 1 ^ P << 2 ^ P << 3 ^ P << 4;
|
|
3139
3139
|
I = I >>> 8 ^ 255 & I ^ 99, i[A] = I, s[I] = A;
|
|
3140
|
-
var
|
|
3141
|
-
a[A] = d << 24 | d >>> 8, o[A] = d << 16 | d >>> 16, c[A] = d << 8 | d >>> 24, f[A] = d, d = 16843009 * B ^ 65537 * z ^ 257 *
|
|
3140
|
+
var N = _[A], z = _[N], B = _[z], d = 257 * _[I] ^ 16843008 * I;
|
|
3141
|
+
a[A] = d << 24 | d >>> 8, o[A] = d << 16 | d >>> 16, c[A] = d << 8 | d >>> 24, f[A] = d, d = 16843009 * B ^ 65537 * z ^ 257 * N ^ 16843008 * A, u[I] = d << 24 | d >>> 8, p[I] = d << 16 | d >>> 16, w[I] = d << 8 | d >>> 24, v[I] = d, A ? (A = N ^ _[_[_[B ^ N]]], P ^= _[_[P]]) : A = P = 1;
|
|
3142
3142
|
}
|
|
3143
3143
|
})();
|
|
3144
3144
|
var S = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], E = n.AES = r.extend({ _doReset: function() {
|
|
3145
3145
|
if (!this._nRounds || this._keyPriorReset !== this._key) {
|
|
3146
|
-
for (var _ = this._keyPriorReset = this._key, k = _.words, A = _.sigBytes / 4, P = 4 * ((this._nRounds = A + 6) + 1), I = this._keySchedule = [],
|
|
3146
|
+
for (var _ = this._keyPriorReset = this._key, k = _.words, A = _.sigBytes / 4, P = 4 * ((this._nRounds = A + 6) + 1), I = this._keySchedule = [], N = 0; N < P; N++) N < A ? I[N] = k[N] : (d = I[N - 1], N % A ? A > 6 && N % A == 4 && (d = i[d >>> 24] << 24 | i[d >>> 16 & 255] << 16 | i[d >>> 8 & 255] << 8 | i[255 & d]) : (d = i[(d = d << 8 | d >>> 24) >>> 24] << 24 | i[d >>> 16 & 255] << 16 | i[d >>> 8 & 255] << 8 | i[255 & d], d ^= S[N / A | 0] << 24), I[N] = I[N - A] ^ d);
|
|
3147
3147
|
for (var z = this._invKeySchedule = [], B = 0; B < P; B++) {
|
|
3148
|
-
if (
|
|
3149
|
-
else d = I[
|
|
3150
|
-
z[B] = B < 4 ||
|
|
3148
|
+
if (N = P - B, B % 4) var d = I[N];
|
|
3149
|
+
else d = I[N - 4];
|
|
3150
|
+
z[B] = B < 4 || N <= 4 ? d : u[i[d >>> 24]] ^ p[i[d >>> 16 & 255]] ^ w[i[d >>> 8 & 255]] ^ v[i[255 & d]];
|
|
3151
3151
|
}
|
|
3152
3152
|
}
|
|
3153
3153
|
}, encryptBlock: function(_, k) {
|
|
@@ -3155,12 +3155,12 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3155
3155
|
}, decryptBlock: function(_, k) {
|
|
3156
3156
|
var A = _[k + 1];
|
|
3157
3157
|
_[k + 1] = _[k + 3], _[k + 3] = A, this._doCryptBlock(_, k, this._invKeySchedule, u, p, w, v, s), A = _[k + 1], _[k + 1] = _[k + 3], _[k + 3] = A;
|
|
3158
|
-
}, _doCryptBlock: function(_, k, A, P, I,
|
|
3158
|
+
}, _doCryptBlock: function(_, k, A, P, I, N, z, B) {
|
|
3159
3159
|
for (var d = this._nRounds, h = _[k] ^ A[0], y = _[k + 1] ^ A[1], m = _[k + 2] ^ A[2], l = _[k + 3] ^ A[3], g = 4, x = 1; x < d; x++) {
|
|
3160
|
-
var
|
|
3161
|
-
h =
|
|
3160
|
+
var O = P[h >>> 24] ^ I[y >>> 16 & 255] ^ N[m >>> 8 & 255] ^ z[255 & l] ^ A[g++], R = P[y >>> 24] ^ I[m >>> 16 & 255] ^ N[l >>> 8 & 255] ^ z[255 & h] ^ A[g++], j = P[m >>> 24] ^ I[l >>> 16 & 255] ^ N[h >>> 8 & 255] ^ z[255 & y] ^ A[g++], F = P[l >>> 24] ^ I[h >>> 16 & 255] ^ N[y >>> 8 & 255] ^ z[255 & m] ^ A[g++];
|
|
3161
|
+
h = O, y = R, m = j, l = F;
|
|
3162
3162
|
}
|
|
3163
|
-
|
|
3163
|
+
O = (B[h >>> 24] << 24 | B[y >>> 16 & 255] << 16 | B[m >>> 8 & 255] << 8 | B[255 & l]) ^ A[g++], R = (B[y >>> 24] << 24 | B[m >>> 16 & 255] << 16 | B[l >>> 8 & 255] << 8 | B[255 & h]) ^ A[g++], j = (B[m >>> 24] << 24 | B[l >>> 16 & 255] << 16 | B[h >>> 8 & 255] << 8 | B[255 & y]) ^ A[g++], F = (B[l >>> 24] << 24 | B[h >>> 16 & 255] << 16 | B[y >>> 8 & 255] << 8 | B[255 & m]) ^ A[g++], _[k] = O, _[k + 1] = R, _[k + 2] = j, _[k + 3] = F;
|
|
3164
3164
|
}, keySize: 8 });
|
|
3165
3165
|
t.AES = r._createHelper(E);
|
|
3166
3166
|
}(), e.AES;
|
|
@@ -3248,9 +3248,9 @@ If.exports = /* @__PURE__ */ function(e) {
|
|
|
3248
3248
|
}(), e.RabbitLegacy;
|
|
3249
3249
|
}(Jt(), yn(), vn(), nn(), Be())), Wu());
|
|
3250
3250
|
const Se = di(If.exports);
|
|
3251
|
-
var
|
|
3251
|
+
var Nf = {};
|
|
3252
3252
|
const Yu = "6.6.1";
|
|
3253
|
-
var nr = {},
|
|
3253
|
+
var nr = {}, Of = { exports: {} };
|
|
3254
3254
|
(function(e, t) {
|
|
3255
3255
|
function r(d, h) {
|
|
3256
3256
|
if (!d) throw new Error(h || "Assertion failed");
|
|
@@ -3281,8 +3281,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3281
3281
|
}
|
|
3282
3282
|
function c(d, h, y, m) {
|
|
3283
3283
|
for (var l = 0, g = Math.min(d.length, y), x = h; x < g; x++) {
|
|
3284
|
-
var
|
|
3285
|
-
l *= m, l +=
|
|
3284
|
+
var O = d.charCodeAt(x) - 48;
|
|
3285
|
+
l *= m, l += O >= 49 ? O - 49 + 10 : O >= 17 ? O - 17 + 10 : O;
|
|
3286
3286
|
}
|
|
3287
3287
|
return l;
|
|
3288
3288
|
}
|
|
@@ -3319,7 +3319,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3319
3319
|
this.words = [0], this.length = 1;
|
|
3320
3320
|
for (var m = 0, l = 1; l <= 67108863; l *= h) m++;
|
|
3321
3321
|
m--, l = l / h | 0;
|
|
3322
|
-
for (var g = d.length - y, x = g % m,
|
|
3322
|
+
for (var g = d.length - y, x = g % m, O = Math.min(g, g - x) + y, R = 0, j = y; j < O; j += m) R = c(d, j, j + m, h), this.imuln(l), this.words[0] + R < 67108864 ? this.words[0] += R : this._iaddn(R);
|
|
3323
3323
|
if (x !== 0) {
|
|
3324
3324
|
var F = 1;
|
|
3325
3325
|
for (R = c(d, j, d.length, h), j = 0; j < x; j++) F *= h;
|
|
@@ -3349,8 +3349,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3349
3349
|
y.negative = h.negative ^ d.negative;
|
|
3350
3350
|
var m = d.length + h.length | 0;
|
|
3351
3351
|
y.length = m, m = m - 1 | 0;
|
|
3352
|
-
var l = 0 | d.words[0], g = 0 | h.words[0], x = l * g,
|
|
3353
|
-
y.words[0] =
|
|
3352
|
+
var l = 0 | d.words[0], g = 0 | h.words[0], x = l * g, O = 67108863 & x, R = x / 67108864 | 0;
|
|
3353
|
+
y.words[0] = O;
|
|
3354
3354
|
for (var j = 1; j < m; j++) {
|
|
3355
3355
|
for (var F = R >>> 26, $ = 67108863 & R, V = Math.min(j, h.length - 1), D = Math.max(0, j - d.length + 1); D <= V; D++) {
|
|
3356
3356
|
var U = j - D | 0;
|
|
@@ -3365,8 +3365,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3365
3365
|
if (h = 0 | h || 1, (d = d || 10) === 16 || d === "hex") {
|
|
3366
3366
|
y = "";
|
|
3367
3367
|
for (var m = 0, l = 0, g = 0; g < this.length; g++) {
|
|
3368
|
-
var x = this.words[g],
|
|
3369
|
-
l = x >>> 24 - m & 16777215, (m += 2) >= 26 && (m -= 26, g--), y = l !== 0 || g !== this.length - 1 ? f[6 -
|
|
3368
|
+
var x = this.words[g], O = (16777215 & (x << m | l)).toString(16);
|
|
3369
|
+
l = x >>> 24 - m & 16777215, (m += 2) >= 26 && (m -= 26, g--), y = l !== 0 || g !== this.length - 1 ? f[6 - O.length] + O + y : O + y;
|
|
3370
3370
|
}
|
|
3371
3371
|
for (l !== 0 && (y = l.toString(16) + y); y.length % h !== 0; ) y = "0" + y;
|
|
3372
3372
|
return this.negative !== 0 && (y = "-" + y), y;
|
|
@@ -3395,8 +3395,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3395
3395
|
}, i.prototype.toArrayLike = function(d, h, y) {
|
|
3396
3396
|
var m = this.byteLength(), l = y || Math.max(1, m);
|
|
3397
3397
|
r(m <= l, "byte array longer than desired length"), r(l > 0, "Requested array length <= 0"), this.strip();
|
|
3398
|
-
var g, x,
|
|
3399
|
-
if (
|
|
3398
|
+
var g, x, O = h === "le", R = new d(l), j = this.clone();
|
|
3399
|
+
if (O) {
|
|
3400
3400
|
for (x = 0; !j.isZero(); x++) g = j.andln(255), j.iushrn(8), R[x] = g;
|
|
3401
3401
|
for (; x < l; x++) R[x] = 0;
|
|
3402
3402
|
} else {
|
|
@@ -3511,7 +3511,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3511
3511
|
return this.clone().isub(d);
|
|
3512
3512
|
};
|
|
3513
3513
|
var v = function(d, h, y) {
|
|
3514
|
-
var m, l, g, x = d.words,
|
|
3514
|
+
var m, l, g, x = d.words, O = h.words, R = y.words, j = 0, F = 0 | x[0], $ = 8191 & F, V = F >>> 13, D = 0 | x[1], U = 8191 & D, G = D >>> 13, Nt = 0 | x[2], dt = 8191 & Nt, gt = Nt >>> 13, Ft = 0 | x[3], mt = 8191 & Ft, Mt = Ft >>> 13, Zt = 0 | x[4], jt = 8191 & Zt, oe = Zt >>> 13, Qe = 0 | x[5], Yt = 8191 & Qe, ee = Qe >>> 13, zr = 0 | x[6], ae = 8191 & zr, Vt = zr >>> 13, Ke = 0 | x[7], ie = 8191 & Ke, ce = Ke >>> 13, jr = 0 | x[8], se = 8191 & jr, de = jr >>> 13, Yr = 0 | x[9], fe = 8191 & Yr, re = Yr >>> 13, $e = 0 | O[0], ne = 8191 & $e, pe = $e >>> 13, Me = 0 | O[1], he = 8191 & Me, T = Me >>> 13, C = 0 | O[2], L = 8191 & C, b = C >>> 13, M = 0 | O[3], H = 8191 & M, Z = M >>> 13, W = 0 | O[4], q = 8191 & W, Y = W >>> 13, vt = 0 | O[5], X = 8191 & vt, ct = vt >>> 13, _t = 0 | O[6], nt = 8191 & _t, ut = _t >>> 13, St = 0 | O[7], ot = 8191 & St, ht = St >>> 13, At = 0 | O[8], it = 8191 & At, lt = At >>> 13, Lt = 0 | O[9], at = 8191 & Lt, K = Lt >>> 13;
|
|
3515
3515
|
y.negative = d.negative ^ h.negative, y.length = 19;
|
|
3516
3516
|
var Q = (j + (m = Math.imul($, ne)) | 0) + ((8191 & (l = (l = Math.imul($, pe)) + Math.imul(V, ne) | 0)) << 13) | 0;
|
|
3517
3517
|
j = ((g = Math.imul(V, pe)) + (l >>> 13) | 0) + (Q >>> 26) | 0, Q &= 67108863, m = Math.imul(U, ne), l = (l = Math.imul(U, pe)) + Math.imul(G, ne) | 0, g = Math.imul(G, pe);
|
|
@@ -3541,8 +3541,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3541
3541
|
j = ((g = g + Math.imul(Mt, K) | 0) + (l >>> 13) | 0) + (Tt >>> 26) | 0, Tt &= 67108863, m = Math.imul(fe, q), l = (l = Math.imul(fe, Y)) + Math.imul(re, q) | 0, g = Math.imul(re, Y), m = m + Math.imul(se, X) | 0, l = (l = l + Math.imul(se, ct) | 0) + Math.imul(de, X) | 0, g = g + Math.imul(de, ct) | 0, m = m + Math.imul(ie, nt) | 0, l = (l = l + Math.imul(ie, ut) | 0) + Math.imul(ce, nt) | 0, g = g + Math.imul(ce, ut) | 0, m = m + Math.imul(ae, ot) | 0, l = (l = l + Math.imul(ae, ht) | 0) + Math.imul(Vt, ot) | 0, g = g + Math.imul(Vt, ht) | 0, m = m + Math.imul(Yt, it) | 0, l = (l = l + Math.imul(Yt, lt) | 0) + Math.imul(ee, it) | 0, g = g + Math.imul(ee, lt) | 0;
|
|
3542
3542
|
var Rt = (j + (m = m + Math.imul(jt, at) | 0) | 0) + ((8191 & (l = (l = l + Math.imul(jt, K) | 0) + Math.imul(oe, at) | 0)) << 13) | 0;
|
|
3543
3543
|
j = ((g = g + Math.imul(oe, K) | 0) + (l >>> 13) | 0) + (Rt >>> 26) | 0, Rt &= 67108863, m = Math.imul(fe, X), l = (l = Math.imul(fe, ct)) + Math.imul(re, X) | 0, g = Math.imul(re, ct), m = m + Math.imul(se, nt) | 0, l = (l = l + Math.imul(se, ut) | 0) + Math.imul(de, nt) | 0, g = g + Math.imul(de, ut) | 0, m = m + Math.imul(ie, ot) | 0, l = (l = l + Math.imul(ie, ht) | 0) + Math.imul(ce, ot) | 0, g = g + Math.imul(ce, ht) | 0, m = m + Math.imul(ae, it) | 0, l = (l = l + Math.imul(ae, lt) | 0) + Math.imul(Vt, it) | 0, g = g + Math.imul(Vt, lt) | 0;
|
|
3544
|
-
var
|
|
3545
|
-
j = ((g = g + Math.imul(ee, K) | 0) + (l >>> 13) | 0) + (
|
|
3544
|
+
var Ot = (j + (m = m + Math.imul(Yt, at) | 0) | 0) + ((8191 & (l = (l = l + Math.imul(Yt, K) | 0) + Math.imul(ee, at) | 0)) << 13) | 0;
|
|
3545
|
+
j = ((g = g + Math.imul(ee, K) | 0) + (l >>> 13) | 0) + (Ot >>> 26) | 0, Ot &= 67108863, m = Math.imul(fe, nt), l = (l = Math.imul(fe, ut)) + Math.imul(re, nt) | 0, g = Math.imul(re, ut), m = m + Math.imul(se, ot) | 0, l = (l = l + Math.imul(se, ht) | 0) + Math.imul(de, ot) | 0, g = g + Math.imul(de, ht) | 0, m = m + Math.imul(ie, it) | 0, l = (l = l + Math.imul(ie, lt) | 0) + Math.imul(ce, it) | 0, g = g + Math.imul(ce, lt) | 0;
|
|
3546
3546
|
var xt = (j + (m = m + Math.imul(ae, at) | 0) | 0) + ((8191 & (l = (l = l + Math.imul(ae, K) | 0) + Math.imul(Vt, at) | 0)) << 13) | 0;
|
|
3547
3547
|
j = ((g = g + Math.imul(Vt, K) | 0) + (l >>> 13) | 0) + (xt >>> 26) | 0, xt &= 67108863, m = Math.imul(fe, ot), l = (l = Math.imul(fe, ht)) + Math.imul(re, ot) | 0, g = Math.imul(re, ht), m = m + Math.imul(se, it) | 0, l = (l = l + Math.imul(se, lt) | 0) + Math.imul(de, it) | 0, g = g + Math.imul(de, lt) | 0;
|
|
3548
3548
|
var qt = (j + (m = m + Math.imul(ie, at) | 0) | 0) + ((8191 & (l = (l = l + Math.imul(ie, K) | 0) + Math.imul(ce, at) | 0)) << 13) | 0;
|
|
@@ -3550,7 +3550,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3550
3550
|
var Ht = (j + (m = m + Math.imul(se, at) | 0) | 0) + ((8191 & (l = (l = l + Math.imul(se, K) | 0) + Math.imul(de, at) | 0)) << 13) | 0;
|
|
3551
3551
|
j = ((g = g + Math.imul(de, K) | 0) + (l >>> 13) | 0) + (Ht >>> 26) | 0, Ht &= 67108863;
|
|
3552
3552
|
var me = (j + (m = Math.imul(fe, at)) | 0) + ((8191 & (l = (l = Math.imul(fe, K)) + Math.imul(re, at) | 0)) << 13) | 0;
|
|
3553
|
-
return j = ((g = Math.imul(re, K)) + (l >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, R[0] = Q, R[1] = st, R[2] = tt, R[3] = et, R[4] = rt, R[5] = Pt, R[6] = $t, R[7] = Bt, R[8] = Kt, R[9] = Qt, R[10] = Xt, R[11] = kt, R[12] = Tt, R[13] = Rt, R[14] =
|
|
3553
|
+
return j = ((g = Math.imul(re, K)) + (l >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, R[0] = Q, R[1] = st, R[2] = tt, R[3] = et, R[4] = rt, R[5] = Pt, R[6] = $t, R[7] = Bt, R[8] = Kt, R[9] = Qt, R[10] = Xt, R[11] = kt, R[12] = Tt, R[13] = Rt, R[14] = Ot, R[15] = xt, R[16] = qt, R[17] = Ht, R[18] = me, j !== 0 && (R[19] = j, y.length++), y;
|
|
3554
3554
|
};
|
|
3555
3555
|
function S(d, h, y) {
|
|
3556
3556
|
return new E().mulp(d, h, y);
|
|
@@ -3562,16 +3562,16 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3562
3562
|
var y, m = this.length + d.length;
|
|
3563
3563
|
return y = this.length === 10 && d.length === 10 ? v(this, d, h) : m < 63 ? w(this, d, h) : m < 1024 ? function(l, g, x) {
|
|
3564
3564
|
x.negative = g.negative ^ l.negative, x.length = l.length + g.length;
|
|
3565
|
-
for (var
|
|
3565
|
+
for (var O = 0, R = 0, j = 0; j < x.length - 1; j++) {
|
|
3566
3566
|
var F = R;
|
|
3567
3567
|
R = 0;
|
|
3568
|
-
for (var $ = 67108863 &
|
|
3569
|
-
var U = j - D, G = (0 | l.words[U]) * (0 | g.words[D]),
|
|
3570
|
-
$ = 67108863 & (
|
|
3568
|
+
for (var $ = 67108863 & O, V = Math.min(j, g.length - 1), D = Math.max(0, j - l.length + 1); D <= V; D++) {
|
|
3569
|
+
var U = j - D, G = (0 | l.words[U]) * (0 | g.words[D]), Nt = 67108863 & G;
|
|
3570
|
+
$ = 67108863 & (Nt = Nt + $ | 0), R += (F = (F = F + (G / 67108864 | 0) | 0) + (Nt >>> 26) | 0) >>> 26, F &= 67108863;
|
|
3571
3571
|
}
|
|
3572
|
-
x.words[j] = $,
|
|
3572
|
+
x.words[j] = $, O = F, F = R;
|
|
3573
3573
|
}
|
|
3574
|
-
return
|
|
3574
|
+
return O !== 0 ? x.words[j] = O : x.length--, x.strip();
|
|
3575
3575
|
}(this, d, h) : S(this, d, h), y;
|
|
3576
3576
|
}, E.prototype.makeRBT = function(d) {
|
|
3577
3577
|
for (var h = new Array(d), y = i.prototype._countBits(d) - 1, m = 0; m < d; m++) h[m] = this.revBin(m, y, d);
|
|
@@ -3584,9 +3584,9 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3584
3584
|
for (var x = 0; x < g; x++) m[x] = h[d[x]], l[x] = y[d[x]];
|
|
3585
3585
|
}, E.prototype.transform = function(d, h, y, m, l, g) {
|
|
3586
3586
|
this.permute(g, d, h, y, m, l);
|
|
3587
|
-
for (var x = 1; x < l; x <<= 1) for (var
|
|
3588
|
-
var U = y[F + D], G = m[F + D],
|
|
3589
|
-
dt = $ * dt + V *
|
|
3587
|
+
for (var x = 1; x < l; x <<= 1) for (var O = x << 1, R = Math.cos(2 * Math.PI / O), j = Math.sin(2 * Math.PI / O), F = 0; F < l; F += O) for (var $ = R, V = j, D = 0; D < x; D++) {
|
|
3588
|
+
var U = y[F + D], G = m[F + D], Nt = y[F + D + x], dt = m[F + D + x], gt = $ * Nt - V * dt;
|
|
3589
|
+
dt = $ * dt + V * Nt, Nt = gt, y[F + D] = U + Nt, m[F + D] = G + dt, y[F + D + x] = U - Nt, m[F + D + x] = G - dt, D !== O && (gt = R * $ - j * V, V = R * V + j * $, $ = gt);
|
|
3590
3590
|
}
|
|
3591
3591
|
}, E.prototype.guessLen13b = function(d, h) {
|
|
3592
3592
|
var y = 1 | Math.max(h, d), m = 1 & y, l = 0;
|
|
@@ -3611,13 +3611,13 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3611
3611
|
for (var h = new Array(d), y = 0; y < d; y++) h[y] = 0;
|
|
3612
3612
|
return h;
|
|
3613
3613
|
}, E.prototype.mulp = function(d, h, y) {
|
|
3614
|
-
var m = 2 * this.guessLen13b(d.length, h.length), l = this.makeRBT(m), g = this.stub(m), x = new Array(m),
|
|
3615
|
-
V.length = m, this.convert13b(d.words, d.length, x, m), this.convert13b(h.words, h.length, j, m), this.transform(x, g,
|
|
3614
|
+
var m = 2 * this.guessLen13b(d.length, h.length), l = this.makeRBT(m), g = this.stub(m), x = new Array(m), O = new Array(m), R = new Array(m), j = new Array(m), F = new Array(m), $ = new Array(m), V = y.words;
|
|
3615
|
+
V.length = m, this.convert13b(d.words, d.length, x, m), this.convert13b(h.words, h.length, j, m), this.transform(x, g, O, R, m, l), this.transform(j, g, F, $, m, l);
|
|
3616
3616
|
for (var D = 0; D < m; D++) {
|
|
3617
|
-
var U =
|
|
3618
|
-
R[D] =
|
|
3617
|
+
var U = O[D] * F[D] - R[D] * $[D];
|
|
3618
|
+
R[D] = O[D] * $[D] + R[D] * F[D], O[D] = U;
|
|
3619
3619
|
}
|
|
3620
|
-
return this.conjugate(
|
|
3620
|
+
return this.conjugate(O, R, m), this.transform(O, R, V, g, m, l), this.conjugate(V, g, m), this.normalize13b(V, m), y.negative = d.negative ^ h.negative, y.length = d.length + h.length, y.strip();
|
|
3621
3621
|
}, i.prototype.mul = function(d) {
|
|
3622
3622
|
var h = new i(null);
|
|
3623
3623
|
return h.words = new Array(this.length + d.length), this.mulTo(d, h);
|
|
@@ -3641,9 +3641,9 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3641
3641
|
return this.imul(this.clone());
|
|
3642
3642
|
}, i.prototype.pow = function(d) {
|
|
3643
3643
|
var h = function(g) {
|
|
3644
|
-
for (var x = new Array(g.bitLength()),
|
|
3645
|
-
var R =
|
|
3646
|
-
x[
|
|
3644
|
+
for (var x = new Array(g.bitLength()), O = 0; O < x.length; O++) {
|
|
3645
|
+
var R = O / 26 | 0, j = O % 26;
|
|
3646
|
+
x[O] = (g.words[R] & 1 << j) >>> j;
|
|
3647
3647
|
}
|
|
3648
3648
|
return x;
|
|
3649
3649
|
}(d);
|
|
@@ -3657,8 +3657,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3657
3657
|
if (y !== 0) {
|
|
3658
3658
|
var g = 0;
|
|
3659
3659
|
for (h = 0; h < this.length; h++) {
|
|
3660
|
-
var x = this.words[h] & l,
|
|
3661
|
-
this.words[h] =
|
|
3660
|
+
var x = this.words[h] & l, O = (0 | this.words[h]) - x << y;
|
|
3661
|
+
this.words[h] = O | g, g = x >>> 26 - y;
|
|
3662
3662
|
}
|
|
3663
3663
|
g && (this.words[h] = g, this.length++);
|
|
3664
3664
|
}
|
|
@@ -3673,10 +3673,10 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3673
3673
|
}, i.prototype.iushrn = function(d, h, y) {
|
|
3674
3674
|
var m;
|
|
3675
3675
|
r(typeof d == "number" && d >= 0), m = h ? (h - h % 26) / 26 : 0;
|
|
3676
|
-
var l = d % 26, g = Math.min((d - l) / 26, this.length), x = 67108863 ^ 67108863 >>> l << l,
|
|
3677
|
-
if (m -= g, m = Math.max(0, m),
|
|
3678
|
-
for (var R = 0; R < g; R++)
|
|
3679
|
-
|
|
3676
|
+
var l = d % 26, g = Math.min((d - l) / 26, this.length), x = 67108863 ^ 67108863 >>> l << l, O = y;
|
|
3677
|
+
if (m -= g, m = Math.max(0, m), O) {
|
|
3678
|
+
for (var R = 0; R < g; R++) O.words[R] = this.words[R];
|
|
3679
|
+
O.length = g;
|
|
3680
3680
|
}
|
|
3681
3681
|
if (g !== 0) if (this.length > g) for (this.length -= g, R = 0; R < this.length; R++) this.words[R] = this.words[R + g];
|
|
3682
3682
|
else this.words[0] = 0, this.length = 1;
|
|
@@ -3685,7 +3685,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3685
3685
|
var F = 0 | this.words[R];
|
|
3686
3686
|
this.words[R] = j << 26 - l | F >>> l, j = F & x;
|
|
3687
3687
|
}
|
|
3688
|
-
return
|
|
3688
|
+
return O && j !== 0 && (O.words[O.length++] = j), this.length === 0 && (this.words[0] = 0, this.length = 1), this.strip();
|
|
3689
3689
|
}, i.prototype.ishrn = function(d, h, y) {
|
|
3690
3690
|
return r(this.negative === 0), this.iushrn(d, h, y);
|
|
3691
3691
|
}, i.prototype.shln = function(d) {
|
|
@@ -3737,8 +3737,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3737
3737
|
var x = 0;
|
|
3738
3738
|
for (m = 0; m < d.length; m++) {
|
|
3739
3739
|
l = (0 | this.words[m + y]) + x;
|
|
3740
|
-
var
|
|
3741
|
-
x = ((l -= 67108863 &
|
|
3740
|
+
var O = (0 | d.words[m]) * h;
|
|
3741
|
+
x = ((l -= 67108863 & O) >> 26) - (O / 67108864 | 0), this.words[m + y] = 67108863 & l;
|
|
3742
3742
|
}
|
|
3743
3743
|
for (; m < this.length - y; m++) x = (l = (0 | this.words[m + y]) + x) >> 26, this.words[m + y] = 67108863 & l;
|
|
3744
3744
|
if (x === 0) return this.strip();
|
|
@@ -3747,14 +3747,14 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3747
3747
|
}, i.prototype._wordDiv = function(d, h) {
|
|
3748
3748
|
var y = (this.length, d.length), m = this.clone(), l = d, g = 0 | l.words[l.length - 1];
|
|
3749
3749
|
(y = 26 - this._countBits(g)) != 0 && (l = l.ushln(y), m.iushln(y), g = 0 | l.words[l.length - 1]);
|
|
3750
|
-
var x,
|
|
3750
|
+
var x, O = m.length - l.length;
|
|
3751
3751
|
if (h !== "mod") {
|
|
3752
|
-
(x = new i(null)).length =
|
|
3752
|
+
(x = new i(null)).length = O + 1, x.words = new Array(x.length);
|
|
3753
3753
|
for (var R = 0; R < x.length; R++) x.words[R] = 0;
|
|
3754
3754
|
}
|
|
3755
|
-
var j = m.clone()._ishlnsubmul(l, 1,
|
|
3756
|
-
j.negative === 0 && (m = j, x && (x.words[
|
|
3757
|
-
for (var F =
|
|
3755
|
+
var j = m.clone()._ishlnsubmul(l, 1, O);
|
|
3756
|
+
j.negative === 0 && (m = j, x && (x.words[O] = 1));
|
|
3757
|
+
for (var F = O - 1; F >= 0; F--) {
|
|
3758
3758
|
var $ = 67108864 * (0 | m.words[l.length + F]) + (0 | m.words[l.length + F - 1]);
|
|
3759
3759
|
for ($ = Math.min($ / g | 0, 67108863), m._ishlnsubmul(l, $, F); m.negative !== 0; ) $--, m.negative = 0, m._ishlnsubmul(l, 1, F), m.isZero() || (m.negative ^= 1);
|
|
3760
3760
|
x && (x.words[F] = $);
|
|
@@ -3791,7 +3791,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3791
3791
|
r(d.negative === 0), r(!d.isZero());
|
|
3792
3792
|
var h = this, y = d.clone();
|
|
3793
3793
|
h = h.negative !== 0 ? h.umod(d) : h.clone();
|
|
3794
|
-
for (var m = new i(1), l = new i(0), g = new i(0), x = new i(1),
|
|
3794
|
+
for (var m = new i(1), l = new i(0), g = new i(0), x = new i(1), O = 0; h.isEven() && y.isEven(); ) h.iushrn(1), y.iushrn(1), ++O;
|
|
3795
3795
|
for (var R = y.clone(), j = h.clone(); !h.isZero(); ) {
|
|
3796
3796
|
for (var F = 0, $ = 1; !(h.words[0] & $) && F < 26; ++F, $ <<= 1) ;
|
|
3797
3797
|
if (F > 0) for (h.iushrn(F); F-- > 0; ) (m.isOdd() || l.isOdd()) && (m.iadd(R), l.isub(j)), m.iushrn(1), l.iushrn(1);
|
|
@@ -3799,14 +3799,14 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3799
3799
|
if (V > 0) for (y.iushrn(V); V-- > 0; ) (g.isOdd() || x.isOdd()) && (g.iadd(R), x.isub(j)), g.iushrn(1), x.iushrn(1);
|
|
3800
3800
|
h.cmp(y) >= 0 ? (h.isub(y), m.isub(g), l.isub(x)) : (y.isub(h), g.isub(m), x.isub(l));
|
|
3801
3801
|
}
|
|
3802
|
-
return { a: g, b: x, gcd: y.iushln(
|
|
3802
|
+
return { a: g, b: x, gcd: y.iushln(O) };
|
|
3803
3803
|
}, i.prototype._invmp = function(d) {
|
|
3804
3804
|
r(d.negative === 0), r(!d.isZero());
|
|
3805
3805
|
var h = this, y = d.clone();
|
|
3806
3806
|
h = h.negative !== 0 ? h.umod(d) : h.clone();
|
|
3807
3807
|
for (var m, l = new i(1), g = new i(0), x = y.clone(); h.cmpn(1) > 0 && y.cmpn(1) > 0; ) {
|
|
3808
|
-
for (var
|
|
3809
|
-
if (
|
|
3808
|
+
for (var O = 0, R = 1; !(h.words[0] & R) && O < 26; ++O, R <<= 1) ;
|
|
3809
|
+
if (O > 0) for (h.iushrn(O); O-- > 0; ) l.isOdd() && l.iadd(x), l.iushrn(1);
|
|
3810
3810
|
for (var j = 0, F = 1; !(y.words[0] & F) && j < 26; ++j, F <<= 1) ;
|
|
3811
3811
|
if (j > 0) for (y.iushrn(j); j-- > 0; ) g.isOdd() && g.iadd(x), g.iushrn(1);
|
|
3812
3812
|
h.cmp(y) >= 0 ? (h.isub(y), l.isub(g)) : (y.isub(h), g.isub(l));
|
|
@@ -3945,7 +3945,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3945
3945
|
function I() {
|
|
3946
3946
|
k.call(this, "p192", "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff");
|
|
3947
3947
|
}
|
|
3948
|
-
function
|
|
3948
|
+
function N() {
|
|
3949
3949
|
k.call(this, "25519", "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed");
|
|
3950
3950
|
}
|
|
3951
3951
|
function z(d) {
|
|
@@ -3987,7 +3987,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
3987
3987
|
h += 977 * m, d.words[y] = 67108863 & h, h = 64 * m + (h / 67108864 | 0);
|
|
3988
3988
|
}
|
|
3989
3989
|
return d.words[d.length - 1] === 0 && (d.length--, d.words[d.length - 1] === 0 && d.length--), d;
|
|
3990
|
-
}, n(P, k), n(I, k), n(
|
|
3990
|
+
}, n(P, k), n(I, k), n(N, k), N.prototype.imulK = function(d) {
|
|
3991
3991
|
for (var h = 0, y = 0; y < d.length; y++) {
|
|
3992
3992
|
var m = 19 * (0 | d.words[y]) + h, l = 67108863 & m;
|
|
3993
3993
|
m >>>= 26, d.words[y] = l, h = m;
|
|
@@ -4001,7 +4001,7 @@ var nr = {}, Nf = { exports: {} };
|
|
|
4001
4001
|
else if (d === "p192") h = new I();
|
|
4002
4002
|
else {
|
|
4003
4003
|
if (d !== "p25519") throw new Error("Unknown prime " + d);
|
|
4004
|
-
h = new
|
|
4004
|
+
h = new N();
|
|
4005
4005
|
}
|
|
4006
4006
|
return _[d] = h, h;
|
|
4007
4007
|
}, z.prototype._verify1 = function(d) {
|
|
@@ -4047,8 +4047,8 @@ var nr = {}, Nf = { exports: {} };
|
|
|
4047
4047
|
}
|
|
4048
4048
|
for (var m = this.m.subn(1), l = 0; !m.isZero() && m.andln(1) === 0; ) l++, m.iushrn(1);
|
|
4049
4049
|
r(!m.isZero());
|
|
4050
|
-
var g = new i(1).toRed(this), x = g.redNeg(),
|
|
4051
|
-
for (R = new i(2 * R * R).toRed(this); this.pow(R,
|
|
4050
|
+
var g = new i(1).toRed(this), x = g.redNeg(), O = this.m.subn(1).iushrn(1), R = this.m.bitLength();
|
|
4051
|
+
for (R = new i(2 * R * R).toRed(this); this.pow(R, O).cmp(x) !== 0; ) R.redIAdd(x);
|
|
4052
4052
|
for (var j = this.pow(R, m), F = this.pow(d, m.addn(1).iushrn(1)), $ = this.pow(d, m), V = l; $.cmp(g) !== 0; ) {
|
|
4053
4053
|
for (var D = $, U = 0; D.cmp(g) !== 0; U++) D = D.redSqr();
|
|
4054
4054
|
r(U < V);
|
|
@@ -4065,13 +4065,13 @@ var nr = {}, Nf = { exports: {} };
|
|
|
4065
4065
|
var y = new Array(16);
|
|
4066
4066
|
y[0] = new i(1).toRed(this), y[1] = d;
|
|
4067
4067
|
for (var m = 2; m < y.length; m++) y[m] = this.mul(y[m - 1], d);
|
|
4068
|
-
var l = y[0], g = 0, x = 0,
|
|
4069
|
-
for (
|
|
4070
|
-
for (var R = h.words[m], j =
|
|
4068
|
+
var l = y[0], g = 0, x = 0, O = h.bitLength() % 26;
|
|
4069
|
+
for (O === 0 && (O = 26), m = h.length - 1; m >= 0; m--) {
|
|
4070
|
+
for (var R = h.words[m], j = O - 1; j >= 0; j--) {
|
|
4071
4071
|
var F = R >> j & 1;
|
|
4072
4072
|
l !== y[0] && (l = this.sqr(l)), F !== 0 || g !== 0 ? (g <<= 1, g |= F, (++x === 4 || m === 0 && j === 0) && (l = this.mul(l, y[g]), x = 0, g = 0)) : x = 0;
|
|
4073
4073
|
}
|
|
4074
|
-
|
|
4074
|
+
O = 26;
|
|
4075
4075
|
}
|
|
4076
4076
|
return l;
|
|
4077
4077
|
}, z.prototype.convertTo = function(d) {
|
|
@@ -4098,12 +4098,12 @@ var nr = {}, Nf = { exports: {} };
|
|
|
4098
4098
|
}, B.prototype.invm = function(d) {
|
|
4099
4099
|
return this.imod(d._invmp(this.m).mul(this.r2))._forceRed(this);
|
|
4100
4100
|
};
|
|
4101
|
-
})(
|
|
4102
|
-
var Wr =
|
|
4103
|
-
function
|
|
4101
|
+
})(Of, Zr);
|
|
4102
|
+
var Wr = Of.exports, Bn = Cf;
|
|
4103
|
+
function Cf(e, t) {
|
|
4104
4104
|
if (!e) throw new Error(t || "Assertion failed");
|
|
4105
4105
|
}
|
|
4106
|
-
|
|
4106
|
+
Cf.equal = function(e, t, r) {
|
|
4107
4107
|
if (e != t) throw new Error(r || "Assertion failed: " + e + " != " + t);
|
|
4108
4108
|
};
|
|
4109
4109
|
var Jo = {};
|
|
@@ -4250,17 +4250,17 @@ tn.prototype.point = function() {
|
|
|
4250
4250
|
}
|
|
4251
4251
|
} else u[v] = os(r[v], c[v], this._bitLength), u[S] = os(r[S], c[S], this._bitLength), p = Math.max(u[v].length, p), p = Math.max(u[S].length, p);
|
|
4252
4252
|
}
|
|
4253
|
-
var I = this.jpoint(null, null, null),
|
|
4253
|
+
var I = this.jpoint(null, null, null), N = this._wnafT4;
|
|
4254
4254
|
for (s = p; s >= 0; s--) {
|
|
4255
4255
|
for (var z = 0; s >= 0; ) {
|
|
4256
4256
|
var B = !0;
|
|
4257
|
-
for (a = 0; a < n; a++)
|
|
4257
|
+
for (a = 0; a < n; a++) N[a] = 0 | u[a][s], N[a] !== 0 && (B = !1);
|
|
4258
4258
|
if (!B) break;
|
|
4259
4259
|
z++, s--;
|
|
4260
4260
|
}
|
|
4261
4261
|
if (s >= 0 && z++, I = I.dblp(z), s < 0) break;
|
|
4262
4262
|
for (a = 0; a < n; a++) {
|
|
4263
|
-
var d =
|
|
4263
|
+
var d = N[a];
|
|
4264
4264
|
d !== 0 && (d > 0 ? o = f[a][d - 1 >> 1] : d < 0 && (o = f[a][-d - 1 >> 1].neg()), I = o.type === "affine" ? I.mixedAdd(o) : I.add(o));
|
|
4265
4265
|
}
|
|
4266
4266
|
}
|
|
@@ -4319,40 +4319,40 @@ typeof Object.create == "function" ? Xo.exports = function(e, t) {
|
|
|
4319
4319
|
r.prototype = t.prototype, e.prototype = new r(), e.prototype.constructor = e;
|
|
4320
4320
|
}
|
|
4321
4321
|
};
|
|
4322
|
-
var Zs = Xo.exports,
|
|
4322
|
+
var Zs = Xo.exports, _e = Wr, ta = Zs, ei = Fs, Ju = nr.assert;
|
|
4323
4323
|
function cr(e) {
|
|
4324
|
-
ei.call(this, "short", e), this.a = new
|
|
4324
|
+
ei.call(this, "short", e), this.a = new _e(e.a, 16).toRed(this.red), this.b = new _e(e.b, 16).toRed(this.red), this.tinv = this.two.redInvm(), this.zeroA = this.a.fromRed().cmpn(0) === 0, this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0, this.endo = this._getEndomorphism(e), this._endoWnafT1 = new Array(4), this._endoWnafT2 = new Array(4);
|
|
4325
4325
|
}
|
|
4326
4326
|
ta(cr, ei);
|
|
4327
4327
|
var Gu = cr;
|
|
4328
4328
|
function Re(e, t, r, n) {
|
|
4329
|
-
ei.BasePoint.call(this, e, "affine"), t === null && r === null ? (this.x = null, this.y = null, this.inf = !0) : (this.x = new
|
|
4329
|
+
ei.BasePoint.call(this, e, "affine"), t === null && r === null ? (this.x = null, this.y = null, this.inf = !0) : (this.x = new _e(t, 16), this.y = new _e(r, 16), n && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.y.red || (this.y = this.y.toRed(this.curve.red)), this.inf = !1);
|
|
4330
4330
|
}
|
|
4331
4331
|
function qe(e, t, r, n) {
|
|
4332
|
-
ei.BasePoint.call(this, e, "jacobian"), t === null && r === null && n === null ? (this.x = this.curve.one, this.y = this.curve.one, this.z = new
|
|
4332
|
+
ei.BasePoint.call(this, e, "jacobian"), t === null && r === null && n === null ? (this.x = this.curve.one, this.y = this.curve.one, this.z = new _e(0)) : (this.x = new _e(t, 16), this.y = new _e(r, 16), this.z = new _e(n, 16)), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.y.red || (this.y = this.y.toRed(this.curve.red)), this.z.red || (this.z = this.z.toRed(this.curve.red)), this.zOne = this.z === this.curve.one;
|
|
4333
4333
|
}
|
|
4334
4334
|
cr.prototype._getEndomorphism = function(e) {
|
|
4335
4335
|
if (this.zeroA && this.g && this.n && this.p.modn(3) === 1) {
|
|
4336
4336
|
var t, r;
|
|
4337
|
-
if (e.beta) t = new
|
|
4337
|
+
if (e.beta) t = new _e(e.beta, 16).toRed(this.red);
|
|
4338
4338
|
else {
|
|
4339
4339
|
var n = this._getEndoRoots(this.p);
|
|
4340
4340
|
t = (t = n[0].cmp(n[1]) < 0 ? n[0] : n[1]).toRed(this.red);
|
|
4341
4341
|
}
|
|
4342
|
-
if (e.lambda) r = new
|
|
4342
|
+
if (e.lambda) r = new _e(e.lambda, 16);
|
|
4343
4343
|
else {
|
|
4344
4344
|
var i = this._getEndoRoots(this.n);
|
|
4345
4345
|
this.g.mul(i[0]).x.cmp(this.g.x.redMul(t)) === 0 ? r = i[0] : (r = i[1], Ju(this.g.mul(r).x.cmp(this.g.x.redMul(t)) === 0));
|
|
4346
4346
|
}
|
|
4347
4347
|
return { beta: t, lambda: r, basis: e.basis ? e.basis.map(function(s) {
|
|
4348
|
-
return { a: new
|
|
4348
|
+
return { a: new _e(s.a, 16), b: new _e(s.b, 16) };
|
|
4349
4349
|
}) : this._getEndoBasis(r) };
|
|
4350
4350
|
}
|
|
4351
4351
|
}, cr.prototype._getEndoRoots = function(e) {
|
|
4352
|
-
var t = e === this.p ? this.red :
|
|
4352
|
+
var t = e === this.p ? this.red : _e.mont(e), r = new _e(2).toRed(t).redInvm(), n = r.redNeg(), i = new _e(3).toRed(t).redNeg().redSqrt().redMul(r);
|
|
4353
4353
|
return [n.redAdd(i).fromRed(), n.redSub(i).fromRed()];
|
|
4354
4354
|
}, cr.prototype._getEndoBasis = function(e) {
|
|
4355
|
-
for (var t, r, n, i, s, a, o, c, f, u = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), p = e, w = this.n.clone(), v = new
|
|
4355
|
+
for (var t, r, n, i, s, a, o, c, f, u = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), p = e, w = this.n.clone(), v = new _e(1), S = new _e(0), E = new _e(0), _ = new _e(1), k = 0; p.cmpn(0) !== 0; ) {
|
|
4356
4356
|
var A = w.div(p);
|
|
4357
4357
|
c = w.sub(A.mul(p)), f = E.sub(A.mul(v));
|
|
4358
4358
|
var P = _.sub(A.mul(S));
|
|
@@ -4367,7 +4367,7 @@ cr.prototype._getEndomorphism = function(e) {
|
|
|
4367
4367
|
var t = this.endo.basis, r = t[0], n = t[1], i = n.b.mul(e).divRound(this.n), s = r.b.neg().mul(e).divRound(this.n), a = i.mul(r.a), o = s.mul(n.a), c = i.mul(r.b), f = s.mul(n.b);
|
|
4368
4368
|
return { k1: e.sub(a).sub(o), k2: c.add(f).neg() };
|
|
4369
4369
|
}, cr.prototype.pointFromX = function(e, t) {
|
|
4370
|
-
(e = new
|
|
4370
|
+
(e = new _e(e, 16)).red || (e = e.toRed(this.red));
|
|
4371
4371
|
var r = e.redSqr().redMul(e).redIAdd(e.redMul(this.a)).redIAdd(this.b), n = r.redSqrt();
|
|
4372
4372
|
if (n.redSqr().redSub(r).cmp(this.zero) !== 0) throw new Error("invalid point");
|
|
4373
4373
|
var i = n.fromRed().isOdd();
|
|
@@ -4436,7 +4436,7 @@ cr.prototype._getEndomorphism = function(e) {
|
|
|
4436
4436
|
}, Re.prototype.getY = function() {
|
|
4437
4437
|
return this.y.fromRed();
|
|
4438
4438
|
}, Re.prototype.mul = function(e) {
|
|
4439
|
-
return e = new
|
|
4439
|
+
return e = new _e(e, 16), this.isInfinity() ? this : this._hasDoubles(e) ? this.curve._fixedNafMul(this, e) : this.curve.endo ? this.curve._endoWnafMulAdd([this], [e]) : this.curve._wnafMul(this, e);
|
|
4440
4440
|
}, Re.prototype.mulAdd = function(e, t, r) {
|
|
4441
4441
|
var n = [this, t], i = [e, r];
|
|
4442
4442
|
return this.curve.endo ? this.curve._endoWnafMulAdd(n, i) : this.curve._wnafMulAdd(1, n, i, 2);
|
|
@@ -4549,7 +4549,7 @@ cr.prototype._getEndomorphism = function(e) {
|
|
|
4549
4549
|
var v = this.z.redAdd(a).redSqr().redISub(r).redISub(o);
|
|
4550
4550
|
return this.curve.jpoint(p, w, v);
|
|
4551
4551
|
}, qe.prototype.mul = function(e, t) {
|
|
4552
|
-
return e = new
|
|
4552
|
+
return e = new _e(e, t), this.curve._wnafMul(this, e);
|
|
4553
4553
|
}, qe.prototype.eq = function(e) {
|
|
4554
4554
|
if (e.type === "affine") return this.eq(e.toJ());
|
|
4555
4555
|
if (this === e) return !0;
|
|
@@ -4575,48 +4575,48 @@ function Zn(e) {
|
|
|
4575
4575
|
}
|
|
4576
4576
|
Pf(Zn, Vs);
|
|
4577
4577
|
var th = Zn;
|
|
4578
|
-
function
|
|
4578
|
+
function Ne(e, t, r) {
|
|
4579
4579
|
Vs.BasePoint.call(this, e, "projective"), t === null && r === null ? (this.x = this.curve.one, this.z = this.curve.zero) : (this.x = new Fn(t, 16), this.z = new Fn(r, 16), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.z.red || (this.z = this.z.toRed(this.curve.red)));
|
|
4580
4580
|
}
|
|
4581
4581
|
Zn.prototype.validate = function(e) {
|
|
4582
4582
|
var t = e.normalize().x, r = t.redSqr(), n = r.redMul(t).redAdd(r.redMul(this.a)).redAdd(t);
|
|
4583
4583
|
return n.redSqrt().redSqr().cmp(n) === 0;
|
|
4584
|
-
}, Pf(
|
|
4584
|
+
}, Pf(Ne, Vs.BasePoint), Zn.prototype.decodePoint = function(e, t) {
|
|
4585
4585
|
return this.point(Xu.toArray(e, t), 1);
|
|
4586
4586
|
}, Zn.prototype.point = function(e, t) {
|
|
4587
|
-
return new
|
|
4587
|
+
return new Ne(this, e, t);
|
|
4588
4588
|
}, Zn.prototype.pointFromJSON = function(e) {
|
|
4589
|
-
return
|
|
4590
|
-
},
|
|
4591
|
-
},
|
|
4589
|
+
return Ne.fromJSON(this, e);
|
|
4590
|
+
}, Ne.prototype.precompute = function() {
|
|
4591
|
+
}, Ne.prototype._encode = function() {
|
|
4592
4592
|
return this.getX().toArray("be", this.curve.p.byteLength());
|
|
4593
|
-
},
|
|
4594
|
-
return new
|
|
4595
|
-
},
|
|
4593
|
+
}, Ne.fromJSON = function(e, t) {
|
|
4594
|
+
return new Ne(e, t[0], t[1] || e.one);
|
|
4595
|
+
}, Ne.prototype.inspect = function() {
|
|
4596
4596
|
return this.isInfinity() ? "<EC Point Infinity>" : "<EC Point x: " + this.x.fromRed().toString(16, 2) + " z: " + this.z.fromRed().toString(16, 2) + ">";
|
|
4597
|
-
},
|
|
4597
|
+
}, Ne.prototype.isInfinity = function() {
|
|
4598
4598
|
return this.z.cmpn(0) === 0;
|
|
4599
|
-
},
|
|
4599
|
+
}, Ne.prototype.dbl = function() {
|
|
4600
4600
|
var e = this.x.redAdd(this.z).redSqr(), t = this.x.redSub(this.z).redSqr(), r = e.redSub(t), n = e.redMul(t), i = r.redMul(t.redAdd(this.curve.a24.redMul(r)));
|
|
4601
4601
|
return this.curve.point(n, i);
|
|
4602
|
-
},
|
|
4602
|
+
}, Ne.prototype.add = function() {
|
|
4603
4603
|
throw new Error("Not supported on Montgomery curve");
|
|
4604
|
-
},
|
|
4604
|
+
}, Ne.prototype.diffAdd = function(e, t) {
|
|
4605
4605
|
var r = this.x.redAdd(this.z), n = this.x.redSub(this.z), i = e.x.redAdd(e.z), s = e.x.redSub(e.z).redMul(r), a = i.redMul(n), o = t.z.redMul(s.redAdd(a).redSqr()), c = t.x.redMul(s.redISub(a).redSqr());
|
|
4606
4606
|
return this.curve.point(o, c);
|
|
4607
|
-
},
|
|
4607
|
+
}, Ne.prototype.mul = function(e) {
|
|
4608
4608
|
for (var t = e.clone(), r = this, n = this.curve.point(null, null), i = []; t.cmpn(0) !== 0; t.iushrn(1)) i.push(t.andln(1));
|
|
4609
4609
|
for (var s = i.length - 1; s >= 0; s--) i[s] === 0 ? (r = r.diffAdd(n, this), n = n.dbl()) : (n = r.diffAdd(n, this), r = r.dbl());
|
|
4610
4610
|
return n;
|
|
4611
|
-
},
|
|
4611
|
+
}, Ne.prototype.mulAdd = function() {
|
|
4612
4612
|
throw new Error("Not supported on Montgomery curve");
|
|
4613
|
-
},
|
|
4613
|
+
}, Ne.prototype.jumlAdd = function() {
|
|
4614
4614
|
throw new Error("Not supported on Montgomery curve");
|
|
4615
|
-
},
|
|
4615
|
+
}, Ne.prototype.eq = function(e) {
|
|
4616
4616
|
return this.getX().cmp(e.getX()) === 0;
|
|
4617
|
-
},
|
|
4617
|
+
}, Ne.prototype.normalize = function() {
|
|
4618
4618
|
return this.x = this.x.redMul(this.z.redInvm()), this.z = this.curve.one, this;
|
|
4619
|
-
},
|
|
4619
|
+
}, Ne.prototype.getX = function() {
|
|
4620
4620
|
return this.normalize(), this.x.fromRed();
|
|
4621
4621
|
};
|
|
4622
4622
|
var Vr = Wr, Lf = Zs, Ks = Fs, eh = nr.assert;
|
|
@@ -4894,18 +4894,18 @@ var Ah = Hr;
|
|
|
4894
4894
|
Hr.blockSize = 512, Hr.outSize = 224, Hr.hmacStrength = 192, Hr.padLength = 64, Hr.prototype._digest = function(e) {
|
|
4895
4895
|
return e === "hex" ? ea.toHex32(this.h.slice(0, 7), "big") : ea.split32(this.h.slice(0, 7), "big");
|
|
4896
4896
|
};
|
|
4897
|
-
var er = Wt, kh = fi, Mh = Bn,
|
|
4897
|
+
var er = Wt, kh = fi, Mh = Bn, Or = er.rotr64_hi, Cr = er.rotr64_lo, Uf = er.shr64_hi, Hf = er.shr64_lo, Jr = er.sum64, po = er.sum64_hi, mo = er.sum64_lo, Eh = er.sum64_4_hi, Ih = er.sum64_4_lo, Th = er.sum64_5_hi, Rh = er.sum64_5_lo, Df = kh.BlockHash, Nh = [1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163, 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394, 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206, 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139, 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692, 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879, 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895, 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823, 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921, 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344, 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616, 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403, 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452, 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573, 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271, 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315, 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470, 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591];
|
|
4898
4898
|
function yr() {
|
|
4899
4899
|
if (!(this instanceof yr)) return new yr();
|
|
4900
|
-
Df.call(this), this.h = [1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119, 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209], this.k =
|
|
4900
|
+
Df.call(this), this.h = [1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119, 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209], this.k = Nh, this.W = new Array(160);
|
|
4901
4901
|
}
|
|
4902
4902
|
er.inherits(yr, Df);
|
|
4903
4903
|
var Ff = yr;
|
|
4904
|
-
function
|
|
4904
|
+
function Oh(e, t, r, n, i) {
|
|
4905
4905
|
var s = e & r ^ ~e & i;
|
|
4906
4906
|
return s < 0 && (s += 4294967296), s;
|
|
4907
4907
|
}
|
|
4908
|
-
function
|
|
4908
|
+
function Ch(e, t, r, n, i, s) {
|
|
4909
4909
|
var a = t & n ^ ~t & s;
|
|
4910
4910
|
return a < 0 && (a += 4294967296), a;
|
|
4911
4911
|
}
|
|
@@ -4918,35 +4918,35 @@ function Ph(e, t, r, n, i, s) {
|
|
|
4918
4918
|
return a < 0 && (a += 4294967296), a;
|
|
4919
4919
|
}
|
|
4920
4920
|
function Lh(e, t) {
|
|
4921
|
-
var r =
|
|
4921
|
+
var r = Or(e, t, 28) ^ Or(t, e, 2) ^ Or(t, e, 7);
|
|
4922
4922
|
return r < 0 && (r += 4294967296), r;
|
|
4923
4923
|
}
|
|
4924
4924
|
function zh(e, t) {
|
|
4925
|
-
var r =
|
|
4925
|
+
var r = Cr(e, t, 28) ^ Cr(t, e, 2) ^ Cr(t, e, 7);
|
|
4926
4926
|
return r < 0 && (r += 4294967296), r;
|
|
4927
4927
|
}
|
|
4928
4928
|
function jh(e, t) {
|
|
4929
|
-
var r =
|
|
4929
|
+
var r = Or(e, t, 14) ^ Or(e, t, 18) ^ Or(t, e, 9);
|
|
4930
4930
|
return r < 0 && (r += 4294967296), r;
|
|
4931
4931
|
}
|
|
4932
4932
|
function $h(e, t) {
|
|
4933
|
-
var r =
|
|
4933
|
+
var r = Cr(e, t, 14) ^ Cr(e, t, 18) ^ Cr(t, e, 9);
|
|
4934
4934
|
return r < 0 && (r += 4294967296), r;
|
|
4935
4935
|
}
|
|
4936
4936
|
function qh(e, t) {
|
|
4937
|
-
var r =
|
|
4937
|
+
var r = Or(e, t, 1) ^ Or(e, t, 8) ^ Uf(e, t, 7);
|
|
4938
4938
|
return r < 0 && (r += 4294967296), r;
|
|
4939
4939
|
}
|
|
4940
4940
|
function Uh(e, t) {
|
|
4941
|
-
var r =
|
|
4941
|
+
var r = Cr(e, t, 1) ^ Cr(e, t, 8) ^ Hf(e, t, 7);
|
|
4942
4942
|
return r < 0 && (r += 4294967296), r;
|
|
4943
4943
|
}
|
|
4944
4944
|
function Hh(e, t) {
|
|
4945
|
-
var r =
|
|
4945
|
+
var r = Or(e, t, 19) ^ Or(t, e, 29) ^ Uf(e, t, 6);
|
|
4946
4946
|
return r < 0 && (r += 4294967296), r;
|
|
4947
4947
|
}
|
|
4948
4948
|
function Dh(e, t) {
|
|
4949
|
-
var r =
|
|
4949
|
+
var r = Cr(e, t, 19) ^ Cr(t, e, 29) ^ Hf(e, t, 6);
|
|
4950
4950
|
return r < 0 && (r += 4294967296), r;
|
|
4951
4951
|
}
|
|
4952
4952
|
yr.blockSize = 1024, yr.outSize = 512, yr.hmacStrength = 192, yr.padLength = 128, yr.prototype._prepareBlock = function(e, t) {
|
|
@@ -4960,10 +4960,10 @@ yr.blockSize = 1024, yr.outSize = 512, yr.hmacStrength = 192, yr.padLength = 128
|
|
|
4960
4960
|
var r = this.W, n = this.h[0], i = this.h[1], s = this.h[2], a = this.h[3], o = this.h[4], c = this.h[5], f = this.h[6], u = this.h[7], p = this.h[8], w = this.h[9], v = this.h[10], S = this.h[11], E = this.h[12], _ = this.h[13], k = this.h[14], A = this.h[15];
|
|
4961
4961
|
Mh(this.k.length === r.length);
|
|
4962
4962
|
for (var P = 0; P < r.length; P += 2) {
|
|
4963
|
-
var I = k,
|
|
4964
|
-
I = Lh(n, i),
|
|
4965
|
-
var R = po(I,
|
|
4966
|
-
k = E, A = _, E = v, _ = S, v = p, S = w, p = po(f, u, x,
|
|
4963
|
+
var I = k, N = A, z = jh(p, w), B = $h(p, w), d = Oh(p, w, v, S, E), h = Ch(p, w, v, S, E, _), y = this.k[P], m = this.k[P + 1], l = r[P], g = r[P + 1], x = Th(I, N, z, B, d, h, y, m, l, g), O = Rh(I, N, z, B, d, h, y, m, l, g);
|
|
4964
|
+
I = Lh(n, i), N = zh(n, i), z = Bh(n, i, s, a, o), B = Ph(n, i, s, a, o, c);
|
|
4965
|
+
var R = po(I, N, z, B), j = mo(I, N, z, B);
|
|
4966
|
+
k = E, A = _, E = v, _ = S, v = p, S = w, p = po(f, u, x, O), w = mo(u, u, x, O), f = o, u = c, o = s, c = a, s = n, a = i, n = po(x, O, R, j), i = mo(x, O, R, j);
|
|
4967
4967
|
}
|
|
4968
4968
|
Jr(this.h, 0, n, i), Jr(this.h, 2, s, a), Jr(this.h, 4, o, c), Jr(this.h, 6, f, u), Jr(this.h, 8, p, w), Jr(this.h, 10, v, S), Jr(this.h, 12, E, _), Jr(this.h, 14, k, A);
|
|
4969
4969
|
}, yr.prototype._digest = function(e) {
|
|
@@ -4979,12 +4979,12 @@ var Fh = Dr;
|
|
|
4979
4979
|
Dr.blockSize = 1024, Dr.outSize = 384, Dr.hmacStrength = 192, Dr.padLength = 128, Dr.prototype._digest = function(e) {
|
|
4980
4980
|
return e === "hex" ? ra.toHex32(this.h.slice(0, 12), "big") : ra.split32(this.h.slice(0, 12), "big");
|
|
4981
4981
|
}, qn.sha1 = hh, qn.sha224 = Ah, qn.sha256 = $f, qn.sha384 = Fh, qn.sha512 = Ff;
|
|
4982
|
-
var Vf = {}, An = Wt, Zh = fi, ds = An.rotl32,
|
|
4982
|
+
var Vf = {}, An = Wt, Zh = fi, ds = An.rotl32, N0 = An.sum32, vi = An.sum32_3, O0 = An.sum32_4, Kf = Zh.BlockHash;
|
|
4983
4983
|
function Mr() {
|
|
4984
4984
|
if (!(this instanceof Mr)) return new Mr();
|
|
4985
4985
|
Kf.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
|
|
4986
4986
|
}
|
|
4987
|
-
function
|
|
4987
|
+
function C0(e, t, r, n) {
|
|
4988
4988
|
return e <= 15 ? t ^ r ^ n : e <= 31 ? t & r | ~t & n : e <= 47 ? (t | ~r) ^ n : e <= 63 ? t & n | r & ~n : t ^ (r | ~n);
|
|
4989
4989
|
}
|
|
4990
4990
|
function Vh(e) {
|
|
@@ -4995,8 +4995,8 @@ function Kh(e) {
|
|
|
4995
4995
|
}
|
|
4996
4996
|
An.inherits(Mr, Kf), Vf.ripemd160 = Mr, Mr.blockSize = 512, Mr.outSize = 160, Mr.hmacStrength = 192, Mr.padLength = 64, Mr.prototype._update = function(e, t) {
|
|
4997
4997
|
for (var r = this.h[0], n = this.h[1], i = this.h[2], s = this.h[3], a = this.h[4], o = r, c = n, f = i, u = s, p = a, w = 0; w < 80; w++) {
|
|
4998
|
-
var v =
|
|
4999
|
-
r = a, a = s, s = ds(i, 10), i = n, n = v, v =
|
|
4998
|
+
var v = N0(ds(O0(r, C0(w, n, i, s), e[Wh[w] + t], Vh(w)), Qh[w]), a);
|
|
4999
|
+
r = a, a = s, s = ds(i, 10), i = n, n = v, v = N0(ds(O0(o, C0(79 - w, c, f, u), e[Yh[w] + t], Kh(w)), Jh[w]), p), o = p, p = u, u = ds(f, 10), f = c, c = v;
|
|
5000
5000
|
}
|
|
5001
5001
|
v = vi(this.h[1], i, u), this.h[1] = vi(this.h[2], s, p), this.h[2] = vi(this.h[3], a, o), this.h[3] = vi(this.h[4], r, c), this.h[4] = vi(this.h[0], n, f), this.h[0] = v;
|
|
5002
5002
|
}, Mr.prototype._digest = function(e) {
|
|
@@ -5235,39 +5235,39 @@ dr.prototype.keyPair = function(e) {
|
|
|
5235
5235
|
}
|
|
5236
5236
|
throw new Error("Unable to find valid recovery factor");
|
|
5237
5237
|
};
|
|
5238
|
-
var
|
|
5239
|
-
function
|
|
5238
|
+
var Ni = nr, j0 = Ni.assert, $0 = Ni.parseBytes, zn = Ni.cachedProperty;
|
|
5239
|
+
function Ce(e, t) {
|
|
5240
5240
|
this.eddsa = e, this._secret = $0(t.secret), e.isPoint(t.pub) ? this._pub = t.pub : this._pubBytes = $0(t.pub);
|
|
5241
5241
|
}
|
|
5242
|
-
|
|
5243
|
-
return t instanceof
|
|
5244
|
-
},
|
|
5245
|
-
return t instanceof
|
|
5246
|
-
},
|
|
5242
|
+
Ce.fromPublic = function(e, t) {
|
|
5243
|
+
return t instanceof Ce ? t : new Ce(e, { pub: t });
|
|
5244
|
+
}, Ce.fromSecret = function(e, t) {
|
|
5245
|
+
return t instanceof Ce ? t : new Ce(e, { secret: t });
|
|
5246
|
+
}, Ce.prototype.secret = function() {
|
|
5247
5247
|
return this._secret;
|
|
5248
|
-
}, zn(
|
|
5248
|
+
}, zn(Ce, "pubBytes", function() {
|
|
5249
5249
|
return this.eddsa.encodePoint(this.pub());
|
|
5250
|
-
}), zn(
|
|
5250
|
+
}), zn(Ce, "pub", function() {
|
|
5251
5251
|
return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());
|
|
5252
|
-
}), zn(
|
|
5252
|
+
}), zn(Ce, "privBytes", function() {
|
|
5253
5253
|
var e = this.eddsa, t = this.hash(), r = e.encodingLength - 1, n = t.slice(0, e.encodingLength);
|
|
5254
5254
|
return n[0] &= 248, n[r] &= 127, n[r] |= 64, n;
|
|
5255
|
-
}), zn(
|
|
5255
|
+
}), zn(Ce, "priv", function() {
|
|
5256
5256
|
return this.eddsa.decodeInt(this.privBytes());
|
|
5257
|
-
}), zn(
|
|
5257
|
+
}), zn(Ce, "hash", function() {
|
|
5258
5258
|
return this.eddsa.hash().update(this.secret()).digest();
|
|
5259
|
-
}), zn(
|
|
5259
|
+
}), zn(Ce, "messagePrefix", function() {
|
|
5260
5260
|
return this.hash().slice(this.eddsa.encodingLength);
|
|
5261
|
-
}),
|
|
5261
|
+
}), Ce.prototype.sign = function(e) {
|
|
5262
5262
|
return j0(this._secret, "KeyPair can only verify"), this.eddsa.sign(e, this);
|
|
5263
|
-
},
|
|
5263
|
+
}, Ce.prototype.verify = function(e, t) {
|
|
5264
5264
|
return this.eddsa.verify(e, t, this);
|
|
5265
|
-
},
|
|
5266
|
-
return j0(this._secret, "KeyPair is public only"),
|
|
5267
|
-
},
|
|
5268
|
-
return
|
|
5265
|
+
}, Ce.prototype.getSecret = function(e) {
|
|
5266
|
+
return j0(this._secret, "KeyPair is public only"), Ni.encode(this.secret(), e);
|
|
5267
|
+
}, Ce.prototype.getPublic = function(e) {
|
|
5268
|
+
return Ni.encode(this.pubBytes(), e);
|
|
5269
5269
|
};
|
|
5270
|
-
var f2 =
|
|
5270
|
+
var f2 = Ce, u2 = Wr, Ys = nr, q0 = Ys.assert, us = Ys.cachedProperty, h2 = Ys.parseBytes;
|
|
5271
5271
|
function gn(e, t) {
|
|
5272
5272
|
this.eddsa = e, typeof t != "object" && (t = h2(t)), Array.isArray(t) && (q0(t.length === 2 * e.encodingLength, "Signature has invalid size"), t = { R: t.slice(0, e.encodingLength), S: t.slice(e.encodingLength) }), q0(t.R && t.S, "Signature without R or S"), e.isPoint(t.R) && (this._R = t.R), t.S instanceof u2 && (this._S = t.S), this._Rencoded = Array.isArray(t.R) ? t.R : t.Rencoded, this._Sencoded = Array.isArray(t.S) ? t.S : t.Sencoded;
|
|
5273
5273
|
}
|
|
@@ -5322,7 +5322,7 @@ Je.prototype.sign = function(e, t) {
|
|
|
5322
5322
|
}, function(e) {
|
|
5323
5323
|
var t = e;
|
|
5324
5324
|
t.version = Yu, t.utils = nr, t.rand = Bf, t.curve = Fa, t.curves = Ws, t.ec = d2, t.eddsa = g2;
|
|
5325
|
-
}(
|
|
5325
|
+
}(Nf), function(e) {
|
|
5326
5326
|
e.NUMBER = "NUMBER_NUMBER", e.HEX = "NUMBER_HEX", e.STR = "NUMBER_STR", e.BIGINT = "NUMBER_BIGINT";
|
|
5327
5327
|
}(Ai || (Ai = {})), function(e) {
|
|
5328
5328
|
e.HEX = "BYTES_HEX", e.UINT8ARRAY = "BYTES_UINT8ARRAY";
|
|
@@ -5508,7 +5508,7 @@ class Va extends je {
|
|
|
5508
5508
|
return Object.assign(Object.assign({}, super.toJSON()), { data: this.data, request: this.request, statusCode: this.statusCode });
|
|
5509
5509
|
}
|
|
5510
5510
|
}
|
|
5511
|
-
class
|
|
5511
|
+
class N2 extends Va {
|
|
5512
5512
|
constructor(t, r) {
|
|
5513
5513
|
let n;
|
|
5514
5514
|
super(t, void 0, r), this.code = 101, "error" in t ? n = t.error : t instanceof Array && (n = t.map((i) => i.error)), Array.isArray(n) ? this.cause = new Ii(n) : this.cause = n;
|
|
@@ -5523,7 +5523,7 @@ class sr extends je {
|
|
|
5523
5523
|
return Object.assign(Object.assign({}, super.toJSON()), { error: this.jsonRpcError, id: this.id, jsonRpc: this.jsonrpc });
|
|
5524
5524
|
}
|
|
5525
5525
|
}
|
|
5526
|
-
class
|
|
5526
|
+
class O2 extends je {
|
|
5527
5527
|
constructor(t, r) {
|
|
5528
5528
|
var n, i, s, a;
|
|
5529
5529
|
if (t) if (!((n = Ze[t]) === null || n === void 0) && n.message) super(Ze[t].message);
|
|
@@ -5585,7 +5585,7 @@ or.set(sa, { error: class extends sr {
|
|
|
5585
5585
|
super(e, Ze[-32005].message), this.code = ma;
|
|
5586
5586
|
}
|
|
5587
5587
|
} });
|
|
5588
|
-
class
|
|
5588
|
+
class C2 extends je {
|
|
5589
5589
|
constructor(t) {
|
|
5590
5590
|
super(`Format for the type ${t} is unsupported`), this.type = t, this.code = 1200;
|
|
5591
5591
|
}
|
|
@@ -5593,7 +5593,7 @@ class O2 extends je {
|
|
|
5593
5593
|
return Object.assign(Object.assign({}, super.toJSON()), { type: this.type });
|
|
5594
5594
|
}
|
|
5595
5595
|
}
|
|
5596
|
-
function
|
|
5596
|
+
function Oi(e) {
|
|
5597
5597
|
if (!Number.isSafeInteger(e) || e < 0) throw new Error(`positive integer expected, not ${e}`);
|
|
5598
5598
|
}
|
|
5599
5599
|
function hi(e, ...t) {
|
|
@@ -5603,7 +5603,7 @@ function hi(e, ...t) {
|
|
|
5603
5603
|
}
|
|
5604
5604
|
function Jf(e) {
|
|
5605
5605
|
if (typeof e != "function" || typeof e.create != "function") throw new Error("Hash should be wrapped by utils.wrapConstructor");
|
|
5606
|
-
|
|
5606
|
+
Oi(e.outputLen), Oi(e.blockLen);
|
|
5607
5607
|
}
|
|
5608
5608
|
function Mn(e, t = !0) {
|
|
5609
5609
|
if (e.destroyed) throw new Error("Hash instance has been destroyed");
|
|
@@ -5614,7 +5614,7 @@ function Ka(e, t) {
|
|
|
5614
5614
|
const r = t.outputLen;
|
|
5615
5615
|
if (e.length < r) throw new Error(`digestInto() expects output buffer of length at least ${r}`);
|
|
5616
5616
|
}
|
|
5617
|
-
const B2 = { number:
|
|
5617
|
+
const B2 = { number: Oi, bool: function(e) {
|
|
5618
5618
|
if (typeof e != "boolean") throw new Error(`boolean expected, not ${e}`);
|
|
5619
5619
|
}, bytes: hi, hash: Jf, exists: Mn, output: Ka }, hs = BigInt(2 ** 32 - 1), Y0 = BigInt(32);
|
|
5620
5620
|
function P2(e, t = !1) {
|
|
@@ -5662,7 +5662,7 @@ for (let e = 0, t = wi, r = 1, n = 0; e < 24; e++) {
|
|
|
5662
5662
|
const [D2, F2] = L2(r1, !0), G0 = (e, t, r) => r > 32 ? ((n, i, s) => i << s - 32 | n >>> 64 - s)(e, t, r) : ((n, i, s) => n << s | i >>> 32 - s)(e, t, r), X0 = (e, t, r) => r > 32 ? ((n, i, s) => n << s - 32 | i >>> 64 - s)(e, t, r) : ((n, i, s) => i << s | n >>> 32 - s)(e, t, r);
|
|
5663
5663
|
class Ya extends Wa {
|
|
5664
5664
|
constructor(t, r, n, i = !1, s = 24) {
|
|
5665
|
-
if (super(), this.blockLen = t, this.suffix = r, this.outputLen = n, this.enableXOF = i, this.rounds = s, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1,
|
|
5665
|
+
if (super(), this.blockLen = t, this.suffix = r, this.outputLen = n, this.enableXOF = i, this.rounds = s, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, Oi(n), 0 >= this.blockLen || this.blockLen >= 200) throw new Error("Sha3 supports only keccak-f1600 function");
|
|
5666
5666
|
var a;
|
|
5667
5667
|
this.state = new Uint8Array(200), this.state32 = (a = this.state, new Uint32Array(a.buffer, a.byteOffset, Math.floor(a.byteLength / 4)));
|
|
5668
5668
|
}
|
|
@@ -5720,7 +5720,7 @@ class Ya extends Wa {
|
|
|
5720
5720
|
return this.writeInto(t);
|
|
5721
5721
|
}
|
|
5722
5722
|
xof(t) {
|
|
5723
|
-
return
|
|
5723
|
+
return Oi(t), this.xofInto(new Uint8Array(t));
|
|
5724
5724
|
}
|
|
5725
5725
|
digestInto(t) {
|
|
5726
5726
|
if (Ka(t, this), this.finished) throw new Error("digest() was already called");
|
|
@@ -5962,7 +5962,7 @@ class Ve {
|
|
|
5962
5962
|
return { status: t.value, value: n };
|
|
5963
5963
|
}
|
|
5964
5964
|
}
|
|
5965
|
-
const Et = Object.freeze({ status: "aborted" }), Is = (e) => ({ status: "dirty", value: e }), Ye = (e) => ({ status: "valid", value: e }), _a = (e) => e.status === "aborted", xa = (e) => e.status === "dirty", En = (e) => e.status === "valid",
|
|
5965
|
+
const Et = Object.freeze({ status: "aborted" }), Is = (e) => ({ status: "dirty", value: e }), Ye = (e) => ({ status: "valid", value: e }), _a = (e) => e.status === "aborted", xa = (e) => e.status === "dirty", En = (e) => e.status === "valid", Ci = (e) => typeof Promise < "u" && e instanceof Promise;
|
|
5966
5966
|
var wt;
|
|
5967
5967
|
(function(e) {
|
|
5968
5968
|
e.errToObj = (t) => typeof t == "string" ? { message: t } : t || {}, e.toString = (t) => typeof t == "string" ? t : t == null ? void 0 : t.message;
|
|
@@ -6008,7 +6008,7 @@ class Ut {
|
|
|
6008
6008
|
}
|
|
6009
6009
|
_parseSync(t) {
|
|
6010
6010
|
const r = this._parse(t);
|
|
6011
|
-
if (
|
|
6011
|
+
if (Ci(r)) throw new Error("Synchronous parse encountered promise.");
|
|
6012
6012
|
return r;
|
|
6013
6013
|
}
|
|
6014
6014
|
_parseAsync(t) {
|
|
@@ -6041,7 +6041,7 @@ class Ut {
|
|
|
6041
6041
|
throw n.error;
|
|
6042
6042
|
}
|
|
6043
6043
|
async safeParseAsync(t, r) {
|
|
6044
|
-
const n = { common: { issues: [], contextualErrorMap: r == null ? void 0 : r.errorMap, async: !0 }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType: Ur(t) }, i = this._parse({ data: t, path: n.path, parent: n }), s = await (
|
|
6044
|
+
const n = { common: { issues: [], contextualErrorMap: r == null ? void 0 : r.errorMap, async: !0 }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType: Ur(t) }, i = this._parse({ data: t, path: n.path, parent: n }), s = await (Ci(i) ? i : Promise.resolve(i));
|
|
6045
6045
|
return ed(n, s);
|
|
6046
6046
|
}
|
|
6047
6047
|
refine(t, r) {
|
|
@@ -6610,18 +6610,18 @@ class _r extends Ut {
|
|
|
6610
6610
|
}
|
|
6611
6611
|
}
|
|
6612
6612
|
function Un(e) {
|
|
6613
|
-
if (e instanceof
|
|
6613
|
+
if (e instanceof ge) {
|
|
6614
6614
|
const t = {};
|
|
6615
6615
|
for (const r in e.shape) {
|
|
6616
6616
|
const n = e.shape[r];
|
|
6617
6617
|
t[r] = Br.create(Un(n));
|
|
6618
6618
|
}
|
|
6619
|
-
return new
|
|
6619
|
+
return new ge({ ...e._def, shape: () => t });
|
|
6620
6620
|
}
|
|
6621
6621
|
return e instanceof _r ? new _r({ ...e._def, type: Un(e.element) }) : e instanceof Br ? Br.create(Un(e.unwrap())) : e instanceof fn ? fn.create(Un(e.unwrap())) : e instanceof Lr ? Lr.create(e.items.map((t) => Un(t))) : e;
|
|
6622
6622
|
}
|
|
6623
6623
|
_r.create = (e, t) => new _r({ type: e, minLength: null, maxLength: null, exactLength: null, typeName: It.ZodArray, ...zt(t) });
|
|
6624
|
-
class
|
|
6624
|
+
class ge extends Ut {
|
|
6625
6625
|
constructor() {
|
|
6626
6626
|
super(...arguments), this._cached = null, this.nonstrict = this.passthrough, this.augment = this.extend;
|
|
6627
6627
|
}
|
|
@@ -6667,39 +6667,39 @@ class be extends Ut {
|
|
|
6667
6667
|
return this._def.shape();
|
|
6668
6668
|
}
|
|
6669
6669
|
strict(t) {
|
|
6670
|
-
return wt.errToObj, new
|
|
6670
|
+
return wt.errToObj, new ge({ ...this._def, unknownKeys: "strict", ...t !== void 0 ? { errorMap: (r, n) => {
|
|
6671
6671
|
var s, a;
|
|
6672
6672
|
const i = ((a = (s = this._def).errorMap) == null ? void 0 : a.call(s, r, n).message) ?? n.defaultError;
|
|
6673
6673
|
return r.code === "unrecognized_keys" ? { message: wt.errToObj(t).message ?? i } : { message: i };
|
|
6674
6674
|
} } : {} });
|
|
6675
6675
|
}
|
|
6676
6676
|
strip() {
|
|
6677
|
-
return new
|
|
6677
|
+
return new ge({ ...this._def, unknownKeys: "strip" });
|
|
6678
6678
|
}
|
|
6679
6679
|
passthrough() {
|
|
6680
|
-
return new
|
|
6680
|
+
return new ge({ ...this._def, unknownKeys: "passthrough" });
|
|
6681
6681
|
}
|
|
6682
6682
|
extend(t) {
|
|
6683
|
-
return new
|
|
6683
|
+
return new ge({ ...this._def, shape: () => ({ ...this._def.shape(), ...t }) });
|
|
6684
6684
|
}
|
|
6685
6685
|
merge(t) {
|
|
6686
|
-
return new
|
|
6686
|
+
return new ge({ unknownKeys: t._def.unknownKeys, catchall: t._def.catchall, shape: () => ({ ...this._def.shape(), ...t._def.shape() }), typeName: It.ZodObject });
|
|
6687
6687
|
}
|
|
6688
6688
|
setKey(t, r) {
|
|
6689
6689
|
return this.augment({ [t]: r });
|
|
6690
6690
|
}
|
|
6691
6691
|
catchall(t) {
|
|
6692
|
-
return new
|
|
6692
|
+
return new ge({ ...this._def, catchall: t });
|
|
6693
6693
|
}
|
|
6694
6694
|
pick(t) {
|
|
6695
6695
|
const r = {};
|
|
6696
6696
|
for (const n of te.objectKeys(t)) t[n] && this.shape[n] && (r[n] = this.shape[n]);
|
|
6697
|
-
return new
|
|
6697
|
+
return new ge({ ...this._def, shape: () => r });
|
|
6698
6698
|
}
|
|
6699
6699
|
omit(t) {
|
|
6700
6700
|
const r = {};
|
|
6701
6701
|
for (const n of te.objectKeys(this.shape)) t[n] || (r[n] = this.shape[n]);
|
|
6702
|
-
return new
|
|
6702
|
+
return new ge({ ...this._def, shape: () => r });
|
|
6703
6703
|
}
|
|
6704
6704
|
deepPartial() {
|
|
6705
6705
|
return Un(this);
|
|
@@ -6710,7 +6710,7 @@ class be extends Ut {
|
|
|
6710
6710
|
const i = this.shape[n];
|
|
6711
6711
|
t && !t[n] ? r[n] = i : r[n] = i.optional();
|
|
6712
6712
|
}
|
|
6713
|
-
return new
|
|
6713
|
+
return new ge({ ...this._def, shape: () => r });
|
|
6714
6714
|
}
|
|
6715
6715
|
required(t) {
|
|
6716
6716
|
const r = {};
|
|
@@ -6720,13 +6720,13 @@ class be extends Ut {
|
|
|
6720
6720
|
for (; i instanceof Br; ) i = i._def.innerType;
|
|
6721
6721
|
r[n] = i;
|
|
6722
6722
|
}
|
|
6723
|
-
return new
|
|
6723
|
+
return new ge({ ...this._def, shape: () => r });
|
|
6724
6724
|
}
|
|
6725
6725
|
keyof() {
|
|
6726
6726
|
return a1(te.objectKeys(this.shape));
|
|
6727
6727
|
}
|
|
6728
6728
|
}
|
|
6729
|
-
|
|
6729
|
+
ge.create = (e, t) => new ge({ shape: () => e, unknownKeys: "strip", catchall: Kr.create(), typeName: It.ZodObject, ...zt(t) }), ge.strictCreate = (e, t) => new ge({ shape: () => e, unknownKeys: "strict", catchall: Kr.create(), typeName: It.ZodObject, ...zt(t) }), ge.lazycreate = (e, t) => new ge({ shape: e, unknownKeys: "strip", catchall: Kr.create(), typeName: It.ZodObject, ...zt(t) });
|
|
6730
6730
|
class zi extends Ut {
|
|
6731
6731
|
_parse(t) {
|
|
6732
6732
|
const { ctx: r } = this._processInputParams(t), n = this._def.options;
|
|
@@ -6866,7 +6866,7 @@ class Xs extends Ut {
|
|
|
6866
6866
|
return new Xs(r instanceof Ut ? { keyType: t, valueType: r, typeName: It.ZodRecord, ...zt(n) } : { keyType: vr.create(), valueType: t, typeName: It.ZodRecord, ...zt(r) });
|
|
6867
6867
|
}
|
|
6868
6868
|
}
|
|
6869
|
-
class
|
|
6869
|
+
class Ns extends Ut {
|
|
6870
6870
|
get keySchema() {
|
|
6871
6871
|
return this._def.keyType;
|
|
6872
6872
|
}
|
|
@@ -6899,7 +6899,7 @@ class Cs extends Ut {
|
|
|
6899
6899
|
}
|
|
6900
6900
|
}
|
|
6901
6901
|
}
|
|
6902
|
-
|
|
6902
|
+
Ns.create = (e, t, r) => new Ns({ valueType: t, keyType: e, typeName: It.ZodMap, ...zt(r) });
|
|
6903
6903
|
class Tn extends Ut {
|
|
6904
6904
|
_parse(t) {
|
|
6905
6905
|
const { status: r, ctx: n } = this._processInputParams(t);
|
|
@@ -7169,7 +7169,7 @@ Hi.create = (e, t) => new Hi({ innerType: e, typeName: It.ZodDefault, defaultVal
|
|
|
7169
7169
|
class Di extends Ut {
|
|
7170
7170
|
_parse(t) {
|
|
7171
7171
|
const { ctx: r } = this._processInputParams(t), n = { ...r, common: { ...r.common, issues: [] } }, i = this._def.innerType._parse({ data: n.data, path: n.path, parent: { ...n } });
|
|
7172
|
-
return
|
|
7172
|
+
return Ci(i) ? i.then((s) => ({ status: "valid", value: s.status === "valid" ? s.value : this._def.catchValue({ get error() {
|
|
7173
7173
|
return new rr(n.common.issues);
|
|
7174
7174
|
}, input: n.data }) })) : { status: "valid", value: i.status === "valid" ? i.value : this._def.catchValue({ get error() {
|
|
7175
7175
|
return new rr(n.common.issues);
|
|
@@ -7180,7 +7180,7 @@ class Di extends Ut {
|
|
|
7180
7180
|
}
|
|
7181
7181
|
}
|
|
7182
7182
|
Di.create = (e, t) => new Di({ innerType: e, typeName: It.ZodCatch, catchValue: typeof t.catch == "function" ? t.catch : () => t.catch, ...zt(t) });
|
|
7183
|
-
class
|
|
7183
|
+
class Os extends Ut {
|
|
7184
7184
|
_parse(t) {
|
|
7185
7185
|
if (this._getType(t) !== bt.nan) {
|
|
7186
7186
|
const r = this._getOrReturnCtx(t);
|
|
@@ -7189,7 +7189,7 @@ class Ns extends Ut {
|
|
|
7189
7189
|
return { status: "valid", value: t.data };
|
|
7190
7190
|
}
|
|
7191
7191
|
}
|
|
7192
|
-
|
|
7192
|
+
Os.create = (e) => new Os({ typeName: It.ZodNaN, ...zt(e) });
|
|
7193
7193
|
const ul = Symbol("zod_brand");
|
|
7194
7194
|
class Ja extends Ut {
|
|
7195
7195
|
_parse(t) {
|
|
@@ -7220,7 +7220,7 @@ class Ji extends Ut {
|
|
|
7220
7220
|
class Fi extends Ut {
|
|
7221
7221
|
_parse(t) {
|
|
7222
7222
|
const r = this._def.innerType._parse(t), n = (i) => (En(i) && (i.value = Object.freeze(i.value)), i);
|
|
7223
|
-
return
|
|
7223
|
+
return Ci(r) ? r.then((i) => n(i)) : n(r);
|
|
7224
7224
|
}
|
|
7225
7225
|
unwrap() {
|
|
7226
7226
|
return this._def.innerType;
|
|
@@ -7246,21 +7246,21 @@ function nd(e, t = {}, r) {
|
|
|
7246
7246
|
}) : si.create();
|
|
7247
7247
|
}
|
|
7248
7248
|
Fi.create = (e, t) => new Fi({ innerType: e, typeName: It.ZodReadonly, ...zt(t) });
|
|
7249
|
-
const hl = { object:
|
|
7249
|
+
const hl = { object: ge.lazycreate };
|
|
7250
7250
|
var It;
|
|
7251
7251
|
(function(e) {
|
|
7252
7252
|
e.ZodString = "ZodString", e.ZodNumber = "ZodNumber", e.ZodNaN = "ZodNaN", e.ZodBigInt = "ZodBigInt", e.ZodBoolean = "ZodBoolean", e.ZodDate = "ZodDate", e.ZodSymbol = "ZodSymbol", e.ZodUndefined = "ZodUndefined", e.ZodNull = "ZodNull", e.ZodAny = "ZodAny", e.ZodUnknown = "ZodUnknown", e.ZodNever = "ZodNever", e.ZodVoid = "ZodVoid", e.ZodArray = "ZodArray", e.ZodObject = "ZodObject", e.ZodUnion = "ZodUnion", e.ZodDiscriminatedUnion = "ZodDiscriminatedUnion", e.ZodIntersection = "ZodIntersection", e.ZodTuple = "ZodTuple", e.ZodRecord = "ZodRecord", e.ZodMap = "ZodMap", e.ZodSet = "ZodSet", e.ZodFunction = "ZodFunction", e.ZodLazy = "ZodLazy", e.ZodLiteral = "ZodLiteral", e.ZodEnum = "ZodEnum", e.ZodEffects = "ZodEffects", e.ZodNativeEnum = "ZodNativeEnum", e.ZodOptional = "ZodOptional", e.ZodNullable = "ZodNullable", e.ZodDefault = "ZodDefault", e.ZodCatch = "ZodCatch", e.ZodPromise = "ZodPromise", e.ZodBranded = "ZodBranded", e.ZodPipeline = "ZodPipeline", e.ZodReadonly = "ZodReadonly";
|
|
7253
7253
|
})(It || (It = {}));
|
|
7254
|
-
const id = vr.create, sd = an.create, ll =
|
|
7254
|
+
const id = vr.create, sd = an.create, ll = Os.create, pl = cn.create, od = Bi.create, ml = In.create, bl = Ts.create, gl = Pi.create, yl = Li.create, Aa = si.create, vl = kn.create, wl = Kr.create, _l = Rs.create, c1 = _r.create, ys = ge.create, xl = ge.strictCreate, d1 = zi.create, Sl = Gs.create, Al = ji.create, f1 = Lr.create, kl = Xs.create, Ml = Ns.create, El = Tn.create, Il = Gn.create, Tl = $i.create, Rl = qi.create, Nl = dn.create, Ol = Ui.create, Cl = oi.create, ad = wr.create, Bl = Br.create, Pl = fn.create, Ll = wr.createWithPreprocess, zl = Ji.create, jl = { string: (e) => vr.create({ ...e, coerce: !0 }), number: (e) => an.create({ ...e, coerce: !0 }), boolean: (e) => Bi.create({ ...e, coerce: !0 }), bigint: (e) => cn.create({ ...e, coerce: !0 }), date: (e) => In.create({ ...e, coerce: !0 }) }, $l = Et, cd = Object.freeze(Object.defineProperty({ __proto__: null, BRAND: ul, DIRTY: Is, EMPTY_PATH: [], INVALID: Et, NEVER: $l, OK: Ye, ParseStatus: Ve, Schema: Ut, ZodAny: si, ZodArray: _r, ZodBigInt: cn, ZodBoolean: Bi, ZodBranded: Ja, ZodCatch: Di, ZodDate: In, ZodDefault: Hi, ZodDiscriminatedUnion: Gs, ZodEffects: wr, ZodEnum: dn, ZodError: rr, get ZodFirstPartyTypeKind() {
|
|
7255
7255
|
return It;
|
|
7256
|
-
}, ZodFunction: Gn, ZodIntersection: ji, ZodIssueCode: J, ZodLazy: $i, ZodLiteral: qi, ZodMap:
|
|
7256
|
+
}, ZodFunction: Gn, ZodIntersection: ji, ZodIssueCode: J, ZodLazy: $i, ZodLiteral: qi, ZodMap: Ns, ZodNaN: Os, ZodNativeEnum: Ui, ZodNever: Kr, ZodNull: Li, ZodNullable: fn, ZodNumber: an, ZodObject: ge, ZodOptional: Br, ZodParsedType: bt, ZodPipeline: Ji, ZodPromise: oi, ZodReadonly: Fi, ZodRecord: Xs, ZodSchema: Ut, ZodSet: Tn, ZodString: vr, ZodSymbol: Ts, ZodTransformer: wr, ZodTuple: Lr, ZodType: Ut, ZodUndefined: Pi, ZodUnion: zi, ZodUnknown: kn, ZodVoid: Rs, addIssueToContext: ft, any: Aa, array: c1, bigint: pl, boolean: od, coerce: jl, custom: nd, date: ml, datetimeRegex: o1, defaultErrorMap: ii, discriminatedUnion: Sl, effect: ad, enum: Nl, function: Il, getErrorMap: Ms, getParsedType: Ur, instanceof: (e, t = { message: `Input not instance of ${e.name}` }) => nd((r) => r instanceof e, t), intersection: Al, isAborted: _a, isAsync: Ci, isDirty: xa, isValid: En, late: hl, lazy: Tl, literal: Rl, makeIssue: Es, map: Ml, nan: ll, nativeEnum: Ol, never: wl, null: yl, nullable: Pl, number: sd, object: ys, get objectUtil() {
|
|
7257
7257
|
return wa;
|
|
7258
|
-
}, oboolean: () => od().optional(), onumber: () => sd().optional(), optional: Bl, ostring: () => id().optional(), pipeline: zl, preprocess: Ll, promise:
|
|
7258
|
+
}, oboolean: () => od().optional(), onumber: () => sd().optional(), optional: Bl, ostring: () => id().optional(), pipeline: zl, preprocess: Ll, promise: Cl, quotelessJson: (e) => JSON.stringify(e, null, 2).replace(/"([^"]+)":/g, "$1:"), record: kl, set: El, setErrorMap: function(e) {
|
|
7259
7259
|
n1 = e;
|
|
7260
7260
|
}, strictObject: xl, string: id, symbol: bl, transformer: ad, tuple: f1, undefined: gl, union: d1, unknown: vl, get util() {
|
|
7261
7261
|
return te;
|
|
7262
7262
|
}, void: _l }, Symbol.toStringTag, { value: "Module" })), ql = (e) => e.message ? e.message : "unspecified error";
|
|
7263
|
-
class
|
|
7263
|
+
class Cs extends je {
|
|
7264
7264
|
constructor(t) {
|
|
7265
7265
|
super(), this.code = 1100, this.errors = t, super.message = `Web3 validator found ${t.length} error[s]:
|
|
7266
7266
|
${this._compileErrors().join(`
|
|
@@ -7281,9 +7281,9 @@ const Ul = ["bool", "int", "uint", "bytes", "string", "address", "tuple"], u1 =
|
|
|
7281
7281
|
}
|
|
7282
7282
|
return { baseType: r, isArray: n, baseTypeSize: t, arraySizes: i };
|
|
7283
7283
|
}, dd = (e, t = {}) => {
|
|
7284
|
-
if (Object.keys(t).includes("type")) throw new
|
|
7284
|
+
if (Object.keys(t).includes("type")) throw new Cs([{ keyword: "eth", message: 'Either "eth" or "type" can be presented in schema', params: { eth: e }, instancePath: "", schemaPath: "" }]);
|
|
7285
7285
|
const { baseType: r, baseTypeSize: n } = Pn(e);
|
|
7286
|
-
if (!r && !Hl.includes(e)) throw new
|
|
7286
|
+
if (!r && !Hl.includes(e)) throw new Cs([{ keyword: "eth", message: `Eth data type "${e}" is not valid`, params: { eth: e }, instancePath: "", schemaPath: "" }]);
|
|
7287
7287
|
if (r) {
|
|
7288
7288
|
if (r === "tuple") throw new Error('"tuple" type is not implemented directly.');
|
|
7289
7289
|
return { format: `${r}${n ?? ""}`, required: !0 };
|
|
@@ -7480,7 +7480,7 @@ const Mi = (e) => {
|
|
|
7480
7480
|
}
|
|
7481
7481
|
if (e.oneOf && Array.isArray(e.oneOf)) return d1(e.oneOf.map((t) => Mi(t)));
|
|
7482
7482
|
if (e != null && e.format) {
|
|
7483
|
-
if (!Rn[e.format]) throw new
|
|
7483
|
+
if (!Rn[e.format]) throw new C2(e.format);
|
|
7484
7484
|
return Aa().refine(Rn[e.format], (t) => ({ params: { value: t, format: e.format } }));
|
|
7485
7485
|
}
|
|
7486
7486
|
return e != null && e.type && (e == null ? void 0 : e.type) !== "object" && typeof cd[String(e.type)] == "function" ? cd[String(e.type)]() : ys({ data: Aa() }).partial();
|
|
@@ -7496,7 +7496,7 @@ class Kn {
|
|
|
7496
7496
|
const o = this.convertErrors((s = (i = a.error) === null || i === void 0 ? void 0 : i.issues) !== null && s !== void 0 ? s : []);
|
|
7497
7497
|
if (o) {
|
|
7498
7498
|
if (n != null && n.silent) return o;
|
|
7499
|
-
throw new
|
|
7499
|
+
throw new Cs(o);
|
|
7500
7500
|
}
|
|
7501
7501
|
}
|
|
7502
7502
|
}
|
|
@@ -7527,7 +7527,7 @@ const Gi = new class {
|
|
|
7527
7527
|
var n, i;
|
|
7528
7528
|
const s = h1(e);
|
|
7529
7529
|
if (!Array.isArray(s.items) || ((n = s.items) === null || n === void 0 ? void 0 : n.length) !== 0 || t.length !== 0) {
|
|
7530
|
-
if (Array.isArray(s.items) && ((i = s.items) === null || i === void 0 ? void 0 : i.length) === 0 && t.length !== 0) throw new
|
|
7530
|
+
if (Array.isArray(s.items) && ((i = s.items) === null || i === void 0 ? void 0 : i.length) === 0 && t.length !== 0) throw new Cs([{ instancePath: "/0", schemaPath: "/", keyword: "required", message: "empty schema against data can not be validated", params: t }]);
|
|
7531
7531
|
return this._validator.validate(s, t, r);
|
|
7532
7532
|
}
|
|
7533
7533
|
}
|
|
@@ -7762,7 +7762,7 @@ class n3 {
|
|
|
7762
7762
|
i = JSON.parse(s);
|
|
7763
7763
|
} catch {
|
|
7764
7764
|
return this.lastChunk = s, this.lastChunkTimeout && clearTimeout(this.lastChunkTimeout), void (this.lastChunkTimeout = setTimeout(() => {
|
|
7765
|
-
this.autoReconnect || (this.clearQueues(), this.eventEmitter.emit("error", new
|
|
7765
|
+
this.autoReconnect || (this.clearQueues(), this.eventEmitter.emit("error", new N2({ id: 1, jsonrpc: "2.0", error: { code: 2, message: "Chunk timeout" } })));
|
|
7766
7766
|
}, this.chunkTimeout));
|
|
7767
7767
|
}
|
|
7768
7768
|
clearTimeout(this.lastChunkTimeout), this.lastChunk = void 0, i && r.push(i);
|
|
@@ -7827,7 +7827,7 @@ class S1 extends Qs {
|
|
|
7827
7827
|
});
|
|
7828
7828
|
}
|
|
7829
7829
|
_onDisconnect(t, r) {
|
|
7830
|
-
this._eventEmitter.emit("disconnect", new
|
|
7830
|
+
this._eventEmitter.emit("disconnect", new O2(t, r));
|
|
7831
7831
|
}
|
|
7832
7832
|
_onAccountsChanged() {
|
|
7833
7833
|
this._eventEmitter.emit("accountsChanged", this._accounts);
|
|
@@ -8023,49 +8023,49 @@ var Ra = { exports: {} };
|
|
|
8023
8023
|
return typeof x != "string" && (x = String(x)), x;
|
|
8024
8024
|
}
|
|
8025
8025
|
function k(x) {
|
|
8026
|
-
var
|
|
8026
|
+
var O = { next: function() {
|
|
8027
8027
|
var R = x.shift();
|
|
8028
8028
|
return { done: R === void 0, value: R };
|
|
8029
8029
|
} };
|
|
8030
|
-
return f && (
|
|
8031
|
-
return
|
|
8032
|
-
}),
|
|
8030
|
+
return f && (O[Symbol.iterator] = function() {
|
|
8031
|
+
return O;
|
|
8032
|
+
}), O;
|
|
8033
8033
|
}
|
|
8034
8034
|
function A(x) {
|
|
8035
|
-
this.map = {}, x instanceof A ? x.forEach(function(
|
|
8036
|
-
this.append(R,
|
|
8037
|
-
}, this) : Array.isArray(x) ? x.forEach(function(
|
|
8038
|
-
if (
|
|
8039
|
-
this.append(
|
|
8040
|
-
}, this) : x && Object.getOwnPropertyNames(x).forEach(function(
|
|
8041
|
-
this.append(
|
|
8035
|
+
this.map = {}, x instanceof A ? x.forEach(function(O, R) {
|
|
8036
|
+
this.append(R, O);
|
|
8037
|
+
}, this) : Array.isArray(x) ? x.forEach(function(O) {
|
|
8038
|
+
if (O.length != 2) throw new TypeError("Headers constructor: expected name/value pair to be length 2, found" + O.length);
|
|
8039
|
+
this.append(O[0], O[1]);
|
|
8040
|
+
}, this) : x && Object.getOwnPropertyNames(x).forEach(function(O) {
|
|
8041
|
+
this.append(O, x[O]);
|
|
8042
8042
|
}, this);
|
|
8043
8043
|
}
|
|
8044
8044
|
function P(x) {
|
|
8045
8045
|
if (!x._noBody) return x.bodyUsed ? Promise.reject(new TypeError("Already read")) : void (x.bodyUsed = !0);
|
|
8046
8046
|
}
|
|
8047
8047
|
function I(x) {
|
|
8048
|
-
return new Promise(function(
|
|
8048
|
+
return new Promise(function(O, R) {
|
|
8049
8049
|
x.onload = function() {
|
|
8050
|
-
|
|
8050
|
+
O(x.result);
|
|
8051
8051
|
}, x.onerror = function() {
|
|
8052
8052
|
R(x.error);
|
|
8053
8053
|
};
|
|
8054
8054
|
});
|
|
8055
8055
|
}
|
|
8056
|
-
function
|
|
8057
|
-
var
|
|
8058
|
-
return
|
|
8056
|
+
function N(x) {
|
|
8057
|
+
var O = new FileReader(), R = I(O);
|
|
8058
|
+
return O.readAsArrayBuffer(x), R;
|
|
8059
8059
|
}
|
|
8060
8060
|
function z(x) {
|
|
8061
8061
|
if (x.slice) return x.slice(0);
|
|
8062
|
-
var
|
|
8063
|
-
return
|
|
8062
|
+
var O = new Uint8Array(x.byteLength);
|
|
8063
|
+
return O.set(new Uint8Array(x)), O.buffer;
|
|
8064
8064
|
}
|
|
8065
8065
|
function B() {
|
|
8066
8066
|
return this.bodyUsed = !1, this._initBody = function(x) {
|
|
8067
|
-
var
|
|
8068
|
-
this.bodyUsed = this.bodyUsed, this._bodyInit = x, x ? typeof x == "string" ? this._bodyText = x : u && Blob.prototype.isPrototypeOf(x) ? this._bodyBlob = x : p && FormData.prototype.isPrototypeOf(x) ? this._bodyFormData = x : c && URLSearchParams.prototype.isPrototypeOf(x) ? this._bodyText = x.toString() : w && u && (
|
|
8067
|
+
var O;
|
|
8068
|
+
this.bodyUsed = this.bodyUsed, this._bodyInit = x, x ? typeof x == "string" ? this._bodyText = x : u && Blob.prototype.isPrototypeOf(x) ? this._bodyBlob = x : p && FormData.prototype.isPrototypeOf(x) ? this._bodyFormData = x : c && URLSearchParams.prototype.isPrototypeOf(x) ? this._bodyText = x.toString() : w && u && (O = x) && DataView.prototype.isPrototypeOf(O) ? (this._bodyArrayBuffer = z(x.buffer), this._bodyInit = new Blob([this._bodyArrayBuffer])) : w && (ArrayBuffer.prototype.isPrototypeOf(x) || S(x)) ? this._bodyArrayBuffer = z(x) : this._bodyText = x = Object.prototype.toString.call(x) : (this._noBody = !0, this._bodyText = ""), this.headers.get("content-type") || (typeof x == "string" ? this.headers.set("content-type", "text/plain;charset=UTF-8") : this._bodyBlob && this._bodyBlob.type ? this.headers.set("content-type", this._bodyBlob.type) : c && URLSearchParams.prototype.isPrototypeOf(x) && this.headers.set("content-type", "application/x-www-form-urlencoded;charset=UTF-8"));
|
|
8069
8069
|
}, u && (this.blob = function() {
|
|
8070
8070
|
var x = P(this);
|
|
8071
8071
|
if (x) return x;
|
|
@@ -8078,12 +8078,12 @@ var Ra = { exports: {} };
|
|
|
8078
8078
|
var x = P(this);
|
|
8079
8079
|
return x || (ArrayBuffer.isView(this._bodyArrayBuffer) ? Promise.resolve(this._bodyArrayBuffer.buffer.slice(this._bodyArrayBuffer.byteOffset, this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength)) : Promise.resolve(this._bodyArrayBuffer));
|
|
8080
8080
|
}
|
|
8081
|
-
if (u) return this.blob().then(
|
|
8081
|
+
if (u) return this.blob().then(N);
|
|
8082
8082
|
throw new Error("could not read as ArrayBuffer");
|
|
8083
8083
|
}, this.text = function() {
|
|
8084
|
-
var x,
|
|
8084
|
+
var x, O, R, j, F, $ = P(this);
|
|
8085
8085
|
if ($) return $;
|
|
8086
|
-
if (this._bodyBlob) return x = this._bodyBlob,
|
|
8086
|
+
if (this._bodyBlob) return x = this._bodyBlob, O = new FileReader(), R = I(O), j = /charset=([A-Za-z0-9_-]+)/.exec(x.type), F = j ? j[1] : "utf-8", O.readAsText(x, F), R;
|
|
8087
8087
|
if (this._bodyArrayBuffer) return Promise.resolve(function(V) {
|
|
8088
8088
|
for (var D = new Uint8Array(V), U = new Array(D.length), G = 0; G < D.length; G++) U[G] = String.fromCharCode(D[G]);
|
|
8089
8089
|
return U.join("");
|
|
@@ -8096,65 +8096,65 @@ var Ra = { exports: {} };
|
|
|
8096
8096
|
return this.text().then(JSON.parse);
|
|
8097
8097
|
}, this;
|
|
8098
8098
|
}
|
|
8099
|
-
A.prototype.append = function(x,
|
|
8100
|
-
x = E(x),
|
|
8099
|
+
A.prototype.append = function(x, O) {
|
|
8100
|
+
x = E(x), O = _(O);
|
|
8101
8101
|
var R = this.map[x];
|
|
8102
|
-
this.map[x] = R ? R + ", " +
|
|
8102
|
+
this.map[x] = R ? R + ", " + O : O;
|
|
8103
8103
|
}, A.prototype.delete = function(x) {
|
|
8104
8104
|
delete this.map[E(x)];
|
|
8105
8105
|
}, A.prototype.get = function(x) {
|
|
8106
8106
|
return x = E(x), this.has(x) ? this.map[x] : null;
|
|
8107
8107
|
}, A.prototype.has = function(x) {
|
|
8108
8108
|
return this.map.hasOwnProperty(E(x));
|
|
8109
|
-
}, A.prototype.set = function(x,
|
|
8110
|
-
this.map[E(x)] = _(
|
|
8111
|
-
}, A.prototype.forEach = function(x,
|
|
8112
|
-
for (var R in this.map) this.map.hasOwnProperty(R) && x.call(
|
|
8109
|
+
}, A.prototype.set = function(x, O) {
|
|
8110
|
+
this.map[E(x)] = _(O);
|
|
8111
|
+
}, A.prototype.forEach = function(x, O) {
|
|
8112
|
+
for (var R in this.map) this.map.hasOwnProperty(R) && x.call(O, this.map[R], R, this);
|
|
8113
8113
|
}, A.prototype.keys = function() {
|
|
8114
8114
|
var x = [];
|
|
8115
|
-
return this.forEach(function(
|
|
8115
|
+
return this.forEach(function(O, R) {
|
|
8116
8116
|
x.push(R);
|
|
8117
8117
|
}), k(x);
|
|
8118
8118
|
}, A.prototype.values = function() {
|
|
8119
8119
|
var x = [];
|
|
8120
|
-
return this.forEach(function(
|
|
8121
|
-
x.push(
|
|
8120
|
+
return this.forEach(function(O) {
|
|
8121
|
+
x.push(O);
|
|
8122
8122
|
}), k(x);
|
|
8123
8123
|
}, A.prototype.entries = function() {
|
|
8124
8124
|
var x = [];
|
|
8125
|
-
return this.forEach(function(
|
|
8126
|
-
x.push([R,
|
|
8125
|
+
return this.forEach(function(O, R) {
|
|
8126
|
+
x.push([R, O]);
|
|
8127
8127
|
}), k(x);
|
|
8128
8128
|
}, f && (A.prototype[Symbol.iterator] = A.prototype.entries);
|
|
8129
8129
|
var d = ["CONNECT", "DELETE", "GET", "HEAD", "OPTIONS", "PATCH", "POST", "PUT", "TRACE"];
|
|
8130
|
-
function h(x,
|
|
8130
|
+
function h(x, O) {
|
|
8131
8131
|
if (!(this instanceof h)) throw new TypeError('Please use the "new" operator, this DOM object constructor cannot be called as a function.');
|
|
8132
|
-
var R, j, F = (
|
|
8132
|
+
var R, j, F = (O = O || {}).body;
|
|
8133
8133
|
if (x instanceof h) {
|
|
8134
8134
|
if (x.bodyUsed) throw new TypeError("Already read");
|
|
8135
|
-
this.url = x.url, this.credentials = x.credentials,
|
|
8135
|
+
this.url = x.url, this.credentials = x.credentials, O.headers || (this.headers = new A(x.headers)), this.method = x.method, this.mode = x.mode, this.signal = x.signal, F || x._bodyInit == null || (F = x._bodyInit, x.bodyUsed = !0);
|
|
8136
8136
|
} else this.url = String(x);
|
|
8137
|
-
if (this.credentials =
|
|
8137
|
+
if (this.credentials = O.credentials || this.credentials || "same-origin", !O.headers && this.headers || (this.headers = new A(O.headers)), this.method = (R = O.method || this.method || "GET", j = R.toUpperCase(), d.indexOf(j) > -1 ? j : R), this.mode = O.mode || this.mode || null, this.signal = O.signal || this.signal || function() {
|
|
8138
8138
|
if ("AbortController" in o) return new AbortController().signal;
|
|
8139
8139
|
}(), this.referrer = null, (this.method === "GET" || this.method === "HEAD") && F) throw new TypeError("Body not allowed for GET or HEAD requests");
|
|
8140
|
-
if (this._initBody(F), !(this.method !== "GET" && this.method !== "HEAD" ||
|
|
8140
|
+
if (this._initBody(F), !(this.method !== "GET" && this.method !== "HEAD" || O.cache !== "no-store" && O.cache !== "no-cache")) {
|
|
8141
8141
|
var $ = /([?&])_=[^&]*/;
|
|
8142
8142
|
$.test(this.url) ? this.url = this.url.replace($, "$1_=" + (/* @__PURE__ */ new Date()).getTime()) : this.url += (/\?/.test(this.url) ? "&" : "?") + "_=" + (/* @__PURE__ */ new Date()).getTime();
|
|
8143
8143
|
}
|
|
8144
8144
|
}
|
|
8145
8145
|
function y(x) {
|
|
8146
|
-
var
|
|
8146
|
+
var O = new FormData();
|
|
8147
8147
|
return x.trim().split("&").forEach(function(R) {
|
|
8148
8148
|
if (R) {
|
|
8149
8149
|
var j = R.split("="), F = j.shift().replace(/\+/g, " "), $ = j.join("=").replace(/\+/g, " ");
|
|
8150
|
-
|
|
8150
|
+
O.append(decodeURIComponent(F), decodeURIComponent($));
|
|
8151
8151
|
}
|
|
8152
|
-
}),
|
|
8152
|
+
}), O;
|
|
8153
8153
|
}
|
|
8154
|
-
function m(x,
|
|
8154
|
+
function m(x, O) {
|
|
8155
8155
|
if (!(this instanceof m)) throw new TypeError('Please use the "new" operator, this DOM object constructor cannot be called as a function.');
|
|
8156
|
-
if (
|
|
8157
|
-
this.ok = this.status >= 200 && this.status < 300, this.statusText =
|
|
8156
|
+
if (O || (O = {}), this.type = "default", this.status = O.status === void 0 ? 200 : O.status, this.status < 200 || this.status > 599) throw new RangeError("Failed to construct 'Response': The status provided (0) is outside the range [200, 599].");
|
|
8157
|
+
this.ok = this.status >= 200 && this.status < 300, this.statusText = O.statusText === void 0 ? "" : "" + O.statusText, this.headers = new A(O.headers), this.url = O.url || "", this._initBody(x);
|
|
8158
8158
|
}
|
|
8159
8159
|
h.prototype.clone = function() {
|
|
8160
8160
|
return new h(this, { body: this._bodyInit });
|
|
@@ -8165,29 +8165,29 @@ var Ra = { exports: {} };
|
|
|
8165
8165
|
return x.ok = !1, x.status = 0, x.type = "error", x;
|
|
8166
8166
|
};
|
|
8167
8167
|
var l = [301, 302, 303, 307, 308];
|
|
8168
|
-
m.redirect = function(x,
|
|
8169
|
-
if (l.indexOf(
|
|
8170
|
-
return new m(null, { status:
|
|
8168
|
+
m.redirect = function(x, O) {
|
|
8169
|
+
if (l.indexOf(O) === -1) throw new RangeError("Invalid status code");
|
|
8170
|
+
return new m(null, { status: O, headers: { location: x } });
|
|
8171
8171
|
}, a.DOMException = o.DOMException;
|
|
8172
8172
|
try {
|
|
8173
8173
|
new a.DOMException();
|
|
8174
8174
|
} catch {
|
|
8175
|
-
a.DOMException = function(
|
|
8176
|
-
this.message =
|
|
8177
|
-
var j = Error(
|
|
8175
|
+
a.DOMException = function(O, R) {
|
|
8176
|
+
this.message = O, this.name = R;
|
|
8177
|
+
var j = Error(O);
|
|
8178
8178
|
this.stack = j.stack;
|
|
8179
8179
|
}, a.DOMException.prototype = Object.create(Error.prototype), a.DOMException.prototype.constructor = a.DOMException;
|
|
8180
8180
|
}
|
|
8181
|
-
function g(x,
|
|
8181
|
+
function g(x, O) {
|
|
8182
8182
|
return new Promise(function(R, j) {
|
|
8183
|
-
var F = new h(x,
|
|
8183
|
+
var F = new h(x, O);
|
|
8184
8184
|
if (F.signal && F.signal.aborted) return j(new a.DOMException("Aborted", "AbortError"));
|
|
8185
8185
|
var $ = new XMLHttpRequest();
|
|
8186
8186
|
function V() {
|
|
8187
8187
|
$.abort();
|
|
8188
8188
|
}
|
|
8189
8189
|
if ($.onload = function() {
|
|
8190
|
-
var U, G,
|
|
8190
|
+
var U, G, Nt = { statusText: $.statusText, headers: (U = $.getAllResponseHeaders() || "", G = new A(), U.replace(/\r?\n[\t ]+/g, " ").split("\r").map(function(gt) {
|
|
8191
8191
|
return gt.indexOf(`
|
|
8192
8192
|
`) === 0 ? gt.substr(1, gt.length) : gt;
|
|
8193
8193
|
}).forEach(function(gt) {
|
|
@@ -8201,10 +8201,10 @@ var Ra = { exports: {} };
|
|
|
8201
8201
|
}
|
|
8202
8202
|
}
|
|
8203
8203
|
}), G) };
|
|
8204
|
-
F.url.indexOf("file://") === 0 && ($.status < 200 || $.status > 599) ?
|
|
8204
|
+
F.url.indexOf("file://") === 0 && ($.status < 200 || $.status > 599) ? Nt.status = 200 : Nt.status = $.status, Nt.url = "responseURL" in $ ? $.responseURL : Nt.headers.get("X-Request-URL");
|
|
8205
8205
|
var dt = "response" in $ ? $.response : $.responseText;
|
|
8206
8206
|
setTimeout(function() {
|
|
8207
|
-
R(new m(dt,
|
|
8207
|
+
R(new m(dt, Nt));
|
|
8208
8208
|
}, 0);
|
|
8209
8209
|
}, $.onerror = function() {
|
|
8210
8210
|
setTimeout(function() {
|
|
@@ -8224,10 +8224,10 @@ var Ra = { exports: {} };
|
|
|
8224
8224
|
} catch {
|
|
8225
8225
|
return U;
|
|
8226
8226
|
}
|
|
8227
|
-
}(F.url), !0), F.credentials === "include" ? $.withCredentials = !0 : F.credentials === "omit" && ($.withCredentials = !1), "responseType" in $ && (u ? $.responseType = "blob" : w && ($.responseType = "arraybuffer")),
|
|
8227
|
+
}(F.url), !0), F.credentials === "include" ? $.withCredentials = !0 : F.credentials === "omit" && ($.withCredentials = !1), "responseType" in $ && (u ? $.responseType = "blob" : w && ($.responseType = "arraybuffer")), O && typeof O.headers == "object" && !(O.headers instanceof A || o.Headers && O.headers instanceof o.Headers)) {
|
|
8228
8228
|
var D = [];
|
|
8229
|
-
Object.getOwnPropertyNames(
|
|
8230
|
-
D.push(E(U)), $.setRequestHeader(U, _(
|
|
8229
|
+
Object.getOwnPropertyNames(O.headers).forEach(function(U) {
|
|
8230
|
+
D.push(E(U)), $.setRequestHeader(U, _(O.headers[U]));
|
|
8231
8231
|
}), F.headers.forEach(function(U, G) {
|
|
8232
8232
|
D.indexOf(G) === -1 && $.setRequestHeader(G, U);
|
|
8233
8233
|
});
|
|
@@ -8488,11 +8488,11 @@ class p3 extends h3 {
|
|
|
8488
8488
|
}
|
|
8489
8489
|
const m3 = Gf(() => new p3()), xd = BigInt(0), ws = BigInt(1), b3 = BigInt(2);
|
|
8490
8490
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
8491
|
-
function
|
|
8491
|
+
function Nn(e) {
|
|
8492
8492
|
return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
|
|
8493
8493
|
}
|
|
8494
8494
|
function Xi(e) {
|
|
8495
|
-
if (!
|
|
8495
|
+
if (!Nn(e)) throw new Error("Uint8Array expected");
|
|
8496
8496
|
}
|
|
8497
8497
|
const g3 = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
|
|
8498
8498
|
function ai(e) {
|
|
@@ -8548,7 +8548,7 @@ function br(e, t, r) {
|
|
|
8548
8548
|
throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
|
|
8549
8549
|
}
|
|
8550
8550
|
else {
|
|
8551
|
-
if (!
|
|
8551
|
+
if (!Nn(t)) throw new Error(`${e} must be hex string or Uint8Array`);
|
|
8552
8552
|
n = Uint8Array.from(t);
|
|
8553
8553
|
}
|
|
8554
8554
|
const i = n.length;
|
|
@@ -8595,7 +8595,7 @@ function M1(e, t, r) {
|
|
|
8595
8595
|
return a(), w;
|
|
8596
8596
|
};
|
|
8597
8597
|
}
|
|
8598
|
-
const _3 = { bigint: (e) => typeof e == "bigint", function: (e) => typeof e == "function", boolean: (e) => typeof e == "boolean", string: (e) => typeof e == "string", stringOrUint8Array: (e) => typeof e == "string" ||
|
|
8598
|
+
const _3 = { bigint: (e) => typeof e == "bigint", function: (e) => typeof e == "function", boolean: (e) => typeof e == "boolean", string: (e) => typeof e == "string", stringOrUint8Array: (e) => typeof e == "string" || Nn(e), isSafeInteger: (e) => Number.isSafeInteger(e), array: (e) => Array.isArray(e), field: (e, t) => t.Fp.isValid(e), hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen) };
|
|
8599
8599
|
function Wi(e, t, r = {}) {
|
|
8600
8600
|
const n = (i, s, a) => {
|
|
8601
8601
|
const o = _3[s];
|
|
@@ -8620,7 +8620,7 @@ const x3 = Object.freeze(Object.defineProperty({ __proto__: null, abytes: Xi, bi
|
|
|
8620
8620
|
let r = 0;
|
|
8621
8621
|
for (let n = 0; n < e.length; n++) r |= e[n] ^ t[n];
|
|
8622
8622
|
return r === 0;
|
|
8623
|
-
}, hexToBytes: ci, hexToNumber: ic, isBytes:
|
|
8623
|
+
}, hexToBytes: ci, hexToNumber: ic, isBytes: Nn, numberToBytesBE: Xn, numberToBytesLE: oc, numberToHexUnpadded: Sd, numberToVarBytesBE: function(e) {
|
|
8624
8624
|
return ci(Sd(e));
|
|
8625
8625
|
}, utf8ToBytes: function(e) {
|
|
8626
8626
|
if (typeof e != "string") throw new Error("utf8ToBytes expected string, got " + typeof e);
|
|
@@ -8643,7 +8643,7 @@ function ar(e, t, r) {
|
|
|
8643
8643
|
for (; t-- > Le; ) n *= n, n %= r;
|
|
8644
8644
|
return n;
|
|
8645
8645
|
}
|
|
8646
|
-
function
|
|
8646
|
+
function Na(e, t) {
|
|
8647
8647
|
if (e === Le || t <= Le) throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
|
|
8648
8648
|
let r = Ge(e, t), n = t, i = Le, s = Ae;
|
|
8649
8649
|
for (; r !== Le; ) {
|
|
@@ -8709,7 +8709,7 @@ function I1(e) {
|
|
|
8709
8709
|
const t = e.toString(2).length;
|
|
8710
8710
|
return Math.ceil(t / 8);
|
|
8711
8711
|
}
|
|
8712
|
-
function
|
|
8712
|
+
function Nd(e) {
|
|
8713
8713
|
const t = I1(e);
|
|
8714
8714
|
return t + Math.ceil(t / 2);
|
|
8715
8715
|
}
|
|
@@ -8748,7 +8748,7 @@ const { bytesToNumberBE: I3, hexToBytes: T3 } = x3, Sn = { Err: class extends Er
|
|
|
8748
8748
|
return `30${r(a + s + 4)}02${c}${i}02${o}${n}`;
|
|
8749
8749
|
} }, Fr = BigInt(0), fr = BigInt(1);
|
|
8750
8750
|
BigInt(2);
|
|
8751
|
-
const
|
|
8751
|
+
const Od = BigInt(3);
|
|
8752
8752
|
function R3(e) {
|
|
8753
8753
|
const t = function(S) {
|
|
8754
8754
|
const E = T1(S);
|
|
@@ -8780,7 +8780,7 @@ function R3(e) {
|
|
|
8780
8780
|
function c(S) {
|
|
8781
8781
|
const { allowedPrivateKeyLengths: E, nByteLength: _, wrapPrivateKey: k, n: A } = t;
|
|
8782
8782
|
if (E && typeof S != "bigint") {
|
|
8783
|
-
if (
|
|
8783
|
+
if (Nn(S) && (S = ai(S)), typeof S != "string" || !E.includes(S.length)) throw new Error("Invalid key");
|
|
8784
8784
|
S = S.padStart(2 * _, "0");
|
|
8785
8785
|
}
|
|
8786
8786
|
let P;
|
|
@@ -8846,26 +8846,26 @@ function R3(e) {
|
|
|
8846
8846
|
}
|
|
8847
8847
|
equals(E) {
|
|
8848
8848
|
u(E);
|
|
8849
|
-
const { px: _, py: k, pz: A } = this, { px: P, py: I, pz:
|
|
8849
|
+
const { px: _, py: k, pz: A } = this, { px: P, py: I, pz: N } = E, z = r.eql(r.mul(_, N), r.mul(P, A)), B = r.eql(r.mul(k, N), r.mul(I, A));
|
|
8850
8850
|
return z && B;
|
|
8851
8851
|
}
|
|
8852
8852
|
negate() {
|
|
8853
8853
|
return new p(this.px, r.neg(this.py), this.pz);
|
|
8854
8854
|
}
|
|
8855
8855
|
double() {
|
|
8856
|
-
const { a: E, b: _ } = t, k = r.mul(_,
|
|
8857
|
-
let
|
|
8858
|
-
return m = r.add(m, m), B = r.mul(A, I), B = r.add(B, B),
|
|
8856
|
+
const { a: E, b: _ } = t, k = r.mul(_, Od), { px: A, py: P, pz: I } = this;
|
|
8857
|
+
let N = r.ZERO, z = r.ZERO, B = r.ZERO, d = r.mul(A, A), h = r.mul(P, P), y = r.mul(I, I), m = r.mul(A, P);
|
|
8858
|
+
return m = r.add(m, m), B = r.mul(A, I), B = r.add(B, B), N = r.mul(E, B), z = r.mul(k, y), z = r.add(N, z), N = r.sub(h, z), z = r.add(h, z), z = r.mul(N, z), N = r.mul(m, N), B = r.mul(k, B), y = r.mul(E, y), m = r.sub(d, y), m = r.mul(E, m), m = r.add(m, B), B = r.add(d, d), d = r.add(B, d), d = r.add(d, y), d = r.mul(d, m), z = r.add(z, d), y = r.mul(P, I), y = r.add(y, y), d = r.mul(y, m), N = r.sub(N, d), B = r.mul(y, h), B = r.add(B, B), B = r.add(B, B), new p(N, z, B);
|
|
8859
8859
|
}
|
|
8860
8860
|
add(E) {
|
|
8861
8861
|
u(E);
|
|
8862
|
-
const { px: _, py: k, pz: A } = this, { px: P, py: I, pz:
|
|
8862
|
+
const { px: _, py: k, pz: A } = this, { px: P, py: I, pz: N } = E;
|
|
8863
8863
|
let z = r.ZERO, B = r.ZERO, d = r.ZERO;
|
|
8864
|
-
const h = t.a, y = r.mul(t.b,
|
|
8865
|
-
let m = r.mul(_, P), l = r.mul(k, I), g = r.mul(A,
|
|
8866
|
-
x = r.mul(x,
|
|
8867
|
-
let R = r.add(P,
|
|
8868
|
-
return
|
|
8864
|
+
const h = t.a, y = r.mul(t.b, Od);
|
|
8865
|
+
let m = r.mul(_, P), l = r.mul(k, I), g = r.mul(A, N), x = r.add(_, k), O = r.add(P, I);
|
|
8866
|
+
x = r.mul(x, O), O = r.add(m, l), x = r.sub(x, O), O = r.add(_, A);
|
|
8867
|
+
let R = r.add(P, N);
|
|
8868
|
+
return O = r.mul(O, R), R = r.add(m, g), O = r.sub(O, R), R = r.add(k, A), z = r.add(I, N), R = r.mul(R, z), z = r.add(l, g), R = r.sub(R, z), d = r.mul(h, O), z = r.mul(y, g), d = r.add(z, d), z = r.sub(l, d), d = r.add(l, d), B = r.mul(z, d), l = r.add(m, m), l = r.add(l, m), g = r.mul(h, g), O = r.mul(y, O), l = r.add(l, g), g = r.sub(m, g), g = r.mul(h, g), O = r.add(O, g), m = r.mul(l, O), B = r.add(B, m), m = r.mul(R, O), z = r.mul(x, z), z = r.sub(z, m), m = r.mul(x, l), d = r.mul(R, d), d = r.add(d, m), new p(z, B, d);
|
|
8869
8869
|
}
|
|
8870
8870
|
subtract(E) {
|
|
8871
8871
|
return this.add(E.negate());
|
|
@@ -8885,8 +8885,8 @@ function R3(e) {
|
|
|
8885
8885
|
if (o(E), E === fr) return this;
|
|
8886
8886
|
const { endo: k } = t;
|
|
8887
8887
|
if (!k) return v.unsafeLadder(this, E);
|
|
8888
|
-
let { k1neg: A, k1: P, k2neg: I, k2:
|
|
8889
|
-
for (; P > Fr ||
|
|
8888
|
+
let { k1neg: A, k1: P, k2neg: I, k2: N } = k.splitScalar(E), z = _, B = _, d = this;
|
|
8889
|
+
for (; P > Fr || N > Fr; ) P & fr && (z = z.add(d)), N & fr && (B = B.add(d)), d = d.double(), P >>= fr, N >>= fr;
|
|
8890
8890
|
return A && (z = z.negate()), I && (B = B.negate()), B = new p(r.mul(B.px, k.beta), B.py, B.pz), z.add(B);
|
|
8891
8891
|
}
|
|
8892
8892
|
multiply(E) {
|
|
@@ -8894,26 +8894,26 @@ function R3(e) {
|
|
|
8894
8894
|
let _, k, A = E;
|
|
8895
8895
|
const { endo: P } = t;
|
|
8896
8896
|
if (P) {
|
|
8897
|
-
const { k1neg: I, k1:
|
|
8898
|
-
let { p: d, f: h } = this.wNAF(
|
|
8897
|
+
const { k1neg: I, k1: N, k2neg: z, k2: B } = P.splitScalar(A);
|
|
8898
|
+
let { p: d, f: h } = this.wNAF(N), { p: y, f: m } = this.wNAF(B);
|
|
8899
8899
|
d = v.constTimeNegate(I, d), y = v.constTimeNegate(z, y), y = new p(r.mul(y.px, P.beta), y.py, y.pz), _ = d.add(y), k = h.add(m);
|
|
8900
8900
|
} else {
|
|
8901
|
-
const { p: I, f:
|
|
8902
|
-
_ = I, k =
|
|
8901
|
+
const { p: I, f: N } = this.wNAF(A);
|
|
8902
|
+
_ = I, k = N;
|
|
8903
8903
|
}
|
|
8904
8904
|
return p.normalizeZ([_, k])[0];
|
|
8905
8905
|
}
|
|
8906
8906
|
multiplyAndAddUnsafe(E, _, k) {
|
|
8907
|
-
const A = p.BASE, P = (
|
|
8907
|
+
const A = p.BASE, P = (N, z) => z !== Fr && z !== fr && N.equals(A) ? N.multiply(z) : N.multiplyUnsafe(z), I = P(this, _).add(P(E, k));
|
|
8908
8908
|
return I.is0() ? void 0 : I;
|
|
8909
8909
|
}
|
|
8910
8910
|
toAffine(E) {
|
|
8911
8911
|
const { px: _, py: k, pz: A } = this, P = this.is0();
|
|
8912
8912
|
E == null && (E = P ? r.ONE : r.inv(A));
|
|
8913
|
-
const I = r.mul(_, E),
|
|
8913
|
+
const I = r.mul(_, E), N = r.mul(k, E), z = r.mul(A, E);
|
|
8914
8914
|
if (P) return { x: r.ZERO, y: r.ZERO };
|
|
8915
8915
|
if (!r.eql(z, r.ONE)) throw new Error("invZ was invalid");
|
|
8916
|
-
return { x: I, y:
|
|
8916
|
+
return { x: I, y: N };
|
|
8917
8917
|
}
|
|
8918
8918
|
isTorsionFree() {
|
|
8919
8919
|
const { h: E, isTorsionFree: _ } = t;
|
|
@@ -8939,39 +8939,39 @@ function R3(e) {
|
|
|
8939
8939
|
return A ? I : P;
|
|
8940
8940
|
}, k = (A) => ({ windows: Math.ceil(E / A) + 1, windowSize: 2 ** (A - 1) });
|
|
8941
8941
|
return { constTimeNegate: _, unsafeLadder(A, P) {
|
|
8942
|
-
let I = S.ZERO,
|
|
8943
|
-
for (; P > E3; ) P & To && (I = I.add(
|
|
8942
|
+
let I = S.ZERO, N = A;
|
|
8943
|
+
for (; P > E3; ) P & To && (I = I.add(N)), N = N.double(), P >>= To;
|
|
8944
8944
|
return I;
|
|
8945
8945
|
}, precomputeWindow(A, P) {
|
|
8946
|
-
const { windows: I, windowSize:
|
|
8946
|
+
const { windows: I, windowSize: N } = k(P), z = [];
|
|
8947
8947
|
let B = A, d = B;
|
|
8948
8948
|
for (let h = 0; h < I; h++) {
|
|
8949
8949
|
d = B, z.push(d);
|
|
8950
|
-
for (let y = 1; y <
|
|
8950
|
+
for (let y = 1; y < N; y++) d = d.add(B), z.push(d);
|
|
8951
8951
|
B = d.double();
|
|
8952
8952
|
}
|
|
8953
8953
|
return z;
|
|
8954
8954
|
}, wNAF(A, P, I) {
|
|
8955
|
-
const { windows:
|
|
8955
|
+
const { windows: N, windowSize: z } = k(A);
|
|
8956
8956
|
let B = S.ZERO, d = S.BASE;
|
|
8957
8957
|
const h = BigInt(2 ** A - 1), y = 2 ** A, m = BigInt(A);
|
|
8958
|
-
for (let l = 0; l <
|
|
8958
|
+
for (let l = 0; l < N; l++) {
|
|
8959
8959
|
const g = l * z;
|
|
8960
8960
|
let x = Number(I & h);
|
|
8961
8961
|
I >>= m, x > z && (x -= y, I += To);
|
|
8962
|
-
const
|
|
8963
|
-
x === 0 ? d = d.add(_(j, P[
|
|
8962
|
+
const O = g, R = g + Math.abs(x) - 1, j = l % 2 != 0, F = x < 0;
|
|
8963
|
+
x === 0 ? d = d.add(_(j, P[O])) : B = B.add(_(F, P[R]));
|
|
8964
8964
|
}
|
|
8965
8965
|
return { p: B, f: d };
|
|
8966
|
-
}, wNAFCached(A, P, I,
|
|
8966
|
+
}, wNAFCached(A, P, I, N) {
|
|
8967
8967
|
const z = A._WINDOW_SIZE || 1;
|
|
8968
8968
|
let B = P.get(A);
|
|
8969
|
-
return B || (B = this.precomputeWindow(A, z), z !== 1 && P.set(A,
|
|
8969
|
+
return B || (B = this.precomputeWindow(A, z), z !== 1 && P.set(A, N(B))), this.wNAF(z, B, I);
|
|
8970
8970
|
} };
|
|
8971
8971
|
}(p, t.endo ? Math.ceil(w / 2) : w);
|
|
8972
8972
|
return { CURVE: t, ProjectivePoint: p, normPrivateKeyToScalar: c, weierstrassEquation: s, isWithinCurveOrder: a };
|
|
8973
8973
|
}
|
|
8974
|
-
function
|
|
8974
|
+
function N3(e) {
|
|
8975
8975
|
const t = function(h) {
|
|
8976
8976
|
const y = T1(h);
|
|
8977
8977
|
return Wi(y, { hash: "hash", hmac: "function", randomBytes: "function" }, { bits2int: "function", bits2int_modN: "function", lowS: "boolean" }), Object.freeze({ lowS: !0, ...y });
|
|
@@ -8980,7 +8980,7 @@ function C3(e) {
|
|
|
8980
8980
|
return Ge(h, n);
|
|
8981
8981
|
}
|
|
8982
8982
|
function o(h) {
|
|
8983
|
-
return
|
|
8983
|
+
return Na(h, n);
|
|
8984
8984
|
}
|
|
8985
8985
|
const { ProjectivePoint: c, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: p } = R3({ ...t, toBytes(h, y, m) {
|
|
8986
8986
|
const l = y.toAffine(), g = r.toBytes(l.x), x = Ki;
|
|
@@ -8995,10 +8995,10 @@ function C3(e) {
|
|
|
8995
8995
|
{
|
|
8996
8996
|
const x = xn(l);
|
|
8997
8997
|
if (!(Fr < (g = x) && g < r.ORDER)) throw new Error("Point is not on curve");
|
|
8998
|
-
const
|
|
8998
|
+
const O = u(x);
|
|
8999
8999
|
let R;
|
|
9000
9000
|
try {
|
|
9001
|
-
R = r.sqrt(
|
|
9001
|
+
R = r.sqrt(O);
|
|
9002
9002
|
} catch (j) {
|
|
9003
9003
|
const F = j instanceof Error ? ": " + j.message : "";
|
|
9004
9004
|
throw new Error("Point is not on curve" + F);
|
|
@@ -9033,9 +9033,9 @@ function C3(e) {
|
|
|
9033
9033
|
recoverPublicKey(y) {
|
|
9034
9034
|
const { r: m, s: l, recovery: g } = this, x = P(br("msgHash", y));
|
|
9035
9035
|
if (g == null || ![0, 1, 2, 3].includes(g)) throw new Error("recovery id invalid");
|
|
9036
|
-
const
|
|
9037
|
-
if (
|
|
9038
|
-
const R = 1 & g ? "03" : "02", j = c.fromHex(R + w(
|
|
9036
|
+
const O = g === 2 || g === 3 ? m + t.n : m;
|
|
9037
|
+
if (O >= r.ORDER) throw new Error("recovery id 2 or 3 invalid");
|
|
9038
|
+
const R = 1 & g ? "03" : "02", j = c.fromHex(R + w(O)), F = o(O), $ = a(-x * F), V = a(l * F), D = c.BASE.multiplyAndAddUnsafe(j, $, V);
|
|
9039
9039
|
if (!D) throw new Error("point at infinify");
|
|
9040
9040
|
return D.assertValidity(), D;
|
|
9041
9041
|
}
|
|
@@ -9065,16 +9065,16 @@ function C3(e) {
|
|
|
9065
9065
|
return !1;
|
|
9066
9066
|
}
|
|
9067
9067
|
}, normPrivateKeyToScalar: f, randomPrivateKey: () => {
|
|
9068
|
-
const h =
|
|
9068
|
+
const h = Nd(t.n);
|
|
9069
9069
|
return function(y, m, l = !1) {
|
|
9070
|
-
const g = y.length, x = I1(m),
|
|
9071
|
-
if (g < 16 || g <
|
|
9070
|
+
const g = y.length, x = I1(m), O = Nd(m);
|
|
9071
|
+
if (g < 16 || g < O || g > 1024) throw new Error(`expected ${O}-1024 bytes of input, got ${g}`);
|
|
9072
9072
|
const R = Ge(l ? xn(y) : sc(y), m - Ae) + Ae;
|
|
9073
9073
|
return l ? oc(R, x) : Xn(R, x);
|
|
9074
9074
|
}(t.randomBytes(h), t.n);
|
|
9075
9075
|
}, precompute: (h = 8, y = c.BASE) => (y._setWindowSize(h), y.multiply(BigInt(3)), y) };
|
|
9076
9076
|
function k(h) {
|
|
9077
|
-
const y =
|
|
9077
|
+
const y = Nn(h), m = typeof h == "string", l = (y || m) && h.length;
|
|
9078
9078
|
return y ? l === i || l === s : m ? l === 2 * i || l === 2 * s : h instanceof c;
|
|
9079
9079
|
}
|
|
9080
9080
|
const A = t.bits2int || function(h) {
|
|
@@ -9083,7 +9083,7 @@ function C3(e) {
|
|
|
9083
9083
|
}, P = t.bits2int_modN || function(h) {
|
|
9084
9084
|
return a(A(h));
|
|
9085
9085
|
}, I = ac(t.nBitLength);
|
|
9086
|
-
function
|
|
9086
|
+
function N(h) {
|
|
9087
9087
|
if (typeof h != "bigint") throw new Error("bigint expected");
|
|
9088
9088
|
if (!(Fr <= h && h < I)) throw new Error(`bigint expected < 2^${t.nBitLength}`);
|
|
9089
9089
|
return Xn(h, t.nByteLength);
|
|
@@ -9091,9 +9091,9 @@ function C3(e) {
|
|
|
9091
9091
|
function z(h, y, m = B) {
|
|
9092
9092
|
if (["recovered", "canonical"].some((U) => U in m)) throw new Error("sign() legacy options not supported");
|
|
9093
9093
|
const { hash: l, randomBytes: g } = t;
|
|
9094
|
-
let { lowS: x, prehash:
|
|
9095
|
-
x == null && (x = !0), h = br("msgHash", h),
|
|
9096
|
-
const j = P(h), F = f(y), $ = [
|
|
9094
|
+
let { lowS: x, prehash: O, extraEntropy: R } = m;
|
|
9095
|
+
x == null && (x = !0), h = br("msgHash", h), O && (h = br("prehashed msgHash", l(h)));
|
|
9096
|
+
const j = P(h), F = f(y), $ = [N(F), N(j)];
|
|
9097
9097
|
if (R != null && R !== !1) {
|
|
9098
9098
|
const U = R === !0 ? g(r.BYTES) : R;
|
|
9099
9099
|
$.push(br("extraEntropy", U));
|
|
@@ -9102,9 +9102,9 @@ function C3(e) {
|
|
|
9102
9102
|
return { seed: V, k2sig: function(U) {
|
|
9103
9103
|
const G = A(U);
|
|
9104
9104
|
if (!p(G)) return;
|
|
9105
|
-
const
|
|
9105
|
+
const Nt = o(G), dt = c.BASE.multiply(G).toAffine(), gt = a(dt.x);
|
|
9106
9106
|
if (gt === Fr) return;
|
|
9107
|
-
const Ft = a(
|
|
9107
|
+
const Ft = a(Nt * a(D + gt * F));
|
|
9108
9108
|
if (Ft === Fr) return;
|
|
9109
9109
|
let mt = (dt.x === gt ? 0 : 2) | Number(dt.y & fr), Mt = Ft;
|
|
9110
9110
|
return x && v(Ft) && (Mt = function(Zt) {
|
|
@@ -9126,10 +9126,10 @@ function C3(e) {
|
|
|
9126
9126
|
var dt;
|
|
9127
9127
|
const g = h;
|
|
9128
9128
|
if (y = br("msgHash", y), m = br("publicKey", m), "strict" in l) throw new Error("options.strict was renamed to lowS");
|
|
9129
|
-
const { lowS: x, prehash:
|
|
9129
|
+
const { lowS: x, prehash: O } = l;
|
|
9130
9130
|
let R, j;
|
|
9131
9131
|
try {
|
|
9132
|
-
if (typeof g == "string" ||
|
|
9132
|
+
if (typeof g == "string" || Nn(g)) try {
|
|
9133
9133
|
R = E.fromDER(g);
|
|
9134
9134
|
} catch (gt) {
|
|
9135
9135
|
if (!(gt instanceof Sn.Err)) throw gt;
|
|
@@ -9148,13 +9148,13 @@ function C3(e) {
|
|
|
9148
9148
|
return !1;
|
|
9149
9149
|
}
|
|
9150
9150
|
if (x && R.hasHighS()) return !1;
|
|
9151
|
-
|
|
9152
|
-
const { r: F, s: $ } = R, V = P(y), D = o($), U = a(V * D), G = a(F * D),
|
|
9153
|
-
return !!
|
|
9151
|
+
O && (y = t.hash(y));
|
|
9152
|
+
const { r: F, s: $ } = R, V = P(y), D = o($), U = a(V * D), G = a(F * D), Nt = (dt = c.BASE.multiplyAndAddUnsafe(j, U, G)) == null ? void 0 : dt.toAffine();
|
|
9153
|
+
return !!Nt && a(Nt.x) === F;
|
|
9154
9154
|
}, ProjectivePoint: c, Signature: E, utils: _ };
|
|
9155
9155
|
}
|
|
9156
9156
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
9157
|
-
function
|
|
9157
|
+
function O3(e) {
|
|
9158
9158
|
return { hash: e, hmac: (t, ...r) => k1(e, t, function(...n) {
|
|
9159
9159
|
let i = 0;
|
|
9160
9160
|
for (let a = 0; a < n.length; a++) {
|
|
@@ -9171,7 +9171,7 @@ function N3(e) {
|
|
|
9171
9171
|
}
|
|
9172
9172
|
BigInt(4);
|
|
9173
9173
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
9174
|
-
const
|
|
9174
|
+
const Cd = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Bd = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), C3 = BigInt(1), Oa = BigInt(2), Pd = (e, t) => (e + t / Oa) / t, Ca = function(e, t, r = !1, n = {}) {
|
|
9175
9175
|
if (e <= Le) throw new Error(`Expected Field ORDER > 0, got ${e}`);
|
|
9176
9176
|
const { nBitLength: i, nByteLength: s } = E1(e, t);
|
|
9177
9177
|
if (s > 2048) throw new Error("Field lengths over 2048 bytes are not supported");
|
|
@@ -9185,7 +9185,7 @@ const Od = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefff
|
|
|
9185
9185
|
let v = u.ONE, S = p;
|
|
9186
9186
|
for (; w > Le; ) w & Ae && (v = u.mul(v, S)), S = u.sqr(S), w >>= Ae;
|
|
9187
9187
|
return v;
|
|
9188
|
-
}(o, c, f), div: (c, f) => Ge(c *
|
|
9188
|
+
}(o, c, f), div: (c, f) => Ge(c * Na(f, e), e), sqrN: (c) => c * c, addN: (c, f) => c + f, subN: (c, f) => c - f, mulN: (c, f) => c * f, inv: (c) => Na(c, e), sqrt: n.sqrt || ((c) => a(o, c)), invertBatch: (c) => function(f, u) {
|
|
9189
9189
|
const p = new Array(u.length), w = u.reduce((S, E, _) => f.is0(E) ? S : (p[_] = S, f.mul(S, E)), f.ONE), v = f.inv(w);
|
|
9190
9190
|
return u.reduceRight((S, E, _) => f.is0(E) ? S : (p[_] = f.mul(S, p[_]), f.mul(S, E)), v), p;
|
|
9191
9191
|
}(o, c), cmov: (c, f, u) => u ? f : c, toBytes: (c) => r ? oc(c, s) : Xn(c, s), fromBytes: (c) => {
|
|
@@ -9193,15 +9193,15 @@ const Od = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefff
|
|
|
9193
9193
|
return r ? sc(c) : xn(c);
|
|
9194
9194
|
} });
|
|
9195
9195
|
return Object.freeze(o);
|
|
9196
|
-
}(
|
|
9197
|
-
const t =
|
|
9198
|
-
if (!
|
|
9196
|
+
}(Cd, void 0, void 0, { sqrt: function(e) {
|
|
9197
|
+
const t = Cd, r = BigInt(3), n = BigInt(6), i = BigInt(11), s = BigInt(22), a = BigInt(23), o = BigInt(44), c = BigInt(88), f = e * e * e % t, u = f * f * e % t, p = ar(u, r, t) * u % t, w = ar(p, r, t) * u % t, v = ar(w, Oa, t) * f % t, S = ar(v, i, t) * v % t, E = ar(S, s, t) * S % t, _ = ar(E, o, t) * E % t, k = ar(_, c, t) * _ % t, A = ar(k, o, t) * E % t, P = ar(A, r, t) * u % t, I = ar(P, a, t) * S % t, N = ar(I, n, t) * f % t, z = ar(N, Oa, t);
|
|
9198
|
+
if (!Ca.eql(Ca.sqr(z), e)) throw new Error("Cannot find square root");
|
|
9199
9199
|
return z;
|
|
9200
9200
|
} }), cc = function(e, t) {
|
|
9201
|
-
const r = (n) =>
|
|
9201
|
+
const r = (n) => N3({ ...e, ...O3(n) });
|
|
9202
9202
|
return Object.freeze({ ...r(t), create: r });
|
|
9203
|
-
}({ a: BigInt(0), b: BigInt(7), Fp:
|
|
9204
|
-
const t = Bd, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), n = -
|
|
9203
|
+
}({ a: BigInt(0), b: BigInt(7), Fp: Ca, n: Bd, Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"), Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"), h: BigInt(1), lowS: !0, endo: { beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"), splitScalar: (e) => {
|
|
9204
|
+
const t = Bd, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), n = -C3 * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = r, a = BigInt("0x100000000000000000000000000000000"), o = Pd(s * e, t), c = Pd(-n * e, t);
|
|
9205
9205
|
let f = Ge(e - o * r - c * i, t), u = Ge(-o * n - c * s, t);
|
|
9206
9206
|
const p = f > a, w = u > a;
|
|
9207
9207
|
if (p && (f = t - f), w && (u = t - u), f > a || u > a) throw new Error("splitScalar: Endomorphism failed, k=" + e);
|
|
@@ -9247,7 +9247,7 @@ function jn(e, t, r) {
|
|
|
9247
9247
|
}
|
|
9248
9248
|
function Hd(e) {
|
|
9249
9249
|
if (e[0] === 0) throw new Error("invalid RLP: extra zeros");
|
|
9250
|
-
return N1(
|
|
9250
|
+
return O1(N1(e));
|
|
9251
9251
|
}
|
|
9252
9252
|
function Dd(e, t) {
|
|
9253
9253
|
if (e < 56) return Uint8Array.from([e + t]);
|
|
@@ -9288,12 +9288,12 @@ function Ba(e) {
|
|
|
9288
9288
|
}
|
|
9289
9289
|
Object.defineProperty(qr, "__esModule", { value: !0 }), qr.RLP = qr.utils = qr.decode = qr.encode = void 0, qr.encode = dc, qr.decode = R1;
|
|
9290
9290
|
const P3 = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
|
|
9291
|
-
function
|
|
9291
|
+
function N1(e) {
|
|
9292
9292
|
let t = "";
|
|
9293
9293
|
for (let r = 0; r < e.length; r++) t += P3[e[r]];
|
|
9294
9294
|
return t;
|
|
9295
9295
|
}
|
|
9296
|
-
function
|
|
9296
|
+
function O1(e) {
|
|
9297
9297
|
const t = Number.parseInt(e, 16);
|
|
9298
9298
|
if (Number.isNaN(t)) throw new Error("Invalid byte sequence");
|
|
9299
9299
|
return t;
|
|
@@ -9304,7 +9304,7 @@ function Ls(e) {
|
|
|
9304
9304
|
const t = new Uint8Array(e.length / 2);
|
|
9305
9305
|
for (let r = 0; r < t.length; r++) {
|
|
9306
9306
|
const n = 2 * r;
|
|
9307
|
-
t[r] =
|
|
9307
|
+
t[r] = O1(e.slice(n, n + 2));
|
|
9308
9308
|
}
|
|
9309
9309
|
return t;
|
|
9310
9310
|
}
|
|
@@ -9317,7 +9317,7 @@ function Pa(...e) {
|
|
|
9317
9317
|
}
|
|
9318
9318
|
return r;
|
|
9319
9319
|
}
|
|
9320
|
-
function
|
|
9320
|
+
function C1(e) {
|
|
9321
9321
|
return new TextEncoder().encode(e);
|
|
9322
9322
|
}
|
|
9323
9323
|
function La(e) {
|
|
@@ -9330,40 +9330,40 @@ function Fd(e) {
|
|
|
9330
9330
|
}
|
|
9331
9331
|
function B1(e) {
|
|
9332
9332
|
if (e instanceof Uint8Array) return e;
|
|
9333
|
-
if (typeof e == "string") return Fd(e) ? Ls((t = typeof (r = e) != "string" ? r : Fd(r) ? r.slice(2) : r).length % 2 ? `0${t}` : t) :
|
|
9333
|
+
if (typeof e == "string") return Fd(e) ? Ls((t = typeof (r = e) != "string" ? r : Fd(r) ? r.slice(2) : r).length % 2 ? `0${t}` : t) : C1(e);
|
|
9334
9334
|
var t, r;
|
|
9335
9335
|
if (typeof e == "number" || typeof e == "bigint") return e ? Ls(La(e)) : Uint8Array.from([]);
|
|
9336
9336
|
if (e == null) return Uint8Array.from([]);
|
|
9337
9337
|
throw new Error("toBytes: received unsupported type " + typeof e);
|
|
9338
9338
|
}
|
|
9339
|
-
qr.utils = { bytesToHex:
|
|
9340
|
-
var
|
|
9339
|
+
qr.utils = { bytesToHex: N1, concatBytes: Pa, hexToBytes: Ls, utf8ToBytes: C1 }, qr.RLP = { encode: dc, decode: R1 };
|
|
9340
|
+
var No, P1 = {};
|
|
9341
9341
|
/*! crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */
|
|
9342
|
-
|
|
9342
|
+
No = function(e) {
|
|
9343
9343
|
e.version = "1.2.2";
|
|
9344
9344
|
var t = function() {
|
|
9345
9345
|
for (var A = 0, P = new Array(256), I = 0; I != 256; ++I) A = 1 & (A = 1 & (A = 1 & (A = 1 & (A = 1 & (A = 1 & (A = 1 & (A = 1 & (A = I) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1) ? -306674912 ^ A >>> 1 : A >>> 1, P[I] = A;
|
|
9346
9346
|
return typeof Int32Array < "u" ? new Int32Array(P) : P;
|
|
9347
9347
|
}(), r = function(A) {
|
|
9348
|
-
var P = 0, I = 0,
|
|
9349
|
-
for (
|
|
9350
|
-
for (
|
|
9348
|
+
var P = 0, I = 0, N = 0, z = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
|
|
9349
|
+
for (N = 0; N != 256; ++N) z[N] = A[N];
|
|
9350
|
+
for (N = 0; N != 256; ++N) for (I = A[N], P = 256 + N; P < 4096; P += 256) I = z[P] = I >>> 8 ^ A[255 & I];
|
|
9351
9351
|
var B = [];
|
|
9352
|
-
for (
|
|
9352
|
+
for (N = 1; N != 16; ++N) B[N - 1] = typeof Int32Array < "u" ? z.subarray(256 * N, 256 * N + 256) : z.slice(256 * N, 256 * N + 256);
|
|
9353
9353
|
return B;
|
|
9354
9354
|
}(t), n = r[0], i = r[1], s = r[2], a = r[3], o = r[4], c = r[5], f = r[6], u = r[7], p = r[8], w = r[9], v = r[10], S = r[11], E = r[12], _ = r[13], k = r[14];
|
|
9355
9355
|
e.table = t, e.bstr = function(A, P) {
|
|
9356
|
-
for (var I = -1 ^ P,
|
|
9356
|
+
for (var I = -1 ^ P, N = 0, z = A.length; N < z; ) I = I >>> 8 ^ t[255 & (I ^ A.charCodeAt(N++))];
|
|
9357
9357
|
return ~I;
|
|
9358
9358
|
}, e.buf = function(A, P) {
|
|
9359
|
-
for (var I = -1 ^ P,
|
|
9360
|
-
for (
|
|
9359
|
+
for (var I = -1 ^ P, N = A.length - 15, z = 0; z < N; ) I = k[A[z++] ^ 255 & I] ^ _[A[z++] ^ I >> 8 & 255] ^ E[A[z++] ^ I >> 16 & 255] ^ S[A[z++] ^ I >>> 24] ^ v[A[z++]] ^ w[A[z++]] ^ p[A[z++]] ^ u[A[z++]] ^ f[A[z++]] ^ c[A[z++]] ^ o[A[z++]] ^ a[A[z++]] ^ s[A[z++]] ^ i[A[z++]] ^ n[A[z++]] ^ t[A[z++]];
|
|
9360
|
+
for (N += 15; z < N; ) I = I >>> 8 ^ t[255 & (I ^ A[z++])];
|
|
9361
9361
|
return ~I;
|
|
9362
9362
|
}, e.str = function(A, P) {
|
|
9363
|
-
for (var I = -1 ^ P,
|
|
9363
|
+
for (var I = -1 ^ P, N = 0, z = A.length, B = 0, d = 0; N < z; ) (B = A.charCodeAt(N++)) < 128 ? I = I >>> 8 ^ t[255 & (I ^ B)] : B < 2048 ? I = (I = I >>> 8 ^ t[255 & (I ^ (192 | B >> 6 & 31))]) >>> 8 ^ t[255 & (I ^ (128 | 63 & B))] : B >= 55296 && B < 57344 ? (B = 64 + (1023 & B), d = 1023 & A.charCodeAt(N++), I = (I = (I = (I = I >>> 8 ^ t[255 & (I ^ (240 | B >> 8 & 7))]) >>> 8 ^ t[255 & (I ^ (128 | B >> 2 & 63))]) >>> 8 ^ t[255 & (I ^ (128 | d >> 6 & 15 | (3 & B) << 4))]) >>> 8 ^ t[255 & (I ^ (128 | 63 & d))]) : I = (I = (I = I >>> 8 ^ t[255 & (I ^ (224 | B >> 12 & 15))]) >>> 8 ^ t[255 & (I ^ (128 | B >> 6 & 63))]) >>> 8 ^ t[255 & (I ^ (128 | 63 & B))];
|
|
9364
9364
|
return ~I;
|
|
9365
9365
|
};
|
|
9366
|
-
},
|
|
9366
|
+
}, No(typeof DO_NOT_EXPORT_CRC > "u" ? P1 : {});
|
|
9367
9367
|
const L3 = di(P1), { buf: i5 } = L3;
|
|
9368
9368
|
var Zd;
|
|
9369
9369
|
(function(e) {
|
|
@@ -9668,7 +9668,7 @@ var H3 = function(e, t, r, n) {
|
|
|
9668
9668
|
c((n = n.apply(e, t || [])).next());
|
|
9669
9669
|
});
|
|
9670
9670
|
};
|
|
9671
|
-
const
|
|
9671
|
+
const Oe = (e) => e !== void 0 && e.trim().length > 0, D3 = [pt.DYMENSION_MAINNET, pt.DYMENSION_TESTNET, pt.KAVA_MAINNET, pt.CRONOS_MAINNET, pt.POLYGON_MAINNET];
|
|
9672
9672
|
class zs extends $1 {
|
|
9673
9673
|
constructor(t = pt.ETH_MAINNET, r = Rr.HTTPS, n = "", i) {
|
|
9674
9674
|
super(t, r, "", n, i);
|
|
@@ -9699,31 +9699,31 @@ zs.networkHostMap = { [pt.POLYGON_AMOY]: "polygon-amoy-bor-rpc", [pt.DYMENSION_M
|
|
|
9699
9699
|
let i = "", s = "";
|
|
9700
9700
|
switch (e) {
|
|
9701
9701
|
case pt.ETH_MAINNET:
|
|
9702
|
-
i =
|
|
9702
|
+
i = Oe(n) ? n : "powerful-holy-bush.quiknode.pro", s = Oe(r) ? r : "3240624a343867035925ff7561eb60dfdba2a668";
|
|
9703
9703
|
break;
|
|
9704
9704
|
case pt.ETH_SEPOLIA:
|
|
9705
|
-
i =
|
|
9705
|
+
i = Oe(n) ? n : "dimensional-fabled-glitter.ethereum-sepolia.quiknode.pro", s = Oe(r) ? r : "382a3b5a4b938f2d6e8686c19af4b22921fde2cd";
|
|
9706
9706
|
break;
|
|
9707
9707
|
case pt.ETH_HOLESKY:
|
|
9708
|
-
i =
|
|
9708
|
+
i = Oe(n) ? n : "yolo-morning-card.ethereum-holesky.quiknode.pro", s = Oe(r) ? r : "481ebe70638c4dcf176af617a16d02ab866b9af9";
|
|
9709
9709
|
break;
|
|
9710
9710
|
case pt.ARBITRUM_MAINNET:
|
|
9711
|
-
i =
|
|
9711
|
+
i = Oe(n) ? n : "autumn-divine-dinghy.arbitrum-mainnet.quiknode.pro", s = Oe(r) ? r : "a5d7bfbf60b5ae9ce3628e53d69ef50d529e9a8c";
|
|
9712
9712
|
break;
|
|
9713
9713
|
case pt.ARBITRUM_SEPOLIA:
|
|
9714
|
-
i =
|
|
9714
|
+
i = Oe(n) ? n : "few-patient-pond.arbitrum-sepolia.quiknode.pro", s = Oe(r) ? r : "3be985450970628c860b959c65cd2642dcafe53c";
|
|
9715
9715
|
break;
|
|
9716
9716
|
case pt.BNB_MAINNET:
|
|
9717
|
-
i =
|
|
9717
|
+
i = Oe(n) ? n : "purple-empty-reel.bsc.quiknode.pro", s = Oe(r) ? r : "ebf6c532961e21f092ff2facce1ec4c89c540158";
|
|
9718
9718
|
break;
|
|
9719
9719
|
case pt.BNB_TESTNET:
|
|
9720
|
-
i =
|
|
9720
|
+
i = Oe(n) ? n : "floral-rough-scion.bsc-testnet.quiknode.pro", s = Oe(r) ? r : "5b297e5acff5f81f4c37ebf6f235f7299b6f9d28";
|
|
9721
9721
|
break;
|
|
9722
9722
|
case pt.POLYGON_MAINNET:
|
|
9723
|
-
i =
|
|
9723
|
+
i = Oe(n) ? n : "small-chaotic-moon.matic.quiknode.pro", s = Oe(r) ? r : "847569f8a017e84d985e10d0f44365d965a951f1";
|
|
9724
9724
|
break;
|
|
9725
9725
|
case pt.POLYGON_AMOY:
|
|
9726
|
-
i =
|
|
9726
|
+
i = Oe(n) ? n : "prettiest-side-shape.matic-amoy.quiknode.pro", s = Oe(r) ? r : "79a9476eea661d4f82de614db1d8a895b14b881c";
|
|
9727
9727
|
break;
|
|
9728
9728
|
default:
|
|
9729
9729
|
throw new Error("Network info not avalible.");
|
|
@@ -9754,183 +9754,183 @@ class F3 {
|
|
|
9754
9754
|
var za = { exports: {} };
|
|
9755
9755
|
(function(e) {
|
|
9756
9756
|
var t = function(T) {
|
|
9757
|
-
var
|
|
9758
|
-
if (T) for (
|
|
9757
|
+
var C, L = new Float64Array(16);
|
|
9758
|
+
if (T) for (C = 0; C < T.length; C++) L[C] = T[C];
|
|
9759
9759
|
return L;
|
|
9760
9760
|
}, r = function() {
|
|
9761
9761
|
throw new Error("no PRNG");
|
|
9762
9762
|
}, n = new Uint8Array(16), i = new Uint8Array(32);
|
|
9763
9763
|
i[0] = 9;
|
|
9764
9764
|
var s = t(), a = t([1]), o = t([56129, 1]), c = t([30883, 4953, 19914, 30187, 55467, 16705, 2637, 112, 59544, 30585, 16505, 36039, 65139, 11119, 27886, 20995]), f = t([61785, 9906, 39828, 60374, 45398, 33411, 5274, 224, 53552, 61171, 33010, 6542, 64743, 22239, 55772, 9222]), u = t([54554, 36645, 11616, 51542, 42930, 38181, 51040, 26924, 56412, 64982, 57905, 49316, 21502, 52590, 14035, 8553]), p = t([26200, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214]), w = t([41136, 18958, 6951, 50414, 58488, 44335, 6150, 12099, 55207, 15867, 153, 11085, 57099, 20417, 9344, 11139]);
|
|
9765
|
-
function v(T,
|
|
9766
|
-
T[
|
|
9765
|
+
function v(T, C, L, b) {
|
|
9766
|
+
T[C] = L >> 24 & 255, T[C + 1] = L >> 16 & 255, T[C + 2] = L >> 8 & 255, T[C + 3] = 255 & L, T[C + 4] = b >> 24 & 255, T[C + 5] = b >> 16 & 255, T[C + 6] = b >> 8 & 255, T[C + 7] = 255 & b;
|
|
9767
9767
|
}
|
|
9768
|
-
function S(T,
|
|
9768
|
+
function S(T, C, L, b, M) {
|
|
9769
9769
|
var H, Z = 0;
|
|
9770
|
-
for (H = 0; H < M; H++) Z |= T[
|
|
9770
|
+
for (H = 0; H < M; H++) Z |= T[C + H] ^ L[b + H];
|
|
9771
9771
|
return (1 & Z - 1 >>> 8) - 1;
|
|
9772
9772
|
}
|
|
9773
|
-
function E(T,
|
|
9774
|
-
return S(T,
|
|
9773
|
+
function E(T, C, L, b) {
|
|
9774
|
+
return S(T, C, L, b, 16);
|
|
9775
9775
|
}
|
|
9776
|
-
function _(T,
|
|
9777
|
-
return S(T,
|
|
9776
|
+
function _(T, C, L, b) {
|
|
9777
|
+
return S(T, C, L, b, 32);
|
|
9778
9778
|
}
|
|
9779
|
-
function k(T,
|
|
9779
|
+
function k(T, C, L, b) {
|
|
9780
9780
|
(function(M, H, Z, W) {
|
|
9781
|
-
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, vt = 255 & Z[0] | (255 & Z[1]) << 8 | (255 & Z[2]) << 16 | (255 & Z[3]) << 24, X = 255 & Z[4] | (255 & Z[5]) << 8 | (255 & Z[6]) << 16 | (255 & Z[7]) << 24, ct = 255 & Z[8] | (255 & Z[9]) << 8 | (255 & Z[10]) << 16 | (255 & Z[11]) << 24, _t = 255 & Z[12] | (255 & Z[13]) << 8 | (255 & Z[14]) << 16 | (255 & Z[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ut = 255 & H[0] | (255 & H[1]) << 8 | (255 & H[2]) << 16 | (255 & H[3]) << 24, St = 255 & H[4] | (255 & H[5]) << 8 | (255 & H[6]) << 16 | (255 & H[7]) << 24, ot = 255 & H[8] | (255 & H[9]) << 8 | (255 & H[10]) << 16 | (255 & H[11]) << 24, ht = 255 & H[12] | (255 & H[13]) << 8 | (255 & H[14]) << 16 | (255 & H[15]) << 24, At = 255 & W[8] | (255 & W[9]) << 8 | (255 & W[10]) << 16 | (255 & W[11]) << 24, it = 255 & Z[16] | (255 & Z[17]) << 8 | (255 & Z[18]) << 16 | (255 & Z[19]) << 24, lt = 255 & Z[20] | (255 & Z[21]) << 8 | (255 & Z[22]) << 16 | (255 & Z[23]) << 24, Lt = 255 & Z[24] | (255 & Z[25]) << 8 | (255 & Z[26]) << 16 | (255 & Z[27]) << 24, at = 255 & Z[28] | (255 & Z[29]) << 8 | (255 & Z[30]) << 16 | (255 & Z[31]) << 24, K = 255 & W[12] | (255 & W[13]) << 8 | (255 & W[14]) << 16 | (255 & W[15]) << 24, Q = Y, st = vt, tt = X, et = ct, rt = _t, Pt = nt, $t = ut, Bt = St, Kt = ot, Qt = ht, Xt = At, kt = it, Tt = lt, Rt = Lt,
|
|
9782
|
-
Q = Q + Y | 0, st = st + vt | 0, tt = tt + X | 0, et = et + ct | 0, rt = rt + _t | 0, Pt = Pt + nt | 0, $t = $t + ut | 0, Bt = Bt + St | 0, Kt = Kt + ot | 0, Qt = Qt + ht | 0, Xt = Xt + At | 0, kt = kt + it | 0, Tt = Tt + lt | 0, Rt = Rt + Lt | 0,
|
|
9783
|
-
})(T,
|
|
9781
|
+
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, vt = 255 & Z[0] | (255 & Z[1]) << 8 | (255 & Z[2]) << 16 | (255 & Z[3]) << 24, X = 255 & Z[4] | (255 & Z[5]) << 8 | (255 & Z[6]) << 16 | (255 & Z[7]) << 24, ct = 255 & Z[8] | (255 & Z[9]) << 8 | (255 & Z[10]) << 16 | (255 & Z[11]) << 24, _t = 255 & Z[12] | (255 & Z[13]) << 8 | (255 & Z[14]) << 16 | (255 & Z[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ut = 255 & H[0] | (255 & H[1]) << 8 | (255 & H[2]) << 16 | (255 & H[3]) << 24, St = 255 & H[4] | (255 & H[5]) << 8 | (255 & H[6]) << 16 | (255 & H[7]) << 24, ot = 255 & H[8] | (255 & H[9]) << 8 | (255 & H[10]) << 16 | (255 & H[11]) << 24, ht = 255 & H[12] | (255 & H[13]) << 8 | (255 & H[14]) << 16 | (255 & H[15]) << 24, At = 255 & W[8] | (255 & W[9]) << 8 | (255 & W[10]) << 16 | (255 & W[11]) << 24, it = 255 & Z[16] | (255 & Z[17]) << 8 | (255 & Z[18]) << 16 | (255 & Z[19]) << 24, lt = 255 & Z[20] | (255 & Z[21]) << 8 | (255 & Z[22]) << 16 | (255 & Z[23]) << 24, Lt = 255 & Z[24] | (255 & Z[25]) << 8 | (255 & Z[26]) << 16 | (255 & Z[27]) << 24, at = 255 & Z[28] | (255 & Z[29]) << 8 | (255 & Z[30]) << 16 | (255 & Z[31]) << 24, K = 255 & W[12] | (255 & W[13]) << 8 | (255 & W[14]) << 16 | (255 & W[15]) << 24, Q = Y, st = vt, tt = X, et = ct, rt = _t, Pt = nt, $t = ut, Bt = St, Kt = ot, Qt = ht, Xt = At, kt = it, Tt = lt, Rt = Lt, Ot = at, xt = K, qt = 0; qt < 20; qt += 2) Q ^= (q = (Tt ^= (q = (Kt ^= (q = (rt ^= (q = Q + Tt | 0) << 7 | q >>> 25) + Q | 0) << 9 | q >>> 23) + rt | 0) << 13 | q >>> 19) + Kt | 0) << 18 | q >>> 14, Pt ^= (q = (st ^= (q = (Rt ^= (q = (Qt ^= (q = Pt + st | 0) << 7 | q >>> 25) + Pt | 0) << 9 | q >>> 23) + Qt | 0) << 13 | q >>> 19) + Rt | 0) << 18 | q >>> 14, Xt ^= (q = ($t ^= (q = (tt ^= (q = (Ot ^= (q = Xt + $t | 0) << 7 | q >>> 25) + Xt | 0) << 9 | q >>> 23) + Ot | 0) << 13 | q >>> 19) + tt | 0) << 18 | q >>> 14, xt ^= (q = (kt ^= (q = (Bt ^= (q = (et ^= (q = xt + kt | 0) << 7 | q >>> 25) + xt | 0) << 9 | q >>> 23) + et | 0) << 13 | q >>> 19) + Bt | 0) << 18 | q >>> 14, Q ^= (q = (et ^= (q = (tt ^= (q = (st ^= (q = Q + et | 0) << 7 | q >>> 25) + Q | 0) << 9 | q >>> 23) + st | 0) << 13 | q >>> 19) + tt | 0) << 18 | q >>> 14, Pt ^= (q = (rt ^= (q = (Bt ^= (q = ($t ^= (q = Pt + rt | 0) << 7 | q >>> 25) + Pt | 0) << 9 | q >>> 23) + $t | 0) << 13 | q >>> 19) + Bt | 0) << 18 | q >>> 14, Xt ^= (q = (Qt ^= (q = (Kt ^= (q = (kt ^= (q = Xt + Qt | 0) << 7 | q >>> 25) + Xt | 0) << 9 | q >>> 23) + kt | 0) << 13 | q >>> 19) + Kt | 0) << 18 | q >>> 14, xt ^= (q = (Ot ^= (q = (Rt ^= (q = (Tt ^= (q = xt + Ot | 0) << 7 | q >>> 25) + xt | 0) << 9 | q >>> 23) + Tt | 0) << 13 | q >>> 19) + Rt | 0) << 18 | q >>> 14;
|
|
9782
|
+
Q = Q + Y | 0, st = st + vt | 0, tt = tt + X | 0, et = et + ct | 0, rt = rt + _t | 0, Pt = Pt + nt | 0, $t = $t + ut | 0, Bt = Bt + St | 0, Kt = Kt + ot | 0, Qt = Qt + ht | 0, Xt = Xt + At | 0, kt = kt + it | 0, Tt = Tt + lt | 0, Rt = Rt + Lt | 0, Ot = Ot + at | 0, xt = xt + K | 0, M[0] = Q >>> 0 & 255, M[1] = Q >>> 8 & 255, M[2] = Q >>> 16 & 255, M[3] = Q >>> 24 & 255, M[4] = st >>> 0 & 255, M[5] = st >>> 8 & 255, M[6] = st >>> 16 & 255, M[7] = st >>> 24 & 255, M[8] = tt >>> 0 & 255, M[9] = tt >>> 8 & 255, M[10] = tt >>> 16 & 255, M[11] = tt >>> 24 & 255, M[12] = et >>> 0 & 255, M[13] = et >>> 8 & 255, M[14] = et >>> 16 & 255, M[15] = et >>> 24 & 255, M[16] = rt >>> 0 & 255, M[17] = rt >>> 8 & 255, M[18] = rt >>> 16 & 255, M[19] = rt >>> 24 & 255, M[20] = Pt >>> 0 & 255, M[21] = Pt >>> 8 & 255, M[22] = Pt >>> 16 & 255, M[23] = Pt >>> 24 & 255, M[24] = $t >>> 0 & 255, M[25] = $t >>> 8 & 255, M[26] = $t >>> 16 & 255, M[27] = $t >>> 24 & 255, M[28] = Bt >>> 0 & 255, M[29] = Bt >>> 8 & 255, M[30] = Bt >>> 16 & 255, M[31] = Bt >>> 24 & 255, M[32] = Kt >>> 0 & 255, M[33] = Kt >>> 8 & 255, M[34] = Kt >>> 16 & 255, M[35] = Kt >>> 24 & 255, M[36] = Qt >>> 0 & 255, M[37] = Qt >>> 8 & 255, M[38] = Qt >>> 16 & 255, M[39] = Qt >>> 24 & 255, M[40] = Xt >>> 0 & 255, M[41] = Xt >>> 8 & 255, M[42] = Xt >>> 16 & 255, M[43] = Xt >>> 24 & 255, M[44] = kt >>> 0 & 255, M[45] = kt >>> 8 & 255, M[46] = kt >>> 16 & 255, M[47] = kt >>> 24 & 255, M[48] = Tt >>> 0 & 255, M[49] = Tt >>> 8 & 255, M[50] = Tt >>> 16 & 255, M[51] = Tt >>> 24 & 255, M[52] = Rt >>> 0 & 255, M[53] = Rt >>> 8 & 255, M[54] = Rt >>> 16 & 255, M[55] = Rt >>> 24 & 255, M[56] = Ot >>> 0 & 255, M[57] = Ot >>> 8 & 255, M[58] = Ot >>> 16 & 255, M[59] = Ot >>> 24 & 255, M[60] = xt >>> 0 & 255, M[61] = xt >>> 8 & 255, M[62] = xt >>> 16 & 255, M[63] = xt >>> 24 & 255;
|
|
9783
|
+
})(T, C, L, b);
|
|
9784
9784
|
}
|
|
9785
|
-
function A(T,
|
|
9785
|
+
function A(T, C, L, b) {
|
|
9786
9786
|
(function(M, H, Z, W) {
|
|
9787
9787
|
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, vt = 255 & Z[0] | (255 & Z[1]) << 8 | (255 & Z[2]) << 16 | (255 & Z[3]) << 24, X = 255 & Z[4] | (255 & Z[5]) << 8 | (255 & Z[6]) << 16 | (255 & Z[7]) << 24, ct = 255 & Z[8] | (255 & Z[9]) << 8 | (255 & Z[10]) << 16 | (255 & Z[11]) << 24, _t = 255 & Z[12] | (255 & Z[13]) << 8 | (255 & Z[14]) << 16 | (255 & Z[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ut = 255 & H[0] | (255 & H[1]) << 8 | (255 & H[2]) << 16 | (255 & H[3]) << 24, St = 255 & H[4] | (255 & H[5]) << 8 | (255 & H[6]) << 16 | (255 & H[7]) << 24, ot = 255 & H[8] | (255 & H[9]) << 8 | (255 & H[10]) << 16 | (255 & H[11]) << 24, ht = 255 & H[12] | (255 & H[13]) << 8 | (255 & H[14]) << 16 | (255 & H[15]) << 24, At = 255 & W[8] | (255 & W[9]) << 8 | (255 & W[10]) << 16 | (255 & W[11]) << 24, it = 255 & Z[16] | (255 & Z[17]) << 8 | (255 & Z[18]) << 16 | (255 & Z[19]) << 24, lt = 255 & Z[20] | (255 & Z[21]) << 8 | (255 & Z[22]) << 16 | (255 & Z[23]) << 24, Lt = 255 & Z[24] | (255 & Z[25]) << 8 | (255 & Z[26]) << 16 | (255 & Z[27]) << 24, at = 255 & Z[28] | (255 & Z[29]) << 8 | (255 & Z[30]) << 16 | (255 & Z[31]) << 24, K = 255 & W[12] | (255 & W[13]) << 8 | (255 & W[14]) << 16 | (255 & W[15]) << 24, Q = 0; Q < 20; Q += 2) Y ^= (q = (lt ^= (q = (ot ^= (q = (_t ^= (q = Y + lt | 0) << 7 | q >>> 25) + Y | 0) << 9 | q >>> 23) + _t | 0) << 13 | q >>> 19) + ot | 0) << 18 | q >>> 14, nt ^= (q = (vt ^= (q = (Lt ^= (q = (ht ^= (q = nt + vt | 0) << 7 | q >>> 25) + nt | 0) << 9 | q >>> 23) + ht | 0) << 13 | q >>> 19) + Lt | 0) << 18 | q >>> 14, At ^= (q = (ut ^= (q = (X ^= (q = (at ^= (q = At + ut | 0) << 7 | q >>> 25) + At | 0) << 9 | q >>> 23) + at | 0) << 13 | q >>> 19) + X | 0) << 18 | q >>> 14, K ^= (q = (it ^= (q = (St ^= (q = (ct ^= (q = K + it | 0) << 7 | q >>> 25) + K | 0) << 9 | q >>> 23) + ct | 0) << 13 | q >>> 19) + St | 0) << 18 | q >>> 14, Y ^= (q = (ct ^= (q = (X ^= (q = (vt ^= (q = Y + ct | 0) << 7 | q >>> 25) + Y | 0) << 9 | q >>> 23) + vt | 0) << 13 | q >>> 19) + X | 0) << 18 | q >>> 14, nt ^= (q = (_t ^= (q = (St ^= (q = (ut ^= (q = nt + _t | 0) << 7 | q >>> 25) + nt | 0) << 9 | q >>> 23) + ut | 0) << 13 | q >>> 19) + St | 0) << 18 | q >>> 14, At ^= (q = (ht ^= (q = (ot ^= (q = (it ^= (q = At + ht | 0) << 7 | q >>> 25) + At | 0) << 9 | q >>> 23) + it | 0) << 13 | q >>> 19) + ot | 0) << 18 | q >>> 14, K ^= (q = (at ^= (q = (Lt ^= (q = (lt ^= (q = K + at | 0) << 7 | q >>> 25) + K | 0) << 9 | q >>> 23) + lt | 0) << 13 | q >>> 19) + Lt | 0) << 18 | q >>> 14;
|
|
9788
9788
|
M[0] = Y >>> 0 & 255, M[1] = Y >>> 8 & 255, M[2] = Y >>> 16 & 255, M[3] = Y >>> 24 & 255, M[4] = nt >>> 0 & 255, M[5] = nt >>> 8 & 255, M[6] = nt >>> 16 & 255, M[7] = nt >>> 24 & 255, M[8] = At >>> 0 & 255, M[9] = At >>> 8 & 255, M[10] = At >>> 16 & 255, M[11] = At >>> 24 & 255, M[12] = K >>> 0 & 255, M[13] = K >>> 8 & 255, M[14] = K >>> 16 & 255, M[15] = K >>> 24 & 255, M[16] = ut >>> 0 & 255, M[17] = ut >>> 8 & 255, M[18] = ut >>> 16 & 255, M[19] = ut >>> 24 & 255, M[20] = St >>> 0 & 255, M[21] = St >>> 8 & 255, M[22] = St >>> 16 & 255, M[23] = St >>> 24 & 255, M[24] = ot >>> 0 & 255, M[25] = ot >>> 8 & 255, M[26] = ot >>> 16 & 255, M[27] = ot >>> 24 & 255, M[28] = ht >>> 0 & 255, M[29] = ht >>> 8 & 255, M[30] = ht >>> 16 & 255, M[31] = ht >>> 24 & 255;
|
|
9789
|
-
})(T,
|
|
9789
|
+
})(T, C, L, b);
|
|
9790
9790
|
}
|
|
9791
9791
|
var P = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
|
|
9792
|
-
function I(T,
|
|
9792
|
+
function I(T, C, L, b, M, H, Z) {
|
|
9793
9793
|
var W, q, Y = new Uint8Array(16), vt = new Uint8Array(64);
|
|
9794
9794
|
for (q = 0; q < 16; q++) Y[q] = 0;
|
|
9795
9795
|
for (q = 0; q < 8; q++) Y[q] = H[q];
|
|
9796
9796
|
for (; M >= 64; ) {
|
|
9797
|
-
for (k(vt, Y, Z, P), q = 0; q < 64; q++) T[
|
|
9797
|
+
for (k(vt, Y, Z, P), q = 0; q < 64; q++) T[C + q] = L[b + q] ^ vt[q];
|
|
9798
9798
|
for (W = 1, q = 8; q < 16; q++) W = W + (255 & Y[q]) | 0, Y[q] = 255 & W, W >>>= 8;
|
|
9799
|
-
M -= 64,
|
|
9799
|
+
M -= 64, C += 64, b += 64;
|
|
9800
9800
|
}
|
|
9801
|
-
if (M > 0) for (k(vt, Y, Z, P), q = 0; q < M; q++) T[
|
|
9801
|
+
if (M > 0) for (k(vt, Y, Z, P), q = 0; q < M; q++) T[C + q] = L[b + q] ^ vt[q];
|
|
9802
9802
|
return 0;
|
|
9803
9803
|
}
|
|
9804
|
-
function
|
|
9804
|
+
function N(T, C, L, b, M) {
|
|
9805
9805
|
var H, Z, W = new Uint8Array(16), q = new Uint8Array(64);
|
|
9806
9806
|
for (Z = 0; Z < 16; Z++) W[Z] = 0;
|
|
9807
9807
|
for (Z = 0; Z < 8; Z++) W[Z] = b[Z];
|
|
9808
9808
|
for (; L >= 64; ) {
|
|
9809
|
-
for (k(q, W, M, P), Z = 0; Z < 64; Z++) T[
|
|
9809
|
+
for (k(q, W, M, P), Z = 0; Z < 64; Z++) T[C + Z] = q[Z];
|
|
9810
9810
|
for (H = 1, Z = 8; Z < 16; Z++) H = H + (255 & W[Z]) | 0, W[Z] = 255 & H, H >>>= 8;
|
|
9811
|
-
L -= 64,
|
|
9811
|
+
L -= 64, C += 64;
|
|
9812
9812
|
}
|
|
9813
|
-
if (L > 0) for (k(q, W, M, P), Z = 0; Z < L; Z++) T[
|
|
9813
|
+
if (L > 0) for (k(q, W, M, P), Z = 0; Z < L; Z++) T[C + Z] = q[Z];
|
|
9814
9814
|
return 0;
|
|
9815
9815
|
}
|
|
9816
|
-
function z(T,
|
|
9816
|
+
function z(T, C, L, b, M) {
|
|
9817
9817
|
var H = new Uint8Array(32);
|
|
9818
9818
|
A(H, b, M, P);
|
|
9819
9819
|
for (var Z = new Uint8Array(8), W = 0; W < 8; W++) Z[W] = b[W + 16];
|
|
9820
|
-
return
|
|
9820
|
+
return N(T, C, L, Z, H);
|
|
9821
9821
|
}
|
|
9822
|
-
function B(T,
|
|
9822
|
+
function B(T, C, L, b, M, H, Z) {
|
|
9823
9823
|
var W = new Uint8Array(32);
|
|
9824
9824
|
A(W, H, Z, P);
|
|
9825
9825
|
for (var q = new Uint8Array(8), Y = 0; Y < 8; Y++) q[Y] = H[Y + 16];
|
|
9826
|
-
return I(T,
|
|
9826
|
+
return I(T, C, L, b, M, q, W);
|
|
9827
9827
|
}
|
|
9828
9828
|
var d = function(T) {
|
|
9829
|
-
var
|
|
9830
|
-
this.buffer = new Uint8Array(16), this.r = new Uint16Array(10), this.h = new Uint16Array(10), this.pad = new Uint16Array(8), this.leftover = 0, this.fin = 0,
|
|
9829
|
+
var C, L, b, M, H, Z, W, q;
|
|
9830
|
+
this.buffer = new Uint8Array(16), this.r = new Uint16Array(10), this.h = new Uint16Array(10), this.pad = new Uint16Array(8), this.leftover = 0, this.fin = 0, C = 255 & T[0] | (255 & T[1]) << 8, this.r[0] = 8191 & C, L = 255 & T[2] | (255 & T[3]) << 8, this.r[1] = 8191 & (C >>> 13 | L << 3), b = 255 & T[4] | (255 & T[5]) << 8, this.r[2] = 7939 & (L >>> 10 | b << 6), M = 255 & T[6] | (255 & T[7]) << 8, this.r[3] = 8191 & (b >>> 7 | M << 9), H = 255 & T[8] | (255 & T[9]) << 8, this.r[4] = 255 & (M >>> 4 | H << 12), this.r[5] = H >>> 1 & 8190, Z = 255 & T[10] | (255 & T[11]) << 8, this.r[6] = 8191 & (H >>> 14 | Z << 2), W = 255 & T[12] | (255 & T[13]) << 8, this.r[7] = 8065 & (Z >>> 11 | W << 5), q = 255 & T[14] | (255 & T[15]) << 8, this.r[8] = 8191 & (W >>> 8 | q << 8), this.r[9] = q >>> 5 & 127, this.pad[0] = 255 & T[16] | (255 & T[17]) << 8, this.pad[1] = 255 & T[18] | (255 & T[19]) << 8, this.pad[2] = 255 & T[20] | (255 & T[21]) << 8, this.pad[3] = 255 & T[22] | (255 & T[23]) << 8, this.pad[4] = 255 & T[24] | (255 & T[25]) << 8, this.pad[5] = 255 & T[26] | (255 & T[27]) << 8, this.pad[6] = 255 & T[28] | (255 & T[29]) << 8, this.pad[7] = 255 & T[30] | (255 & T[31]) << 8;
|
|
9831
9831
|
};
|
|
9832
|
-
function h(T,
|
|
9832
|
+
function h(T, C, L, b, M, H) {
|
|
9833
9833
|
var Z = new d(H);
|
|
9834
|
-
return Z.update(L, b, M), Z.finish(T,
|
|
9834
|
+
return Z.update(L, b, M), Z.finish(T, C), 0;
|
|
9835
9835
|
}
|
|
9836
|
-
function y(T,
|
|
9836
|
+
function y(T, C, L, b, M, H) {
|
|
9837
9837
|
var Z = new Uint8Array(16);
|
|
9838
|
-
return h(Z, 0, L, b, M, H), E(T,
|
|
9838
|
+
return h(Z, 0, L, b, M, H), E(T, C, Z, 0);
|
|
9839
9839
|
}
|
|
9840
|
-
function m(T,
|
|
9840
|
+
function m(T, C, L, b, M) {
|
|
9841
9841
|
var H;
|
|
9842
9842
|
if (L < 32) return -1;
|
|
9843
|
-
for (B(T, 0,
|
|
9843
|
+
for (B(T, 0, C, 0, L, b, M), h(T, 16, T, 32, L - 32, T), H = 0; H < 16; H++) T[H] = 0;
|
|
9844
9844
|
return 0;
|
|
9845
9845
|
}
|
|
9846
|
-
function l(T,
|
|
9846
|
+
function l(T, C, L, b, M) {
|
|
9847
9847
|
var H, Z = new Uint8Array(32);
|
|
9848
|
-
if (L < 32 || (z(Z, 0, 32, b, M), y(
|
|
9849
|
-
for (B(T, 0,
|
|
9848
|
+
if (L < 32 || (z(Z, 0, 32, b, M), y(C, 16, C, 32, L - 32, Z) !== 0)) return -1;
|
|
9849
|
+
for (B(T, 0, C, 0, L, b, M), H = 0; H < 32; H++) T[H] = 0;
|
|
9850
9850
|
return 0;
|
|
9851
9851
|
}
|
|
9852
|
-
function g(T,
|
|
9852
|
+
function g(T, C) {
|
|
9853
9853
|
var L;
|
|
9854
|
-
for (L = 0; L < 16; L++) T[L] = 0 |
|
|
9854
|
+
for (L = 0; L < 16; L++) T[L] = 0 | C[L];
|
|
9855
9855
|
}
|
|
9856
9856
|
function x(T) {
|
|
9857
|
-
var
|
|
9858
|
-
for (
|
|
9857
|
+
var C, L, b = 1;
|
|
9858
|
+
for (C = 0; C < 16; C++) L = T[C] + b + 65535, b = Math.floor(L / 65536), T[C] = L - 65536 * b;
|
|
9859
9859
|
T[0] += b - 1 + 37 * (b - 1);
|
|
9860
9860
|
}
|
|
9861
|
-
function
|
|
9862
|
-
for (var b, M = ~(L - 1), H = 0; H < 16; H++) b = M & (T[H] ^
|
|
9861
|
+
function O(T, C, L) {
|
|
9862
|
+
for (var b, M = ~(L - 1), H = 0; H < 16; H++) b = M & (T[H] ^ C[H]), T[H] ^= b, C[H] ^= b;
|
|
9863
9863
|
}
|
|
9864
|
-
function R(T,
|
|
9864
|
+
function R(T, C) {
|
|
9865
9865
|
var L, b, M, H = t(), Z = t();
|
|
9866
|
-
for (L = 0; L < 16; L++) Z[L] =
|
|
9866
|
+
for (L = 0; L < 16; L++) Z[L] = C[L];
|
|
9867
9867
|
for (x(Z), x(Z), x(Z), b = 0; b < 2; b++) {
|
|
9868
9868
|
for (H[0] = Z[0] - 65517, L = 1; L < 15; L++) H[L] = Z[L] - 65535 - (H[L - 1] >> 16 & 1), H[L - 1] &= 65535;
|
|
9869
|
-
H[15] = Z[15] - 32767 - (H[14] >> 16 & 1), M = H[15] >> 16 & 1, H[14] &= 65535,
|
|
9869
|
+
H[15] = Z[15] - 32767 - (H[14] >> 16 & 1), M = H[15] >> 16 & 1, H[14] &= 65535, O(Z, H, 1 - M);
|
|
9870
9870
|
}
|
|
9871
9871
|
for (L = 0; L < 16; L++) T[2 * L] = 255 & Z[L], T[2 * L + 1] = Z[L] >> 8;
|
|
9872
9872
|
}
|
|
9873
|
-
function j(T,
|
|
9873
|
+
function j(T, C) {
|
|
9874
9874
|
var L = new Uint8Array(32), b = new Uint8Array(32);
|
|
9875
|
-
return R(L, T), R(b,
|
|
9875
|
+
return R(L, T), R(b, C), _(L, 0, b, 0);
|
|
9876
9876
|
}
|
|
9877
9877
|
function F(T) {
|
|
9878
|
-
var
|
|
9879
|
-
return R(
|
|
9878
|
+
var C = new Uint8Array(32);
|
|
9879
|
+
return R(C, T), 1 & C[0];
|
|
9880
9880
|
}
|
|
9881
|
-
function $(T,
|
|
9881
|
+
function $(T, C) {
|
|
9882
9882
|
var L;
|
|
9883
|
-
for (L = 0; L < 16; L++) T[L] =
|
|
9883
|
+
for (L = 0; L < 16; L++) T[L] = C[2 * L] + (C[2 * L + 1] << 8);
|
|
9884
9884
|
T[15] &= 32767;
|
|
9885
9885
|
}
|
|
9886
|
-
function V(T,
|
|
9887
|
-
for (var b = 0; b < 16; b++) T[b] =
|
|
9886
|
+
function V(T, C, L) {
|
|
9887
|
+
for (var b = 0; b < 16; b++) T[b] = C[b] + L[b];
|
|
9888
9888
|
}
|
|
9889
|
-
function D(T,
|
|
9890
|
-
for (var b = 0; b < 16; b++) T[b] =
|
|
9889
|
+
function D(T, C, L) {
|
|
9890
|
+
for (var b = 0; b < 16; b++) T[b] = C[b] - L[b];
|
|
9891
9891
|
}
|
|
9892
|
-
function U(T,
|
|
9893
|
-
var b, M, H = 0, Z = 0, W = 0, q = 0, Y = 0, vt = 0, X = 0, ct = 0, _t = 0, nt = 0, ut = 0, St = 0, ot = 0, ht = 0, At = 0, it = 0, lt = 0, Lt = 0, at = 0, K = 0, Q = 0, st = 0, tt = 0, et = 0, rt = 0, Pt = 0, $t = 0, Bt = 0, Kt = 0, Qt = 0, Xt = 0, kt = L[0], Tt = L[1], Rt = L[2],
|
|
9894
|
-
H += (b =
|
|
9892
|
+
function U(T, C, L) {
|
|
9893
|
+
var b, M, H = 0, Z = 0, W = 0, q = 0, Y = 0, vt = 0, X = 0, ct = 0, _t = 0, nt = 0, ut = 0, St = 0, ot = 0, ht = 0, At = 0, it = 0, lt = 0, Lt = 0, at = 0, K = 0, Q = 0, st = 0, tt = 0, et = 0, rt = 0, Pt = 0, $t = 0, Bt = 0, Kt = 0, Qt = 0, Xt = 0, kt = L[0], Tt = L[1], Rt = L[2], Ot = L[3], xt = L[4], qt = L[5], Ht = L[6], me = L[7], ue = L[8], ye = L[9], ve = L[10], xe = L[11], Ee = L[12], Ue = L[13], He = L[14], De = L[15];
|
|
9894
|
+
H += (b = C[0]) * kt, Z += b * Tt, W += b * Rt, q += b * Ot, Y += b * xt, vt += b * qt, X += b * Ht, ct += b * me, _t += b * ue, nt += b * ye, ut += b * ve, St += b * xe, ot += b * Ee, ht += b * Ue, At += b * He, it += b * De, Z += (b = C[1]) * kt, W += b * Tt, q += b * Rt, Y += b * Ot, vt += b * xt, X += b * qt, ct += b * Ht, _t += b * me, nt += b * ue, ut += b * ye, St += b * ve, ot += b * xe, ht += b * Ee, At += b * Ue, it += b * He, lt += b * De, W += (b = C[2]) * kt, q += b * Tt, Y += b * Rt, vt += b * Ot, X += b * xt, ct += b * qt, _t += b * Ht, nt += b * me, ut += b * ue, St += b * ye, ot += b * ve, ht += b * xe, At += b * Ee, it += b * Ue, lt += b * He, Lt += b * De, q += (b = C[3]) * kt, Y += b * Tt, vt += b * Rt, X += b * Ot, ct += b * xt, _t += b * qt, nt += b * Ht, ut += b * me, St += b * ue, ot += b * ye, ht += b * ve, At += b * xe, it += b * Ee, lt += b * Ue, Lt += b * He, at += b * De, Y += (b = C[4]) * kt, vt += b * Tt, X += b * Rt, ct += b * Ot, _t += b * xt, nt += b * qt, ut += b * Ht, St += b * me, ot += b * ue, ht += b * ye, At += b * ve, it += b * xe, lt += b * Ee, Lt += b * Ue, at += b * He, K += b * De, vt += (b = C[5]) * kt, X += b * Tt, ct += b * Rt, _t += b * Ot, nt += b * xt, ut += b * qt, St += b * Ht, ot += b * me, ht += b * ue, At += b * ye, it += b * ve, lt += b * xe, Lt += b * Ee, at += b * Ue, K += b * He, Q += b * De, X += (b = C[6]) * kt, ct += b * Tt, _t += b * Rt, nt += b * Ot, ut += b * xt, St += b * qt, ot += b * Ht, ht += b * me, At += b * ue, it += b * ye, lt += b * ve, Lt += b * xe, at += b * Ee, K += b * Ue, Q += b * He, st += b * De, ct += (b = C[7]) * kt, _t += b * Tt, nt += b * Rt, ut += b * Ot, St += b * xt, ot += b * qt, ht += b * Ht, At += b * me, it += b * ue, lt += b * ye, Lt += b * ve, at += b * xe, K += b * Ee, Q += b * Ue, st += b * He, tt += b * De, _t += (b = C[8]) * kt, nt += b * Tt, ut += b * Rt, St += b * Ot, ot += b * xt, ht += b * qt, At += b * Ht, it += b * me, lt += b * ue, Lt += b * ye, at += b * ve, K += b * xe, Q += b * Ee, st += b * Ue, tt += b * He, et += b * De, nt += (b = C[9]) * kt, ut += b * Tt, St += b * Rt, ot += b * Ot, ht += b * xt, At += b * qt, it += b * Ht, lt += b * me, Lt += b * ue, at += b * ye, K += b * ve, Q += b * xe, st += b * Ee, tt += b * Ue, et += b * He, rt += b * De, ut += (b = C[10]) * kt, St += b * Tt, ot += b * Rt, ht += b * Ot, At += b * xt, it += b * qt, lt += b * Ht, Lt += b * me, at += b * ue, K += b * ye, Q += b * ve, st += b * xe, tt += b * Ee, et += b * Ue, rt += b * He, Pt += b * De, St += (b = C[11]) * kt, ot += b * Tt, ht += b * Rt, At += b * Ot, it += b * xt, lt += b * qt, Lt += b * Ht, at += b * me, K += b * ue, Q += b * ye, st += b * ve, tt += b * xe, et += b * Ee, rt += b * Ue, Pt += b * He, $t += b * De, ot += (b = C[12]) * kt, ht += b * Tt, At += b * Rt, it += b * Ot, lt += b * xt, Lt += b * qt, at += b * Ht, K += b * me, Q += b * ue, st += b * ye, tt += b * ve, et += b * xe, rt += b * Ee, Pt += b * Ue, $t += b * He, Bt += b * De, ht += (b = C[13]) * kt, At += b * Tt, it += b * Rt, lt += b * Ot, Lt += b * xt, at += b * qt, K += b * Ht, Q += b * me, st += b * ue, tt += b * ye, et += b * ve, rt += b * xe, Pt += b * Ee, $t += b * Ue, Bt += b * He, Kt += b * De, At += (b = C[14]) * kt, it += b * Tt, lt += b * Rt, Lt += b * Ot, at += b * xt, K += b * qt, Q += b * Ht, st += b * me, tt += b * ue, et += b * ye, rt += b * ve, Pt += b * xe, $t += b * Ee, Bt += b * Ue, Kt += b * He, Qt += b * De, it += (b = C[15]) * kt, Z += 38 * (Lt += b * Rt), W += 38 * (at += b * Ot), q += 38 * (K += b * xt), Y += 38 * (Q += b * qt), vt += 38 * (st += b * Ht), X += 38 * (tt += b * me), ct += 38 * (et += b * ue), _t += 38 * (rt += b * ye), nt += 38 * (Pt += b * ve), ut += 38 * ($t += b * xe), St += 38 * (Bt += b * Ee), ot += 38 * (Kt += b * Ue), ht += 38 * (Qt += b * He), At += 38 * (Xt += b * De), H = (b = (H += 38 * (lt += b * Tt)) + (M = 1) + 65535) - 65536 * (M = Math.floor(b / 65536)), Z = (b = Z + M + 65535) - 65536 * (M = Math.floor(b / 65536)), W = (b = W + M + 65535) - 65536 * (M = Math.floor(b / 65536)), q = (b = q + M + 65535) - 65536 * (M = Math.floor(b / 65536)), Y = (b = Y + M + 65535) - 65536 * (M = Math.floor(b / 65536)), vt = (b = vt + M + 65535) - 65536 * (M = Math.floor(b / 65536)), X = (b = X + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ct = (b = ct + M + 65535) - 65536 * (M = Math.floor(b / 65536)), _t = (b = _t + M + 65535) - 65536 * (M = Math.floor(b / 65536)), nt = (b = nt + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ut = (b = ut + M + 65535) - 65536 * (M = Math.floor(b / 65536)), St = (b = St + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ot = (b = ot + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ht = (b = ht + M + 65535) - 65536 * (M = Math.floor(b / 65536)), At = (b = At + M + 65535) - 65536 * (M = Math.floor(b / 65536)), it = (b = it + M + 65535) - 65536 * (M = Math.floor(b / 65536)), H = (b = (H += M - 1 + 37 * (M - 1)) + (M = 1) + 65535) - 65536 * (M = Math.floor(b / 65536)), Z = (b = Z + M + 65535) - 65536 * (M = Math.floor(b / 65536)), W = (b = W + M + 65535) - 65536 * (M = Math.floor(b / 65536)), q = (b = q + M + 65535) - 65536 * (M = Math.floor(b / 65536)), Y = (b = Y + M + 65535) - 65536 * (M = Math.floor(b / 65536)), vt = (b = vt + M + 65535) - 65536 * (M = Math.floor(b / 65536)), X = (b = X + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ct = (b = ct + M + 65535) - 65536 * (M = Math.floor(b / 65536)), _t = (b = _t + M + 65535) - 65536 * (M = Math.floor(b / 65536)), nt = (b = nt + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ut = (b = ut + M + 65535) - 65536 * (M = Math.floor(b / 65536)), St = (b = St + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ot = (b = ot + M + 65535) - 65536 * (M = Math.floor(b / 65536)), ht = (b = ht + M + 65535) - 65536 * (M = Math.floor(b / 65536)), At = (b = At + M + 65535) - 65536 * (M = Math.floor(b / 65536)), it = (b = it + M + 65535) - 65536 * (M = Math.floor(b / 65536)), H += M - 1 + 37 * (M - 1), T[0] = H, T[1] = Z, T[2] = W, T[3] = q, T[4] = Y, T[5] = vt, T[6] = X, T[7] = ct, T[8] = _t, T[9] = nt, T[10] = ut, T[11] = St, T[12] = ot, T[13] = ht, T[14] = At, T[15] = it;
|
|
9895
9895
|
}
|
|
9896
|
-
function G(T,
|
|
9897
|
-
U(T,
|
|
9896
|
+
function G(T, C) {
|
|
9897
|
+
U(T, C, C);
|
|
9898
9898
|
}
|
|
9899
|
-
function
|
|
9899
|
+
function Nt(T, C) {
|
|
9900
9900
|
var L, b = t();
|
|
9901
|
-
for (L = 0; L < 16; L++) b[L] =
|
|
9902
|
-
for (L = 253; L >= 0; L--) G(b, b), L !== 2 && L !== 4 && U(b, b,
|
|
9901
|
+
for (L = 0; L < 16; L++) b[L] = C[L];
|
|
9902
|
+
for (L = 253; L >= 0; L--) G(b, b), L !== 2 && L !== 4 && U(b, b, C);
|
|
9903
9903
|
for (L = 0; L < 16; L++) T[L] = b[L];
|
|
9904
9904
|
}
|
|
9905
|
-
function dt(T,
|
|
9905
|
+
function dt(T, C) {
|
|
9906
9906
|
var L, b = t();
|
|
9907
|
-
for (L = 0; L < 16; L++) b[L] =
|
|
9908
|
-
for (L = 250; L >= 0; L--) G(b, b), L !== 1 && U(b, b,
|
|
9907
|
+
for (L = 0; L < 16; L++) b[L] = C[L];
|
|
9908
|
+
for (L = 250; L >= 0; L--) G(b, b), L !== 1 && U(b, b, C);
|
|
9909
9909
|
for (L = 0; L < 16; L++) T[L] = b[L];
|
|
9910
9910
|
}
|
|
9911
|
-
function gt(T,
|
|
9911
|
+
function gt(T, C, L) {
|
|
9912
9912
|
var b, M, H = new Uint8Array(32), Z = new Float64Array(80), W = t(), q = t(), Y = t(), vt = t(), X = t(), ct = t();
|
|
9913
|
-
for (M = 0; M < 31; M++) H[M] =
|
|
9914
|
-
for (H[31] = 127 &
|
|
9915
|
-
for (W[0] = vt[0] = 1, M = 254; M >= 0; --M)
|
|
9913
|
+
for (M = 0; M < 31; M++) H[M] = C[M];
|
|
9914
|
+
for (H[31] = 127 & C[31] | 64, H[0] &= 248, $(Z, L), M = 0; M < 16; M++) q[M] = Z[M], vt[M] = W[M] = Y[M] = 0;
|
|
9915
|
+
for (W[0] = vt[0] = 1, M = 254; M >= 0; --M) O(W, q, b = H[M >>> 3] >>> (7 & M) & 1), O(Y, vt, b), V(X, W, Y), D(W, W, Y), V(Y, q, vt), D(q, q, vt), G(vt, X), G(ct, W), U(W, Y, W), U(Y, q, X), V(X, W, Y), D(W, W, Y), G(q, W), D(Y, vt, ct), U(W, Y, o), V(W, W, vt), U(Y, Y, W), U(W, vt, ct), U(vt, q, Z), G(q, X), O(W, q, b), O(Y, vt, b);
|
|
9916
9916
|
for (M = 0; M < 16; M++) Z[M + 16] = W[M], Z[M + 32] = Y[M], Z[M + 48] = q[M], Z[M + 64] = vt[M];
|
|
9917
9917
|
var _t = Z.subarray(32), nt = Z.subarray(16);
|
|
9918
|
-
return
|
|
9918
|
+
return Nt(_t, _t), U(nt, nt, _t), R(T, nt), 0;
|
|
9919
9919
|
}
|
|
9920
|
-
function Ft(T,
|
|
9921
|
-
return gt(T,
|
|
9920
|
+
function Ft(T, C) {
|
|
9921
|
+
return gt(T, C, i);
|
|
9922
9922
|
}
|
|
9923
|
-
function mt(T,
|
|
9924
|
-
return r(
|
|
9923
|
+
function mt(T, C) {
|
|
9924
|
+
return r(C, 32), Ft(T, C);
|
|
9925
9925
|
}
|
|
9926
|
-
function Mt(T,
|
|
9926
|
+
function Mt(T, C, L) {
|
|
9927
9927
|
var b = new Uint8Array(32);
|
|
9928
|
-
return gt(b, L,
|
|
9928
|
+
return gt(b, L, C), A(T, n, b, P);
|
|
9929
9929
|
}
|
|
9930
|
-
d.prototype.blocks = function(T,
|
|
9931
|
-
for (var b, M, H, Z, W, q, Y, vt, X, ct, _t, nt, ut, St, ot, ht, At, it, lt, Lt = this.fin ? 0 : 2048, at = this.h[0], K = this.h[1], Q = this.h[2], st = this.h[3], tt = this.h[4], et = this.h[5], rt = this.h[6], Pt = this.h[7], $t = this.h[8], Bt = this.h[9], Kt = this.r[0], Qt = this.r[1], Xt = this.r[2], kt = this.r[3], Tt = this.r[4], Rt = this.r[5],
|
|
9930
|
+
d.prototype.blocks = function(T, C, L) {
|
|
9931
|
+
for (var b, M, H, Z, W, q, Y, vt, X, ct, _t, nt, ut, St, ot, ht, At, it, lt, Lt = this.fin ? 0 : 2048, at = this.h[0], K = this.h[1], Q = this.h[2], st = this.h[3], tt = this.h[4], et = this.h[5], rt = this.h[6], Pt = this.h[7], $t = this.h[8], Bt = this.h[9], Kt = this.r[0], Qt = this.r[1], Xt = this.r[2], kt = this.r[3], Tt = this.r[4], Rt = this.r[5], Ot = this.r[6], xt = this.r[7], qt = this.r[8], Ht = this.r[9]; L >= 16; ) ct = X = 0, ct += (at += 8191 & (b = 255 & T[C + 0] | (255 & T[C + 1]) << 8)) * Kt, ct += (K += 8191 & (b >>> 13 | (M = 255 & T[C + 2] | (255 & T[C + 3]) << 8) << 3)) * (5 * Ht), ct += (Q += 8191 & (M >>> 10 | (H = 255 & T[C + 4] | (255 & T[C + 5]) << 8) << 6)) * (5 * qt), ct += (st += 8191 & (H >>> 7 | (Z = 255 & T[C + 6] | (255 & T[C + 7]) << 8) << 9)) * (5 * xt), X = (ct += (tt += 8191 & (Z >>> 4 | (W = 255 & T[C + 8] | (255 & T[C + 9]) << 8) << 12)) * (5 * Ot)) >>> 13, ct &= 8191, ct += (et += W >>> 1 & 8191) * (5 * Rt), ct += (rt += 8191 & (W >>> 14 | (q = 255 & T[C + 10] | (255 & T[C + 11]) << 8) << 2)) * (5 * Tt), ct += (Pt += 8191 & (q >>> 11 | (Y = 255 & T[C + 12] | (255 & T[C + 13]) << 8) << 5)) * (5 * kt), ct += ($t += 8191 & (Y >>> 8 | (vt = 255 & T[C + 14] | (255 & T[C + 15]) << 8) << 8)) * (5 * Xt), _t = X += (ct += (Bt += vt >>> 5 | Lt) * (5 * Qt)) >>> 13, _t += at * Qt, _t += K * Kt, _t += Q * (5 * Ht), _t += st * (5 * qt), X = (_t += tt * (5 * xt)) >>> 13, _t &= 8191, _t += et * (5 * Ot), _t += rt * (5 * Rt), _t += Pt * (5 * Tt), _t += $t * (5 * kt), X += (_t += Bt * (5 * Xt)) >>> 13, _t &= 8191, nt = X, nt += at * Xt, nt += K * Qt, nt += Q * Kt, nt += st * (5 * Ht), X = (nt += tt * (5 * qt)) >>> 13, nt &= 8191, nt += et * (5 * xt), nt += rt * (5 * Ot), nt += Pt * (5 * Rt), nt += $t * (5 * Tt), ut = X += (nt += Bt * (5 * kt)) >>> 13, ut += at * kt, ut += K * Xt, ut += Q * Qt, ut += st * Kt, X = (ut += tt * (5 * Ht)) >>> 13, ut &= 8191, ut += et * (5 * qt), ut += rt * (5 * xt), ut += Pt * (5 * Ot), ut += $t * (5 * Rt), St = X += (ut += Bt * (5 * Tt)) >>> 13, St += at * Tt, St += K * kt, St += Q * Xt, St += st * Qt, X = (St += tt * Kt) >>> 13, St &= 8191, St += et * (5 * Ht), St += rt * (5 * qt), St += Pt * (5 * xt), St += $t * (5 * Ot), ot = X += (St += Bt * (5 * Rt)) >>> 13, ot += at * Rt, ot += K * Tt, ot += Q * kt, ot += st * Xt, X = (ot += tt * Qt) >>> 13, ot &= 8191, ot += et * Kt, ot += rt * (5 * Ht), ot += Pt * (5 * qt), ot += $t * (5 * xt), ht = X += (ot += Bt * (5 * Ot)) >>> 13, ht += at * Ot, ht += K * Rt, ht += Q * Tt, ht += st * kt, X = (ht += tt * Xt) >>> 13, ht &= 8191, ht += et * Qt, ht += rt * Kt, ht += Pt * (5 * Ht), ht += $t * (5 * qt), At = X += (ht += Bt * (5 * xt)) >>> 13, At += at * xt, At += K * Ot, At += Q * Rt, At += st * Tt, X = (At += tt * kt) >>> 13, At &= 8191, At += et * Xt, At += rt * Qt, At += Pt * Kt, At += $t * (5 * Ht), it = X += (At += Bt * (5 * qt)) >>> 13, it += at * qt, it += K * xt, it += Q * Ot, it += st * Rt, X = (it += tt * Tt) >>> 13, it &= 8191, it += et * kt, it += rt * Xt, it += Pt * Qt, it += $t * Kt, lt = X += (it += Bt * (5 * Ht)) >>> 13, lt += at * Ht, lt += K * qt, lt += Q * xt, lt += st * Ot, X = (lt += tt * Rt) >>> 13, lt &= 8191, lt += et * Tt, lt += rt * kt, lt += Pt * Xt, lt += $t * Qt, at = ct = 8191 & (X = (X = ((X += (lt += Bt * Kt) >>> 13) << 2) + X | 0) + (ct &= 8191) | 0), K = _t += X >>>= 13, Q = nt &= 8191, st = ut &= 8191, tt = St &= 8191, et = ot &= 8191, rt = ht &= 8191, Pt = At &= 8191, $t = it &= 8191, Bt = lt &= 8191, C += 16, L -= 16;
|
|
9932
9932
|
this.h[0] = at, this.h[1] = K, this.h[2] = Q, this.h[3] = st, this.h[4] = tt, this.h[5] = et, this.h[6] = rt, this.h[7] = Pt, this.h[8] = $t, this.h[9] = Bt;
|
|
9933
|
-
}, d.prototype.finish = function(T,
|
|
9933
|
+
}, d.prototype.finish = function(T, C) {
|
|
9934
9934
|
var L, b, M, H, Z = new Uint16Array(10);
|
|
9935
9935
|
if (this.leftover) {
|
|
9936
9936
|
for (H = this.leftover, this.buffer[H++] = 1; H < 16; H++) this.buffer[H] = 0;
|
|
@@ -9941,81 +9941,81 @@ var za = { exports: {} };
|
|
|
9941
9941
|
for (Z[9] -= 8192, b = (1 ^ L) - 1, H = 0; H < 10; H++) Z[H] &= b;
|
|
9942
9942
|
for (b = ~b, H = 0; H < 10; H++) this.h[H] = this.h[H] & b | Z[H];
|
|
9943
9943
|
for (this.h[0] = 65535 & (this.h[0] | this.h[1] << 13), this.h[1] = 65535 & (this.h[1] >>> 3 | this.h[2] << 10), this.h[2] = 65535 & (this.h[2] >>> 6 | this.h[3] << 7), this.h[3] = 65535 & (this.h[3] >>> 9 | this.h[4] << 4), this.h[4] = 65535 & (this.h[4] >>> 12 | this.h[5] << 1 | this.h[6] << 14), this.h[5] = 65535 & (this.h[6] >>> 2 | this.h[7] << 11), this.h[6] = 65535 & (this.h[7] >>> 5 | this.h[8] << 8), this.h[7] = 65535 & (this.h[8] >>> 8 | this.h[9] << 5), M = this.h[0] + this.pad[0], this.h[0] = 65535 & M, H = 1; H < 8; H++) M = (this.h[H] + this.pad[H] | 0) + (M >>> 16) | 0, this.h[H] = 65535 & M;
|
|
9944
|
-
T[
|
|
9945
|
-
}, d.prototype.update = function(T,
|
|
9944
|
+
T[C + 0] = this.h[0] >>> 0 & 255, T[C + 1] = this.h[0] >>> 8 & 255, T[C + 2] = this.h[1] >>> 0 & 255, T[C + 3] = this.h[1] >>> 8 & 255, T[C + 4] = this.h[2] >>> 0 & 255, T[C + 5] = this.h[2] >>> 8 & 255, T[C + 6] = this.h[3] >>> 0 & 255, T[C + 7] = this.h[3] >>> 8 & 255, T[C + 8] = this.h[4] >>> 0 & 255, T[C + 9] = this.h[4] >>> 8 & 255, T[C + 10] = this.h[5] >>> 0 & 255, T[C + 11] = this.h[5] >>> 8 & 255, T[C + 12] = this.h[6] >>> 0 & 255, T[C + 13] = this.h[6] >>> 8 & 255, T[C + 14] = this.h[7] >>> 0 & 255, T[C + 15] = this.h[7] >>> 8 & 255;
|
|
9945
|
+
}, d.prototype.update = function(T, C, L) {
|
|
9946
9946
|
var b, M;
|
|
9947
9947
|
if (this.leftover) {
|
|
9948
|
-
for ((M = 16 - this.leftover) > L && (M = L), b = 0; b < M; b++) this.buffer[this.leftover + b] = T[
|
|
9949
|
-
if (L -= M,
|
|
9948
|
+
for ((M = 16 - this.leftover) > L && (M = L), b = 0; b < M; b++) this.buffer[this.leftover + b] = T[C + b];
|
|
9949
|
+
if (L -= M, C += M, this.leftover += M, this.leftover < 16) return;
|
|
9950
9950
|
this.blocks(this.buffer, 0, 16), this.leftover = 0;
|
|
9951
9951
|
}
|
|
9952
|
-
if (L >= 16 && (M = L - L % 16, this.blocks(T,
|
|
9953
|
-
for (b = 0; b < L; b++) this.buffer[this.leftover + b] = T[
|
|
9952
|
+
if (L >= 16 && (M = L - L % 16, this.blocks(T, C, M), C += M, L -= M), L) {
|
|
9953
|
+
for (b = 0; b < L; b++) this.buffer[this.leftover + b] = T[C + b];
|
|
9954
9954
|
this.leftover += L;
|
|
9955
9955
|
}
|
|
9956
9956
|
};
|
|
9957
9957
|
var Zt = m, jt = l, oe = [1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163, 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394, 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206, 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139, 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692, 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879, 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895, 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823, 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921, 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344, 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616, 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403, 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452, 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573, 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271, 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315, 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470, 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591];
|
|
9958
|
-
function Qe(T,
|
|
9959
|
-
for (var M, H, Z, W, q, Y, vt, X, ct, _t, nt, ut, St, ot, ht, At, it, lt, Lt, at, K, Q, st, tt, et, rt, Pt = new Int32Array(16), $t = new Int32Array(16), Bt = T[0], Kt = T[1], Qt = T[2], Xt = T[3], kt = T[4], Tt = T[5], Rt = T[6],
|
|
9958
|
+
function Qe(T, C, L, b) {
|
|
9959
|
+
for (var M, H, Z, W, q, Y, vt, X, ct, _t, nt, ut, St, ot, ht, At, it, lt, Lt, at, K, Q, st, tt, et, rt, Pt = new Int32Array(16), $t = new Int32Array(16), Bt = T[0], Kt = T[1], Qt = T[2], Xt = T[3], kt = T[4], Tt = T[5], Rt = T[6], Ot = T[7], xt = C[0], qt = C[1], Ht = C[2], me = C[3], ue = C[4], ye = C[5], ve = C[6], xe = C[7], Ee = 0; b >= 128; ) {
|
|
9960
9960
|
for (Lt = 0; Lt < 16; Lt++) at = 8 * Lt + Ee, Pt[Lt] = L[at + 0] << 24 | L[at + 1] << 16 | L[at + 2] << 8 | L[at + 3], $t[Lt] = L[at + 4] << 24 | L[at + 5] << 16 | L[at + 6] << 8 | L[at + 7];
|
|
9961
|
-
for (Lt = 0; Lt < 80; Lt++) if (M = Bt, H = Kt, Z = Qt, W = Xt, q = kt, Y = Tt, vt = Rt, ct = xt, _t = qt, nt = Ht, ut = me, St = ue, ot =
|
|
9962
|
-
st = 65535 & (Q = xt), tt = Q >>> 16, et = 65535 & (K = Bt), rt = K >>> 16, K = T[0], tt += (Q =
|
|
9961
|
+
for (Lt = 0; Lt < 80; Lt++) if (M = Bt, H = Kt, Z = Qt, W = Xt, q = kt, Y = Tt, vt = Rt, ct = xt, _t = qt, nt = Ht, ut = me, St = ue, ot = ye, ht = ve, st = 65535 & (Q = xe), tt = Q >>> 16, et = 65535 & (K = Ot), rt = K >>> 16, st += 65535 & (Q = (ue >>> 14 | kt << 18) ^ (ue >>> 18 | kt << 14) ^ (kt >>> 9 | ue << 23)), tt += Q >>> 16, et += 65535 & (K = (kt >>> 14 | ue << 18) ^ (kt >>> 18 | ue << 14) ^ (ue >>> 9 | kt << 23)), rt += K >>> 16, st += 65535 & (Q = ue & ye ^ ~ue & ve), tt += Q >>> 16, et += 65535 & (K = kt & Tt ^ ~kt & Rt), rt += K >>> 16, st += 65535 & (Q = oe[2 * Lt + 1]), tt += Q >>> 16, et += 65535 & (K = oe[2 * Lt]), rt += K >>> 16, K = Pt[Lt % 16], tt += (Q = $t[Lt % 16]) >>> 16, et += 65535 & K, rt += K >>> 16, et += (tt += (st += 65535 & Q) >>> 16) >>> 16, st = 65535 & (Q = lt = 65535 & st | tt << 16), tt = Q >>> 16, et = 65535 & (K = it = 65535 & et | (rt += et >>> 16) << 16), rt = K >>> 16, st += 65535 & (Q = (xt >>> 28 | Bt << 4) ^ (Bt >>> 2 | xt << 30) ^ (Bt >>> 7 | xt << 25)), tt += Q >>> 16, et += 65535 & (K = (Bt >>> 28 | xt << 4) ^ (xt >>> 2 | Bt << 30) ^ (xt >>> 7 | Bt << 25)), rt += K >>> 16, tt += (Q = xt & qt ^ xt & Ht ^ qt & Ht) >>> 16, et += 65535 & (K = Bt & Kt ^ Bt & Qt ^ Kt & Qt), rt += K >>> 16, X = 65535 & (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) | (rt += et >>> 16) << 16, At = 65535 & st | tt << 16, st = 65535 & (Q = ut), tt = Q >>> 16, et = 65535 & (K = W), rt = K >>> 16, tt += (Q = lt) >>> 16, et += 65535 & (K = it), rt += K >>> 16, Kt = M, Qt = H, Xt = Z, kt = W = 65535 & (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) | (rt += et >>> 16) << 16, Tt = q, Rt = Y, Ot = vt, Bt = X, qt = ct, Ht = _t, me = nt, ue = ut = 65535 & st | tt << 16, ye = St, ve = ot, xe = ht, xt = At, Lt % 16 == 15) for (at = 0; at < 16; at++) K = Pt[at], st = 65535 & (Q = $t[at]), tt = Q >>> 16, et = 65535 & K, rt = K >>> 16, K = Pt[(at + 9) % 16], st += 65535 & (Q = $t[(at + 9) % 16]), tt += Q >>> 16, et += 65535 & K, rt += K >>> 16, it = Pt[(at + 1) % 16], st += 65535 & (Q = ((lt = $t[(at + 1) % 16]) >>> 1 | it << 31) ^ (lt >>> 8 | it << 24) ^ (lt >>> 7 | it << 25)), tt += Q >>> 16, et += 65535 & (K = (it >>> 1 | lt << 31) ^ (it >>> 8 | lt << 24) ^ it >>> 7), rt += K >>> 16, it = Pt[(at + 14) % 16], tt += (Q = ((lt = $t[(at + 14) % 16]) >>> 19 | it << 13) ^ (it >>> 29 | lt << 3) ^ (lt >>> 6 | it << 26)) >>> 16, et += 65535 & (K = (it >>> 19 | lt << 13) ^ (lt >>> 29 | it << 3) ^ it >>> 6), rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, Pt[at] = 65535 & et | rt << 16, $t[at] = 65535 & st | tt << 16;
|
|
9962
|
+
st = 65535 & (Q = xt), tt = Q >>> 16, et = 65535 & (K = Bt), rt = K >>> 16, K = T[0], tt += (Q = C[0]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[0] = Bt = 65535 & et | rt << 16, C[0] = xt = 65535 & st | tt << 16, st = 65535 & (Q = qt), tt = Q >>> 16, et = 65535 & (K = Kt), rt = K >>> 16, K = T[1], tt += (Q = C[1]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[1] = Kt = 65535 & et | rt << 16, C[1] = qt = 65535 & st | tt << 16, st = 65535 & (Q = Ht), tt = Q >>> 16, et = 65535 & (K = Qt), rt = K >>> 16, K = T[2], tt += (Q = C[2]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[2] = Qt = 65535 & et | rt << 16, C[2] = Ht = 65535 & st | tt << 16, st = 65535 & (Q = me), tt = Q >>> 16, et = 65535 & (K = Xt), rt = K >>> 16, K = T[3], tt += (Q = C[3]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[3] = Xt = 65535 & et | rt << 16, C[3] = me = 65535 & st | tt << 16, st = 65535 & (Q = ue), tt = Q >>> 16, et = 65535 & (K = kt), rt = K >>> 16, K = T[4], tt += (Q = C[4]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[4] = kt = 65535 & et | rt << 16, C[4] = ue = 65535 & st | tt << 16, st = 65535 & (Q = ye), tt = Q >>> 16, et = 65535 & (K = Tt), rt = K >>> 16, K = T[5], tt += (Q = C[5]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[5] = Tt = 65535 & et | rt << 16, C[5] = ye = 65535 & st | tt << 16, st = 65535 & (Q = ve), tt = Q >>> 16, et = 65535 & (K = Rt), rt = K >>> 16, K = T[6], tt += (Q = C[6]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[6] = Rt = 65535 & et | rt << 16, C[6] = ve = 65535 & st | tt << 16, st = 65535 & (Q = xe), tt = Q >>> 16, et = 65535 & (K = Ot), rt = K >>> 16, K = T[7], tt += (Q = C[7]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[7] = Ot = 65535 & et | rt << 16, C[7] = xe = 65535 & st | tt << 16, Ee += 128, b -= 128;
|
|
9963
9963
|
}
|
|
9964
9964
|
return b;
|
|
9965
9965
|
}
|
|
9966
|
-
function Yt(T,
|
|
9966
|
+
function Yt(T, C, L) {
|
|
9967
9967
|
var b, M = new Int32Array(8), H = new Int32Array(8), Z = new Uint8Array(256), W = L;
|
|
9968
|
-
for (M[0] = 1779033703, M[1] = 3144134277, M[2] = 1013904242, M[3] = 2773480762, M[4] = 1359893119, M[5] = 2600822924, M[6] = 528734635, M[7] = 1541459225, H[0] = 4089235720, H[1] = 2227873595, H[2] = 4271175723, H[3] = 1595750129, H[4] = 2917565137, H[5] = 725511199, H[6] = 4215389547, H[7] = 327033209, Qe(M, H,
|
|
9968
|
+
for (M[0] = 1779033703, M[1] = 3144134277, M[2] = 1013904242, M[3] = 2773480762, M[4] = 1359893119, M[5] = 2600822924, M[6] = 528734635, M[7] = 1541459225, H[0] = 4089235720, H[1] = 2227873595, H[2] = 4271175723, H[3] = 1595750129, H[4] = 2917565137, H[5] = 725511199, H[6] = 4215389547, H[7] = 327033209, Qe(M, H, C, L), L %= 128, b = 0; b < L; b++) Z[b] = C[W - L + b];
|
|
9969
9969
|
for (Z[L] = 128, Z[(L = 256 - 128 * (L < 112 ? 1 : 0)) - 9] = 0, v(Z, L - 8, W / 536870912 | 0, W << 3), Qe(M, H, Z, L), b = 0; b < 8; b++) v(T, 8 * b, M[b], H[b]);
|
|
9970
9970
|
return 0;
|
|
9971
9971
|
}
|
|
9972
|
-
function ee(T,
|
|
9972
|
+
function ee(T, C) {
|
|
9973
9973
|
var L = t(), b = t(), M = t(), H = t(), Z = t(), W = t(), q = t(), Y = t(), vt = t();
|
|
9974
|
-
D(L, T[1], T[0]), D(vt,
|
|
9974
|
+
D(L, T[1], T[0]), D(vt, C[1], C[0]), U(L, L, vt), V(b, T[0], T[1]), V(vt, C[0], C[1]), U(b, b, vt), U(M, T[3], C[3]), U(M, M, f), U(H, T[2], C[2]), V(H, H, H), D(Z, b, L), D(W, H, M), V(q, H, M), V(Y, b, L), U(T[0], Z, W), U(T[1], Y, q), U(T[2], q, W), U(T[3], Z, Y);
|
|
9975
9975
|
}
|
|
9976
|
-
function zr(T,
|
|
9976
|
+
function zr(T, C, L) {
|
|
9977
9977
|
var b;
|
|
9978
|
-
for (b = 0; b < 4; b++)
|
|
9978
|
+
for (b = 0; b < 4; b++) O(T[b], C[b], L);
|
|
9979
9979
|
}
|
|
9980
|
-
function ae(T,
|
|
9980
|
+
function ae(T, C) {
|
|
9981
9981
|
var L = t(), b = t(), M = t();
|
|
9982
|
-
|
|
9982
|
+
Nt(M, C[2]), U(L, C[0], M), U(b, C[1], M), R(T, b), T[31] ^= F(L) << 7;
|
|
9983
9983
|
}
|
|
9984
|
-
function Vt(T,
|
|
9984
|
+
function Vt(T, C, L) {
|
|
9985
9985
|
var b, M;
|
|
9986
|
-
for (g(T[0], s), g(T[1], a), g(T[2], a), g(T[3], s), M = 255; M >= 0; --M) zr(T,
|
|
9986
|
+
for (g(T[0], s), g(T[1], a), g(T[2], a), g(T[3], s), M = 255; M >= 0; --M) zr(T, C, b = L[M / 8 | 0] >> (7 & M) & 1), ee(C, T), ee(T, T), zr(T, C, b);
|
|
9987
9987
|
}
|
|
9988
|
-
function Ke(T,
|
|
9988
|
+
function Ke(T, C) {
|
|
9989
9989
|
var L = [t(), t(), t(), t()];
|
|
9990
|
-
g(L[0], u), g(L[1], p), g(L[2], a), U(L[3], u, p), Vt(T, L,
|
|
9990
|
+
g(L[0], u), g(L[1], p), g(L[2], a), U(L[3], u, p), Vt(T, L, C);
|
|
9991
9991
|
}
|
|
9992
|
-
function ie(T,
|
|
9992
|
+
function ie(T, C, L) {
|
|
9993
9993
|
var b, M = new Uint8Array(64), H = [t(), t(), t(), t()];
|
|
9994
|
-
for (L || r(
|
|
9994
|
+
for (L || r(C, 32), Yt(M, C, 32), M[0] &= 248, M[31] &= 127, M[31] |= 64, Ke(H, M), ae(T, H), b = 0; b < 32; b++) C[b + 32] = T[b];
|
|
9995
9995
|
return 0;
|
|
9996
9996
|
}
|
|
9997
9997
|
var ce = new Float64Array([237, 211, 245, 92, 26, 99, 18, 88, 214, 156, 247, 162, 222, 249, 222, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16]);
|
|
9998
|
-
function jr(T,
|
|
9998
|
+
function jr(T, C) {
|
|
9999
9999
|
var L, b, M, H;
|
|
10000
10000
|
for (b = 63; b >= 32; --b) {
|
|
10001
|
-
for (L = 0, M = b - 32, H = b - 12; M < H; ++M)
|
|
10002
|
-
|
|
10001
|
+
for (L = 0, M = b - 32, H = b - 12; M < H; ++M) C[M] += L - 16 * C[b] * ce[M - (b - 32)], L = Math.floor((C[M] + 128) / 256), C[M] -= 256 * L;
|
|
10002
|
+
C[M] += L, C[b] = 0;
|
|
10003
10003
|
}
|
|
10004
|
-
for (L = 0, M = 0; M < 32; M++)
|
|
10005
|
-
for (M = 0; M < 32; M++)
|
|
10006
|
-
for (b = 0; b < 32; b++)
|
|
10004
|
+
for (L = 0, M = 0; M < 32; M++) C[M] += L - (C[31] >> 4) * ce[M], L = C[M] >> 8, C[M] &= 255;
|
|
10005
|
+
for (M = 0; M < 32; M++) C[M] -= L * ce[M];
|
|
10006
|
+
for (b = 0; b < 32; b++) C[b + 1] += C[b] >> 8, T[b] = 255 & C[b];
|
|
10007
10007
|
}
|
|
10008
10008
|
function se(T) {
|
|
10009
|
-
var
|
|
10010
|
-
for (
|
|
10011
|
-
for (
|
|
10009
|
+
var C, L = new Float64Array(64);
|
|
10010
|
+
for (C = 0; C < 64; C++) L[C] = T[C];
|
|
10011
|
+
for (C = 0; C < 64; C++) T[C] = 0;
|
|
10012
10012
|
jr(T, L);
|
|
10013
10013
|
}
|
|
10014
|
-
function de(T,
|
|
10014
|
+
function de(T, C, L, b) {
|
|
10015
10015
|
var M, H, Z = new Uint8Array(64), W = new Uint8Array(64), q = new Uint8Array(64), Y = new Float64Array(64), vt = [t(), t(), t(), t()];
|
|
10016
10016
|
Yt(Z, b, 32), Z[0] &= 248, Z[31] &= 127, Z[31] |= 64;
|
|
10017
10017
|
var X = L + 64;
|
|
10018
|
-
for (M = 0; M < L; M++) T[64 + M] =
|
|
10018
|
+
for (M = 0; M < L; M++) T[64 + M] = C[M];
|
|
10019
10019
|
for (M = 0; M < 32; M++) T[32 + M] = Z[32 + M];
|
|
10020
10020
|
for (Yt(q, T.subarray(32), L + 32), se(q), Ke(vt, q), ae(T, vt), M = 32; M < 64; M++) T[M] = b[M];
|
|
10021
10021
|
for (Yt(W, T, L + 64), se(W), M = 0; M < 64; M++) Y[M] = 0;
|
|
@@ -10023,127 +10023,127 @@ var za = { exports: {} };
|
|
|
10023
10023
|
for (M = 0; M < 32; M++) for (H = 0; H < 32; H++) Y[M + H] += W[M] * Z[H];
|
|
10024
10024
|
return jr(T.subarray(32), Y), X;
|
|
10025
10025
|
}
|
|
10026
|
-
function Yr(T,
|
|
10026
|
+
function Yr(T, C, L, b) {
|
|
10027
10027
|
var M, H = new Uint8Array(32), Z = new Uint8Array(64), W = [t(), t(), t(), t()], q = [t(), t(), t(), t()];
|
|
10028
10028
|
if (L < 64 || function(Y, vt) {
|
|
10029
10029
|
var X = t(), ct = t(), _t = t(), nt = t(), ut = t(), St = t(), ot = t();
|
|
10030
10030
|
return g(Y[2], a), $(Y[1], vt), G(_t, Y[1]), U(nt, _t, c), D(_t, _t, Y[2]), V(nt, Y[2], nt), G(ut, nt), G(St, ut), U(ot, St, ut), U(X, ot, _t), U(X, X, nt), dt(X, X), U(X, X, _t), U(X, X, nt), U(X, X, nt), U(Y[0], X, nt), G(ct, Y[0]), U(ct, ct, nt), j(ct, _t) && U(Y[0], Y[0], w), G(ct, Y[0]), U(ct, ct, nt), j(ct, _t) ? -1 : (F(Y[0]) === vt[31] >> 7 && D(Y[0], s, Y[0]), U(Y[3], Y[0], Y[1]), 0);
|
|
10031
10031
|
}(q, b)) return -1;
|
|
10032
|
-
for (M = 0; M < L; M++) T[M] =
|
|
10032
|
+
for (M = 0; M < L; M++) T[M] = C[M];
|
|
10033
10033
|
for (M = 0; M < 32; M++) T[M + 32] = b[M];
|
|
10034
|
-
if (Yt(Z, T, L), se(Z), Vt(W, q, Z), Ke(q,
|
|
10034
|
+
if (Yt(Z, T, L), se(Z), Vt(W, q, Z), Ke(q, C.subarray(32)), ee(W, q), ae(H, W), L -= 64, _(C, 0, H, 0)) {
|
|
10035
10035
|
for (M = 0; M < L; M++) T[M] = 0;
|
|
10036
10036
|
return -1;
|
|
10037
10037
|
}
|
|
10038
|
-
for (M = 0; M < L; M++) T[M] =
|
|
10038
|
+
for (M = 0; M < L; M++) T[M] = C[M + 64];
|
|
10039
10039
|
return L;
|
|
10040
10040
|
}
|
|
10041
10041
|
var fe = 16, re = 64, $e = 32, ne = 64;
|
|
10042
|
-
function pe(T,
|
|
10042
|
+
function pe(T, C) {
|
|
10043
10043
|
if (T.length !== 32) throw new Error("bad key size");
|
|
10044
|
-
if (
|
|
10044
|
+
if (C.length !== 24) throw new Error("bad nonce size");
|
|
10045
10045
|
}
|
|
10046
10046
|
function Me() {
|
|
10047
10047
|
for (var T = 0; T < arguments.length; T++) if (!(arguments[T] instanceof Uint8Array)) throw new TypeError("unexpected type, use Uint8Array");
|
|
10048
10048
|
}
|
|
10049
10049
|
function he(T) {
|
|
10050
|
-
for (var
|
|
10050
|
+
for (var C = 0; C < T.length; C++) T[C] = 0;
|
|
10051
10051
|
}
|
|
10052
|
-
e.lowlevel = { crypto_core_hsalsa20: A, crypto_stream_xor: B, crypto_stream: z, crypto_stream_salsa20_xor: I, crypto_stream_salsa20:
|
|
10052
|
+
e.lowlevel = { crypto_core_hsalsa20: A, crypto_stream_xor: B, crypto_stream: z, crypto_stream_salsa20_xor: I, crypto_stream_salsa20: N, crypto_onetimeauth: h, crypto_onetimeauth_verify: y, crypto_verify_16: E, crypto_verify_32: _, crypto_secretbox: m, crypto_secretbox_open: l, crypto_scalarmult: gt, crypto_scalarmult_base: Ft, crypto_box_beforenm: Mt, crypto_box_afternm: Zt, crypto_box: function(T, C, L, b, M, H) {
|
|
10053
10053
|
var Z = new Uint8Array(32);
|
|
10054
|
-
return Mt(Z, M, H), Zt(T,
|
|
10055
|
-
}, crypto_box_open: function(T,
|
|
10054
|
+
return Mt(Z, M, H), Zt(T, C, L, b, Z);
|
|
10055
|
+
}, crypto_box_open: function(T, C, L, b, M, H) {
|
|
10056
10056
|
var Z = new Uint8Array(32);
|
|
10057
|
-
return Mt(Z, M, H), jt(T,
|
|
10057
|
+
return Mt(Z, M, H), jt(T, C, L, b, Z);
|
|
10058
10058
|
}, crypto_box_keypair: mt, crypto_hash: Yt, crypto_sign: de, crypto_sign_keypair: ie, crypto_sign_open: Yr, crypto_secretbox_KEYBYTES: 32, crypto_secretbox_NONCEBYTES: 24, crypto_secretbox_ZEROBYTES: 32, crypto_secretbox_BOXZEROBYTES: fe, crypto_scalarmult_BYTES: 32, crypto_scalarmult_SCALARBYTES: 32, crypto_box_PUBLICKEYBYTES: 32, crypto_box_SECRETKEYBYTES: 32, crypto_box_BEFORENMBYTES: 32, crypto_box_NONCEBYTES: 24, crypto_box_ZEROBYTES: 32, crypto_box_BOXZEROBYTES: 16, crypto_sign_BYTES: re, crypto_sign_PUBLICKEYBYTES: $e, crypto_sign_SECRETKEYBYTES: ne, crypto_sign_SEEDBYTES: 32, crypto_hash_BYTES: 64, gf: t, D: c, L: ce, pack25519: R, unpack25519: $, M: U, A: V, S: G, Z: D, pow2523: dt, add: ee, set25519: g, modL: jr, scalarmult: Vt, scalarbase: Ke }, e.randomBytes = function(T) {
|
|
10059
|
-
var
|
|
10060
|
-
return r(
|
|
10061
|
-
}, e.secretbox = function(T,
|
|
10062
|
-
Me(T,
|
|
10059
|
+
var C = new Uint8Array(T);
|
|
10060
|
+
return r(C, T), C;
|
|
10061
|
+
}, e.secretbox = function(T, C, L) {
|
|
10062
|
+
Me(T, C, L), pe(L, C);
|
|
10063
10063
|
for (var b = new Uint8Array(32 + T.length), M = new Uint8Array(b.length), H = 0; H < T.length; H++) b[H + 32] = T[H];
|
|
10064
|
-
return m(M, b, b.length,
|
|
10065
|
-
}, e.secretbox.open = function(T,
|
|
10066
|
-
Me(T,
|
|
10064
|
+
return m(M, b, b.length, C, L), M.subarray(fe);
|
|
10065
|
+
}, e.secretbox.open = function(T, C, L) {
|
|
10066
|
+
Me(T, C, L), pe(L, C);
|
|
10067
10067
|
for (var b = new Uint8Array(fe + T.length), M = new Uint8Array(b.length), H = 0; H < T.length; H++) b[H + fe] = T[H];
|
|
10068
|
-
return b.length < 32 || l(M, b, b.length,
|
|
10069
|
-
}, e.secretbox.keyLength = 32, e.secretbox.nonceLength = 24, e.secretbox.overheadLength = fe, e.scalarMult = function(T,
|
|
10070
|
-
if (Me(T,
|
|
10071
|
-
if (
|
|
10068
|
+
return b.length < 32 || l(M, b, b.length, C, L) !== 0 ? null : M.subarray(32);
|
|
10069
|
+
}, e.secretbox.keyLength = 32, e.secretbox.nonceLength = 24, e.secretbox.overheadLength = fe, e.scalarMult = function(T, C) {
|
|
10070
|
+
if (Me(T, C), T.length !== 32) throw new Error("bad n size");
|
|
10071
|
+
if (C.length !== 32) throw new Error("bad p size");
|
|
10072
10072
|
var L = new Uint8Array(32);
|
|
10073
|
-
return gt(L, T,
|
|
10073
|
+
return gt(L, T, C), L;
|
|
10074
10074
|
}, e.scalarMult.base = function(T) {
|
|
10075
10075
|
if (Me(T), T.length !== 32) throw new Error("bad n size");
|
|
10076
|
-
var
|
|
10077
|
-
return Ft(
|
|
10078
|
-
}, e.scalarMult.scalarLength = 32, e.scalarMult.groupElementLength = 32, e.box = function(T,
|
|
10076
|
+
var C = new Uint8Array(32);
|
|
10077
|
+
return Ft(C, T), C;
|
|
10078
|
+
}, e.scalarMult.scalarLength = 32, e.scalarMult.groupElementLength = 32, e.box = function(T, C, L, b) {
|
|
10079
10079
|
var M = e.box.before(L, b);
|
|
10080
|
-
return e.secretbox(T,
|
|
10081
|
-
}, e.box.before = function(T,
|
|
10082
|
-
Me(T,
|
|
10080
|
+
return e.secretbox(T, C, M);
|
|
10081
|
+
}, e.box.before = function(T, C) {
|
|
10082
|
+
Me(T, C), function(b, M) {
|
|
10083
10083
|
if (b.length !== 32) throw new Error("bad public key size");
|
|
10084
10084
|
if (M.length !== 32) throw new Error("bad secret key size");
|
|
10085
|
-
}(T,
|
|
10085
|
+
}(T, C);
|
|
10086
10086
|
var L = new Uint8Array(32);
|
|
10087
|
-
return Mt(L, T,
|
|
10088
|
-
}, e.box.after = e.secretbox, e.box.open = function(T,
|
|
10087
|
+
return Mt(L, T, C), L;
|
|
10088
|
+
}, e.box.after = e.secretbox, e.box.open = function(T, C, L, b) {
|
|
10089
10089
|
var M = e.box.before(L, b);
|
|
10090
|
-
return e.secretbox.open(T,
|
|
10090
|
+
return e.secretbox.open(T, C, M);
|
|
10091
10091
|
}, e.box.open.after = e.secretbox.open, e.box.keyPair = function() {
|
|
10092
|
-
var T = new Uint8Array(32),
|
|
10093
|
-
return mt(T,
|
|
10092
|
+
var T = new Uint8Array(32), C = new Uint8Array(32);
|
|
10093
|
+
return mt(T, C), { publicKey: T, secretKey: C };
|
|
10094
10094
|
}, e.box.keyPair.fromSecretKey = function(T) {
|
|
10095
10095
|
if (Me(T), T.length !== 32) throw new Error("bad secret key size");
|
|
10096
|
-
var
|
|
10097
|
-
return Ft(
|
|
10098
|
-
}, e.box.publicKeyLength = 32, e.box.secretKeyLength = 32, e.box.sharedKeyLength = 32, e.box.nonceLength = 24, e.box.overheadLength = e.secretbox.overheadLength, e.sign = function(T,
|
|
10099
|
-
if (Me(T,
|
|
10096
|
+
var C = new Uint8Array(32);
|
|
10097
|
+
return Ft(C, T), { publicKey: C, secretKey: new Uint8Array(T) };
|
|
10098
|
+
}, e.box.publicKeyLength = 32, e.box.secretKeyLength = 32, e.box.sharedKeyLength = 32, e.box.nonceLength = 24, e.box.overheadLength = e.secretbox.overheadLength, e.sign = function(T, C) {
|
|
10099
|
+
if (Me(T, C), C.length !== ne) throw new Error("bad secret key size");
|
|
10100
10100
|
var L = new Uint8Array(re + T.length);
|
|
10101
|
-
return de(L, T, T.length,
|
|
10102
|
-
}, e.sign.open = function(T,
|
|
10103
|
-
if (Me(T,
|
|
10104
|
-
var L = new Uint8Array(T.length), b = Yr(L, T, T.length,
|
|
10101
|
+
return de(L, T, T.length, C), L;
|
|
10102
|
+
}, e.sign.open = function(T, C) {
|
|
10103
|
+
if (Me(T, C), C.length !== $e) throw new Error("bad public key size");
|
|
10104
|
+
var L = new Uint8Array(T.length), b = Yr(L, T, T.length, C);
|
|
10105
10105
|
if (b < 0) return null;
|
|
10106
10106
|
for (var M = new Uint8Array(b), H = 0; H < M.length; H++) M[H] = L[H];
|
|
10107
10107
|
return M;
|
|
10108
|
-
}, e.sign.detached = function(T,
|
|
10109
|
-
for (var L = e.sign(T,
|
|
10108
|
+
}, e.sign.detached = function(T, C) {
|
|
10109
|
+
for (var L = e.sign(T, C), b = new Uint8Array(re), M = 0; M < b.length; M++) b[M] = L[M];
|
|
10110
10110
|
return b;
|
|
10111
|
-
}, e.sign.detached.verify = function(T,
|
|
10112
|
-
if (Me(T,
|
|
10111
|
+
}, e.sign.detached.verify = function(T, C, L) {
|
|
10112
|
+
if (Me(T, C, L), C.length !== re) throw new Error("bad signature size");
|
|
10113
10113
|
if (L.length !== $e) throw new Error("bad public key size");
|
|
10114
10114
|
var b, M = new Uint8Array(re + T.length), H = new Uint8Array(re + T.length);
|
|
10115
|
-
for (b = 0; b < re; b++) M[b] =
|
|
10115
|
+
for (b = 0; b < re; b++) M[b] = C[b];
|
|
10116
10116
|
for (b = 0; b < T.length; b++) M[b + re] = T[b];
|
|
10117
10117
|
return Yr(H, M, M.length, L) >= 0;
|
|
10118
10118
|
}, e.sign.keyPair = function() {
|
|
10119
|
-
var T = new Uint8Array($e),
|
|
10120
|
-
return ie(T,
|
|
10119
|
+
var T = new Uint8Array($e), C = new Uint8Array(ne);
|
|
10120
|
+
return ie(T, C), { publicKey: T, secretKey: C };
|
|
10121
10121
|
}, e.sign.keyPair.fromSecretKey = function(T) {
|
|
10122
10122
|
if (Me(T), T.length !== ne) throw new Error("bad secret key size");
|
|
10123
|
-
for (var
|
|
10124
|
-
return { publicKey:
|
|
10123
|
+
for (var C = new Uint8Array($e), L = 0; L < C.length; L++) C[L] = T[32 + L];
|
|
10124
|
+
return { publicKey: C, secretKey: new Uint8Array(T) };
|
|
10125
10125
|
}, e.sign.keyPair.fromSeed = function(T) {
|
|
10126
10126
|
if (Me(T), T.length !== 32) throw new Error("bad seed size");
|
|
10127
|
-
for (var
|
|
10128
|
-
return ie(
|
|
10127
|
+
for (var C = new Uint8Array($e), L = new Uint8Array(ne), b = 0; b < 32; b++) L[b] = T[b];
|
|
10128
|
+
return ie(C, L, !0), { publicKey: C, secretKey: L };
|
|
10129
10129
|
}, e.sign.publicKeyLength = $e, e.sign.secretKeyLength = ne, e.sign.seedLength = 32, e.sign.signatureLength = re, e.hash = function(T) {
|
|
10130
10130
|
Me(T);
|
|
10131
|
-
var
|
|
10132
|
-
return Yt(
|
|
10133
|
-
}, e.hash.hashLength = 64, e.verify = function(T,
|
|
10134
|
-
return Me(T,
|
|
10131
|
+
var C = new Uint8Array(64);
|
|
10132
|
+
return Yt(C, T, T.length), C;
|
|
10133
|
+
}, e.hash.hashLength = 64, e.verify = function(T, C) {
|
|
10134
|
+
return Me(T, C), T.length !== 0 && C.length !== 0 && T.length === C.length && S(T, 0, C, 0, T.length) === 0;
|
|
10135
10135
|
}, e.setPRNG = function(T) {
|
|
10136
10136
|
r = T;
|
|
10137
10137
|
}, function() {
|
|
10138
10138
|
var T = typeof self < "u" ? self.crypto || self.msCrypto : null;
|
|
10139
|
-
T && T.getRandomValues ? e.setPRNG(function(
|
|
10139
|
+
T && T.getRandomValues ? e.setPRNG(function(C, L) {
|
|
10140
10140
|
var b, M = new Uint8Array(L);
|
|
10141
10141
|
for (b = 0; b < L; b += 65536) T.getRandomValues(M.subarray(b, b + Math.min(L - b, 65536)));
|
|
10142
|
-
for (b = 0; b < L; b++)
|
|
10142
|
+
for (b = 0; b < L; b++) C[b] = M[b];
|
|
10143
10143
|
he(M);
|
|
10144
|
-
}) : Tf !== void 0 && (T = Ds) && T.randomBytes && e.setPRNG(function(
|
|
10144
|
+
}) : Tf !== void 0 && (T = Ds) && T.randomBytes && e.setPRNG(function(C, L) {
|
|
10145
10145
|
var b, M = T.randomBytes(L);
|
|
10146
|
-
for (b = 0; b < L; b++)
|
|
10146
|
+
for (b = 0; b < L; b++) C[b] = M[b];
|
|
10147
10147
|
he(M);
|
|
10148
10148
|
});
|
|
10149
10149
|
}();
|
|
@@ -10227,7 +10227,7 @@ const _i = di(za.exports), We = new class {
|
|
|
10227
10227
|
}(), li = new class {
|
|
10228
10228
|
constructor() {
|
|
10229
10229
|
un(this, "ec");
|
|
10230
|
-
this.ec = new
|
|
10230
|
+
this.ec = new Nf.ec("secp256k1");
|
|
10231
10231
|
}
|
|
10232
10232
|
xphereSign(e, t) {
|
|
10233
10233
|
return js.signature(e, t);
|
|
@@ -10255,7 +10255,7 @@ const _i = di(za.exports), We = new class {
|
|
|
10255
10255
|
generateNonce(e) {
|
|
10256
10256
|
return Se.lib.WordArray.random(e).toString(Se.enc.Hex);
|
|
10257
10257
|
}
|
|
10258
|
-
}(), Z3 = process.env.NEXT_PUBLIC_SOCKET_ENCRYPTED_URL || "U2FsdGVkX1/
|
|
10258
|
+
}(), Z3 = process.env.NEXT_PUBLIC_SOCKET_ENCRYPTED_URL || "U2FsdGVkX1/AwMMZnNr4G2NTST+dY/+I4t4uQ1N+lRMGO+z74ea5JnDKHURuFYuo", V3 = process.env.NEXT_PUBLIC_SOCKET_KEY || "040b379acb21f6ee7c162051a8cca5eee45ad330362fe721d55d81e8c1a4ed44ce4d4fcf7afe6311056fe4677773bd2cf5df4c6ce13795a69b70ef3762b5445687", q1 = li.decrypt(Z3, V3);
|
|
10259
10259
|
if (!q1) throw new Error("VITE_SOCKET_URL 환경 변수가 설정되지 않았습니다.");
|
|
10260
10260
|
const wn = class wn {
|
|
10261
10261
|
constructor() {
|
|
@@ -10379,7 +10379,7 @@ const yt = new class {
|
|
|
10379
10379
|
}, [e, t, r, n]);
|
|
10380
10380
|
}, K3 = li.generateNonce(4), W3 = Date.now();
|
|
10381
10381
|
let Jd = !1;
|
|
10382
|
-
const
|
|
10382
|
+
const be = (e, t = "") => {
|
|
10383
10383
|
if (typeof document > "u") return;
|
|
10384
10384
|
const r = `[dl] +${Date.now() - W3}ms ${e} | vis=${document.visibilityState} focus=${document.hasFocus()} ${t} load=${K3}`;
|
|
10385
10385
|
console.log(r.replace(/\s+/g, " ").trim());
|
|
@@ -10387,17 +10387,17 @@ const xe = (e, t = "") => {
|
|
|
10387
10387
|
e.addEventListener(t, r);
|
|
10388
10388
|
}, Y3 = () => {
|
|
10389
10389
|
if (Jd || typeof window > "u") return;
|
|
10390
|
-
Jd = !0,
|
|
10390
|
+
Jd = !0, be("probes-installed", `navType=${(() => {
|
|
10391
10391
|
try {
|
|
10392
10392
|
const t = performance.getEntriesByType("navigation")[0];
|
|
10393
10393
|
return (t == null ? void 0 : t.type) ?? "unknown";
|
|
10394
10394
|
} catch {
|
|
10395
10395
|
return "unknown";
|
|
10396
10396
|
}
|
|
10397
|
-
})()}`), pn(document, "visibilitychange", () =>
|
|
10397
|
+
})()}`), pn(document, "visibilitychange", () => be("visibilitychange")), pn(window, "pageshow", (t) => be("pageshow", `persisted=${t.persisted}`)), pn(window, "pagehide", (t) => be("pagehide", `persisted=${t.persisted}`)), pn(window, "focus", () => be("focus")), pn(window, "blur", () => be("blur")), pn(document, "freeze", () => be("freeze")), pn(document, "resume", () => be("resume"));
|
|
10398
10398
|
const e = $s.getInstance().socket;
|
|
10399
|
-
e.on("connect", () =>
|
|
10400
|
-
}, ja = "deeplink:resume:",
|
|
10399
|
+
e.on("connect", () => be("socket:connect", `id=${e.id}`)), e.on("disconnect", (t) => be("socket:disconnect", `reason=${t}`)), e.io.on("reconnect_attempt", (t) => be("socket:reconnect_attempt", `n=${t}`)), e.io.on("reconnect", (t) => be("socket:reconnect", `n=${t}`)), e.io.on("reconnect_error", () => be("socket:reconnect_error"));
|
|
10400
|
+
}, ja = "deeplink:resume:", Oo = (e) => `${ja}${e}`, rn = new class {
|
|
10401
10401
|
register(e, t) {
|
|
10402
10402
|
yt.registerMessage(e, t);
|
|
10403
10403
|
}
|
|
@@ -10405,11 +10405,11 @@ const xe = (e, t = "") => {
|
|
|
10405
10405
|
yt.joinRoom(e), yt.resumeRoom(e);
|
|
10406
10406
|
}
|
|
10407
10407
|
snapshotSave(e) {
|
|
10408
|
-
typeof localStorage < "u" && (localStorage.setItem(
|
|
10408
|
+
typeof localStorage < "u" && (localStorage.setItem(Oo(e.roomId), JSON.stringify(e)), be("snapshot:save", `room=${e.roomId.slice(0, 8)}`));
|
|
10409
10409
|
}
|
|
10410
10410
|
snapshotLoad(e) {
|
|
10411
10411
|
if (typeof localStorage > "u") return null;
|
|
10412
|
-
const t = localStorage.getItem(
|
|
10412
|
+
const t = localStorage.getItem(Oo(e));
|
|
10413
10413
|
if (!t) return null;
|
|
10414
10414
|
try {
|
|
10415
10415
|
return JSON.parse(t);
|
|
@@ -10418,7 +10418,7 @@ const xe = (e, t = "") => {
|
|
|
10418
10418
|
}
|
|
10419
10419
|
}
|
|
10420
10420
|
snapshotClear(e) {
|
|
10421
|
-
typeof localStorage < "u" && (localStorage.removeItem(
|
|
10421
|
+
typeof localStorage < "u" && (localStorage.removeItem(Oo(e)), be("snapshot:clear", `room=${e.slice(0, 8)}`), console.trace("[dl] snapshot:clear caller"));
|
|
10422
10422
|
}
|
|
10423
10423
|
snapshotClearAll() {
|
|
10424
10424
|
if (typeof localStorage > "u") return;
|
|
@@ -10427,7 +10427,7 @@ const xe = (e, t = "") => {
|
|
|
10427
10427
|
const r = localStorage.key(t);
|
|
10428
10428
|
r && r.startsWith(ja) && e.push(r);
|
|
10429
10429
|
}
|
|
10430
|
-
e.forEach((t) => localStorage.removeItem(t)),
|
|
10430
|
+
e.forEach((t) => localStorage.removeItem(t)), be("snapshot:clearAll", `count=${e.length}`), console.trace("[dl] snapshot:clearAll caller");
|
|
10431
10431
|
}
|
|
10432
10432
|
snapshotLoadAnyPending(e = Date.now(), t = 3e5) {
|
|
10433
10433
|
if (typeof localStorage > "u") return null;
|
|
@@ -10463,26 +10463,28 @@ const xe = (e, t = "") => {
|
|
|
10463
10463
|
const p = hr(!1), w = hr(0), v = hr(!1);
|
|
10464
10464
|
tr(() => {
|
|
10465
10465
|
if (!o || !e || !pi.isMobile()) return;
|
|
10466
|
-
if (Y3(),
|
|
10466
|
+
if (Y3(), be("resume-hook-mount", `roomId=${e.slice(0, 8)} resumeFromReload=${c} pendingSnap=${rn.snapshotLoadAnyPending() ? "y" : "n"}`), !c && !p.current) {
|
|
10467
10467
|
p.current = !0, rn.snapshotSave(((z, B, d) => ({ roomId: z, type: d, status: "pending", nonce: B, startedAt: Date.now() }))(e, t, r));
|
|
10468
|
-
const
|
|
10469
|
-
rn.register(e,
|
|
10470
|
-
}
|
|
10471
|
-
const S = (
|
|
10472
|
-
|
|
10473
|
-
|
|
10474
|
-
|
|
10475
|
-
|
|
10468
|
+
const N = { roomId: e, type: r, payload: n, nonce: t, ttl: a };
|
|
10469
|
+
rn.register(e, N);
|
|
10470
|
+
}
|
|
10471
|
+
const S = (N) => {
|
|
10472
|
+
const z = N.result;
|
|
10473
|
+
if (be("handleResult", `status=${N.status} hasAddr=${!!(z != null && z.address)} keys=${z ? Object.keys(z).join("|") : "none"}`), v.current) return void be("result:duplicate-ignored");
|
|
10474
|
+
f.current(N) ? (v.current = !0, rn.snapshotClear(e), be("result:delivered")) : be("result:ignored-kept-snapshot");
|
|
10475
|
+
}, E = /* @__PURE__ */ ((N) => N === "sendTransaction" ? "completeSendTransaction" : N === "payment" ? "transactionInfo" : N === "provide" ? "addressProvide" : "completeMessage")(r);
|
|
10476
|
+
yt.onMessageReceived(E, (N) => {
|
|
10477
|
+
S({ status: "SUCCESS", result: N });
|
|
10476
10478
|
});
|
|
10477
|
-
const _ = (
|
|
10479
|
+
const _ = (N = "unknown", z = !1) => {
|
|
10478
10480
|
var l;
|
|
10479
10481
|
const B = z ? "visible" : (d = document.visibilityState, h = document.hasFocus(), d === "visible" || h ? "visible" : d);
|
|
10480
10482
|
var d, h;
|
|
10481
|
-
const y = rn.snapshotLoad(e), m = ((g, x,
|
|
10482
|
-
if (
|
|
10483
|
+
const y = rn.snapshotLoad(e), m = ((g, x, O = Date.now(), R = 3e5) => g && g.status === "pending" ? x !== "visible" ? "noop" : O - g.startedAt >= R ? "timeout" : "resume" : "noop")(y, B, Date.now(), a);
|
|
10484
|
+
if (be("handleResume", `by=${N} fg=${B} snap=${y ? "y" : "n"} action=${m}`), m === "resume") {
|
|
10483
10485
|
const g = Date.now();
|
|
10484
|
-
if (!z && g - w.current < 1e3) return void
|
|
10485
|
-
w.current = g, (l = u.current) == null || l.call(u), rn.resume(e),
|
|
10486
|
+
if (!z && g - w.current < 1e3) return void be("resume:deduped", `by=${N}`);
|
|
10487
|
+
w.current = g, (l = u.current) == null || l.call(u), rn.resume(e), be("resume:fired", `by=${N} roomId=${e.slice(0, 8)}`);
|
|
10486
10488
|
} else m === "timeout" && S({ status: "TIMEOUT" });
|
|
10487
10489
|
}, k = () => {
|
|
10488
10490
|
document.visibilityState === "visible" && _("visibilitychange");
|
|
@@ -10491,14 +10493,14 @@ const xe = (e, t = "") => {
|
|
|
10491
10493
|
document.removeEventListener("visibilitychange", k), window.removeEventListener("pageshow", A), window.removeEventListener("focus", P), yt.offReconnect(I), yt.offMessageReceived(E);
|
|
10492
10494
|
};
|
|
10493
10495
|
}, [e, t, r, n, a, o, c]);
|
|
10494
|
-
},
|
|
10495
|
-
typeof window < "u" && (localStorage.removeItem(
|
|
10496
|
+
}, On = "userInfo", ti = "YYYY-MM-DD HH:mm:ss", Q3 = () => {
|
|
10497
|
+
typeof window < "u" && (localStorage.removeItem(On), rn.snapshotClearAll());
|
|
10496
10498
|
}, s5 = () => {
|
|
10497
10499
|
const [e, t] = Te(!1), [r, n] = Te(void 0), [i, s] = Te(void 0);
|
|
10498
10500
|
return tr(() => {
|
|
10499
10501
|
if (typeof window < "u") {
|
|
10500
10502
|
t(!0);
|
|
10501
|
-
const a = localStorage.getItem(
|
|
10503
|
+
const a = localStorage.getItem(On);
|
|
10502
10504
|
if (a) {
|
|
10503
10505
|
const o = JSON.parse(a);
|
|
10504
10506
|
n(o);
|
|
@@ -10507,7 +10509,7 @@ const xe = (e, t = "") => {
|
|
|
10507
10509
|
}, []), tr(() => {
|
|
10508
10510
|
if (r && r.expire.type !== "NONE") {
|
|
10509
10511
|
const { type: a, seconds: o } = r.expire, c = Yn().add(o, "seconds").format(ti), f = Yn(r.issuedDateTime).add(o, "seconds").format(ti), u = a === "EXTEND" ? c : f;
|
|
10510
|
-
s(u), Yn().format(ti) > u && (localStorage.removeItem(
|
|
10512
|
+
s(u), Yn().format(ti) > u && (localStorage.removeItem(On), window.location.reload());
|
|
10511
10513
|
}
|
|
10512
10514
|
}, [r]), { userInfo: { address: (r == null ? void 0 : r.address) ?? void 0, network: (r == null ? void 0 : r.network) ?? void 0, nickName: (r == null ? void 0 : r.nickName) ?? void 0, token: (r == null ? void 0 : r.token) ?? void 0, issuedDateTime: (r == null ? void 0 : r.issuedDateTime) ?? void 0, expireDateTime: i }, logout: () => {
|
|
10513
10515
|
Q3(), n(void 0);
|
|
@@ -10630,16 +10632,16 @@ const Ln = new class {
|
|
|
10630
10632
|
}(), rs = "data:image/svg+xml,%3csvg%20width='167'%20height='166'%20viewBox='0%200%20167%20166'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cpath%20fill-rule='evenodd'%20clip-rule='evenodd'%20d='M116.052%20115.296H166.355H166.36V0H51.0675V50.3042H0.759995V165.6H116.052V115.296ZM90.3366%2065.3428L40.21%20115.296H40.4307L40.2551%20115.471H101.014V150.561H15.7981V65.3428H90.3366ZM76.7327%20100.257H151.317V15.0386H66.1006V50.1536L109.424%2050.3042H126.684L126.624%2050.364L126.669%2050.3642L113.846%2063.1431L76.7327%20100.257Z'%20fill='url(%23paint0_linear_2322_66)'/%3e%3cdefs%3e%3clinearGradient%20id='paint0_linear_2322_66'%20x1='167.74'%20y1='-2.07'%20x2='-3.37985'%20y2='172.5'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%231349F8'/%3e%3cstop%20offset='1'%20stop-color='%235C13F8'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", o5 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire: c, icon: f, size: u, processingMark: p = { type: "DEFAULT" }, qrDomain: w, ...v }) => {
|
|
10631
10633
|
const [S, E] = Te(!1), _ = pi.isMobile(), { roomId: k, nonce: A, qrCode: P, resumeFromReload: I } = so(_, () => Ln.generateLoginQrCode(t, r, e, f, "login", w));
|
|
10632
10634
|
oo(k);
|
|
10633
|
-
const
|
|
10635
|
+
const N = mi(k, s), { isResuming: z } = (({ roomId: d, nonce: h, qrCode: y, sigMessage: m, expire: l, validSeconds: g, isMobile: x, isValid: O, resumeFromReload: R, onReceive: j }) => {
|
|
10634
10636
|
const [F, $] = Te(!1), V = Yi((D) => {
|
|
10635
|
-
if (D.status === "TIMEOUT") return
|
|
10637
|
+
if (D.status === "TIMEOUT") return j == null || j({ status: "ERROR" }), !0;
|
|
10636
10638
|
const U = D.result;
|
|
10637
|
-
U != null && U.address && (U1(U, m, h, l), j == null || j({ status: "SUCCESS", result: U }), localStorage.setItem(
|
|
10639
|
+
return !!(U != null && U.address) && (U1(U, m, h, l), j == null || j({ status: "SUCCESS", result: U }), localStorage.setItem(On, JSON.stringify(U)), !0);
|
|
10638
10640
|
}, [j, m, h, l]);
|
|
10639
10641
|
return es({ roomId: d, nonce: h, type: "login", payload: `${m}
|
|
10640
10642
|
|
|
10641
|
-
Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: y, isMobile: x, isValid:
|
|
10642
|
-
})({ roomId: k, nonce: A, qrCode: P, sigMessage: n, expire: c, validSeconds: s, isMobile: _, isValid:
|
|
10643
|
+
Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: y, isMobile: x, isValid: O, resumeFromReload: R }), { isResuming: F };
|
|
10644
|
+
})({ roomId: k, nonce: A, qrCode: P, sigMessage: n, expire: c, validSeconds: s, isMobile: _, isValid: N, resumeFromReload: I, onReceive: i }), B = hr(i);
|
|
10643
10645
|
return B.current = i, tr(() => {
|
|
10644
10646
|
if (!_)
|
|
10645
10647
|
return (async () => {
|
|
@@ -10651,8 +10653,8 @@ Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void
|
|
|
10651
10653
|
(h = B.current) == null || h.call(B, { status: "ACCOUNT" });
|
|
10652
10654
|
const x = `${n}
|
|
10653
10655
|
|
|
10654
|
-
Nonce: ${A}`,
|
|
10655
|
-
(y = B.current) == null || y.call(B, { status: "SUCCESS", result: F }), E(!1), localStorage.setItem(
|
|
10656
|
+
Nonce: ${A}`, O = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void 0 : c.seconds) ?? 0, j = { publicKey: g.publicKey, message: x }, F = { address: g.address, network: g.network, nickName: g.nickName, token: uc.Validation.createToken(j, g.signature), issuedDateTime: Yn().format(ti), isVerified: g.isVerified, signature: g.signature, expire: O === "NONE" ? { type: O } : { type: O, seconds: R } };
|
|
10657
|
+
(y = B.current) == null || y.call(B, { status: "SUCCESS", result: F }), E(!1), localStorage.setItem(On, JSON.stringify(F));
|
|
10656
10658
|
}
|
|
10657
10659
|
} catch {
|
|
10658
10660
|
(m = B.current) == null || m.call(B, { status: "ERROR" }), E(!1);
|
|
@@ -10660,18 +10662,18 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10660
10662
|
})(), () => {
|
|
10661
10663
|
yt.offMessageReceived("requestMessage"), yt.offMessageReceived("accountInfo"), yt.offMessageReceived("checkVerified");
|
|
10662
10664
|
};
|
|
10663
|
-
}, [_, k, n]),
|
|
10665
|
+
}, [_, k, n]), N ? Ct.jsx(Ct.Fragment, { children: S && p.type !== "NONE" ? Ct.jsx(Co, { $size: u, children: ((d) => {
|
|
10664
10666
|
switch (d) {
|
|
10665
10667
|
case "DEFAULT":
|
|
10666
|
-
return
|
|
10668
|
+
return Ct.jsx(Bo, { children: "processing..." });
|
|
10667
10669
|
case "NONE":
|
|
10668
10670
|
default:
|
|
10669
10671
|
return;
|
|
10670
10672
|
case "CUSTOM":
|
|
10671
10673
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10672
10674
|
}
|
|
10673
|
-
})(p.type) }) : _ ?
|
|
10674
|
-
},
|
|
10675
|
+
})(p.type) }) : _ ? Ct.jsx(Co, { $size: u, children: Ct.jsx(Bo, { children: z ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ct.jsx(Cn, { value: P, size: u, ...a && { imageSettings: { src: rs, width: o, height: o, excavate: !1 } }, ...v }) }) : Ct.jsx(Co, { children: Ct.jsx(Bo, { children: "QR timeout" }) });
|
|
10676
|
+
}, Co = lr.div`
|
|
10675
10677
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10676
10678
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10677
10679
|
display: flex;
|
|
@@ -10723,13 +10725,13 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10723
10725
|
}(), a5 = ({ network: e, dapp: t, address: r, amount: n, description: i, info: s, onReceive: a, validSeconds: o, isShowLogo: c = !1, logoSize: f = 30, size: u, processingMark: p = { type: "DEFAULT" }, ...w }) => {
|
|
10724
10726
|
const [v, S] = Te(!1), E = pi.isMobile(), { roomId: _, nonce: k, qrCode: A, resumeFromReload: P } = so(E, () => Ln.generatePaymentQrCode(t, e, r, n, i, s));
|
|
10725
10727
|
oo(_);
|
|
10726
|
-
const I = mi(_, o), { isResuming:
|
|
10728
|
+
const I = mi(_, o), { isResuming: N } = (({ roomId: B, nonce: d, qrCode: h, network: y, address: m, amount: l, validSeconds: g, isMobile: x, isValid: O, resumeFromReload: R, onReceive: j }) => {
|
|
10727
10729
|
const [F, $] = Te(!1), V = Yi((D) => {
|
|
10728
|
-
if (D.status === "TIMEOUT") return
|
|
10730
|
+
if (D.status === "TIMEOUT") return j == null || j({ status: "ERROR" }), !0;
|
|
10729
10731
|
const U = D.result;
|
|
10730
|
-
U
|
|
10732
|
+
return !(!U || !U.txHash || (j == null || j({ status: "SUCCESS" }), 0));
|
|
10731
10733
|
}, [j]);
|
|
10732
|
-
return es({ roomId: B, nonce: d, type: "payment", payload: JSON.stringify({ network: y, address: m, amount: l }), onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: h, isMobile: x, isValid:
|
|
10734
|
+
return es({ roomId: B, nonce: d, type: "payment", payload: JSON.stringify({ network: y, address: m, amount: l }), onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: h, isMobile: x, isValid: O, resumeFromReload: R }), { isResuming: F };
|
|
10733
10735
|
})({ roomId: _, nonce: k, qrCode: A, network: e, address: r, amount: n, validSeconds: o, isMobile: E, isValid: I, resumeFromReload: P, onReceive: a }), z = hr(a);
|
|
10734
10736
|
return z.current = a, tr(() => {
|
|
10735
10737
|
if (!E)
|
|
@@ -10744,17 +10746,17 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10744
10746
|
})(), () => {
|
|
10745
10747
|
yt.offMessageReceived("startPayment"), yt.offMessageReceived("healthCheck"), yt.offMessageReceived("transactionInfo");
|
|
10746
10748
|
};
|
|
10747
|
-
}, [E, _]), I ?
|
|
10749
|
+
}, [E, _]), I ? Ct.jsx(Ct.Fragment, { children: v && p.type !== "NONE" ? Ct.jsx(Po, { $size: u, children: ((B) => {
|
|
10748
10750
|
switch (B) {
|
|
10749
10751
|
case "DEFAULT":
|
|
10750
|
-
return
|
|
10752
|
+
return Ct.jsx(Lo, { children: "processing..." });
|
|
10751
10753
|
case "NONE":
|
|
10752
10754
|
default:
|
|
10753
10755
|
return;
|
|
10754
10756
|
case "CUSTOM":
|
|
10755
10757
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10756
10758
|
}
|
|
10757
|
-
})(p.type) }) : E ?
|
|
10759
|
+
})(p.type) }) : E ? Ct.jsx(Po, { $size: u, children: Ct.jsx(Lo, { children: N ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ct.jsx(Cn, { value: A, size: u, ...c && { imageSettings: { src: rs, width: f, height: f, excavate: !1 } }, ...w }) }) : Ct.jsx(Po, { children: Ct.jsx(Lo, { children: "QR timeout" }) });
|
|
10758
10760
|
}, Po = lr.div`
|
|
10759
10761
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10760
10762
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10798,10 +10800,8 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10798
10800
|
}
|
|
10799
10801
|
})(), () => yt.offMessageReceived("addressProvide")), [k]);
|
|
10800
10802
|
})({ roomId: S, onReceive: i });
|
|
10801
|
-
const _ = Yi((k) => {
|
|
10802
|
-
|
|
10803
|
-
}, [i]);
|
|
10804
|
-
return es({ roomId: S, nonce: w, type: "provide", payload: { dapp: t, url: r }, onResult: _, onResume: () => u(!0), timeoutMs: n ? 1e3 * n : void 0 }), ts({ qrCode: v, isMobile: p, isValid: E }), E ? p ? Ot.jsx(X3, { children: Ot.jsx(t5, { children: f ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ot.jsx(On, { value: v, ...s && { imageSettings: { src: rs, width: a, height: a, excavate: !1 } }, ...c }) : Ot.jsx("div", { children: "QR loading error" });
|
|
10803
|
+
const _ = Yi((k) => k.status === "TIMEOUT" ? (i({ isSuccess: !1 }), !0) : (i({ isSuccess: !0 }), !0), [i]);
|
|
10804
|
+
return es({ roomId: S, nonce: w, type: "provide", payload: { dapp: t, url: r }, onResult: _, onResume: () => u(!0), timeoutMs: n ? 1e3 * n : void 0 }), ts({ qrCode: v, isMobile: p, isValid: E }), E ? p ? Ct.jsx(X3, { children: Ct.jsx(t5, { children: f ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ct.jsx(Cn, { value: v, ...s && { imageSettings: { src: rs, width: a, height: a, excavate: !1 } }, ...c }) : Ct.jsx("div", { children: "QR loading error" });
|
|
10805
10805
|
}, X3 = lr.div`
|
|
10806
10806
|
width: 128px;
|
|
10807
10807
|
height: 128px;
|
|
@@ -10836,25 +10836,25 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10836
10836
|
}, []);
|
|
10837
10837
|
const k = mi(w, 60 * r), A = hr(n);
|
|
10838
10838
|
return A.current = n, tr(() => ((async () => {
|
|
10839
|
-
var P, I,
|
|
10839
|
+
var P, I, N, z;
|
|
10840
10840
|
try {
|
|
10841
|
-
(await Xd.startAirdrop(w)).isSuccess && (p(!0), (P = A.current) == null || P.call(A, { status: "REQUEST" }), (await Xd.getAirdrop(w)).isSuccess ? ((I = A.current) == null || I.call(A, { status: "SUCCESS", result: { isSuccess: !0 } }), p(!1), _(), yt.leaveRoom(w)) : ((
|
|
10841
|
+
(await Xd.startAirdrop(w)).isSuccess && (p(!0), (P = A.current) == null || P.call(A, { status: "REQUEST" }), (await Xd.getAirdrop(w)).isSuccess ? ((I = A.current) == null || I.call(A, { status: "SUCCESS", result: { isSuccess: !0 } }), p(!1), _(), yt.leaveRoom(w)) : ((N = A.current) == null || N.call(A, { status: "ERROR", result: { isSuccess: !1 } }), p(!1), yt.leaveRoom(w)));
|
|
10842
10842
|
} catch (B) {
|
|
10843
10843
|
console.error("Error during airdrop:", B), (z = A.current) == null || z.call(A, { status: "ERROR", result: { isSuccess: !1 } }), p(!1), yt.leaveRoom(w);
|
|
10844
10844
|
}
|
|
10845
10845
|
})(), () => {
|
|
10846
10846
|
yt.offMessageReceived("userJoined"), yt.offMessageReceived("airdropStart");
|
|
10847
|
-
}), [w]), k ?
|
|
10847
|
+
}), [w]), k ? Ct.jsx(Ct.Fragment, { children: u && c.type !== "NONE" ? Ct.jsx(tf, { $size: o, children: ((P) => {
|
|
10848
10848
|
switch (P) {
|
|
10849
10849
|
case "DEFAULT":
|
|
10850
|
-
return
|
|
10850
|
+
return Ct.jsx(ef, { children: "Processing..." });
|
|
10851
10851
|
case "NONE":
|
|
10852
10852
|
default:
|
|
10853
10853
|
return;
|
|
10854
10854
|
case "CUSTOM":
|
|
10855
10855
|
return c.type === "CUSTOM" ? c.component : void 0;
|
|
10856
10856
|
}
|
|
10857
|
-
})(c.type) }) :
|
|
10857
|
+
})(c.type) }) : Ct.jsx(Cn, { value: S, ...i && { imageSettings: { src: "data:image/svg+xml,%3csvg%20width='110'%20height='110'%20viewBox='0%200%20110%20110'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cg%20filter='url(%23filter0_d_5170_26474)'%3e%3crect%20x='4.74805'%20y='0.749023'%20width='100.502'%20height='100.503'%20rx='50.2512'%20fill='white'/%3e%3cpath%20d='M86.1086%2075.5552C85.7918%2068.5729%2077.2789%2058.2176%2072.6322%2053.0774C69.4029%2049.5076%2065.5224%2045.6785%2061.5146%2042.1712C63.5442%2040.7834%2065.4906%2039.6065%2067.2848%2038.6783C70.2965%2041.6043%2072.2712%2045.657%2072.6322%2050.0227C75.3094%2047.0628%2077.8628%2043.9651%2080.1454%2040.7082C82.2352%2037.6821%2084.1958%2034.5344%2085.4079%2031.0432C86.7173%2027.2928%2086.5509%2023.2883%2081.6778%2023.2222C80.0162%2023.2061%2078.3777%2023.5906%2076.794%2024.0771C74.8706%2024.6798%2073.0162%2025.4721%2071.1972%2026.3556C69.2348%2027.3142%2067.3432%2028.3694%2065.457%2029.5123C63.1301%2030.9252%2060.8758%2032.4383%2058.6427%2034.0461C57.4412%2034.9117%2056.2238%2035.8257%2054.9994%2036.7789C53.7731%2035.8257%2052.5575%2034.9117%2051.356%2034.0461C49.1247%2032.4383%2046.8686%2030.9252%2044.5417%2029.5123C42.6572%2028.3694%2040.7639%2027.3142%2038.8015%2026.3556C36.9825%2025.4721%2035.1281%2024.678%2033.2047%2024.0771C31.6245%2023.5906%2029.9842%2023.2079%2028.3227%2023.2222C23.4495%2023.2883%2023.285%2027.2928%2024.5944%2031.0432C25.8083%2034.5344%2027.7671%2037.6803%2029.8568%2040.7082C32.1377%2043.9669%2034.6928%2047.0628%2037.37%2050.0227C37.731%2045.657%2039.7057%2041.6061%2042.7174%2038.6783C44.5117%2039.6065%2046.4581%2040.7834%2048.4877%2042.1712C44.4798%2045.6802%2040.6011%2049.5076%2037.37%2053.0774C33.0224%2057.9332%2028.8783%2063.0662%2025.9215%2068.9038C24.7076%2071.4274%2022.8638%2075.6893%2024.5962%2078.2826C26.6505%2081.0798%2031.6847%2079.5686%2034.415%2078.6189C40.5144%2076.36%2046.0529%2072.8295%2051.3578%2069.0558C47.1146%2068.1634%2043.3756%2065.6899%2040.8683%2062.3114C43.8074%2057.8223%2049.5458%2051.6592%2055.0029%2047.1397C60.4635%2051.6627%2066.1949%2057.8187%2069.1375%2062.3114C66.6301%2065.6881%2062.8912%2068.1634%2058.6463%2069.0558C63.5973%2072.5917%2068.7624%2075.8736%2074.384%2078.1628C78.0999%2079.6956%2086.1882%2082.051%2086.1103%2075.5588L86.1086%2075.5552Z'%20fill='white'/%3e%3cpath%20d='M86.1086%2075.5552C85.7918%2068.5729%2077.2789%2058.2176%2072.6322%2053.0774C69.4029%2049.5076%2065.5224%2045.6785%2061.5146%2042.1712C63.5442%2040.7834%2065.4906%2039.6065%2067.2848%2038.6783C70.2965%2041.6043%2072.2712%2045.657%2072.6322%2050.0227C75.3094%2047.0628%2077.8628%2043.9651%2080.1454%2040.7082C82.2352%2037.6821%2084.1958%2034.5344%2085.4079%2031.0432C86.7173%2027.2928%2086.5509%2023.2883%2081.6778%2023.2222C80.0162%2023.2061%2078.3777%2023.5906%2076.794%2024.0771C74.8706%2024.6798%2073.0162%2025.4721%2071.1972%2026.3556C69.2348%2027.3142%2067.3432%2028.3694%2065.457%2029.5123C63.1301%2030.9252%2060.8758%2032.4383%2058.6427%2034.0461C57.4412%2034.9117%2056.2238%2035.8257%2054.9994%2036.7789C53.7731%2035.8257%2052.5575%2034.9117%2051.356%2034.0461C49.1247%2032.4383%2046.8686%2030.9252%2044.5417%2029.5123C42.6572%2028.3694%2040.7639%2027.3142%2038.8015%2026.3556C36.9825%2025.4721%2035.1281%2024.678%2033.2047%2024.0771C31.6245%2023.5906%2029.9842%2023.2079%2028.3227%2023.2222C23.4495%2023.2883%2023.285%2027.2928%2024.5944%2031.0432C25.8083%2034.5344%2027.7671%2037.6803%2029.8568%2040.7082C32.1377%2043.9669%2034.6928%2047.0628%2037.37%2050.0227C37.731%2045.657%2039.7057%2041.6061%2042.7174%2038.6783C44.5117%2039.6065%2046.4581%2040.7834%2048.4877%2042.1712C44.4798%2045.6802%2040.6011%2049.5076%2037.37%2053.0774C33.0224%2057.9332%2028.8783%2063.0662%2025.9215%2068.9038C24.7076%2071.4274%2022.8638%2075.6893%2024.5962%2078.2826C26.6505%2081.0798%2031.6847%2079.5686%2034.415%2078.6189C40.5144%2076.36%2046.0529%2072.8295%2051.3578%2069.0558C47.1146%2068.1634%2043.3756%2065.6899%2040.8683%2062.3114C43.8074%2057.8223%2049.5458%2051.6592%2055.0029%2047.1397C60.4635%2051.6627%2066.1949%2057.8187%2069.1375%2062.3114C66.6301%2065.6881%2062.8912%2068.1634%2058.6463%2069.0558C63.5973%2072.5917%2068.7624%2075.8736%2074.384%2078.1628C78.0999%2079.6956%2086.1882%2082.051%2086.1103%2075.5588L86.1086%2075.5552Z'%20fill='url(%23paint0_linear_5170_26474)'/%3e%3c/g%3e%3cdefs%3e%3cfilter%20id='filter0_d_5170_26474'%20x='0.727947'%20y='0.749023'%20width='108.542'%20height='108.543'%20filterUnits='userSpaceOnUse'%20color-interpolation-filters='sRGB'%3e%3cfeFlood%20flood-opacity='0'%20result='BackgroundImageFix'/%3e%3cfeColorMatrix%20in='SourceAlpha'%20type='matrix'%20values='0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%20127%200'%20result='hardAlpha'/%3e%3cfeOffset%20dy='4.0201'/%3e%3cfeGaussianBlur%20stdDeviation='2.01005'/%3e%3cfeComposite%20in2='hardAlpha'%20operator='out'/%3e%3cfeColorMatrix%20type='matrix'%20values='0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200.25%200'/%3e%3cfeBlend%20mode='normal'%20in2='BackgroundImageFix'%20result='effect1_dropShadow_5170_26474'/%3e%3cfeBlend%20mode='normal'%20in='SourceGraphic'%20in2='effect1_dropShadow_5170_26474'%20result='shape'/%3e%3c/filter%3e%3clinearGradient%20id='paint0_linear_5170_26474'%20x1='54.9998'%20y1='23.2217'%20x2='54.9998'%20y2='79.8883'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%23AD001F'/%3e%3cstop%20offset='1'%20stop-color='%23BB0022'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", width: s, height: s, excavate: !1 } }, ...f }) }) : Ct.jsx(tf, { children: Ct.jsx(ef, { children: "QR timeout" }) });
|
|
10858
10858
|
}, tf = lr.div`
|
|
10859
10859
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10860
10860
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10905,14 +10905,14 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10905
10905
|
}(), f5 = ({ availableNetworks: e, dapp: t, url: r, onReceive: n, validSeconds: i, isShowLogo: s = !1, logoSize: a = 30, size: o, icon: c, transaction: f, processingMark: u = { type: "DEFAULT" }, qrDomain: p, ...w }) => {
|
|
10906
10906
|
const [v, S] = Te(!1), E = pi.isMobile(), { roomId: _, nonce: k, qrCode: A, resumeFromReload: P } = so(E, () => Ln.generateSendTransactionQrCode(t, e, r, c, p));
|
|
10907
10907
|
oo(_);
|
|
10908
|
-
const I = mi(_, i), { isResuming:
|
|
10908
|
+
const I = mi(_, i), { isResuming: N } = (({ roomId: B, nonce: d, qrCode: h, transaction: y, validSeconds: m, isMobile: l, isValid: g, resumeFromReload: x, onReceive: O }) => {
|
|
10909
10909
|
const [R, j] = Te(!1), F = Yi(($) => {
|
|
10910
|
-
if ($.status === "TIMEOUT") return
|
|
10910
|
+
if ($.status === "TIMEOUT") return O == null || O({ status: "ERROR" }), !0;
|
|
10911
10911
|
const V = $.result;
|
|
10912
|
-
if (!V || !V.txHash) return
|
|
10912
|
+
if (!V || !V.txHash) return !1;
|
|
10913
10913
|
const D = { txHash: V.txHash, status: V.status, error: V.error };
|
|
10914
|
-
|
|
10915
|
-
}, [
|
|
10914
|
+
return O == null || O({ status: "SUCCESS", result: D }), !0;
|
|
10915
|
+
}, [O]);
|
|
10916
10916
|
return es({ roomId: B, nonce: d, type: "sendTransaction", payload: JSON.stringify(y), onResult: F, onResume: () => j(!0), timeoutMs: m ? 1e3 * m : void 0, resumeFromReload: x }), ts({ qrCode: h, isMobile: l, isValid: g, resumeFromReload: x }), { isResuming: R };
|
|
10917
10917
|
})({ roomId: _, nonce: k, qrCode: A, transaction: f, validSeconds: i, isMobile: E, isValid: I, resumeFromReload: P, onReceive: n }), z = hr(n);
|
|
10918
10918
|
return z.current = n, tr(() => {
|
|
@@ -10931,17 +10931,17 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10931
10931
|
})(), () => {
|
|
10932
10932
|
yt.offMessageReceived("requestSendTransaction"), yt.offMessageReceived("sendTransactionInfo"), yt.offMessageReceived("checkVerified");
|
|
10933
10933
|
};
|
|
10934
|
-
}, [E, _]), I ?
|
|
10934
|
+
}, [E, _]), I ? Ct.jsx(Ct.Fragment, { children: v && u.type !== "NONE" ? Ct.jsx(zo, { $size: o, children: ((B) => {
|
|
10935
10935
|
switch (B) {
|
|
10936
10936
|
case "DEFAULT":
|
|
10937
|
-
return
|
|
10937
|
+
return Ct.jsx(jo, { children: "processing..." });
|
|
10938
10938
|
case "NONE":
|
|
10939
10939
|
default:
|
|
10940
10940
|
return;
|
|
10941
10941
|
case "CUSTOM":
|
|
10942
10942
|
return u.type === "CUSTOM" ? u.component : void 0;
|
|
10943
10943
|
}
|
|
10944
|
-
})(u.type) }) : E ?
|
|
10944
|
+
})(u.type) }) : E ? Ct.jsx(zo, { $size: o, children: Ct.jsx(jo, { children: N ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ct.jsx(Cn, { value: A, size: o, ...s && { imageSettings: { src: rs, width: a, height: a, excavate: !1 } }, ...w }) }) : Ct.jsx(zo, { children: Ct.jsx(jo, { children: "QR timeout" }) });
|
|
10945
10945
|
}, zo = lr.div`
|
|
10946
10946
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10947
10947
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10954,16 +10954,16 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10954
10954
|
`, u5 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire: c, icon: f, size: u, processingMark: p = { type: "DEFAULT" }, qrDomain: w, ...v }) => {
|
|
10955
10955
|
const [S, E] = Te(!1), _ = pi.isMobile(), { roomId: k, nonce: A, qrCode: P, resumeFromReload: I } = so(_, () => Ln.generateLoginQrCode(t, r, e, f, "signature", w));
|
|
10956
10956
|
tr(() => (yt.joinRoom(k), () => yt.leaveRoom(k)), [k]);
|
|
10957
|
-
const
|
|
10957
|
+
const N = mi(k, s), { isResuming: z } = (({ roomId: d, nonce: h, qrCode: y, sigMessage: m, expire: l, validSeconds: g, isMobile: x, isValid: O, resumeFromReload: R, onReceive: j }) => {
|
|
10958
10958
|
const [F, $] = Te(!1), V = Yi((D) => {
|
|
10959
|
-
if (D.status === "TIMEOUT") return
|
|
10959
|
+
if (D.status === "TIMEOUT") return j == null || j({ status: "ERROR" }), !0;
|
|
10960
10960
|
const U = D.result;
|
|
10961
|
-
U != null && U.address && (U1(U, m, h, l), j == null || j({ status: "SUCCESS", result: U }), localStorage.setItem(
|
|
10961
|
+
return !!(U != null && U.address) && (U1(U, m, h, l), j == null || j({ status: "SUCCESS", result: U }), localStorage.setItem(On, JSON.stringify(U)), !0);
|
|
10962
10962
|
}, [j, m, h, l]);
|
|
10963
10963
|
return es({ roomId: d, nonce: h, type: "signature", payload: `${m}
|
|
10964
10964
|
|
|
10965
|
-
Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: y, isMobile: x, isValid:
|
|
10966
|
-
})({ roomId: k, nonce: A, qrCode: P, sigMessage: n, expire: c, validSeconds: s, isMobile: _, isValid:
|
|
10965
|
+
Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void 0, resumeFromReload: R }), ts({ qrCode: y, isMobile: x, isValid: O, resumeFromReload: R }), { isResuming: F };
|
|
10966
|
+
})({ roomId: k, nonce: A, qrCode: P, sigMessage: n, expire: c, validSeconds: s, isMobile: _, isValid: N, resumeFromReload: I, onReceive: i }), B = hr(i);
|
|
10967
10967
|
return B.current = i, tr(() => {
|
|
10968
10968
|
if (!_)
|
|
10969
10969
|
return (async () => {
|
|
@@ -10975,8 +10975,8 @@ Nonce: ${h}`, onResult: V, onResume: () => $(!0), timeoutMs: g ? 1e3 * g : void
|
|
|
10975
10975
|
(h = B.current) == null || h.call(B, { status: "ACCOUNT" });
|
|
10976
10976
|
const x = `${n}
|
|
10977
10977
|
|
|
10978
|
-
Nonce: ${A}`,
|
|
10979
|
-
(y = B.current) == null || y.call(B, { status: "SUCCESS", result: F }), E(!1), localStorage.setItem(
|
|
10978
|
+
Nonce: ${A}`, O = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void 0 : c.seconds) ?? 0, j = { publicKey: g.publicKey, message: x }, F = { address: g.address, network: g.network, nickName: g.nickName, token: uc.Validation.createToken(j, g.signature), issuedDateTime: Yn().format(ti), isVerified: g.isVerified, signature: g.signature, expire: O === "NONE" ? { type: O } : { type: O, seconds: R } };
|
|
10979
|
+
(y = B.current) == null || y.call(B, { status: "SUCCESS", result: F }), E(!1), localStorage.setItem(On, JSON.stringify(F));
|
|
10980
10980
|
}
|
|
10981
10981
|
} catch {
|
|
10982
10982
|
(m = B.current) == null || m.call(B, { status: "ERROR" }), E(!1);
|
|
@@ -10984,17 +10984,17 @@ Nonce: ${A}`, N = (c == null ? void 0 : c.type) ?? "NONE", R = (c == null ? void
|
|
|
10984
10984
|
})(), () => {
|
|
10985
10985
|
yt.offMessageReceived("requestMessage"), yt.offMessageReceived("accountInfo"), yt.offMessageReceived("checkVerified");
|
|
10986
10986
|
};
|
|
10987
|
-
}, [_, k, n]),
|
|
10987
|
+
}, [_, k, n]), N ? Ct.jsx(Ct.Fragment, { children: S && p.type !== "NONE" ? Ct.jsx($o, { $size: u, children: ((d) => {
|
|
10988
10988
|
switch (d) {
|
|
10989
10989
|
case "DEFAULT":
|
|
10990
|
-
return
|
|
10990
|
+
return Ct.jsx(qo, { children: "processing..." });
|
|
10991
10991
|
case "NONE":
|
|
10992
10992
|
default:
|
|
10993
10993
|
return;
|
|
10994
10994
|
case "CUSTOM":
|
|
10995
10995
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10996
10996
|
}
|
|
10997
|
-
})(p.type) }) : _ ?
|
|
10997
|
+
})(p.type) }) : _ ? Ct.jsx($o, { $size: u, children: Ct.jsx(qo, { children: z ? "결과 수신 중..." : "앱으로 이동 중..." }) }) : Ct.jsx(Cn, { value: P, size: u, ...a && { imageSettings: { src: rs, width: o, height: o, excavate: !1 } }, ...v }) }) : Ct.jsx($o, { children: Ct.jsx(qo, { children: "QR timeout" }) });
|
|
10998
10998
|
}, $o = lr.div`
|
|
10999
10999
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
11000
11000
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|