@babylonlabs-io/ts-sdk 0.27.1 → 0.28.0

package/dist/index.js

@@ -1,125 +1,125 @@
 import { i as e, g as t, h as r, d as o, a as i, b as n, c as l, e as u, f as d } from "./challengeAssert-j2Vwqo0-.js";
 import { computeMinClaimValue as c, deriveVaultId as T } from "@babylonlabs-io/babylon-tbv-rust-wasm";
-import { a as S, b as E, c as A, e as g } from "./payout-B_fvQU3q.js";
-import { d as _, a as m, e as x, f as b, g as I, h as f, i as v, b as C, p as U, s as O, t as h, u as y, v as N } from "./bitcoin-B-Y0DlqR.js";
-import { C as B, P as F, a as D, c as H, g as M } from "./signing-BZigafm0.js";
+import { a as S, b as A, c as E, e as _ } from "./payout-B_fvQU3q.js";
+import { d as R, a as m, e as x, f as b, g as I, h as f, i as v, b as C, p as U, s as O, t as V, u as h, v as N } from "./bitcoin-B-Y0DlqR.js";
+import { C as F, P as B, a as D, c as M, g as H } from "./signing-BZigafm0.js";
 import { B as k, H as W, K as X, M as K, T as w } from "./validation-CxqROCno.js";
-import { B as Y, C as J, P as j, a as Z, m as z, h as q, i as Q, l as $, k as aa, p as sa, b as ea, s as ta, v as ra, g as oa, d as ia, c as na, j as la, e as ua, f as da, w as Pa } from "./buildAndBroadcastRefund-BzYJv-Fv.js";
+import { B as Y, C as J, P as j, a as Z, m as z, h as q, i as Q, l as $, k as aa, p as sa, b as ea, s as ta, v as ra, g as oa, d as ia, c as na, j as la, e as ua, f as da, w as Pa } from "./buildAndBroadcastRefund-Cc4-L7gX.js";
 import { BitcoinNetworks as Ta } from "./shared/index.js";
-import { B as Sa, D as Ea, F as Aa, L as ga, M as Ra, P as _a, b as ma, a as xa, S as ba, T as Ia, W as fa, f as va, c as Ca, p as Ua, r as Oa } from "./fundPeginTransaction-oV-dNJOU.js";
-import { B as ya, U as Na, a as Va, f as Ba, c as Fa, e as Da, g as Ha, i as Ma, h as La, s as ka, b as Wa, d as Xa, v as Ka } from "./psbtInputFields-DeTFSJOq.js";
-import { C as Ga, P as Ya, l as Ja, n as ja, c as Za, d as za, a as qa, f as Qa, j as $a, k as as, e as ss, g as es, h as ts, i as rs, b as os, m as is } from "./context-ktqanzXE.js";
-import { A as ls, M as us, P as ds, S as Ps, V as cs, k as Ts, l as ps, m as Ss, n as Es, h as As, j as gs, g as Rs, a as _s, b as ms, c as xs, d as bs, e as Is, f as fs, p as vs, r as Cs, v as Us, i as Os } from "./vault-registry-reader-CpCOte7w.js";
-import { B as ys, D as Ns, b as Vs, J as Bs, a as Fs, d as Ds, P as Hs, R as Ms, c as Ls, V as ks } from "./sha2-ZzfZqQSw.js";
+import { B as Sa, D as Aa, F as Ea, L as _a, M as ga, P as Ra, b as ma, a as xa, S as ba, T as Ia, W as fa, f as va, c as Ca, p as Ua, r as Oa } from "./fundPeginTransaction-oV-dNJOU.js";
+import { B as ha, U as Na, a as ya, f as Fa, c as Ba, e as Da, g as Ma, i as Ha, h as La, s as ka, b as Wa, d as Xa, v as Ka } from "./psbtInputFields-DeTFSJOq.js";
+import { C as Ga, P as Ya, V as Ja, k as ja, l as Za, c as za, m as qa, d as Qa, b as $a, f as as, j as ss, e as es, g as ts, h as rs, i as os, a as is } from "./deriveVaultRoot-DAMZDqg-.js";
+import { A as ls, M as us, P as ds, S as Ps, V as cs, k as Ts, l as ps, m as Ss, n as As, h as Es, j as _s, g as gs, a as Rs, b as ms, c as xs, d as bs, e as Is, f as fs, p as vs, r as Cs, v as Us, i as Os } from "./vault-registry-reader-CshEgmS0.js";
+import { B as hs, D as Ns, b as ys, J as Fs, a as Bs, d as Ds, P as Ms, R as Hs, c as Ls, V as ks } from "./types-CQ86O7NX.js";
 export {
   ls as ApplicationRegistryABI,
   Y as BIP68NotMatureError,
   k as BITCOIN_ADDRESS_RE,
-  ys as BTCVaultRegistryABI,
+  hs as BTCVaultRegistryABI,
   Sa as BTC_DUST_SAT,
   Ta as BitcoinNetworks,
-  ya as BitcoinScriptType,
+  ha as BitcoinScriptType,
   Ga as CONTRACT_ERRORS,
   J as ClaimerPegoutStatusValue,
-  B as ContractStatus,
-  Ea as DUST_THRESHOLD,
+  F as ContractStatus,
+  Aa as DUST_THRESHOLD,
   Ns as DaemonStatus,
-  Aa as FEE_SAFETY_MARGIN,
+  Ea as FEE_SAFETY_MARGIN,
   W as HEX_RE,
-  Vs as JSON_RPC_ERROR_CODES,
-  Bs as JsonRpcClient,
-  Fs as JsonRpcError,
+  ys as JSON_RPC_ERROR_CODES,
+  Fs as JsonRpcClient,
+  Bs as JsonRpcError,
   X as KNOWN_SCRIPT_PREFIXES,
-  ga as LOW_RATE_ESTIMATION_ACCURACY_BUFFER,
-  Ra as MAX_NON_LEGACY_OUTPUT_SIZE,
+  _a as LOW_RATE_ESTIMATION_ACCURACY_BUFFER,
+  ga as MAX_NON_LEGACY_OUTPUT_SIZE,
   K as MAX_REASONABLE_FEE_SATS,
   us as MEMPOOL_API_URLS,
-  _a as P2TR_INPUT_SIZE,
+  Ra as P2TR_INPUT_SIZE,
   ma as PEGIN_AUTH_ANCHOR_OUTPUTS,
   xa as PEGIN_FIXED_OUTPUTS,
   Ds as POST_WOTS_STATUSES,
-  Hs as PRE_DEPOSITOR_SIGNATURES_STATES,
+  Ms as PRE_DEPOSITOR_SIGNATURES_STATES,
   j as PayoutManager,
-  F as PeginAction,
+  B as PeginAction,
   Ya as PeginManager,
   ds as ProtocolParamsABI,
-  Ms as RpcErrorCode,
+  Hs as RpcErrorCode,
   ba as SPLIT_TX_FEE_SAFETY_MULTIPLIER,
   Ps as ServerIdentityError,
   w as TXID_RE,
   Ia as TX_BUFFER_SIZE_OVERHEAD,
   Na as UtxoNotAvailableError,
+  Ja as VAULT_APP_NAME,
   Ls as VP_TERMINAL_STATUSES,
   ks as VP_TRANSIENT_STATUSES,
   cs as VaultProviderRpcClient,
   Ts as ViemProtocolParamsReader,
   ps as ViemUniversalChallengerReader,
   Ss as ViemVaultKeeperReader,
-  Es as ViemVaultRegistryReader,
-  As as VpResponseValidationError,
-  gs as VpTokenProvider,
+  As as ViemVaultRegistryReader,
+  Es as VpResponseValidationError,
+  _s as VpTokenProvider,
   fa as WALLET_RELAY_FEE_RATE_THRESHOLD,
   Z as activateVault,
-  Va as assertUtxosAvailable,
+  ya as assertUtxosAvailable,
   z as buildAndBroadcastRefund,
   e as buildChallengeAssertPsbt,
   t as buildDepositorPayoutPsbt,
-  Ja as buildFundingOutpointsCommitment,
+  ja as buildFundingOutpointsCommitment,
   r as buildNoPayoutPsbt,
   S as buildPayoutPsbt,
   o as buildPeginInputPsbt,
   i as buildPeginTxFromFundedPrePegin,
   n as buildPrePeginPsbt,
-  E as buildRefundPsbt,
-  ja as buildVaultContext,
-  Ba as calculateBtcTxHash,
+  A as buildRefundPsbt,
+  Za as buildVaultContext,
+  Fa as calculateBtcTxHash,
   D as canPerformAction,
-  Fa as collectReservedUtxoRefs,
+  Ba as collectReservedUtxoRefs,
   q as computeHashlock,
   c as computeMinClaimValue,
   l as computeNumLocalChallengers,
-  Za as computeWotsBlockPublicKeysHash,
-  A as createPayoutScript,
-  H as createTaprootScriptPathSignOptions,
-  _ as deriveNativeSegwitAddress,
+  za as computeWotsBlockPublicKeysHash,
+  E as createPayoutScript,
+  M as createTaprootScriptPathSignOptions,
+  R as deriveNativeSegwitAddress,
   m as deriveTaprootAddress,
   T as deriveVaultId,
-  za as deriveWotsBlockPublicKeys,
-  qa as deriveWotsPkHash,
+  qa as deriveVaultRoot,
+  Qa as deriveWotsBlocksFromSeed,
   x as ensureHexPrefix,
-  Qa as expandAuthAnchor,
-  $a as expandHashlockSecret,
-  as as expandWotsSeed,
-  ss as extractErrorData,
+  $a as expandAuthAnchor,
+  as as expandHashlockSecret,
+  ss as expandWotsSeed,
+  es as extractErrorData,
   Da as extractInputsFromTransaction,
-  g as extractPayoutSignature,
+  _ as extractPayoutSignature,
   u as extractPeginInputSignature,
   d as finalizePeginInputPsbt,
   b as formatSatoshisToBtc,
   va as fundPeginTransaction,
-  Rs as getAddressTxs,
-  _s as getAddressUtxos,
-  es as getContractErrorMessage,
-  Ha as getDustThreshold,
+  gs as getAddressTxs,
+  Rs as getAddressUtxos,
+  ts as getContractErrorMessage,
+  Ma as getDustThreshold,
   ms as getMempoolApiUrl,
   I as getNetwork,
   xs as getNetworkFees,
-  M as getPeginProtocolState,
-  Ma as getPsbtInputFields,
+  H as getPeginProtocolState,
+  Ha as getPsbtInputFields,
   La as getScriptType,
   bs as getTxHex,
   Is as getTxInfo,
   fs as getUtxoInfo,
-  ts as handleContractError,
+  rs as handleContractError,
   f as hexToUint8Array,
   v as isAddressFromPublicKey,
   Q as isDepositAmountValid,
-  rs as isKnownContractError,
+  os as isKnownContractError,
   $ as isPegoutTerminalStatus,
   aa as isRecognizedPegoutStatus,
   C as isValidHex,
-  os as isWotsMismatchError,
-  is as mnemonicToWotsSeed,
+  is as isWotsMismatchError,
   Ca as parseUnfundedWasmTransaction,
   Ua as peginOutputCount,
   sa as pollAndSignPayouts,
@@ -133,8 +133,8 @@ export {
   ea as signDepositorGraph,
   O as stripHexPrefix,
   ta as submitWotsPublicKey,
-  h as toXOnly,
-  y as uint8ArrayToHex,
+  V as toXOnly,
+  h as uint8ArrayToHex,
   ra as validateDepositAmount,
   oa as validateMultiVaultDepositInputs,
   ia as validateProviderSelection,

package/dist/sha2-CPdTLk1u.js

@@ -0,0 +1,280 @@
+var U = Object.defineProperty;
+var B = (t, e, s) => e in t ? U(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;
+var a = (t, e, s) => B(t, typeof e != "symbol" ? e + "" : e, s);
+function I(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function E(t, e = "") {
+  if (!Number.isSafeInteger(t) || t < 0) {
+    const s = e && `"${e}" `;
+    throw new Error(`${s}expected integer >= 0, got ${t}`);
+  }
+}
+function m(t, e, s = "") {
+  const i = I(t), n = t == null ? void 0 : t.length, c = e !== void 0;
+  if (!i || c && n !== e) {
+    const o = s && `"${s}" `, f = c ? ` of length ${e}` : "", h = i ? `length=${n}` : `type=${typeof t}`;
+    throw new Error(o + "expected Uint8Array" + f + ", got " + h);
+  }
+  return t;
+}
+function N(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash must wrapped by utils.createHasher");
+  E(t.outputLen), E(t.blockLen);
+}
+function H(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function _(t, e) {
+  m(t, void 0, "digestInto() output");
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error('"digestInto() output" expected to be of length >=' + s);
+}
+function T(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+}
+function L(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function w(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function x(t, e) {
+  return t << 32 - e | t >>> e;
+}
+function z(t, e) {
+  return t << e | t >>> 32 - e >>> 0;
+}
+const k = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function S(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+}
+function C(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = S(t[e]);
+  return t;
+}
+const K = k ? (t) => t : C;
+function D(t, e = {}) {
+  const s = (n, c) => t(c).update(n).digest(), i = t(void 0);
+  return s.outputLen = i.outputLen, s.blockLen = i.blockLen, s.create = (n) => t(n), Object.assign(s, e), Object.freeze(s);
+}
+const O = (t) => ({
+  oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
+});
+function $(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function F(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+class G {
+  constructor(e, s, i, n) {
+    a(this, "blockLen");
+    a(this, "outputLen");
+    a(this, "padOffset");
+    a(this, "isLE");
+    // For partial updates less than block size
+    a(this, "buffer");
+    a(this, "view");
+    a(this, "finished", !1);
+    a(this, "length", 0);
+    a(this, "pos", 0);
+    a(this, "destroyed", !1);
+    this.blockLen = e, this.outputLen = s, this.padOffset = i, this.isLE = n, this.buffer = new Uint8Array(e), this.view = w(this.buffer);
+  }
+  update(e) {
+    H(this), m(e);
+    const { view: s, buffer: i, blockLen: n } = this, c = e.length;
+    for (let o = 0; o < c; ) {
+      const f = Math.min(n - this.pos, c - o);
+      if (f === n) {
+        const h = w(e);
+        for (; n <= c - o; o += n)
+          this.process(h, o);
+        continue;
+      }
+      i.set(e.subarray(o, o + f), this.pos), this.pos += f, o += f, this.pos === n && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    H(this), _(e, this), this.finished = !0;
+    const { buffer: s, view: i, blockLen: n, isLE: c } = this;
+    let { pos: o } = this;
+    s[o++] = 128, L(this.buffer.subarray(o)), this.padOffset > n - o && (this.process(i, 0), o = 0);
+    for (let r = o; r < n; r++)
+      s[r] = 0;
+    i.setBigUint64(n - 8, BigInt(this.length * 8), c), this.process(i, 0);
+    const f = w(e), h = this.outputLen;
+    if (h % 4)
+      throw new Error("_sha2: outputLen must be aligned to 32bit");
+    const u = h / 4, b = this.get();
+    if (u > b.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let r = 0; r < u; r++)
+      f.setUint32(4 * r, b[r], c);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const i = e.slice(0, s);
+    return this.destroy(), i;
+  }
+  _cloneInto(e) {
+    e || (e = new this.constructor()), e.set(...this.get());
+    const { blockLen: s, buffer: i, length: n, finished: c, destroyed: o, pos: f } = this;
+    return e.destroyed = o, e.finished = c, e.length = n, e.pos = f, n % s && e.buffer.set(i), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+const d = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), V = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), p = /* @__PURE__ */ new Uint32Array(64);
+class M extends G {
+  constructor(e) {
+    super(64, e, 8, !1);
+  }
+  get() {
+    const { A: e, B: s, C: i, D: n, E: c, F: o, G: f, H: h } = this;
+    return [e, s, i, n, c, o, f, h];
+  }
+  // prettier-ignore
+  set(e, s, i, n, c, o, f, h) {
+    this.A = e | 0, this.B = s | 0, this.C = i | 0, this.D = n | 0, this.E = c | 0, this.F = o | 0, this.G = f | 0, this.H = h | 0;
+  }
+  process(e, s) {
+    for (let r = 0; r < 16; r++, s += 4)
+      p[r] = e.getUint32(s, !1);
+    for (let r = 16; r < 64; r++) {
+      const g = p[r - 15], l = p[r - 2], A = x(g, 7) ^ x(g, 18) ^ g >>> 3, y = x(l, 17) ^ x(l, 19) ^ l >>> 10;
+      p[r] = y + p[r - 7] + A + p[r - 16] | 0;
+    }
+    let { A: i, B: n, C: c, D: o, E: f, F: h, G: u, H: b } = this;
+    for (let r = 0; r < 64; r++) {
+      const g = x(f, 6) ^ x(f, 11) ^ x(f, 25), l = b + g + $(f, h, u) + V[r] + p[r] | 0, y = (x(i, 2) ^ x(i, 13) ^ x(i, 22)) + F(i, n, c) | 0;
+      b = u, u = h, h = f, f = o + l | 0, o = c, c = n, n = i, i = l + y | 0;
+    }
+    i = i + this.A | 0, n = n + this.B | 0, c = c + this.C | 0, o = o + this.D | 0, f = f + this.E | 0, h = h + this.F | 0, u = u + this.G | 0, b = b + this.H | 0, this.set(i, n, c, o, f, h, u, b);
+  }
+  roundClean() {
+    L(p);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), L(this.buffer);
+  }
+}
+class j extends M {
+  constructor() {
+    super(32);
+    // We cannot use array here since array allows indexing by variable
+    // which means optimizer/compiler cannot use registers.
+    a(this, "A", d[0] | 0);
+    a(this, "B", d[1] | 0);
+    a(this, "C", d[2] | 0);
+    a(this, "D", d[3] | 0);
+    a(this, "E", d[4] | 0);
+    a(this, "F", d[5] | 0);
+    a(this, "G", d[6] | 0);
+    a(this, "H", d[7] | 0);
+  }
+}
+const q = /* @__PURE__ */ D(
+  () => new j(),
+  /* @__PURE__ */ O(1)
+);
+export {
+  G as H,
+  L as a,
+  E as b,
+  D as c,
+  K as d,
+  H as e,
+  m as f,
+  _ as g,
+  N as h,
+  z as r,
+  q as s,
+  T as u
+};
+//# sourceMappingURL=sha2-CPdTLk1u.js.map

package/dist/sha2-CPdTLk1u.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sha2-CPdTLk1u.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' => 10*16+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 / (1024**6)) 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]}

package/dist/sha2-CsTynrfJ.cjs

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