npm - @babylonlabs-io/ts-sdk - Versions diffs - 0.33.8 → 0.35.0 - Mend

@babylonlabs-io/ts-sdk 0.33.8 → 0.35.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (89) hide show

package/dist/{sha2-6wN58S6R.js.map → sha2-BYVxyZzX.js.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"sha2-6wN58S6R.js","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js"],"sourcesContent":["/*\n Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a) {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/* Asserts something is positive integer. /\nexport function anumber(n, title = '') {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n/* Asserts something is Uint8Array. /\nexport function abytes(value, length, title = '') {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n/* Asserts something is hash /\nexport function ahash(h) {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word, shift) {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word, shift) {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE = / @__PURE__ / (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/* The byte swap operation for uint32 /\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff));\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = / @__PURE__ / (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async () => { };\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/* Merges default options and passed options. /\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher(hashCons, info = {}) {\n const hashC = (msg, opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32) {\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix) => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/\n Internal Merkle-Damgard hash utils.\n * @module\n /\nimport { abytes, aexists, aoutput, clean, createView } from \"./utils.js\";\n/* Choice: a ? b : c /\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/* Majority function, true if any two inputs is true. /\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n/\n Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n /\nexport class HashMD {\n blockLen;\n outputLen;\n padOffset;\n isLE;\n // For partial updates less than block size\n buffer;\n view;\n finished = false;\n length = 0;\n pos = 0;\n destroyed = false;\n constructor(blockLen, outputLen, padOffset, isLE) {\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n view.setBigUint64(blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\|= new this.constructor();\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n clone() {\n return this._cloneInto();\n }\n}\n/*\n Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n /\n/* Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 /\nexport const SHA256_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/* Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 /\nexport const SHA224_IV = / @__PURE__ / Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/* Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 /\nexport const SHA384_IV = / @__PURE__ / Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/* Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 /\nexport const SHA512_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/\n SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n /\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/*\n Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n /\n// prettier-ignore\nconst SHA256_K = / @__PURE__ / Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/* Reusable temporary buffer. \"W\" comes straight from spec. /\nconst SHA256_W = / @__PURE__ / new Uint32Array(64);\n/* Internal 32-byte base SHA2 hash class. /\nclass SHA2_32B extends HashMD {\n constructor(outputLen) {\n super(64, outputLen, 8, false);\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n clean(SHA256_W);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n/* Internal SHA2-256 hash class. /\nexport class _SHA256 extends SHA2_32B {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = SHA256_IV[0] \| 0;\n B = SHA256_IV[1] \| 0;\n C = SHA256_IV[2] \| 0;\n D = SHA256_IV[3] \| 0;\n E = SHA256_IV[4] \| 0;\n F = SHA256_IV[5] \| 0;\n G = SHA256_IV[6] \| 0;\n H = SHA256_IV[7] \| 0;\n constructor() {\n super(32);\n }\n}\n/* Internal SHA2-224 hash class. /\nexport class _SHA224 extends SHA2_32B {\n A = SHA224_IV[0] \| 0;\n B = SHA224_IV[1] \| 0;\n C = SHA224_IV[2] \| 0;\n D = SHA224_IV[3] \| 0;\n E = SHA224_IV[4] \| 0;\n F = SHA224_IV[5] \| 0;\n G = SHA224_IV[6] \| 0;\n H = SHA224_IV[7] \| 0;\n constructor() {\n super(28);\n }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = / @__PURE__ / (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = / @__PURE__ / (() => K512[0])();\nconst SHA512_Kl = / @__PURE__ / (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = / @__PURE__ / new Uint32Array(80);\nconst SHA512_W_L = / @__PURE__ / new Uint32Array(80);\n/* Internal 64-byte base SHA2 hash class. /\nclass SHA2_64B extends HashMD {\n constructor(outputLen) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy() {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\n/* Internal SHA2-512 hash class. /\nexport class _SHA512 extends SHA2_64B {\n Ah = SHA512_IV[0] \| 0;\n Al = SHA512_IV[1] \| 0;\n Bh = SHA512_IV[2] \| 0;\n Bl = SHA512_IV[3] \| 0;\n Ch = SHA512_IV[4] \| 0;\n Cl = SHA512_IV[5] \| 0;\n Dh = SHA512_IV[6] \| 0;\n Dl = SHA512_IV[7] \| 0;\n Eh = SHA512_IV[8] \| 0;\n El = SHA512_IV[9] \| 0;\n Fh = SHA512_IV[10] \| 0;\n Fl = SHA512_IV[11] \| 0;\n Gh = SHA512_IV[12] \| 0;\n Gl = SHA512_IV[13] \| 0;\n Hh = SHA512_IV[14] \| 0;\n Hl = SHA512_IV[15] \| 0;\n constructor() {\n super(64);\n }\n}\n/* Internal SHA2-384 hash class. /\nexport class _SHA384 extends SHA2_64B {\n Ah = SHA384_IV[0] \| 0;\n Al = SHA384_IV[1] \| 0;\n Bh = SHA384_IV[2] \| 0;\n Bl = SHA384_IV[3] \| 0;\n Ch = SHA384_IV[4] \| 0;\n Cl = SHA384_IV[5] \| 0;\n Dh = SHA384_IV[6] \| 0;\n Dl = SHA384_IV[7] \| 0;\n Eh = SHA384_IV[8] \| 0;\n El = SHA384_IV[9] \| 0;\n Fh = SHA384_IV[10] \| 0;\n Fl = SHA384_IV[11] \| 0;\n Gh = SHA384_IV[12] \| 0;\n Gl = SHA384_IV[13] \| 0;\n Hh = SHA384_IV[14] \| 0;\n Hl = SHA384_IV[15] \| 0;\n constructor() {\n super(48);\n }\n}\n/\n Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n /\n/* SHA512/224 IV /\nconst T224_IV = / @__PURE__ / Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/* SHA512/256 IV /\nconst T256_IV = / @__PURE__ / Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/* Internal SHA2-512/224 hash class. /\nexport class _SHA512_224 extends SHA2_64B {\n Ah = T224_IV[0] \| 0;\n Al = T224_IV[1] \| 0;\n Bh = T224_IV[2] \| 0;\n Bl = T224_IV[3] \| 0;\n Ch = T224_IV[4] \| 0;\n Cl = T224_IV[5] \| 0;\n Dh = T224_IV[6] \| 0;\n Dl = T224_IV[7] \| 0;\n Eh = T224_IV[8] \| 0;\n El = T224_IV[9] \| 0;\n Fh = T224_IV[10] \| 0;\n Fl = T224_IV[11] \| 0;\n Gh = T224_IV[12] \| 0;\n Gl = T224_IV[13] \| 0;\n Hh = T224_IV[14] \| 0;\n Hl = T224_IV[15] \| 0;\n constructor() {\n super(28);\n }\n}\n/* Internal SHA2-512/256 hash class. /\nexport class _SHA512_256 extends SHA2_64B {\n Ah = T256_IV[0] \| 0;\n Al = T256_IV[1] \| 0;\n Bh = T256_IV[2] \| 0;\n Bl = T256_IV[3] \| 0;\n Ch = T256_IV[4] \| 0;\n Cl = T256_IV[5] \| 0;\n Dh = T256_IV[6] \| 0;\n Dl = T256_IV[7] \| 0;\n Eh = T256_IV[8] \| 0;\n El = T256_IV[9] \| 0;\n Fh = T256_IV[10] \| 0;\n Fl = T256_IV[11] \| 0;\n Gh = T256_IV[12] \| 0;\n Gl = T256_IV[13] \| 0;\n Hh = T256_IV[14] \| 0;\n Hl = T256_IV[15] \| 0;\n constructor() {\n super(32);\n }\n}\n/\n SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n \n - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n /\nexport const sha256 = / @__PURE__ / createHasher(() => new _SHA256(), \n/ @__PURE__ / oidNist(0x01));\n/* SHA2-224 hash function from RFC 4634 /\nexport const sha224 = / @__PURE__ / createHasher(() => new _SHA224(), \n/ @__PURE__ / oidNist(0x04));\n/* SHA2-512 hash function from RFC 4634. /\nexport const sha512 = / @__PURE__ / createHasher(() => new _SHA512(), \n/ @__PURE__ / oidNist(0x03));\n/* SHA2-384 hash function from RFC 4634. /\nexport const sha384 = / @__PURE__ / createHasher(() => new _SHA384(), \n/ @__PURE__ / oidNist(0x02));\n/\n SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_256 = / @__PURE__ / createHasher(() => new _SHA512_256(), \n/ @__PURE__ / oidNist(0x06));\n/\n SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_224 = / @__PURE__ / createHasher(() => new _SHA512_224(), \n/ @__PURE__ */ oidNist(0x05));\n//# sourceMappingURL=sha2.js.map"],"names":["isBytes","a","anumber","n","title","prefix","abytes","value","length","bytes","len","needsLen","ofLen","got","ahash","h","aexists","instance","checkFinished","aoutput","out","min","u32","arr","clean","arrays","i","createView","rotr","word","shift","rotl","isLE","byteSwap","byteSwap32","swap32IfBE","u","createHasher","hashCons","info","hashC","msg","opts","tmp","oidNist","suffix","Chi","b","c","Maj","HashMD","blockLen","outputLen","padOffset","__publicField","data","view","buffer","pos","take","dataView","oview","outLen","state","res","to","finished","destroyed","SHA256_IV","SHA256_K","SHA256_W","SHA2_32B","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","_SHA256","sha256"],"mappings":";;;AAMO,SAASA,EAAQC,GAAG;AACvB,SAAOA,aAAa,cAAe,YAAY,OAAOA,CAAC,KAAKA,EAAE,YAAY,SAAS;AACvF;AAEO,SAASC,EAAQC,GAAGC,IAAQ,IAAI;AACnC,MAAI,CAAC,OAAO,cAAcD,CAAC,KAAKA,IAAI,GAAG;AACnC,UAAME,IAASD,KAAS,IAAIA,CAAK;AACjC,UAAM,IAAI,MAAM,GAAGC,CAAM,8BAA8BF,CAAC,EAAE;AAAA,EAC9D;AACJ;AAEO,SAASG,EAAOC,GAAOC,GAAQJ,IAAQ,IAAI;AAC9C,QAAMK,IAAQT,EAAQO,CAAK,GACrBG,IAAMH,KAAA,gBAAAA,EAAO,QACbI,IAAWH,MAAW;AAC5B,MAAI,CAACC,KAAUE,KAAYD,MAAQF,GAAS;AACxC,UAAMH,IAASD,KAAS,IAAIA,CAAK,MAC3BQ,IAAQD,IAAW,cAAcH,CAAM,KAAK,IAC5CK,IAAMJ,IAAQ,UAAUC,CAAG,KAAK,QAAQ,OAAOH,CAAK;AAC1D,UAAM,IAAI,MAAMF,IAAS,wBAAwBO,IAAQ,WAAWC,CAAG;AAAA,EAC3E;AACA,SAAON;AACX;AAEO,SAASO,EAAMC,GAAG;AACrB,MAAI,OAAOA,KAAM,cAAc,OAAOA,EAAE,UAAW;AAC/C,UAAM,IAAI,MAAM,yCAAyC;AAC7D,EAAAb,EAAQa,EAAE,SAAS,GACnBb,EAAQa,EAAE,QAAQ;AACtB;AAEO,SAASC,EAAQC,GAAUC,IAAgB,IAAM;AACpD,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AAEO,SAASE,EAAQC,GAAKH,GAAU;AACnC,EAAAX,EAAOc,GAAK,QAAW,qBAAqB;AAC5C,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,sDAAsDA,CAAG;AAEjF;AAMO,SAASC,EAAIC,GAAK;AACrB,SAAO,IAAI,YAAYA,EAAI,QAAQA,EAAI,YAAY,KAAK,MAAMA,EAAI,aAAa,CAAC,CAAC;AACrF;AAEO,SAASC,KAASC,GAAQ;AAC7B,WAASC,IAAI,GAAGA,IAAID,EAAO,QAAQC;AAC/B,IAAAD,EAAOC,CAAC,EAAE,KAAK,CAAC;AAExB;AAEO,SAASC,EAAWJ,GAAK;AAC5B,SAAO,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU;AAClE;AAEO,SAASK,EAAKC,GAAMC,GAAO;AAC9B,SAAQD,KAAS,KAAKC,IAAWD,MAASC;AAC9C;AAEO,SAASC,EAAKF,GAAMC,GAAO;AAC9B,SAAQD,KAAQC,IAAWD,MAAU,KAAKC,MAAY;AAC1D;AAEO,MAAME,IAA8B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAEhG,SAASC,EAASJ,GAAM;AAC3B,SAAUA,KAAQ,KAAM,aAClBA,KAAQ,IAAK,WACbA,MAAS,IAAK,QACdA,MAAS,KAAM;AACzB;AAMO,SAASK,EAAWX,GAAK;AAC5B,WAASG,IAAI,GAAGA,IAAIH,EAAI,QAAQG;AAC5B,IAAAH,EAAIG,CAAC,IAAIO,EAASV,EAAIG,CAAC,CAAC;AAE5B,SAAOH;AACX;AACY,MAACY,IAAaH,IACpB,CAACI,MAAMA,IACPF;AA0HC,SAASG,EAAaC,GAAUC,IAAO,IAAI;AAC9C,QAAMC,IAAQ,CAACC,GAAKC,MAASJ,EAASI,CAAI,EAAE,OAAOD,CAAG,EAAE,OAAM,GACxDE,IAAML,EAAS,MAAS;AAC9B,SAAAE,EAAM,YAAYG,EAAI,WACtBH,EAAM,WAAWG,EAAI,UACrBH,EAAM,SAAS,CAACE,MAASJ,EAASI,CAAI,GACtC,OAAO,OAAOF,GAAOD,CAAI,GAClB,OAAO,OAAOC,CAAK;AAC9B;AASO,MAAMI,IAAU,CAACC,OAAY;AAAA,EAChC,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAMA,CAAM,CAAC;AAC7F;AC1OO,SAASC,EAAI7C,GAAG8C,GAAGC,GAAG;AACzB,SAAQ/C,IAAI8C,IAAM,CAAC9C,IAAI+C;AAC3B;AAEO,SAASC,EAAIhD,GAAG8C,GAAGC,GAAG;AACzB,SAAQ/C,IAAI8C,IAAM9C,IAAI+C,IAAMD,IAAIC;AACpC;AAKO,MAAME,EAAO;AAAA,EAYhB,YAAYC,GAAUC,GAAWC,GAAWrB,GAAM;AAXlD,IAAAsB,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAEA;AAAA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA,aAAM;AACN,IAAAA,EAAA,mBAAY;AAER,SAAK,WAAWH,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOrB,GACZ,KAAK,SAAS,IAAI,WAAWmB,CAAQ,GACrC,KAAK,OAAOxB,EAAW,KAAK,MAAM;AAAA,EACtC;AAAA,EACA,OAAO4B,GAAM;AACT,IAAAvC,EAAQ,IAAI,GACZV,EAAOiD,CAAI;AACX,UAAM,EAAE,MAAAC,GAAM,QAAAC,GAAQ,UAAAN,EAAQ,IAAK,MAC7BzC,IAAM6C,EAAK;AACjB,aAASG,IAAM,GAAGA,IAAMhD,KAAM;AAC1B,YAAMiD,IAAO,KAAK,IAAIR,IAAW,KAAK,KAAKzC,IAAMgD,CAAG;AAEpD,UAAIC,MAASR,GAAU;AACnB,cAAMS,IAAWjC,EAAW4B,CAAI;AAChC,eAAOJ,KAAYzC,IAAMgD,GAAKA,KAAOP;AACjC,eAAK,QAAQS,GAAUF,CAAG;AAC9B;AAAA,MACJ;AACA,MAAAD,EAAO,IAAIF,EAAK,SAASG,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQR,MACb,KAAK,QAAQK,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEnB;AACA,gBAAK,UAAUD,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACX;AAAA,EACA,WAAWnC,GAAK;AACZ,IAAAJ,EAAQ,IAAI,GACZG,EAAQC,GAAK,IAAI,GACjB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAqC,GAAQ,MAAAD,GAAM,UAAAL,GAAU,MAAAnB,EAAI,IAAK;AACzC,QAAI,EAAE,KAAA0B,EAAG,IAAK;AAEd,IAAAD,EAAOC,GAAK,IAAI,KAChBlC,EAAM,KAAK,OAAO,SAASkC,CAAG,CAAC,GAG3B,KAAK,YAAYP,IAAWO,MAC5B,KAAK,QAAQF,GAAM,CAAC,GACpBE,IAAM;AAGV,aAAShC,IAAIgC,GAAKhC,IAAIyB,GAAUzB;AAC5B,MAAA+B,EAAO/B,CAAC,IAAI;AAIhB,IAAA8B,EAAK,aAAaL,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGnB,CAAI,GAC7D,KAAK,QAAQwB,GAAM,CAAC;AACpB,UAAMK,IAAQlC,EAAWP,CAAG,GACtBV,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,2CAA2C;AAC/D,UAAMoD,IAASpD,IAAM,GACfqD,IAAQ,KAAK,IAAG;AACtB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAASrC,IAAI,GAAGA,IAAIoC,GAAQpC;AACxB,MAAAmC,EAAM,UAAU,IAAInC,GAAGqC,EAAMrC,CAAC,GAAGM,CAAI;AAAA,EAC7C;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAAyB,GAAQ,WAAAL,EAAS,IAAK;AAC9B,SAAK,WAAWK,CAAM;AACtB,UAAMO,IAAMP,EAAO,MAAM,GAAGL,CAAS;AACrC,gBAAK,QAAO,GACLY;AAAA,EACX;AAAA,EACA,WAAWC,GAAI;AACX,IAAAA,UAAO,IAAI,KAAK,YAAW,IAC3BA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAAd,GAAU,QAAAM,GAAQ,QAAAjD,GAAQ,UAAA0D,GAAU,WAAAC,GAAW,KAAAT,EAAG,IAAK;AAC/D,WAAAO,EAAG,YAAYE,GACfF,EAAG,WAAWC,GACdD,EAAG,SAASzD,GACZyD,EAAG,MAAMP,GACLlD,IAAS2C,KACTc,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAU;AAAA,EAC1B;AACJ;AAMO,MAAMG,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GCpHKC,IAA2B,4BAAY,KAAK;AAAA,EAC9C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEKC,IAA2B,oBAAI,YAAY,EAAE;AAEnD,MAAMC,UAAiBrB,EAAO;AAAA,EAC1B,YAAYE,GAAW;AACnB,UAAM,IAAIA,GAAW,GAAG,EAAK;AAAA,EACjC;AAAA,EACA,MAAM;AACF,UAAM,EAAE,GAAAoB,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA;AAAA,EAEA,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EACjB;AAAA,EACA,QAAQvB,GAAMwB,GAAQ;AAElB,aAAStD,IAAI,GAAGA,IAAI,IAAIA,KAAKsD,KAAU;AACnC,MAAAV,EAAS5C,CAAC,IAAI8B,EAAK,UAAUwB,GAAQ,EAAK;AAC9C,aAAStD,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMuD,IAAMX,EAAS5C,IAAI,EAAE,GACrBwD,IAAKZ,EAAS5C,IAAI,CAAC,GACnByD,IAAKvD,EAAKqD,GAAK,CAAC,IAAIrD,EAAKqD,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAKxD,EAAKsD,GAAI,EAAE,IAAItD,EAAKsD,GAAI,EAAE,IAAKA,MAAO;AACjD,MAAAZ,EAAS5C,CAAC,IAAK0D,IAAKd,EAAS5C,IAAI,CAAC,IAAIyD,IAAKb,EAAS5C,IAAI,EAAE,IAAK;AAAA,IACnE;AAEA,QAAI,EAAE,GAAA8C,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACjC,aAASrD,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAM2D,IAASzD,EAAKgD,GAAG,CAAC,IAAIhD,EAAKgD,GAAG,EAAE,IAAIhD,EAAKgD,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASvC,EAAI8B,GAAGC,GAAGC,CAAC,IAAIT,EAAS3C,CAAC,IAAI4C,EAAS5C,CAAC,IAAK,GAE/D6D,KADS3D,EAAK4C,GAAG,CAAC,IAAI5C,EAAK4C,GAAG,EAAE,IAAI5C,EAAK4C,GAAG,EAAE,KAC/BvB,EAAIuB,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACpB;AAEA,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACnC;AAAA,EACA,aAAa;AACT,IAAAvD,EAAM8C,CAAQ;AAAA,EAClB;AAAA,EACA,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B9C,EAAM,KAAK,MAAM;AAAA,EACrB;AACJ;AAEO,MAAMgE,UAAgBjB,EAAS;AAAA,EAWlC,cAAc;AACV,UAAM,EAAE;AATZ;AAAA;AAAA,IAAAjB,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AAAA,EAGnB;AACJ;AAyQY,MAACqB,IAAyB,gBAAApD;AAAA,EAAa,MAAM,IAAImD,EAAO;AAAA,EACpD,gBAAA5C,EAAQ,CAAI;AAAC;","x_google_ignoreList":[0,1,2]}
1	+ {"version":3,"file":"sha2-BYVxyZzX.js","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js"],"sourcesContent":["/*\n Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a) {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/* Asserts something is positive integer. /\nexport function anumber(n, title = '') {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n/* Asserts something is Uint8Array. /\nexport function abytes(value, length, title = '') {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n/* Asserts something is hash /\nexport function ahash(h) {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word, shift) {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word, shift) {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE = / @__PURE__ / (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/* The byte swap operation for uint32 /\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff));\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = / @__PURE__ / (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async () => { };\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/* Merges default options and passed options. /\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher(hashCons, info = {}) {\n const hashC = (msg, opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32) {\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix) => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/\n Internal Merkle-Damgard hash utils.\n * @module\n /\nimport { abytes, aexists, aoutput, clean, createView } from \"./utils.js\";\n/* Choice: a ? b : c /\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/* Majority function, true if any two inputs is true. /\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n/\n Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n /\nexport class HashMD {\n blockLen;\n outputLen;\n padOffset;\n isLE;\n // For partial updates less than block size\n buffer;\n view;\n finished = false;\n length = 0;\n pos = 0;\n destroyed = false;\n constructor(blockLen, outputLen, padOffset, isLE) {\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n view.setBigUint64(blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\|= new this.constructor();\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n clone() {\n return this._cloneInto();\n }\n}\n/*\n Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n /\n/* Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 /\nexport const SHA256_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/* Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 /\nexport const SHA224_IV = / @__PURE__ / Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/* Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 /\nexport const SHA384_IV = / @__PURE__ / Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/* Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 /\nexport const SHA512_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/\n SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n /\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/*\n Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n /\n// prettier-ignore\nconst SHA256_K = / @__PURE__ / Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/* Reusable temporary buffer. \"W\" comes straight from spec. /\nconst SHA256_W = / @__PURE__ / new Uint32Array(64);\n/* Internal 32-byte base SHA2 hash class. /\nclass SHA2_32B extends HashMD {\n constructor(outputLen) {\n super(64, outputLen, 8, false);\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n clean(SHA256_W);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n/* Internal SHA2-256 hash class. /\nexport class _SHA256 extends SHA2_32B {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = SHA256_IV[0] \| 0;\n B = SHA256_IV[1] \| 0;\n C = SHA256_IV[2] \| 0;\n D = SHA256_IV[3] \| 0;\n E = SHA256_IV[4] \| 0;\n F = SHA256_IV[5] \| 0;\n G = SHA256_IV[6] \| 0;\n H = SHA256_IV[7] \| 0;\n constructor() {\n super(32);\n }\n}\n/* Internal SHA2-224 hash class. /\nexport class _SHA224 extends SHA2_32B {\n A = SHA224_IV[0] \| 0;\n B = SHA224_IV[1] \| 0;\n C = SHA224_IV[2] \| 0;\n D = SHA224_IV[3] \| 0;\n E = SHA224_IV[4] \| 0;\n F = SHA224_IV[5] \| 0;\n G = SHA224_IV[6] \| 0;\n H = SHA224_IV[7] \| 0;\n constructor() {\n super(28);\n }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = / @__PURE__ / (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = / @__PURE__ / (() => K512[0])();\nconst SHA512_Kl = / @__PURE__ / (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = / @__PURE__ / new Uint32Array(80);\nconst SHA512_W_L = / @__PURE__ / new Uint32Array(80);\n/* Internal 64-byte base SHA2 hash class. /\nclass SHA2_64B extends HashMD {\n constructor(outputLen) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy() {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\n/* Internal SHA2-512 hash class. /\nexport class _SHA512 extends SHA2_64B {\n Ah = SHA512_IV[0] \| 0;\n Al = SHA512_IV[1] \| 0;\n Bh = SHA512_IV[2] \| 0;\n Bl = SHA512_IV[3] \| 0;\n Ch = SHA512_IV[4] \| 0;\n Cl = SHA512_IV[5] \| 0;\n Dh = SHA512_IV[6] \| 0;\n Dl = SHA512_IV[7] \| 0;\n Eh = SHA512_IV[8] \| 0;\n El = SHA512_IV[9] \| 0;\n Fh = SHA512_IV[10] \| 0;\n Fl = SHA512_IV[11] \| 0;\n Gh = SHA512_IV[12] \| 0;\n Gl = SHA512_IV[13] \| 0;\n Hh = SHA512_IV[14] \| 0;\n Hl = SHA512_IV[15] \| 0;\n constructor() {\n super(64);\n }\n}\n/* Internal SHA2-384 hash class. /\nexport class _SHA384 extends SHA2_64B {\n Ah = SHA384_IV[0] \| 0;\n Al = SHA384_IV[1] \| 0;\n Bh = SHA384_IV[2] \| 0;\n Bl = SHA384_IV[3] \| 0;\n Ch = SHA384_IV[4] \| 0;\n Cl = SHA384_IV[5] \| 0;\n Dh = SHA384_IV[6] \| 0;\n Dl = SHA384_IV[7] \| 0;\n Eh = SHA384_IV[8] \| 0;\n El = SHA384_IV[9] \| 0;\n Fh = SHA384_IV[10] \| 0;\n Fl = SHA384_IV[11] \| 0;\n Gh = SHA384_IV[12] \| 0;\n Gl = SHA384_IV[13] \| 0;\n Hh = SHA384_IV[14] \| 0;\n Hl = SHA384_IV[15] \| 0;\n constructor() {\n super(48);\n }\n}\n/\n Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n /\n/* SHA512/224 IV /\nconst T224_IV = / @__PURE__ / Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/* SHA512/256 IV /\nconst T256_IV = / @__PURE__ / Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/* Internal SHA2-512/224 hash class. /\nexport class _SHA512_224 extends SHA2_64B {\n Ah = T224_IV[0] \| 0;\n Al = T224_IV[1] \| 0;\n Bh = T224_IV[2] \| 0;\n Bl = T224_IV[3] \| 0;\n Ch = T224_IV[4] \| 0;\n Cl = T224_IV[5] \| 0;\n Dh = T224_IV[6] \| 0;\n Dl = T224_IV[7] \| 0;\n Eh = T224_IV[8] \| 0;\n El = T224_IV[9] \| 0;\n Fh = T224_IV[10] \| 0;\n Fl = T224_IV[11] \| 0;\n Gh = T224_IV[12] \| 0;\n Gl = T224_IV[13] \| 0;\n Hh = T224_IV[14] \| 0;\n Hl = T224_IV[15] \| 0;\n constructor() {\n super(28);\n }\n}\n/* Internal SHA2-512/256 hash class. /\nexport class _SHA512_256 extends SHA2_64B {\n Ah = T256_IV[0] \| 0;\n Al = T256_IV[1] \| 0;\n Bh = T256_IV[2] \| 0;\n Bl = T256_IV[3] \| 0;\n Ch = T256_IV[4] \| 0;\n Cl = T256_IV[5] \| 0;\n Dh = T256_IV[6] \| 0;\n Dl = T256_IV[7] \| 0;\n Eh = T256_IV[8] \| 0;\n El = T256_IV[9] \| 0;\n Fh = T256_IV[10] \| 0;\n Fl = T256_IV[11] \| 0;\n Gh = T256_IV[12] \| 0;\n Gl = T256_IV[13] \| 0;\n Hh = T256_IV[14] \| 0;\n Hl = T256_IV[15] \| 0;\n constructor() {\n super(32);\n }\n}\n/\n SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n \n - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n /\nexport const sha256 = / @__PURE__ / createHasher(() => new _SHA256(), \n/ @__PURE__ / oidNist(0x01));\n/* SHA2-224 hash function from RFC 4634 /\nexport const sha224 = / @__PURE__ / createHasher(() => new _SHA224(), \n/ @__PURE__ / oidNist(0x04));\n/* SHA2-512 hash function from RFC 4634. /\nexport const sha512 = / @__PURE__ / createHasher(() => new _SHA512(), \n/ @__PURE__ / oidNist(0x03));\n/* SHA2-384 hash function from RFC 4634. /\nexport const sha384 = / @__PURE__ / createHasher(() => new _SHA384(), \n/ @__PURE__ / oidNist(0x02));\n/\n SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_256 = / @__PURE__ / createHasher(() => new _SHA512_256(), \n/ @__PURE__ / oidNist(0x06));\n/\n SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_224 = / @__PURE__ / createHasher(() => new _SHA512_224(), \n/ @__PURE__ */ oidNist(0x05));\n//# sourceMappingURL=sha2.js.map"],"names":["isBytes","a","anumber","n","title","prefix","abytes","value","length","bytes","len","ofLen","got","aexists","instance","checkFinished","aoutput","out","min","u32","arr","clean","arrays","i","createView","rotr","word","shift","rotl","isLE","byteSwap","byteSwap32","swap32IfBE","u","createHasher","hashCons","info","hashC","msg","opts","tmp","oidNist","suffix","Chi","b","c","Maj","HashMD","blockLen","outputLen","padOffset","__publicField","data","view","buffer","pos","take","dataView","oview","outLen","state","res","to","finished","destroyed","SHA256_IV","SHA256_K","SHA256_W","SHA2_32B","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","_SHA256","sha256"],"mappings":";;;AAMO,SAASA,EAAQC,GAAG;AACvB,SAAOA,aAAa,cAAe,YAAY,OAAOA,CAAC,KAAKA,EAAE,YAAY,SAAS;AACvF;AAEO,SAASC,EAAQC,GAAGC,IAAQ,IAAI;AACnC,MAAI,CAAC,OAAO,cAAcD,CAAC,KAAKA,IAAI,GAAG;AACnC,UAAME,IAASD,KAAS,IAAIA,CAAK;AACjC,UAAM,IAAI,MAAM,GAAGC,CAAM,8BAA8BF,CAAC,EAAE;AAAA,EAC9D;AACJ;AAEO,SAASG,EAAOC,GAAOC,GAAQJ,IAAQ,IAAI;AAC9C,QAAMK,IAAQT,EAAQO,CAAK,GACrBG,IAAMH,KAAA,gBAAAA,EAAO;AAEnB,MAAI,CAACE,KADYD,MAAW,QACgB;AACxC,UAAMH,IAASD,KAAS,IAAIA,CAAK,MAC3BO,IAA4C,IAC5CC,IAAMH,IAAQ,UAAUC,CAAG,KAAK,QAAQ,OAAOH,CAAK;AAC1D,UAAM,IAAI,MAAMF,IAAS,wBAAwBM,IAAQ,WAAWC,CAAG;AAAA,EAC3E;AACA,SAAOL;AACX;AASO,SAASM,EAAQC,GAAUC,IAAgB,IAAM;AACpD,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AAEO,SAASE,EAAQC,GAAKH,GAAU;AACnC,EAAAR,EAAOW,GAAK,QAAW,qBAAqB;AAC5C,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,sDAAsDA,CAAG;AAEjF;AAMO,SAASC,EAAIC,GAAK;AACrB,SAAO,IAAI,YAAYA,EAAI,QAAQA,EAAI,YAAY,KAAK,MAAMA,EAAI,aAAa,CAAC,CAAC;AACrF;AAEO,SAASC,KAASC,GAAQ;AAC7B,WAASC,IAAI,GAAGA,IAAID,EAAO,QAAQC;AAC/B,IAAAD,EAAOC,CAAC,EAAE,KAAK,CAAC;AAExB;AAEO,SAASC,EAAWJ,GAAK;AAC5B,SAAO,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU;AAClE;AAEO,SAASK,EAAKC,GAAMC,GAAO;AAC9B,SAAQD,KAAS,KAAKC,IAAWD,MAASC;AAC9C;AAEO,SAASC,EAAKF,GAAMC,GAAO;AAC9B,SAAQD,KAAQC,IAAWD,MAAU,KAAKC,MAAY;AAC1D;AAEO,MAAME,IAA8B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAEhG,SAASC,EAASJ,GAAM;AAC3B,SAAUA,KAAQ,KAAM,aAClBA,KAAQ,IAAK,WACbA,MAAS,IAAK,QACdA,MAAS,KAAM;AACzB;AAMO,SAASK,EAAWX,GAAK;AAC5B,WAASG,IAAI,GAAGA,IAAIH,EAAI,QAAQG;AAC5B,IAAAH,EAAIG,CAAC,IAAIO,EAASV,EAAIG,CAAC,CAAC;AAE5B,SAAOH;AACX;AACY,MAACY,IAAaH,IACpB,CAACI,MAAMA,IACPF;AA0HC,SAASG,EAAaC,GAAUC,IAAO,IAAI;AAC9C,QAAMC,IAAQ,CAACC,GAAKC,MAASJ,EAASI,CAAI,EAAE,OAAOD,CAAG,EAAE,OAAM,GACxDE,IAAML,EAAS,MAAS;AAC9B,SAAAE,EAAM,YAAYG,EAAI,WACtBH,EAAM,WAAWG,EAAI,UACrBH,EAAM,SAAS,CAACE,MAASJ,EAASI,CAAI,GACtC,OAAO,OAAOF,GAAOD,CAAI,GAClB,OAAO,OAAOC,CAAK;AAC9B;AASO,MAAMI,IAAU,CAACC,OAAY;AAAA,EAChC,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAMA,CAAM,CAAC;AAC7F;AC1OO,SAASC,EAAI1C,GAAG2C,GAAGC,GAAG;AACzB,SAAQ5C,IAAI2C,IAAM,CAAC3C,IAAI4C;AAC3B;AAEO,SAASC,EAAI7C,GAAG2C,GAAGC,GAAG;AACzB,SAAQ5C,IAAI2C,IAAM3C,IAAI4C,IAAMD,IAAIC;AACpC;AAKO,MAAME,EAAO;AAAA,EAYhB,YAAYC,GAAUC,GAAWC,GAAWrB,GAAM;AAXlD,IAAAsB,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAEA;AAAA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,kBAAW;AACX,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA,aAAM;AACN,IAAAA,EAAA,mBAAY;AAER,SAAK,WAAWH,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOrB,GACZ,KAAK,SAAS,IAAI,WAAWmB,CAAQ,GACrC,KAAK,OAAOxB,EAAW,KAAK,MAAM;AAAA,EACtC;AAAA,EACA,OAAO4B,GAAM;AACT,IAAAvC,EAAQ,IAAI,GACZP,EAAO8C,CAAI;AACX,UAAM,EAAE,MAAAC,GAAM,QAAAC,GAAQ,UAAAN,EAAQ,IAAK,MAC7BtC,IAAM0C,EAAK;AACjB,aAASG,IAAM,GAAGA,IAAM7C,KAAM;AAC1B,YAAM8C,IAAO,KAAK,IAAIR,IAAW,KAAK,KAAKtC,IAAM6C,CAAG;AAEpD,UAAIC,MAASR,GAAU;AACnB,cAAMS,IAAWjC,EAAW4B,CAAI;AAChC,eAAOJ,KAAYtC,IAAM6C,GAAKA,KAAOP;AACjC,eAAK,QAAQS,GAAUF,CAAG;AAC9B;AAAA,MACJ;AACA,MAAAD,EAAO,IAAIF,EAAK,SAASG,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQR,MACb,KAAK,QAAQK,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEnB;AACA,gBAAK,UAAUD,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACX;AAAA,EACA,WAAWnC,GAAK;AACZ,IAAAJ,EAAQ,IAAI,GACZG,EAAQC,GAAK,IAAI,GACjB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAqC,GAAQ,MAAAD,GAAM,UAAAL,GAAU,MAAAnB,EAAI,IAAK;AACzC,QAAI,EAAE,KAAA0B,EAAG,IAAK;AAEd,IAAAD,EAAOC,GAAK,IAAI,KAChBlC,EAAM,KAAK,OAAO,SAASkC,CAAG,CAAC,GAG3B,KAAK,YAAYP,IAAWO,MAC5B,KAAK,QAAQF,GAAM,CAAC,GACpBE,IAAM;AAGV,aAAShC,IAAIgC,GAAKhC,IAAIyB,GAAUzB;AAC5B,MAAA+B,EAAO/B,CAAC,IAAI;AAIhB,IAAA8B,EAAK,aAAaL,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGnB,CAAI,GAC7D,KAAK,QAAQwB,GAAM,CAAC;AACpB,UAAMK,IAAQlC,EAAWP,CAAG,GACtBP,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,2CAA2C;AAC/D,UAAMiD,IAASjD,IAAM,GACfkD,IAAQ,KAAK,IAAG;AACtB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAASrC,IAAI,GAAGA,IAAIoC,GAAQpC;AACxB,MAAAmC,EAAM,UAAU,IAAInC,GAAGqC,EAAMrC,CAAC,GAAGM,CAAI;AAAA,EAC7C;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAAyB,GAAQ,WAAAL,EAAS,IAAK;AAC9B,SAAK,WAAWK,CAAM;AACtB,UAAMO,IAAMP,EAAO,MAAM,GAAGL,CAAS;AACrC,gBAAK,QAAO,GACLY;AAAA,EACX;AAAA,EACA,WAAWC,GAAI;AACX,IAAAA,UAAO,IAAI,KAAK,YAAW,IAC3BA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAAd,GAAU,QAAAM,GAAQ,QAAA9C,GAAQ,UAAAuD,GAAU,WAAAC,GAAW,KAAAT,EAAG,IAAK;AAC/D,WAAAO,EAAG,YAAYE,GACfF,EAAG,WAAWC,GACdD,EAAG,SAAStD,GACZsD,EAAG,MAAMP,GACL/C,IAASwC,KACTc,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAU;AAAA,EAC1B;AACJ;AAMO,MAAMG,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GCpHKC,IAA2B,4BAAY,KAAK;AAAA,EAC9C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEKC,IAA2B,oBAAI,YAAY,EAAE;AAEnD,MAAMC,UAAiBrB,EAAO;AAAA,EAC1B,YAAYE,GAAW;AACnB,UAAM,IAAIA,GAAW,GAAG,EAAK;AAAA,EACjC;AAAA,EACA,MAAM;AACF,UAAM,EAAE,GAAAoB,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA;AAAA,EAEA,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EACjB;AAAA,EACA,QAAQvB,GAAMwB,GAAQ;AAElB,aAAStD,IAAI,GAAGA,IAAI,IAAIA,KAAKsD,KAAU;AACnC,MAAAV,EAAS5C,CAAC,IAAI8B,EAAK,UAAUwB,GAAQ,EAAK;AAC9C,aAAStD,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMuD,IAAMX,EAAS5C,IAAI,EAAE,GACrBwD,IAAKZ,EAAS5C,IAAI,CAAC,GACnByD,IAAKvD,EAAKqD,GAAK,CAAC,IAAIrD,EAAKqD,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAKxD,EAAKsD,GAAI,EAAE,IAAItD,EAAKsD,GAAI,EAAE,IAAKA,MAAO;AACjD,MAAAZ,EAAS5C,CAAC,IAAK0D,IAAKd,EAAS5C,IAAI,CAAC,IAAIyD,IAAKb,EAAS5C,IAAI,EAAE,IAAK;AAAA,IACnE;AAEA,QAAI,EAAE,GAAA8C,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACjC,aAASrD,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAM2D,IAASzD,EAAKgD,GAAG,CAAC,IAAIhD,EAAKgD,GAAG,EAAE,IAAIhD,EAAKgD,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASvC,EAAI8B,GAAGC,GAAGC,CAAC,IAAIT,EAAS3C,CAAC,IAAI4C,EAAS5C,CAAC,IAAK,GAE/D6D,KADS3D,EAAK4C,GAAG,CAAC,IAAI5C,EAAK4C,GAAG,EAAE,IAAI5C,EAAK4C,GAAG,EAAE,KAC/BvB,EAAIuB,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACpB;AAEA,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACnC;AAAA,EACA,aAAa;AACT,IAAAvD,EAAM8C,CAAQ;AAAA,EAClB;AAAA,EACA,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B9C,EAAM,KAAK,MAAM;AAAA,EACrB;AACJ;AAEO,MAAMgE,UAAgBjB,EAAS;AAAA,EAWlC,cAAc;AACV,UAAM,EAAE;AATZ;AAAA;AAAA,IAAAjB,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AACnB,IAAAd,EAAA,WAAIc,EAAU,CAAC,IAAI;AAAA,EAGnB;AACJ;AAyQY,MAACqB,IAAyB,gBAAApD;AAAA,EAAa,MAAM,IAAImD,EAAO;AAAA,EACpD,gBAAA5C,EAAQ,CAAI;AAAC;","x_google_ignoreList":[0,1,2]}

package/dist/sha2-DsrLC4NM.cjs ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";var I=Object.defineProperty;var _=(e,t,s)=>t in e?I(e,t,{enumerable:!0,configurable:!0,writable:!0,value:s}):e[t]=s;var h=(e,t,s)=>_(e,typeof t!="symbol"?t+"":t,s);function D(e){return e instanceof Uint8Array\|\|ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function S(e,t=""){if(!Number.isSafeInteger(e)\|\|e<0){const s=t&&`"${t}" `;throw new Error(`${s}expected integer >= 0, got ${e}`)}}function E(e,t,s=""){const n=D(e),i=e==null?void 0:e.length;if(!n\|\|t!==void 0){const r=s&&`"${s}" `,c="",x=n?`length=${i}`:`type=${typeof e}`;throw new Error(r+"expected Uint8Array"+c+", got "+x)}return e}function A(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function m(e,t){E(e,void 0,"digestInto() output");const s=t.outputLen;if(e.length<s)throw new Error('"digestInto() output" expected to be of length >='+s)}function k(e){return new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4))}function y(...e){for(let t=0;t<e.length;t++)e[t].fill(0)}function L(e){return new DataView(e.buffer,e.byteOffset,e.byteLength)}function a(e,t){return e<<32-t\|e>>>t}function C(e,t){return e<<t\|e>>>32-t>>>0}const O=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function $(e){return e<<24&4278190080\|e<<8&16711680\|e>>>8&65280\|e>>>24&255}function F(e){for(let t=0;t<e.length;t++)e[t]=$(e[t]);return e}const G=O?e=>e:F;function U(e,t={}){const s=(i,f)=>e(f).update(i).digest(),n=e(void 0);return s.outputLen=n.outputLen,s.blockLen=n.blockLen,s.create=i=>e(i),Object.assign(s,t),Object.freeze(s)}const M=e=>({oid:Uint8Array.from([6,9,96,134,72,1,101,3,4,2,e])});function V(e,t,s){return e&t^~e&s}function j(e,t,s){return e&t^e&s^t&s}class B{constructor(t,s,n,i){h(this,"blockLen");h(this,"outputLen");h(this,"padOffset");h(this,"isLE");h(this,"buffer");h(this,"view");h(this,"finished",!1);h(this,"length",0);h(this,"pos",0);h(this,"destroyed",!1);this.blockLen=t,this.outputLen=s,this.padOffset=n,this.isLE=i,this.buffer=new Uint8Array(t),this.view=L(this.buffer)}update(t){A(this),E(t);const{view:s,buffer:n,blockLen:i}=this,f=t.length;for(let r=0;r<f;){const c=Math.min(i-this.pos,f-r);if(c===i){const x=L(t);for(;i<=f-r;r+=i)this.process(x,r);continue}n.set(t.subarray(r,r+c),this.pos),this.pos+=c,r+=c,this.pos===i&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){A(this),m(t,this),this.finished=!0;const{buffer:s,view:n,blockLen:i,isLE:f}=this;let{pos:r}=this;s[r++]=128,y(this.buffer.subarray(r)),this.padOffset>i-r&&(this.process(n,0),r=0);for(let o=r;o<i;o++)s[o]=0;n.setBigUint64(i-8,BigInt(this.length8),f),this.process(n,0);const c=L(t),x=this.outputLen;if(x%4)throw new Error("_sha2: outputLen must be aligned to 32bit");const u=x/4,b=this.get();if(u>b.length)throw new Error("_sha2: outputLen bigger than state");for(let o=0;o<u;o++)c.setUint32(4o,b[o],f)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const n=t.slice(0,s);return this.destroy(),n}_cloneInto(t){t\|\|(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:n,length:i,finished:f,destroyed:r,pos:c}=this;return t.destroyed=r,t.finished=f,t.length=i,t.pos=c,i%s&&t.buffer.set(n),t}clone(){return this._cloneInto()}}const d=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),W=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]),l=new Uint32Array(64);class N extends B{constructor(t){super(64,t,8,!1)}get(){const{A:t,B:s,C:n,D:i,E:f,F:r,G:c,H:x}=this;return[t,s,n,i,f,r,c,x]}set(t,s,n,i,f,r,c,x){this.A=t\|0,this.B=s\|0,this.C=n\|0,this.D=i\|0,this.E=f\|0,this.F=r\|0,this.G=c\|0,this.H=x\|0}process(t,s){for(let o=0;o<16;o++,s+=4)l[o]=t.getUint32(s,!1);for(let o=16;o<64;o++){const g=l[o-15],p=l[o-2],H=a(g,7)^a(g,18)^g>>>3,w=a(p,17)^a(p,19)^p>>>10;l[o]=w+l[o-7]+H+l[o-16]\|0}let{A:n,B:i,C:f,D:r,E:c,F:x,G:u,H:b}=this;for(let o=0;o<64;o++){const g=a(c,6)^a(c,11)^a(c,25),p=b+g+V(c,x,u)+W[o]+l[o]\|0,w=(a(n,2)^a(n,13)^a(n,22))+j(n,i,f)\|0;b=u,u=x,x=c,c=r+p\|0,r=f,f=i,i=n,n=p+w\|0}n=n+this.A\|0,i=i+this.B\|0,f=f+this.C\|0,r=r+this.D\|0,c=c+this.E\|0,x=x+this.F\|0,u=u+this.G\|0,b=b+this.H\|0,this.set(n,i,f,r,c,x,u,b)}roundClean(){y(l)}destroy(){this.set(0,0,0,0,0,0,0,0),y(this.buffer)}}class T extends N{constructor(){super(32);h(this,"A",d[0]\|0);h(this,"B",d[1]\|0);h(this,"C",d[2]\|0);h(this,"D",d[3]\|0);h(this,"E",d[4]\|0);h(this,"F",d[5]\|0);h(this,"G",d[6]\|0);h(this,"H",d[7]\|0)}}const z=U(()=>new T,M(1));exports.HashMD=B;exports.abytes=E;exports.aexists=A;exports.anumber=S;exports.aoutput=m;exports.clean=y;exports.createHasher=U;exports.rotl=C;exports.sha256=z;exports.swap32IfBE=G;exports.u32=k;
2	+ //# sourceMappingURL=sha2-DsrLC4NM.cjs.map

package/dist/{sha2-CsTynrfJ.cjs.map → sha2-DsrLC4NM.cjs.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"sha2-CsTynrfJ.cjs","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js"],"sourcesContent":["/*\n Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a) {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/* Asserts something is positive integer. /\nexport function anumber(n, title = '') {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n/* Asserts something is Uint8Array. /\nexport function abytes(value, length, title = '') {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n/* Asserts something is hash /\nexport function ahash(h) {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word, shift) {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word, shift) {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE = / @__PURE__ / (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/* The byte swap operation for uint32 /\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff));\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = / @__PURE__ / (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async () => { };\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/* Merges default options and passed options. /\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher(hashCons, info = {}) {\n const hashC = (msg, opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32) {\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix) => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/\n Internal Merkle-Damgard hash utils.\n * @module\n /\nimport { abytes, aexists, aoutput, clean, createView } from \"./utils.js\";\n/* Choice: a ? b : c /\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/* Majority function, true if any two inputs is true. /\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n/\n Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n /\nexport class HashMD {\n blockLen;\n outputLen;\n padOffset;\n isLE;\n // For partial updates less than block size\n buffer;\n view;\n finished = false;\n length = 0;\n pos = 0;\n destroyed = false;\n constructor(blockLen, outputLen, padOffset, isLE) {\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n view.setBigUint64(blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\|= new this.constructor();\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n clone() {\n return this._cloneInto();\n }\n}\n/*\n Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n /\n/* Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 /\nexport const SHA256_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/* Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 /\nexport const SHA224_IV = / @__PURE__ / Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/* Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 /\nexport const SHA384_IV = / @__PURE__ / Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/* Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 /\nexport const SHA512_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/\n SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n /\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/*\n Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n /\n// prettier-ignore\nconst SHA256_K = / @__PURE__ / Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/* Reusable temporary buffer. \"W\" comes straight from spec. /\nconst SHA256_W = / @__PURE__ / new Uint32Array(64);\n/* Internal 32-byte base SHA2 hash class. /\nclass SHA2_32B extends HashMD {\n constructor(outputLen) {\n super(64, outputLen, 8, false);\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n clean(SHA256_W);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n/* Internal SHA2-256 hash class. /\nexport class _SHA256 extends SHA2_32B {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = SHA256_IV[0] \| 0;\n B = SHA256_IV[1] \| 0;\n C = SHA256_IV[2] \| 0;\n D = SHA256_IV[3] \| 0;\n E = SHA256_IV[4] \| 0;\n F = SHA256_IV[5] \| 0;\n G = SHA256_IV[6] \| 0;\n H = SHA256_IV[7] \| 0;\n constructor() {\n super(32);\n }\n}\n/* Internal SHA2-224 hash class. /\nexport class _SHA224 extends SHA2_32B {\n A = SHA224_IV[0] \| 0;\n B = SHA224_IV[1] \| 0;\n C = SHA224_IV[2] \| 0;\n D = SHA224_IV[3] \| 0;\n E = SHA224_IV[4] \| 0;\n F = SHA224_IV[5] \| 0;\n G = SHA224_IV[6] \| 0;\n H = SHA224_IV[7] \| 0;\n constructor() {\n super(28);\n }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = / @__PURE__ / (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = / @__PURE__ / (() => K512[0])();\nconst SHA512_Kl = / @__PURE__ / (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = / @__PURE__ / new Uint32Array(80);\nconst SHA512_W_L = / @__PURE__ / new Uint32Array(80);\n/* Internal 64-byte base SHA2 hash class. /\nclass SHA2_64B extends HashMD {\n constructor(outputLen) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy() {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\n/* Internal SHA2-512 hash class. /\nexport class _SHA512 extends SHA2_64B {\n Ah = SHA512_IV[0] \| 0;\n Al = SHA512_IV[1] \| 0;\n Bh = SHA512_IV[2] \| 0;\n Bl = SHA512_IV[3] \| 0;\n Ch = SHA512_IV[4] \| 0;\n Cl = SHA512_IV[5] \| 0;\n Dh = SHA512_IV[6] \| 0;\n Dl = SHA512_IV[7] \| 0;\n Eh = SHA512_IV[8] \| 0;\n El = SHA512_IV[9] \| 0;\n Fh = SHA512_IV[10] \| 0;\n Fl = SHA512_IV[11] \| 0;\n Gh = SHA512_IV[12] \| 0;\n Gl = SHA512_IV[13] \| 0;\n Hh = SHA512_IV[14] \| 0;\n Hl = SHA512_IV[15] \| 0;\n constructor() {\n super(64);\n }\n}\n/* Internal SHA2-384 hash class. /\nexport class _SHA384 extends SHA2_64B {\n Ah = SHA384_IV[0] \| 0;\n Al = SHA384_IV[1] \| 0;\n Bh = SHA384_IV[2] \| 0;\n Bl = SHA384_IV[3] \| 0;\n Ch = SHA384_IV[4] \| 0;\n Cl = SHA384_IV[5] \| 0;\n Dh = SHA384_IV[6] \| 0;\n Dl = SHA384_IV[7] \| 0;\n Eh = SHA384_IV[8] \| 0;\n El = SHA384_IV[9] \| 0;\n Fh = SHA384_IV[10] \| 0;\n Fl = SHA384_IV[11] \| 0;\n Gh = SHA384_IV[12] \| 0;\n Gl = SHA384_IV[13] \| 0;\n Hh = SHA384_IV[14] \| 0;\n Hl = SHA384_IV[15] \| 0;\n constructor() {\n super(48);\n }\n}\n/\n Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n /\n/* SHA512/224 IV /\nconst T224_IV = / @__PURE__ / Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/* SHA512/256 IV /\nconst T256_IV = / @__PURE__ / Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/* Internal SHA2-512/224 hash class. /\nexport class _SHA512_224 extends SHA2_64B {\n Ah = T224_IV[0] \| 0;\n Al = T224_IV[1] \| 0;\n Bh = T224_IV[2] \| 0;\n Bl = T224_IV[3] \| 0;\n Ch = T224_IV[4] \| 0;\n Cl = T224_IV[5] \| 0;\n Dh = T224_IV[6] \| 0;\n Dl = T224_IV[7] \| 0;\n Eh = T224_IV[8] \| 0;\n El = T224_IV[9] \| 0;\n Fh = T224_IV[10] \| 0;\n Fl = T224_IV[11] \| 0;\n Gh = T224_IV[12] \| 0;\n Gl = T224_IV[13] \| 0;\n Hh = T224_IV[14] \| 0;\n Hl = T224_IV[15] \| 0;\n constructor() {\n super(28);\n }\n}\n/* Internal SHA2-512/256 hash class. /\nexport class _SHA512_256 extends SHA2_64B {\n Ah = T256_IV[0] \| 0;\n Al = T256_IV[1] \| 0;\n Bh = T256_IV[2] \| 0;\n Bl = T256_IV[3] \| 0;\n Ch = T256_IV[4] \| 0;\n Cl = T256_IV[5] \| 0;\n Dh = T256_IV[6] \| 0;\n Dl = T256_IV[7] \| 0;\n Eh = T256_IV[8] \| 0;\n El = T256_IV[9] \| 0;\n Fh = T256_IV[10] \| 0;\n Fl = T256_IV[11] \| 0;\n Gh = T256_IV[12] \| 0;\n Gl = T256_IV[13] \| 0;\n Hh = T256_IV[14] \| 0;\n Hl = T256_IV[15] \| 0;\n constructor() {\n super(32);\n }\n}\n/\n SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n \n - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n /\nexport const sha256 = / @__PURE__ / createHasher(() => new _SHA256(), \n/ @__PURE__ / oidNist(0x01));\n/* SHA2-224 hash function from RFC 4634 /\nexport const sha224 = / @__PURE__ / createHasher(() => new _SHA224(), \n/ @__PURE__ / oidNist(0x04));\n/* SHA2-512 hash function from RFC 4634. /\nexport const sha512 = / @__PURE__ / createHasher(() => new _SHA512(), \n/ @__PURE__ / oidNist(0x03));\n/* SHA2-384 hash function from RFC 4634. /\nexport const sha384 = / @__PURE__ / createHasher(() => new _SHA384(), \n/ @__PURE__ / oidNist(0x02));\n/\n SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_256 = / @__PURE__ / createHasher(() => new _SHA512_256(), \n/ @__PURE__ / oidNist(0x06));\n/\n SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_224 = / @__PURE__ / createHasher(() => new _SHA512_224(), \n/ @__PURE__ */ oidNist(0x05));\n//# sourceMappingURL=sha2.js.map"],"names":["isBytes","a","anumber","n","title","prefix","abytes","value","length","bytes","len","needsLen","ofLen","got","ahash","h","aexists","instance","checkFinished","aoutput","out","min","u32","arr","clean","arrays","i","createView","rotr","word","shift","rotl","isLE","byteSwap","byteSwap32","swap32IfBE","u","createHasher","hashCons","info","hashC","msg","opts","tmp","oidNist","suffix","Chi","b","c","Maj","HashMD","blockLen","outputLen","padOffset","__publicField","data","view","buffer","pos","take","dataView","oview","outLen","state","res","to","finished","destroyed","SHA256_IV","SHA256_K","SHA256_W","SHA2_32B","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","_SHA256","sha256"],"mappings":"iLAMO,SAASA,EAAQC,EAAG,CACvB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAEO,SAASC,EAAQC,EAAGC,EAAQ,GAAI,CACnC,GAAI,CAAC,OAAO,cAAcD,CAAC,GAAKA,EAAI,EAAG,CACnC,MAAME,EAASD,GAAS,IAAIA,CAAK,KACjC,MAAM,IAAI,MAAM,GAAGC,CAAM,8BAA8BF,CAAC,EAAE,CAC9D,CACJ,CAEO,SAASG,EAAOC,EAAOC,EAAQJ,EAAQ,GAAI,CAC9C,MAAMK,EAAQT,EAAQO,CAAK,EACrBG,EAAMH,GAAA,YAAAA,EAAO,OACbI,EAAWH,IAAW,OAC5B,GAAI,CAACC,GAAUE,GAAYD,IAAQF,EAAS,CACxC,MAAMH,EAASD,GAAS,IAAIA,CAAK,KAC3BQ,EAAQD,EAAW,cAAcH,CAAM,GAAK,GAC5CK,EAAMJ,EAAQ,UAAUC,CAAG,GAAK,QAAQ,OAAOH,CAAK,GAC1D,MAAM,IAAI,MAAMF,EAAS,sBAAwBO,EAAQ,SAAWC,CAAG,CAC3E,CACA,OAAON,CACX,CAEO,SAASO,EAAMC,EAAG,CACrB,GAAI,OAAOA,GAAM,YAAc,OAAOA,EAAE,QAAW,WAC/C,MAAM,IAAI,MAAM,yCAAyC,EAC7Db,EAAQa,EAAE,SAAS,EACnBb,EAAQa,EAAE,QAAQ,CACtB,CAEO,SAASC,EAAQC,EAAUC,EAAgB,GAAM,CACpD,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CAEO,SAASE,EAAQC,EAAKH,EAAU,CACnCX,EAAOc,EAAK,OAAW,qBAAqB,EAC5C,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,oDAAsDA,CAAG,CAEjF,CAMO,SAASC,EAAIC,EAAK,CACrB,OAAO,IAAI,YAAYA,EAAI,OAAQA,EAAI,WAAY,KAAK,MAAMA,EAAI,WAAa,CAAC,CAAC,CACrF,CAEO,SAASC,KAASC,EAAQ,CAC7B,QAASC,EAAI,EAAGA,EAAID,EAAO,OAAQC,IAC/BD,EAAOC,CAAC,EAAE,KAAK,CAAC,CAExB,CAEO,SAASC,EAAWJ,EAAK,CAC5B,OAAO,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAClE,CAEO,SAASK,EAAKC,EAAMC,EAAO,CAC9B,OAAQD,GAAS,GAAKC,EAAWD,IAASC,CAC9C,CAEO,SAASC,EAAKF,EAAMC,EAAO,CAC9B,OAAQD,GAAQC,EAAWD,IAAU,GAAKC,IAAY,CAC1D,CAEO,MAAME,EAA8B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAEhG,SAASC,EAASJ,EAAM,CAC3B,OAAUA,GAAQ,GAAM,WAClBA,GAAQ,EAAK,SACbA,IAAS,EAAK,MACdA,IAAS,GAAM,GACzB,CAMO,SAASK,EAAWX,EAAK,CAC5B,QAASG,EAAI,EAAGA,EAAIH,EAAI,OAAQG,IAC5BH,EAAIG,CAAC,EAAIO,EAASV,EAAIG,CAAC,CAAC,EAE5B,OAAOH,CACX,CACY,MAACY,EAAaH,EACnBI,GAAMA,EACPF,EA0HC,SAASG,EAAaC,EAAUC,EAAO,GAAI,CAC9C,MAAMC,EAAQ,CAACC,EAAKC,IAASJ,EAASI,CAAI,EAAE,OAAOD,CAAG,EAAE,OAAM,EACxDE,EAAML,EAAS,MAAS,EAC9B,OAAAE,EAAM,UAAYG,EAAI,UACtBH,EAAM,SAAWG,EAAI,SACrBH,EAAM,OAAUE,GAASJ,EAASI,CAAI,EACtC,OAAO,OAAOF,EAAOD,CAAI,EAClB,OAAO,OAAOC,CAAK,CAC9B,CASO,MAAMI,EAAWC,IAAY,CAChC,IAAK,WAAW,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,GAAM,EAAM,IAAM,EAAM,EAAM,EAAMA,CAAM,CAAC,CAC7F,GC1OO,SAASC,EAAI7C,EAAG8C,EAAGC,EAAG,CACzB,OAAQ/C,EAAI8C,EAAM,CAAC9C,EAAI+C,CAC3B,CAEO,SAASC,EAAIhD,EAAG8C,EAAGC,EAAG,CACzB,OAAQ/C,EAAI8C,EAAM9C,EAAI+C,EAAMD,EAAIC,CACpC,CAKO,MAAME,CAAO,CAYhB,YAAYC,EAAUC,EAAWC,EAAWrB,EAAM,CAXlDsB,EAAA,iBACAA,EAAA,kBACAA,EAAA,kBACAA,EAAA,aAEAA,EAAA,eACAA,EAAA,aACAA,EAAA,gBAAW,IACXA,EAAA,cAAS,GACTA,EAAA,WAAM,GACNA,EAAA,iBAAY,IAER,KAAK,SAAWH,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAOrB,EACZ,KAAK,OAAS,IAAI,WAAWmB,CAAQ,EACrC,KAAK,KAAOxB,EAAW,KAAK,MAAM,CACtC,CACA,OAAO4B,EAAM,CACTvC,EAAQ,IAAI,EACZV,EAAOiD,CAAI,EACX,KAAM,CAAE,KAAAC,EAAM,OAAAC,EAAQ,SAAAN,CAAQ,EAAK,KAC7BzC,EAAM6C,EAAK,OACjB,QAASG,EAAM,EAAGA,EAAMhD,GAAM,CAC1B,MAAMiD,EAAO,KAAK,IAAIR,EAAW,KAAK,IAAKzC,EAAMgD,CAAG,EAEpD,GAAIC,IAASR,EAAU,CACnB,MAAMS,EAAWjC,EAAW4B,CAAI,EAChC,KAAOJ,GAAYzC,EAAMgD,EAAKA,GAAOP,EACjC,KAAK,QAAQS,EAAUF,CAAG,EAC9B,QACJ,CACAD,EAAO,IAAIF,EAAK,SAASG,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQR,IACb,KAAK,QAAQK,EAAM,CAAC,EACpB,KAAK,IAAM,EAEnB,CACA,YAAK,QAAUD,EAAK,OACpB,KAAK,WAAU,EACR,IACX,CACA,WAAWnC,EAAK,CACZJ,EAAQ,IAAI,EACZG,EAAQC,EAAK,IAAI,EACjB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAAqC,EAAQ,KAAAD,EAAM,SAAAL,EAAU,KAAAnB,CAAI,EAAK,KACzC,GAAI,CAAE,IAAA0B,CAAG,EAAK,KAEdD,EAAOC,GAAK,EAAI,IAChBlC,EAAM,KAAK,OAAO,SAASkC,CAAG,CAAC,EAG3B,KAAK,UAAYP,EAAWO,IAC5B,KAAK,QAAQF,EAAM,CAAC,EACpBE,EAAM,GAGV,QAAShC,EAAIgC,EAAKhC,EAAIyB,EAAUzB,IAC5B+B,EAAO/B,CAAC,EAAI,EAIhB8B,EAAK,aAAaL,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGnB,CAAI,EAC7D,KAAK,QAAQwB,EAAM,CAAC,EACpB,MAAMK,EAAQlC,EAAWP,CAAG,EACtBV,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,2CAA2C,EAC/D,MAAMoD,EAASpD,EAAM,EACfqD,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAASrC,EAAI,EAAGA,EAAIoC,EAAQpC,IACxBmC,EAAM,UAAU,EAAInC,EAAGqC,EAAMrC,CAAC,EAAGM,CAAI,CAC7C,CACA,QAAS,CACL,KAAM,CAAE,OAAAyB,EAAQ,UAAAL,CAAS,EAAK,KAC9B,KAAK,WAAWK,CAAM,EACtB,MAAMO,EAAMP,EAAO,MAAM,EAAGL,CAAS,EACrC,YAAK,QAAO,EACLY,CACX,CACA,WAAWC,EAAI,CACXA,MAAO,IAAI,KAAK,aAChBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAAd,EAAU,OAAAM,EAAQ,OAAAjD,EAAQ,SAAA0D,EAAU,UAAAC,EAAW,IAAAT,CAAG,EAAK,KAC/D,OAAAO,EAAG,UAAYE,EACfF,EAAG,SAAWC,EACdD,EAAG,OAASzD,EACZyD,EAAG,IAAMP,EACLlD,EAAS2C,GACTc,EAAG,OAAO,IAAIR,CAAM,EACjBQ,CACX,CACA,OAAQ,CACJ,OAAO,KAAK,WAAU,CAC1B,CACJ,CAMO,MAAMG,EAA4B,YAAY,KAAK,CACtD,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,ECpHKC,EAA2B,YAAY,KAAK,CAC9C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAEKC,EAA2B,IAAI,YAAY,EAAE,EAEnD,MAAMC,UAAiBrB,CAAO,CAC1B,YAAYE,EAAW,CACnB,MAAM,GAAIA,EAAW,EAAG,EAAK,CACjC,CACA,KAAM,CACF,KAAM,CAAE,EAAAoB,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CAClC,CAEA,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACjB,CACA,QAAQvB,EAAMwB,EAAQ,CAElB,QAAStD,EAAI,EAAGA,EAAI,GAAIA,IAAKsD,GAAU,EACnCV,EAAS5C,CAAC,EAAI8B,EAAK,UAAUwB,EAAQ,EAAK,EAC9C,QAAStD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMuD,EAAMX,EAAS5C,EAAI,EAAE,EACrBwD,EAAKZ,EAAS5C,EAAI,CAAC,EACnByD,EAAKvD,EAAKqD,EAAK,CAAC,EAAIrD,EAAKqD,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAKxD,EAAKsD,EAAI,EAAE,EAAItD,EAAKsD,EAAI,EAAE,EAAKA,IAAO,GACjDZ,EAAS5C,CAAC,EAAK0D,EAAKd,EAAS5C,EAAI,CAAC,EAAIyD,EAAKb,EAAS5C,EAAI,EAAE,EAAK,CACnE,CAEA,GAAI,CAAE,EAAA8C,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASrD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM2D,EAASzD,EAAKgD,EAAG,CAAC,EAAIhD,EAAKgD,EAAG,EAAE,EAAIhD,EAAKgD,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASvC,EAAI8B,EAAGC,EAAGC,CAAC,EAAIT,EAAS3C,CAAC,EAAI4C,EAAS5C,CAAC,EAAK,EAE/D6D,GADS3D,EAAK4C,EAAG,CAAC,EAAI5C,EAAK4C,EAAG,EAAE,EAAI5C,EAAK4C,EAAG,EAAE,GAC/BvB,EAAIuB,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACpB,CAEAf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACnC,CACA,YAAa,CACTvD,EAAM8C,CAAQ,CAClB,CACA,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B9C,EAAM,KAAK,MAAM,CACrB,CACJ,CAEO,MAAMgE,UAAgBjB,CAAS,CAWlC,aAAc,CACV,MAAM,EAAE,EATZjB,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,EAGnB,CACJ,CAyQY,MAACqB,EAAyBpD,EAAa,IAAM,IAAImD,EAC7C5C,EAAQ,CAAI,CAAC","x_google_ignoreList":[0,1,2]}
1	+ {"version":3,"file":"sha2-DsrLC4NM.cjs","sources":["../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js","../../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js"],"sourcesContent":["/*\n Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a) {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/* Asserts something is positive integer. /\nexport function anumber(n, title = '') {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n/* Asserts something is Uint8Array. /\nexport function abytes(value, length, title = '') {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n/* Asserts something is hash /\nexport function ahash(h) {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word, shift) {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word, shift) {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE = / @__PURE__ / (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/* The byte swap operation for uint32 /\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff));\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = / @__PURE__ / (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async () => { };\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/* Merges default options and passed options. /\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher(hashCons, info = {}) {\n const hashC = (msg, opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32) {\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix) => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/\n Internal Merkle-Damgard hash utils.\n * @module\n /\nimport { abytes, aexists, aoutput, clean, createView } from \"./utils.js\";\n/* Choice: a ? b : c /\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/* Majority function, true if any two inputs is true. /\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n/\n Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n /\nexport class HashMD {\n blockLen;\n outputLen;\n padOffset;\n isLE;\n // For partial updates less than block size\n buffer;\n view;\n finished = false;\n length = 0;\n pos = 0;\n destroyed = false;\n constructor(blockLen, outputLen, padOffset, isLE) {\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n view.setBigUint64(blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\|= new this.constructor();\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n clone() {\n return this._cloneInto();\n }\n}\n/*\n Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n /\n/* Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 /\nexport const SHA256_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/* Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 /\nexport const SHA224_IV = / @__PURE__ / Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/* Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 /\nexport const SHA384_IV = / @__PURE__ / Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/* Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 /\nexport const SHA512_IV = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/\n SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n /\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/*\n Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n /\n// prettier-ignore\nconst SHA256_K = / @__PURE__ / Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/* Reusable temporary buffer. \"W\" comes straight from spec. /\nconst SHA256_W = / @__PURE__ / new Uint32Array(64);\n/* Internal 32-byte base SHA2 hash class. /\nclass SHA2_32B extends HashMD {\n constructor(outputLen) {\n super(64, outputLen, 8, false);\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n clean(SHA256_W);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n/* Internal SHA2-256 hash class. /\nexport class _SHA256 extends SHA2_32B {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = SHA256_IV[0] \| 0;\n B = SHA256_IV[1] \| 0;\n C = SHA256_IV[2] \| 0;\n D = SHA256_IV[3] \| 0;\n E = SHA256_IV[4] \| 0;\n F = SHA256_IV[5] \| 0;\n G = SHA256_IV[6] \| 0;\n H = SHA256_IV[7] \| 0;\n constructor() {\n super(32);\n }\n}\n/* Internal SHA2-224 hash class. /\nexport class _SHA224 extends SHA2_32B {\n A = SHA224_IV[0] \| 0;\n B = SHA224_IV[1] \| 0;\n C = SHA224_IV[2] \| 0;\n D = SHA224_IV[3] \| 0;\n E = SHA224_IV[4] \| 0;\n F = SHA224_IV[5] \| 0;\n G = SHA224_IV[6] \| 0;\n H = SHA224_IV[7] \| 0;\n constructor() {\n super(28);\n }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = / @__PURE__ / (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = / @__PURE__ / (() => K512[0])();\nconst SHA512_Kl = / @__PURE__ / (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = / @__PURE__ / new Uint32Array(80);\nconst SHA512_W_L = / @__PURE__ / new Uint32Array(80);\n/* Internal 64-byte base SHA2 hash class. /\nclass SHA2_64B extends HashMD {\n constructor(outputLen) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy() {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\n/* Internal SHA2-512 hash class. /\nexport class _SHA512 extends SHA2_64B {\n Ah = SHA512_IV[0] \| 0;\n Al = SHA512_IV[1] \| 0;\n Bh = SHA512_IV[2] \| 0;\n Bl = SHA512_IV[3] \| 0;\n Ch = SHA512_IV[4] \| 0;\n Cl = SHA512_IV[5] \| 0;\n Dh = SHA512_IV[6] \| 0;\n Dl = SHA512_IV[7] \| 0;\n Eh = SHA512_IV[8] \| 0;\n El = SHA512_IV[9] \| 0;\n Fh = SHA512_IV[10] \| 0;\n Fl = SHA512_IV[11] \| 0;\n Gh = SHA512_IV[12] \| 0;\n Gl = SHA512_IV[13] \| 0;\n Hh = SHA512_IV[14] \| 0;\n Hl = SHA512_IV[15] \| 0;\n constructor() {\n super(64);\n }\n}\n/* Internal SHA2-384 hash class. /\nexport class _SHA384 extends SHA2_64B {\n Ah = SHA384_IV[0] \| 0;\n Al = SHA384_IV[1] \| 0;\n Bh = SHA384_IV[2] \| 0;\n Bl = SHA384_IV[3] \| 0;\n Ch = SHA384_IV[4] \| 0;\n Cl = SHA384_IV[5] \| 0;\n Dh = SHA384_IV[6] \| 0;\n Dl = SHA384_IV[7] \| 0;\n Eh = SHA384_IV[8] \| 0;\n El = SHA384_IV[9] \| 0;\n Fh = SHA384_IV[10] \| 0;\n Fl = SHA384_IV[11] \| 0;\n Gh = SHA384_IV[12] \| 0;\n Gl = SHA384_IV[13] \| 0;\n Hh = SHA384_IV[14] \| 0;\n Hl = SHA384_IV[15] \| 0;\n constructor() {\n super(48);\n }\n}\n/\n Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n /\n/* SHA512/224 IV /\nconst T224_IV = / @__PURE__ / Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/* SHA512/256 IV /\nconst T256_IV = / @__PURE__ / Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/* Internal SHA2-512/224 hash class. /\nexport class _SHA512_224 extends SHA2_64B {\n Ah = T224_IV[0] \| 0;\n Al = T224_IV[1] \| 0;\n Bh = T224_IV[2] \| 0;\n Bl = T224_IV[3] \| 0;\n Ch = T224_IV[4] \| 0;\n Cl = T224_IV[5] \| 0;\n Dh = T224_IV[6] \| 0;\n Dl = T224_IV[7] \| 0;\n Eh = T224_IV[8] \| 0;\n El = T224_IV[9] \| 0;\n Fh = T224_IV[10] \| 0;\n Fl = T224_IV[11] \| 0;\n Gh = T224_IV[12] \| 0;\n Gl = T224_IV[13] \| 0;\n Hh = T224_IV[14] \| 0;\n Hl = T224_IV[15] \| 0;\n constructor() {\n super(28);\n }\n}\n/* Internal SHA2-512/256 hash class. /\nexport class _SHA512_256 extends SHA2_64B {\n Ah = T256_IV[0] \| 0;\n Al = T256_IV[1] \| 0;\n Bh = T256_IV[2] \| 0;\n Bl = T256_IV[3] \| 0;\n Ch = T256_IV[4] \| 0;\n Cl = T256_IV[5] \| 0;\n Dh = T256_IV[6] \| 0;\n Dl = T256_IV[7] \| 0;\n Eh = T256_IV[8] \| 0;\n El = T256_IV[9] \| 0;\n Fh = T256_IV[10] \| 0;\n Fl = T256_IV[11] \| 0;\n Gh = T256_IV[12] \| 0;\n Gl = T256_IV[13] \| 0;\n Hh = T256_IV[14] \| 0;\n Hl = T256_IV[15] \| 0;\n constructor() {\n super(32);\n }\n}\n/\n SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n \n - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n /\nexport const sha256 = / @__PURE__ / createHasher(() => new _SHA256(), \n/ @__PURE__ / oidNist(0x01));\n/* SHA2-224 hash function from RFC 4634 /\nexport const sha224 = / @__PURE__ / createHasher(() => new _SHA224(), \n/ @__PURE__ / oidNist(0x04));\n/* SHA2-512 hash function from RFC 4634. /\nexport const sha512 = / @__PURE__ / createHasher(() => new _SHA512(), \n/ @__PURE__ / oidNist(0x03));\n/* SHA2-384 hash function from RFC 4634. /\nexport const sha384 = / @__PURE__ / createHasher(() => new _SHA384(), \n/ @__PURE__ / oidNist(0x02));\n/\n SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_256 = / @__PURE__ / createHasher(() => new _SHA512_256(), \n/ @__PURE__ / oidNist(0x06));\n/\n SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_224 = / @__PURE__ / createHasher(() => new _SHA512_224(), \n/ @__PURE__ */ oidNist(0x05));\n//# sourceMappingURL=sha2.js.map"],"names":["isBytes","a","anumber","n","title","prefix","abytes","value","length","bytes","len","ofLen","got","aexists","instance","checkFinished","aoutput","out","min","u32","arr","clean","arrays","i","createView","rotr","word","shift","rotl","isLE","byteSwap","byteSwap32","swap32IfBE","u","createHasher","hashCons","info","hashC","msg","opts","tmp","oidNist","suffix","Chi","b","c","Maj","HashMD","blockLen","outputLen","padOffset","__publicField","data","view","buffer","pos","take","dataView","oview","outLen","state","res","to","finished","destroyed","SHA256_IV","SHA256_K","SHA256_W","SHA2_32B","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","_SHA256","sha256"],"mappings":"iLAMO,SAASA,EAAQC,EAAG,CACvB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAEO,SAASC,EAAQC,EAAGC,EAAQ,GAAI,CACnC,GAAI,CAAC,OAAO,cAAcD,CAAC,GAAKA,EAAI,EAAG,CACnC,MAAME,EAASD,GAAS,IAAIA,CAAK,KACjC,MAAM,IAAI,MAAM,GAAGC,CAAM,8BAA8BF,CAAC,EAAE,CAC9D,CACJ,CAEO,SAASG,EAAOC,EAAOC,EAAQJ,EAAQ,GAAI,CAC9C,MAAMK,EAAQT,EAAQO,CAAK,EACrBG,EAAMH,GAAA,YAAAA,EAAO,OAEnB,GAAI,CAACE,GADYD,IAAW,OACgB,CACxC,MAAMH,EAASD,GAAS,IAAIA,CAAK,KAC3BO,EAA4C,GAC5CC,EAAMH,EAAQ,UAAUC,CAAG,GAAK,QAAQ,OAAOH,CAAK,GAC1D,MAAM,IAAI,MAAMF,EAAS,sBAAwBM,EAAQ,SAAWC,CAAG,CAC3E,CACA,OAAOL,CACX,CASO,SAASM,EAAQC,EAAUC,EAAgB,GAAM,CACpD,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CAEO,SAASE,EAAQC,EAAKH,EAAU,CACnCR,EAAOW,EAAK,OAAW,qBAAqB,EAC5C,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,oDAAsDA,CAAG,CAEjF,CAMO,SAASC,EAAIC,EAAK,CACrB,OAAO,IAAI,YAAYA,EAAI,OAAQA,EAAI,WAAY,KAAK,MAAMA,EAAI,WAAa,CAAC,CAAC,CACrF,CAEO,SAASC,KAASC,EAAQ,CAC7B,QAASC,EAAI,EAAGA,EAAID,EAAO,OAAQC,IAC/BD,EAAOC,CAAC,EAAE,KAAK,CAAC,CAExB,CAEO,SAASC,EAAWJ,EAAK,CAC5B,OAAO,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAClE,CAEO,SAASK,EAAKC,EAAMC,EAAO,CAC9B,OAAQD,GAAS,GAAKC,EAAWD,IAASC,CAC9C,CAEO,SAASC,EAAKF,EAAMC,EAAO,CAC9B,OAAQD,GAAQC,EAAWD,IAAU,GAAKC,IAAY,CAC1D,CAEO,MAAME,EAA8B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAEhG,SAASC,EAASJ,EAAM,CAC3B,OAAUA,GAAQ,GAAM,WAClBA,GAAQ,EAAK,SACbA,IAAS,EAAK,MACdA,IAAS,GAAM,GACzB,CAMO,SAASK,EAAWX,EAAK,CAC5B,QAASG,EAAI,EAAGA,EAAIH,EAAI,OAAQG,IAC5BH,EAAIG,CAAC,EAAIO,EAASV,EAAIG,CAAC,CAAC,EAE5B,OAAOH,CACX,CACY,MAACY,EAAaH,EACnBI,GAAMA,EACPF,EA0HC,SAASG,EAAaC,EAAUC,EAAO,GAAI,CAC9C,MAAMC,EAAQ,CAACC,EAAKC,IAASJ,EAASI,CAAI,EAAE,OAAOD,CAAG,EAAE,OAAM,EACxDE,EAAML,EAAS,MAAS,EAC9B,OAAAE,EAAM,UAAYG,EAAI,UACtBH,EAAM,SAAWG,EAAI,SACrBH,EAAM,OAAUE,GAASJ,EAASI,CAAI,EACtC,OAAO,OAAOF,EAAOD,CAAI,EAClB,OAAO,OAAOC,CAAK,CAC9B,CASO,MAAMI,EAAWC,IAAY,CAChC,IAAK,WAAW,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,GAAM,EAAM,IAAM,EAAM,EAAM,EAAMA,CAAM,CAAC,CAC7F,GC1OO,SAASC,EAAI1C,EAAG2C,EAAGC,EAAG,CACzB,OAAQ5C,EAAI2C,EAAM,CAAC3C,EAAI4C,CAC3B,CAEO,SAASC,EAAI7C,EAAG2C,EAAGC,EAAG,CACzB,OAAQ5C,EAAI2C,EAAM3C,EAAI4C,EAAMD,EAAIC,CACpC,CAKO,MAAME,CAAO,CAYhB,YAAYC,EAAUC,EAAWC,EAAWrB,EAAM,CAXlDsB,EAAA,iBACAA,EAAA,kBACAA,EAAA,kBACAA,EAAA,aAEAA,EAAA,eACAA,EAAA,aACAA,EAAA,gBAAW,IACXA,EAAA,cAAS,GACTA,EAAA,WAAM,GACNA,EAAA,iBAAY,IAER,KAAK,SAAWH,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAOrB,EACZ,KAAK,OAAS,IAAI,WAAWmB,CAAQ,EACrC,KAAK,KAAOxB,EAAW,KAAK,MAAM,CACtC,CACA,OAAO4B,EAAM,CACTvC,EAAQ,IAAI,EACZP,EAAO8C,CAAI,EACX,KAAM,CAAE,KAAAC,EAAM,OAAAC,EAAQ,SAAAN,CAAQ,EAAK,KAC7BtC,EAAM0C,EAAK,OACjB,QAASG,EAAM,EAAGA,EAAM7C,GAAM,CAC1B,MAAM8C,EAAO,KAAK,IAAIR,EAAW,KAAK,IAAKtC,EAAM6C,CAAG,EAEpD,GAAIC,IAASR,EAAU,CACnB,MAAMS,EAAWjC,EAAW4B,CAAI,EAChC,KAAOJ,GAAYtC,EAAM6C,EAAKA,GAAOP,EACjC,KAAK,QAAQS,EAAUF,CAAG,EAC9B,QACJ,CACAD,EAAO,IAAIF,EAAK,SAASG,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQR,IACb,KAAK,QAAQK,EAAM,CAAC,EACpB,KAAK,IAAM,EAEnB,CACA,YAAK,QAAUD,EAAK,OACpB,KAAK,WAAU,EACR,IACX,CACA,WAAWnC,EAAK,CACZJ,EAAQ,IAAI,EACZG,EAAQC,EAAK,IAAI,EACjB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAAqC,EAAQ,KAAAD,EAAM,SAAAL,EAAU,KAAAnB,CAAI,EAAK,KACzC,GAAI,CAAE,IAAA0B,CAAG,EAAK,KAEdD,EAAOC,GAAK,EAAI,IAChBlC,EAAM,KAAK,OAAO,SAASkC,CAAG,CAAC,EAG3B,KAAK,UAAYP,EAAWO,IAC5B,KAAK,QAAQF,EAAM,CAAC,EACpBE,EAAM,GAGV,QAAShC,EAAIgC,EAAKhC,EAAIyB,EAAUzB,IAC5B+B,EAAO/B,CAAC,EAAI,EAIhB8B,EAAK,aAAaL,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGnB,CAAI,EAC7D,KAAK,QAAQwB,EAAM,CAAC,EACpB,MAAMK,EAAQlC,EAAWP,CAAG,EACtBP,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,2CAA2C,EAC/D,MAAMiD,EAASjD,EAAM,EACfkD,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAASrC,EAAI,EAAGA,EAAIoC,EAAQpC,IACxBmC,EAAM,UAAU,EAAInC,EAAGqC,EAAMrC,CAAC,EAAGM,CAAI,CAC7C,CACA,QAAS,CACL,KAAM,CAAE,OAAAyB,EAAQ,UAAAL,CAAS,EAAK,KAC9B,KAAK,WAAWK,CAAM,EACtB,MAAMO,EAAMP,EAAO,MAAM,EAAGL,CAAS,EACrC,YAAK,QAAO,EACLY,CACX,CACA,WAAWC,EAAI,CACXA,MAAO,IAAI,KAAK,aAChBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAAd,EAAU,OAAAM,EAAQ,OAAA9C,EAAQ,SAAAuD,EAAU,UAAAC,EAAW,IAAAT,CAAG,EAAK,KAC/D,OAAAO,EAAG,UAAYE,EACfF,EAAG,SAAWC,EACdD,EAAG,OAAStD,EACZsD,EAAG,IAAMP,EACL/C,EAASwC,GACTc,EAAG,OAAO,IAAIR,CAAM,EACjBQ,CACX,CACA,OAAQ,CACJ,OAAO,KAAK,WAAU,CAC1B,CACJ,CAMO,MAAMG,EAA4B,YAAY,KAAK,CACtD,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,ECpHKC,EAA2B,YAAY,KAAK,CAC9C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAEKC,EAA2B,IAAI,YAAY,EAAE,EAEnD,MAAMC,UAAiBrB,CAAO,CAC1B,YAAYE,EAAW,CACnB,MAAM,GAAIA,EAAW,EAAG,EAAK,CACjC,CACA,KAAM,CACF,KAAM,CAAE,EAAAoB,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CAClC,CAEA,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACjB,CACA,QAAQvB,EAAMwB,EAAQ,CAElB,QAAStD,EAAI,EAAGA,EAAI,GAAIA,IAAKsD,GAAU,EACnCV,EAAS5C,CAAC,EAAI8B,EAAK,UAAUwB,EAAQ,EAAK,EAC9C,QAAStD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMuD,EAAMX,EAAS5C,EAAI,EAAE,EACrBwD,EAAKZ,EAAS5C,EAAI,CAAC,EACnByD,EAAKvD,EAAKqD,EAAK,CAAC,EAAIrD,EAAKqD,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAKxD,EAAKsD,EAAI,EAAE,EAAItD,EAAKsD,EAAI,EAAE,EAAKA,IAAO,GACjDZ,EAAS5C,CAAC,EAAK0D,EAAKd,EAAS5C,EAAI,CAAC,EAAIyD,EAAKb,EAAS5C,EAAI,EAAE,EAAK,CACnE,CAEA,GAAI,CAAE,EAAA8C,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASrD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM2D,EAASzD,EAAKgD,EAAG,CAAC,EAAIhD,EAAKgD,EAAG,EAAE,EAAIhD,EAAKgD,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASvC,EAAI8B,EAAGC,EAAGC,CAAC,EAAIT,EAAS3C,CAAC,EAAI4C,EAAS5C,CAAC,EAAK,EAE/D6D,GADS3D,EAAK4C,EAAG,CAAC,EAAI5C,EAAK4C,EAAG,EAAE,EAAI5C,EAAK4C,EAAG,EAAE,GAC/BvB,EAAIuB,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACpB,CAEAf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACnC,CACA,YAAa,CACTvD,EAAM8C,CAAQ,CAClB,CACA,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B9C,EAAM,KAAK,MAAM,CACrB,CACJ,CAEO,MAAMgE,UAAgBjB,CAAS,CAWlC,aAAc,CACV,MAAM,EAAE,EATZjB,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,GACnBd,EAAA,SAAIc,EAAU,CAAC,EAAI,EAGnB,CACJ,CAyQY,MAACqB,EAAyBpD,EAAa,IAAM,IAAImD,EAC7C5C,EAAQ,CAAI,CAAC","x_google_ignoreList":[0,1,2]}

package/dist/tbv/core/clients/eth/index.d.ts CHANGED Viewed

@@ -1,6 +1,7 @@
 export { resolveProtocolAddresses, type ProtocolAddresses, } from './contract-address-resolver';
+export { validateOffchainParams, validatePegInConfiguration, validateTBVProtocolParams, } from './protocol-params-validation';
 export { ViemProtocolParamsReader } from './protocol-params-reader';
 export { ViemUniversalChallengerReader, ViemVaultKeeperReader, } from './signer-set-reader';
 export { ViemVaultRegistryReader } from './vault-registry-reader';
-export type { AddressBTCKeyPair, OnChainBtcPubkey, PegInConfiguration, ProtocolParamsReader, TBVProtocolParams, UniversalChallengerReader, VaultBasicInfo, VaultData, VaultKeeperReader, VaultProtocolInfo, VaultRegistryReader, VersionedOffchainParams, } from './types';
+export type { AddressBTCKeyPair, AllOffchainParamsData, OnChainBtcPubkey, OnSkippedOffchainParamsVersion, PegInConfiguration, ProtocolParamsReader, TBVProtocolParams, UniversalChallengerReader, VaultBasicInfo, VaultData, VaultKeeperReader, VaultProtocolInfo, VaultRegistryReader, VersionedOffchainParams, } from './types';
 //# sourceMappingURL=index.d.ts.map

package/dist/tbv/core/clients/eth/index.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/clients/eth/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,KAAK,iBAAiB,GACvB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,wBAAwB,EAAE,MAAM,0BAA0B,CAAC;AACpE,OAAO,EACL,6BAA6B,EAC7B,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAClE,YAAY,EACV,iBAAiB,EACjB,gBAAgB,EAChB,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,EACjB,yBAAyB,EACzB,cAAc,EACd,SAAS,EACT,iBAAiB,EACjB,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,SAAS,CAAC"}
1	+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/clients/eth/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,KAAK,iBAAiB,GACvB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,sBAAsB,EACtB,0BAA0B,EAC1B,yBAAyB,GAC1B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAAE,wBAAwB,EAAE,MAAM,0BAA0B,CAAC;AACpE,OAAO,EACL,6BAA6B,EAC7B,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAClE,YAAY,EACV,iBAAiB,EACjB,qBAAqB,EACrB,gBAAgB,EAChB,8BAA8B,EAC9B,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,EACjB,yBAAyB,EACzB,cAAc,EACd,SAAS,EACT,iBAAiB,EACjB,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,SAAS,CAAC"}

package/dist/tbv/core/clients/eth/protocol-params-reader.d.ts CHANGED Viewed

@@ -1,8 +1,12 @@
 import { Address, PublicClient } from 'viem';
-import { PegInConfiguration, ProtocolParamsReader, TBVProtocolParams, VersionedOffchainParams } from './types';
+import { AllOffchainParamsData, OnSkippedOffchainParamsVersion, PegInConfiguration, ProtocolParamsReader, TBVProtocolParams, VersionedOffchainParams } from './types';
 /**
  * Concrete protocol params reader using viem.
  *
+ * Every read method runs the matching validator from
+ * `protocol-params-validation` before returning, so callers don't have to
+ * remember to validate.
+ *
  * Usage:
  * ```ts
  * const reader = new ViemProtocolParamsReader(publicClient, protocolParamsAddress);
@@ -19,9 +23,23 @@ export declare class ViemProtocolParamsReader implements ProtocolParamsReader {
     getLatestOffchainParamsVersion(): Promise<number>;
     getTimelockPeginByVersion(version: number): Promise<number>;
     /**
-     * Read TBV protocol params and latest offchain params atomically via multicall.
-     * Prevents TOCTOU inconsistency if governance updates params between reads.
+     * Read TBV protocol params, latest offchain params, and the latest version
+     * label atomically via multicall. The version is paired with the params so
+     * that a governance update between separate reads cannot let JS build BTC
+     * scripts with version N params while the contract registers the vault
+     * under version N+1.
      */
     getPegInConfiguration(): Promise<PegInConfiguration>;
+    /**
+     * Fetch every historical offchain params version in a single multicall.
+     * Iterates 1..latestVersion and calls `getOffchainParamsByVersion` for each.
+     * Versions whose payload fails validation are skipped (not included in the
+     * returned map) so a single bad historical version doesn't block the
+     * lookup of the rest.
+     *
+     * @param onSkippedVersion - optional observer invoked once per skipped
+     *   version. Use to log/telemeter without coupling the SDK to a logger.
+     */
+    fetchAllOffchainParams(onSkippedVersion?: OnSkippedOffchainParamsVersion): Promise<AllOffchainParamsData>;
 }
 //# sourceMappingURL=protocol-params-reader.d.ts.map

package/dist/tbv/core/clients/eth/protocol-params-reader.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"protocol-params-reader.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/clients/eth/protocol-params-reader.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,~~EAAE~~,OAAO,EAAO,YAAY,EAAE,MAAM,MAAM,CAAC;~~AAGvD~~,OAAO,KAAK,EACV,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,EACjB,uBAAuB,EACxB,MAAM,SAAS,CAAC;~~AAsFjB;;;;;;;;GAQG~~;AACH,qBAAa,wBAAyB,YAAW,oBAAoB;IAEjE,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,eAAe;gBADf,YAAY,EAAE,YAAY,EAC1B,eAAe,EAAE,OAAO;IAG5B,oBAAoB,IAAI,OAAO,CAAC,iBAAiB,CAAC;~~IAUlD~~,uBAAuB,IAAI,OAAO,CAAC,uBAAuB,CAAC;~~IAU3D~~,0BAA0B,CAC9B,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,uBAAuB,CAAC;~~IAW7B~~,8BAA8B,IAAI,OAAO,CAAC,MAAM,CAAC;~~IAUjD~~,yBAAyB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAKjE~~;;;OAGG~~;IACG,qBAAqB,IAAI,OAAO,CAAC,kBAAkB,CAAC;~~CAgC3D~~"}
1	+ {"version":3,"file":"protocol-params-reader.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/clients/eth/protocol-params-reader.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAO,OAAO,EAAO,YAAY,EAAE,MAAM,MAAM,CAAC;AAS5D,OAAO,KAAK,EACV,qBAAqB,EACrB,8BAA8B,EAC9B,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,EACjB,uBAAuB,EACxB,MAAM,SAAS,CAAC;AAuFjB;;;;;;;;;;;;GAYG;AACH,qBAAa,wBAAyB,YAAW,oBAAoB;IAEjE,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,eAAe;gBADf,YAAY,EAAE,YAAY,EAC1B,eAAe,EAAE,OAAO;IAG5B,oBAAoB,IAAI,OAAO,CAAC,iBAAiB,CAAC;IAYlD,uBAAuB,IAAI,OAAO,CAAC,uBAAuB,CAAC;IAY3D,0BAA0B,CAC9B,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,uBAAuB,CAAC;IAa7B,8BAA8B,IAAI,OAAO,CAAC,MAAM,CAAC;IAWjD,yBAAyB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAKjE;;;;;;OAMG;IACG,qBAAqB,IAAI,OAAO,CAAC,kBAAkB,CAAC;IA2C1D;;;;;;;;;OASG;IACG,sBAAsB,CAC1B,gBAAgB,CAAC,EAAE,8BAA8B,GAChD,OAAO,CAAC,qBAAqB,CAAC;CAqClC"}

package/dist/tbv/core/clients/eth/protocol-params-validation.d.ts ADDED Viewed

@@ -0,0 +1,27 @@
+import { PegInConfiguration, TBVProtocolParams, VersionedOffchainParams } from './types';
+/**
+ * Validate an `offchainParamsVersion` value sourced from a contract read.
+ * `Number()` on a malformed payload yields `NaN` or a non-integer; both
+ * silently break consumers that loop `1..version` or use the value as a
+ * map key. Used by reader entry points that surface the version to JS.
+ */
+export declare function assertValidOffchainParamsVersion(version: number): void;
+/**
+ * Validate offchain params consistency and bounds.
+ * @throws Error on invalid values to prevent constructing invalid Bitcoin scripts.
+ */
+export declare function validateOffchainParams(params: VersionedOffchainParams): void;
+/**
+ * Validate TBV protocol params returned from the contract.
+ * @throws Error on invalid amounts or out-of-range bounded fields.
+ */
+export declare function validateTBVProtocolParams(params: TBVProtocolParams): void;
+/**
+ * Validate the full peg-in configuration after assembly.
+ * Checks both TBV params and offchain params consistency, and the
+ * top-level `offchainParamsVersion` (which originates from a separate
+ * multicall result and so must be range-checked alongside the params it
+ * names).
+ */
+export declare function validatePegInConfiguration(config: PegInConfiguration): void;
+//# sourceMappingURL=protocol-params-validation.d.ts.map

package/dist/tbv/core/clients/eth/protocol-params-validation.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"protocol-params-validation.d.ts","sourceRoot":"","sources":["../../../../../src/tbv/core/clients/eth/protocol-params-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EACV,kBAAkB,EAClB,iBAAiB,EACjB,uBAAuB,EACxB,MAAM,SAAS,CAAC;AAiBjB;;;;;GAKG;AACH,wBAAgB,gCAAgC,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAUtE;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,GAAG,IAAI,CAqG5E;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAwCzE;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,kBAAkB,GAAG,IAAI,CAa3E"}

package/dist/tbv/core/clients/eth/types.d.ts CHANGED Viewed

@@ -45,6 +45,12 @@ export interface VaultRegistryReader {
     getVaultProtocolInfo(vaultId: Hex): Promise<VaultProtocolInfo>;
     getVaultData(vaultId: Hex): Promise<VaultData>;
     getVaultProviderBtcPubKey(vpAddress: Address): Promise<OnChainBtcPubkey>;
+    /**
+     * Read `offchainParamsVersion` for many vaults in a single multicall.
+     * Returns versions in the same order as the input. Throws if any vault
+     * is missing on-chain.
+     */
+    getOffchainParamsVersionsByVaultIds(vaultIds: readonly Hex[]): Promise<number[]>;
 }
 /**
  * TBV protocol parameters from the ProtocolParams contract.
@@ -96,7 +102,30 @@ export interface PegInConfiguration {
     timelockRefund: number;
     minVpCommissionBps: number;
     offchainParams: VersionedOffchainParams;
+    /**
+     * Version label paired atomically with `offchainParams`.
+     * Read in the same multicall as the params struct so that, if a parameter
+     * update lands between separate reads, the script-construction code and
+     * the version label stay consistent.
+     */
+    offchainParamsVersion: number;
+}
+/**
+ * All offchain params snapshots indexed by version, plus the latest version
+ * number known when the snapshot was taken. Used by consumers that need to
+ * resolve any historical version (e.g. signing for an existing vault locked
+ * to an older version).
+ */
+export interface AllOffchainParamsData {
+    byVersion: Map<number, VersionedOffchainParams>;
+    latestVersion: number;
 }
+/**
+ * Optional observer invoked by `fetchAllOffchainParams` when a historical
+ * version fails validation. Called once per skipped version so callers can
+ * log/telemeter without coupling the SDK to a specific logger.
+ */
+export type OnSkippedOffchainParamsVersion = (version: number, error: Error) => void;
 /** Interface for reading protocol parameters from the ProtocolParams contract. */
 export interface ProtocolParamsReader {
     getTBVProtocolParams(): Promise<TBVProtocolParams>;
@@ -105,6 +134,7 @@ export interface ProtocolParamsReader {
     getLatestOffchainParamsVersion(): Promise<number>;
     getTimelockPeginByVersion(version: number): Promise<number>;
     getPegInConfiguration(): Promise<PegInConfiguration>;
+    fetchAllOffchainParams(onSkippedVersion?: OnSkippedOffchainParamsVersion): Promise<AllOffchainParamsData>;
 }
 /**
  * Matches Solidity struct `BTCVaultTypes.AddressBTCKeyPair` exactly.