opnet 1.8.3 → 1.8.4

package/browser/noble-hashes.js

@@ -1,2577 +1,1885 @@
-import { g as getAugmentedNamespace } from './vendors.js';
-
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function isBytes(a) {
-  return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
-}
-function anumber(n, title = "") {
-  if (!Number.isSafeInteger(n) || n < 0) {
-    const prefix = title && `"${title}" `;
-    throw new Error(`${prefix}expected integer >= 0, got ${n}`);
-  }
-}
-function abytes(value, length, title = "") {
-  const bytes = isBytes(value);
-  const len = value?.length;
-  const needsLen = length !== void 0;
-  if (!bytes || needsLen && len !== length) {
-    const prefix = title && `"${title}" `;
-    const ofLen = needsLen ? ` of length ${length}` : "";
-    const got = bytes ? `length=${len}` : `type=${typeof value}`;
-    throw new Error(prefix + "expected Uint8Array" + ofLen + ", got " + got);
-  }
-  return value;
-}
-function ahash(h) {
-  if (typeof h !== "function" || typeof h.create !== "function")
-    throw new Error("Hash must wrapped by utils.createHasher");
-  anumber(h.outputLen);
-  anumber(h.blockLen);
-}
-function aexists(instance, checkFinished = 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");
-}
-function aoutput(out, instance) {
-  abytes(out, void 0, "digestInto() output");
-  const min = instance.outputLen;
-  if (out.length < min) {
-    throw new Error('"digestInto() output" expected to be of length >=' + min);
-  }
-}
-function u32(arr) {
-  return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
-}
-function clean(...arrays) {
-  for (let i = 0; i < arrays.length; i++) {
-    arrays[i].fill(0);
-  }
-}
-function createView(arr) {
-  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-}
-function rotr(word, shift) {
-  return word << 32 - shift | word >>> shift;
-}
-function rotl(word, shift) {
-  return word << shift | word >>> 32 - shift >>> 0;
-}
-const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68)();
-function byteSwap(word) {
-  return word << 24 & 4278190080 | word << 8 & 16711680 | word >>> 8 & 65280 | word >>> 24 & 255;
-}
-function byteSwap32(arr) {
-  for (let i = 0; i < arr.length; i++) {
-    arr[i] = byteSwap(arr[i]);
-  }
-  return arr;
-}
-const swap32IfBE = isLE ? (u) => u : byteSwap32;
-const hasHexBuiltin = /* @__PURE__ */ (() => (
-  // @ts-ignore
-  typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function"
-))();
-const hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
-function bytesToHex(bytes) {
-  abytes(bytes);
-  if (hasHexBuiltin)
-    return bytes.toHex();
-  let hex = "";
-  for (let i = 0; i < bytes.length; i++) {
-    hex += hexes[bytes[i]];
-  }
-  return hex;
-}
-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;
-  if (ch >= asciis.A && ch <= asciis.F)
-    return ch - (asciis.A - 10);
-  if (ch >= asciis.a && ch <= asciis.f)
-    return ch - (asciis.a - 10);
-  return;
-}
-function hexToBytes(hex) {
-  if (typeof hex !== "string")
-    throw new Error("hex string expected, got " + typeof hex);
-  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 === void 0 || n2 === void 0) {
-      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;
-  }
-  return array;
-}
-function concatBytes(...arrays) {
-  let sum = 0;
-  for (let i = 0; i < arrays.length; i++) {
-    const a = arrays[i];
-    abytes(a);
-    sum += a.length;
-  }
-  const res = new Uint8Array(sum);
-  for (let i = 0, pad = 0; i < arrays.length; i++) {
-    const a = arrays[i];
-    res.set(a, pad);
-    pad += a.length;
-  }
-  return res;
-}
-function createHasher(hashCons, info = {}) {
-  const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
-  const tmp = hashCons(void 0);
-  hashC.outputLen = tmp.outputLen;
-  hashC.blockLen = tmp.blockLen;
-  hashC.create = (opts) => hashCons(opts);
-  Object.assign(hashC, info);
-  return Object.freeze(hashC);
-}
-function randomBytes(bytesLength = 32) {
-  const cr = typeof globalThis === "object" ? globalThis.crypto : null;
-  if (typeof cr?.getRandomValues !== "function")
-    throw new Error("crypto.getRandomValues must be defined");
-  return cr.getRandomValues(new Uint8Array(bytesLength));
-}
-const oidNist = (suffix) => ({
-  oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, suffix])
+import { n as __esmMin, r as __exportAll, t as __commonJSMin } from "./rolldown-runtime.js";
+import { C as Maj, D as anumber, E as aexists, I as rotl, L as swap32IfBE, M as init_utils, O as aoutput, P as oidNist, R as u32, S as HashMD, T as abytes, _ as rotlBL, b as split, g as rotlBH, h as init__u64, j as createHasher, k as clean, v as rotlSH, w as init__md, x as Chi, y as rotlSL } from "./noble-curves.js";
+//#region node_modules/@noble/hashes/legacy.js
+var legacy_exports = /* @__PURE__ */ __exportAll({
+	_MD5: () => _MD5,
+	_RIPEMD160: () => _RIPEMD160,
+	_SHA1: () => _SHA1,
+	md5: () => md5,
+	ripemd160: () => ripemd160,
+	sha1: () => sha1
 });
-
-/**
- * Internal Merkle-Damgard hash utils.
- * @module
- */
-/** Choice: a ? b : c */
-function Chi(a, b, c) {
-    return (a & b) ^ (~a & c);
-}
-/** Majority function, true if any two inputs is true. */
-function Maj(a, b, c) {
-    return (a & b) ^ (a & c) ^ (b & c);
-}
-/**
- * Merkle-Damgard hash construction base class.
- * Could be used to create MD5, RIPEMD, SHA1, SHA2.
- */
-class HashMD {
-    blockLen;
-    outputLen;
-    padOffset;
-    isLE;
-    // For partial updates less than block size
-    buffer;
-    view;
-    finished = false;
-    length = 0;
-    pos = 0;
-    destroyed = false;
-    constructor(blockLen, outputLen, padOffset, isLE) {
-        this.blockLen = blockLen;
-        this.outputLen = outputLen;
-        this.padOffset = padOffset;
-        this.isLE = isLE;
-        this.buffer = new Uint8Array(blockLen);
-        this.view = createView(this.buffer);
-    }
-    update(data) {
-        aexists(this);
-        abytes(data);
-        const { view, buffer, blockLen } = this;
-        const len = data.length;
-        for (let pos = 0; pos < len;) {
-            const take = Math.min(blockLen - this.pos, len - pos);
-            // Fast path: we have at least one block in input, cast it to view and process
-            if (take === blockLen) {
-                const dataView = createView(data);
-                for (; blockLen <= len - pos; pos += blockLen)
-                    this.process(dataView, pos);
-                continue;
-            }
-            buffer.set(data.subarray(pos, pos + take), this.pos);
-            this.pos += take;
-            pos += take;
-            if (this.pos === blockLen) {
-                this.process(view, 0);
-                this.pos = 0;
-            }
-        }
-        this.length += data.length;
-        this.roundClean();
-        return this;
-    }
-    digestInto(out) {
-        aexists(this);
-        aoutput(out, this);
-        this.finished = true;
-        // Padding
-        // We can avoid allocation of buffer for padding completely if it
-        // was previously not allocated here. But it won't change performance.
-        const { buffer, view, blockLen, isLE } = this;
-        let { pos } = this;
-        // append the bit '1' to the message
-        buffer[pos++] = 0b10000000;
-        clean(this.buffer.subarray(pos));
-        // we have less than padOffset left in buffer, so we cannot put length in
-        // current block, need process it and pad again
-        if (this.padOffset > blockLen - pos) {
-            this.process(view, 0);
-            pos = 0;
-        }
-        // Pad until full block byte with zeros
-        for (let i = pos; i < blockLen; i++)
-            buffer[i] = 0;
-        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
-        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
-        // So we just write lowest 64 bits of that value.
-        view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);
-        this.process(view, 0);
-        const oview = createView(out);
-        const len = this.outputLen;
-        // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT
-        if (len % 4)
-            throw new Error('_sha2: outputLen must be aligned to 32bit');
-        const outLen = len / 4;
-        const state = this.get();
-        if (outLen > state.length)
-            throw new Error('_sha2: outputLen bigger than state');
-        for (let i = 0; i < outLen; i++)
-            oview.setUint32(4 * i, state[i], isLE);
-    }
-    digest() {
-        const { buffer, outputLen } = this;
-        this.digestInto(buffer);
-        const res = buffer.slice(0, outputLen);
-        this.destroy();
-        return res;
-    }
-    _cloneInto(to) {
-        to ||= new this.constructor();
-        to.set(...this.get());
-        const { blockLen, buffer, length, finished, destroyed, pos } = this;
-        to.destroyed = destroyed;
-        to.finished = finished;
-        to.length = length;
-        to.pos = pos;
-        if (length % blockLen)
-            to.buffer.set(buffer);
-        return to;
-    }
-    clone() {
-        return this._cloneInto();
-    }
-}
-/**
- * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
- * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
- */
-/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */
-const SHA256_IV = /* @__PURE__ */ Uint32Array.from([
-    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
-]);
-/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */
-const SHA224_IV = /* @__PURE__ */ Uint32Array.from([
-    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,
-]);
-/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */
-const SHA384_IV = /* @__PURE__ */ Uint32Array.from([
-    0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,
-    0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,
-]);
-/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */
-const SHA512_IV = /* @__PURE__ */ Uint32Array.from([
-    0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,
-    0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,
-]);
-
-/**
- * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
- * @todo re-check https://issues.chromium.org/issues/42212588
- * @module
- */
-const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-const _32n = /* @__PURE__ */ BigInt(32);
-function fromBig(n, le = false) {
-    if (le)
-        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
-    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
-}
-function split(lst, le = false) {
-    const len = lst.length;
-    let Ah = new Uint32Array(len);
-    let Al = new Uint32Array(len);
-    for (let i = 0; i < len; i++) {
-        const { h, l } = fromBig(lst[i], le);
-        [Ah[i], Al[i]] = [h, l];
-    }
-    return [Ah, Al];
-}
-// for Shift in [0, 32)
-const shrSH = (h, _l, s) => h >>> s;
-const shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
-// Right rotate for Shift in [1, 32)
-const rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));
-const rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
-// Right rotate for Shift in (32, 64), NOTE: 32 is special case.
-const rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));
-const rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));
-// Left rotate for Shift in [1, 32)
-const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
-const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
-// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
-const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
-const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
-// JS uses 32-bit signed integers for bitwise operations which means we cannot
-// simple take carry out of low bit sum by shift, we need to use division.
-function add(Ah, Al, Bh, Bl) {
-    const l = (Al >>> 0) + (Bl >>> 0);
-    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };
-}
-// Addition with more than 2 elements
-const add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
-const add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;
-const add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
-const add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;
-const add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
-const add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;
-
-/**
- * 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://www.rfc-editor.org/rfc/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);
-/** Internal 32-byte base SHA2 hash class. */
-class SHA2_32B extends HashMD {
-    constructor(outputLen) {
-        super(64, outputLen, 8, false);
-    }
-    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 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);
-            const s1 = rotr(W2, 17) ^ 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 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
-            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);
-            const T2 = (sigma0 + 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() {
-        clean(SHA256_W);
-    }
-    destroy() {
-        this.set(0, 0, 0, 0, 0, 0, 0, 0);
-        clean(this.buffer);
-    }
-}
-/** Internal SHA2-256 hash class. */
-class _SHA256 extends SHA2_32B {
-    // We cannot use array here since array allows indexing by variable
-    // which means optimizer/compiler cannot use registers.
-    A = SHA256_IV[0] | 0;
-    B = SHA256_IV[1] | 0;
-    C = SHA256_IV[2] | 0;
-    D = SHA256_IV[3] | 0;
-    E = SHA256_IV[4] | 0;
-    F = SHA256_IV[5] | 0;
-    G = SHA256_IV[6] | 0;
-    H = SHA256_IV[7] | 0;
-    constructor() {
-        super(32);
-    }
-}
-/** Internal SHA2-224 hash class. */
-class _SHA224 extends SHA2_32B {
-    A = SHA224_IV[0] | 0;
-    B = SHA224_IV[1] | 0;
-    C = SHA224_IV[2] | 0;
-    D = SHA224_IV[3] | 0;
-    E = SHA224_IV[4] | 0;
-    F = SHA224_IV[5] | 0;
-    G = SHA224_IV[6] | 0;
-    H = SHA224_IV[7] | 0;
-    constructor() {
-        super(28);
-    }
-}
-// 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__ */ (() => 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);
-/** Internal 64-byte base SHA2 hash class. */
-class SHA2_64B extends HashMD {
-    constructor(outputLen) {
-        super(128, outputLen, 16, false);
-    }
-    // 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 = rotrSH(W15h, W15l, 1) ^ rotrSH(W15h, W15l, 8) ^ shrSH(W15h, W15l, 7);
-            const s0l = rotrSL(W15h, W15l, 1) ^ rotrSL(W15h, W15l, 8) ^ 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 = rotrSH(W2h, W2l, 19) ^ rotrBH(W2h, W2l, 61) ^ shrSH(W2h, W2l, 6);
-            const s1l = rotrSL(W2h, W2l, 19) ^ rotrBL(W2h, W2l, 61) ^ shrSL(W2h, W2l, 6);
-            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];
-            const SUMl = add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
-            const SUMh = 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 = rotrSH(Eh, El, 14) ^ rotrSH(Eh, El, 18) ^ rotrBH(Eh, El, 41);
-            const sigma1l = rotrSL(Eh, El, 14) ^ rotrSL(Eh, El, 18) ^ 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 = add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
-            const T1h = 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 = rotrSH(Ah, Al, 28) ^ rotrBH(Ah, Al, 34) ^ rotrBH(Ah, Al, 39);
-            const sigma0l = rotrSL(Ah, Al, 28) ^ rotrBL(Ah, Al, 34) ^ 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 } = 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 = add3L(T1l, sigma0l, MAJl);
-            Ah = add3H(All, T1h, sigma0h, MAJh);
-            Al = All | 0;
-        }
-        // Add the compressed chunk to the current hash value
-        ({ h: Ah, l: Al } = add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
-        ({ h: Bh, l: Bl } = add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
-        ({ h: Ch, l: Cl } = add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
-        ({ h: Dh, l: Dl } = add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
-        ({ h: Eh, l: El } = add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
-        ({ h: Fh, l: Fl } = add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
-        ({ h: Gh, l: Gl } = add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
-        ({ h: Hh, l: Hl } = 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() {
-        clean(SHA512_W_H, SHA512_W_L);
-    }
-    destroy() {
-        clean(this.buffer);
-        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-    }
-}
-/** Internal SHA2-512 hash class. */
-class _SHA512 extends SHA2_64B {
-    Ah = SHA512_IV[0] | 0;
-    Al = SHA512_IV[1] | 0;
-    Bh = SHA512_IV[2] | 0;
-    Bl = SHA512_IV[3] | 0;
-    Ch = SHA512_IV[4] | 0;
-    Cl = SHA512_IV[5] | 0;
-    Dh = SHA512_IV[6] | 0;
-    Dl = SHA512_IV[7] | 0;
-    Eh = SHA512_IV[8] | 0;
-    El = SHA512_IV[9] | 0;
-    Fh = SHA512_IV[10] | 0;
-    Fl = SHA512_IV[11] | 0;
-    Gh = SHA512_IV[12] | 0;
-    Gl = SHA512_IV[13] | 0;
-    Hh = SHA512_IV[14] | 0;
-    Hl = SHA512_IV[15] | 0;
-    constructor() {
-        super(64);
-    }
-}
-/** Internal SHA2-384 hash class. */
-class _SHA384 extends SHA2_64B {
-    Ah = SHA384_IV[0] | 0;
-    Al = SHA384_IV[1] | 0;
-    Bh = SHA384_IV[2] | 0;
-    Bl = SHA384_IV[3] | 0;
-    Ch = SHA384_IV[4] | 0;
-    Cl = SHA384_IV[5] | 0;
-    Dh = SHA384_IV[6] | 0;
-    Dl = SHA384_IV[7] | 0;
-    Eh = SHA384_IV[8] | 0;
-    El = SHA384_IV[9] | 0;
-    Fh = SHA384_IV[10] | 0;
-    Fl = SHA384_IV[11] | 0;
-    Gh = SHA384_IV[12] | 0;
-    Gl = SHA384_IV[13] | 0;
-    Hh = SHA384_IV[14] | 0;
-    Hl = SHA384_IV[15] | 0;
-    constructor() {
-        super(48);
-    }
-}
-/**
- * Truncated SHA512/256 and SHA512/224.
- * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as "intermediary" IV of SHA512/t.
- * Then t hashes string to produce result IV.
- * See `test/misc/sha2-gen-iv.js`.
- */
-/** SHA512/224 IV */
-const T224_IV = /* @__PURE__ */ Uint32Array.from([
-    0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,
-    0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,
-]);
-/** SHA512/256 IV */
-const T256_IV = /* @__PURE__ */ Uint32Array.from([
-    0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,
-    0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,
-]);
-/** Internal SHA2-512/224 hash class. */
-class _SHA512_224 extends SHA2_64B {
-    Ah = T224_IV[0] | 0;
-    Al = T224_IV[1] | 0;
-    Bh = T224_IV[2] | 0;
-    Bl = T224_IV[3] | 0;
-    Ch = T224_IV[4] | 0;
-    Cl = T224_IV[5] | 0;
-    Dh = T224_IV[6] | 0;
-    Dl = T224_IV[7] | 0;
-    Eh = T224_IV[8] | 0;
-    El = T224_IV[9] | 0;
-    Fh = T224_IV[10] | 0;
-    Fl = T224_IV[11] | 0;
-    Gh = T224_IV[12] | 0;
-    Gl = T224_IV[13] | 0;
-    Hh = T224_IV[14] | 0;
-    Hl = T224_IV[15] | 0;
-    constructor() {
-        super(28);
-    }
-}
-/** Internal SHA2-512/256 hash class. */
-class _SHA512_256 extends SHA2_64B {
-    Ah = T256_IV[0] | 0;
-    Al = T256_IV[1] | 0;
-    Bh = T256_IV[2] | 0;
-    Bl = T256_IV[3] | 0;
-    Ch = T256_IV[4] | 0;
-    Cl = T256_IV[5] | 0;
-    Dh = T256_IV[6] | 0;
-    Dl = T256_IV[7] | 0;
-    Eh = T256_IV[8] | 0;
-    El = T256_IV[9] | 0;
-    Fh = T256_IV[10] | 0;
-    Fl = T256_IV[11] | 0;
-    Gh = T256_IV[12] | 0;
-    Gl = T256_IV[13] | 0;
-    Hh = T256_IV[14] | 0;
-    Hl = T256_IV[15] | 0;
-    constructor() {
-        super(32);
-    }
-}
-/**
- * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:
- *
- * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.
- * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
- * - Each sha256 hash is executing 2^18 bit operations.
- * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.
- */
-const sha256$1 = /* @__PURE__ */ createHasher(() => new _SHA256(), 
-/* @__PURE__ */ oidNist(0x01));
-/** SHA2-224 hash function from RFC 4634 */
-const sha224 = /* @__PURE__ */ createHasher(() => new _SHA224(), 
-/* @__PURE__ */ oidNist(0x04));
-/** SHA2-512 hash function from RFC 4634. */
-const sha512$1 = /* @__PURE__ */ createHasher(() => new _SHA512(), 
-/* @__PURE__ */ oidNist(0x03));
-/** SHA2-384 hash function from RFC 4634. */
-const sha384 = /* @__PURE__ */ createHasher(() => new _SHA384(), 
-/* @__PURE__ */ oidNist(0x02));
-/**
- * SHA2-512/256 "truncated" hash function, with improved resistance to length extension attacks.
- * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
- */
-const sha512_256 = /* @__PURE__ */ createHasher(() => new _SHA512_256(), 
-/* @__PURE__ */ oidNist(0x06));
-/**
- * SHA2-512/224 "truncated" hash function, with improved resistance to length extension attacks.
- * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
- */
-const sha512_224 = /* @__PURE__ */ createHasher(() => new _SHA512_224(), 
-/* @__PURE__ */ oidNist(0x05));
-
-const sha2$1 = /*#__PURE__*/Object.freeze(/*#__PURE__*/Object.defineProperty({
-    __proto__: null,
-    _SHA224,
-    _SHA256,
-    _SHA384,
-    _SHA512,
-    _SHA512_224,
-    _SHA512_256,
-    sha224,
-    sha256: sha256$1,
-    sha384,
-    sha512: sha512$1,
-    sha512_224,
-    sha512_256
-}, Symbol.toStringTag, { value: 'Module' }));
-
-/**
-
-SHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.
-Don't use them in a new protocol. What "weak" means:
-
-- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.
-- No practical pre-image attacks (only theoretical, 2^123.4)
-- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151
- * @module
- */
-/** Initial SHA1 state */
-const SHA1_IV = /* @__PURE__ */ Uint32Array.from([
-    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,
-]);
-// Reusable temporary buffer
-const SHA1_W = /* @__PURE__ */ new Uint32Array(80);
-/** Internal SHA1 legacy hash class. */
-class _SHA1 extends HashMD {
-    A = SHA1_IV[0] | 0;
-    B = SHA1_IV[1] | 0;
-    C = SHA1_IV[2] | 0;
-    D = SHA1_IV[3] | 0;
-    E = SHA1_IV[4] | 0;
-    constructor() {
-        super(64, 20, 8, false);
-    }
-    get() {
-        const { A, B, C, D, E } = this;
-        return [A, B, C, D, E];
-    }
-    set(A, B, C, D, E) {
-        this.A = A | 0;
-        this.B = B | 0;
-        this.C = C | 0;
-        this.D = D | 0;
-        this.E = E | 0;
-    }
-    process(view, offset) {
-        for (let i = 0; i < 16; i++, offset += 4)
-            SHA1_W[i] = view.getUint32(offset, false);
-        for (let i = 16; i < 80; i++)
-            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);
-        // Compression function main loop, 80 rounds
-        let { A, B, C, D, E } = this;
-        for (let i = 0; i < 80; i++) {
-            let F, K;
-            if (i < 20) {
-                F = Chi(B, C, D);
-                K = 0x5a827999;
-            }
-            else if (i < 40) {
-                F = B ^ C ^ D;
-                K = 0x6ed9eba1;
-            }
-            else if (i < 60) {
-                F = Maj(B, C, D);
-                K = 0x8f1bbcdc;
-            }
-            else {
-                F = B ^ C ^ D;
-                K = 0xca62c1d6;
-            }
-            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;
-            E = D;
-            D = C;
-            C = rotl(B, 30);
-            B = A;
-            A = T;
-        }
-        // 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;
-        this.set(A, B, C, D, E);
-    }
-    roundClean() {
-        clean(SHA1_W);
-    }
-    destroy() {
-        this.set(0, 0, 0, 0, 0);
-        clean(this.buffer);
-    }
-}
-/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */
-const sha1 = /* @__PURE__ */ createHasher(() => new _SHA1());
-/** Per-round constants */
-const p32 = /* @__PURE__ */ Math.pow(2, 32);
-const K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) => Math.floor(p32 * Math.abs(Math.sin(i + 1))));
-/** md5 initial state: same as sha1, but 4 u32 instead of 5. */
-const MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);
-// Reusable temporary buffer
-const MD5_W = /* @__PURE__ */ new Uint32Array(16);
-/** Internal MD5 legacy hash class. */
-class _MD5 extends HashMD {
-    A = MD5_IV[0] | 0;
-    B = MD5_IV[1] | 0;
-    C = MD5_IV[2] | 0;
-    D = MD5_IV[3] | 0;
-    constructor() {
-        super(64, 16, 8, true);
-    }
-    get() {
-        const { A, B, C, D } = this;
-        return [A, B, C, D];
-    }
-    set(A, B, C, D) {
-        this.A = A | 0;
-        this.B = B | 0;
-        this.C = C | 0;
-        this.D = D | 0;
-    }
-    process(view, offset) {
-        for (let i = 0; i < 16; i++, offset += 4)
-            MD5_W[i] = view.getUint32(offset, true);
-        // Compression function main loop, 64 rounds
-        let { A, B, C, D } = this;
-        for (let i = 0; i < 64; i++) {
-            let F, g, s;
-            if (i < 16) {
-                F = Chi(B, C, D);
-                g = i;
-                s = [7, 12, 17, 22];
-            }
-            else if (i < 32) {
-                F = Chi(D, B, C);
-                g = (5 * i + 1) % 16;
-                s = [5, 9, 14, 20];
-            }
-            else if (i < 48) {
-                F = B ^ C ^ D;
-                g = (3 * i + 5) % 16;
-                s = [4, 11, 16, 23];
-            }
-            else {
-                F = C ^ (B | ~D);
-                g = (7 * i) % 16;
-                s = [6, 10, 15, 21];
-            }
-            F = F + A + K[i] + MD5_W[g];
-            A = D;
-            D = C;
-            C = B;
-            B = B + rotl(F, s[i % 4]);
-        }
-        // 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;
-        this.set(A, B, C, D);
-    }
-    roundClean() {
-        clean(MD5_W);
-    }
-    destroy() {
-        this.set(0, 0, 0, 0);
-        clean(this.buffer);
-    }
-}
-/**
- * MD5 (RFC 1321) legacy hash function. It was cryptographically broken.
- * MD5 architecture is similar to SHA1, with some differences:
- * - Reduced output length: 16 bytes (128 bit) instead of 20
- * - 64 rounds, instead of 80
- * - Little-endian: could be faster, but will require more code
- * - Non-linear index selection: huge speed-up for unroll
- * - Per round constants: more memory accesses, additional speed-up for unroll
- */
-const md5 = /* @__PURE__ */ createHasher(() => new _MD5());
-// RIPEMD-160
-const Rho160 = /* @__PURE__ */ Uint8Array.from([
-    7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
-]);
-const Id160 = /* @__PURE__ */ (() => Uint8Array.from(new Array(16).fill(0).map((_, i) => i)))();
-const Pi160 = /* @__PURE__ */ (() => Id160.map((i) => (9 * i + 5) % 16))();
-const idxLR = /* @__PURE__ */ (() => {
-    const L = [Id160];
-    const R = [Pi160];
-    const res = [L, R];
-    for (let i = 0; i < 4; i++)
-        for (let j of res)
-            j.push(j[i].map((k) => Rho160[k]));
-    return res;
-})();
-const idxL = /* @__PURE__ */ (() => idxLR[0])();
-const idxR = /* @__PURE__ */ (() => idxLR[1])();
-// const [idxL, idxR] = idxLR;
-const shifts160 = /* @__PURE__ */ [
-    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
-    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
-    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
-    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
-    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],
-].map((i) => Uint8Array.from(i));
-const shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));
-const shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));
-const Kl160 = /* @__PURE__ */ Uint32Array.from([
-    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,
-]);
-const Kr160 = /* @__PURE__ */ Uint32Array.from([
-    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,
-]);
-// It's called f() in spec.
 function ripemd_f(group, x, y, z) {
-    if (group === 0)
-        return x ^ y ^ z;
-    if (group === 1)
-        return (x & y) | (~x & z);
-    if (group === 2)
-        return (x | ~y) ^ z;
-    if (group === 3)
-        return (x & z) | (y & ~z);
-    return x ^ (y | ~z);
-}
-// Reusable temporary buffer
-const BUF_160 = /* @__PURE__ */ new Uint32Array(16);
-class _RIPEMD160 extends HashMD {
-    h0 = 0x67452301 | 0;
-    h1 = 0xefcdab89 | 0;
-    h2 = 0x98badcfe | 0;
-    h3 = 0x10325476 | 0;
-    h4 = 0xc3d2e1f0 | 0;
-    constructor() {
-        super(64, 20, 8, true);
-    }
-    get() {
-        const { h0, h1, h2, h3, h4 } = this;
-        return [h0, h1, h2, h3, h4];
-    }
-    set(h0, h1, h2, h3, h4) {
-        this.h0 = h0 | 0;
-        this.h1 = h1 | 0;
-        this.h2 = h2 | 0;
-        this.h3 = h3 | 0;
-        this.h4 = h4 | 0;
-    }
-    process(view, offset) {
-        for (let i = 0; i < 16; i++, offset += 4)
-            BUF_160[i] = view.getUint32(offset, true);
-        // prettier-ignore
-        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;
-        // Instead of iterating 0 to 80, we split it into 5 groups
-        // And use the groups in constants, functions, etc. Much simpler
-        for (let group = 0; group < 5; group++) {
-            const rGroup = 4 - group;
-            const hbl = Kl160[group], hbr = Kr160[group]; // prettier-ignore
-            const rl = idxL[group], rr = idxR[group]; // prettier-ignore
-            const sl = shiftsL160[group], sr = shiftsR160[group]; // prettier-ignore
-            for (let i = 0; i < 16; i++) {
-                const tl = (rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el) | 0;
-                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore
-            }
-            // 2 loops are 10% faster
-            for (let i = 0; i < 16; i++) {
-                const tr = (rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er) | 0;
-                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore
-            }
-        }
-        // Add the compressed chunk to the current hash value
-        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);
-    }
-    roundClean() {
-        clean(BUF_160);
-    }
-    destroy() {
-        this.destroyed = true;
-        clean(this.buffer);
-        this.set(0, 0, 0, 0, 0);
-    }
+	if (group === 0) return x ^ y ^ z;
+	if (group === 1) return x & y | ~x & z;
+	if (group === 2) return (x | ~y) ^ z;
+	if (group === 3) return x & z | y & ~z;
+	return x ^ (y | ~z);
 }
-/**
- * RIPEMD-160 - a legacy hash function from 1990s.
- * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html
- * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf
- */
-const ripemd160 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());
-
-const legacy = /*#__PURE__*/Object.freeze(/*#__PURE__*/Object.defineProperty({
-    __proto__: null,
-    _MD5,
-    _RIPEMD160,
-    _SHA1,
-    md5,
-    ripemd160,
-    sha1
-}, Symbol.toStringTag, { value: 'Module' }));
-
-/**
- * HMAC: RFC2104 message authentication code.
- * @module
- */
-/** Internal class for HMAC. */
-class _HMAC {
-    oHash;
-    iHash;
-    blockLen;
-    outputLen;
-    finished = false;
-    destroyed = false;
-    constructor(hash, key) {
-        ahash(hash);
-        abytes(key, undefined, 'key');
-        this.iHash = hash.create();
-        if (typeof this.iHash.update !== 'function')
-            throw new Error('Expected instance of class which extends utils.Hash');
-        this.blockLen = this.iHash.blockLen;
-        this.outputLen = this.iHash.outputLen;
-        const blockLen = this.blockLen;
-        const pad = new Uint8Array(blockLen);
-        // blockLen can be bigger than outputLen
-        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
-        for (let i = 0; i < pad.length; i++)
-            pad[i] ^= 0x36;
-        this.iHash.update(pad);
-        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
-        this.oHash = hash.create();
-        // Undo internal XOR && apply outer XOR
-        for (let i = 0; i < pad.length; i++)
-            pad[i] ^= 0x36 ^ 0x5c;
-        this.oHash.update(pad);
-        clean(pad);
-    }
-    update(buf) {
-        aexists(this);
-        this.iHash.update(buf);
-        return this;
-    }
-    digestInto(out) {
-        aexists(this);
-        abytes(out, this.outputLen, 'output');
-        this.finished = true;
-        this.iHash.digestInto(out);
-        this.oHash.update(out);
-        this.oHash.digestInto(out);
-        this.destroy();
-    }
-    digest() {
-        const out = new Uint8Array(this.oHash.outputLen);
-        this.digestInto(out);
-        return out;
-    }
-    _cloneInto(to) {
-        // Create new instance without calling constructor since key already in state and we don't know it.
-        to ||= Object.create(Object.getPrototypeOf(this), {});
-        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-        to = to;
-        to.finished = finished;
-        to.destroyed = destroyed;
-        to.blockLen = blockLen;
-        to.outputLen = outputLen;
-        to.oHash = oHash._cloneInto(to.oHash);
-        to.iHash = iHash._cloneInto(to.iHash);
-        return to;
-    }
-    clone() {
-        return this._cloneInto();
-    }
-    destroy() {
-        this.destroyed = true;
-        this.oHash.destroy();
-        this.iHash.destroy();
-    }
-}
-/**
- * HMAC: RFC2104 message authentication code.
- * @param hash - function that would be used e.g. sha256
- * @param key - message key
- * @param message - message data
- * @example
- * import { hmac } from '@noble/hashes/hmac';
- * import { sha256 } from '@noble/hashes/sha2';
- * const mac1 = hmac(sha256, 'key', 'message');
- */
-const hmac$1 = (hash, key, message) => new _HMAC(hash, key).update(message).digest();
-hmac$1.create = (hash, key) => new _HMAC(hash, key);
-
-const hmac$2 = /*#__PURE__*/Object.freeze(/*#__PURE__*/Object.defineProperty({
-    __proto__: null,
-    _HMAC,
-    hmac: hmac$1
-}, Symbol.toStringTag, { value: 'Module' }));
-
-const require$$0 = /*@__PURE__*/getAugmentedNamespace(hmac$2);
-
-const require$$1 = /*@__PURE__*/getAugmentedNamespace(legacy);
-
-const require$$2 = /*@__PURE__*/getAugmentedNamespace(sha2$1);
-
-/**
- * SHA3 (keccak) hash function, based on a new "Sponge function" design.
- * Different from older hashes, the internal state is bigger than output size.
- *
- * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),
- * [Website](https://keccak.team/keccak.html),
- * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).
- *
- * Check out `sha3-addons` module for cSHAKE, k12, and others.
- * @module
- */
-// No __PURE__ annotations in sha3 header:
-// EVERYTHING is in fact used on every export.
-// Various per round constants calculations
-const _0n = BigInt(0);
-const _1n = BigInt(1);
-const _2n = BigInt(2);
-const _7n = BigInt(7);
-const _256n = BigInt(256);
-const _0x71n = BigInt(0x71);
-const SHA3_PI = [];
-const SHA3_ROTL = [];
-const _SHA3_IOTA = []; // no pure annotation: var is always used
-for (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {
-    // Pi
-    [x, y] = [y, (2 * x + 3 * y) % 5];
-    SHA3_PI.push(2 * (5 * y + x));
-    // Rotational
-    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);
-    // Iota
-    let t = _0n;
-    for (let j = 0; j < 7; j++) {
-        R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;
-        if (R & _2n)
-            t ^= _1n << ((_1n << BigInt(j)) - _1n);
-    }
-    _SHA3_IOTA.push(t);
-}
-const IOTAS = split(_SHA3_IOTA, true);
-const SHA3_IOTA_H = IOTAS[0];
-const SHA3_IOTA_L = IOTAS[1];
-// Left rotation (without 0, 32, 64)
-const rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));
-const rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));
+var SHA1_IV, SHA1_W, _SHA1, sha1, p32, K, MD5_IV, MD5_W, _MD5, md5, Rho160, Id160, Pi160, idxLR, idxL, idxR, shifts160, shiftsL160, shiftsR160, Kl160, Kr160, BUF_160, _RIPEMD160, ripemd160;
+var init_legacy = __esmMin((() => {
+	init__md();
+	init_utils();
+	SHA1_IV = /* @__PURE__ */ Uint32Array.from([
+		1732584193,
+		4023233417,
+		2562383102,
+		271733878,
+		3285377520
+	]);
+	SHA1_W = /* @__PURE__ */ new Uint32Array(80);
+	_SHA1 = class extends HashMD {
+		A = SHA1_IV[0] | 0;
+		B = SHA1_IV[1] | 0;
+		C = SHA1_IV[2] | 0;
+		D = SHA1_IV[3] | 0;
+		E = SHA1_IV[4] | 0;
+		constructor() {
+			super(64, 20, 8, false);
+		}
+		get() {
+			const { A, B, C, D, E } = this;
+			return [
+				A,
+				B,
+				C,
+				D,
+				E
+			];
+		}
+		set(A, B, C, D, E) {
+			this.A = A | 0;
+			this.B = B | 0;
+			this.C = C | 0;
+			this.D = D | 0;
+			this.E = E | 0;
+		}
+		process(view, offset) {
+			for (let i = 0; i < 16; i++, offset += 4) SHA1_W[i] = view.getUint32(offset, false);
+			for (let i = 16; i < 80; i++) SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);
+			let { A, B, C, D, E } = this;
+			for (let i = 0; i < 80; i++) {
+				let F, K;
+				if (i < 20) {
+					F = Chi(B, C, D);
+					K = 1518500249;
+				} else if (i < 40) {
+					F = B ^ C ^ D;
+					K = 1859775393;
+				} else if (i < 60) {
+					F = Maj(B, C, D);
+					K = 2400959708;
+				} else {
+					F = B ^ C ^ D;
+					K = 3395469782;
+				}
+				const T = rotl(A, 5) + F + E + K + SHA1_W[i] | 0;
+				E = D;
+				D = C;
+				C = rotl(B, 30);
+				B = A;
+				A = T;
+			}
+			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;
+			this.set(A, B, C, D, E);
+		}
+		roundClean() {
+			clean(SHA1_W);
+		}
+		destroy() {
+			this.set(0, 0, 0, 0, 0);
+			clean(this.buffer);
+		}
+	};
+	sha1 = /* @__PURE__ */ createHasher(() => new _SHA1());
+	p32 = /* @__PURE__ */ Math.pow(2, 32);
+	K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) => Math.floor(p32 * Math.abs(Math.sin(i + 1))));
+	MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);
+	MD5_W = /* @__PURE__ */ new Uint32Array(16);
+	_MD5 = class extends HashMD {
+		A = MD5_IV[0] | 0;
+		B = MD5_IV[1] | 0;
+		C = MD5_IV[2] | 0;
+		D = MD5_IV[3] | 0;
+		constructor() {
+			super(64, 16, 8, true);
+		}
+		get() {
+			const { A, B, C, D } = this;
+			return [
+				A,
+				B,
+				C,
+				D
+			];
+		}
+		set(A, B, C, D) {
+			this.A = A | 0;
+			this.B = B | 0;
+			this.C = C | 0;
+			this.D = D | 0;
+		}
+		process(view, offset) {
+			for (let i = 0; i < 16; i++, offset += 4) MD5_W[i] = view.getUint32(offset, true);
+			let { A, B, C, D } = this;
+			for (let i = 0; i < 64; i++) {
+				let F, g, s;
+				if (i < 16) {
+					F = Chi(B, C, D);
+					g = i;
+					s = [
+						7,
+						12,
+						17,
+						22
+					];
+				} else if (i < 32) {
+					F = Chi(D, B, C);
+					g = (5 * i + 1) % 16;
+					s = [
+						5,
+						9,
+						14,
+						20
+					];
+				} else if (i < 48) {
+					F = B ^ C ^ D;
+					g = (3 * i + 5) % 16;
+					s = [
+						4,
+						11,
+						16,
+						23
+					];
+				} else {
+					F = C ^ (B | ~D);
+					g = 7 * i % 16;
+					s = [
+						6,
+						10,
+						15,
+						21
+					];
+				}
+				F = F + A + K[i] + MD5_W[g];
+				A = D;
+				D = C;
+				C = B;
+				B = B + rotl(F, s[i % 4]);
+			}
+			A = A + this.A | 0;
+			B = B + this.B | 0;
+			C = C + this.C | 0;
+			D = D + this.D | 0;
+			this.set(A, B, C, D);
+		}
+		roundClean() {
+			clean(MD5_W);
+		}
+		destroy() {
+			this.set(0, 0, 0, 0);
+			clean(this.buffer);
+		}
+	};
+	md5 = /* @__PURE__ */ createHasher(() => new _MD5());
+	Rho160 = /* @__PURE__ */ Uint8Array.from([
+		7,
+		4,
+		13,
+		1,
+		10,
+		6,
+		15,
+		3,
+		12,
+		0,
+		9,
+		5,
+		2,
+		14,
+		11,
+		8
+	]);
+	Id160 = Uint8Array.from(new Array(16).fill(0).map((_, i) => i));
+	Pi160 = Id160.map((i) => (9 * i + 5) % 16);
+	idxLR = /* @__PURE__ */ (() => {
+		const res = [[Id160], [Pi160]];
+		for (let i = 0; i < 4; i++) for (let j of res) j.push(j[i].map((k) => Rho160[k]));
+		return res;
+	})();
+	idxL = idxLR[0];
+	idxR = idxLR[1];
+	shifts160 = /* @__PURE__ */ [
+		[
+			11,
+			14,
+			15,
+			12,
+			5,
+			8,
+			7,
+			9,
+			11,
+			13,
+			14,
+			15,
+			6,
+			7,
+			9,
+			8
+		],
+		[
+			12,
+			13,
+			11,
+			15,
+			6,
+			9,
+			9,
+			7,
+			12,
+			15,
+			11,
+			13,
+			7,
+			8,
+			7,
+			7
+		],
+		[
+			13,
+			15,
+			14,
+			11,
+			7,
+			7,
+			6,
+			8,
+			13,
+			14,
+			13,
+			12,
+			5,
+			5,
+			6,
+			9
+		],
+		[
+			14,
+			11,
+			12,
+			14,
+			8,
+			6,
+			5,
+			5,
+			15,
+			12,
+			15,
+			14,
+			9,
+			9,
+			8,
+			6
+		],
+		[
+			15,
+			12,
+			13,
+			13,
+			9,
+			5,
+			8,
+			6,
+			14,
+			11,
+			12,
+			11,
+			8,
+			6,
+			5,
+			5
+		]
+	].map((i) => Uint8Array.from(i));
+	shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));
+	shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));
+	Kl160 = /* @__PURE__ */ Uint32Array.from([
+		0,
+		1518500249,
+		1859775393,
+		2400959708,
+		2840853838
+	]);
+	Kr160 = /* @__PURE__ */ Uint32Array.from([
+		1352829926,
+		1548603684,
+		1836072691,
+		2053994217,
+		0
+	]);
+	BUF_160 = /* @__PURE__ */ new Uint32Array(16);
+	_RIPEMD160 = class extends HashMD {
+		h0 = 1732584193;
+		h1 = -271733879;
+		h2 = -1732584194;
+		h3 = 271733878;
+		h4 = -1009589776;
+		constructor() {
+			super(64, 20, 8, true);
+		}
+		get() {
+			const { h0, h1, h2, h3, h4 } = this;
+			return [
+				h0,
+				h1,
+				h2,
+				h3,
+				h4
+			];
+		}
+		set(h0, h1, h2, h3, h4) {
+			this.h0 = h0 | 0;
+			this.h1 = h1 | 0;
+			this.h2 = h2 | 0;
+			this.h3 = h3 | 0;
+			this.h4 = h4 | 0;
+		}
+		process(view, offset) {
+			for (let i = 0; i < 16; i++, offset += 4) BUF_160[i] = view.getUint32(offset, true);
+			let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;
+			for (let group = 0; group < 5; group++) {
+				const rGroup = 4 - group;
+				const hbl = Kl160[group], hbr = Kr160[group];
+				const rl = idxL[group], rr = idxR[group];
+				const sl = shiftsL160[group], sr = shiftsR160[group];
+				for (let i = 0; i < 16; i++) {
+					const tl = rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el | 0;
+					al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl;
+				}
+				for (let i = 0; i < 16; i++) {
+					const tr = rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er | 0;
+					ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr;
+				}
+			}
+			this.set(this.h1 + cl + dr | 0, this.h2 + dl + er | 0, this.h3 + el + ar | 0, this.h4 + al + br | 0, this.h0 + bl + cr | 0);
+		}
+		roundClean() {
+			clean(BUF_160);
+		}
+		destroy() {
+			this.destroyed = true;
+			clean(this.buffer);
+			this.set(0, 0, 0, 0, 0);
+		}
+	};
+	ripemd160 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());
+}));
+//#endregion
+//#region node_modules/@noble/hashes/sha3.js
 /** `keccakf1600` internal function, additionally allows to adjust round count. */
 function keccakP(s, rounds = 24) {
-    const B = new Uint32Array(5 * 2);
-    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)
-    for (let round = 24 - rounds; round < 24; round++) {
-        // Theta θ
-        for (let x = 0; x < 10; x++)
-            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];
-        for (let x = 0; x < 10; x += 2) {
-            const idx1 = (x + 8) % 10;
-            const idx0 = (x + 2) % 10;
-            const B0 = B[idx0];
-            const B1 = B[idx0 + 1];
-            const Th = rotlH(B0, B1, 1) ^ B[idx1];
-            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];
-            for (let y = 0; y < 50; y += 10) {
-                s[x + y] ^= Th;
-                s[x + y + 1] ^= Tl;
-            }
-        }
-        // Rho (ρ) and Pi (π)
-        let curH = s[2];
-        let curL = s[3];
-        for (let t = 0; t < 24; t++) {
-            const shift = SHA3_ROTL[t];
-            const Th = rotlH(curH, curL, shift);
-            const Tl = rotlL(curH, curL, shift);
-            const PI = SHA3_PI[t];
-            curH = s[PI];
-            curL = s[PI + 1];
-            s[PI] = Th;
-            s[PI + 1] = Tl;
-        }
-        // Chi (χ)
-        for (let y = 0; y < 50; y += 10) {
-            for (let x = 0; x < 10; x++)
-                B[x] = s[y + x];
-            for (let x = 0; x < 10; x++)
-                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];
-        }
-        // Iota (ι)
-        s[0] ^= SHA3_IOTA_H[round];
-        s[1] ^= SHA3_IOTA_L[round];
-    }
-    clean(B);
-}
-/** Keccak sponge function. */
-class Keccak {
-    state;
-    pos = 0;
-    posOut = 0;
-    finished = false;
-    state32;
-    destroyed = false;
-    blockLen;
-    suffix;
-    outputLen;
-    enableXOF = false;
-    rounds;
-    // NOTE: we accept arguments in bytes instead of bits here.
-    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {
-        this.blockLen = blockLen;
-        this.suffix = suffix;
-        this.outputLen = outputLen;
-        this.enableXOF = enableXOF;
-        this.rounds = rounds;
-        // Can be passed from user as dkLen
-        anumber(outputLen, 'outputLen');
-        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes
-        // 0 < blockLen < 200
-        if (!(0 < blockLen && blockLen < 200))
-            throw new Error('only keccak-f1600 function is supported');
-        this.state = new Uint8Array(200);
-        this.state32 = u32(this.state);
-    }
-    clone() {
-        return this._cloneInto();
-    }
-    keccak() {
-        swap32IfBE(this.state32);
-        keccakP(this.state32, this.rounds);
-        swap32IfBE(this.state32);
-        this.posOut = 0;
-        this.pos = 0;
-    }
-    update(data) {
-        aexists(this);
-        abytes(data);
-        const { blockLen, state } = this;
-        const len = data.length;
-        for (let pos = 0; pos < len;) {
-            const take = Math.min(blockLen - this.pos, len - pos);
-            for (let i = 0; i < take; i++)
-                state[this.pos++] ^= data[pos++];
-            if (this.pos === blockLen)
-                this.keccak();
-        }
-        return this;
-    }
-    finish() {
-        if (this.finished)
-            return;
-        this.finished = true;
-        const { state, suffix, pos, blockLen } = this;
-        // Do the padding
-        state[pos] ^= suffix;
-        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)
-            this.keccak();
-        state[blockLen - 1] ^= 0x80;
-        this.keccak();
-    }
-    writeInto(out) {
-        aexists(this, false);
-        abytes(out);
-        this.finish();
-        const bufferOut = this.state;
-        const { blockLen } = this;
-        for (let pos = 0, len = out.length; pos < len;) {
-            if (this.posOut >= blockLen)
-                this.keccak();
-            const take = Math.min(blockLen - this.posOut, len - pos);
-            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);
-            this.posOut += take;
-            pos += take;
-        }
-        return out;
-    }
-    xofInto(out) {
-        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF
-        if (!this.enableXOF)
-            throw new Error('XOF is not possible for this instance');
-        return this.writeInto(out);
-    }
-    xof(bytes) {
-        anumber(bytes);
-        return this.xofInto(new Uint8Array(bytes));
-    }
-    digestInto(out) {
-        aoutput(out, this);
-        if (this.finished)
-            throw new Error('digest() was already called');
-        this.writeInto(out);
-        this.destroy();
-        return out;
-    }
-    digest() {
-        return this.digestInto(new Uint8Array(this.outputLen));
-    }
-    destroy() {
-        this.destroyed = true;
-        clean(this.state);
-    }
-    _cloneInto(to) {
-        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
-        to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);
-        to.state32.set(this.state32);
-        to.pos = this.pos;
-        to.posOut = this.posOut;
-        to.finished = this.finished;
-        to.rounds = rounds;
-        // Suffix can change in cSHAKE
-        to.suffix = suffix;
-        to.outputLen = outputLen;
-        to.enableXOF = enableXOF;
-        to.destroyed = this.destroyed;
-        return to;
-    }
-}
-const genShake = (suffix, blockLen, outputLen, info = {}) => createHasher((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true), info);
-/** SHAKE128 XOF with 128-bit security. */
-const shake128 = 
-/* @__PURE__ */
-genShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));
-/** SHAKE256 XOF with 256-bit security. */
-const shake256 = 
-/* @__PURE__ */
-genShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));
-
-var sha256 = {};
-
-var sha2 = {};
-
-var _md = {};
-
-var utils = {};
-
-var crypto = {};
-
-var hasRequiredCrypto;
-
-function requireCrypto () {
-	if (hasRequiredCrypto) return crypto;
-	hasRequiredCrypto = 1;
-	Object.defineProperty(crypto, "__esModule", { value: true });
-	crypto.crypto = void 0;
-	crypto.crypto = typeof globalThis === "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-	return crypto;
-}
-
-var hasRequiredUtils;
-
-function requireUtils () {
-	if (hasRequiredUtils) return utils;
-	hasRequiredUtils = 1;
-	(function (exports$1) {
-		/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-		Object.defineProperty(exports$1, "__esModule", { value: true });
-		exports$1.wrapXOFConstructorWithOpts = exports$1.wrapConstructorWithOpts = exports$1.wrapConstructor = exports$1.Hash = exports$1.nextTick = exports$1.swap32IfBE = exports$1.byteSwapIfBE = exports$1.swap8IfBE = exports$1.isLE = void 0;
-		exports$1.isBytes = isBytes;
-		exports$1.anumber = anumber;
-		exports$1.abytes = abytes;
-		exports$1.ahash = ahash;
-		exports$1.aexists = aexists;
-		exports$1.aoutput = aoutput;
-		exports$1.u8 = u8;
-		exports$1.u32 = u32;
-		exports$1.clean = clean;
-		exports$1.createView = createView;
-		exports$1.rotr = rotr;
-		exports$1.rotl = rotl;
-		exports$1.byteSwap = byteSwap;
-		exports$1.byteSwap32 = byteSwap32;
-		exports$1.bytesToHex = bytesToHex;
-		exports$1.hexToBytes = hexToBytes;
-		exports$1.asyncLoop = asyncLoop;
-		exports$1.utf8ToBytes = utf8ToBytes;
-		exports$1.bytesToUtf8 = bytesToUtf8;
-		exports$1.toBytes = toBytes;
-		exports$1.kdfInputToBytes = kdfInputToBytes;
-		exports$1.concatBytes = concatBytes;
-		exports$1.checkOpts = checkOpts;
-		exports$1.createHasher = createHasher;
-		exports$1.createOptHasher = createOptHasher;
-		exports$1.createXOFer = createXOFer;
-		exports$1.randomBytes = randomBytes;
-		const crypto_1 = /*@__PURE__*/ requireCrypto();
-		function isBytes(a) {
-		  return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
-		}
-		function anumber(n) {
-		  if (!Number.isSafeInteger(n) || n < 0)
-		    throw new Error("positive integer expected, got " + n);
-		}
-		function abytes(b, ...lengths) {
-		  if (!isBytes(b))
-		    throw new Error("Uint8Array expected");
-		  if (lengths.length > 0 && !lengths.includes(b.length))
-		    throw new Error("Uint8Array expected of length " + lengths + ", got length=" + b.length);
-		}
-		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);
-		}
-		function aexists(instance, checkFinished = 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");
-		}
-		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);
-		  }
-		}
-		function u8(arr) {
-		  return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);
-		}
-		function u32(arr) {
-		  return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
-		}
-		function clean(...arrays) {
-		  for (let i = 0; i < arrays.length; i++) {
-		    arrays[i].fill(0);
-		  }
-		}
-		function createView(arr) {
-		  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-		}
-		function rotr(word, shift) {
-		  return word << 32 - shift | word >>> shift;
-		}
-		function rotl(word, shift) {
-		  return word << shift | word >>> 32 - shift >>> 0;
-		}
-		exports$1.isLE = (() => new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68)();
-		function byteSwap(word) {
-		  return word << 24 & 4278190080 | word << 8 & 16711680 | word >>> 8 & 65280 | word >>> 24 & 255;
-		}
-		exports$1.swap8IfBE = exports$1.isLE ? (n) => n : (n) => byteSwap(n);
-		exports$1.byteSwapIfBE = exports$1.swap8IfBE;
-		function byteSwap32(arr) {
-		  for (let i = 0; i < arr.length; i++) {
-		    arr[i] = byteSwap(arr[i]);
-		  }
-		  return arr;
-		}
-		exports$1.swap32IfBE = exports$1.isLE ? (u) => u : byteSwap32;
-		const hasHexBuiltin = /* @__PURE__ */ (() => (
-		  // @ts-ignore
-		  typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function"
-		))();
-		const hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
-		function bytesToHex(bytes) {
-		  abytes(bytes);
-		  if (hasHexBuiltin)
-		    return bytes.toHex();
-		  let hex = "";
-		  for (let i = 0; i < bytes.length; i++) {
-		    hex += hexes[bytes[i]];
-		  }
-		  return hex;
-		}
-		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;
-		  if (ch >= asciis.A && ch <= asciis.F)
-		    return ch - (asciis.A - 10);
-		  if (ch >= asciis.a && ch <= asciis.f)
-		    return ch - (asciis.a - 10);
-		  return;
-		}
-		function hexToBytes(hex) {
-		  if (typeof hex !== "string")
-		    throw new Error("hex string expected, got " + typeof hex);
-		  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 === void 0 || n2 === void 0) {
-		      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;
-		  }
-		  return array;
-		}
-		const nextTick = async () => {
-		};
-		exports$1.nextTick = nextTick;
-		async function asyncLoop(iters, tick, cb) {
-		  let ts = Date.now();
-		  for (let i = 0; i < iters; i++) {
-		    cb(i);
-		    const diff = Date.now() - ts;
-		    if (diff >= 0 && diff < tick)
-		      continue;
-		    await (0, exports$1.nextTick)();
-		    ts += diff;
-		  }
-		}
-		function utf8ToBytes(str) {
-		  if (typeof str !== "string")
-		    throw new Error("string expected");
-		  return new Uint8Array(new TextEncoder().encode(str));
-		}
-		function bytesToUtf8(bytes) {
-		  return new TextDecoder().decode(bytes);
-		}
-		function toBytes(data) {
-		  if (typeof data === "string")
-		    data = utf8ToBytes(data);
-		  abytes(data);
-		  return data;
-		}
-		function kdfInputToBytes(data) {
-		  if (typeof data === "string")
-		    data = utf8ToBytes(data);
-		  abytes(data);
-		  return data;
-		}
-		function concatBytes(...arrays) {
-		  let sum = 0;
-		  for (let i = 0; i < arrays.length; i++) {
-		    const a = arrays[i];
-		    abytes(a);
-		    sum += a.length;
-		  }
-		  const res = new Uint8Array(sum);
-		  for (let i = 0, pad = 0; i < arrays.length; i++) {
-		    const a = arrays[i];
-		    res.set(a, pad);
-		    pad += a.length;
-		  }
-		  return res;
-		}
-		function checkOpts(defaults, opts) {
-		  if (opts !== void 0 && {}.toString.call(opts) !== "[object Object]")
-		    throw new Error("options should be object or undefined");
-		  const merged = Object.assign(defaults, opts);
-		  return merged;
-		}
-		class Hash {
-		}
-		exports$1.Hash = Hash;
-		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;
-		}
-		function createOptHasher(hashCons) {
-		  const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();
-		  const tmp = hashCons({});
-		  hashC.outputLen = tmp.outputLen;
-		  hashC.blockLen = tmp.blockLen;
-		  hashC.create = (opts) => hashCons(opts);
-		  return hashC;
-		}
-		function createXOFer(hashCons) {
-		  const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();
-		  const tmp = hashCons({});
-		  hashC.outputLen = tmp.outputLen;
-		  hashC.blockLen = tmp.blockLen;
-		  hashC.create = (opts) => hashCons(opts);
-		  return hashC;
-		}
-		exports$1.wrapConstructor = createHasher;
-		exports$1.wrapConstructorWithOpts = createOptHasher;
-		exports$1.wrapXOFConstructorWithOpts = createXOFer;
-		function randomBytes(bytesLength = 32) {
-		  if (crypto_1.crypto && typeof crypto_1.crypto.getRandomValues === "function") {
-		    return crypto_1.crypto.getRandomValues(new Uint8Array(bytesLength));
-		  }
-		  if (crypto_1.crypto && typeof crypto_1.crypto.randomBytes === "function") {
-		    return Uint8Array.from(crypto_1.crypto.randomBytes(bytesLength));
-		  }
-		  throw new Error("crypto.getRandomValues must be defined");
-		} 
-	} (utils));
-	return utils;
+	const B = new Uint32Array(10);
+	for (let round = 24 - rounds; round < 24; round++) {
+		for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];
+		for (let x = 0; x < 10; x += 2) {
+			const idx1 = (x + 8) % 10;
+			const idx0 = (x + 2) % 10;
+			const B0 = B[idx0];
+			const B1 = B[idx0 + 1];
+			const Th = rotlH(B0, B1, 1) ^ B[idx1];
+			const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];
+			for (let y = 0; y < 50; y += 10) {
+				s[x + y] ^= Th;
+				s[x + y + 1] ^= Tl;
+			}
+		}
+		let curH = s[2];
+		let curL = s[3];
+		for (let t = 0; t < 24; t++) {
+			const shift = SHA3_ROTL[t];
+			const Th = rotlH(curH, curL, shift);
+			const Tl = rotlL(curH, curL, shift);
+			const PI = SHA3_PI[t];
+			curH = s[PI];
+			curL = s[PI + 1];
+			s[PI] = Th;
+			s[PI + 1] = Tl;
+		}
+		for (let y = 0; y < 50; y += 10) {
+			for (let x = 0; x < 10; x++) B[x] = s[y + x];
+			for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];
+		}
+		s[0] ^= SHA3_IOTA_H[round];
+		s[1] ^= SHA3_IOTA_L[round];
+	}
+	clean(B);
 }
-
-var hasRequired_md;
-
-function require_md () {
-	if (hasRequired_md) return _md;
-	hasRequired_md = 1;
-	Object.defineProperty(_md, "__esModule", { value: true });
-	_md.SHA512_IV = _md.SHA384_IV = _md.SHA224_IV = _md.SHA256_IV = _md.HashMD = void 0;
-	_md.setBigUint64 = setBigUint64;
-	_md.Chi = Chi;
-	_md.Maj = Maj;
+var _0n, _1n, _2n, _7n, _256n, _0x71n, SHA3_PI, SHA3_ROTL, _SHA3_IOTA, IOTAS, SHA3_IOTA_H, SHA3_IOTA_L, rotlH, rotlL, Keccak, genShake, shake128, shake256;
+var init_sha3 = __esmMin((() => {
+	init__u64();
+	init_utils();
+	_0n = BigInt(0);
+	_1n = BigInt(1);
+	_2n = BigInt(2);
+	_7n = BigInt(7);
+	_256n = BigInt(256);
+	_0x71n = BigInt(113);
+	SHA3_PI = [];
+	SHA3_ROTL = [];
+	_SHA3_IOTA = [];
+	for (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {
+		[x, y] = [y, (2 * x + 3 * y) % 5];
+		SHA3_PI.push(2 * (5 * y + x));
+		SHA3_ROTL.push((round + 1) * (round + 2) / 2 % 64);
+		let t = _0n;
+		for (let j = 0; j < 7; j++) {
+			R = (R << _1n ^ (R >> _7n) * _0x71n) % _256n;
+			if (R & _2n) t ^= _1n << (_1n << BigInt(j)) - _1n;
+		}
+		_SHA3_IOTA.push(t);
+	}
+	IOTAS = split(_SHA3_IOTA, true);
+	SHA3_IOTA_H = IOTAS[0];
+	SHA3_IOTA_L = IOTAS[1];
+	rotlH = (h, l, s) => s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s);
+	rotlL = (h, l, s) => s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s);
+	Keccak = class Keccak {
+		state;
+		pos = 0;
+		posOut = 0;
+		finished = false;
+		state32;
+		destroyed = false;
+		blockLen;
+		suffix;
+		outputLen;
+		enableXOF = false;
+		rounds;
+		constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {
+			this.blockLen = blockLen;
+			this.suffix = suffix;
+			this.outputLen = outputLen;
+			this.enableXOF = enableXOF;
+			this.rounds = rounds;
+			anumber(outputLen, "outputLen");
+			if (!(0 < blockLen && blockLen < 200)) throw new Error("only keccak-f1600 function is supported");
+			this.state = new Uint8Array(200);
+			this.state32 = u32(this.state);
+		}
+		clone() {
+			return this._cloneInto();
+		}
+		keccak() {
+			swap32IfBE(this.state32);
+			keccakP(this.state32, this.rounds);
+			swap32IfBE(this.state32);
+			this.posOut = 0;
+			this.pos = 0;
+		}
+		update(data) {
+			aexists(this);
+			abytes(data);
+			const { blockLen, state } = this;
+			const len = data.length;
+			for (let pos = 0; pos < len;) {
+				const take = Math.min(blockLen - this.pos, len - pos);
+				for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];
+				if (this.pos === blockLen) this.keccak();
+			}
+			return this;
+		}
+		finish() {
+			if (this.finished) return;
+			this.finished = true;
+			const { state, suffix, pos, blockLen } = this;
+			state[pos] ^= suffix;
+			if ((suffix & 128) !== 0 && pos === blockLen - 1) this.keccak();
+			state[blockLen - 1] ^= 128;
+			this.keccak();
+		}
+		writeInto(out) {
+			aexists(this, false);
+			abytes(out);
+			this.finish();
+			const bufferOut = this.state;
+			const { blockLen } = this;
+			for (let pos = 0, len = out.length; pos < len;) {
+				if (this.posOut >= blockLen) this.keccak();
+				const take = Math.min(blockLen - this.posOut, len - pos);
+				out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);
+				this.posOut += take;
+				pos += take;
+			}
+			return out;
+		}
+		xofInto(out) {
+			if (!this.enableXOF) throw new Error("XOF is not possible for this instance");
+			return this.writeInto(out);
+		}
+		xof(bytes) {
+			anumber(bytes);
+			return this.xofInto(new Uint8Array(bytes));
+		}
+		digestInto(out) {
+			aoutput(out, this);
+			if (this.finished) throw new Error("digest() was already called");
+			this.writeInto(out);
+			this.destroy();
+			return out;
+		}
+		digest() {
+			return this.digestInto(new Uint8Array(this.outputLen));
+		}
+		destroy() {
+			this.destroyed = true;
+			clean(this.state);
+		}
+		_cloneInto(to) {
+			const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
+			to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);
+			to.state32.set(this.state32);
+			to.pos = this.pos;
+			to.posOut = this.posOut;
+			to.finished = this.finished;
+			to.rounds = rounds;
+			to.suffix = suffix;
+			to.outputLen = outputLen;
+			to.enableXOF = enableXOF;
+			to.destroyed = this.destroyed;
+			return to;
+		}
+	};
+	genShake = (suffix, blockLen, outputLen, info = {}) => createHasher((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === void 0 ? outputLen : opts.dkLen, true), info);
+	shake128 = /* @__PURE__ */ genShake(31, 168, 16, /* @__PURE__ */ oidNist(11));
+	shake256 = /* @__PURE__ */ genShake(31, 136, 32, /* @__PURE__ */ oidNist(12));
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/crypto.js
+var require_crypto = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.crypto = void 0;
+	exports.crypto = typeof globalThis === "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/utils.js
+var require_utils = /* @__PURE__ */ __commonJSMin(((exports) => {
 	/**
-	 * Internal Merkle-Damgard hash utils.
-	 * @module
-	 */
-	const utils_ts_1 = /*@__PURE__*/ requireUtils();
+	* Utilities for hex, bytes, CSPRNG.
+	* @module
+	*/
+	/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.wrapXOFConstructorWithOpts = exports.wrapConstructorWithOpts = exports.wrapConstructor = exports.Hash = exports.nextTick = exports.swap32IfBE = exports.byteSwapIfBE = exports.swap8IfBE = exports.isLE = void 0;
+	exports.isBytes = isBytes;
+	exports.anumber = anumber;
+	exports.abytes = abytes;
+	exports.ahash = ahash;
+	exports.aexists = aexists;
+	exports.aoutput = aoutput;
+	exports.u8 = u8;
+	exports.u32 = u32;
+	exports.clean = clean;
+	exports.createView = createView;
+	exports.rotr = rotr;
+	exports.rotl = rotl;
+	exports.byteSwap = byteSwap;
+	exports.byteSwap32 = byteSwap32;
+	exports.bytesToHex = bytesToHex;
+	exports.hexToBytes = hexToBytes;
+	exports.asyncLoop = asyncLoop;
+	exports.utf8ToBytes = utf8ToBytes;
+	exports.bytesToUtf8 = bytesToUtf8;
+	exports.toBytes = toBytes;
+	exports.kdfInputToBytes = kdfInputToBytes;
+	exports.concatBytes = concatBytes;
+	exports.checkOpts = checkOpts;
+	exports.createHasher = createHasher;
+	exports.createOptHasher = createOptHasher;
+	exports.createXOFer = createXOFer;
+	exports.randomBytes = randomBytes;
+	var crypto_1 = require_crypto();
+	/** 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, ...lengths) {
+		if (!isBytes(b)) throw new Error("Uint8Array expected");
+		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, checkFinished = 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);
+	}
+	/** Cast u8 / u16 / u32 to u8. */
+	function u8(arr) {
+		return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);
+	}
+	/** Cast u8 / u16 / u32 to u32. */
+	function u32(arr) {
+		return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
+	}
+	/** Zeroize a byte array. Warning: JS provides no guarantees. */
+	function clean(...arrays) {
+		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;
+	}
+	/** The rotate left (circular left shift) operation for uint32 */
+	function rotl(word, shift) {
+		return word << shift | word >>> 32 - shift >>> 0;
+	}
+	/** Is current platform little-endian? Most are. Big-Endian platform: IBM */
+	exports.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+	/** The byte swap operation for uint32 */
+	function byteSwap(word) {
+		return word << 24 & 4278190080 | word << 8 & 16711680 | word >>> 8 & 65280 | word >>> 24 & 255;
+	}
+	/** Conditionally byte swap if on a big-endian platform */
+	exports.swap8IfBE = exports.isLE ? (n) => n : (n) => byteSwap(n);
+	/** @deprecated */
+	exports.byteSwapIfBE = exports.swap8IfBE;
+	/** In place byte swap for Uint32Array */
+	function byteSwap32(arr) {
+		for (let i = 0; i < arr.length; i++) arr[i] = byteSwap(arr[i]);
+		return arr;
+	}
+	exports.swap32IfBE = exports.isLE ? (u) => u : byteSwap32;
+	var hasHexBuiltin = typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function";
+	var 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);
+		if (hasHexBuiltin) return bytes.toHex();
+		let hex = "";
+		for (let i = 0; i < bytes.length; i++) hex += hexes[bytes[i]];
+		return hex;
+	}
+	var 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;
+		if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10);
+		if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10);
+	}
+	/**
+	* 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);
+		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 === void 0 || n2 === void 0) {
+				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;
+		}
+		return array;
+	}
+	/**
+	* There is no setImmediate in browser and setTimeout is slow.
+	* Call of async fn will return Promise, which will be fullfiled only on
+	* next scheduler queue processing step and this is exactly what we need.
+	*/
+	var nextTick = async () => {};
+	exports.nextTick = nextTick;
+	/** Returns control to thread each 'tick' ms to avoid blocking. */
+	async function asyncLoop(iters, tick, cb) {
+		let ts = Date.now();
+		for (let i = 0; i < iters; i++) {
+			cb(i);
+			const diff = Date.now() - ts;
+			if (diff >= 0 && diff < tick) continue;
+			await (0, exports.nextTick)();
+			ts += diff;
+		}
+	}
+	/**
+	* 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));
+	}
+	/**
+	* Converts bytes to string using UTF8 encoding.
+	* @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'
+	*/
+	function bytesToUtf8(bytes) {
+		return new TextDecoder().decode(bytes);
+	}
+	/**
+	* 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;
+	}
+	/**
+	* Helper for KDFs: consumes uint8array or string.
+	* When string is passed, does utf8 decoding, using TextDecoder.
+	*/
+	function kdfInputToBytes(data) {
+		if (typeof data === "string") data = utf8ToBytes(data);
+		abytes(data);
+		return data;
+	}
+	/** Copies several Uint8Arrays into one. */
+	function concatBytes(...arrays) {
+		let sum = 0;
+		for (let i = 0; i < arrays.length; i++) {
+			const a = arrays[i];
+			abytes(a);
+			sum += a.length;
+		}
+		const res = new Uint8Array(sum);
+		for (let i = 0, pad = 0; i < arrays.length; i++) {
+			const a = arrays[i];
+			res.set(a, pad);
+			pad += a.length;
+		}
+		return res;
+	}
+	function checkOpts(defaults, opts) {
+		if (opts !== void 0 && {}.toString.call(opts) !== "[object Object]") throw new Error("options should be object or undefined");
+		return Object.assign(defaults, opts);
+	}
+	/** For runtime check if class implements interface */
+	var Hash = class {};
+	exports.Hash = 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;
+	}
+	function createOptHasher(hashCons) {
+		const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();
+		const tmp = hashCons({});
+		hashC.outputLen = tmp.outputLen;
+		hashC.blockLen = tmp.blockLen;
+		hashC.create = (opts) => hashCons(opts);
+		return hashC;
+	}
+	function createXOFer(hashCons) {
+		const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();
+		const tmp = hashCons({});
+		hashC.outputLen = tmp.outputLen;
+		hashC.blockLen = tmp.blockLen;
+		hashC.create = (opts) => hashCons(opts);
+		return hashC;
+	}
+	exports.wrapConstructor = createHasher;
+	exports.wrapConstructorWithOpts = createOptHasher;
+	exports.wrapXOFConstructorWithOpts = createXOFer;
+	/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */
+	function randomBytes(bytesLength = 32) {
+		if (crypto_1.crypto && typeof crypto_1.crypto.getRandomValues === "function") return crypto_1.crypto.getRandomValues(new Uint8Array(bytesLength));
+		if (crypto_1.crypto && typeof crypto_1.crypto.randomBytes === "function") return Uint8Array.from(crypto_1.crypto.randomBytes(bytesLength));
+		throw new Error("crypto.getRandomValues must be defined");
+	}
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/_md.js
+var require__md = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.SHA512_IV = exports.SHA384_IV = exports.SHA224_IV = exports.SHA256_IV = exports.HashMD = void 0;
+	exports.setBigUint64 = setBigUint64;
+	exports.Chi = Chi;
+	exports.Maj = Maj;
+	/**
+	* Internal Merkle-Damgard hash utils.
+	* @module
+	*/
+	var utils_ts_1 = require_utils();
 	/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */
 	function setBigUint64(view, byteOffset, value, isLE) {
-	    if (typeof view.setBigUint64 === 'function')
-	        return view.setBigUint64(byteOffset, value, isLE);
-	    const _32n = BigInt(32);
-	    const _u32_max = BigInt(0xffffffff);
-	    const wh = Number((value >> _32n) & _u32_max);
-	    const wl = Number(value & _u32_max);
-	    const h = isLE ? 4 : 0;
-	    const l = isLE ? 0 : 4;
-	    view.setUint32(byteOffset + h, wh, isLE);
-	    view.setUint32(byteOffset + l, wl, isLE);
+		if (typeof view.setBigUint64 === "function") return view.setBigUint64(byteOffset, value, isLE);
+		const _32n = BigInt(32);
+		const _u32_max = BigInt(4294967295);
+		const wh = Number(value >> _32n & _u32_max);
+		const wl = Number(value & _u32_max);
+		const h = isLE ? 4 : 0;
+		const l = isLE ? 0 : 4;
+		view.setUint32(byteOffset + h, wh, isLE);
+		view.setUint32(byteOffset + l, wl, isLE);
 	}
 	/** Choice: a ? b : c */
 	function Chi(a, b, c) {
-	    return (a & b) ^ (~a & c);
+		return a & b ^ ~a & c;
 	}
 	/** Majority function, true if any two inputs is true. */
 	function Maj(a, b, c) {
-	    return (a & b) ^ (a & c) ^ (b & c);
+		return a & b ^ a & c ^ b & c;
 	}
 	/**
-	 * Merkle-Damgard hash construction base class.
-	 * Could be used to create MD5, RIPEMD, SHA1, SHA2.
-	 */
-	class HashMD extends utils_ts_1.Hash {
-	    constructor(blockLen, outputLen, padOffset, isLE) {
-	        super();
-	        this.finished = false;
-	        this.length = 0;
-	        this.pos = 0;
-	        this.destroyed = false;
-	        this.blockLen = blockLen;
-	        this.outputLen = outputLen;
-	        this.padOffset = padOffset;
-	        this.isLE = isLE;
-	        this.buffer = new Uint8Array(blockLen);
-	        this.view = (0, utils_ts_1.createView)(this.buffer);
-	    }
-	    update(data) {
-	        (0, utils_ts_1.aexists)(this);
-	        data = (0, utils_ts_1.toBytes)(data);
-	        (0, utils_ts_1.abytes)(data);
-	        const { view, buffer, blockLen } = this;
-	        const len = data.length;
-	        for (let pos = 0; pos < len;) {
-	            const take = Math.min(blockLen - this.pos, len - pos);
-	            // Fast path: we have at least one block in input, cast it to view and process
-	            if (take === blockLen) {
-	                const dataView = (0, utils_ts_1.createView)(data);
-	                for (; blockLen <= len - pos; pos += blockLen)
-	                    this.process(dataView, pos);
-	                continue;
-	            }
-	            buffer.set(data.subarray(pos, pos + take), this.pos);
-	            this.pos += take;
-	            pos += take;
-	            if (this.pos === blockLen) {
-	                this.process(view, 0);
-	                this.pos = 0;
-	            }
-	        }
-	        this.length += data.length;
-	        this.roundClean();
-	        return this;
-	    }
-	    digestInto(out) {
-	        (0, utils_ts_1.aexists)(this);
-	        (0, utils_ts_1.aoutput)(out, this);
-	        this.finished = true;
-	        // Padding
-	        // We can avoid allocation of buffer for padding completely if it
-	        // was previously not allocated here. But it won't change performance.
-	        const { buffer, view, blockLen, isLE } = this;
-	        let { pos } = this;
-	        // append the bit '1' to the message
-	        buffer[pos++] = 0b10000000;
-	        (0, utils_ts_1.clean)(this.buffer.subarray(pos));
-	        // we have less than padOffset left in buffer, so we cannot put length in
-	        // current block, need process it and pad again
-	        if (this.padOffset > blockLen - pos) {
-	            this.process(view, 0);
-	            pos = 0;
-	        }
-	        // Pad until full block byte with zeros
-	        for (let i = pos; i < blockLen; i++)
-	            buffer[i] = 0;
-	        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
-	        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
-	        // So we just write lowest 64 bits of that value.
-	        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
-	        this.process(view, 0);
-	        const oview = (0, utils_ts_1.createView)(out);
-	        const len = this.outputLen;
-	        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT
-	        if (len % 4)
-	            throw new Error('_sha2: outputLen should be aligned to 32bit');
-	        const outLen = len / 4;
-	        const state = this.get();
-	        if (outLen > state.length)
-	            throw new Error('_sha2: outputLen bigger than state');
-	        for (let i = 0; i < outLen; i++)
-	            oview.setUint32(4 * i, state[i], isLE);
-	    }
-	    digest() {
-	        const { buffer, outputLen } = this;
-	        this.digestInto(buffer);
-	        const res = buffer.slice(0, outputLen);
-	        this.destroy();
-	        return res;
-	    }
-	    _cloneInto(to) {
-	        to || (to = new this.constructor());
-	        to.set(...this.get());
-	        const { blockLen, buffer, length, finished, destroyed, pos } = this;
-	        to.destroyed = destroyed;
-	        to.finished = finished;
-	        to.length = length;
-	        to.pos = pos;
-	        if (length % blockLen)
-	            to.buffer.set(buffer);
-	        return to;
-	    }
-	    clone() {
-	        return this._cloneInto();
-	    }
-	}
-	_md.HashMD = HashMD;
+	* Merkle-Damgard hash construction base class.
+	* Could be used to create MD5, RIPEMD, SHA1, SHA2.
+	*/
+	var HashMD = class extends utils_ts_1.Hash {
+		constructor(blockLen, outputLen, padOffset, isLE) {
+			super();
+			this.finished = false;
+			this.length = 0;
+			this.pos = 0;
+			this.destroyed = false;
+			this.blockLen = blockLen;
+			this.outputLen = outputLen;
+			this.padOffset = padOffset;
+			this.isLE = isLE;
+			this.buffer = new Uint8Array(blockLen);
+			this.view = (0, utils_ts_1.createView)(this.buffer);
+		}
+		update(data) {
+			(0, utils_ts_1.aexists)(this);
+			data = (0, utils_ts_1.toBytes)(data);
+			(0, utils_ts_1.abytes)(data);
+			const { view, buffer, blockLen } = this;
+			const len = data.length;
+			for (let pos = 0; pos < len;) {
+				const take = Math.min(blockLen - this.pos, len - pos);
+				if (take === blockLen) {
+					const dataView = (0, utils_ts_1.createView)(data);
+					for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);
+					continue;
+				}
+				buffer.set(data.subarray(pos, pos + take), this.pos);
+				this.pos += take;
+				pos += take;
+				if (this.pos === blockLen) {
+					this.process(view, 0);
+					this.pos = 0;
+				}
+			}
+			this.length += data.length;
+			this.roundClean();
+			return this;
+		}
+		digestInto(out) {
+			(0, utils_ts_1.aexists)(this);
+			(0, utils_ts_1.aoutput)(out, this);
+			this.finished = true;
+			const { buffer, view, blockLen, isLE } = this;
+			let { pos } = this;
+			buffer[pos++] = 128;
+			(0, utils_ts_1.clean)(this.buffer.subarray(pos));
+			if (this.padOffset > blockLen - pos) {
+				this.process(view, 0);
+				pos = 0;
+			}
+			for (let i = pos; i < blockLen; i++) buffer[i] = 0;
+			setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
+			this.process(view, 0);
+			const oview = (0, utils_ts_1.createView)(out);
+			const len = this.outputLen;
+			if (len % 4) throw new Error("_sha2: outputLen should be aligned to 32bit");
+			const outLen = len / 4;
+			const state = this.get();
+			if (outLen > state.length) throw new Error("_sha2: outputLen bigger than state");
+			for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);
+		}
+		digest() {
+			const { buffer, outputLen } = this;
+			this.digestInto(buffer);
+			const res = buffer.slice(0, outputLen);
+			this.destroy();
+			return res;
+		}
+		_cloneInto(to) {
+			to || (to = new this.constructor());
+			to.set(...this.get());
+			const { blockLen, buffer, length, finished, destroyed, pos } = this;
+			to.destroyed = destroyed;
+			to.finished = finished;
+			to.length = length;
+			to.pos = pos;
+			if (length % blockLen) to.buffer.set(buffer);
+			return to;
+		}
+		clone() {
+			return this._cloneInto();
+		}
+	};
+	exports.HashMD = HashMD;
 	/**
-	 * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
-	 * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
-	 */
+	* Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
+	* Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
+	*/
 	/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */
-	_md.SHA256_IV = Uint32Array.from([
-	    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
+	exports.SHA256_IV = Uint32Array.from([
+		1779033703,
+		3144134277,
+		1013904242,
+		2773480762,
+		1359893119,
+		2600822924,
+		528734635,
+		1541459225
 	]);
 	/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */
-	_md.SHA224_IV = Uint32Array.from([
-	    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,
+	exports.SHA224_IV = Uint32Array.from([
+		3238371032,
+		914150663,
+		812702999,
+		4144912697,
+		4290775857,
+		1750603025,
+		1694076839,
+		3204075428
 	]);
 	/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */
-	_md.SHA384_IV = Uint32Array.from([
-	    0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,
-	    0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,
+	exports.SHA384_IV = Uint32Array.from([
+		3418070365,
+		3238371032,
+		1654270250,
+		914150663,
+		2438529370,
+		812702999,
+		355462360,
+		4144912697,
+		1731405415,
+		4290775857,
+		2394180231,
+		1750603025,
+		3675008525,
+		1694076839,
+		1203062813,
+		3204075428
 	]);
 	/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */
-	_md.SHA512_IV = Uint32Array.from([
-	    0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,
-	    0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,
+	exports.SHA512_IV = Uint32Array.from([
+		1779033703,
+		4089235720,
+		3144134277,
+		2227873595,
+		1013904242,
+		4271175723,
+		2773480762,
+		1595750129,
+		1359893119,
+		2917565137,
+		2600822924,
+		725511199,
+		528734635,
+		4215389547,
+		1541459225,
+		327033209
 	]);
-	
-	return _md;
-}
-
-var _u64 = {};
-
-var hasRequired_u64;
-
-function require_u64 () {
-	if (hasRequired_u64) return _u64;
-	hasRequired_u64 = 1;
-	Object.defineProperty(_u64, "__esModule", { value: true });
-	_u64.toBig = _u64.shrSL = _u64.shrSH = _u64.rotrSL = _u64.rotrSH = _u64.rotrBL = _u64.rotrBH = _u64.rotr32L = _u64.rotr32H = _u64.rotlSL = _u64.rotlSH = _u64.rotlBL = _u64.rotlBH = _u64.add5L = _u64.add5H = _u64.add4L = _u64.add4H = _u64.add3L = _u64.add3H = void 0;
-	_u64.add = add;
-	_u64.fromBig = fromBig;
-	_u64.split = split;
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/_u64.js
+var require__u64 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.toBig = exports.shrSL = exports.shrSH = exports.rotrSL = exports.rotrSH = exports.rotrBL = exports.rotrBH = exports.rotr32L = exports.rotr32H = exports.rotlSL = exports.rotlSH = exports.rotlBL = exports.rotlBH = exports.add5L = exports.add5H = exports.add4L = exports.add4H = exports.add3L = exports.add3H = void 0;
+	exports.add = add;
+	exports.fromBig = fromBig;
+	exports.split = split;
 	/**
-	 * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
-	 * @todo re-check https://issues.chromium.org/issues/42212588
-	 * @module
-	 */
-	const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-	const _32n = /* @__PURE__ */ BigInt(32);
+	* Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
+	* @todo re-check https://issues.chromium.org/issues/42212588
+	* @module
+	*/
+	var U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+	var _32n = /* @__PURE__ */ BigInt(32);
 	function fromBig(n, le = false) {
-	    if (le)
-	        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
-	    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+		if (le) return {
+			h: Number(n & U32_MASK64),
+			l: Number(n >> _32n & U32_MASK64)
+		};
+		return {
+			h: Number(n >> _32n & U32_MASK64) | 0,
+			l: Number(n & U32_MASK64) | 0
+		};
 	}
 	function split(lst, le = false) {
-	    const len = lst.length;
-	    let Ah = new Uint32Array(len);
-	    let Al = new Uint32Array(len);
-	    for (let i = 0; i < len; i++) {
-	        const { h, l } = fromBig(lst[i], le);
-	        [Ah[i], Al[i]] = [h, l];
-	    }
-	    return [Ah, Al];
+		const len = lst.length;
+		let Ah = new Uint32Array(len);
+		let Al = new Uint32Array(len);
+		for (let i = 0; i < len; i++) {
+			const { h, l } = fromBig(lst[i], le);
+			[Ah[i], Al[i]] = [h, l];
+		}
+		return [Ah, Al];
 	}
-	const toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);
-	_u64.toBig = toBig;
-	// for Shift in [0, 32)
-	const shrSH = (h, _l, s) => h >>> s;
-	_u64.shrSH = shrSH;
-	const shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
-	_u64.shrSL = shrSL;
-	// Right rotate for Shift in [1, 32)
-	const rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));
-	_u64.rotrSH = rotrSH;
-	const rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
-	_u64.rotrSL = rotrSL;
-	// Right rotate for Shift in (32, 64), NOTE: 32 is special case.
-	const rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));
-	_u64.rotrBH = rotrBH;
-	const rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));
-	_u64.rotrBL = rotrBL;
-	// Right rotate for shift===32 (just swaps l&h)
-	const rotr32H = (_h, l) => l;
-	_u64.rotr32H = rotr32H;
-	const rotr32L = (h, _l) => h;
-	_u64.rotr32L = rotr32L;
-	// Left rotate for Shift in [1, 32)
-	const rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));
-	_u64.rotlSH = rotlSH;
-	const rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));
-	_u64.rotlSL = rotlSL;
-	// Left rotate for Shift in (32, 64), NOTE: 32 is special case.
-	const rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));
-	_u64.rotlBH = rotlBH;
-	const rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));
-	_u64.rotlBL = rotlBL;
-	// JS uses 32-bit signed integers for bitwise operations which means we cannot
-	// simple take carry out of low bit sum by shift, we need to use division.
+	var toBig = (h, l) => BigInt(h >>> 0) << _32n | BigInt(l >>> 0);
+	exports.toBig = toBig;
+	var shrSH = (h, _l, s) => h >>> s;
+	exports.shrSH = shrSH;
+	var shrSL = (h, l, s) => h << 32 - s | l >>> s;
+	exports.shrSL = shrSL;
+	var rotrSH = (h, l, s) => h >>> s | l << 32 - s;
+	exports.rotrSH = rotrSH;
+	var rotrSL = (h, l, s) => h << 32 - s | l >>> s;
+	exports.rotrSL = rotrSL;
+	var rotrBH = (h, l, s) => h << 64 - s | l >>> s - 32;
+	exports.rotrBH = rotrBH;
+	var rotrBL = (h, l, s) => h >>> s - 32 | l << 64 - s;
+	exports.rotrBL = rotrBL;
+	var rotr32H = (_h, l) => l;
+	exports.rotr32H = rotr32H;
+	var rotr32L = (h, _l) => h;
+	exports.rotr32L = rotr32L;
+	var rotlSH = (h, l, s) => h << s | l >>> 32 - s;
+	exports.rotlSH = rotlSH;
+	var rotlSL = (h, l, s) => l << s | h >>> 32 - s;
+	exports.rotlSL = rotlSL;
+	var rotlBH = (h, l, s) => l << s - 32 | h >>> 64 - s;
+	exports.rotlBH = rotlBH;
+	var rotlBL = (h, l, s) => h << s - 32 | l >>> 64 - s;
+	exports.rotlBL = rotlBL;
 	function add(Ah, Al, Bh, Bl) {
-	    const l = (Al >>> 0) + (Bl >>> 0);
-	    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };
+		const l = (Al >>> 0) + (Bl >>> 0);
+		return {
+			h: Ah + Bh + (l / 2 ** 32 | 0) | 0,
+			l: l | 0
+		};
 	}
-	// Addition with more than 2 elements
-	const add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
-	_u64.add3L = add3L;
-	const add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;
-	_u64.add3H = add3H;
-	const add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
-	_u64.add4L = add4L;
-	const add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;
-	_u64.add4H = add4H;
-	const add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
-	_u64.add5L = add5L;
-	const add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;
-	_u64.add5H = add5H;
-	// prettier-ignore
-	const u64 = {
-	    fromBig, split, toBig,
-	    shrSH, shrSL,
-	    rotrSH, rotrSL, rotrBH, rotrBL,
-	    rotr32H, rotr32L,
-	    rotlSH, rotlSL, rotlBH, rotlBL,
-	    add, add3L, add3H, add4L, add4H, add5H, add5L,
+	var add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
+	exports.add3L = add3L;
+	var add3H = (low, Ah, Bh, Ch) => Ah + Bh + Ch + (low / 2 ** 32 | 0) | 0;
+	exports.add3H = add3H;
+	var add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
+	exports.add4L = add4L;
+	var add4H = (low, Ah, Bh, Ch, Dh) => Ah + Bh + Ch + Dh + (low / 2 ** 32 | 0) | 0;
+	exports.add4H = add4H;
+	var add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
+	exports.add5L = add5L;
+	var add5H = (low, Ah, Bh, Ch, Dh, Eh) => Ah + Bh + Ch + Dh + Eh + (low / 2 ** 32 | 0) | 0;
+	exports.add5H = add5H;
+	exports.default = {
+		fromBig,
+		split,
+		toBig,
+		shrSH,
+		shrSL,
+		rotrSH,
+		rotrSL,
+		rotrBH,
+		rotrBL,
+		rotr32H,
+		rotr32L,
+		rotlSH,
+		rotlSL,
+		rotlBH,
+		rotlBL,
+		add,
+		add3L,
+		add3H,
+		add4L,
+		add4H,
+		add5H,
+		add5L
 	};
-	_u64.default = u64;
-	
-	return _u64;
-}
-
-var hasRequiredSha2;
-
-function requireSha2 () {
-	if (hasRequiredSha2) return sha2;
-	hasRequiredSha2 = 1;
-	Object.defineProperty(sha2, "__esModule", { value: true });
-	sha2.sha512_224 = sha2.sha512_256 = sha2.sha384 = sha2.sha512 = sha2.sha224 = sha2.sha256 = sha2.SHA512_256 = sha2.SHA512_224 = sha2.SHA384 = sha2.SHA512 = sha2.SHA224 = sha2.SHA256 = void 0;
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/sha2.js
+var require_sha2 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.sha512_224 = exports.sha512_256 = exports.sha384 = exports.sha512 = exports.sha224 = exports.sha256 = exports.SHA512_256 = exports.SHA512_224 = exports.SHA384 = exports.SHA512 = exports.SHA224 = exports.SHA256 = void 0;
 	/**
-	 * 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
-	 */
-	const _md_ts_1 = /*@__PURE__*/ require_md();
-	const u64 = /*@__PURE__*/ require_u64();
-	const utils_ts_1 = /*@__PURE__*/ requireUtils();
+	* 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
+	*/
+	var _md_ts_1 = require__md();
+	var u64 = require__u64();
+	var utils_ts_1 = require_utils();
 	/**
-	 * 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
+	* Round constants:
+	* First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)
+	*/
+	var SHA256_K = /* @__PURE__ */ Uint32Array.from([
+		1116352408,
+		1899447441,
+		3049323471,
+		3921009573,
+		961987163,
+		1508970993,
+		2453635748,
+		2870763221,
+		3624381080,
+		310598401,
+		607225278,
+		1426881987,
+		1925078388,
+		2162078206,
+		2614888103,
+		3248222580,
+		3835390401,
+		4022224774,
+		264347078,
+		604807628,
+		770255983,
+		1249150122,
+		1555081692,
+		1996064986,
+		2554220882,
+		2821834349,
+		2952996808,
+		3210313671,
+		3336571891,
+		3584528711,
+		113926993,
+		338241895,
+		666307205,
+		773529912,
+		1294757372,
+		1396182291,
+		1695183700,
+		1986661051,
+		2177026350,
+		2456956037,
+		2730485921,
+		2820302411,
+		3259730800,
+		3345764771,
+		3516065817,
+		3600352804,
+		4094571909,
+		275423344,
+		430227734,
+		506948616,
+		659060556,
+		883997877,
+		958139571,
+		1322822218,
+		1537002063,
+		1747873779,
+		1955562222,
+		2024104815,
+		2227730452,
+		2361852424,
+		2428436474,
+		2756734187,
+		3204031479,
+		3329325298
 	]);
 	/** Reusable temporary buffer. "W" comes straight from spec. */
-	const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
-	class SHA256 extends _md_ts_1.HashMD {
-	    constructor(outputLen = 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_ts_1.SHA256_IV[0] | 0;
-	        this.B = _md_ts_1.SHA256_IV[1] | 0;
-	        this.C = _md_ts_1.SHA256_IV[2] | 0;
-	        this.D = _md_ts_1.SHA256_IV[3] | 0;
-	        this.E = _md_ts_1.SHA256_IV[4] | 0;
-	        this.F = _md_ts_1.SHA256_IV[5] | 0;
-	        this.G = _md_ts_1.SHA256_IV[6] | 0;
-	        this.H = _md_ts_1.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 = (0, utils_ts_1.rotr)(W15, 7) ^ (0, utils_ts_1.rotr)(W15, 18) ^ (W15 >>> 3);
-	            const s1 = (0, utils_ts_1.rotr)(W2, 17) ^ (0, utils_ts_1.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 = (0, utils_ts_1.rotr)(E, 6) ^ (0, utils_ts_1.rotr)(E, 11) ^ (0, utils_ts_1.rotr)(E, 25);
-	            const T1 = (H + sigma1 + (0, _md_ts_1.Chi)(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
-	            const sigma0 = (0, utils_ts_1.rotr)(A, 2) ^ (0, utils_ts_1.rotr)(A, 13) ^ (0, utils_ts_1.rotr)(A, 22);
-	            const T2 = (sigma0 + (0, _md_ts_1.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() {
-	        (0, utils_ts_1.clean)(SHA256_W);
-	    }
-	    destroy() {
-	        this.set(0, 0, 0, 0, 0, 0, 0, 0);
-	        (0, utils_ts_1.clean)(this.buffer);
-	    }
-	}
-	sha2.SHA256 = SHA256;
-	class SHA224 extends SHA256 {
-	    constructor() {
-	        super(28);
-	        this.A = _md_ts_1.SHA224_IV[0] | 0;
-	        this.B = _md_ts_1.SHA224_IV[1] | 0;
-	        this.C = _md_ts_1.SHA224_IV[2] | 0;
-	        this.D = _md_ts_1.SHA224_IV[3] | 0;
-	        this.E = _md_ts_1.SHA224_IV[4] | 0;
-	        this.F = _md_ts_1.SHA224_IV[5] | 0;
-	        this.G = _md_ts_1.SHA224_IV[6] | 0;
-	        this.H = _md_ts_1.SHA224_IV[7] | 0;
-	    }
-	}
-	sha2.SHA224 = SHA224;
-	// 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_ts_1.HashMD {
-	    constructor(outputLen = 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_ts_1.SHA512_IV[0] | 0;
-	        this.Al = _md_ts_1.SHA512_IV[1] | 0;
-	        this.Bh = _md_ts_1.SHA512_IV[2] | 0;
-	        this.Bl = _md_ts_1.SHA512_IV[3] | 0;
-	        this.Ch = _md_ts_1.SHA512_IV[4] | 0;
-	        this.Cl = _md_ts_1.SHA512_IV[5] | 0;
-	        this.Dh = _md_ts_1.SHA512_IV[6] | 0;
-	        this.Dl = _md_ts_1.SHA512_IV[7] | 0;
-	        this.Eh = _md_ts_1.SHA512_IV[8] | 0;
-	        this.El = _md_ts_1.SHA512_IV[9] | 0;
-	        this.Fh = _md_ts_1.SHA512_IV[10] | 0;
-	        this.Fl = _md_ts_1.SHA512_IV[11] | 0;
-	        this.Gh = _md_ts_1.SHA512_IV[12] | 0;
-	        this.Gl = _md_ts_1.SHA512_IV[13] | 0;
-	        this.Hh = _md_ts_1.SHA512_IV[14] | 0;
-	        this.Hl = _md_ts_1.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() {
-	        (0, utils_ts_1.clean)(SHA512_W_H, SHA512_W_L);
-	    }
-	    destroy() {
-	        (0, utils_ts_1.clean)(this.buffer);
-	        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-	    }
-	}
-	sha2.SHA512 = SHA512;
-	class SHA384 extends SHA512 {
-	    constructor() {
-	        super(48);
-	        this.Ah = _md_ts_1.SHA384_IV[0] | 0;
-	        this.Al = _md_ts_1.SHA384_IV[1] | 0;
-	        this.Bh = _md_ts_1.SHA384_IV[2] | 0;
-	        this.Bl = _md_ts_1.SHA384_IV[3] | 0;
-	        this.Ch = _md_ts_1.SHA384_IV[4] | 0;
-	        this.Cl = _md_ts_1.SHA384_IV[5] | 0;
-	        this.Dh = _md_ts_1.SHA384_IV[6] | 0;
-	        this.Dl = _md_ts_1.SHA384_IV[7] | 0;
-	        this.Eh = _md_ts_1.SHA384_IV[8] | 0;
-	        this.El = _md_ts_1.SHA384_IV[9] | 0;
-	        this.Fh = _md_ts_1.SHA384_IV[10] | 0;
-	        this.Fl = _md_ts_1.SHA384_IV[11] | 0;
-	        this.Gh = _md_ts_1.SHA384_IV[12] | 0;
-	        this.Gl = _md_ts_1.SHA384_IV[13] | 0;
-	        this.Hh = _md_ts_1.SHA384_IV[14] | 0;
-	        this.Hl = _md_ts_1.SHA384_IV[15] | 0;
-	    }
-	}
-	sha2.SHA384 = SHA384;
+	var SHA256_W = /* @__PURE__ */ new Uint32Array(64);
+	var SHA256 = class extends _md_ts_1.HashMD {
+		constructor(outputLen = 32) {
+			super(64, outputLen, 8, false);
+			this.A = _md_ts_1.SHA256_IV[0] | 0;
+			this.B = _md_ts_1.SHA256_IV[1] | 0;
+			this.C = _md_ts_1.SHA256_IV[2] | 0;
+			this.D = _md_ts_1.SHA256_IV[3] | 0;
+			this.E = _md_ts_1.SHA256_IV[4] | 0;
+			this.F = _md_ts_1.SHA256_IV[5] | 0;
+			this.G = _md_ts_1.SHA256_IV[6] | 0;
+			this.H = _md_ts_1.SHA256_IV[7] | 0;
+		}
+		get() {
+			const { A, B, C, D, E, F, G, H } = this;
+			return [
+				A,
+				B,
+				C,
+				D,
+				E,
+				F,
+				G,
+				H
+			];
+		}
+		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) {
+			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 = (0, utils_ts_1.rotr)(W15, 7) ^ (0, utils_ts_1.rotr)(W15, 18) ^ W15 >>> 3;
+				SHA256_W[i] = ((0, utils_ts_1.rotr)(W2, 17) ^ (0, utils_ts_1.rotr)(W2, 19) ^ W2 >>> 10) + SHA256_W[i - 7] + s0 + SHA256_W[i - 16] | 0;
+			}
+			let { A, B, C, D, E, F, G, H } = this;
+			for (let i = 0; i < 64; i++) {
+				const sigma1 = (0, utils_ts_1.rotr)(E, 6) ^ (0, utils_ts_1.rotr)(E, 11) ^ (0, utils_ts_1.rotr)(E, 25);
+				const T1 = H + sigma1 + (0, _md_ts_1.Chi)(E, F, G) + SHA256_K[i] + SHA256_W[i] | 0;
+				const T2 = ((0, utils_ts_1.rotr)(A, 2) ^ (0, utils_ts_1.rotr)(A, 13) ^ (0, utils_ts_1.rotr)(A, 22)) + (0, _md_ts_1.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;
+			}
+			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() {
+			(0, utils_ts_1.clean)(SHA256_W);
+		}
+		destroy() {
+			this.set(0, 0, 0, 0, 0, 0, 0, 0);
+			(0, utils_ts_1.clean)(this.buffer);
+		}
+	};
+	exports.SHA256 = SHA256;
+	var SHA224 = class extends SHA256 {
+		constructor() {
+			super(28);
+			this.A = _md_ts_1.SHA224_IV[0] | 0;
+			this.B = _md_ts_1.SHA224_IV[1] | 0;
+			this.C = _md_ts_1.SHA224_IV[2] | 0;
+			this.D = _md_ts_1.SHA224_IV[3] | 0;
+			this.E = _md_ts_1.SHA224_IV[4] | 0;
+			this.F = _md_ts_1.SHA224_IV[5] | 0;
+			this.G = _md_ts_1.SHA224_IV[6] | 0;
+			this.H = _md_ts_1.SHA224_IV[7] | 0;
+		}
+	};
+	exports.SHA224 = SHA224;
+	var K512 = 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)));
+	var SHA512_Kh = K512[0];
+	var SHA512_Kl = K512[1];
+	var SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);
+	var SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);
+	var SHA512 = class extends _md_ts_1.HashMD {
+		constructor(outputLen = 64) {
+			super(128, outputLen, 16, false);
+			this.Ah = _md_ts_1.SHA512_IV[0] | 0;
+			this.Al = _md_ts_1.SHA512_IV[1] | 0;
+			this.Bh = _md_ts_1.SHA512_IV[2] | 0;
+			this.Bl = _md_ts_1.SHA512_IV[3] | 0;
+			this.Ch = _md_ts_1.SHA512_IV[4] | 0;
+			this.Cl = _md_ts_1.SHA512_IV[5] | 0;
+			this.Dh = _md_ts_1.SHA512_IV[6] | 0;
+			this.Dl = _md_ts_1.SHA512_IV[7] | 0;
+			this.Eh = _md_ts_1.SHA512_IV[8] | 0;
+			this.El = _md_ts_1.SHA512_IV[9] | 0;
+			this.Fh = _md_ts_1.SHA512_IV[10] | 0;
+			this.Fl = _md_ts_1.SHA512_IV[11] | 0;
+			this.Gh = _md_ts_1.SHA512_IV[12] | 0;
+			this.Gl = _md_ts_1.SHA512_IV[13] | 0;
+			this.Hh = _md_ts_1.SHA512_IV[14] | 0;
+			this.Hl = _md_ts_1.SHA512_IV[15] | 0;
+		}
+		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
+			];
+		}
+		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) {
+			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++) {
+				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);
+				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);
+				const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
+				SHA512_W_H[i] = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]) | 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;
+			for (let i = 0; i < 80; i++) {
+				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 CHIh = Eh & Fh ^ ~Eh & Gh;
+				const CHIl = El & Fl ^ ~El & Gl;
+				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;
+				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;
+			}
+			({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() {
+			(0, utils_ts_1.clean)(SHA512_W_H, SHA512_W_L);
+		}
+		destroy() {
+			(0, utils_ts_1.clean)(this.buffer);
+			this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+		}
+	};
+	exports.SHA512 = SHA512;
+	var SHA384 = class extends SHA512 {
+		constructor() {
+			super(48);
+			this.Ah = _md_ts_1.SHA384_IV[0] | 0;
+			this.Al = _md_ts_1.SHA384_IV[1] | 0;
+			this.Bh = _md_ts_1.SHA384_IV[2] | 0;
+			this.Bl = _md_ts_1.SHA384_IV[3] | 0;
+			this.Ch = _md_ts_1.SHA384_IV[4] | 0;
+			this.Cl = _md_ts_1.SHA384_IV[5] | 0;
+			this.Dh = _md_ts_1.SHA384_IV[6] | 0;
+			this.Dl = _md_ts_1.SHA384_IV[7] | 0;
+			this.Eh = _md_ts_1.SHA384_IV[8] | 0;
+			this.El = _md_ts_1.SHA384_IV[9] | 0;
+			this.Fh = _md_ts_1.SHA384_IV[10] | 0;
+			this.Fl = _md_ts_1.SHA384_IV[11] | 0;
+			this.Gh = _md_ts_1.SHA384_IV[12] | 0;
+			this.Gl = _md_ts_1.SHA384_IV[13] | 0;
+			this.Hh = _md_ts_1.SHA384_IV[14] | 0;
+			this.Hl = _md_ts_1.SHA384_IV[15] | 0;
+		}
+	};
+	exports.SHA384 = SHA384;
 	/**
-	 * Truncated SHA512/256 and SHA512/224.
-	 * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as "intermediary" IV of SHA512/t.
-	 * Then t hashes string to produce result IV.
-	 * See `test/misc/sha2-gen-iv.js`.
-	 */
+	* Truncated SHA512/256 and SHA512/224.
+	* SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as "intermediary" IV of SHA512/t.
+	* Then t hashes string to produce result IV.
+	* See `test/misc/sha2-gen-iv.js`.
+	*/
 	/** SHA512/224 IV */
-	const T224_IV = /* @__PURE__ */ Uint32Array.from([
-	    0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,
-	    0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,
+	var T224_IV = /* @__PURE__ */ Uint32Array.from([
+		2352822216,
+		424955298,
+		1944164710,
+		2312950998,
+		502970286,
+		855612546,
+		1738396948,
+		1479516111,
+		258812777,
+		2077511080,
+		2011393907,
+		79989058,
+		1067287976,
+		1780299464,
+		286451373,
+		2446758561
 	]);
 	/** SHA512/256 IV */
-	const T256_IV = /* @__PURE__ */ Uint32Array.from([
-	    0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,
-	    0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,
+	var T256_IV = /* @__PURE__ */ Uint32Array.from([
+		573645204,
+		4230739756,
+		2673172387,
+		3360449730,
+		596883563,
+		1867755857,
+		2520282905,
+		1497426621,
+		2519219938,
+		2827943907,
+		3193839141,
+		1401305490,
+		721525244,
+		746961066,
+		246885852,
+		2177182882
 	]);
-	class SHA512_224 extends SHA512 {
-	    constructor() {
-	        super(28);
-	        this.Ah = T224_IV[0] | 0;
-	        this.Al = T224_IV[1] | 0;
-	        this.Bh = T224_IV[2] | 0;
-	        this.Bl = T224_IV[3] | 0;
-	        this.Ch = T224_IV[4] | 0;
-	        this.Cl = T224_IV[5] | 0;
-	        this.Dh = T224_IV[6] | 0;
-	        this.Dl = T224_IV[7] | 0;
-	        this.Eh = T224_IV[8] | 0;
-	        this.El = T224_IV[9] | 0;
-	        this.Fh = T224_IV[10] | 0;
-	        this.Fl = T224_IV[11] | 0;
-	        this.Gh = T224_IV[12] | 0;
-	        this.Gl = T224_IV[13] | 0;
-	        this.Hh = T224_IV[14] | 0;
-	        this.Hl = T224_IV[15] | 0;
-	    }
-	}
-	sha2.SHA512_224 = SHA512_224;
-	class SHA512_256 extends SHA512 {
-	    constructor() {
-	        super(32);
-	        this.Ah = T256_IV[0] | 0;
-	        this.Al = T256_IV[1] | 0;
-	        this.Bh = T256_IV[2] | 0;
-	        this.Bl = T256_IV[3] | 0;
-	        this.Ch = T256_IV[4] | 0;
-	        this.Cl = T256_IV[5] | 0;
-	        this.Dh = T256_IV[6] | 0;
-	        this.Dl = T256_IV[7] | 0;
-	        this.Eh = T256_IV[8] | 0;
-	        this.El = T256_IV[9] | 0;
-	        this.Fh = T256_IV[10] | 0;
-	        this.Fl = T256_IV[11] | 0;
-	        this.Gh = T256_IV[12] | 0;
-	        this.Gl = T256_IV[13] | 0;
-	        this.Hh = T256_IV[14] | 0;
-	        this.Hl = T256_IV[15] | 0;
-	    }
-	}
-	sha2.SHA512_256 = SHA512_256;
+	var SHA512_224 = class extends SHA512 {
+		constructor() {
+			super(28);
+			this.Ah = T224_IV[0] | 0;
+			this.Al = T224_IV[1] | 0;
+			this.Bh = T224_IV[2] | 0;
+			this.Bl = T224_IV[3] | 0;
+			this.Ch = T224_IV[4] | 0;
+			this.Cl = T224_IV[5] | 0;
+			this.Dh = T224_IV[6] | 0;
+			this.Dl = T224_IV[7] | 0;
+			this.Eh = T224_IV[8] | 0;
+			this.El = T224_IV[9] | 0;
+			this.Fh = T224_IV[10] | 0;
+			this.Fl = T224_IV[11] | 0;
+			this.Gh = T224_IV[12] | 0;
+			this.Gl = T224_IV[13] | 0;
+			this.Hh = T224_IV[14] | 0;
+			this.Hl = T224_IV[15] | 0;
+		}
+	};
+	exports.SHA512_224 = SHA512_224;
+	var SHA512_256 = class extends SHA512 {
+		constructor() {
+			super(32);
+			this.Ah = T256_IV[0] | 0;
+			this.Al = T256_IV[1] | 0;
+			this.Bh = T256_IV[2] | 0;
+			this.Bl = T256_IV[3] | 0;
+			this.Ch = T256_IV[4] | 0;
+			this.Cl = T256_IV[5] | 0;
+			this.Dh = T256_IV[6] | 0;
+			this.Dl = T256_IV[7] | 0;
+			this.Eh = T256_IV[8] | 0;
+			this.El = T256_IV[9] | 0;
+			this.Fh = T256_IV[10] | 0;
+			this.Fl = T256_IV[11] | 0;
+			this.Gh = T256_IV[12] | 0;
+			this.Gl = T256_IV[13] | 0;
+			this.Hh = T256_IV[14] | 0;
+			this.Hl = T256_IV[15] | 0;
+		}
+	};
+	exports.SHA512_256 = SHA512_256;
 	/**
-	 * 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.
-	 */
-	sha2.sha256 = (0, utils_ts_1.createHasher)(() => new SHA256());
+	* 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.
+	*/
+	exports.sha256 = (0, utils_ts_1.createHasher)(() => new SHA256());
 	/** SHA2-224 hash function from RFC 4634 */
-	sha2.sha224 = (0, utils_ts_1.createHasher)(() => new SHA224());
+	exports.sha224 = (0, utils_ts_1.createHasher)(() => new SHA224());
 	/** SHA2-512 hash function from RFC 4634. */
-	sha2.sha512 = (0, utils_ts_1.createHasher)(() => new SHA512());
+	exports.sha512 = (0, utils_ts_1.createHasher)(() => new SHA512());
 	/** SHA2-384 hash function from RFC 4634. */
-	sha2.sha384 = (0, utils_ts_1.createHasher)(() => new SHA384());
+	exports.sha384 = (0, utils_ts_1.createHasher)(() => new SHA384());
 	/**
-	 * SHA2-512/256 "truncated" hash function, with improved resistance to length extension attacks.
-	 * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
-	 */
-	sha2.sha512_256 = (0, utils_ts_1.createHasher)(() => new SHA512_256());
+	* SHA2-512/256 "truncated" hash function, with improved resistance to length extension attacks.
+	* See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
+	*/
+	exports.sha512_256 = (0, utils_ts_1.createHasher)(() => new SHA512_256());
 	/**
-	 * SHA2-512/224 "truncated" hash function, with improved resistance to length extension attacks.
-	 * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
-	 */
-	sha2.sha512_224 = (0, utils_ts_1.createHasher)(() => new SHA512_224());
-	
-	return sha2;
-}
-
-var hasRequiredSha256;
-
-function requireSha256 () {
-	if (hasRequiredSha256) return sha256;
-	hasRequiredSha256 = 1;
-	Object.defineProperty(sha256, "__esModule", { value: true });
-	sha256.sha224 = sha256.SHA224 = sha256.sha256 = sha256.SHA256 = void 0;
+	* SHA2-512/224 "truncated" hash function, with improved resistance to length extension attacks.
+	* See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).
+	*/
+	exports.sha512_224 = (0, utils_ts_1.createHasher)(() => new SHA512_224());
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/sha256.js
+var require_sha256 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.sha224 = exports.SHA224 = exports.sha256 = exports.SHA256 = void 0;
 	/**
-	 * 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
-	 */
-	const sha2_ts_1 = /*@__PURE__*/ requireSha2();
+	* 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
+	*/
+	var sha2_ts_1 = require_sha2();
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha256.SHA256 = sha2_ts_1.SHA256;
+	exports.SHA256 = sha2_ts_1.SHA256;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha256.sha256 = sha2_ts_1.sha256;
+	exports.sha256 = sha2_ts_1.sha256;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha256.SHA224 = sha2_ts_1.SHA224;
+	exports.SHA224 = sha2_ts_1.SHA224;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha256.sha224 = sha2_ts_1.sha224;
-	
-	return sha256;
-}
-
-var sha512 = {};
-
-var hasRequiredSha512;
-
-function requireSha512 () {
-	if (hasRequiredSha512) return sha512;
-	hasRequiredSha512 = 1;
-	Object.defineProperty(sha512, "__esModule", { value: true });
-	sha512.sha512_256 = sha512.SHA512_256 = sha512.sha512_224 = sha512.SHA512_224 = sha512.sha384 = sha512.SHA384 = sha512.sha512 = sha512.SHA512 = void 0;
+	exports.sha224 = sha2_ts_1.sha224;
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/sha512.js
+var require_sha512 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.sha512_256 = exports.SHA512_256 = exports.sha512_224 = exports.SHA512_224 = exports.sha384 = exports.SHA384 = exports.sha512 = exports.SHA512 = void 0;
 	/**
-	 * 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
-	 */
-	const sha2_ts_1 = /*@__PURE__*/ requireSha2();
+	* 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
+	*/
+	var sha2_ts_1 = require_sha2();
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.SHA512 = sha2_ts_1.SHA512;
+	exports.SHA512 = sha2_ts_1.SHA512;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.sha512 = sha2_ts_1.sha512;
+	exports.sha512 = sha2_ts_1.sha512;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.SHA384 = sha2_ts_1.SHA384;
+	exports.SHA384 = sha2_ts_1.SHA384;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.sha384 = sha2_ts_1.sha384;
+	exports.sha384 = sha2_ts_1.sha384;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.SHA512_224 = sha2_ts_1.SHA512_224;
+	exports.SHA512_224 = sha2_ts_1.SHA512_224;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.sha512_224 = sha2_ts_1.sha512_224;
+	exports.sha512_224 = sha2_ts_1.sha512_224;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.SHA512_256 = sha2_ts_1.SHA512_256;
+	exports.SHA512_256 = sha2_ts_1.SHA512_256;
 	/** @deprecated Use import from `noble/hashes/sha2` module */
-	sha512.sha512_256 = sha2_ts_1.sha512_256;
-	
-	return sha512;
-}
-
-var pbkdf2 = {};
-
-var hmac = {};
-
-var hasRequiredHmac;
-
-function requireHmac () {
-	if (hasRequiredHmac) return hmac;
-	hasRequiredHmac = 1;
-	(function (exports$1) {
-		Object.defineProperty(exports$1, "__esModule", { value: true });
-		exports$1.hmac = exports$1.HMAC = void 0;
-		/**
-		 * HMAC: RFC2104 message authentication code.
-		 * @module
-		 */
-		const utils_ts_1 = /*@__PURE__*/ requireUtils();
-		class HMAC extends utils_ts_1.Hash {
-		    constructor(hash, _key) {
-		        super();
-		        this.finished = false;
-		        this.destroyed = false;
-		        (0, utils_ts_1.ahash)(hash);
-		        const key = (0, utils_ts_1.toBytes)(_key);
-		        this.iHash = hash.create();
-		        if (typeof this.iHash.update !== 'function')
-		            throw new Error('Expected instance of class which extends utils.Hash');
-		        this.blockLen = this.iHash.blockLen;
-		        this.outputLen = this.iHash.outputLen;
-		        const blockLen = this.blockLen;
-		        const pad = new Uint8Array(blockLen);
-		        // blockLen can be bigger than outputLen
-		        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
-		        for (let i = 0; i < pad.length; i++)
-		            pad[i] ^= 0x36;
-		        this.iHash.update(pad);
-		        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone
-		        this.oHash = hash.create();
-		        // Undo internal XOR && apply outer XOR
-		        for (let i = 0; i < pad.length; i++)
-		            pad[i] ^= 0x36 ^ 0x5c;
-		        this.oHash.update(pad);
-		        (0, utils_ts_1.clean)(pad);
-		    }
-		    update(buf) {
-		        (0, utils_ts_1.aexists)(this);
-		        this.iHash.update(buf);
-		        return this;
-		    }
-		    digestInto(out) {
-		        (0, utils_ts_1.aexists)(this);
-		        (0, utils_ts_1.abytes)(out, this.outputLen);
-		        this.finished = true;
-		        this.iHash.digestInto(out);
-		        this.oHash.update(out);
-		        this.oHash.digestInto(out);
-		        this.destroy();
-		    }
-		    digest() {
-		        const out = new Uint8Array(this.oHash.outputLen);
-		        this.digestInto(out);
-		        return out;
-		    }
-		    _cloneInto(to) {
-		        // Create new instance without calling constructor since key already in state and we don't know it.
-		        to || (to = Object.create(Object.getPrototypeOf(this), {}));
-		        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-		        to = to;
-		        to.finished = finished;
-		        to.destroyed = destroyed;
-		        to.blockLen = blockLen;
-		        to.outputLen = outputLen;
-		        to.oHash = oHash._cloneInto(to.oHash);
-		        to.iHash = iHash._cloneInto(to.iHash);
-		        return to;
-		    }
-		    clone() {
-		        return this._cloneInto();
-		    }
-		    destroy() {
-		        this.destroyed = true;
-		        this.oHash.destroy();
-		        this.iHash.destroy();
-		    }
-		}
-		exports$1.HMAC = HMAC;
-		/**
-		 * HMAC: RFC2104 message authentication code.
-		 * @param hash - function that would be used e.g. sha256
-		 * @param key - message key
-		 * @param message - message data
-		 * @example
-		 * import { hmac } from '@noble/hashes/hmac';
-		 * import { sha256 } from '@noble/hashes/sha2';
-		 * const mac1 = hmac(sha256, 'key', 'message');
-		 */
-		const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
-		exports$1.hmac = hmac;
-		exports$1.hmac.create = (hash, key) => new HMAC(hash, key);
-		
-	} (hmac));
-	return hmac;
-}
-
-var hasRequiredPbkdf2;
-
-function requirePbkdf2 () {
-	if (hasRequiredPbkdf2) return pbkdf2;
-	hasRequiredPbkdf2 = 1;
-	Object.defineProperty(pbkdf2, "__esModule", { value: true });
-	pbkdf2.pbkdf2 = pbkdf2$1;
-	pbkdf2.pbkdf2Async = pbkdf2Async;
+	exports.sha512_256 = sha2_ts_1.sha512_256;
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/hmac.js
+var require_hmac = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.hmac = exports.HMAC = void 0;
 	/**
-	 * PBKDF (RFC 2898). Can be used to create a key from password and salt.
-	 * @module
-	 */
-	const hmac_ts_1 = /*@__PURE__*/ requireHmac();
-	// prettier-ignore
-	const utils_ts_1 = /*@__PURE__*/ requireUtils();
-	// Common prologue and epilogue for sync/async functions
+	* HMAC: RFC2104 message authentication code.
+	* @module
+	*/
+	var utils_ts_1 = require_utils();
+	var HMAC = class extends utils_ts_1.Hash {
+		constructor(hash, _key) {
+			super();
+			this.finished = false;
+			this.destroyed = false;
+			(0, utils_ts_1.ahash)(hash);
+			const key = (0, utils_ts_1.toBytes)(_key);
+			this.iHash = hash.create();
+			if (typeof this.iHash.update !== "function") throw new Error("Expected instance of class which extends utils.Hash");
+			this.blockLen = this.iHash.blockLen;
+			this.outputLen = this.iHash.outputLen;
+			const blockLen = this.blockLen;
+			const pad = new Uint8Array(blockLen);
+			pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
+			for (let i = 0; i < pad.length; i++) pad[i] ^= 54;
+			this.iHash.update(pad);
+			this.oHash = hash.create();
+			for (let i = 0; i < pad.length; i++) pad[i] ^= 106;
+			this.oHash.update(pad);
+			(0, utils_ts_1.clean)(pad);
+		}
+		update(buf) {
+			(0, utils_ts_1.aexists)(this);
+			this.iHash.update(buf);
+			return this;
+		}
+		digestInto(out) {
+			(0, utils_ts_1.aexists)(this);
+			(0, utils_ts_1.abytes)(out, this.outputLen);
+			this.finished = true;
+			this.iHash.digestInto(out);
+			this.oHash.update(out);
+			this.oHash.digestInto(out);
+			this.destroy();
+		}
+		digest() {
+			const out = new Uint8Array(this.oHash.outputLen);
+			this.digestInto(out);
+			return out;
+		}
+		_cloneInto(to) {
+			to || (to = Object.create(Object.getPrototypeOf(this), {}));
+			const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
+			to = to;
+			to.finished = finished;
+			to.destroyed = destroyed;
+			to.blockLen = blockLen;
+			to.outputLen = outputLen;
+			to.oHash = oHash._cloneInto(to.oHash);
+			to.iHash = iHash._cloneInto(to.iHash);
+			return to;
+		}
+		clone() {
+			return this._cloneInto();
+		}
+		destroy() {
+			this.destroyed = true;
+			this.oHash.destroy();
+			this.iHash.destroy();
+		}
+	};
+	exports.HMAC = HMAC;
+	/**
+	* HMAC: RFC2104 message authentication code.
+	* @param hash - function that would be used e.g. sha256
+	* @param key - message key
+	* @param message - message data
+	* @example
+	* import { hmac } from '@noble/hashes/hmac';
+	* import { sha256 } from '@noble/hashes/sha2';
+	* const mac1 = hmac(sha256, 'key', 'message');
+	*/
+	var hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
+	exports.hmac = hmac;
+	exports.hmac.create = (hash, key) => new HMAC(hash, key);
+}));
+//#endregion
+//#region node_modules/bip39/node_modules/@noble/hashes/pbkdf2.js
+var require_pbkdf2 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.pbkdf2 = pbkdf2;
+	exports.pbkdf2Async = pbkdf2Async;
+	/**
+	* PBKDF (RFC 2898). Can be used to create a key from password and salt.
+	* @module
+	*/
+	var hmac_ts_1 = require_hmac();
+	var utils_ts_1 = require_utils();
 	function pbkdf2Init(hash, _password, _salt, _opts) {
-	    (0, utils_ts_1.ahash)(hash);
-	    const opts = (0, utils_ts_1.checkOpts)({ dkLen: 32, asyncTick: 10 }, _opts);
-	    const { c, dkLen, asyncTick } = opts;
-	    (0, utils_ts_1.anumber)(c);
-	    (0, utils_ts_1.anumber)(dkLen);
-	    (0, utils_ts_1.anumber)(asyncTick);
-	    if (c < 1)
-	        throw new Error('iterations (c) should be >= 1');
-	    const password = (0, utils_ts_1.kdfInputToBytes)(_password);
-	    const salt = (0, utils_ts_1.kdfInputToBytes)(_salt);
-	    // DK = PBKDF2(PRF, Password, Salt, c, dkLen);
-	    const DK = new Uint8Array(dkLen);
-	    // U1 = PRF(Password, Salt + INT_32_BE(i))
-	    const PRF = hmac_ts_1.hmac.create(hash, password);
-	    const PRFSalt = PRF._cloneInto().update(salt);
-	    return { c, dkLen, asyncTick, DK, PRF, PRFSalt };
+		(0, utils_ts_1.ahash)(hash);
+		const { c, dkLen, asyncTick } = (0, utils_ts_1.checkOpts)({
+			dkLen: 32,
+			asyncTick: 10
+		}, _opts);
+		(0, utils_ts_1.anumber)(c);
+		(0, utils_ts_1.anumber)(dkLen);
+		(0, utils_ts_1.anumber)(asyncTick);
+		if (c < 1) throw new Error("iterations (c) should be >= 1");
+		const password = (0, utils_ts_1.kdfInputToBytes)(_password);
+		const salt = (0, utils_ts_1.kdfInputToBytes)(_salt);
+		const DK = new Uint8Array(dkLen);
+		const PRF = hmac_ts_1.hmac.create(hash, password);
+		return {
+			c,
+			dkLen,
+			asyncTick,
+			DK,
+			PRF,
+			PRFSalt: PRF._cloneInto().update(salt)
+		};
 	}
 	function pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {
-	    PRF.destroy();
-	    PRFSalt.destroy();
-	    if (prfW)
-	        prfW.destroy();
-	    (0, utils_ts_1.clean)(u);
-	    return DK;
+		PRF.destroy();
+		PRFSalt.destroy();
+		if (prfW) prfW.destroy();
+		(0, utils_ts_1.clean)(u);
+		return DK;
 	}
 	/**
-	 * PBKDF2-HMAC: RFC 2898 key derivation function
-	 * @param hash - hash function that would be used e.g. sha256
-	 * @param password - password from which a derived key is generated
-	 * @param salt - cryptographic salt
-	 * @param opts - {c, dkLen} where c is work factor and dkLen is output message size
-	 * @example
-	 * const key = pbkdf2(sha256, 'password', 'salt', { dkLen: 32, c: Math.pow(2, 18) });
-	 */
-	function pbkdf2$1(hash, password, salt, opts) {
-	    const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);
-	    let prfW; // Working copy
-	    const arr = new Uint8Array(4);
-	    const view = (0, utils_ts_1.createView)(arr);
-	    const u = new Uint8Array(PRF.outputLen);
-	    // DK = T1 + T2 + ⋯ + Tdklen/hlen
-	    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {
-	        // Ti = F(Password, Salt, c, i)
-	        const Ti = DK.subarray(pos, pos + PRF.outputLen);
-	        view.setInt32(0, ti, false);
-	        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc
-	        // U1 = PRF(Password, Salt + INT_32_BE(i))
-	        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);
-	        Ti.set(u.subarray(0, Ti.length));
-	        for (let ui = 1; ui < c; ui++) {
-	            // Uc = PRF(Password, Uc−1)
-	            PRF._cloneInto(prfW).update(u).digestInto(u);
-	            for (let i = 0; i < Ti.length; i++)
-	                Ti[i] ^= u[i];
-	        }
-	    }
-	    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);
+	* PBKDF2-HMAC: RFC 2898 key derivation function
+	* @param hash - hash function that would be used e.g. sha256
+	* @param password - password from which a derived key is generated
+	* @param salt - cryptographic salt
+	* @param opts - {c, dkLen} where c is work factor and dkLen is output message size
+	* @example
+	* const key = pbkdf2(sha256, 'password', 'salt', { dkLen: 32, c: Math.pow(2, 18) });
+	*/
+	function pbkdf2(hash, password, salt, opts) {
+		const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);
+		let prfW;
+		const arr = new Uint8Array(4);
+		const view = (0, utils_ts_1.createView)(arr);
+		const u = new Uint8Array(PRF.outputLen);
+		for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {
+			const Ti = DK.subarray(pos, pos + PRF.outputLen);
+			view.setInt32(0, ti, false);
+			(prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);
+			Ti.set(u.subarray(0, Ti.length));
+			for (let ui = 1; ui < c; ui++) {
+				PRF._cloneInto(prfW).update(u).digestInto(u);
+				for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];
+			}
+		}
+		return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);
 	}
 	/**
-	 * PBKDF2-HMAC: RFC 2898 key derivation function. Async version.
-	 * @example
-	 * await pbkdf2Async(sha256, 'password', 'salt', { dkLen: 32, c: 500_000 });
-	 */
+	* PBKDF2-HMAC: RFC 2898 key derivation function. Async version.
+	* @example
+	* await pbkdf2Async(sha256, 'password', 'salt', { dkLen: 32, c: 500_000 });
+	*/
 	async function pbkdf2Async(hash, password, salt, opts) {
-	    const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);
-	    let prfW; // Working copy
-	    const arr = new Uint8Array(4);
-	    const view = (0, utils_ts_1.createView)(arr);
-	    const u = new Uint8Array(PRF.outputLen);
-	    // DK = T1 + T2 + ⋯ + Tdklen/hlen
-	    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {
-	        // Ti = F(Password, Salt, c, i)
-	        const Ti = DK.subarray(pos, pos + PRF.outputLen);
-	        view.setInt32(0, ti, false);
-	        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc
-	        // U1 = PRF(Password, Salt + INT_32_BE(i))
-	        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);
-	        Ti.set(u.subarray(0, Ti.length));
-	        await (0, utils_ts_1.asyncLoop)(c - 1, asyncTick, () => {
-	            // Uc = PRF(Password, Uc−1)
-	            PRF._cloneInto(prfW).update(u).digestInto(u);
-	            for (let i = 0; i < Ti.length; i++)
-	                Ti[i] ^= u[i];
-	        });
-	    }
-	    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);
+		const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);
+		let prfW;
+		const arr = new Uint8Array(4);
+		const view = (0, utils_ts_1.createView)(arr);
+		const u = new Uint8Array(PRF.outputLen);
+		for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {
+			const Ti = DK.subarray(pos, pos + PRF.outputLen);
+			view.setInt32(0, ti, false);
+			(prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);
+			Ti.set(u.subarray(0, Ti.length));
+			await (0, utils_ts_1.asyncLoop)(c - 1, asyncTick, () => {
+				PRF._cloneInto(prfW).update(u).digestInto(u);
+				for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];
+			});
+		}
+		return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);
 	}
-	
-	return pbkdf2;
-}
-
-export { sha1 as a, require$$1 as b, require$$2 as c, require$$0 as d, randomBytes as e, abytes as f, concatBytes as g, shake128 as h, isBytes as i, shake256 as j, sha512$1 as k, requirePbkdf2 as l, requireSha512 as m, requireSha256 as n, requireUtils as o, bytesToHex as p, anumber as q, ripemd160 as r, sha256$1 as s, hexToBytes as t, ahash as u, hmac$1 as v };
+}));
+//#endregion
+export { init_sha3 as a, init_legacy as c, sha1 as d, require_utils as i, legacy_exports as l, require_sha512 as n, shake128 as o, require_sha256 as r, shake256 as s, require_pbkdf2 as t, ripemd160 as u };