@prosopo/procaptcha-bundle 3.0.12 → 3.0.13
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/.rollup.cache/home/runner/work/captcha/captcha/packages/procaptcha-bundle/dist/bundle/tests/util/renderLogic.test.js +2 -2
- package/.rollup.cache/home/runner/work/captcha/captcha/packages/procaptcha-bundle/dist/bundle/tests/util/renderLogic.test.js.map +1 -1
- package/CHANGELOG.md +27 -0
- package/dist/bundle/{ProcaptchaWidget-48FxVPQd.js → ProcaptchaWidget-BIt2pcrz.js} +5 -5
- package/dist/bundle/{ProcaptchaWidget-B2BzhXLv.js → ProcaptchaWidget-CXxnCzl2.js} +7 -7
- package/dist/bundle/{captchaComponentProvider-B7Vxx339.js → captchaComponentProvider-BGEAkC9Y.js} +7 -7
- package/dist/bundle/{captchaRenderer-DdOlOCKw.js → captchaRenderer-CqnUYyKY.js} +3 -3
- package/dist/bundle/{commonChunk-HCVkoCqn.js → commonChunk-BKceWhtS.js} +1 -1
- package/dist/bundle/{emotion-element-5486c51c.browser.esm-D7qvHZDV.js → emotion-element-5486c51c.browser.esm-CimrRZxS.js} +1 -1
- package/dist/bundle/{index-DyYmvHVN.js → index-KHTbPva_.js} +1 -1
- package/dist/bundle/{index-C00_J7av.js → index-hrOz2CPm.js} +2 -2
- package/dist/bundle/nobleChunk-CQ4ENyKh.js +3769 -0
- package/dist/bundle/procaptcha.bundle.js +2 -2
- package/dist/bundle/{utilChunk-sqstc6C5.js → utilChunk-DPr6oTOj.js} +22 -22
- package/dist/bundle/{utilCryptoChunk-qm-BM2eT.js → utilCryptoChunk-BKe3CKqn.js} +273 -273
- package/dist/bundle/{web2Chunk-DCsWA5PR.js → web2Chunk-Cqw91v-J.js} +404 -394
- package/dist/bundle/{web3Chunk-B8txCqUJ.js → web3Chunk-BcwDKvjL.js} +4 -4
- package/package.json +19 -19
- package/stats.html +1 -1
- package/dist/bundle/nobleChunk-Qozzkbsq.js +0 -3648
|
@@ -5,9 +5,9 @@ import { B as s } from "./bnChunk-DRlDxTFg.js";
|
|
|
5
5
|
function $(n) {
|
|
6
6
|
return n("return this");
|
|
7
7
|
}
|
|
8
|
-
const
|
|
8
|
+
const g = typeof globalThis < "u" ? globalThis : typeof global < "u" ? global : typeof self < "u" ? self : typeof window < "u" ? window : $(Function);
|
|
9
9
|
function S(n, t) {
|
|
10
|
-
return typeof
|
|
10
|
+
return typeof g[n] > "u" ? t : g[n];
|
|
11
11
|
}
|
|
12
12
|
let W = class {
|
|
13
13
|
constructor(t) {
|
|
@@ -55,18 +55,18 @@ function bn(n) {
|
|
|
55
55
|
return s.isBN(n);
|
|
56
56
|
}
|
|
57
57
|
const I = /^0x[\da-fA-F]+$/, q = /^[\da-fA-F]+$/;
|
|
58
|
-
function
|
|
59
|
-
return typeof n == "string" && (n === "0x" || I.test(n)) && (t === -1 ? n.length % 2 === 0 : n.length === 2 + Math.ceil(t / 4));
|
|
58
|
+
function M(n, t = -1, e) {
|
|
59
|
+
return typeof n == "string" && (n === "0x" || I.test(n)) && (t === -1 ? e || n.length % 2 === 0 : n.length === 2 + Math.ceil(t / 4));
|
|
60
60
|
}
|
|
61
61
|
function V(n) {
|
|
62
62
|
return !!n && typeof n == "object";
|
|
63
63
|
}
|
|
64
|
-
function
|
|
64
|
+
function L(...n) {
|
|
65
65
|
return (t) => (V(t) || _(t)) && n.every((e) => _(t[e]));
|
|
66
66
|
}
|
|
67
|
-
const z = /* @__PURE__ */
|
|
67
|
+
const z = /* @__PURE__ */ L("toBigInt"), J = /* @__PURE__ */ L("toBn"), K = typeof g.Buffer == "function" && typeof g.Buffer.isBuffer == "function";
|
|
68
68
|
function Q(n) {
|
|
69
|
-
return K && !!n && _(n.readDoubleLE) &&
|
|
69
|
+
return K && !!n && _(n.readDoubleLE) && g.Buffer.isBuffer(n);
|
|
70
70
|
}
|
|
71
71
|
function Y(n) {
|
|
72
72
|
return (n && n.constructor) === Uint8Array || n instanceof Uint8Array;
|
|
@@ -75,14 +75,14 @@ const Z = new G();
|
|
|
75
75
|
function R(n) {
|
|
76
76
|
return n ? Z.encode(n.toString()) : new Uint8Array();
|
|
77
77
|
}
|
|
78
|
-
function
|
|
79
|
-
return Y(n) ? Q(n) ? new Uint8Array(n) : n :
|
|
78
|
+
function w(n) {
|
|
79
|
+
return Y(n) ? Q(n) ? new Uint8Array(n) : n : M(n) ? k(n) : Array.isArray(n) ? new Uint8Array(n) : R(n);
|
|
80
80
|
}
|
|
81
81
|
function Un(...n) {
|
|
82
82
|
const t = n.length, e = new Array(t);
|
|
83
83
|
let r = 0;
|
|
84
84
|
for (let o = 0; o < t; o++)
|
|
85
|
-
e[o] =
|
|
85
|
+
e[o] = w(n[o]), r += e[o].length;
|
|
86
86
|
return A(e, r);
|
|
87
87
|
}
|
|
88
88
|
function A(n, t = 0) {
|
|
@@ -104,7 +104,7 @@ function pn(n) {
|
|
|
104
104
|
return !0;
|
|
105
105
|
}
|
|
106
106
|
function B(n, t) {
|
|
107
|
-
const e =
|
|
107
|
+
const e = w(n), r = w(t);
|
|
108
108
|
if (e.length === r.length) {
|
|
109
109
|
const o = new DataView(e.buffer, e.byteOffset), c = new DataView(r.buffer, r.byteOffset), f = e.length % 4 | 0, h = e.length - f | 0;
|
|
110
110
|
for (let i = 0; i < h; i += 4)
|
|
@@ -196,17 +196,17 @@ const nn = new j("utf-8");
|
|
|
196
196
|
function xn(n) {
|
|
197
197
|
return n ? nn.decode(n) : "";
|
|
198
198
|
}
|
|
199
|
-
const x = /* @__PURE__ */
|
|
200
|
-
`), u = /* @__PURE__ */
|
|
199
|
+
const x = /* @__PURE__ */ w(`Ethereum Signed Message:
|
|
200
|
+
`), u = /* @__PURE__ */ w("<Bytes>"), d = /* @__PURE__ */ w("</Bytes>"), tn = u.length + d.length;
|
|
201
201
|
function C(n, t) {
|
|
202
202
|
return n.length >= tn && B(n.subarray(0, u.length), u) && B(n.slice(-d.length), d) || t && n.length >= x.length && B(n.subarray(0, x.length), x);
|
|
203
203
|
}
|
|
204
204
|
function En(n) {
|
|
205
|
-
const t =
|
|
205
|
+
const t = w(n);
|
|
206
206
|
return C(t, !1) ? t.subarray(u.length, t.length - d.length) : t;
|
|
207
207
|
}
|
|
208
208
|
function _n(n) {
|
|
209
|
-
const t =
|
|
209
|
+
const t = w(n);
|
|
210
210
|
return C(t, !0) ? t : A([u, t, d]);
|
|
211
211
|
}
|
|
212
212
|
function en(n) {
|
|
@@ -231,7 +231,7 @@ function on(n) {
|
|
|
231
231
|
return typeof n == "bigint";
|
|
232
232
|
}
|
|
233
233
|
function F(n) {
|
|
234
|
-
return n ? s.isBN(n) ? n :
|
|
234
|
+
return n ? s.isBN(n) ? n : M(n) ? rn(n.toString()) : on(n) ? new s(n.toString()) : J(n) ? n.toBn() : z(n) ? new s(n.toBigInt().toString()) : new s(n) : new s(0);
|
|
235
235
|
}
|
|
236
236
|
const sn = { bitLength: -1, isLe: !0, isNegative: !1 };
|
|
237
237
|
function E(n, { bitLength: t = -1, isLe: e = !0, isNegative: r = !1 } = sn) {
|
|
@@ -241,15 +241,15 @@ function E(n, { bitLength: t = -1, isLe: e = !0, isNegative: r = !1 } = sn) {
|
|
|
241
241
|
const f = new Uint8Array(c), h = r ? o.toTwos(c * 8) : o;
|
|
242
242
|
return f.set(h.toArray(e ? "le" : "be", c), 0), f;
|
|
243
243
|
}
|
|
244
|
-
const cn = U.pow(new s(6)).isub(b), fn = U.pow(new s(14)).isub(b), hn = U.pow(new s(30)).isub(b),
|
|
244
|
+
const cn = U.pow(new s(6)).isub(b), fn = U.pow(new s(14)).isub(b), hn = U.pow(new s(30)).isub(b), wn = { bitLength: 16 }, gn = { bitLength: 32 };
|
|
245
245
|
function un(n) {
|
|
246
246
|
const t = F(n);
|
|
247
247
|
if (t.lte(cn))
|
|
248
248
|
return new Uint8Array([t.toNumber() << 2]);
|
|
249
249
|
if (t.lte(fn))
|
|
250
|
-
return E(t.shln(2).iadd(b),
|
|
250
|
+
return E(t.shln(2).iadd(b), wn);
|
|
251
251
|
if (t.lte(hn))
|
|
252
|
-
return E(t.shln(2).iadd(U),
|
|
252
|
+
return E(t.shln(2).iadd(U), gn);
|
|
253
253
|
const e = E(t);
|
|
254
254
|
let r = e.length;
|
|
255
255
|
for (; e[r - 1] === 0; )
|
|
@@ -292,7 +292,7 @@ function In(n) {
|
|
|
292
292
|
export {
|
|
293
293
|
v as a,
|
|
294
294
|
Un as b,
|
|
295
|
-
|
|
295
|
+
M as c,
|
|
296
296
|
Tn as d,
|
|
297
297
|
E as e,
|
|
298
298
|
Bn as f,
|
|
@@ -310,8 +310,8 @@ export {
|
|
|
310
310
|
B as r,
|
|
311
311
|
R as s,
|
|
312
312
|
pn as t,
|
|
313
|
-
|
|
313
|
+
w as u,
|
|
314
314
|
xn as v,
|
|
315
315
|
In as w,
|
|
316
|
-
|
|
316
|
+
g as x
|
|
317
317
|
};
|