web-dc-api 0.0.58 → 0.0.60

package/dist/cjs/node_modules/@noble/hashes/esm/sha2.js

@@ -0,0 +1,326 @@
+'use strict';
+
+var _md = require('./_md.js');
+var _u64 = require('./_u64.js');
+var utils = require('./utils.js');
+
+/**
+ * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.
+ * SHA256 is the fastest hash implementable in JS, even faster than Blake3.
+ * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and
+ * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+ * @module
+ */
+/**
+ * Round constants:
+ * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)
+ */
+// prettier-ignore
+const SHA256_K = /* @__PURE__ */Uint32Array.from([0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2]);
+/** Reusable temporary buffer. "W" comes straight from spec. */
+const SHA256_W = /* @__PURE__ */new Uint32Array(64);
+class SHA256 extends _md.HashMD {
+  constructor() {
+    let outputLen = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 32;
+    super(64, outputLen, 8, false);
+    // We cannot use array here since array allows indexing by variable
+    // which means optimizer/compiler cannot use registers.
+    this.A = _md.SHA256_IV[0] | 0;
+    this.B = _md.SHA256_IV[1] | 0;
+    this.C = _md.SHA256_IV[2] | 0;
+    this.D = _md.SHA256_IV[3] | 0;
+    this.E = _md.SHA256_IV[4] | 0;
+    this.F = _md.SHA256_IV[5] | 0;
+    this.G = _md.SHA256_IV[6] | 0;
+    this.H = _md.SHA256_IV[7] | 0;
+  }
+  get() {
+    const {
+      A,
+      B,
+      C,
+      D,
+      E,
+      F,
+      G,
+      H
+    } = this;
+    return [A, B, C, D, E, F, G, H];
+  }
+  // prettier-ignore
+  set(A, B, C, D, E, F, G, H) {
+    this.A = A | 0;
+    this.B = B | 0;
+    this.C = C | 0;
+    this.D = D | 0;
+    this.E = E | 0;
+    this.F = F | 0;
+    this.G = G | 0;
+    this.H = H | 0;
+  }
+  process(view, offset) {
+    // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array
+    for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);
+    for (let i = 16; i < 64; i++) {
+      const W15 = SHA256_W[i - 15];
+      const W2 = SHA256_W[i - 2];
+      const s0 = utils.rotr(W15, 7) ^ utils.rotr(W15, 18) ^ W15 >>> 3;
+      const s1 = utils.rotr(W2, 17) ^ utils.rotr(W2, 19) ^ W2 >>> 10;
+      SHA256_W[i] = s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16] | 0;
+    }
+    // Compression function main loop, 64 rounds
+    let {
+      A,
+      B,
+      C,
+      D,
+      E,
+      F,
+      G,
+      H
+    } = this;
+    for (let i = 0; i < 64; i++) {
+      const sigma1 = utils.rotr(E, 6) ^ utils.rotr(E, 11) ^ utils.rotr(E, 25);
+      const T1 = H + sigma1 + _md.Chi(E, F, G) + SHA256_K[i] + SHA256_W[i] | 0;
+      const sigma0 = utils.rotr(A, 2) ^ utils.rotr(A, 13) ^ utils.rotr(A, 22);
+      const T2 = sigma0 + _md.Maj(A, B, C) | 0;
+      H = G;
+      G = F;
+      F = E;
+      E = D + T1 | 0;
+      D = C;
+      C = B;
+      B = A;
+      A = T1 + T2 | 0;
+    }
+    // Add the compressed chunk to the current hash value
+    A = A + this.A | 0;
+    B = B + this.B | 0;
+    C = C + this.C | 0;
+    D = D + this.D | 0;
+    E = E + this.E | 0;
+    F = F + this.F | 0;
+    G = G + this.G | 0;
+    H = H + this.H | 0;
+    this.set(A, B, C, D, E, F, G, H);
+  }
+  roundClean() {
+    utils.clean(SHA256_W);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0);
+    utils.clean(this.buffer);
+  }
+}
+// SHA2-512 is slower than sha256 in js because u64 operations are slow.
+// Round contants
+// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409
+// prettier-ignore
+const K512 = /* @__PURE__ */(() => _u64.split(['0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc', '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118', '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2', '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694', '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65', '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5', '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4', '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70', '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df', '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b', '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30', '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8', '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8', '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3', '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec', '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b', '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178', '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b', '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c', '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'].map(n => BigInt(n))))();
+const SHA512_Kh = /* @__PURE__ */(() => K512[0])();
+const SHA512_Kl = /* @__PURE__ */(() => K512[1])();
+// Reusable temporary buffers
+const SHA512_W_H = /* @__PURE__ */new Uint32Array(80);
+const SHA512_W_L = /* @__PURE__ */new Uint32Array(80);
+class SHA512 extends _md.HashMD {
+  constructor() {
+    let outputLen = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 64;
+    super(128, outputLen, 16, false);
+    // We cannot use array here since array allows indexing by variable
+    // which means optimizer/compiler cannot use registers.
+    // h -- high 32 bits, l -- low 32 bits
+    this.Ah = _md.SHA512_IV[0] | 0;
+    this.Al = _md.SHA512_IV[1] | 0;
+    this.Bh = _md.SHA512_IV[2] | 0;
+    this.Bl = _md.SHA512_IV[3] | 0;
+    this.Ch = _md.SHA512_IV[4] | 0;
+    this.Cl = _md.SHA512_IV[5] | 0;
+    this.Dh = _md.SHA512_IV[6] | 0;
+    this.Dl = _md.SHA512_IV[7] | 0;
+    this.Eh = _md.SHA512_IV[8] | 0;
+    this.El = _md.SHA512_IV[9] | 0;
+    this.Fh = _md.SHA512_IV[10] | 0;
+    this.Fl = _md.SHA512_IV[11] | 0;
+    this.Gh = _md.SHA512_IV[12] | 0;
+    this.Gl = _md.SHA512_IV[13] | 0;
+    this.Hh = _md.SHA512_IV[14] | 0;
+    this.Hl = _md.SHA512_IV[15] | 0;
+  }
+  // prettier-ignore
+  get() {
+    const {
+      Ah,
+      Al,
+      Bh,
+      Bl,
+      Ch,
+      Cl,
+      Dh,
+      Dl,
+      Eh,
+      El,
+      Fh,
+      Fl,
+      Gh,
+      Gl,
+      Hh,
+      Hl
+    } = this;
+    return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];
+  }
+  // prettier-ignore
+  set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {
+    this.Ah = Ah | 0;
+    this.Al = Al | 0;
+    this.Bh = Bh | 0;
+    this.Bl = Bl | 0;
+    this.Ch = Ch | 0;
+    this.Cl = Cl | 0;
+    this.Dh = Dh | 0;
+    this.Dl = Dl | 0;
+    this.Eh = Eh | 0;
+    this.El = El | 0;
+    this.Fh = Fh | 0;
+    this.Fl = Fl | 0;
+    this.Gh = Gh | 0;
+    this.Gl = Gl | 0;
+    this.Hh = Hh | 0;
+    this.Hl = Hl | 0;
+  }
+  process(view, offset) {
+    // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array
+    for (let i = 0; i < 16; i++, offset += 4) {
+      SHA512_W_H[i] = view.getUint32(offset);
+      SHA512_W_L[i] = view.getUint32(offset += 4);
+    }
+    for (let i = 16; i < 80; i++) {
+      // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)
+      const W15h = SHA512_W_H[i - 15] | 0;
+      const W15l = SHA512_W_L[i - 15] | 0;
+      const s0h = _u64.rotrSH(W15h, W15l, 1) ^ _u64.rotrSH(W15h, W15l, 8) ^ _u64.shrSH(W15h, W15l, 7);
+      const s0l = _u64.rotrSL(W15h, W15l, 1) ^ _u64.rotrSL(W15h, W15l, 8) ^ _u64.shrSL(W15h, W15l, 7);
+      // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)
+      const W2h = SHA512_W_H[i - 2] | 0;
+      const W2l = SHA512_W_L[i - 2] | 0;
+      const s1h = _u64.rotrSH(W2h, W2l, 19) ^ _u64.rotrBH(W2h, W2l, 61) ^ _u64.shrSH(W2h, W2l, 6);
+      const s1l = _u64.rotrSL(W2h, W2l, 19) ^ _u64.rotrBL(W2h, W2l, 61) ^ _u64.shrSL(W2h, W2l, 6);
+      // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];
+      const SUMl = _u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
+      const SUMh = _u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);
+      SHA512_W_H[i] = SUMh | 0;
+      SHA512_W_L[i] = SUMl | 0;
+    }
+    let {
+      Ah,
+      Al,
+      Bh,
+      Bl,
+      Ch,
+      Cl,
+      Dh,
+      Dl,
+      Eh,
+      El,
+      Fh,
+      Fl,
+      Gh,
+      Gl,
+      Hh,
+      Hl
+    } = this;
+    // Compression function main loop, 80 rounds
+    for (let i = 0; i < 80; i++) {
+      // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)
+      const sigma1h = _u64.rotrSH(Eh, El, 14) ^ _u64.rotrSH(Eh, El, 18) ^ _u64.rotrBH(Eh, El, 41);
+      const sigma1l = _u64.rotrSL(Eh, El, 14) ^ _u64.rotrSL(Eh, El, 18) ^ _u64.rotrBL(Eh, El, 41);
+      //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
+      const CHIh = Eh & Fh ^ ~Eh & Gh;
+      const CHIl = El & Fl ^ ~El & Gl;
+      // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]
+      // prettier-ignore
+      const T1ll = _u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
+      const T1h = _u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
+      const T1l = T1ll | 0;
+      // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)
+      const sigma0h = _u64.rotrSH(Ah, Al, 28) ^ _u64.rotrBH(Ah, Al, 34) ^ _u64.rotrBH(Ah, Al, 39);
+      const sigma0l = _u64.rotrSL(Ah, Al, 28) ^ _u64.rotrBL(Ah, Al, 34) ^ _u64.rotrBL(Ah, Al, 39);
+      const MAJh = Ah & Bh ^ Ah & Ch ^ Bh & Ch;
+      const MAJl = Al & Bl ^ Al & Cl ^ Bl & Cl;
+      Hh = Gh | 0;
+      Hl = Gl | 0;
+      Gh = Fh | 0;
+      Gl = Fl | 0;
+      Fh = Eh | 0;
+      Fl = El | 0;
+      ({
+        h: Eh,
+        l: El
+      } = _u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
+      Dh = Ch | 0;
+      Dl = Cl | 0;
+      Ch = Bh | 0;
+      Cl = Bl | 0;
+      Bh = Ah | 0;
+      Bl = Al | 0;
+      const All = _u64.add3L(T1l, sigma0l, MAJl);
+      Ah = _u64.add3H(All, T1h, sigma0h, MAJh);
+      Al = All | 0;
+    }
+    // Add the compressed chunk to the current hash value
+    ({
+      h: Ah,
+      l: Al
+    } = _u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
+    ({
+      h: Bh,
+      l: Bl
+    } = _u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
+    ({
+      h: Ch,
+      l: Cl
+    } = _u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
+    ({
+      h: Dh,
+      l: Dl
+    } = _u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
+    ({
+      h: Eh,
+      l: El
+    } = _u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
+    ({
+      h: Fh,
+      l: Fl
+    } = _u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
+    ({
+      h: Gh,
+      l: Gl
+    } = _u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
+    ({
+      h: Hh,
+      l: Hl
+    } = _u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
+    this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
+  }
+  roundClean() {
+    utils.clean(SHA512_W_H, SHA512_W_L);
+  }
+  destroy() {
+    utils.clean(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+  }
+}
+/**
+ * SHA2-256 hash function from RFC 4634.
+ *
+ * It is the fastest JS hash, even faster than Blake3.
+ * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
+ * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+ */
+const sha256 = /* @__PURE__ */utils.createHasher(() => new SHA256());
+/** SHA2-512 hash function from RFC 4634. */
+const sha512 = /* @__PURE__ */utils.createHasher(() => new SHA512());
+
+exports.SHA256 = SHA256;
+exports.SHA512 = SHA512;
+exports.sha256 = sha256;
+exports.sha512 = sha512;

package/dist/cjs/node_modules/@noble/hashes/esm/sha256.js

@@ -0,0 +1,18 @@
+'use strict';
+
+var sha2 = require('./sha2.js');
+
+/**
+ * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.
+ *
+ * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
+ * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+ *
+ * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+ * @module
+ * @deprecated
+ */
+/** @deprecated Use import from `noble/hashes/sha2` module */
+const sha256 = sha2.sha256;
+
+exports.sha256 = sha256;

package/dist/cjs/node_modules/@noble/hashes/esm/sha512.js

@@ -0,0 +1,16 @@
+'use strict';
+
+var sha2 = require('./sha2.js');
+
+/**
+ * SHA2-512 a.k.a. sha512 and sha384. It is slower than sha256 in js because u64 operations are slow.
+ *
+ * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and
+ * [the paper on truncated SHA512/256](https://eprint.iacr.org/2010/548.pdf).
+ * @module
+ * @deprecated
+ */
+/** @deprecated Use import from `noble/hashes/sha2` module */
+const sha512 = sha2.sha512;
+
+exports.sha512 = sha512;

package/dist/cjs/node_modules/@noble/hashes/esm/utils.js

@@ -0,0 +1,204 @@
+'use strict';
+
+var crypto = require('./crypto.js');
+
+/**
+ * Utilities for hex, bytes, CSPRNG.
+ * @module
+ */
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.
+// node.js versions earlier than v19 don't declare it in global scope.
+// For node.js, package.json#exports field mapping rewrites import
+// from `crypto` to `cryptoNode`, which imports native module.
+// Makes the utils un-importable in browsers without a bundler.
+// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.
+/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */
+function isBytes(a) {
+  return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array';
+}
+/** Asserts something is positive integer. */
+function anumber(n) {
+  if (!Number.isSafeInteger(n) || n < 0) throw new Error('positive integer expected, got ' + n);
+}
+/** Asserts something is Uint8Array. */
+function abytes(b) {
+  if (!isBytes(b)) throw new Error('Uint8Array expected');
+  for (var _len = arguments.length, lengths = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    lengths[_key - 1] = arguments[_key];
+  }
+  if (lengths.length > 0 && !lengths.includes(b.length)) throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);
+}
+/** Asserts something is hash */
+function ahash(h) {
+  if (typeof h !== 'function' || typeof h.create !== 'function') throw new Error('Hash should be wrapped by utils.createHasher');
+  anumber(h.outputLen);
+  anumber(h.blockLen);
+}
+/** Asserts a hash instance has not been destroyed / finished */
+function aexists(instance) {
+  let checkFinished = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+  if (instance.destroyed) throw new Error('Hash instance has been destroyed');
+  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');
+}
+/** Asserts output is properly-sized byte array */
+function aoutput(out, instance) {
+  abytes(out);
+  const min = instance.outputLen;
+  if (out.length < min) {
+    throw new Error('digestInto() expects output buffer of length at least ' + min);
+  }
+}
+/** Zeroize a byte array. Warning: JS provides no guarantees. */
+function clean() {
+  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    arrays[_key2] = arguments[_key2];
+  }
+  for (let i = 0; i < arrays.length; i++) {
+    arrays[i].fill(0);
+  }
+}
+/** Create DataView of an array for easy byte-level manipulation. */
+function createView(arr) {
+  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+}
+/** The rotate right (circular right shift) operation for uint32 */
+function rotr(word, shift) {
+  return word << 32 - shift | word >>> shift;
+}
+// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex
+const hasHexBuiltin = /* @__PURE__ */(() =>
+// @ts-ignore
+typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();
+// Array where index 0xf0 (240) is mapped to string 'f0'
+const hexes = /* @__PURE__ */Array.from({
+  length: 256
+}, (_, i) => i.toString(16).padStart(2, '0'));
+/**
+ * Convert byte array to hex string. Uses built-in function, when available.
+ * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'
+ */
+function bytesToHex(bytes) {
+  abytes(bytes);
+  // @ts-ignore
+  if (hasHexBuiltin) return bytes.toHex();
+  // pre-caching improves the speed 6x
+  let hex = '';
+  for (let i = 0; i < bytes.length; i++) {
+    hex += hexes[bytes[i]];
+  }
+  return hex;
+}
+// We use optimized technique to convert hex string to byte array
+const asciis = {
+  _0: 48,
+  _9: 57,
+  A: 65,
+  F: 70,
+  a: 97,
+  f: 102
+};
+function asciiToBase16(ch) {
+  if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48
+  if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)
+  if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)
+  return;
+}
+/**
+ * Convert hex string to byte array. Uses built-in function, when available.
+ * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])
+ */
+function hexToBytes(hex) {
+  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);
+  // @ts-ignore
+  if (hasHexBuiltin) return Uint8Array.fromHex(hex);
+  const hl = hex.length;
+  const al = hl / 2;
+  if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);
+  const array = new Uint8Array(al);
+  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
+    const n1 = asciiToBase16(hex.charCodeAt(hi));
+    const n2 = asciiToBase16(hex.charCodeAt(hi + 1));
+    if (n1 === undefined || n2 === undefined) {
+      const char = hex[hi] + hex[hi + 1];
+      throw new Error('hex string expected, got non-hex character "' + char + '" at index ' + hi);
+    }
+    array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163
+  }
+  return array;
+}
+/**
+ * Converts string to bytes using UTF8 encoding.
+ * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])
+ */
+function utf8ToBytes(str) {
+  if (typeof str !== 'string') throw new Error('string expected');
+  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
+}
+/**
+ * Normalizes (non-hex) string or Uint8Array to Uint8Array.
+ * Warning: when Uint8Array is passed, it would NOT get copied.
+ * Keep in mind for future mutable operations.
+ */
+function toBytes(data) {
+  if (typeof data === 'string') data = utf8ToBytes(data);
+  abytes(data);
+  return data;
+}
+/** Copies several Uint8Arrays into one. */
+function concatBytes() {
+  let sum = 0;
+  for (let i = 0; i < arguments.length; i++) {
+    const a = i < 0 || arguments.length <= i ? undefined : arguments[i];
+    abytes(a);
+    sum += a.length;
+  }
+  const res = new Uint8Array(sum);
+  for (let i = 0, pad = 0; i < arguments.length; i++) {
+    const a = i < 0 || arguments.length <= i ? undefined : arguments[i];
+    res.set(a, pad);
+    pad += a.length;
+  }
+  return res;
+}
+/** For runtime check if class implements interface */
+class Hash {}
+/** Wraps hash function, creating an interface on top of it */
+function createHasher(hashCons) {
+  const hashC = msg => hashCons().update(toBytes(msg)).digest();
+  const tmp = hashCons();
+  hashC.outputLen = tmp.outputLen;
+  hashC.blockLen = tmp.blockLen;
+  hashC.create = () => hashCons();
+  return hashC;
+}
+/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */
+function randomBytes() {
+  let bytesLength = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 32;
+  if (crypto.crypto && typeof crypto.crypto.getRandomValues === 'function') {
+    return crypto.crypto.getRandomValues(new Uint8Array(bytesLength));
+  }
+  // Legacy Node.js compatibility
+  if (crypto.crypto && typeof crypto.crypto.randomBytes === 'function') {
+    return Uint8Array.from(crypto.crypto.randomBytes(bytesLength));
+  }
+  throw new Error('crypto.getRandomValues must be defined');
+}
+
+exports.Hash = Hash;
+exports.abytes = abytes;
+exports.aexists = aexists;
+exports.ahash = ahash;
+exports.anumber = anumber;
+exports.aoutput = aoutput;
+exports.bytesToHex = bytesToHex;
+exports.clean = clean;
+exports.concatBytes = concatBytes;
+exports.createHasher = createHasher;
+exports.createView = createView;
+exports.hexToBytes = hexToBytes;
+exports.isBytes = isBytes;
+exports.randomBytes = randomBytes;
+exports.rotr = rotr;
+exports.toBytes = toBytes;
+exports.utf8ToBytes = utf8ToBytes;

package/dist/cjs/node_modules/@peculiar/asn1-cms/build/es2015/attribute.js

@@ -0,0 +1,25 @@
+'use strict';
+
+var tslib_es6 = require('../../../../tslib/tslib.es6.js');
+require('../../../../asn1js/build/index.es.js');
+var enums = require('../../../asn1-schema/build/es2015/enums.js');
+require('../../../../../_virtual/index9.js');
+var decorators = require('../../../asn1-schema/build/es2015/decorators.js');
+
+class Attribute {
+  constructor() {
+    let params = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};
+    this.attrType = "";
+    this.attrValues = [];
+    Object.assign(this, params);
+  }
+}
+tslib_es6.__decorate([decorators.AsnProp({
+  type: enums.AsnPropTypes.ObjectIdentifier
+})], Attribute.prototype, "attrType", void 0);
+tslib_es6.__decorate([decorators.AsnProp({
+  type: enums.AsnPropTypes.Any,
+  repeated: "set"
+})], Attribute.prototype, "attrValues", void 0);
+
+exports.Attribute = Attribute;

package/dist/cjs/node_modules/@peculiar/asn1-cms/build/es2015/attributes.js

@@ -0,0 +1,55 @@
+'use strict';
+
+var tslib_es6 = require('../../../../tslib/tslib.es6.js');
+require('../../../../asn1js/build/index.es.js');
+var enums = require('../../../asn1-schema/build/es2015/enums.js');
+require('../../../../../_virtual/index9.js');
+var decorators = require('../../../asn1-schema/build/es2015/decorators.js');
+require('../../../asn1-x509/build/es2015/extensions/authority_information_access.js');
+require('../../../asn1-x509/build/es2015/extensions/authority_key_identifier.js');
+require('../../../asn1-x509/build/es2015/extensions/basic_constraints.js');
+require('../../../asn1-x509/build/es2015/extensions/certificate_issuer.js');
+require('../../../asn1-x509/build/es2015/extensions/certificate_policies.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_delta_indicator.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_distribution_points.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_freshest.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_issuing_distribution_point.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_number.js');
+require('../../../asn1-x509/build/es2015/extensions/crl_reason.js');
+require('../../../asn1-x509/build/es2015/extensions/extended_key_usage.js');
+require('../../../asn1-x509/build/es2015/extensions/inhibit_any_policy.js');
+require('../../../asn1-x509/build/es2015/extensions/invalidity_date.js');
+require('../../../asn1-x509/build/es2015/extensions/issuer_alternative_name.js');
+require('../../../asn1-x509/build/es2015/extensions/key_usage.js');
+require('../../../asn1-x509/build/es2015/extensions/name_constraints.js');
+require('../../../asn1-x509/build/es2015/extensions/policy_constraints.js');
+require('../../../asn1-x509/build/es2015/extensions/policy_mappings.js');
+require('../../../asn1-x509/build/es2015/extensions/subject_alternative_name.js');
+require('../../../asn1-x509/build/es2015/extensions/subject_directory_attributes.js');
+require('../../../asn1-x509/build/es2015/extensions/private_key_usage_period.js');
+require('../../../asn1-x509/build/es2015/extensions/entrust_version_info.js');
+require('../../../asn1-x509/build/es2015/extensions/subject_info_access.js');
+require('../../../asn1-x509/build/es2015/algorithm_identifier.js');
+require('../../../asn1-x509/build/es2015/attribute.js');
+require('../../../asn1-x509/build/es2015/certificate.js');
+require('../../../asn1-x509/build/es2015/certificate_list.js');
+require('../../../asn1-x509/build/es2015/extension.js');
+require('../../../asn1-x509/build/es2015/general_name.js');
+require('../../../asn1-x509/build/es2015/general_names.js');
+require('../../../asn1-x509/build/es2015/name.js');
+require('../../../asn1-x509/build/es2015/subject_public_key_info.js');
+require('../../../asn1-x509/build/es2015/tbs_cert_list.js');
+require('../../../asn1-x509/build/es2015/tbs_certificate.js');
+var time = require('../../../asn1-x509/build/es2015/time.js');
+require('../../../asn1-x509/build/es2015/types.js');
+require('../../../asn1-x509/build/es2015/validity.js');
+var signer_info = require('./signer_info.js');
+
+exports.SigningTime = class SigningTime extends time.Time {};
+exports.SigningTime = tslib_es6.__decorate([decorators.AsnType({
+  type: enums.AsnTypeTypes.Choice
+})], exports.SigningTime);
+exports.CounterSignature = class CounterSignature extends signer_info.SignerInfo {};
+exports.CounterSignature = tslib_es6.__decorate([decorators.AsnType({
+  type: enums.AsnTypeTypes.Sequence
+})], exports.CounterSignature);