@coinbase/cdp-core 0.0.35 → 0.0.36

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.
Files changed (73) hide show
  1. package/README.md +9 -5
  2. package/dist/esm/index.native100.js +7 -41
  3. package/dist/esm/index.native101.js +11 -18
  4. package/dist/esm/index.native102.js +13 -28
  5. package/dist/esm/index.native103.js +10 -8
  6. package/dist/esm/index.native104.js +17 -11
  7. package/dist/esm/index.native105.js +80 -12
  8. package/dist/esm/index.native106.js +13 -10
  9. package/dist/esm/index.native107.js +36 -17
  10. package/dist/esm/index.native108.js +40 -79
  11. package/dist/esm/index.native28.js +1 -1
  12. package/dist/esm/index.native6.js +172 -173
  13. package/dist/esm/index.native86.js +1 -1
  14. package/dist/esm/index.native89.js +79 -10
  15. package/dist/esm/index.native90.js +1 -1
  16. package/dist/esm/index.native91.js +3 -3
  17. package/dist/esm/index.native93.js +3 -3
  18. package/dist/esm/index.native95.js +3 -3
  19. package/dist/esm/index.native96.js +10 -79
  20. package/dist/esm/index.native98.js +18 -13
  21. package/dist/esm/index.native99.js +27 -35
  22. package/dist/esm/index.web5.js +172 -173
  23. package/dist/esm/index.web55.js +2 -2
  24. package/dist/esm/index.web57.js +1 -1
  25. package/dist/esm/index.web75.js +6 -6
  26. package/dist/esm/index.web82.js +102 -18
  27. package/dist/esm/index.web83.js +20 -80
  28. package/dist/esm/index.web84.js +79 -103
  29. package/dist/esm/index.web87.js +77 -19
  30. package/dist/esm/index.web88.js +21 -10
  31. package/dist/esm/index.web89.js +9 -19
  32. package/dist/esm/index.web90.js +15 -89
  33. package/dist/esm/index.web91.js +92 -19
  34. package/dist/esm/index.web92.js +18 -115
  35. package/dist/esm/index.web93.js +112 -73
  36. package/dist/native/index.native100.js +7 -41
  37. package/dist/native/index.native101.js +11 -18
  38. package/dist/native/index.native102.js +13 -28
  39. package/dist/native/index.native103.js +10 -8
  40. package/dist/native/index.native104.js +17 -11
  41. package/dist/native/index.native105.js +80 -12
  42. package/dist/native/index.native106.js +13 -10
  43. package/dist/native/index.native107.js +36 -17
  44. package/dist/native/index.native108.js +40 -79
  45. package/dist/native/index.native28.js +1 -1
  46. package/dist/native/index.native6.js +172 -173
  47. package/dist/native/index.native86.js +1 -1
  48. package/dist/native/index.native89.js +79 -10
  49. package/dist/native/index.native90.js +1 -1
  50. package/dist/native/index.native91.js +3 -3
  51. package/dist/native/index.native93.js +3 -3
  52. package/dist/native/index.native95.js +3 -3
  53. package/dist/native/index.native96.js +10 -79
  54. package/dist/native/index.native98.js +18 -13
  55. package/dist/native/index.native99.js +27 -35
  56. package/dist/native-types/types.d.ts +19 -2
  57. package/dist/types/types.d.ts +19 -2
  58. package/dist/web/index.web5.js +172 -173
  59. package/dist/web/index.web55.js +2 -2
  60. package/dist/web/index.web57.js +1 -1
  61. package/dist/web/index.web75.js +6 -6
  62. package/dist/web/index.web82.js +102 -18
  63. package/dist/web/index.web83.js +20 -80
  64. package/dist/web/index.web84.js +79 -103
  65. package/dist/web/index.web87.js +77 -19
  66. package/dist/web/index.web88.js +21 -10
  67. package/dist/web/index.web89.js +9 -19
  68. package/dist/web/index.web90.js +15 -89
  69. package/dist/web/index.web91.js +92 -19
  70. package/dist/web/index.web92.js +18 -115
  71. package/dist/web/index.web93.js +112 -73
  72. package/dist/web-types/types.d.ts +19 -2
  73. package/package.json +2 -2
@@ -1,82 +1,22 @@
1
- /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
- function o(e) {
3
- return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
4
- }
5
- function w(e) {
6
- if (!Number.isSafeInteger(e) || e < 0)
7
- throw new Error("positive integer expected, got " + e);
8
- }
9
- function r(e, ...t) {
10
- if (!o(e))
11
- throw new Error("Uint8Array expected");
12
- if (t.length > 0 && !t.includes(e.length))
13
- throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
14
- }
15
- function h(e, t = !0) {
16
- if (e.destroyed)
17
- throw new Error("Hash instance has been destroyed");
18
- if (t && e.finished)
19
- throw new Error("Hash#digest() has already been called");
20
- }
21
- function l(e, t) {
22
- r(e);
23
- const n = t.outputLen;
24
- if (e.length < n)
25
- throw new Error("digestInto() expects output buffer of length at least " + n);
26
- }
27
- function a(e) {
28
- return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
29
- }
30
- function g(...e) {
31
- for (let t = 0; t < e.length; t++)
32
- e[t].fill(0);
33
- }
34
- function p(e) {
35
- return new DataView(e.buffer, e.byteOffset, e.byteLength);
36
- }
37
- function b(e, t) {
38
- return e << 32 - t | e >>> t;
39
- }
40
- const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
41
- function u(e) {
42
- return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
43
- }
44
- function c(e) {
45
- for (let t = 0; t < e.length; t++)
46
- e[t] = u(e[t]);
47
- return e;
48
- }
49
- const x = i ? (e) => e : c;
50
- function s(e) {
51
- if (typeof e != "string")
52
- throw new Error("string expected");
53
- return new Uint8Array(new TextEncoder().encode(e));
54
- }
55
- function y(e) {
56
- return typeof e == "string" && (e = s(e)), r(e), e;
57
- }
58
- class d {
59
- }
60
- function E(e) {
61
- const t = (f) => e().update(y(f)).digest(), n = e();
62
- return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
63
- }
1
+ const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
2
+ function s(t, r = !1) {
3
+ return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
4
+ }
5
+ function h(t, r = !1) {
6
+ const n = t.length;
7
+ let l = new Uint32Array(n), c = new Uint32Array(n);
8
+ for (let e = 0; e < n; e++) {
9
+ const { h: u, l: f } = s(t[e], r);
10
+ [l[e], c[e]] = [u, f];
11
+ }
12
+ return [l, c];
13
+ }
14
+ const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
64
15
  export {
65
- d as Hash,
66
- r as abytes,
67
- h as aexists,
68
- w as anumber,
69
- l as aoutput,
70
- u as byteSwap,
71
- c as byteSwap32,
72
- g as clean,
73
- E as createHasher,
74
- p as createView,
75
- o as isBytes,
76
- i as isLE,
77
- b as rotr,
78
- x as swap32IfBE,
79
- y as toBytes,
80
- a as u32,
81
- s as utf8ToBytes
16
+ s as fromBig,
17
+ B as rotlBH,
18
+ a as rotlBL,
19
+ m as rotlSH,
20
+ A as rotlSL,
21
+ h as split
82
22
  };
@@ -1,106 +1,82 @@
1
- import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.web93.js";
2
- import { createHasher as u, clean as C, rotr as i } from "./index.web83.js";
3
- const B = /* @__PURE__ */ Uint32Array.from([
4
- 1116352408,
5
- 1899447441,
6
- 3049323471,
7
- 3921009573,
8
- 961987163,
9
- 1508970993,
10
- 2453635748,
11
- 2870763221,
12
- 3624381080,
13
- 310598401,
14
- 607225278,
15
- 1426881987,
16
- 1925078388,
17
- 2162078206,
18
- 2614888103,
19
- 3248222580,
20
- 3835390401,
21
- 4022224774,
22
- 264347078,
23
- 604807628,
24
- 770255983,
25
- 1249150122,
26
- 1555081692,
27
- 1996064986,
28
- 2554220882,
29
- 2821834349,
30
- 2952996808,
31
- 3210313671,
32
- 3336571891,
33
- 3584528711,
34
- 113926993,
35
- 338241895,
36
- 666307205,
37
- 773529912,
38
- 1294757372,
39
- 1396182291,
40
- 1695183700,
41
- 1986661051,
42
- 2177026350,
43
- 2456956037,
44
- 2730485921,
45
- 2820302411,
46
- 3259730800,
47
- 3345764771,
48
- 3516065817,
49
- 3600352804,
50
- 4094571909,
51
- 275423344,
52
- 430227734,
53
- 506948616,
54
- 659060556,
55
- 883997877,
56
- 958139571,
57
- 1322822218,
58
- 1537002063,
59
- 1747873779,
60
- 1955562222,
61
- 2024104815,
62
- 2227730452,
63
- 2361852424,
64
- 2428436474,
65
- 2756734187,
66
- 3204031479,
67
- 3329325298
68
- ]), h = /* @__PURE__ */ new Uint32Array(64);
69
- class E extends D {
70
- constructor(o = 32) {
71
- super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
72
- }
73
- get() {
74
- const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
75
- return [o, r, t, s, a, f, c, e];
76
- }
77
- // prettier-ignore
78
- set(o, r, t, s, a, f, c, e) {
79
- this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
80
- }
81
- process(o, r) {
82
- for (let x = 0; x < 16; x++, r += 4)
83
- h[x] = o.getUint32(r, !1);
84
- for (let x = 16; x < 64; x++) {
85
- const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
86
- h[x] = l + h[x - 7] + m + h[x - 16] | 0;
87
- }
88
- let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
89
- for (let x = 0; x < 64; x++) {
90
- const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
91
- A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
92
- }
93
- t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
94
- }
95
- roundClean() {
96
- C(h);
97
- }
98
- destroy() {
99
- this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
100
- }
1
+ /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
+ function o(e) {
3
+ return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
4
+ }
5
+ function w(e) {
6
+ if (!Number.isSafeInteger(e) || e < 0)
7
+ throw new Error("positive integer expected, got " + e);
8
+ }
9
+ function r(e, ...t) {
10
+ if (!o(e))
11
+ throw new Error("Uint8Array expected");
12
+ if (t.length > 0 && !t.includes(e.length))
13
+ throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
14
+ }
15
+ function h(e, t = !0) {
16
+ if (e.destroyed)
17
+ throw new Error("Hash instance has been destroyed");
18
+ if (t && e.finished)
19
+ throw new Error("Hash#digest() has already been called");
20
+ }
21
+ function l(e, t) {
22
+ r(e);
23
+ const n = t.outputLen;
24
+ if (e.length < n)
25
+ throw new Error("digestInto() expects output buffer of length at least " + n);
26
+ }
27
+ function a(e) {
28
+ return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
29
+ }
30
+ function g(...e) {
31
+ for (let t = 0; t < e.length; t++)
32
+ e[t].fill(0);
33
+ }
34
+ function p(e) {
35
+ return new DataView(e.buffer, e.byteOffset, e.byteLength);
36
+ }
37
+ function b(e, t) {
38
+ return e << 32 - t | e >>> t;
39
+ }
40
+ const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
41
+ function u(e) {
42
+ return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
43
+ }
44
+ function c(e) {
45
+ for (let t = 0; t < e.length; t++)
46
+ e[t] = u(e[t]);
47
+ return e;
48
+ }
49
+ const x = i ? (e) => e : c;
50
+ function s(e) {
51
+ if (typeof e != "string")
52
+ throw new Error("string expected");
53
+ return new Uint8Array(new TextEncoder().encode(e));
54
+ }
55
+ function y(e) {
56
+ return typeof e == "string" && (e = s(e)), r(e), e;
57
+ }
58
+ class d {
59
+ }
60
+ function E(e) {
61
+ const t = (f) => e().update(y(f)).digest(), n = e();
62
+ return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
101
63
  }
102
- const y = /* @__PURE__ */ u(() => new E());
103
64
  export {
104
- E as SHA256,
105
- y as sha256
65
+ d as Hash,
66
+ r as abytes,
67
+ h as aexists,
68
+ w as anumber,
69
+ l as aoutput,
70
+ u as byteSwap,
71
+ c as byteSwap32,
72
+ g as clean,
73
+ E as createHasher,
74
+ p as createView,
75
+ o as isBytes,
76
+ i as isLE,
77
+ b as rotr,
78
+ x as swap32IfBE,
79
+ y as toBytes,
80
+ a as u32,
81
+ s as utf8ToBytes
106
82
  };
@@ -1,23 +1,81 @@
1
- import { encoder as t, decoder as o } from "./index.web76.js";
2
- import { encodeBase64 as c, decodeBase64 as a } from "./index.web96.js";
3
- function i(r) {
4
- if (Uint8Array.fromBase64)
5
- return Uint8Array.fromBase64(typeof r == "string" ? r : o.decode(r), {
6
- alphabet: "base64url"
7
- });
8
- let e = r;
9
- e instanceof Uint8Array && (e = o.decode(e)), e = e.replace(/-/g, "+").replace(/_/g, "/").replace(/\s/g, "");
10
- try {
11
- return a(e);
12
- } catch {
13
- throw new TypeError("The input to be decoded is not correctly encoded.");
14
- }
1
+ import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.web84.js";
2
+ function y(o, t, s, n) {
3
+ if (typeof o.setBigUint64 == "function")
4
+ return o.setBigUint64(t, s, n);
5
+ const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
6
+ o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
7
+ }
8
+ function U(o, t, s) {
9
+ return o & t ^ ~o & s;
10
+ }
11
+ function _(o, t, s) {
12
+ return o & t ^ o & s ^ t & s;
15
13
  }
16
- function p(r) {
17
- let e = r;
18
- return typeof e == "string" && (e = t.encode(e)), Uint8Array.prototype.toBase64 ? e.toBase64({ alphabet: "base64url", omitPadding: !0 }) : c(e).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
14
+ class m extends g {
15
+ constructor(t, s, n, i) {
16
+ super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
17
+ }
18
+ update(t) {
19
+ b(this), t = a(t), d(t);
20
+ const { view: s, buffer: n, blockLen: i } = this, h = t.length;
21
+ for (let e = 0; e < h; ) {
22
+ const r = Math.min(i - this.pos, h - e);
23
+ if (r === i) {
24
+ const c = l(t);
25
+ for (; i <= h - e; e += i)
26
+ this.process(c, e);
27
+ continue;
28
+ }
29
+ n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
30
+ }
31
+ return this.length += t.length, this.roundClean(), this;
32
+ }
33
+ digestInto(t) {
34
+ b(this), x(t, this), this.finished = !0;
35
+ const { buffer: s, view: n, blockLen: i, isLE: h } = this;
36
+ let { pos: e } = this;
37
+ s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
38
+ for (let f = e; f < i; f++)
39
+ s[f] = 0;
40
+ y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
41
+ const r = l(t), c = this.outputLen;
42
+ if (c % 4)
43
+ throw new Error("_sha2: outputLen should be aligned to 32bit");
44
+ const u = c / 4, p = this.get();
45
+ if (u > p.length)
46
+ throw new Error("_sha2: outputLen bigger than state");
47
+ for (let f = 0; f < u; f++)
48
+ r.setUint32(4 * f, p[f], h);
49
+ }
50
+ digest() {
51
+ const { buffer: t, outputLen: s } = this;
52
+ this.digestInto(t);
53
+ const n = t.slice(0, s);
54
+ return this.destroy(), n;
55
+ }
56
+ _cloneInto(t) {
57
+ t || (t = new this.constructor()), t.set(...this.get());
58
+ const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
59
+ return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
60
+ }
61
+ clone() {
62
+ return this._cloneInto();
63
+ }
19
64
  }
65
+ const B = /* @__PURE__ */ Uint32Array.from([
66
+ 1779033703,
67
+ 3144134277,
68
+ 1013904242,
69
+ 2773480762,
70
+ 1359893119,
71
+ 2600822924,
72
+ 528734635,
73
+ 1541459225
74
+ ]);
20
75
  export {
21
- i as decode,
22
- p as encode
76
+ U as Chi,
77
+ m as HashMD,
78
+ _ as Maj,
79
+ B as SHA256_IV,
80
+ y as setBigUint64
23
81
  };
@@ -1,12 +1,23 @@
1
- import n from "./index.web97.js";
2
- import s from "./index.web98.js";
3
- import a from "./index.web99.js";
4
- const y = async (t, o, e) => {
5
- const r = await a(t, o, "sign");
6
- s(t, r);
7
- const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
8
- return new Uint8Array(i);
9
- };
1
+ import { encoder as t, decoder as o } from "./index.web76.js";
2
+ import { encodeBase64 as c, decodeBase64 as a } from "./index.web96.js";
3
+ function i(r) {
4
+ if (Uint8Array.fromBase64)
5
+ return Uint8Array.fromBase64(typeof r == "string" ? r : o.decode(r), {
6
+ alphabet: "base64url"
7
+ });
8
+ let e = r;
9
+ e instanceof Uint8Array && (e = o.decode(e)), e = e.replace(/-/g, "+").replace(/_/g, "/").replace(/\s/g, "");
10
+ try {
11
+ return a(e);
12
+ } catch {
13
+ throw new TypeError("The input to be decoded is not correctly encoded.");
14
+ }
15
+ }
16
+ function p(r) {
17
+ let e = r;
18
+ return typeof e == "string" && (e = t.encode(e)), Uint8Array.prototype.toBase64 ? e.toBase64({ alphabet: "base64url", omitPadding: !0 }) : c(e).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
19
+ }
10
20
  export {
11
- y as default
21
+ i as decode,
22
+ p as encode
12
23
  };
@@ -1,22 +1,12 @@
1
- const a = (...o) => {
2
- const t = o.filter(Boolean);
3
- if (t.length === 0 || t.length === 1)
4
- return !0;
5
- let e;
6
- for (const s of t) {
7
- const r = Object.keys(s);
8
- if (!e || e.size === 0) {
9
- e = new Set(r);
10
- continue;
11
- }
12
- for (const n of r) {
13
- if (e.has(n))
14
- return !1;
15
- e.add(n);
16
- }
17
- }
18
- return !0;
1
+ import n from "./index.web97.js";
2
+ import s from "./index.web98.js";
3
+ import a from "./index.web99.js";
4
+ const y = async (t, o, e) => {
5
+ const r = await a(t, o, "sign");
6
+ s(t, r);
7
+ const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
8
+ return new Uint8Array(i);
19
9
  };
20
10
  export {
21
- a as default
11
+ y as default
22
12
  };
@@ -1,96 +1,22 @@
1
- import { withAlg as n } from "./index.web100.js";
2
- import c from "./index.web101.js";
3
- import { isJWK as p, isSecretJWK as a, isPublicJWK as y, isPrivateJWK as f } from "./index.web102.js";
4
- const s = (r) => r?.[Symbol.toStringTag], o = (r, e, t) => {
5
- if (e.use !== void 0) {
6
- let i;
7
- switch (t) {
8
- case "sign":
9
- case "verify":
10
- i = "sig";
11
- break;
12
- case "encrypt":
13
- case "decrypt":
14
- i = "enc";
15
- break;
1
+ const a = (...o) => {
2
+ const t = o.filter(Boolean);
3
+ if (t.length === 0 || t.length === 1)
4
+ return !0;
5
+ let e;
6
+ for (const s of t) {
7
+ const r = Object.keys(s);
8
+ if (!e || e.size === 0) {
9
+ e = new Set(r);
10
+ continue;
16
11
  }
17
- if (e.use !== i)
18
- throw new TypeError(`Invalid key for this operation, its "use" must be "${i}" when present`);
19
- }
20
- if (e.alg !== void 0 && e.alg !== r)
21
- throw new TypeError(`Invalid key for this operation, its "alg" must be "${r}" when present`);
22
- if (Array.isArray(e.key_ops)) {
23
- let i;
24
- switch (!0) {
25
- case t === "sign":
26
- case r === "dir":
27
- case r.includes("CBC-HS"):
28
- i = t;
29
- break;
30
- case r.startsWith("PBES2"):
31
- i = "deriveBits";
32
- break;
33
- case /^A\d{3}(?:GCM)?(?:KW)?$/.test(r):
34
- !r.includes("GCM") && r.endsWith("KW") ? i = "unwrapKey" : i = t;
35
- break;
36
- case t === "encrypt":
37
- i = "wrapKey";
38
- break;
39
- case t === "decrypt":
40
- i = r.startsWith("RSA") ? "unwrapKey" : "deriveBits";
41
- break;
12
+ for (const n of r) {
13
+ if (e.has(n))
14
+ return !1;
15
+ e.add(n);
42
16
  }
43
- if (i && e.key_ops?.includes?.(i) === !1)
44
- throw new TypeError(`Invalid key for this operation, its "key_ops" must include "${i}" when present`);
45
17
  }
46
18
  return !0;
47
- }, h = (r, e, t) => {
48
- if (!(e instanceof Uint8Array)) {
49
- if (p(e)) {
50
- if (a(e) && o(r, e, t))
51
- return;
52
- throw new TypeError('JSON Web Key for symmetric algorithms must have JWK "kty" (Key Type) equal to "oct" and the JWK "k" (Key Value) present');
53
- }
54
- if (!c(e))
55
- throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key", "Uint8Array"));
56
- if (e.type !== "secret")
57
- throw new TypeError(`${s(e)} instances for symmetric algorithms must be of type "secret"`);
58
- }
59
- }, m = (r, e, t) => {
60
- if (p(e))
61
- switch (t) {
62
- case "decrypt":
63
- case "sign":
64
- if (f(e) && o(r, e, t))
65
- return;
66
- throw new TypeError("JSON Web Key for this operation be a private JWK");
67
- case "encrypt":
68
- case "verify":
69
- if (y(e) && o(r, e, t))
70
- return;
71
- throw new TypeError("JSON Web Key for this operation be a public JWK");
72
- }
73
- if (!c(e))
74
- throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key"));
75
- if (e.type === "secret")
76
- throw new TypeError(`${s(e)} instances for asymmetric algorithms must not be of type "secret"`);
77
- if (e.type === "public")
78
- switch (t) {
79
- case "sign":
80
- throw new TypeError(`${s(e)} instances for asymmetric algorithm signing must be of type "private"`);
81
- case "decrypt":
82
- throw new TypeError(`${s(e)} instances for asymmetric algorithm decryption must be of type "private"`);
83
- }
84
- if (e.type === "private")
85
- switch (t) {
86
- case "verify":
87
- throw new TypeError(`${s(e)} instances for asymmetric algorithm verifying must be of type "public"`);
88
- case "encrypt":
89
- throw new TypeError(`${s(e)} instances for asymmetric algorithm encryption must be of type "public"`);
90
- }
91
- }, d = (r, e, t) => {
92
- r.startsWith("HS") || r === "dir" || r.startsWith("PBES2") || /^A(?:128|192|256)(?:GCM)?(?:KW)?$/.test(r) || /^A(?:128|192|256)CBC-HS(?:256|384|512)$/.test(r) ? h(r, e, t) : m(r, e, t);
93
19
  };
94
20
  export {
95
- d as default
21
+ a as default
96
22
  };