@sentio/sdk-bundle 4.0.1-rc.2 → 4.0.1-rc.4

package/dist/{keyless-B3QnUmtL.js → keyless-nGiRkJjM.js}

@@ -1,5 +1,5 @@
 import { a as __name, i as __exportAll, n as __commonJSMin } from "./bignumber-DddanwOv.js";
-import { A as bytesToHex$2, B as randomBytes$2, C as SHA256_IV$1, D as ahash$1, E as aexists$2, F as createView$2, H as rotr$1, I as hexToBytes$2, L as isBytes$3, M as clean$2, N as concatBytes$2, O as anumber$3, P as createHasher$2, R as kdfInputToBytes, S as Maj$1, T as abytes$3, V as rotl, _ as shrSH$1, a as add3L$1, b as Chi$1, c as add5H$1, g as rotrSL$1, h as rotrSH$1, i as add3H$1, j as checkOpts, l as add5L$1, m as rotrBL$1, n as createBase58check, o as add4H$1, p as rotrBH$1, r as add$1, s as add4L$1, v as shrSL$1, w as SHA512_IV$1, x as HashMD$1, y as split$1, z as oidNist$1 } from "./base-BvfRCgEy.js";
+import { A as anumber$4, B as rotr$1, C as rotrSL$1, D as abytes$4, E as split$1, F as createHasher$2, I as hexToBytes$2, L as isBytes$4, M as bytesToHex$2, N as clean$2, O as aexists$2, P as concatBytes$2, R as oidNist$1, S as rotrSH$1, T as shrSL$1, U as u32$1, V as swap32IfBE$1, _ as rotlSL, a as SHA512_IV$1, b as rotrBH$1, c as add3L$1, d as add5H$1, f as add5L$1, g as rotlSH, h as rotlBL, i as SHA256_IV$1, j as aoutput$2, k as ahash$1, l as add4H$1, m as rotlBH, n as HashMD$1, o as add$1, r as Maj$1, s as add3H$1, t as Chi$1, u as add4L$1, w as shrSH$1, x as rotrBL$1, z as randomBytes$2 } from "./_md-CZAi2AzY.js";
 
 //#region ../../node_modules/.pnpm/@aptos-labs+ts-sdk@7.1.0/node_modules/@aptos-labs/ts-sdk/dist/utils/const.js
 /**
@@ -91,413 +91,6 @@ const FIREBASE_AUTH_ISS_PATTERN = /^https:\/\/securetoken\.google\.com\/[a-zA-Z0
 */
 const TEXT_ENCODER = new TextEncoder();
 
-//#endregion
-//#region ../../node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/utils.js
-/**
-* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.
-* @param a - value to test
-* @returns `true` when the value is a Uint8Array-compatible view.
-* @example
-* Check whether a value is a Uint8Array-compatible view.
-* ```ts
-* isBytes(new Uint8Array([1, 2, 3]));
-* ```
-*/
-function isBytes$2(a) {
-	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in a && a.BYTES_PER_ELEMENT === 1;
-}
-__name(isBytes$2, "isBytes");
-/**
-* Asserts something is a non-negative integer.
-* @param n - number to validate
-* @param title - label included in thrown errors
-* @throws On wrong argument types. {@link TypeError}
-* @throws On wrong argument ranges or values. {@link RangeError}
-* @example
-* Validate a non-negative integer option.
-* ```ts
-* anumber(32, 'length');
-* ```
-*/
-function anumber$2(n, title = "") {
-	if (typeof n !== "number") {
-		const prefix = title && `"${title}" `;
-		throw new TypeError(`${prefix}expected number, got ${typeof n}`);
-	}
-	if (!Number.isSafeInteger(n) || n < 0) {
-		const prefix = title && `"${title}" `;
-		throw new RangeError(`${prefix}expected integer >= 0, got ${n}`);
-	}
-}
-__name(anumber$2, "anumber");
-/**
-* Asserts something is Uint8Array.
-* @param value - value to validate
-* @param length - optional exact length constraint
-* @param title - label included in thrown errors
-* @returns The validated byte array.
-* @throws On wrong argument types. {@link TypeError}
-* @throws On wrong argument ranges or values. {@link RangeError}
-* @example
-* Validate that a value is a byte array.
-* ```ts
-* abytes(new Uint8Array([1, 2, 3]));
-* ```
-*/
-function abytes$2(value, length, title = "") {
-	const bytes = isBytes$2(value);
-	const len = value?.length;
-	const needsLen = length !== void 0;
-	if (!bytes || needsLen && len !== length) {
-		const prefix = title && `"${title}" `;
-		const ofLen = needsLen ? ` of length ${length}` : "";
-		const got = bytes ? `length=${len}` : `type=${typeof value}`;
-		const message = prefix + "expected Uint8Array" + ofLen + ", got " + got;
-		if (!bytes) throw new TypeError(message);
-		throw new RangeError(message);
-	}
-	return value;
-}
-__name(abytes$2, "abytes");
-/**
-* Asserts something is a wrapped hash constructor.
-* @param h - hash constructor to validate
-* @throws On wrong argument types or invalid hash wrapper shape. {@link TypeError}
-* @throws On invalid hash metadata ranges or values. {@link RangeError}
-* @throws If the hash metadata allows empty outputs or block sizes. {@link Error}
-* @example
-* Validate a callable hash wrapper.
-* ```ts
-* import { ahash } from '@noble/hashes/utils.js';
-* import { sha256 } from '@noble/hashes/sha2.js';
-* ahash(sha256);
-* ```
-*/
-function ahash(h) {
-	if (typeof h !== "function" || typeof h.create !== "function") throw new TypeError("Hash must wrapped by utils.createHasher");
-	anumber$2(h.outputLen);
-	anumber$2(h.blockLen);
-	if (h.outputLen < 1) throw new Error("\"outputLen\" must be >= 1");
-	if (h.blockLen < 1) throw new Error("\"blockLen\" must be >= 1");
-}
-/**
-* Asserts a hash instance has not been destroyed or finished.
-* @param instance - hash instance to validate
-* @param checkFinished - whether to reject finalized instances
-* @throws If the hash instance has already been destroyed or finalized. {@link Error}
-* @example
-* Validate that a hash instance is still usable.
-* ```ts
-* import { aexists } from '@noble/hashes/utils.js';
-* import { sha256 } from '@noble/hashes/sha2.js';
-* const hash = sha256.create();
-* aexists(hash);
-* ```
-*/
-function aexists$1(instance, checkFinished = true) {
-	if (instance.destroyed) throw new Error("Hash instance has been destroyed");
-	if (checkFinished && instance.finished) throw new Error("Hash#digest() has already been called");
-}
-__name(aexists$1, "aexists");
-/**
-* Asserts output is a sufficiently-sized byte array.
-* @param out - destination buffer
-* @param instance - hash instance providing output length
-* Oversized buffers are allowed; downstream code only promises to fill the first `outputLen` bytes.
-* @throws On wrong argument types. {@link TypeError}
-* @throws On wrong argument ranges or values. {@link RangeError}
-* @example
-* Validate a caller-provided digest buffer.
-* ```ts
-* import { aoutput } from '@noble/hashes/utils.js';
-* import { sha256 } from '@noble/hashes/sha2.js';
-* const hash = sha256.create();
-* aoutput(new Uint8Array(hash.outputLen), hash);
-* ```
-*/
-function aoutput$1(out, instance) {
-	abytes$2(out, void 0, "digestInto() output");
-	const min = instance.outputLen;
-	if (out.length < min) throw new RangeError("\"digestInto() output\" expected to be of length >=" + min);
-}
-__name(aoutput$1, "aoutput");
-/**
-* Casts a typed array view to Uint32Array.
-* `arr.byteOffset` must already be 4-byte aligned or the platform
-* Uint32Array constructor will throw.
-* @param arr - source typed array
-* @returns Uint32Array view over the same buffer.
-* @example
-* Reinterpret a byte array as 32-bit words.
-* ```ts
-* u32(new Uint8Array(8));
-* ```
-*/
-function u32$1(arr) {
-	return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
-}
-__name(u32$1, "u32");
-/**
-* Zeroizes typed arrays in place. Warning: JS provides no guarantees.
-* @param arrays - arrays to overwrite with zeros
-* @example
-* Zeroize sensitive buffers in place.
-* ```ts
-* clean(new Uint8Array([1, 2, 3]));
-* ```
-*/
-function clean$1(...arrays) {
-	for (let i = 0; i < arrays.length; i++) arrays[i].fill(0);
-}
-__name(clean$1, "clean");
-/**
-* Creates a DataView for byte-level manipulation.
-* @param arr - source typed array
-* @returns DataView over the same buffer region.
-* @example
-* Create a DataView over an existing buffer.
-* ```ts
-* createView(new Uint8Array(4));
-* ```
-*/
-function createView$1(arr) {
-	return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-}
-__name(createView$1, "createView");
-/**
-* Rotate-right operation for uint32 values.
-* @param word - source word
-* @param shift - shift amount in bits
-* @returns Rotated word.
-* @example
-* Rotate a 32-bit word to the right.
-* ```ts
-* rotr(0x12345678, 8);
-* ```
-*/
-function rotr(word, shift) {
-	return word << 32 - shift | word >>> shift;
-}
-/** Whether the current platform is little-endian. */
-const isLE$1 = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68)();
-/**
-* Byte-swap operation for uint32 values.
-* @param word - source word
-* @returns Word with reversed byte order.
-* @example
-* Reverse the byte order of a 32-bit word.
-* ```ts
-* byteSwap(0x11223344);
-* ```
-*/
-function byteSwap$1(word) {
-	return word << 24 & 4278190080 | word << 8 & 16711680 | word >>> 8 & 65280 | word >>> 24 & 255;
-}
-__name(byteSwap$1, "byteSwap");
-/**
-* Byte-swaps every word of a Uint32Array in place.
-* @param arr - array to mutate
-* @returns The same array after mutation; callers pass live state arrays here.
-* @example
-* Reverse the byte order of every word in place.
-* ```ts
-* byteSwap32(new Uint32Array([0x11223344]));
-* ```
-*/
-function byteSwap32$1(arr) {
-	for (let i = 0; i < arr.length; i++) arr[i] = byteSwap$1(arr[i]);
-	return arr;
-}
-__name(byteSwap32$1, "byteSwap32");
-/**
-* Conditionally byte-swaps a Uint32Array on big-endian platforms.
-* @param u - array to normalize for host endianness
-* @returns Original or byte-swapped array depending on platform endianness.
-*   On big-endian runtimes this mutates `u` in place via `byteSwap32(...)`.
-* @example
-* Normalize a word array for host endianness.
-* ```ts
-* swap32IfBE(new Uint32Array([0x11223344]));
-* ```
-*/
-const swap32IfBE$1 = isLE$1 ? (u) => u : byteSwap32$1;
-const hasHexBuiltin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function")();
-const hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
-/**
-* Convert byte array to hex string.
-* Uses the built-in function when available and assumes it matches the tested
-* fallback semantics.
-* @param bytes - bytes to encode
-* @returns Lowercase hexadecimal string.
-* @throws On wrong argument types. {@link TypeError}
-* @example
-* Convert bytes to lowercase hexadecimal.
-* ```ts
-* bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'
-* ```
-*/
-function bytesToHex$1(bytes) {
-	abytes$2(bytes);
-	if (hasHexBuiltin) return bytes.toHex();
-	let hex = "";
-	for (let i = 0; i < bytes.length; i++) hex += hexes[bytes[i]];
-	return hex;
-}
-__name(bytesToHex$1, "bytesToHex");
-const asciis = {
-	_0: 48,
-	_9: 57,
-	A: 65,
-	F: 70,
-	a: 97,
-	f: 102
-};
-function asciiToBase16(ch) {
-	if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0;
-	if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10);
-	if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10);
-}
-/**
-* Convert hex string to byte array. Uses built-in function, when available.
-* @param hex - hexadecimal string to decode
-* @returns Decoded bytes.
-* @throws On wrong argument types. {@link TypeError}
-* @throws On wrong argument ranges or values. {@link RangeError}
-* @example
-* Decode lowercase hexadecimal into bytes.
-* ```ts
-* hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])
-* ```
-*/
-function hexToBytes$1(hex) {
-	if (typeof hex !== "string") throw new TypeError("hex string expected, got " + typeof hex);
-	if (hasHexBuiltin) try {
-		return Uint8Array.fromHex(hex);
-	} catch (error) {
-		if (error instanceof SyntaxError) throw new RangeError(error.message);
-		throw error;
-	}
-	const hl = hex.length;
-	const al = hl / 2;
-	if (hl % 2) throw new RangeError("hex string expected, got unpadded hex of length " + hl);
-	const array = new Uint8Array(al);
-	for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
-		const n1 = asciiToBase16(hex.charCodeAt(hi));
-		const n2 = asciiToBase16(hex.charCodeAt(hi + 1));
-		if (n1 === void 0 || n2 === void 0) {
-			const char = hex[hi] + hex[hi + 1];
-			throw new RangeError("hex string expected, got non-hex character \"" + char + "\" at index " + hi);
-		}
-		array[ai] = n1 * 16 + n2;
-	}
-	return array;
-}
-__name(hexToBytes$1, "hexToBytes");
-/**
-* Copies several Uint8Arrays into one.
-* @param arrays - arrays to concatenate
-* @returns Concatenated byte array.
-* @throws On wrong argument types. {@link TypeError}
-* @example
-* Concatenate multiple byte arrays.
-* ```ts
-* concatBytes(new Uint8Array([1]), new Uint8Array([2]));
-* ```
-*/
-function concatBytes$1(...arrays) {
-	let sum = 0;
-	for (let i = 0; i < arrays.length; i++) {
-		const a = arrays[i];
-		abytes$2(a);
-		sum += a.length;
-	}
-	const res = new Uint8Array(sum);
-	for (let i = 0, pad = 0; i < arrays.length; i++) {
-		const a = arrays[i];
-		res.set(a, pad);
-		pad += a.length;
-	}
-	return res;
-}
-__name(concatBytes$1, "concatBytes");
-/**
-* Creates a callable hash function from a stateful class constructor.
-* @param hashCons - hash constructor or factory
-* @param info - optional metadata such as DER OID
-* @returns Frozen callable hash wrapper with `.create()`.
-*   Wrapper construction eagerly calls `hashCons(undefined)` once to read
-*   `outputLen` / `blockLen`, so constructor side effects happen at module
-*   init time.
-* @example
-* Wrap a stateful hash constructor into a callable helper.
-* ```ts
-* import { createHasher } from '@noble/hashes/utils.js';
-* import { sha256 } from '@noble/hashes/sha2.js';
-* const wrapped = createHasher(sha256.create, { oid: sha256.oid });
-* wrapped(new Uint8Array([1]));
-* ```
-*/
-function createHasher$1(hashCons, info = {}) {
-	const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
-	const tmp = hashCons(void 0);
-	hashC.outputLen = tmp.outputLen;
-	hashC.blockLen = tmp.blockLen;
-	hashC.canXOF = tmp.canXOF;
-	hashC.create = (opts) => hashCons(opts);
-	Object.assign(hashC, info);
-	return Object.freeze(hashC);
-}
-__name(createHasher$1, "createHasher");
-/**
-* Cryptographically secure PRNG backed by `crypto.getRandomValues`.
-* @param bytesLength - number of random bytes to generate
-* @returns Random bytes.
-* The platform `getRandomValues()` implementation still defines any
-* single-call length cap, and this helper rejects oversize requests
-* with a stable library `RangeError` instead of host-specific errors.
-* @throws On wrong argument types. {@link TypeError}
-* @throws On wrong argument ranges or values. {@link RangeError}
-* @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}
-* @example
-* Generate a fresh random key or nonce.
-* ```ts
-* const key = randomBytes(16);
-* ```
-*/
-function randomBytes$1(bytesLength = 32) {
-	anumber$2(bytesLength, "bytesLength");
-	const cr = typeof globalThis === "object" ? globalThis.crypto : null;
-	if (typeof cr?.getRandomValues !== "function") throw new Error("crypto.getRandomValues must be defined");
-	if (bytesLength > 65536) throw new RangeError(`"bytesLength" expected <= 65536, got ${bytesLength}`);
-	return cr.getRandomValues(new Uint8Array(bytesLength));
-}
-__name(randomBytes$1, "randomBytes");
-/**
-* Creates OID metadata for NIST hashes with prefix `06 09 60 86 48 01 65 03 04 02`.
-* @param suffix - final OID byte for the selected hash.
-*   The helper accepts any byte even though only the documented NIST hash
-*   suffixes are meaningful downstream.
-* @returns Object containing the DER-encoded OID.
-* @example
-* Build OID metadata for a NIST hash.
-* ```ts
-* oidNist(0x01);
-* ```
-*/
-const oidNist = (suffix) => ({ oid: Uint8Array.from([
-	6,
-	9,
-	96,
-	134,
-	72,
-	1,
-	101,
-	3,
-	4,
-	2,
-	suffix
-]) });
-
 //#endregion
 //#region ../../node_modules/.pnpm/@aptos-labs+ts-sdk@7.1.0/node_modules/@aptos-labs/ts-sdk/dist/bcs/consts.js
 const MAX_U16_NUMBER = 65535;
@@ -616,7 +209,7 @@ var Hex = class Hex {
 	* @category Serialization
 	*/
 	toStringWithoutPrefix() {
-		return bytesToHex$1(this.data);
+		return bytesToHex$2(this.data);
 	}
 	/**
 	* Get the hex data as a string with the 0x prefix.
@@ -645,7 +238,7 @@ var Hex = class Hex {
 		if (input.length === 0) throw new ParsingError("Hex string is too short, must be at least 1 char long, excluding the optional leading 0x.", HexInvalidReason.TOO_SHORT);
 		if (input.length % 2 !== 0) throw new ParsingError("Hex string must be an even number of hex characters.", HexInvalidReason.INVALID_LENGTH);
 		try {
-			return new Hex(hexToBytes$1(input));
+			return new Hex(hexToBytes$2(input));
 		} catch (error) {
 			throw new ParsingError(`Hex string contains invalid hex characters: ${error?.message}`, HexInvalidReason.INVALID_HEX_CHARS);
 		}
@@ -1867,7 +1460,7 @@ var AccountAddress = class AccountAddress extends Serializable {
 	* @category Serialization
 	*/
 	toStringWithoutPrefix() {
-		let hex = bytesToHex$1(this.data);
+		let hex = bytesToHex$2(this.data);
 		if (this.isSpecial()) hex = hex[hex.length - 1];
 		return hex;
 	}
@@ -1894,7 +1487,7 @@ var AccountAddress = class AccountAddress extends Serializable {
 	* @category Serialization
 	*/
 	toStringLongWithoutPrefix() {
-		return bytesToHex$1(this.data);
+		return bytesToHex$2(this.data);
 	}
 	/**
 	* Convert the account address to a string in SHORT format, which is 0x followed by the shortest
@@ -1916,7 +1509,7 @@ var AccountAddress = class AccountAddress extends Serializable {
 	* @category Serialization
 	*/
 	toStringShortWithoutPrefix() {
-		const hex = bytesToHex$1(this.data).replace(/^0+/, "");
+		const hex = bytesToHex$2(this.data).replace(/^0+/, "");
 		return hex === "" ? "0" : hex;
 	}
 	/**
@@ -2068,7 +1661,7 @@ var AccountAddress = class AccountAddress extends Serializable {
 		if (maxMissingChars > 63 || maxMissingChars < 0) throw new ParsingError(`maxMissingChars must be between or equal to 0 and 63. Received ${maxMissingChars}`, AddressInvalidReason.INVALID_PADDING_STRICTNESS);
 		let addressBytes;
 		try {
-			addressBytes = hexToBytes$1(parsedInput.padStart(64, "0"));
+			addressBytes = hexToBytes$2(parsedInput.padStart(64, "0"));
 		} catch (error) {
 			throw new ParsingError(`Hex characters are invalid: ${error?.message}`, AddressInvalidReason.INVALID_HEX_CHARS);
 		}
@@ -2147,54 +1740,6 @@ Received ${input}`, AddressInvalidReason.TOO_SHORT);
 	}
 };
 
-//#endregion
-//#region ../../node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/_u64.js
-const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-const _32n = /* @__PURE__ */ BigInt(32);
-function fromBig(n, le = false) {
-	if (le) return {
-		h: Number(n & U32_MASK64),
-		l: Number(n >> _32n & U32_MASK64)
-	};
-	return {
-		h: Number(n >> _32n & U32_MASK64) | 0,
-		l: Number(n & U32_MASK64) | 0
-	};
-}
-function split(lst, le = false) {
-	const len = lst.length;
-	let Ah = new Uint32Array(len);
-	let Al = new Uint32Array(len);
-	for (let i = 0; i < len; i++) {
-		const { h, l } = fromBig(lst[i], le);
-		[Ah[i], Al[i]] = [h, l];
-	}
-	return [Ah, Al];
-}
-const shrSH = (h, _l, s) => h >>> s;
-const shrSL = (h, l, s) => h << 32 - s | l >>> s;
-const rotrSH = (h, l, s) => h >>> s | l << 32 - s;
-const rotrSL = (h, l, s) => h << 32 - s | l >>> s;
-const rotrBH = (h, l, s) => h << 64 - s | l >>> s - 32;
-const rotrBL = (h, l, s) => h >>> s - 32 | l << 64 - s;
-const rotlSH = (h, l, s) => h << s | l >>> 32 - s;
-const rotlSL = (h, l, s) => l << s | h >>> 32 - s;
-const rotlBH = (h, l, s) => l << s - 32 | h >>> 64 - s;
-const rotlBL = (h, l, s) => h << s - 32 | l >>> 64 - s;
-function add(Ah, Al, Bh, Bl) {
-	const l = (Al >>> 0) + (Bl >>> 0);
-	return {
-		h: Ah + Bh + (l / 2 ** 32 | 0) | 0,
-		l: l | 0
-	};
-}
-const add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
-const add3H = (low, Ah, Bh, Ch) => Ah + Bh + Ch + (low / 2 ** 32 | 0) | 0;
-const add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
-const add4H = (low, Ah, Bh, Ch, Dh) => Ah + Bh + Ch + Dh + (low / 2 ** 32 | 0) | 0;
-const add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
-const add5H = (low, Ah, Bh, Ch, Dh, Eh) => Ah + Bh + Ch + Dh + Eh + (low / 2 ** 32 | 0) | 0;
-
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/sha3.js
 /**
@@ -2230,7 +1775,7 @@ for (let round = 0, R = _1n$14, x = 1, y = 0; round < 24; round++) {
 	}
 	_SHA3_IOTA.push(t);
 }
-const IOTAS = split(_SHA3_IOTA, true);
+const IOTAS = split$1(_SHA3_IOTA, true);
 const SHA3_IOTA_H = IOTAS[0];
 const SHA3_IOTA_L = IOTAS[1];
 const rotlH = (h, l, s) => s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s);
@@ -2248,7 +1793,7 @@ const rotlL = (h, l, s) => s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s);
 * ```
 */
 function keccakP(s, rounds = 24) {
-	anumber$2(rounds, "rounds");
+	anumber$4(rounds, "rounds");
 	if (rounds < 1 || rounds > 24) throw new Error("\"rounds\" expected integer 1..24");
 	const B = /* @__PURE__ */ new Uint32Array(10);
 	for (let round = 24 - rounds; round < 24; round++) {
@@ -2296,7 +1841,7 @@ function keccakP(s, rounds = 24) {
 		s[0] ^= SHA3_IOTA_H[round];
 		s[1] ^= SHA3_IOTA_L[round];
 	}
-	clean$1(B);
+	clean$2(B);
 }
 /**
 * Keccak sponge function.
@@ -2335,7 +1880,7 @@ var Keccak = class Keccak {
 		this.enableXOF = enableXOF;
 		this.canXOF = enableXOF;
 		this.rounds = rounds;
-		anumber$2(outputLen, "outputLen");
+		anumber$4(outputLen, "outputLen");
 		if (!(0 < blockLen && blockLen < 200)) throw new Error("only keccak-f1600 function is supported");
 		this.state = /* @__PURE__ */ new Uint8Array(200);
 		this.state32 = u32$1(this.state);
@@ -2351,8 +1896,8 @@ var Keccak = class Keccak {
 		this.pos = 0;
 	}
 	update(data) {
-		aexists$1(this);
-		abytes$2(data);
+		aexists$2(this);
+		abytes$4(data);
 		const { blockLen, state } = this;
 		const len = data.length;
 		for (let pos = 0; pos < len;) {
@@ -2372,8 +1917,8 @@ var Keccak = class Keccak {
 		this.keccak();
 	}
 	writeInto(out) {
-		aexists$1(this, false);
-		abytes$2(out);
+		aexists$2(this, false);
+		abytes$4(out);
 		this.finish();
 		const bufferOut = this.state;
 		const { blockLen } = this;
@@ -2391,11 +1936,11 @@ var Keccak = class Keccak {
 		return this.writeInto(out);
 	}
 	xof(bytes) {
-		anumber$2(bytes);
+		anumber$4(bytes);
 		return this.xofInto(new Uint8Array(bytes));
 	}
 	digestInto(out) {
-		aoutput$1(out, this);
+		aoutput$2(out, this);
 		if (this.finished) throw new Error("digest() was already called");
 		this.writeInto(out.subarray(0, this.outputLen));
 		this.destroy();
@@ -2407,7 +1952,7 @@ var Keccak = class Keccak {
 	}
 	destroy() {
 		this.destroyed = true;
-		clean$1(this.state);
+		clean$2(this.state);
 	}
 	_cloneInto(to) {
 		const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
@@ -2426,7 +1971,7 @@ var Keccak = class Keccak {
 		return to;
 	}
 };
-const genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher$1(() => new Keccak(blockLen, suffix, outputLen), info);
+const genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher$2(() => new Keccak(blockLen, suffix, outputLen), info);
 /**
 * SHA3-256 hash function. Different from keccak-256.
 * @param msg - message bytes to hash
@@ -2437,7 +1982,7 @@ const genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher$1(()
 * sha3_256(new Uint8Array([97, 98, 99]));
 * ```
 */
-const sha3_256 = /* @__PURE__ */ genKeccak(6, 136, 32, /* @__PURE__ */ oidNist(8));
+const sha3_256 = /* @__PURE__ */ genKeccak(6, 136, 32, /* @__PURE__ */ oidNist$1(8));
 
 //#endregion
 //#region ../../node_modules/.pnpm/@aptos-labs+ts-sdk@7.1.0/node_modules/@aptos-labs/ts-sdk/dist/core/account/utils/address.js
@@ -2839,193 +2384,6 @@ var AuthenticationKey = class AuthenticationKey extends Serializable {
 	}
 };
 
-//#endregion
-//#region ../../node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/_md.js
-/**
-* Internal Merkle-Damgard hash utils.
-* @module
-*/
-/**
-* Shared 32-bit conditional boolean primitive reused by SHA-256, SHA-1, and MD5 `F`.
-* Returns bits from `b` when `a` is set, otherwise from `c`.
-* The XOR form is equivalent to MD5's `F(X,Y,Z) = XY v not(X)Z` because the masked terms never
-* set the same bit.
-* @param a - selector word
-* @param b - word chosen when selector bit is set
-* @param c - word chosen when selector bit is clear
-* @returns Mixed 32-bit word.
-* @example
-* Combine three words with the shared 32-bit choice primitive.
-* ```ts
-* Chi(0xffffffff, 0x12345678, 0x87654321);
-* ```
-*/
-function Chi(a, b, c) {
-	return a & b ^ ~a & c;
-}
-/**
-* Shared 32-bit majority primitive reused by SHA-256 and SHA-1.
-* Returns bits shared by at least two inputs.
-* @param a - first input word
-* @param b - second input word
-* @param c - third input word
-* @returns Mixed 32-bit word.
-* @example
-* Combine three words with the shared 32-bit majority primitive.
-* ```ts
-* Maj(0xffffffff, 0x12345678, 0x87654321);
-* ```
-*/
-function Maj(a, b, c) {
-	return a & b ^ a & c ^ b & c;
-}
-/**
-* Merkle-Damgard hash construction base class.
-* Could be used to create MD5, RIPEMD, SHA1, SHA2.
-* Accepts only byte-aligned `Uint8Array` input, even when the underlying spec describes bit
-* strings with partial-byte tails.
-* @param blockLen - internal block size in bytes
-* @param outputLen - digest size in bytes
-* @param padOffset - trailing length field size in bytes
-* @param isLE - whether length and state words are encoded in little-endian
-* @example
-* Use a concrete subclass to get the shared Merkle-Damgard update/digest flow.
-* ```ts
-* import { _SHA1 } from '@noble/hashes/legacy.js';
-* const hash = new _SHA1();
-* hash.update(new Uint8Array([97, 98, 99]));
-* hash.digest();
-* ```
-*/
-var HashMD = class {
-	blockLen;
-	outputLen;
-	canXOF = false;
-	padOffset;
-	isLE;
-	buffer;
-	view;
-	finished = false;
-	length = 0;
-	pos = 0;
-	destroyed = false;
-	constructor(blockLen, outputLen, padOffset, isLE) {
-		this.blockLen = blockLen;
-		this.outputLen = outputLen;
-		this.padOffset = padOffset;
-		this.isLE = isLE;
-		this.buffer = new Uint8Array(blockLen);
-		this.view = createView$1(this.buffer);
-	}
-	update(data) {
-		aexists$1(this);
-		abytes$2(data);
-		const { view, buffer, blockLen } = this;
-		const len = data.length;
-		for (let pos = 0; pos < len;) {
-			const take = Math.min(blockLen - this.pos, len - pos);
-			if (take === blockLen) {
-				const dataView = createView$1(data);
-				for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);
-				continue;
-			}
-			buffer.set(data.subarray(pos, pos + take), this.pos);
-			this.pos += take;
-			pos += take;
-			if (this.pos === blockLen) {
-				this.process(view, 0);
-				this.pos = 0;
-			}
-		}
-		this.length += data.length;
-		this.roundClean();
-		return this;
-	}
-	digestInto(out) {
-		aexists$1(this);
-		aoutput$1(out, this);
-		this.finished = true;
-		const { buffer, view, blockLen, isLE } = this;
-		let { pos } = this;
-		buffer[pos++] = 128;
-		clean$1(this.buffer.subarray(pos));
-		if (this.padOffset > blockLen - pos) {
-			this.process(view, 0);
-			pos = 0;
-		}
-		for (let i = pos; i < blockLen; i++) buffer[i] = 0;
-		view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);
-		this.process(view, 0);
-		const oview = createView$1(out);
-		const len = this.outputLen;
-		if (len % 4) throw new Error("_sha2: outputLen must be aligned to 32bit");
-		const outLen = len / 4;
-		const state = this.get();
-		if (outLen > state.length) throw new Error("_sha2: outputLen bigger than state");
-		for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);
-	}
-	digest() {
-		const { buffer, outputLen } = this;
-		this.digestInto(buffer);
-		const res = buffer.slice(0, outputLen);
-		this.destroy();
-		return res;
-	}
-	_cloneInto(to) {
-		to ||= new this.constructor();
-		to.set(...this.get());
-		const { blockLen, buffer, length, finished, destroyed, pos } = this;
-		to.destroyed = destroyed;
-		to.finished = finished;
-		to.length = length;
-		to.pos = pos;
-		if (length % blockLen) to.buffer.set(buffer);
-		return to;
-	}
-	clone() {
-		return this._cloneInto();
-	}
-};
-/**
-* Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
-* Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
-*/
-/** Initial SHA256 state from RFC 6234 §6.1: the first 32 bits of the fractional parts of the
-* square roots of the first eight prime numbers. Exported as a shared table; callers must treat
-* it as read-only because constructors copy words from it by index. */
-const SHA256_IV = /* @__PURE__ */ Uint32Array.from([
-	1779033703,
-	3144134277,
-	1013904242,
-	2773480762,
-	1359893119,
-	2600822924,
-	528734635,
-	1541459225
-]);
-/** Initial SHA512 state from RFC 6234 §6.3: eight RFC 64-bit `H(0)` words stored as sixteen
-* big-endian 32-bit halves. Derived from the fractional parts of the square roots of the first
-* eight prime numbers. Exported as a shared table; callers must treat it as read-only because
-* constructors copy halves from it by index. */
-const SHA512_IV = /* @__PURE__ */ Uint32Array.from([
-	1779033703,
-	4089235720,
-	3144134277,
-	2227873595,
-	1013904242,
-	4271175723,
-	2773480762,
-	1595750129,
-	1359893119,
-	2917565137,
-	2600822924,
-	725511199,
-	528734635,
-	4215389547,
-	1541459225,
-	327033209
-]);
-
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/sha2.js
 /**
@@ -3108,7 +2466,7 @@ const SHA256_K$1 = /* @__PURE__ */ Uint32Array.from([
 /** Reusable SHA-224 / SHA-256 message schedule buffer `W_t` from RFC 6234 §6.2 step 1. */
 const SHA256_W$1 = /* @__PURE__ */ new Uint32Array(64);
 /** Internal SHA-224 / SHA-256 compression engine from RFC 6234 §6.2. */
-var SHA2_32B$1 = class extends HashMD {
+var SHA2_32B$1 = class extends HashMD$1 {
 	static {
 		__name(this, "SHA2_32B");
 	}
@@ -3143,14 +2501,14 @@ var SHA2_32B$1 = class extends HashMD {
 		for (let i = 16; i < 64; i++) {
 			const W15 = SHA256_W$1[i - 15];
 			const W2 = SHA256_W$1[i - 2];
-			const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ W15 >>> 3;
-			SHA256_W$1[i] = (rotr(W2, 17) ^ rotr(W2, 19) ^ W2 >>> 10) + SHA256_W$1[i - 7] + s0 + SHA256_W$1[i - 16] | 0;
+			const s0 = rotr$1(W15, 7) ^ rotr$1(W15, 18) ^ W15 >>> 3;
+			SHA256_W$1[i] = (rotr$1(W2, 17) ^ rotr$1(W2, 19) ^ W2 >>> 10) + SHA256_W$1[i - 7] + s0 + SHA256_W$1[i - 16] | 0;
 		}
 		let { A, B, C, D, E, F, G, H } = this;
 		for (let i = 0; i < 64; i++) {
-			const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-			const T1 = H + sigma1 + Chi(E, F, G) + SHA256_K$1[i] + SHA256_W$1[i] | 0;
-			const T2 = (rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22)) + Maj(A, B, C) | 0;
+			const sigma1 = rotr$1(E, 6) ^ rotr$1(E, 11) ^ rotr$1(E, 25);
+			const T1 = H + sigma1 + Chi$1(E, F, G) + SHA256_K$1[i] + SHA256_W$1[i] | 0;
+			const T2 = (rotr$1(A, 2) ^ rotr$1(A, 13) ^ rotr$1(A, 22)) + Maj$1(A, B, C) | 0;
 			H = G;
 			G = F;
 			F = E;
@@ -3171,12 +2529,12 @@ var SHA2_32B$1 = class extends HashMD {
 		this.set(A, B, C, D, E, F, G, H);
 	}
 	roundClean() {
-		clean$1(SHA256_W$1);
+		clean$2(SHA256_W$1);
 	}
 	destroy() {
 		this.destroyed = true;
 		this.set(0, 0, 0, 0, 0, 0, 0, 0);
-		clean$1(this.buffer);
+		clean$2(this.buffer);
 	}
 };
 /** Internal SHA-256 hash class grounded in RFC 6234 §6.2. */
@@ -3184,19 +2542,19 @@ var _SHA256$1 = class extends SHA2_32B$1 {
 	static {
 		__name(this, "_SHA256");
 	}
-	A = SHA256_IV[0] | 0;
-	B = SHA256_IV[1] | 0;
-	C = SHA256_IV[2] | 0;
-	D = SHA256_IV[3] | 0;
-	E = SHA256_IV[4] | 0;
-	F = SHA256_IV[5] | 0;
-	G = SHA256_IV[6] | 0;
-	H = SHA256_IV[7] | 0;
+	A = SHA256_IV$1[0] | 0;
+	B = SHA256_IV$1[1] | 0;
+	C = SHA256_IV$1[2] | 0;
+	D = SHA256_IV$1[3] | 0;
+	E = SHA256_IV$1[4] | 0;
+	F = SHA256_IV$1[5] | 0;
+	G = SHA256_IV$1[6] | 0;
+	H = SHA256_IV$1[7] | 0;
 	constructor() {
 		super(32);
 	}
 };
-const K512$1 = /* @__PURE__ */ (() => split([
+const K512$1 = /* @__PURE__ */ (() => split$1([
 	"0x428a2f98d728ae22",
 	"0x7137449123ef65cd",
 	"0xb5c0fbcfec4d3b2f",
@@ -3283,7 +2641,7 @@ const SHA512_Kl$1 = /* @__PURE__ */ (() => K512$1[1])();
 const SHA512_W_H$1 = /* @__PURE__ */ new Uint32Array(80);
 const SHA512_W_L$1 = /* @__PURE__ */ new Uint32Array(80);
 /** Internal SHA-384 / SHA-512 compression engine from RFC 6234 §6.4. */
-var SHA2_64B$1 = class extends HashMD {
+var SHA2_64B$1 = class extends HashMD$1 {
 	static {
 		__name(this, "SHA2_64B");
 	}
@@ -3337,27 +2695,27 @@ var SHA2_64B$1 = class extends HashMD {
 		for (let i = 16; i < 80; i++) {
 			const W15h = SHA512_W_H$1[i - 15] | 0;
 			const W15l = SHA512_W_L$1[i - 15] | 0;
-			const s0h = rotrSH(W15h, W15l, 1) ^ rotrSH(W15h, W15l, 8) ^ shrSH(W15h, W15l, 7);
-			const s0l = rotrSL(W15h, W15l, 1) ^ rotrSL(W15h, W15l, 8) ^ shrSL(W15h, W15l, 7);
+			const s0h = rotrSH$1(W15h, W15l, 1) ^ rotrSH$1(W15h, W15l, 8) ^ shrSH$1(W15h, W15l, 7);
+			const s0l = rotrSL$1(W15h, W15l, 1) ^ rotrSL$1(W15h, W15l, 8) ^ shrSL$1(W15h, W15l, 7);
 			const W2h = SHA512_W_H$1[i - 2] | 0;
 			const W2l = SHA512_W_L$1[i - 2] | 0;
-			const s1h = rotrSH(W2h, W2l, 19) ^ rotrBH(W2h, W2l, 61) ^ shrSH(W2h, W2l, 6);
-			const s1l = rotrSL(W2h, W2l, 19) ^ rotrBL(W2h, W2l, 61) ^ shrSL(W2h, W2l, 6);
-			const SUMl = add4L(s0l, s1l, SHA512_W_L$1[i - 7], SHA512_W_L$1[i - 16]);
-			SHA512_W_H$1[i] = add4H(SUMl, s0h, s1h, SHA512_W_H$1[i - 7], SHA512_W_H$1[i - 16]) | 0;
+			const s1h = rotrSH$1(W2h, W2l, 19) ^ rotrBH$1(W2h, W2l, 61) ^ shrSH$1(W2h, W2l, 6);
+			const s1l = rotrSL$1(W2h, W2l, 19) ^ rotrBL$1(W2h, W2l, 61) ^ shrSL$1(W2h, W2l, 6);
+			const SUMl = add4L$1(s0l, s1l, SHA512_W_L$1[i - 7], SHA512_W_L$1[i - 16]);
+			SHA512_W_H$1[i] = add4H$1(SUMl, s0h, s1h, SHA512_W_H$1[i - 7], SHA512_W_H$1[i - 16]) | 0;
 			SHA512_W_L$1[i] = SUMl | 0;
 		}
 		let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;
 		for (let i = 0; i < 80; i++) {
-			const sigma1h = rotrSH(Eh, El, 14) ^ rotrSH(Eh, El, 18) ^ rotrBH(Eh, El, 41);
-			const sigma1l = rotrSL(Eh, El, 14) ^ rotrSL(Eh, El, 18) ^ rotrBL(Eh, El, 41);
+			const sigma1h = rotrSH$1(Eh, El, 14) ^ rotrSH$1(Eh, El, 18) ^ rotrBH$1(Eh, El, 41);
+			const sigma1l = rotrSL$1(Eh, El, 14) ^ rotrSL$1(Eh, El, 18) ^ rotrBL$1(Eh, El, 41);
 			const CHIh = Eh & Fh ^ ~Eh & Gh;
 			const CHIl = El & Fl ^ ~El & Gl;
-			const T1ll = add5L(Hl, sigma1l, CHIl, SHA512_Kl$1[i], SHA512_W_L$1[i]);
-			const T1h = add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh$1[i], SHA512_W_H$1[i]);
+			const T1ll = add5L$1(Hl, sigma1l, CHIl, SHA512_Kl$1[i], SHA512_W_L$1[i]);
+			const T1h = add5H$1(T1ll, Hh, sigma1h, CHIh, SHA512_Kh$1[i], SHA512_W_H$1[i]);
 			const T1l = T1ll | 0;
-			const sigma0h = rotrSH(Ah, Al, 28) ^ rotrBH(Ah, Al, 34) ^ rotrBH(Ah, Al, 39);
-			const sigma0l = rotrSL(Ah, Al, 28) ^ rotrBL(Ah, Al, 34) ^ rotrBL(Ah, Al, 39);
+			const sigma0h = rotrSH$1(Ah, Al, 28) ^ rotrBH$1(Ah, Al, 34) ^ rotrBH$1(Ah, Al, 39);
+			const sigma0l = rotrSL$1(Ah, Al, 28) ^ rotrBL$1(Ah, Al, 34) ^ rotrBL$1(Ah, Al, 39);
 			const MAJh = Ah & Bh ^ Ah & Ch ^ Bh & Ch;
 			const MAJl = Al & Bl ^ Al & Cl ^ Bl & Cl;
 			Hh = Gh | 0;
@@ -3366,33 +2724,33 @@ var SHA2_64B$1 = class extends HashMD {
 			Gl = Fl | 0;
 			Fh = Eh | 0;
 			Fl = El | 0;
-			({h: Eh, l: El} = add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
+			({h: Eh, l: El} = add$1(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
 			Dh = Ch | 0;
 			Dl = Cl | 0;
 			Ch = Bh | 0;
 			Cl = Bl | 0;
 			Bh = Ah | 0;
 			Bl = Al | 0;
-			const All = add3L(T1l, sigma0l, MAJl);
-			Ah = add3H(All, T1h, sigma0h, MAJh);
+			const All = add3L$1(T1l, sigma0l, MAJl);
+			Ah = add3H$1(All, T1h, sigma0h, MAJh);
 			Al = All | 0;
 		}
-		({h: Ah, l: Al} = add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
-		({h: Bh, l: Bl} = add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
-		({h: Ch, l: Cl} = add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
-		({h: Dh, l: Dl} = add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
-		({h: Eh, l: El} = add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
-		({h: Fh, l: Fl} = add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
-		({h: Gh, l: Gl} = add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
-		({h: Hh, l: Hl} = add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
+		({h: Ah, l: Al} = add$1(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
+		({h: Bh, l: Bl} = add$1(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
+		({h: Ch, l: Cl} = add$1(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
+		({h: Dh, l: Dl} = add$1(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
+		({h: Eh, l: El} = add$1(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
+		({h: Fh, l: Fl} = add$1(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
+		({h: Gh, l: Gl} = add$1(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
+		({h: Hh, l: Hl} = add$1(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
 		this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
 	}
 	roundClean() {
-		clean$1(SHA512_W_H$1, SHA512_W_L$1);
+		clean$2(SHA512_W_H$1, SHA512_W_L$1);
 	}
 	destroy() {
 		this.destroyed = true;
-		clean$1(this.buffer);
+		clean$2(this.buffer);
 		this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
 	}
 };
@@ -3401,22 +2759,22 @@ var _SHA512$1 = class extends SHA2_64B$1 {
 	static {
 		__name(this, "_SHA512");
 	}
-	Ah = SHA512_IV[0] | 0;
-	Al = SHA512_IV[1] | 0;
-	Bh = SHA512_IV[2] | 0;
-	Bl = SHA512_IV[3] | 0;
-	Ch = SHA512_IV[4] | 0;
-	Cl = SHA512_IV[5] | 0;
-	Dh = SHA512_IV[6] | 0;
-	Dl = SHA512_IV[7] | 0;
-	Eh = SHA512_IV[8] | 0;
-	El = SHA512_IV[9] | 0;
-	Fh = SHA512_IV[10] | 0;
-	Fl = SHA512_IV[11] | 0;
-	Gh = SHA512_IV[12] | 0;
-	Gl = SHA512_IV[13] | 0;
-	Hh = SHA512_IV[14] | 0;
-	Hl = SHA512_IV[15] | 0;
+	Ah = SHA512_IV$1[0] | 0;
+	Al = SHA512_IV$1[1] | 0;
+	Bh = SHA512_IV$1[2] | 0;
+	Bl = SHA512_IV$1[3] | 0;
+	Ch = SHA512_IV$1[4] | 0;
+	Cl = SHA512_IV$1[5] | 0;
+	Dh = SHA512_IV$1[6] | 0;
+	Dl = SHA512_IV$1[7] | 0;
+	Eh = SHA512_IV$1[8] | 0;
+	El = SHA512_IV$1[9] | 0;
+	Fh = SHA512_IV$1[10] | 0;
+	Fl = SHA512_IV$1[11] | 0;
+	Gh = SHA512_IV$1[12] | 0;
+	Gl = SHA512_IV$1[13] | 0;
+	Hh = SHA512_IV$1[14] | 0;
+	Hl = SHA512_IV$1[15] | 0;
 	constructor() {
 		super(64);
 	}
@@ -3436,7 +2794,7 @@ var _SHA512$1 = class extends SHA2_64B$1 {
 * sha256(new Uint8Array([97, 98, 99]));
 * ```
 */
-const sha256$1 = /* @__PURE__ */ createHasher$1(() => new _SHA256$1(), /* @__PURE__ */ oidNist(1));
+const sha256$1 = /* @__PURE__ */ createHasher$2(() => new _SHA256$1(), /* @__PURE__ */ oidNist$1(1));
 /**
 * SHA2-512 hash function from RFC 4634.
 * @param msg - message bytes to hash
@@ -3447,7 +2805,7 @@ const sha256$1 = /* @__PURE__ */ createHasher$1(() => new _SHA256$1(), /* @__PUR
 * sha512(new Uint8Array([97, 98, 99]));
 * ```
 */
-const sha512$1 = /* @__PURE__ */ createHasher$1(() => new _SHA512$1(), /* @__PURE__ */ oidNist(3));
+const sha512$1 = /* @__PURE__ */ createHasher$2(() => new _SHA512$1(), /* @__PURE__ */ oidNist$1(3));
 
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+curves@2.2.0/node_modules/@noble/curves/utils.js
@@ -3469,7 +2827,7 @@ const sha512$1 = /* @__PURE__ */ createHasher$1(() => new _SHA512$1(), /* @__PUR
 * abytes(new Uint8Array(1));
 * ```
 */
-const abytes$1 = /* @__PURE__ */ __name((value, length, title) => abytes$2(value, length, title), "abytes");
+const abytes$3 = /* @__PURE__ */ __name((value, length, title) => abytes$4(value, length, title), "abytes");
 /**
 * Validates that a value is a non-negative safe integer.
 * @param n - Value to validate.
@@ -3481,7 +2839,7 @@ const abytes$1 = /* @__PURE__ */ __name((value, length, title) => abytes$2(value
 * anumber(1);
 * ```
 */
-const anumber$1 = anumber$2;
+const anumber$3 = anumber$4;
 /**
 * Encodes bytes as lowercase hex.
 * @param bytes - Bytes to encode.
@@ -3493,7 +2851,7 @@ const anumber$1 = anumber$2;
 * bytesToHex(Uint8Array.of(1, 2, 3));
 * ```
 */
-const bytesToHex = bytesToHex$1;
+const bytesToHex$1 = bytesToHex$2;
 /**
 * Concatenates byte arrays.
 * @param arrays - Byte arrays to join.
@@ -3505,7 +2863,7 @@ const bytesToHex = bytesToHex$1;
 * concatBytes(Uint8Array.of(1), Uint8Array.of(2));
 * ```
 */
-const concatBytes = (...arrays) => concatBytes$1(...arrays);
+const concatBytes$1 = /* @__PURE__ */ __name((...arrays) => concatBytes$2(...arrays), "concatBytes");
 /**
 * Decodes lowercase or uppercase hex into bytes.
 * @param hex - Hex string to decode.
@@ -3517,7 +2875,7 @@ const concatBytes = (...arrays) => concatBytes$1(...arrays);
 * hexToBytes('0102');
 * ```
 */
-const hexToBytes = (hex) => hexToBytes$1(hex);
+const hexToBytes$1 = /* @__PURE__ */ __name((hex) => hexToBytes$2(hex), "hexToBytes");
 /**
 * Checks whether a value is a Uint8Array.
 * @param a - Value to inspect.
@@ -3529,7 +2887,7 @@ const hexToBytes = (hex) => hexToBytes$1(hex);
 * isBytes(new Uint8Array(1));
 * ```
 */
-const isBytes$1 = isBytes$2;
+const isBytes$3 = isBytes$4;
 /**
 * Reads random bytes from the platform CSPRNG.
 * @param bytesLength - Number of random bytes to read.
@@ -3541,7 +2899,7 @@ const isBytes$1 = isBytes$2;
 * randomBytes(2);
 * ```
 */
-const randomBytes = (bytesLength) => randomBytes$1(bytesLength);
+const randomBytes$1 = /* @__PURE__ */ __name((bytesLength) => randomBytes$2(bytesLength), "randomBytes");
 const _0n$13 = /* @__PURE__ */ BigInt(0);
 const _1n$13 = /* @__PURE__ */ BigInt(1);
 /**
@@ -3580,7 +2938,7 @@ __name(abool$2, "abool");
 function abignumber$1(n) {
 	if (typeof n === "bigint") {
 		if (!isPosBig$1(n)) throw new RangeError("positive bigint expected, got " + n);
-	} else anumber$1(n);
+	} else anumber$3(n);
 	return n;
 }
 __name(abignumber$1, "abignumber");
@@ -3658,7 +3016,7 @@ __name(hexToNumber$1, "hexToNumber");
 * ```
 */
 function bytesToNumberBE$1(bytes) {
-	return hexToNumber$1(bytesToHex$1(bytes));
+	return hexToNumber$1(bytesToHex$2(bytes));
 }
 __name(bytesToNumberBE$1, "bytesToNumberBE");
 /**
@@ -3674,7 +3032,7 @@ __name(bytesToNumberBE$1, "bytesToNumberBE");
 * ```
 */
 function bytesToNumberLE$1(bytes) {
-	return hexToNumber$1(bytesToHex$1(copyBytes$2(abytes$2(bytes)).reverse()));
+	return hexToNumber$1(bytesToHex$2(copyBytes$2(abytes$4(bytes)).reverse()));
 }
 __name(bytesToNumberLE$1, "bytesToNumberLE");
 /**
@@ -3691,12 +3049,12 @@ __name(bytesToNumberLE$1, "bytesToNumberLE");
 * ```
 */
 function numberToBytesBE$1(n, len) {
-	anumber$2(len);
+	anumber$4(len);
 	if (len === 0) throw new RangeError("zero length");
 	n = abignumber$1(n);
 	const hex = n.toString(16);
 	if (hex.length > len * 2) throw new RangeError("number too large");
-	return hexToBytes$1(hex.padStart(len * 2, "0"));
+	return hexToBytes$2(hex.padStart(len * 2, "0"));
 }
 __name(numberToBytesBE$1, "numberToBytesBE");
 /**
@@ -3729,8 +3087,8 @@ __name(numberToBytesLE$1, "numberToBytesLE");
 * ```
 */
 function equalBytes$1(a, b) {
-	a = abytes$1(a);
-	b = abytes$1(b);
+	a = abytes$3(a);
+	b = abytes$3(b);
 	if (a.length !== b.length) return false;
 	let diff = 0;
 	for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];
@@ -3750,7 +3108,7 @@ __name(equalBytes$1, "equalBytes");
 * ```
 */
 function copyBytes$2(bytes) {
-	return Uint8Array.from(abytes$1(bytes));
+	return Uint8Array.from(abytes$3(bytes));
 }
 __name(copyBytes$2, "copyBytes");
 /**
@@ -3889,8 +3247,8 @@ const bitMask$1 = /* @__PURE__ */ __name((n) => (_1n$13 << BigInt(n)) - _1n$13,
 * ```
 */
 function createHmacDrbg$1(hashLen, qByteLen, hmacFn) {
-	anumber$2(hashLen, "hashLen");
-	anumber$2(qByteLen, "qByteLen");
+	anumber$4(hashLen, "hashLen");
+	anumber$4(qByteLen, "qByteLen");
 	if (typeof hmacFn !== "function") throw new TypeError("hmacFn must be a function");
 	const u8n = (len) => new Uint8Array(len);
 	const NULL = Uint8Array.of();
@@ -3905,7 +3263,7 @@ function createHmacDrbg$1(hashLen, qByteLen, hmacFn) {
 		k.fill(0);
 		i = 0;
 	};
-	const h = (...msgs) => hmacFn(k, concatBytes(v, ...msgs));
+	const h = (...msgs) => hmacFn(k, concatBytes$1(v, ...msgs));
 	const reseed = (seed = NULL) => {
 		k = h(byte0, seed);
 		v = h();
@@ -3923,7 +3281,7 @@ function createHmacDrbg$1(hashLen, qByteLen, hmacFn) {
 			out.push(sl);
 			len += v.length;
 		}
-		return concatBytes(...out);
+		return concatBytes$1(...out);
 	};
 	const genUntil = (seed, pred) => {
 		reset();
@@ -4410,7 +3768,7 @@ function FpIsSquare(Fp, n) {
 * ```
 */
 function nLength$1(n, nBitLength) {
-	if (nBitLength !== void 0) anumber$1(nBitLength);
+	if (nBitLength !== void 0) anumber$3(nBitLength);
 	if (n <= _0n$12) throw new Error("invalid n length: expected positive n, got " + n);
 	if (nBitLength !== void 0 && nBitLength < 1) throw new Error("invalid n length: expected positive bit length, got " + nBitLength);
 	const bits = bitLen$1(n);
@@ -4520,7 +3878,7 @@ var _Field$1 = class {
 		return this.isLE ? numberToBytesLE$1(num, this.BYTES) : numberToBytesBE$1(num, this.BYTES);
 	}
 	fromBytes(bytes, skipValidation = false) {
-		abytes$1(bytes);
+		abytes$3(bytes);
 		const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;
 		if (allowedLengths) {
 			if (bytes.length < 1 || !allowedLengths.includes(bytes.length) || bytes.length > BYTES) throw new Error("Field.fromBytes: expected " + allowedLengths + " bytes, got " + bytes.length);
@@ -4641,7 +3999,7 @@ __name(getMinHashLength$1, "getMinHashLength");
 * ```
 */
 function mapHashToField$1(key, fieldOrder, isLE = false) {
-	abytes$1(key);
+	abytes$3(key);
 	const len = key.length;
 	const fieldLen = getFieldBytesLength$1(fieldOrder);
 	const minLen = Math.max(getMinHashLength$1(fieldOrder), 16);
@@ -5139,7 +4497,7 @@ function edwards(params, extraOpts = {}) {
 		static fromBytes(bytes, zip215 = false) {
 			const len = Fp.BYTES;
 			const { a, d } = CURVE;
-			bytes = copyBytes$2(abytes$1(bytes, len, "point"));
+			bytes = copyBytes$2(abytes$3(bytes, len, "point"));
 			abool$2(zip215, "zip215");
 			const normed = copyBytes$2(bytes);
 			const lastByte = bytes[len - 1];
@@ -5159,7 +4517,7 @@ function edwards(params, extraOpts = {}) {
 			});
 		}
 		static fromHex(hex, zip215 = false) {
-			return Point.fromBytes(hexToBytes(hex), zip215);
+			return Point.fromBytes(hexToBytes$1(hex), zip215);
 		}
 		get x() {
 			return this.toAffine().x;
@@ -5286,7 +4644,7 @@ function edwards(params, extraOpts = {}) {
 			return bytes;
 		}
 		toHex() {
-			return bytesToHex(this.toBytes());
+			return bytesToHex$1(this.toBytes());
 		}
 		toString() {
 			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
@@ -5355,7 +4713,7 @@ var PrimeEdwardsPoint = class {
 		return this.ep.toAffine(invertedZ);
 	}
 	toHex() {
-		return bytesToHex(this.toBytes());
+		return bytesToHex$1(this.toBytes());
 	}
 	toString() {
 		return this.toHex();
@@ -5432,7 +4790,7 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		asafenumber(outputLen, "hash.outputLen");
 		if (outputLen !== expectedLen) throw new Error(`hash.outputLen must be ${expectedLen}, got ${outputLen}`);
 	}
-	const randomBytes$4 = opts.randomBytes === void 0 ? randomBytes : opts.randomBytes;
+	const randomBytes = opts.randomBytes === void 0 ? randomBytes$1 : opts.randomBytes;
 	const adjustScalarBytes = opts.adjustScalarBytes === void 0 ? (bytes) => bytes : opts.adjustScalarBytes;
 	const domain = opts.domain === void 0 ? (data, ctx, phflag) => {
 		abool$2(phflag, "phflag");
@@ -5444,8 +4802,8 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 	}
 	function getPrivateScalar(key) {
 		const len = lengths.secretKey;
-		abytes$1(key, lengths.secretKey, "secretKey");
-		const hashed = abytes$1(hash(key), 2 * len, "hashedSecretKey");
+		abytes$3(key, lengths.secretKey, "secretKey");
+		const hashed = abytes$3(hash(key), 2 * len, "hashedSecretKey");
 		const head = adjustScalarBytes(hashed.slice(0, len));
 		return {
 			head,
@@ -5472,11 +4830,11 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		return getExtendedPublicKey(secretKey).pointBytes;
 	}
 	function hashDomainToScalar(context = Uint8Array.of(), ...msgs) {
-		return modN_LE(hash(domain(concatBytes(...msgs), abytes$1(context, void 0, "context"), !!prehash)));
+		return modN_LE(hash(domain(concatBytes$1(...msgs), abytes$3(context, void 0, "context"), !!prehash)));
 	}
 	/** Signs message with secret key. RFC8032 5.1.6 */
 	function sign(msg, secretKey, options = {}) {
-		msg = abytes$1(msg, void 0, "message");
+		msg = abytes$3(msg, void 0, "message");
 		if (prehash) msg = prehash(msg);
 		const { prefix, scalar, pointBytes } = getExtendedPublicKey(secretKey);
 		const r = hashDomainToScalar(options.context, prefix, msg);
@@ -5484,7 +4842,7 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		const k = hashDomainToScalar(options.context, R, pointBytes, msg);
 		const s = Fn.create(r + k * scalar);
 		if (!Fn.isValid(s)) throw new Error("sign failed: invalid s");
-		return abytes$1(concatBytes(R, Fn.toBytes(s)), lengths.signature, "result");
+		return abytes$3(concatBytes$1(R, Fn.toBytes(s)), lengths.signature, "result");
 	}
 	const verifyOpts = { zip215: opts.zip215 };
 	/**
@@ -5495,9 +4853,9 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		const { context } = options;
 		const zip215 = options.zip215 === void 0 ? !!verifyOpts.zip215 : options.zip215;
 		const len = lengths.signature;
-		sig = abytes$1(sig, len, "signature");
-		msg = abytes$1(msg, void 0, "message");
-		publicKey = abytes$1(publicKey, lengths.publicKey, "publicKey");
+		sig = abytes$3(sig, len, "signature");
+		msg = abytes$3(msg, void 0, "message");
+		publicKey = abytes$3(publicKey, lengths.publicKey, "publicKey");
 		if (zip215 !== void 0) abool$2(zip215, "zip215");
 		if (prehash) msg = prehash(msg);
 		const mid = len / 2;
@@ -5525,11 +4883,11 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		seed: _size
 	};
 	function randomSecretKey(seed) {
-		seed = seed === void 0 ? randomBytes$4(lengths.seed) : seed;
-		return abytes$1(seed, lengths.seed, "seed");
+		seed = seed === void 0 ? randomBytes(lengths.seed) : seed;
+		return abytes$3(seed, lengths.seed, "seed");
 	}
 	function isValidSecretKey(key) {
-		return isBytes$1(key) && key.length === lengths.secretKey;
+		return isBytes$3(key) && key.length === lengths.secretKey;
 	}
 	function isValidPublicKey(key, zip215) {
 		try {
@@ -5562,7 +4920,7 @@ function eddsa(Point, cHash, eddsaOpts = {}) {
 		},
 		toMontgomerySecret(secretKey) {
 			const size = lengths.secretKey;
-			abytes$1(secretKey, size);
+			abytes$3(secretKey, size);
 			return adjustScalarBytes(hash(secretKey.subarray(0, size))).subarray(0, size);
 		}
 	};
@@ -5600,7 +4958,7 @@ function strxor(a, b) {
 	return arr;
 }
 function normDST(DST) {
-	if (!isBytes$1(DST) && typeof DST !== "string") throw new Error("DST must be Uint8Array or ascii string");
+	if (!isBytes$3(DST) && typeof DST !== "string") throw new Error("DST must be Uint8Array or ascii string");
 	const dst = typeof DST === "string" ? asciiToBytes(DST) : DST;
 	if (dst.length === 0) throw new Error("DST must be non-empty");
 	return dst;
@@ -5626,25 +4984,25 @@ function normDST(DST) {
 * ```
 */
 function expand_message_xmd(msg, DST, lenInBytes, H) {
-	abytes$1(msg);
+	abytes$3(msg);
 	asafenumber(lenInBytes);
 	DST = normDST(DST);
-	if (DST.length > 255) DST = H(concatBytes(asciiToBytes("H2C-OVERSIZE-DST-"), DST));
+	if (DST.length > 255) DST = H(concatBytes$1(asciiToBytes("H2C-OVERSIZE-DST-"), DST));
 	const { outputLen: b_in_bytes, blockLen: r_in_bytes } = H;
 	const ell = Math.ceil(lenInBytes / b_in_bytes);
 	if (lenInBytes > 65535 || ell > 255) throw new Error("expand_message_xmd: invalid lenInBytes");
-	const DST_prime = concatBytes(DST, i2osp(DST.length, 1));
+	const DST_prime = concatBytes$1(DST, i2osp(DST.length, 1));
 	const Z_pad = new Uint8Array(r_in_bytes);
 	const l_i_b_str = i2osp(lenInBytes, 2);
 	const b = new Array(ell);
-	const b_0 = H(concatBytes(Z_pad, msg, l_i_b_str, i2osp(0, 1), DST_prime));
-	b[0] = H(concatBytes(b_0, i2osp(1, 1), DST_prime));
-	for (let i = 1; i < ell; i++) b[i] = H(concatBytes(...[
+	const b_0 = H(concatBytes$1(Z_pad, msg, l_i_b_str, i2osp(0, 1), DST_prime));
+	b[0] = H(concatBytes$1(b_0, i2osp(1, 1), DST_prime));
+	for (let i = 1; i < ell; i++) b[i] = H(concatBytes$1(...[
 		strxor(b_0, b[i - 1]),
 		i2osp(i + 1, 1),
 		DST_prime
 	]));
-	return concatBytes(...b).slice(0, lenInBytes);
+	return concatBytes$1(...b).slice(0, lenInBytes);
 }
 /**
 * Produces a uniformly random byte string using an extendable-output function (XOF) H.
@@ -5676,7 +5034,7 @@ function expand_message_xmd(msg, DST, lenInBytes, H) {
 * ```
 */
 function expand_message_xof(msg, DST, lenInBytes, k, H) {
-	abytes$1(msg);
+	abytes$3(msg);
 	asafenumber(lenInBytes);
 	DST = normDST(DST);
 	if (DST.length > 255) {
@@ -5719,7 +5077,7 @@ function hash_to_field(msg, count, options) {
 	});
 	const { p, k, m, hash, expand, DST } = options;
 	asafenumber(hash.outputLen, "valid hash");
-	abytes$1(msg);
+	abytes$3(msg);
 	asafenumber(count);
 	if (count < 1) throw new Error("hash_to_field: expected count >= 1");
 	if (m < 1) throw new Error("hash_to_field: expected m >= 1");
@@ -5798,12 +5156,12 @@ const _DST_scalar = "HashToScalar-";
 * const point = hasher.encodeToCurve(new TextEncoder().encode('hello noble'));
 * ```
 */
-function createHasher(Point, mapToCurve, defaults) {
+function createHasher$1(Point, mapToCurve, defaults) {
 	if (typeof mapToCurve !== "function") throw new Error("mapToCurve() must be defined");
 	const snapshot = (src) => Object.freeze({
 		...src,
-		DST: isBytes$1(src.DST) ? copyBytes$2(src.DST) : src.DST,
-		...src.encodeDST === void 0 ? {} : { encodeDST: isBytes$1(src.encodeDST) ? copyBytes$2(src.encodeDST) : src.encodeDST }
+		DST: isBytes$3(src.DST) ? copyBytes$2(src.DST) : src.DST,
+		...src.encodeDST === void 0 ? {} : { encodeDST: isBytes$3(src.encodeDST) ? copyBytes$2(src.encodeDST) : src.encodeDST }
 	});
 	const safeDefaults = snapshot(defaults);
 	function map(num) {
@@ -5850,6 +5208,7 @@ function createHasher(Point, mapToCurve, defaults) {
 		}
 	});
 }
+__name(createHasher$1, "createHasher");
 
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+curves@2.2.0/node_modules/@noble/curves/ed25519.js
@@ -6015,7 +5374,7 @@ var _RistrettoPoint = class _RistrettoPoint extends PrimeEdwardsPoint {
 		return new _RistrettoPoint(ep);
 	}
 	static fromBytes(bytes) {
-		abytes$2(bytes, 32);
+		abytes$4(bytes, 32);
 		const { a, d } = ed25519_CURVE;
 		const P = ed25519_CURVE_p;
 		const mod = (n) => Fp$2.create(n);
@@ -6043,7 +5402,7 @@ var _RistrettoPoint = class _RistrettoPoint extends PrimeEdwardsPoint {
 	* @param hex - Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding
 	*/
 	static fromHex(hex) {
-		return _RistrettoPoint.fromBytes(hexToBytes$1(hex));
+		return _RistrettoPoint.fromBytes(hexToBytes$2(hex));
 	}
 	/**
 	* Encodes ristretto point to Uint8Array.
@@ -6139,7 +5498,7 @@ const ristretto255_hasher = Object.freeze({
 	* `hash_to_ristretto255` function defined in RFC 9380.
 	*/
 	deriveToCurve(bytes) {
-		abytes$2(bytes, 64);
+		abytes$4(bytes, 64);
 		const R1 = calcElligatorRistrettoMap(bytes255ToNumberLE(bytes.subarray(0, 32)));
 		const R2 = calcElligatorRistrettoMap(bytes255ToNumberLE(bytes.subarray(32, 64)));
 		return new _RistrettoPoint(R1.add(R2));
@@ -6169,8 +5528,8 @@ var _HMAC$1 = class {
 	finished = false;
 	destroyed = false;
 	constructor(hash, key) {
-		ahash(hash);
-		abytes$2(key, void 0, "key");
+		ahash$1(hash);
+		abytes$4(key, void 0, "key");
 		this.iHash = hash.create();
 		if (typeof this.iHash.update !== "function") throw new Error("Expected instance of class which extends utils.Hash");
 		this.blockLen = this.iHash.blockLen;
@@ -6183,16 +5542,16 @@ var _HMAC$1 = class {
 		this.oHash = hash.create();
 		for (let i = 0; i < pad.length; i++) pad[i] ^= 106;
 		this.oHash.update(pad);
-		clean$1(pad);
+		clean$2(pad);
 	}
 	update(buf) {
-		aexists$1(this);
+		aexists$2(this);
 		this.iHash.update(buf);
 		return this;
 	}
 	digestInto(out) {
-		aexists$1(this);
-		aoutput$1(out, this);
+		aexists$2(this);
+		aoutput$2(out, this);
 		this.finished = true;
 		const buf = out.subarray(0, this.outputLen);
 		this.iHash.digestInto(buf);
@@ -6232,6 +5591,194 @@ const hmac$1 = /* @__PURE__ */ (() => {
 	return hmac_;
 })();
 
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js
+/**
+* Utilities for hex, bytes, CSPRNG.
+* @module
+*/
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */
+function isBytes$2(a) {
+	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
+}
+__name(isBytes$2, "isBytes");
+/** Asserts something is positive integer. */
+function anumber$2(n, title = "") {
+	if (!Number.isSafeInteger(n) || n < 0) {
+		const prefix = title && `"${title}" `;
+		throw new Error(`${prefix}expected integer >= 0, got ${n}`);
+	}
+}
+__name(anumber$2, "anumber");
+/** Asserts something is Uint8Array. */
+function abytes$2(value, length, title = "") {
+	const bytes = isBytes$2(value);
+	const len = value?.length;
+	const needsLen = length !== void 0;
+	if (!bytes || needsLen && len !== length) {
+		const prefix = title && `"${title}" `;
+		const ofLen = needsLen ? ` of length ${length}` : "";
+		const got = bytes ? `length=${len}` : `type=${typeof value}`;
+		throw new Error(prefix + "expected Uint8Array" + ofLen + ", got " + got);
+	}
+	return value;
+}
+__name(abytes$2, "abytes");
+/** Asserts something is hash */
+function ahash(h) {
+	if (typeof h !== "function" || typeof h.create !== "function") throw new Error("Hash must wrapped by utils.createHasher");
+	anumber$2(h.outputLen);
+	anumber$2(h.blockLen);
+}
+/** Asserts a hash instance has not been destroyed / finished */
+function aexists$1(instance, checkFinished = true) {
+	if (instance.destroyed) throw new Error("Hash instance has been destroyed");
+	if (checkFinished && instance.finished) throw new Error("Hash#digest() has already been called");
+}
+__name(aexists$1, "aexists");
+/** Asserts output is properly-sized byte array */
+function aoutput$1(out, instance) {
+	abytes$2(out, void 0, "digestInto() output");
+	const min = instance.outputLen;
+	if (out.length < min) throw new Error("\"digestInto() output\" expected to be of length >=" + min);
+}
+__name(aoutput$1, "aoutput");
+/** Zeroize a byte array. Warning: JS provides no guarantees. */
+function clean$1(...arrays) {
+	for (let i = 0; i < arrays.length; i++) arrays[i].fill(0);
+}
+__name(clean$1, "clean");
+/** Create DataView of an array for easy byte-level manipulation. */
+function createView$1(arr) {
+	return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+}
+__name(createView$1, "createView");
+/** The rotate right (circular right shift) operation for uint32 */
+function rotr(word, shift) {
+	return word << 32 - shift | word >>> shift;
+}
+/** The rotate left (circular left shift) operation for uint32 */
+function rotl(word, shift) {
+	return word << shift | word >>> 32 - shift >>> 0;
+}
+const hasHexBuiltin$1 = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function")();
+const hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
+/**
+* Convert byte array to hex string. Uses built-in function, when available.
+* @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'
+*/
+function bytesToHex(bytes) {
+	abytes$2(bytes);
+	if (hasHexBuiltin$1) return bytes.toHex();
+	let hex = "";
+	for (let i = 0; i < bytes.length; i++) hex += hexes[bytes[i]];
+	return hex;
+}
+const asciis = {
+	_0: 48,
+	_9: 57,
+	A: 65,
+	F: 70,
+	a: 97,
+	f: 102
+};
+function asciiToBase16(ch) {
+	if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0;
+	if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10);
+	if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10);
+}
+/**
+* Convert hex string to byte array. Uses built-in function, when available.
+* @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])
+*/
+function hexToBytes(hex) {
+	if (typeof hex !== "string") throw new Error("hex string expected, got " + typeof hex);
+	if (hasHexBuiltin$1) return Uint8Array.fromHex(hex);
+	const hl = hex.length;
+	const al = hl / 2;
+	if (hl % 2) throw new Error("hex string expected, got unpadded hex of length " + hl);
+	const array = new Uint8Array(al);
+	for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
+		const n1 = asciiToBase16(hex.charCodeAt(hi));
+		const n2 = asciiToBase16(hex.charCodeAt(hi + 1));
+		if (n1 === void 0 || n2 === void 0) {
+			const char = hex[hi] + hex[hi + 1];
+			throw new Error("hex string expected, got non-hex character \"" + char + "\" at index " + hi);
+		}
+		array[ai] = n1 * 16 + n2;
+	}
+	return array;
+}
+/**
+* Converts string to bytes using UTF8 encoding.
+* Built-in doesn't validate input to be string: we do the check.
+* @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])
+*/
+function utf8ToBytes(str) {
+	if (typeof str !== "string") throw new Error("string expected");
+	return new Uint8Array(new TextEncoder().encode(str));
+}
+/**
+* Helper for KDFs: consumes uint8array or string.
+* When string is passed, does utf8 decoding, using TextDecoder.
+*/
+function kdfInputToBytes(data, errorTitle = "") {
+	if (typeof data === "string") return utf8ToBytes(data);
+	return abytes$2(data, void 0, errorTitle);
+}
+/** Copies several Uint8Arrays into one. */
+function concatBytes(...arrays) {
+	let sum = 0;
+	for (let i = 0; i < arrays.length; i++) {
+		const a = arrays[i];
+		abytes$2(a);
+		sum += a.length;
+	}
+	const res = new Uint8Array(sum);
+	for (let i = 0, pad = 0; i < arrays.length; i++) {
+		const a = arrays[i];
+		res.set(a, pad);
+		pad += a.length;
+	}
+	return res;
+}
+/** Merges default options and passed options. */
+function checkOpts(defaults, opts) {
+	if (opts !== void 0 && {}.toString.call(opts) !== "[object Object]") throw new Error("options must be object or undefined");
+	return Object.assign(defaults, opts);
+}
+/** Creates function with outputLen, blockLen, create properties from a class constructor. */
+function createHasher(hashCons, info = {}) {
+	const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
+	const tmp = hashCons(void 0);
+	hashC.outputLen = tmp.outputLen;
+	hashC.blockLen = tmp.blockLen;
+	hashC.create = (opts) => hashCons(opts);
+	Object.assign(hashC, info);
+	return Object.freeze(hashC);
+}
+/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */
+function randomBytes(bytesLength = 32) {
+	const cr = typeof globalThis === "object" ? globalThis.crypto : null;
+	if (typeof cr?.getRandomValues !== "function") throw new Error("crypto.getRandomValues must be defined");
+	return cr.getRandomValues(new Uint8Array(bytesLength));
+}
+/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */
+const oidNist = (suffix) => ({ oid: Uint8Array.from([
+	6,
+	9,
+	96,
+	134,
+	72,
+	1,
+	101,
+	3,
+	4,
+	2,
+	suffix
+]) });
+
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/hmac.js
 /**
@@ -6247,8 +5794,8 @@ var _HMAC = class {
 	finished = false;
 	destroyed = false;
 	constructor(hash, key) {
-		ahash$1(hash);
-		abytes$3(key, void 0, "key");
+		ahash(hash);
+		abytes$2(key, void 0, "key");
 		this.iHash = hash.create();
 		if (typeof this.iHash.update !== "function") throw new Error("Expected instance of class which extends utils.Hash");
 		this.blockLen = this.iHash.blockLen;
@@ -6261,16 +5808,16 @@ var _HMAC = class {
 		this.oHash = hash.create();
 		for (let i = 0; i < pad.length; i++) pad[i] ^= 106;
 		this.oHash.update(pad);
-		clean$2(pad);
+		clean$1(pad);
 	}
 	update(buf) {
-		aexists$2(this);
+		aexists$1(this);
 		this.iHash.update(buf);
 		return this;
 	}
 	digestInto(out) {
-		aexists$2(this);
-		abytes$3(out, this.outputLen, "output");
+		aexists$1(this);
+		abytes$2(out, this.outputLen, "output");
 		this.finished = true;
 		this.iHash.digestInto(out);
 		this.oHash.update(out);
@@ -6323,14 +5870,14 @@ hmac.create = (hash, key) => new _HMAC(hash, key);
 * @module
 */
 function pbkdf2Init(hash, _password, _salt, _opts) {
-	ahash$1(hash);
+	ahash(hash);
 	const { c, dkLen, asyncTick } = checkOpts({
 		dkLen: 32,
 		asyncTick: 10
 	}, _opts);
-	anumber$3(c, "c");
-	anumber$3(dkLen, "dkLen");
-	anumber$3(asyncTick, "asyncTick");
+	anumber$2(c, "c");
+	anumber$2(dkLen, "dkLen");
+	anumber$2(asyncTick, "asyncTick");
 	if (c < 1) throw new Error("iterations (c) must be >= 1");
 	const password = kdfInputToBytes(_password, "password");
 	const salt = kdfInputToBytes(_salt, "salt");
@@ -6349,7 +5896,7 @@ function pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {
 	PRF.destroy();
 	PRFSalt.destroy();
 	if (prfW) prfW.destroy();
-	clean$2(u);
+	clean$1(u);
 	return DK;
 }
 /**
@@ -6365,7 +5912,7 @@ function pbkdf2(hash, password, salt, opts) {
 	const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);
 	let prfW;
 	const arr = /* @__PURE__ */ new Uint8Array(4);
-	const view = createView$2(arr);
+	const view = createView$1(arr);
 	const u = new Uint8Array(PRF.outputLen);
 	for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {
 		const Ti = DK.subarray(pos, pos + PRF.outputLen);
@@ -6380,6 +5927,196 @@ function pbkdf2(hash, password, salt, opts) {
 	return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);
 }
 
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js
+/**
+* Internal Merkle-Damgard hash utils.
+* @module
+*/
+/** Choice: a ? b : c */
+function Chi(a, b, c) {
+	return a & b ^ ~a & c;
+}
+/** Majority function, true if any two inputs is true. */
+function Maj(a, b, c) {
+	return a & b ^ a & c ^ b & c;
+}
+/**
+* Merkle-Damgard hash construction base class.
+* Could be used to create MD5, RIPEMD, SHA1, SHA2.
+*/
+var HashMD = class {
+	blockLen;
+	outputLen;
+	padOffset;
+	isLE;
+	buffer;
+	view;
+	finished = false;
+	length = 0;
+	pos = 0;
+	destroyed = false;
+	constructor(blockLen, outputLen, padOffset, isLE) {
+		this.blockLen = blockLen;
+		this.outputLen = outputLen;
+		this.padOffset = padOffset;
+		this.isLE = isLE;
+		this.buffer = new Uint8Array(blockLen);
+		this.view = createView$1(this.buffer);
+	}
+	update(data) {
+		aexists$1(this);
+		abytes$2(data);
+		const { view, buffer, blockLen } = this;
+		const len = data.length;
+		for (let pos = 0; pos < len;) {
+			const take = Math.min(blockLen - this.pos, len - pos);
+			if (take === blockLen) {
+				const dataView = createView$1(data);
+				for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);
+				continue;
+			}
+			buffer.set(data.subarray(pos, pos + take), this.pos);
+			this.pos += take;
+			pos += take;
+			if (this.pos === blockLen) {
+				this.process(view, 0);
+				this.pos = 0;
+			}
+		}
+		this.length += data.length;
+		this.roundClean();
+		return this;
+	}
+	digestInto(out) {
+		aexists$1(this);
+		aoutput$1(out, this);
+		this.finished = true;
+		const { buffer, view, blockLen, isLE } = this;
+		let { pos } = this;
+		buffer[pos++] = 128;
+		clean$1(this.buffer.subarray(pos));
+		if (this.padOffset > blockLen - pos) {
+			this.process(view, 0);
+			pos = 0;
+		}
+		for (let i = pos; i < blockLen; i++) buffer[i] = 0;
+		view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);
+		this.process(view, 0);
+		const oview = createView$1(out);
+		const len = this.outputLen;
+		if (len % 4) throw new Error("_sha2: outputLen must be aligned to 32bit");
+		const outLen = len / 4;
+		const state = this.get();
+		if (outLen > state.length) throw new Error("_sha2: outputLen bigger than state");
+		for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);
+	}
+	digest() {
+		const { buffer, outputLen } = this;
+		this.digestInto(buffer);
+		const res = buffer.slice(0, outputLen);
+		this.destroy();
+		return res;
+	}
+	_cloneInto(to) {
+		to ||= new this.constructor();
+		to.set(...this.get());
+		const { blockLen, buffer, length, finished, destroyed, pos } = this;
+		to.destroyed = destroyed;
+		to.finished = finished;
+		to.length = length;
+		to.pos = pos;
+		if (length % blockLen) to.buffer.set(buffer);
+		return to;
+	}
+	clone() {
+		return this._cloneInto();
+	}
+};
+/**
+* Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
+* Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
+*/
+/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */
+const SHA256_IV = /* @__PURE__ */ Uint32Array.from([
+	1779033703,
+	3144134277,
+	1013904242,
+	2773480762,
+	1359893119,
+	2600822924,
+	528734635,
+	1541459225
+]);
+/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */
+const SHA512_IV = /* @__PURE__ */ Uint32Array.from([
+	1779033703,
+	4089235720,
+	3144134277,
+	2227873595,
+	1013904242,
+	4271175723,
+	2773480762,
+	1595750129,
+	1359893119,
+	2917565137,
+	2600822924,
+	725511199,
+	528734635,
+	4215389547,
+	1541459225,
+	327033209
+]);
+
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_u64.js
+/**
+* Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
+* @todo re-check https://issues.chromium.org/issues/42212588
+* @module
+*/
+const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+const _32n = /* @__PURE__ */ BigInt(32);
+function fromBig(n, le = false) {
+	if (le) return {
+		h: Number(n & U32_MASK64),
+		l: Number(n >> _32n & U32_MASK64)
+	};
+	return {
+		h: Number(n >> _32n & U32_MASK64) | 0,
+		l: Number(n & U32_MASK64) | 0
+	};
+}
+function split(lst, le = false) {
+	const len = lst.length;
+	let Ah = new Uint32Array(len);
+	let Al = new Uint32Array(len);
+	for (let i = 0; i < len; i++) {
+		const { h, l } = fromBig(lst[i], le);
+		[Ah[i], Al[i]] = [h, l];
+	}
+	return [Ah, Al];
+}
+const shrSH = (h, _l, s) => h >>> s;
+const shrSL = (h, l, s) => h << 32 - s | l >>> s;
+const rotrSH = (h, l, s) => h >>> s | l << 32 - s;
+const rotrSL = (h, l, s) => h << 32 - s | l >>> s;
+const rotrBH = (h, l, s) => h << 64 - s | l >>> s - 32;
+const rotrBL = (h, l, s) => h >>> s - 32 | l << 64 - s;
+function add(Ah, Al, Bh, Bl) {
+	const l = (Al >>> 0) + (Bl >>> 0);
+	return {
+		h: Ah + Bh + (l / 2 ** 32 | 0) | 0,
+		l: l | 0
+	};
+}
+const add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
+const add3H = (low, Ah, Bh, Ch) => Ah + Bh + Ch + (low / 2 ** 32 | 0) | 0;
+const add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
+const add4H = (low, Ah, Bh, Ch, Dh) => Ah + Bh + Ch + Dh + (low / 2 ** 32 | 0) | 0;
+const add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
+const add5H = (low, Ah, Bh, Ch, Dh, Eh) => Ah + Bh + Ch + Dh + Eh + (low / 2 ** 32 | 0) | 0;
+
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js
 /**
@@ -6462,7 +6199,7 @@ const SHA256_K = /* @__PURE__ */ Uint32Array.from([
 /** Reusable temporary buffer. "W" comes straight from spec. */
 const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
 /** Internal 32-byte base SHA2 hash class. */
-var SHA2_32B = class extends HashMD$1 {
+var SHA2_32B = class extends HashMD {
 	constructor(outputLen) {
 		super(64, outputLen, 8, false);
 	}
@@ -6494,14 +6231,14 @@ var SHA2_32B = class extends HashMD$1 {
 		for (let i = 16; i < 64; i++) {
 			const W15 = SHA256_W[i - 15];
 			const W2 = SHA256_W[i - 2];
-			const s0 = rotr$1(W15, 7) ^ rotr$1(W15, 18) ^ W15 >>> 3;
-			SHA256_W[i] = (rotr$1(W2, 17) ^ rotr$1(W2, 19) ^ W2 >>> 10) + SHA256_W[i - 7] + s0 + SHA256_W[i - 16] | 0;
+			const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ W15 >>> 3;
+			SHA256_W[i] = (rotr(W2, 17) ^ rotr(W2, 19) ^ W2 >>> 10) + SHA256_W[i - 7] + s0 + SHA256_W[i - 16] | 0;
 		}
 		let { A, B, C, D, E, F, G, H } = this;
 		for (let i = 0; i < 64; i++) {
-			const sigma1 = rotr$1(E, 6) ^ rotr$1(E, 11) ^ rotr$1(E, 25);
-			const T1 = H + sigma1 + Chi$1(E, F, G) + SHA256_K[i] + SHA256_W[i] | 0;
-			const T2 = (rotr$1(A, 2) ^ rotr$1(A, 13) ^ rotr$1(A, 22)) + Maj$1(A, B, C) | 0;
+			const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
+			const T1 = H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i] | 0;
+			const T2 = (rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22)) + Maj(A, B, C) | 0;
 			H = G;
 			G = F;
 			F = E;
@@ -6522,28 +6259,28 @@ var SHA2_32B = class extends HashMD$1 {
 		this.set(A, B, C, D, E, F, G, H);
 	}
 	roundClean() {
-		clean$2(SHA256_W);
+		clean$1(SHA256_W);
 	}
 	destroy() {
 		this.set(0, 0, 0, 0, 0, 0, 0, 0);
-		clean$2(this.buffer);
+		clean$1(this.buffer);
 	}
 };
 /** Internal SHA2-256 hash class. */
 var _SHA256 = class extends SHA2_32B {
-	A = SHA256_IV$1[0] | 0;
-	B = SHA256_IV$1[1] | 0;
-	C = SHA256_IV$1[2] | 0;
-	D = SHA256_IV$1[3] | 0;
-	E = SHA256_IV$1[4] | 0;
-	F = SHA256_IV$1[5] | 0;
-	G = SHA256_IV$1[6] | 0;
-	H = SHA256_IV$1[7] | 0;
+	A = SHA256_IV[0] | 0;
+	B = SHA256_IV[1] | 0;
+	C = SHA256_IV[2] | 0;
+	D = SHA256_IV[3] | 0;
+	E = SHA256_IV[4] | 0;
+	F = SHA256_IV[5] | 0;
+	G = SHA256_IV[6] | 0;
+	H = SHA256_IV[7] | 0;
 	constructor() {
 		super(32);
 	}
 };
-const K512 = /* @__PURE__ */ (() => split$1([
+const K512 = /* @__PURE__ */ (() => split([
 	"0x428a2f98d728ae22",
 	"0x7137449123ef65cd",
 	"0xb5c0fbcfec4d3b2f",
@@ -6630,7 +6367,7 @@ const SHA512_Kl = /* @__PURE__ */ (() => K512[1])();
 const SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);
 const SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);
 /** Internal 64-byte base SHA2 hash class. */
-var SHA2_64B = class extends HashMD$1 {
+var SHA2_64B = class extends HashMD {
 	constructor(outputLen) {
 		super(128, outputLen, 16, false);
 	}
@@ -6681,27 +6418,27 @@ var SHA2_64B = class extends HashMD$1 {
 		for (let i = 16; i < 80; i++) {
 			const W15h = SHA512_W_H[i - 15] | 0;
 			const W15l = SHA512_W_L[i - 15] | 0;
-			const s0h = rotrSH$1(W15h, W15l, 1) ^ rotrSH$1(W15h, W15l, 8) ^ shrSH$1(W15h, W15l, 7);
-			const s0l = rotrSL$1(W15h, W15l, 1) ^ rotrSL$1(W15h, W15l, 8) ^ shrSL$1(W15h, W15l, 7);
+			const s0h = rotrSH(W15h, W15l, 1) ^ rotrSH(W15h, W15l, 8) ^ shrSH(W15h, W15l, 7);
+			const s0l = rotrSL(W15h, W15l, 1) ^ rotrSL(W15h, W15l, 8) ^ shrSL(W15h, W15l, 7);
 			const W2h = SHA512_W_H[i - 2] | 0;
 			const W2l = SHA512_W_L[i - 2] | 0;
-			const s1h = rotrSH$1(W2h, W2l, 19) ^ rotrBH$1(W2h, W2l, 61) ^ shrSH$1(W2h, W2l, 6);
-			const s1l = rotrSL$1(W2h, W2l, 19) ^ rotrBL$1(W2h, W2l, 61) ^ shrSL$1(W2h, W2l, 6);
-			const SUMl = add4L$1(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
-			SHA512_W_H[i] = add4H$1(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]) | 0;
+			const s1h = rotrSH(W2h, W2l, 19) ^ rotrBH(W2h, W2l, 61) ^ shrSH(W2h, W2l, 6);
+			const s1l = rotrSL(W2h, W2l, 19) ^ rotrBL(W2h, W2l, 61) ^ shrSL(W2h, W2l, 6);
+			const SUMl = add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);
+			SHA512_W_H[i] = add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]) | 0;
 			SHA512_W_L[i] = SUMl | 0;
 		}
 		let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;
 		for (let i = 0; i < 80; i++) {
-			const sigma1h = rotrSH$1(Eh, El, 14) ^ rotrSH$1(Eh, El, 18) ^ rotrBH$1(Eh, El, 41);
-			const sigma1l = rotrSL$1(Eh, El, 14) ^ rotrSL$1(Eh, El, 18) ^ rotrBL$1(Eh, El, 41);
+			const sigma1h = rotrSH(Eh, El, 14) ^ rotrSH(Eh, El, 18) ^ rotrBH(Eh, El, 41);
+			const sigma1l = rotrSL(Eh, El, 14) ^ rotrSL(Eh, El, 18) ^ rotrBL(Eh, El, 41);
 			const CHIh = Eh & Fh ^ ~Eh & Gh;
 			const CHIl = El & Fl ^ ~El & Gl;
-			const T1ll = add5L$1(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
-			const T1h = add5H$1(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
+			const T1ll = add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);
+			const T1h = add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);
 			const T1l = T1ll | 0;
-			const sigma0h = rotrSH$1(Ah, Al, 28) ^ rotrBH$1(Ah, Al, 34) ^ rotrBH$1(Ah, Al, 39);
-			const sigma0l = rotrSL$1(Ah, Al, 28) ^ rotrBL$1(Ah, Al, 34) ^ rotrBL$1(Ah, Al, 39);
+			const sigma0h = rotrSH(Ah, Al, 28) ^ rotrBH(Ah, Al, 34) ^ rotrBH(Ah, Al, 39);
+			const sigma0l = rotrSL(Ah, Al, 28) ^ rotrBL(Ah, Al, 34) ^ rotrBL(Ah, Al, 39);
 			const MAJh = Ah & Bh ^ Ah & Ch ^ Bh & Ch;
 			const MAJl = Al & Bl ^ Al & Cl ^ Bl & Cl;
 			Hh = Gh | 0;
@@ -6710,53 +6447,53 @@ var SHA2_64B = class extends HashMD$1 {
 			Gl = Fl | 0;
 			Fh = Eh | 0;
 			Fl = El | 0;
-			({h: Eh, l: El} = add$1(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
+			({h: Eh, l: El} = add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
 			Dh = Ch | 0;
 			Dl = Cl | 0;
 			Ch = Bh | 0;
 			Cl = Bl | 0;
 			Bh = Ah | 0;
 			Bl = Al | 0;
-			const All = add3L$1(T1l, sigma0l, MAJl);
-			Ah = add3H$1(All, T1h, sigma0h, MAJh);
+			const All = add3L(T1l, sigma0l, MAJl);
+			Ah = add3H(All, T1h, sigma0h, MAJh);
 			Al = All | 0;
 		}
-		({h: Ah, l: Al} = add$1(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
-		({h: Bh, l: Bl} = add$1(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
-		({h: Ch, l: Cl} = add$1(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
-		({h: Dh, l: Dl} = add$1(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
-		({h: Eh, l: El} = add$1(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
-		({h: Fh, l: Fl} = add$1(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
-		({h: Gh, l: Gl} = add$1(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
-		({h: Hh, l: Hl} = add$1(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
+		({h: Ah, l: Al} = add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
+		({h: Bh, l: Bl} = add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
+		({h: Ch, l: Cl} = add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
+		({h: Dh, l: Dl} = add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
+		({h: Eh, l: El} = add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
+		({h: Fh, l: Fl} = add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
+		({h: Gh, l: Gl} = add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
+		({h: Hh, l: Hl} = add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
 		this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
 	}
 	roundClean() {
-		clean$2(SHA512_W_H, SHA512_W_L);
+		clean$1(SHA512_W_H, SHA512_W_L);
 	}
 	destroy() {
-		clean$2(this.buffer);
+		clean$1(this.buffer);
 		this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
 	}
 };
 /** Internal SHA2-512 hash class. */
 var _SHA512 = class extends SHA2_64B {
-	Ah = SHA512_IV$1[0] | 0;
-	Al = SHA512_IV$1[1] | 0;
-	Bh = SHA512_IV$1[2] | 0;
-	Bl = SHA512_IV$1[3] | 0;
-	Ch = SHA512_IV$1[4] | 0;
-	Cl = SHA512_IV$1[5] | 0;
-	Dh = SHA512_IV$1[6] | 0;
-	Dl = SHA512_IV$1[7] | 0;
-	Eh = SHA512_IV$1[8] | 0;
-	El = SHA512_IV$1[9] | 0;
-	Fh = SHA512_IV$1[10] | 0;
-	Fl = SHA512_IV$1[11] | 0;
-	Gh = SHA512_IV$1[12] | 0;
-	Gl = SHA512_IV$1[13] | 0;
-	Hh = SHA512_IV$1[14] | 0;
-	Hl = SHA512_IV$1[15] | 0;
+	Ah = SHA512_IV[0] | 0;
+	Al = SHA512_IV[1] | 0;
+	Bh = SHA512_IV[2] | 0;
+	Bl = SHA512_IV[3] | 0;
+	Ch = SHA512_IV[4] | 0;
+	Cl = SHA512_IV[5] | 0;
+	Dh = SHA512_IV[6] | 0;
+	Dl = SHA512_IV[7] | 0;
+	Eh = SHA512_IV[8] | 0;
+	El = SHA512_IV[9] | 0;
+	Fh = SHA512_IV[10] | 0;
+	Fl = SHA512_IV[11] | 0;
+	Gh = SHA512_IV[12] | 0;
+	Gl = SHA512_IV[13] | 0;
+	Hh = SHA512_IV[14] | 0;
+	Hl = SHA512_IV[15] | 0;
 	constructor() {
 		super(64);
 	}
@@ -6769,9 +6506,574 @@ var _SHA512 = class extends SHA2_64B {
 * - Each sha256 hash is executing 2^18 bit operations.
 * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.
 */
-const sha256 = /* @__PURE__ */ createHasher$2(() => new _SHA256(), /* @__PURE__ */ oidNist$1(1));
+const sha256 = /* @__PURE__ */ createHasher(() => new _SHA256(), /* @__PURE__ */ oidNist(1));
 /** SHA2-512 hash function from RFC 4634. */
-const sha512 = /* @__PURE__ */ createHasher$2(() => new _SHA512(), /* @__PURE__ */ oidNist$1(3));
+const sha512 = /* @__PURE__ */ createHasher(() => new _SHA512(), /* @__PURE__ */ oidNist(3));
+
+//#endregion
+//#region ../../node_modules/.pnpm/@scure+base@2.0.0/node_modules/@scure/base/index.js
+/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function isBytes$1(a) {
+	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
+}
+__name(isBytes$1, "isBytes");
+/** Asserts something is Uint8Array. */
+function abytes$1(b) {
+	if (!isBytes$1(b)) throw new Error("Uint8Array expected");
+}
+__name(abytes$1, "abytes");
+function isArrayOf(isString, arr) {
+	if (!Array.isArray(arr)) return false;
+	if (arr.length === 0) return true;
+	if (isString) return arr.every((item) => typeof item === "string");
+	else return arr.every((item) => Number.isSafeInteger(item));
+}
+function afn(input) {
+	if (typeof input !== "function") throw new Error("function expected");
+	return true;
+}
+function astr(label, input) {
+	if (typeof input !== "string") throw new Error(`${label}: string expected`);
+	return true;
+}
+function anumber$1(n) {
+	if (!Number.isSafeInteger(n)) throw new Error(`invalid integer: ${n}`);
+}
+__name(anumber$1, "anumber");
+function aArr(input) {
+	if (!Array.isArray(input)) throw new Error("array expected");
+}
+function astrArr(label, input) {
+	if (!isArrayOf(true, input)) throw new Error(`${label}: array of strings expected`);
+}
+function anumArr(label, input) {
+	if (!isArrayOf(false, input)) throw new Error(`${label}: array of numbers expected`);
+}
+/**
+* @__NO_SIDE_EFFECTS__
+*/
+function chain(...args) {
+	const id = (a) => a;
+	const wrap = (a, b) => (c) => a(b(c));
+	return {
+		encode: args.map((x) => x.encode).reduceRight(wrap, id),
+		decode: args.map((x) => x.decode).reduce(wrap, id)
+	};
+}
+/**
+* Encodes integer radix representation to array of strings using alphabet and back.
+* Could also be array of strings.
+* @__NO_SIDE_EFFECTS__
+*/
+function alphabet(letters) {
+	const lettersA = typeof letters === "string" ? letters.split("") : letters;
+	const len = lettersA.length;
+	astrArr("alphabet", lettersA);
+	const indexes = new Map(lettersA.map((l, i) => [l, i]));
+	return {
+		encode: (digits) => {
+			aArr(digits);
+			return digits.map((i) => {
+				if (!Number.isSafeInteger(i) || i < 0 || i >= len) throw new Error(`alphabet.encode: digit index outside alphabet "${i}". Allowed: ${letters}`);
+				return lettersA[i];
+			});
+		},
+		decode: (input) => {
+			aArr(input);
+			return input.map((letter) => {
+				astr("alphabet.decode", letter);
+				const i = indexes.get(letter);
+				if (i === void 0) throw new Error(`Unknown letter: "${letter}". Allowed: ${letters}`);
+				return i;
+			});
+		}
+	};
+}
+/**
+* @__NO_SIDE_EFFECTS__
+*/
+function join(separator = "") {
+	astr("join", separator);
+	return {
+		encode: (from) => {
+			astrArr("join.decode", from);
+			return from.join(separator);
+		},
+		decode: (to) => {
+			astr("join.decode", to);
+			return to.split(separator);
+		}
+	};
+}
+/**
+* Pad strings array so it has integer number of bits
+* @__NO_SIDE_EFFECTS__
+*/
+function padding(bits, chr = "=") {
+	anumber$1(bits);
+	astr("padding", chr);
+	return {
+		encode(data) {
+			astrArr("padding.encode", data);
+			while (data.length * bits % 8) data.push(chr);
+			return data;
+		},
+		decode(input) {
+			astrArr("padding.decode", input);
+			let end = input.length;
+			if (end * bits % 8) throw new Error("padding: invalid, string should have whole number of bytes");
+			for (; end > 0 && input[end - 1] === chr; end--) if ((end - 1) * bits % 8 === 0) throw new Error("padding: invalid, string has too much padding");
+			return input.slice(0, end);
+		}
+	};
+}
+/**
+* @__NO_SIDE_EFFECTS__
+*/
+function normalize$1(fn) {
+	afn(fn);
+	return {
+		encode: (from) => from,
+		decode: (to) => fn(to)
+	};
+}
+__name(normalize$1, "normalize");
+/**
+* Slow: O(n^2) time complexity
+*/
+function convertRadix(data, from, to) {
+	if (from < 2) throw new Error(`convertRadix: invalid from=${from}, base cannot be less than 2`);
+	if (to < 2) throw new Error(`convertRadix: invalid to=${to}, base cannot be less than 2`);
+	aArr(data);
+	if (!data.length) return [];
+	let pos = 0;
+	const res = [];
+	const digits = Array.from(data, (d) => {
+		anumber$1(d);
+		if (d < 0 || d >= from) throw new Error(`invalid integer: ${d}`);
+		return d;
+	});
+	const dlen = digits.length;
+	while (true) {
+		let carry = 0;
+		let done = true;
+		for (let i = pos; i < dlen; i++) {
+			const digit = digits[i];
+			const fromCarry = from * carry;
+			const digitBase = fromCarry + digit;
+			if (!Number.isSafeInteger(digitBase) || fromCarry / from !== carry || digitBase - digit !== fromCarry) throw new Error("convertRadix: carry overflow");
+			const div = digitBase / to;
+			carry = digitBase % to;
+			const rounded = Math.floor(div);
+			digits[i] = rounded;
+			if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase) throw new Error("convertRadix: carry overflow");
+			if (!done) continue;
+			else if (!rounded) pos = i;
+			else done = false;
+		}
+		res.push(carry);
+		if (done) break;
+	}
+	for (let i = 0; i < data.length - 1 && data[i] === 0; i++) res.push(0);
+	return res.reverse();
+}
+const gcd = (a, b) => b === 0 ? a : gcd(b, a % b);
+const radix2carry = /* @__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));
+const powers = /* @__PURE__ */ (() => {
+	let res = [];
+	for (let i = 0; i < 40; i++) res.push(2 ** i);
+	return res;
+})();
+/**
+* Implemented with numbers, because BigInt is 5x slower
+*/
+function convertRadix2(data, from, to, padding) {
+	aArr(data);
+	if (from <= 0 || from > 32) throw new Error(`convertRadix2: wrong from=${from}`);
+	if (to <= 0 || to > 32) throw new Error(`convertRadix2: wrong to=${to}`);
+	if (/* @__PURE__ */ radix2carry(from, to) > 32) throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${/* @__PURE__ */ radix2carry(from, to)}`);
+	let carry = 0;
+	let pos = 0;
+	const max = powers[from];
+	const mask = powers[to] - 1;
+	const res = [];
+	for (const n of data) {
+		anumber$1(n);
+		if (n >= max) throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);
+		carry = carry << from | n;
+		if (pos + from > 32) throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);
+		pos += from;
+		for (; pos >= to; pos -= to) res.push((carry >> pos - to & mask) >>> 0);
+		const pow = powers[pos];
+		if (pow === void 0) throw new Error("invalid carry");
+		carry &= pow - 1;
+	}
+	carry = carry << to - pos & mask;
+	if (!padding && pos >= from) throw new Error("Excess padding");
+	if (!padding && carry > 0) throw new Error(`Non-zero padding: ${carry}`);
+	if (padding && pos > 0) res.push(carry >>> 0);
+	return res;
+}
+/**
+* @__NO_SIDE_EFFECTS__
+*/
+function radix(num) {
+	anumber$1(num);
+	const _256 = 2 ** 8;
+	return {
+		encode: (bytes) => {
+			if (!isBytes$1(bytes)) throw new Error("radix.encode input should be Uint8Array");
+			return convertRadix(Array.from(bytes), _256, num);
+		},
+		decode: (digits) => {
+			anumArr("radix.decode", digits);
+			return Uint8Array.from(convertRadix(digits, num, _256));
+		}
+	};
+}
+/**
+* If both bases are power of same number (like `2**8 <-> 2**64`),
+* there is a linear algorithm. For now we have implementation for power-of-two bases only.
+* @__NO_SIDE_EFFECTS__
+*/
+function radix2(bits, revPadding = false) {
+	anumber$1(bits);
+	if (bits <= 0 || bits > 32) throw new Error("radix2: bits should be in (0..32]");
+	if (/* @__PURE__ */ radix2carry(8, bits) > 32 || /* @__PURE__ */ radix2carry(bits, 8) > 32) throw new Error("radix2: carry overflow");
+	return {
+		encode: (bytes) => {
+			if (!isBytes$1(bytes)) throw new Error("radix2.encode input should be Uint8Array");
+			return convertRadix2(Array.from(bytes), 8, bits, !revPadding);
+		},
+		decode: (digits) => {
+			anumArr("radix2.decode", digits);
+			return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));
+		}
+	};
+}
+function unsafeWrapper(fn) {
+	afn(fn);
+	return function(...args) {
+		try {
+			return fn.apply(null, args);
+		} catch (e) {}
+	};
+}
+function checksum(len, fn) {
+	anumber$1(len);
+	afn(fn);
+	return {
+		encode(data) {
+			if (!isBytes$1(data)) throw new Error("checksum.encode: input should be Uint8Array");
+			const sum = fn(data).slice(0, len);
+			const res = new Uint8Array(data.length + len);
+			res.set(data);
+			res.set(sum, data.length);
+			return res;
+		},
+		decode(data) {
+			if (!isBytes$1(data)) throw new Error("checksum.decode: input should be Uint8Array");
+			const payload = data.slice(0, -len);
+			const oldChecksum = data.slice(-len);
+			const newChecksum = fn(payload).slice(0, len);
+			for (let i = 0; i < len; i++) if (newChecksum[i] !== oldChecksum[i]) throw new Error("Invalid checksum");
+			return payload;
+		}
+	};
+}
+/**
+* base16 encoding from RFC 4648.
+* @example
+* ```js
+* base16.encode(Uint8Array.from([0x12, 0xab]));
+* // => '12AB'
+* ```
+*/
+const base16 = chain(radix2(4), alphabet("0123456789ABCDEF"), join(""));
+/**
+* base32 encoding from RFC 4648. Has padding.
+* Use `base32nopad` for unpadded version.
+* Also check out `base32hex`, `base32hexnopad`, `base32crockford`.
+* @example
+* ```js
+* base32.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'CKVQ===='
+* base32.decode('CKVQ====');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base32 = chain(radix2(5), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), padding(5), join(""));
+/**
+* base32 encoding from RFC 4648. No padding.
+* Use `base32` for padded version.
+* Also check out `base32hex`, `base32hexnopad`, `base32crockford`.
+* @example
+* ```js
+* base32nopad.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'CKVQ'
+* base32nopad.decode('CKVQ');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base32nopad = chain(radix2(5), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), join(""));
+/**
+* base32 encoding from RFC 4648. Padded. Compared to ordinary `base32`, slightly different alphabet.
+* Use `base32hexnopad` for unpadded version.
+* @example
+* ```js
+* base32hex.encode(Uint8Array.from([0x12, 0xab]));
+* // => '2ALG===='
+* base32hex.decode('2ALG====');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base32hex = chain(radix2(5), alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"), padding(5), join(""));
+/**
+* base32 encoding from RFC 4648. No padding. Compared to ordinary `base32`, slightly different alphabet.
+* Use `base32hex` for padded version.
+* @example
+* ```js
+* base32hexnopad.encode(Uint8Array.from([0x12, 0xab]));
+* // => '2ALG'
+* base32hexnopad.decode('2ALG');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base32hexnopad = chain(radix2(5), alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"), join(""));
+/**
+* base32 encoding from RFC 4648. Doug Crockford's version.
+* https://www.crockford.com/base32.html
+* @example
+* ```js
+* base32crockford.encode(Uint8Array.from([0x12, 0xab]));
+* // => '2ANG'
+* base32crockford.decode('2ANG');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base32crockford = chain(radix2(5), alphabet("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), join(""), normalize$1((s) => s.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const hasBase64Builtin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toBase64 === "function" && typeof Uint8Array.fromBase64 === "function")();
+const decodeBase64Builtin = (s, isUrl) => {
+	astr("base64", s);
+	const re = isUrl ? /^[A-Za-z0-9=_-]+$/ : /^[A-Za-z0-9=+/]+$/;
+	const alphabet = isUrl ? "base64url" : "base64";
+	if (s.length > 0 && !re.test(s)) throw new Error("invalid base64");
+	return Uint8Array.fromBase64(s, {
+		alphabet,
+		lastChunkHandling: "strict"
+	});
+};
+/**
+* base64 from RFC 4648. Padded.
+* Use `base64nopad` for unpadded version.
+* Also check out `base64url`, `base64urlnopad`.
+* Falls back to built-in function, when available.
+* @example
+* ```js
+* base64.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'Eqs='
+* base64.decode('Eqs=');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base64 = hasBase64Builtin ? {
+	encode(b) {
+		abytes$1(b);
+		return b.toBase64();
+	},
+	decode(s) {
+		return decodeBase64Builtin(s, false);
+	}
+} : chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), padding(6), join(""));
+/**
+* base64 from RFC 4648. No padding.
+* Use `base64` for padded version.
+* @example
+* ```js
+* base64nopad.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'Eqs'
+* base64nopad.decode('Eqs');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base64nopad = chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), join(""));
+/**
+* base64 from RFC 4648, using URL-safe alphabet. Padded.
+* Use `base64urlnopad` for unpadded version.
+* Falls back to built-in function, when available.
+* @example
+* ```js
+* base64url.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'Eqs='
+* base64url.decode('Eqs=');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base64url = hasBase64Builtin ? {
+	encode(b) {
+		abytes$1(b);
+		return b.toBase64({ alphabet: "base64url" });
+	},
+	decode(s) {
+		return decodeBase64Builtin(s, true);
+	}
+} : chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), padding(6), join(""));
+/**
+* base64 from RFC 4648, using URL-safe alphabet. No padding.
+* Use `base64url` for padded version.
+* @example
+* ```js
+* base64urlnopad.encode(Uint8Array.from([0x12, 0xab]));
+* // => 'Eqs'
+* base64urlnopad.decode('Eqs');
+* // => Uint8Array.from([0x12, 0xab])
+* ```
+*/
+const base64urlnopad = chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), join(""));
+const genBase58 = /* @__NO_SIDE_EFFECTS__ */ (abc) => chain(radix(58), alphabet(abc), join(""));
+/**
+* base58: base64 without ambigous characters +, /, 0, O, I, l.
+* Quadratic (O(n^2)) - so, can't be used on large inputs.
+* @example
+* ```js
+* base58.decode('01abcdef');
+* // => '3UhJW'
+* ```
+*/
+const base58 = /* @__PURE__ */ genBase58("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+/**
+* Method, which creates base58check encoder.
+* Requires function, calculating sha256.
+*/
+const createBase58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);
+const BECH_ALPHABET = chain(alphabet("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), join(""));
+const POLYMOD_GENERATORS = [
+	996825010,
+	642813549,
+	513874426,
+	1027748829,
+	705979059
+];
+function bech32Polymod(pre) {
+	const b = pre >> 25;
+	let chk = (pre & 33554431) << 5;
+	for (let i = 0; i < POLYMOD_GENERATORS.length; i++) if ((b >> i & 1) === 1) chk ^= POLYMOD_GENERATORS[i];
+	return chk;
+}
+function bechChecksum(prefix, words, encodingConst = 1) {
+	const len = prefix.length;
+	let chk = 1;
+	for (let i = 0; i < len; i++) {
+		const c = prefix.charCodeAt(i);
+		if (c < 33 || c > 126) throw new Error(`Invalid prefix (${prefix})`);
+		chk = bech32Polymod(chk) ^ c >> 5;
+	}
+	chk = bech32Polymod(chk);
+	for (let i = 0; i < len; i++) chk = bech32Polymod(chk) ^ prefix.charCodeAt(i) & 31;
+	for (let v of words) chk = bech32Polymod(chk) ^ v;
+	for (let i = 0; i < 6; i++) chk = bech32Polymod(chk);
+	chk ^= encodingConst;
+	return BECH_ALPHABET.encode(convertRadix2([chk % powers[30]], 30, 5, false));
+}
+/**
+* @__NO_SIDE_EFFECTS__
+*/
+function genBech32(encoding) {
+	const ENCODING_CONST = encoding === "bech32" ? 1 : 734539939;
+	const _words = radix2(5);
+	const fromWords = _words.decode;
+	const toWords = _words.encode;
+	const fromWordsUnsafe = unsafeWrapper(fromWords);
+	function encode(prefix, words, limit = 90) {
+		astr("bech32.encode prefix", prefix);
+		if (isBytes$1(words)) words = Array.from(words);
+		anumArr("bech32.encode", words);
+		const plen = prefix.length;
+		if (plen === 0) throw new TypeError(`Invalid prefix length ${plen}`);
+		const actualLength = plen + 7 + words.length;
+		if (limit !== false && actualLength > limit) throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);
+		const lowered = prefix.toLowerCase();
+		const sum = bechChecksum(lowered, words, ENCODING_CONST);
+		return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}`;
+	}
+	function decode(str, limit = 90) {
+		astr("bech32.decode input", str);
+		const slen = str.length;
+		if (slen < 8 || limit !== false && slen > limit) throw new TypeError(`invalid string length: ${slen} (${str}). Expected (8..${limit})`);
+		const lowered = str.toLowerCase();
+		if (str !== lowered && str !== str.toUpperCase()) throw new Error(`String must be lowercase or uppercase`);
+		const sepIndex = lowered.lastIndexOf("1");
+		if (sepIndex === 0 || sepIndex === -1) throw new Error(`Letter "1" must be present between prefix and data only`);
+		const prefix = lowered.slice(0, sepIndex);
+		const data = lowered.slice(sepIndex + 1);
+		if (data.length < 6) throw new Error("Data must be at least 6 characters long");
+		const words = BECH_ALPHABET.decode(data).slice(0, -6);
+		const sum = bechChecksum(prefix, words, ENCODING_CONST);
+		if (!data.endsWith(sum)) throw new Error(`Invalid checksum in ${str}: expected "${sum}"`);
+		return {
+			prefix,
+			words
+		};
+	}
+	const decodeUnsafe = unsafeWrapper(decode);
+	function decodeToBytes(str) {
+		const { prefix, words } = decode(str, false);
+		return {
+			prefix,
+			words,
+			bytes: fromWords(words)
+		};
+	}
+	function encodeFromBytes(prefix, bytes) {
+		return encode(prefix, toWords(bytes));
+	}
+	return {
+		encode,
+		decode,
+		encodeFromBytes,
+		decodeToBytes,
+		decodeUnsafe,
+		fromWords,
+		fromWordsUnsafe,
+		toWords
+	};
+}
+/**
+* bech32 from BIP 173. Operates on words.
+* For high-level, check out scure-btc-signer:
+* https://github.com/paulmillr/scure-btc-signer.
+*/
+const bech32 = genBech32("bech32");
+/**
+* bech32m from BIP 350. Operates on words.
+* It was to mitigate `bech32` weaknesses.
+* For high-level, check out scure-btc-signer:
+* https://github.com/paulmillr/scure-btc-signer.
+*/
+const bech32m = genBech32("bech32m");
+const hasHexBuiltin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function")();
+const hexBuiltin = {
+	encode(data) {
+		abytes$1(data);
+		return data.toHex();
+	},
+	decode(s) {
+		astr("hex", s);
+		return Uint8Array.fromHex(s);
+	}
+};
+/**
+* hex string decoder. Uses built-in function, when available.
+* @example
+* ```js
+* const b = hex.decode("0102ff"); // => new Uint8Array([ 1, 2, 255 ])
+* const str = hex.encode(b); // "0102ff"
+* ```
+*/
+const hex = hasHexBuiltin ? hexBuiltin : chain(radix2(4), alphabet("0123456789abcdef"), join(""), normalize$1((s) => {
+	if (typeof s !== "string" || s.length % 2 !== 0) throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);
+	return s.toLowerCase();
+}));
 
 //#endregion
 //#region ../../node_modules/.pnpm/@scure+bip39@2.0.1/node_modules/@scure/bip39/index.js
@@ -8938,7 +9240,7 @@ const DER$1 = {
 		},
 		decode(tag, data) {
 			const { Err: E } = DER$1;
-			data = abytes$1(data, void 0, "DER data");
+			data = abytes$3(data, void 0, "DER data");
 			let pos = 0;
 			if (tag < 0 || tag > 255) throw new E("tlv.encode: wrong tag");
 			if (data.length < 2 || data[pos++] !== tag) throw new E("tlv.decode: wrong tlv");
@@ -8985,7 +9287,7 @@ const DER$1 = {
 	},
 	toSig(bytes) {
 		const { Err: E, _int: int, _tlv: tlv } = DER$1;
-		const data = abytes$1(bytes, void 0, "signature");
+		const data = abytes$3(bytes, void 0, "signature");
 		const { v: seqBytes, l: seqLeftBytes } = tlv.decode(48, data);
 		if (seqLeftBytes.length) throw new E("invalid signature: left bytes after parsing");
 		const { v: rBytes, l: rLeftBytes } = tlv.decode(2, seqBytes);
@@ -9064,11 +9366,11 @@ function weierstrass$1(params, extraOpts = {}) {
 		abool$2(isCompressed, "isCompressed");
 		if (isCompressed) {
 			assertCompressionIsSupported();
-			return concatBytes(pprefix$1(!Fp.isOdd(y)), bx);
-		} else return concatBytes(Uint8Array.of(4), bx, Fp.toBytes(y));
+			return concatBytes$1(pprefix$1(!Fp.isOdd(y)), bx);
+		} else return concatBytes$1(Uint8Array.of(4), bx, Fp.toBytes(y));
 	}
 	function pointFromBytes(bytes) {
-		abytes$1(bytes, void 0, "Point");
+		abytes$3(bytes, void 0, "Point");
 		const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths;
 		const length = bytes.length;
 		const head = bytes[0];
@@ -9173,12 +9475,12 @@ function weierstrass$1(params, extraOpts = {}) {
 			return new Point(x, y, Fp.ONE);
 		}
 		static fromBytes(bytes) {
-			const P = Point.fromAffine(decodePoint(abytes$1(bytes, void 0, "point")));
+			const P = Point.fromAffine(decodePoint(abytes$3(bytes, void 0, "point")));
 			P.assertValidity();
 			return P;
 		}
 		static fromHex(hex) {
-			return Point.fromBytes(hexToBytes(hex));
+			return Point.fromBytes(hexToBytes$1(hex));
 		}
 		get x() {
 			return this.toAffine().x;
@@ -9427,7 +9729,7 @@ function weierstrass$1(params, extraOpts = {}) {
 			return encodePoint(Point, this, isCompressed);
 		}
 		toHex(isCompressed = true) {
-			return bytesToHex(this.toBytes(isCompressed));
+			return bytesToHex$1(this.toBytes(isCompressed));
 		}
 		toString() {
 			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
@@ -9634,7 +9936,7 @@ __name(getWLengths$1, "getWLengths");
 */
 function ecdh$1(Point, ecdhOpts = {}) {
 	const { Fn } = Point;
-	const randomBytes_ = ecdhOpts.randomBytes === void 0 ? randomBytes : ecdhOpts.randomBytes;
+	const randomBytes_ = ecdhOpts.randomBytes === void 0 ? randomBytes$1 : ecdhOpts.randomBytes;
 	const lengths = Object.assign(getWLengths$1(Point.Fp, Fn), { seed: Math.max(getMinHashLength$1(Fn.ORDER), 16) });
 	function isValidSecretKey(secretKey) {
 		try {
@@ -9661,7 +9963,7 @@ function ecdh$1(Point, ecdhOpts = {}) {
 	*/
 	function randomSecretKey(seed) {
 		seed = seed === void 0 ? randomBytes_(lengths.seed) : seed;
-		return mapHashToField$1(abytes$1(seed, lengths.seed, "seed"), Fn.ORDER);
+		return mapHashToField$1(abytes$3(seed, lengths.seed, "seed"), Fn.ORDER);
 	}
 	/**
 	* Computes public key for a secret key. Checks for validity of the secret key.
@@ -9677,8 +9979,8 @@ function ecdh$1(Point, ecdhOpts = {}) {
 	function isProbPub(item) {
 		const { secretKey, publicKey, publicKeyUncompressed } = lengths;
 		const allowedLengths = Fn._lengths;
-		if (!isBytes$1(item)) return void 0;
-		const l = abytes$1(item, void 0, "key").length;
+		if (!isBytes$3(item)) return void 0;
+		const l = abytes$3(item, void 0, "key").length;
 		const isPub = l === publicKey || l === publicKeyUncompressed;
 		const isSec = l === secretKey || !!allowedLengths?.includes(l);
 		if (isPub && isSec) return void 0;
@@ -9749,7 +10051,7 @@ __name(ecdh$1, "ecdh");
 */
 function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 	const hash_ = hash;
-	ahash(hash_);
+	ahash$1(hash_);
 	validateObject$1(ecdsaOpts, {}, {
 		hmac: "function",
 		lowS: "boolean",
@@ -9758,7 +10060,7 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 		bits2int_modN: "function"
 	});
 	ecdsaOpts = Object.assign({}, ecdsaOpts);
-	const randomBytes$3 = ecdsaOpts.randomBytes === void 0 ? randomBytes : ecdsaOpts.randomBytes;
+	const randomBytes = ecdsaOpts.randomBytes === void 0 ? randomBytes$1 : ecdsaOpts.randomBytes;
 	const hmac = ecdsaOpts.hmac === void 0 ? (key, msg) => hmac$1(hash_, key, msg) : ecdsaOpts.hmac;
 	const { Fp, Fn } = Point;
 	const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;
@@ -9783,7 +10085,7 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 	function validateSigLength(bytes, format) {
 		validateSigFormat$1(format);
 		const size = lengths.signature;
-		return abytes$1(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0);
+		return abytes$3(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0);
 	}
 	/**
 	* ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.
@@ -9811,7 +10113,7 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 			validateSigLength(bytes, format);
 			let recid;
 			if (format === "der") {
-				const { r, s } = DER$1.toSig(abytes$1(bytes));
+				const { r, s } = DER$1.toSig(abytes$3(bytes));
 				return new Signature(r, s);
 			}
 			if (format === "recovered") {
@@ -9825,7 +10127,7 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 			return new Signature(Fn.fromBytes(r), Fn.fromBytes(s), recid);
 		}
 		static fromHex(hex, format) {
-			return this.fromBytes(hexToBytes(hex), format);
+			return this.fromBytes(hexToBytes$1(hex), format);
 		}
 		assertRecovery() {
 			const { recovery } = this;
@@ -9841,9 +10143,9 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 			const radj = recovery === 2 || recovery === 3 ? r + CURVE_ORDER : r;
 			if (!Fp.isValid(radj)) throw new Error("invalid recovery id: sig.r+curve.n != R.x");
 			const x = Fp.toBytes(radj);
-			const R = Point.fromBytes(concatBytes(pprefix$1((recovery & 1) === 0), x));
+			const R = Point.fromBytes(concatBytes$1(pprefix$1((recovery & 1) === 0), x));
 			const ir = Fn.inv(radj);
-			const h = bits2int_modN(abytes$1(messageHash, void 0, "msgHash"));
+			const h = bits2int_modN(abytes$3(messageHash, void 0, "msgHash"));
 			const u1 = Fn.create(-h * ir);
 			const u2 = Fn.create(s * ir);
 			const Q = Point.BASE.multiplyUnsafe(u1).add(R.multiplyUnsafe(u2));
@@ -9856,18 +10158,18 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 		}
 		toBytes(format = defaultSigOpts.format) {
 			validateSigFormat$1(format);
-			if (format === "der") return hexToBytes(DER$1.hexFromSig(this));
+			if (format === "der") return hexToBytes$1(DER$1.hexFromSig(this));
 			const { r, s } = this;
 			const rb = Fn.toBytes(r);
 			const sb = Fn.toBytes(s);
 			if (format === "recovered") {
 				assertRecoverableCurve();
-				return concatBytes(Uint8Array.of(this.assertRecovery()), rb, sb);
+				return concatBytes$1(Uint8Array.of(this.assertRecovery()), rb, sb);
 			}
-			return concatBytes(rb, sb);
+			return concatBytes$1(rb, sb);
 		}
 		toHex(format) {
-			return bytesToHex(this.toBytes(format));
+			return bytesToHex$1(this.toBytes(format));
 		}
 	}
 	Object.freeze(Signature.prototype);
@@ -9888,8 +10190,8 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 		return Fn.toBytes(num);
 	}
 	function validateMsgAndHash(message, prehash) {
-		abytes$1(message, void 0, "message");
-		return prehash ? abytes$1(hash_(message), void 0, "prehashed message") : message;
+		abytes$3(message, void 0, "message");
+		return prehash ? abytes$3(hash_(message), void 0, "prehashed message") : message;
 	}
 	/**
 	* Steps A, D of RFC6979 3.2.
@@ -9907,10 +10209,10 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 		if (!Fn.isValidNot0(d)) throw new Error("invalid private key");
 		const seedArgs = [int2octets(d), int2octets(h1int)];
 		if (extraEntropy != null && extraEntropy !== false) {
-			const e = extraEntropy === true ? randomBytes$3(lengths.secretKey) : extraEntropy;
-			seedArgs.push(abytes$1(e, void 0, "extraEntropy"));
+			const e = extraEntropy === true ? randomBytes(lengths.secretKey) : extraEntropy;
+			seedArgs.push(abytes$3(e, void 0, "extraEntropy"));
 		}
-		const seed = concatBytes(...seedArgs);
+		const seed = concatBytes$1(...seedArgs);
 		const m = h1int;
 		function k2sig(kBytes) {
 			const k = bits2int(kBytes);
@@ -9966,9 +10268,9 @@ function ecdsa$1(Point, hash, ecdsaOpts = {}) {
 	*/
 	function verify(signature, message, publicKey, opts = {}) {
 		const { lowS, prehash, format } = validateSigOpts$1(opts, defaultSigOpts);
-		publicKey = abytes$1(publicKey, void 0, "publicKey");
+		publicKey = abytes$3(publicKey, void 0, "publicKey");
 		message = validateMsgAndHash(message, prehash);
-		if (!isBytes$1(signature)) {
+		if (!isBytes$3(signature)) {
 			const end = signature instanceof Signature ? ", use sig.toBytes()" : "";
 			throw new Error("verify expects Uint8Array signature" + end);
 		}
@@ -10104,7 +10406,7 @@ __name(abool$1, "abool");
 function abignumber(n) {
 	if (typeof n === "bigint") {
 		if (!isPosBig(n)) throw new Error("positive bigint expected, got " + n);
-	} else anumber$3(n);
+	} else anumber$2(n);
 	return n;
 }
 function numberToHexUnpadded(num) {
@@ -10116,15 +10418,15 @@ function hexToNumber(hex) {
 	return hex === "" ? _0n$7 : BigInt("0x" + hex);
 }
 function bytesToNumberBE(bytes) {
-	return hexToNumber(bytesToHex$2(bytes));
+	return hexToNumber(bytesToHex(bytes));
 }
 function bytesToNumberLE(bytes) {
-	return hexToNumber(bytesToHex$2(copyBytes$1(abytes$3(bytes)).reverse()));
+	return hexToNumber(bytesToHex(copyBytes$1(abytes$2(bytes)).reverse()));
 }
 function numberToBytesBE(n, len) {
-	anumber$3(len);
+	anumber$2(len);
 	n = abignumber(n);
-	const res = hexToBytes$2(n.toString(16).padStart(len * 2, "0"));
+	const res = hexToBytes(n.toString(16).padStart(len * 2, "0"));
 	if (res.length !== len) throw new Error("number too large");
 	return res;
 }
@@ -10174,8 +10476,8 @@ const bitMask = (n) => (_1n$7 << BigInt(n)) - _1n$7;
 *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined
 */
 function createHmacDrbg(hashLen, qByteLen, hmacFn) {
-	anumber$3(hashLen, "hashLen");
-	anumber$3(qByteLen, "qByteLen");
+	anumber$2(hashLen, "hashLen");
+	anumber$2(qByteLen, "qByteLen");
 	if (typeof hmacFn !== "function") throw new Error("hmacFn must be a function");
 	const u8n = (len) => new Uint8Array(len);
 	const NULL = Uint8Array.of();
@@ -10190,7 +10492,7 @@ function createHmacDrbg(hashLen, qByteLen, hmacFn) {
 		k.fill(0);
 		i = 0;
 	};
-	const h = (...msgs) => hmacFn(k, concatBytes$2(v, ...msgs));
+	const h = (...msgs) => hmacFn(k, concatBytes(v, ...msgs));
 	const reseed = (seed = NULL) => {
 		k = h(byte0, seed);
 		v = h();
@@ -10208,7 +10510,7 @@ function createHmacDrbg(hashLen, qByteLen, hmacFn) {
 			out.push(sl);
 			len += v.length;
 		}
-		return concatBytes$2(...out);
+		return concatBytes(...out);
 	};
 	const genUntil = (seed, pred) => {
 		reset();
@@ -10493,7 +10795,7 @@ function FpLegendre(Fp, n) {
 	return yes ? 1 : zero ? 0 : -1;
 }
 function nLength(n, nBitLength) {
-	if (nBitLength !== void 0) anumber$3(nBitLength);
+	if (nBitLength !== void 0) anumber$2(nBitLength);
 	const _nBitLength = nBitLength !== void 0 ? nBitLength : n.toString(2).length;
 	return {
 		nBitLength: _nBitLength,
@@ -10592,7 +10894,7 @@ var _Field = class {
 		return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);
 	}
 	fromBytes(bytes, skipValidation = false) {
-		abytes$3(bytes);
+		abytes$2(bytes);
 		const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;
 		if (allowedLengths) {
 			if (!allowedLengths.includes(bytes.length) || bytes.length > BYTES) throw new Error("Field.fromBytes: expected " + allowedLengths + " bytes, got " + bytes.length);
@@ -10673,7 +10975,7 @@ function getMinHashLength(fieldOrder) {
 * @returns valid private scalar
 */
 function mapHashToField(key, fieldOrder, isLE = false) {
-	abytes$3(key);
+	abytes$2(key);
 	const len = key.length;
 	const fieldLen = getFieldBytesLength(fieldOrder);
 	const minLen = getMinHashLength(fieldOrder);
@@ -11094,7 +11396,7 @@ const DER = {
 	},
 	toSig(bytes) {
 		const { Err: E, _int: int, _tlv: tlv } = DER;
-		const data = abytes$3(bytes, void 0, "signature");
+		const data = abytes$2(bytes, void 0, "signature");
 		const { v: seqBytes, l: seqLeftBytes } = tlv.decode(48, data);
 		if (seqLeftBytes.length) throw new E("invalid signature: left bytes after parsing");
 		const { v: rBytes, l: rLeftBytes } = tlv.decode(2, seqBytes);
@@ -11162,11 +11464,11 @@ function weierstrass(params, extraOpts = {}) {
 		abool$1(isCompressed, "isCompressed");
 		if (isCompressed) {
 			assertCompressionIsSupported();
-			return concatBytes$2(pprefix(!Fp.isOdd(y)), bx);
-		} else return concatBytes$2(Uint8Array.of(4), bx, Fp.toBytes(y));
+			return concatBytes(pprefix(!Fp.isOdd(y)), bx);
+		} else return concatBytes(Uint8Array.of(4), bx, Fp.toBytes(y));
 	}
 	function pointFromBytes(bytes) {
-		abytes$3(bytes, void 0, "Point");
+		abytes$2(bytes, void 0, "Point");
 		const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths;
 		const length = bytes.length;
 		const head = bytes[0];
@@ -11299,12 +11601,12 @@ function weierstrass(params, extraOpts = {}) {
 			return new Point(x, y, Fp.ONE);
 		}
 		static fromBytes(bytes) {
-			const P = Point.fromAffine(decodePoint(abytes$3(bytes, void 0, "point")));
+			const P = Point.fromAffine(decodePoint(abytes$2(bytes, void 0, "point")));
 			P.assertValidity();
 			return P;
 		}
 		static fromHex(hex) {
-			return Point.fromBytes(hexToBytes$2(hex));
+			return Point.fromBytes(hexToBytes(hex));
 		}
 		get x() {
 			return this.toAffine().x;
@@ -11521,7 +11823,7 @@ function weierstrass(params, extraOpts = {}) {
 			return encodePoint(Point, this, isCompressed);
 		}
 		toHex(isCompressed = true) {
-			return bytesToHex$2(this.toBytes(isCompressed));
+			return bytesToHex(this.toBytes(isCompressed));
 		}
 		toString() {
 			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
@@ -11550,7 +11852,7 @@ function getWLengths(Fp, Fn) {
 */
 function ecdh(Point, ecdhOpts = {}) {
 	const { Fn } = Point;
-	const randomBytes_ = ecdhOpts.randomBytes || randomBytes$2;
+	const randomBytes_ = ecdhOpts.randomBytes || randomBytes;
 	const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });
 	function isValidSecretKey(secretKey) {
 		try {
@@ -11576,7 +11878,7 @@ function ecdh(Point, ecdhOpts = {}) {
 	* (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
 	*/
 	function randomSecretKey(seed = randomBytes_(lengths.seed)) {
-		return mapHashToField(abytes$3(seed, lengths.seed, "seed"), Fn.ORDER);
+		return mapHashToField(abytes$2(seed, lengths.seed, "seed"), Fn.ORDER);
 	}
 	/**
 	* Computes public key for a secret key. Checks for validity of the secret key.
@@ -11591,9 +11893,9 @@ function ecdh(Point, ecdhOpts = {}) {
 	*/
 	function isProbPub(item) {
 		const { secretKey, publicKey, publicKeyUncompressed } = lengths;
-		if (!isBytes$3(item)) return void 0;
+		if (!isBytes$2(item)) return void 0;
 		if ("_lengths" in Fn && Fn._lengths || secretKey === publicKey) return void 0;
-		const l = abytes$3(item, void 0, "key").length;
+		const l = abytes$2(item, void 0, "key").length;
 		return l === publicKey || l === publicKeyUncompressed;
 	}
 	/**
@@ -11641,7 +11943,7 @@ function ecdh(Point, ecdhOpts = {}) {
 * ```
 */
 function ecdsa(Point, hash, ecdsaOpts = {}) {
-	ahash$1(hash);
+	ahash(hash);
 	validateObject(ecdsaOpts, {}, {
 		hmac: "function",
 		lowS: "boolean",
@@ -11650,7 +11952,7 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 		bits2int_modN: "function"
 	});
 	ecdsaOpts = Object.assign({}, ecdsaOpts);
-	const randomBytes = ecdsaOpts.randomBytes || randomBytes$2;
+	const randomBytes$3 = ecdsaOpts.randomBytes || randomBytes;
 	const hmac$2 = ecdsaOpts.hmac || ((key, msg) => hmac(hash, key, msg));
 	const { Fp, Fn } = Point;
 	const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;
@@ -11675,7 +11977,7 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 	function validateSigLength(bytes, format) {
 		validateSigFormat(format);
 		const size = lengths.signature;
-		return abytes$3(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0);
+		return abytes$2(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0);
 	}
 	/**
 	* ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.
@@ -11703,7 +12005,7 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 			validateSigLength(bytes, format);
 			let recid;
 			if (format === "der") {
-				const { r, s } = DER.toSig(abytes$3(bytes));
+				const { r, s } = DER.toSig(abytes$2(bytes));
 				return new Signature(r, s);
 			}
 			if (format === "recovered") {
@@ -11717,7 +12019,7 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 			return new Signature(Fn.fromBytes(r), Fn.fromBytes(s), recid);
 		}
 		static fromHex(hex, format) {
-			return this.fromBytes(hexToBytes$2(hex), format);
+			return this.fromBytes(hexToBytes(hex), format);
 		}
 		assertRecovery() {
 			const { recovery } = this;
@@ -11733,9 +12035,9 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 			const radj = recovery === 2 || recovery === 3 ? r + CURVE_ORDER : r;
 			if (!Fp.isValid(radj)) throw new Error("invalid recovery id: sig.r+curve.n != R.x");
 			const x = Fp.toBytes(radj);
-			const R = Point.fromBytes(concatBytes$2(pprefix((recovery & 1) === 0), x));
+			const R = Point.fromBytes(concatBytes(pprefix((recovery & 1) === 0), x));
 			const ir = Fn.inv(radj);
-			const h = bits2int_modN(abytes$3(messageHash, void 0, "msgHash"));
+			const h = bits2int_modN(abytes$2(messageHash, void 0, "msgHash"));
 			const u1 = Fn.create(-h * ir);
 			const u2 = Fn.create(s * ir);
 			const Q = Point.BASE.multiplyUnsafe(u1).add(R.multiplyUnsafe(u2));
@@ -11748,18 +12050,18 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 		}
 		toBytes(format = defaultSigOpts.format) {
 			validateSigFormat(format);
-			if (format === "der") return hexToBytes$2(DER.hexFromSig(this));
+			if (format === "der") return hexToBytes(DER.hexFromSig(this));
 			const { r, s } = this;
 			const rb = Fn.toBytes(r);
 			const sb = Fn.toBytes(s);
 			if (format === "recovered") {
 				assertSmallCofactor();
-				return concatBytes$2(Uint8Array.of(this.assertRecovery()), rb, sb);
+				return concatBytes(Uint8Array.of(this.assertRecovery()), rb, sb);
 			}
-			return concatBytes$2(rb, sb);
+			return concatBytes(rb, sb);
 		}
 		toHex(format) {
-			return bytesToHex$2(this.toBytes(format));
+			return bytesToHex(this.toBytes(format));
 		}
 	}
 	const bits2int = ecdsaOpts.bits2int || function bits2int_def(bytes) {
@@ -11778,8 +12080,8 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 		return Fn.toBytes(num);
 	}
 	function validateMsgAndHash(message, prehash) {
-		abytes$3(message, void 0, "message");
-		return prehash ? abytes$3(hash(message), void 0, "prehashed message") : message;
+		abytes$2(message, void 0, "message");
+		return prehash ? abytes$2(hash(message), void 0, "prehashed message") : message;
 	}
 	/**
 	* Steps A, D of RFC6979 3.2.
@@ -11797,10 +12099,10 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 		if (!Fn.isValidNot0(d)) throw new Error("invalid private key");
 		const seedArgs = [int2octets(d), int2octets(h1int)];
 		if (extraEntropy != null && extraEntropy !== false) {
-			const e = extraEntropy === true ? randomBytes(lengths.secretKey) : extraEntropy;
-			seedArgs.push(abytes$3(e, void 0, "extraEntropy"));
+			const e = extraEntropy === true ? randomBytes$3(lengths.secretKey) : extraEntropy;
+			seedArgs.push(abytes$2(e, void 0, "extraEntropy"));
 		}
-		const seed = concatBytes$2(...seedArgs);
+		const seed = concatBytes(...seedArgs);
 		const m = h1int;
 		function k2sig(kBytes) {
 			const k = bits2int(kBytes);
@@ -11854,9 +12156,9 @@ function ecdsa(Point, hash, ecdsaOpts = {}) {
 	*/
 	function verify(signature, message, publicKey, opts = {}) {
 		const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);
-		publicKey = abytes$3(publicKey, void 0, "publicKey");
+		publicKey = abytes$2(publicKey, void 0, "publicKey");
 		message = validateMsgAndHash(message, prehash);
-		if (!isBytes$3(signature)) {
+		if (!isBytes$2(signature)) {
 			const end = signature instanceof Signature ? ", use sig.toBytes()" : "";
 			throw new Error("verify expects Uint8Array signature" + end);
 		}
@@ -12123,7 +12425,7 @@ function ripemd_f(group, x, y, z) {
 	return x ^ (y | ~z);
 }
 const BUF_160 = /* @__PURE__ */ new Uint32Array(16);
-var _RIPEMD160 = class extends HashMD$1 {
+var _RIPEMD160 = class extends HashMD {
 	h0 = 1732584193;
 	h1 = -271733879;
 	h2 = -1732584194;
@@ -12181,11 +12483,11 @@ var _RIPEMD160 = class extends HashMD$1 {
 		this.set(this.h1 + cl + dr | 0, this.h2 + dl + er | 0, this.h3 + el + ar | 0, this.h4 + al + br | 0, this.h0 + bl + cr | 0);
 	}
 	roundClean() {
-		clean$2(BUF_160);
+		clean$1(BUF_160);
 	}
 	destroy() {
 		this.destroyed = true;
-		clean$2(this.buffer);
+		clean$1(this.buffer);
 		this.set(0, 0, 0, 0, 0);
 	}
 };
@@ -12194,7 +12496,7 @@ var _RIPEMD160 = class extends HashMD$1 {
 * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html
 * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf
 */
-const ripemd160 = /* @__PURE__ */ createHasher$2(() => new _RIPEMD160());
+const ripemd160 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());
 
 //#endregion
 //#region ../../node_modules/.pnpm/@scure+bip32@2.0.1/node_modules/@scure/bip32/index.js
@@ -12228,11 +12530,11 @@ const BITCOIN_VERSIONS = {
 /** Hardened offset from Bitcoin, default */
 const HARDENED_OFFSET = 2147483648;
 const hash160 = (data) => ripemd160(sha256(data));
-const fromU32 = (data) => createView$2(data).getUint32(0, false);
+const fromU32 = (data) => createView$1(data).getUint32(0, false);
 const toU32 = (n) => {
 	if (!Number.isSafeInteger(n) || n < 0 || n > 2 ** 32 - 1) throw new Error("invalid number, should be from 0 to 2**32-1, got " + n);
 	const buf = /* @__PURE__ */ new Uint8Array(4);
-	createView$2(buf).setUint32(0, n, false);
+	createView$1(buf).setUint32(0, n, false);
 	return buf;
 };
 /**
@@ -12264,14 +12566,14 @@ var HDKey = class HDKey {
 	get privateExtendedKey() {
 		const priv = this._privateKey;
 		if (!priv) throw new Error("No private key");
-		return base58check.encode(this.serialize(this.versions.private, concatBytes$2(Uint8Array.of(0), priv)));
+		return base58check.encode(this.serialize(this.versions.private, concatBytes(Uint8Array.of(0), priv)));
 	}
 	get publicExtendedKey() {
 		if (!this._publicKey) throw new Error("No public key");
 		return base58check.encode(this.serialize(this.versions.public, this._publicKey));
 	}
 	static fromMasterSeed(seed, versions = BITCOIN_VERSIONS) {
-		abytes$3(seed);
+		abytes$2(seed);
 		if (8 * seed.length < 128 || 8 * seed.length > 512) throw new Error("HDKey: seed length must be between 128 and 512 bits; 256 bits is advised, got " + seed.length);
 		const I = hmac(sha512, MASTER_SECRET, seed);
 		const privateKey = I.slice(0, 32);
@@ -12283,7 +12585,7 @@ var HDKey = class HDKey {
 	}
 	static fromExtendedKey(base58key, versions = BITCOIN_VERSIONS) {
 		const keyBuffer = base58check.decode(base58key);
-		const keyView = createView$2(keyBuffer);
+		const keyView = createView$1(keyBuffer);
 		const version = keyView.getUint32(0, false);
 		const opt = {
 			versions,
@@ -12357,8 +12659,8 @@ var HDKey = class HDKey {
 		if (index >= 2147483648) {
 			const priv = this._privateKey;
 			if (!priv) throw new Error("Could not derive hardened child key");
-			data = concatBytes$2(Uint8Array.of(0), priv, data);
-		} else data = concatBytes$2(this._publicKey, data);
+			data = concatBytes(Uint8Array.of(0), priv, data);
+		} else data = concatBytes(this._publicKey, data);
 		const I = hmac(sha512, this.chainCode, data);
 		const childTweak = I.slice(0, 32);
 		const chainCode = I.slice(32);
@@ -12388,12 +12690,12 @@ var HDKey = class HDKey {
 	}
 	sign(hash) {
 		if (!this._privateKey) throw new Error("No privateKey set!");
-		abytes$3(hash, 32);
+		abytes$2(hash, 32);
 		return secp256k1.sign(hash, this._privateKey, { prehash: false });
 	}
 	verify(hash, signature) {
-		abytes$3(hash, 32);
-		abytes$3(signature, 64);
+		abytes$2(hash, 32);
+		abytes$2(signature, 64);
 		if (!this._publicKey) throw new Error("No publicKey set!");
 		return secp256k1.verify(signature, hash, this._publicKey, { prehash: false });
 	}
@@ -12412,8 +12714,8 @@ var HDKey = class HDKey {
 	}
 	serialize(version, key) {
 		if (!this.chainCode) throw new Error("No chainCode set");
-		abytes$3(key, 33);
-		return concatBytes$2(toU32(version), new Uint8Array([this.depth]), toU32(this.parentFingerprint), toU32(this.index), this.chainCode, key);
+		abytes$2(key, 33);
+		return concatBytes(toU32(version), new Uint8Array([this.depth]), toU32(this.parentFingerprint), toU32(this.index), this.chainCode, key);
 	}
 };
 
@@ -15017,10 +15319,10 @@ function createBlsPairing(fields, G1, G2, params) {
 		}], withFinalExponent);
 	}
 	const lengths = { seed: getMinHashLength$1(Fr.ORDER) };
-	const rand = params.randomBytes === void 0 ? randomBytes : params.randomBytes;
+	const rand = params.randomBytes === void 0 ? randomBytes$1 : params.randomBytes;
 	const randomSecretKey = (seed) => {
 		seed = seed === void 0 ? rand(lengths.seed) : seed;
-		abytes$1(seed, lengths.seed, "seed");
+		abytes$3(seed, lengths.seed, "seed");
 		return mapHashToField$1(seed, Fr.ORDER);
 	};
 	Object.freeze(lengths);
@@ -15146,7 +15448,7 @@ function createBlsSig(blsPairing, PubPoint, SigPoint, isSigG1, hashToSigCurve, S
 			return agg;
 		},
 		hash(messageBytes, DST) {
-			abytes$1(messageBytes);
+			abytes$3(messageBytes);
 			return hashToSigCurve(messageBytes, DST ? { DST } : void 0);
 		},
 		Signature: Object.freeze({ ...SignatureCoder })
@@ -15205,11 +15507,11 @@ function blsBasic(fields, G1_Point, G2_Point, params) {
 }
 function blsHashers(fields, G1_Point, G2_Point, params, hasherParams) {
 	const base = blsBasic(fields, G1_Point, G2_Point, params);
-	const G1Hasher = createHasher(G1_Point, hasherParams.mapToG1 === void 0 ? notImplemented : hasherParams.mapToG1, {
+	const G1Hasher = createHasher$1(G1_Point, hasherParams.mapToG1 === void 0 ? notImplemented : hasherParams.mapToG1, {
 		...hasherParams.hasherOpts,
 		...hasherParams.hasherOptsG1
 	});
-	const G2Hasher = createHasher(G2_Point, hasherParams.mapToG2 === void 0 ? notImplemented : hasherParams.mapToG2, {
+	const G2Hasher = createHasher$1(G2_Point, hasherParams.mapToG2 === void 0 ? notImplemented : hasherParams.mapToG2, {
 		...hasherParams.hasherOpts,
 		...hasherParams.hasherOptsG2
 	});
@@ -15551,7 +15853,7 @@ var _Field2 = class {
 	}
 	fromBytes(b) {
 		const { Fp } = this;
-		abytes$1(b);
+		abytes$3(b);
 		if (b.length !== this.BYTES) throw new Error("fromBytes invalid length=" + b.length);
 		return this.create({
 			c0: Fp.fromBytes(b.subarray(0, Fp.BYTES)),
@@ -15559,7 +15861,7 @@ var _Field2 = class {
 		});
 	}
 	toBytes({ c0, c1 }) {
-		return concatBytes(this.Fp.toBytes(c0), this.Fp.toBytes(c1));
+		return concatBytes$1(this.Fp.toBytes(c0), this.Fp.toBytes(c1));
 	}
 	cmov({ c0, c1 }, { c0: r0, c1: r1 }, c) {
 		const { Fp } = this;
@@ -15761,7 +16063,7 @@ var _Field6 = class {
 	}
 	fromBytes(b) {
 		const { Fp2 } = this;
-		abytes$1(b);
+		abytes$3(b);
 		if (b.length !== this.BYTES) throw new Error("fromBytes invalid length=" + b.length);
 		const B2 = Fp2.BYTES;
 		return this.create({
@@ -15772,7 +16074,7 @@ var _Field6 = class {
 	}
 	toBytes({ c0, c1, c2 }) {
 		const { Fp2 } = this;
-		return concatBytes(Fp2.toBytes(c0), Fp2.toBytes(c1), Fp2.toBytes(c2));
+		return concatBytes$1(Fp2.toBytes(c0), Fp2.toBytes(c1), Fp2.toBytes(c2));
 	}
 	cmov({ c0, c1, c2 }, { c0: r0, c1: r1, c2: r2 }, c) {
 		const { Fp2 } = this;
@@ -16000,7 +16302,7 @@ var _Field12 = class {
 	}
 	fromBytes(b) {
 		const { Fp6 } = this;
-		abytes$1(b);
+		abytes$3(b);
 		if (b.length !== this.BYTES) throw new Error("fromBytes invalid length=" + b.length);
 		return this.create({
 			c0: Fp6.fromBytes(b.subarray(0, Fp6.BYTES)),
@@ -16009,7 +16311,7 @@ var _Field12 = class {
 	}
 	toBytes({ c0, c1 }) {
 		const { Fp6 } = this;
-		return concatBytes(Fp6.toBytes(c0), Fp6.toBytes(c1));
+		return concatBytes$1(Fp6.toBytes(c0), Fp6.toBytes(c1));
 	}
 	cmov({ c0, c1 }, { c0: r0, c1: r1 }, c) {
 		const { Fp6 } = this;
@@ -16331,7 +16633,7 @@ const sortBit = (parts, p) => {
 const fp2 = {
 	encode({ c0, c1 }) {
 		const { BYTES: L } = Fp$1;
-		return concatBytes(numberToBytesBE$1(c1, L), numberToBytesBE$1(c0, L));
+		return concatBytes$1(numberToBytesBE$1(c1, L), numberToBytesBE$1(c0, L));
 	},
 	decode(bytes) {
 		const { BYTES: L } = Fp$1;
@@ -16352,7 +16654,7 @@ const coder = (name, Fp, b, encode, decode, yparts) => {
 			if (!compressed && !allowUncompressed) throw new Error("invalid signature: expected compressed encoding");
 			const infinity = point.is0();
 			const { x, y } = point.toAffine();
-			const bytes = compressed ? enc(x) : concatBytes(enc(x), enc(y));
+			const bytes = compressed ? enc(x) : concatBytes$1(enc(x), enc(y));
 			let sort;
 			if (compressed && !infinity) sort = sortBit(yparts(y), BaseFp.ORDER);
 			return setMask(bytes, {
@@ -16362,7 +16664,7 @@ const coder = (name, Fp, b, encode, decode, yparts) => {
 			});
 		},
 		decode(bytes) {
-			const { compressed, infinity, sort, value } = parseMask(allowUncompressed ? abytes$1(bytes, void 0, "point") : abytes$1(bytes, W, "signature"));
+			const { compressed, infinity, sort, value } = parseMask(allowUncompressed ? abytes$3(bytes, void 0, "point") : abytes$3(bytes, W, "signature"));
 			if (!allowUncompressed && !compressed) throw new Error("invalid signature: expected compressed encoding");
 			const len = compressed ? W : 2 * W;
 			if (value.length !== len) throw new Error(`invalid ${name} point: expected ${len} bytes`);
@@ -16453,10 +16755,10 @@ function signatureG2FromBytes(bytes) {
 const signatureCoders = {
 	ShortSignature: {
 		fromBytes(bytes) {
-			return signatureG1FromBytes(abytes$1(bytes));
+			return signatureG1FromBytes(abytes$3(bytes));
 		},
 		fromHex(hex) {
-			return signatureG1FromBytes(hexToBytes(hex));
+			return signatureG1FromBytes(hexToBytes$1(hex));
 		},
 		toBytes(point) {
 			return signatureG1ToBytes(point);
@@ -16465,15 +16767,15 @@ const signatureCoders = {
 			return signatureG1ToBytes(point);
 		},
 		toHex(point) {
-			return bytesToHex(signatureG1ToBytes(point));
+			return bytesToHex$1(signatureG1ToBytes(point));
 		}
 	},
 	LongSignature: {
 		fromBytes(bytes) {
-			return signatureG2FromBytes(abytes$1(bytes));
+			return signatureG2FromBytes(abytes$3(bytes));
 		},
 		fromHex(hex) {
-			return signatureG2FromBytes(hexToBytes(hex));
+			return signatureG2FromBytes(hexToBytes$1(hex));
 		},
 		toBytes(point) {
 			return signatureG2ToBytes(point);
@@ -16482,7 +16784,7 @@ const signatureCoders = {
 			return signatureG2ToBytes(point);
 		},
 		toHex(point) {
-			return bytesToHex(signatureG2ToBytes(point));
+			return bytesToHex$1(signatureG2ToBytes(point));
 		}
 	}
 };
@@ -16546,7 +16848,7 @@ const bls12_params = {
 	ateLoopSize: BLS_X,
 	xNegative: true,
 	twistType: "multiplicative",
-	randomBytes
+	randomBytes: randomBytes$1
 };
 /**
 * bls12-381 pairing-friendly curve construction.
@@ -17648,7 +17950,7 @@ const gcm = /* @__PURE__ */ wrapCipher({
 * ```
 */
 function extract(hash, ikm, salt) {
-	ahash(hash);
+	ahash$1(hash);
 	if (salt === void 0) salt = new Uint8Array(hash.outputLen);
 	return hmac$1(hash, salt, ikm);
 }
@@ -17674,15 +17976,15 @@ const EMPTY_BUFFER = /* @__PURE__ */ Uint8Array.of();
 * ```
 */
 function expand(hash, prk, info, length = 32) {
-	ahash(hash);
-	anumber$2(length, "length");
-	abytes$2(prk, void 0, "prk");
+	ahash$1(hash);
+	anumber$4(length, "length");
+	abytes$4(prk, void 0, "prk");
 	const olen = hash.outputLen;
 	if (prk.length < olen) throw new Error("\"prk\" must be at least HashLen octets");
 	if (length > 255 * olen) throw new Error("Length must be <= 255*HashLen");
 	const blocks = Math.ceil(length / olen);
 	if (info === void 0) info = EMPTY_BUFFER;
-	else abytes$2(info, void 0, "info");
+	else abytes$4(info, void 0, "info");
 	const okm = new Uint8Array(blocks * olen);
 	const HMAC = hmac$1.create(hash, prk);
 	const HMACTmp = HMAC._cloneInto();
@@ -17695,7 +17997,7 @@ function expand(hash, prk, info, length = 32) {
 	}
 	HMAC.destroy();
 	HMACTmp.destroy();
-	clean$1(T, HKDF_COUNTER);
+	clean$2(T, HKDF_COUNTER);
 	return okm.slice(0, length);
 }
 /**
@@ -17780,10 +18082,10 @@ var SymmetricKey = class SymmetricKey extends Serializable {
 		if (key) {
 			if (key.length !== SYMMETRIC_KEY_LENGTH) throw new Error(`Must provide a key of size ${SYMMETRIC_KEY_LENGTH}`);
 			this.key = key;
-		} else this.key = randomBytes$1(SYMMETRIC_KEY_LENGTH);
+		} else this.key = randomBytes$2(SYMMETRIC_KEY_LENGTH);
 	}
 	encrypt(msg) {
-		const nonce = randomBytes$1(GCM_NONCE_LENGTH);
+		const nonce = randomBytes$2(GCM_NONCE_LENGTH);
 		const serializer = new Serializer();
 		msg.serialize(serializer);
 		const bytes = serializer.toUint8Array();
@@ -17800,7 +18102,7 @@ function hmacKdf(otpSource) {
 	return hkdf(sha256$1, otpSource, HKDF_SALT, /* @__PURE__ */ new Uint8Array(), 32);
 }
 function getRandomFr() {
-	const randomBigint = leBytesToBigint(randomBytes$1(128));
+	const randomBigint = leBytesToBigint(randomBytes$2(128));
 	return bls12_381.fields.Fr.create(randomBigint);
 }
 /**
@@ -36283,5 +36585,5 @@ function parseJwtHeader(jwtHeader) {
 }
 
 //#endregion
-export { TypeTagU256 as $, AuthenticationKey as $t, TransactionExecutableEntryFunction as A, Hex as An, MultiKeySignature as At, TypeTagBool as B, TEXT_ENCODER as Bn, I16 as Bt, MultiAgentRawTransaction as C, SigningSchemeInput as Cn, Ed25519Signature as Ct, MultiSigTransactionPayload as D, anyPublicKeyVariantToString as Dn, MultiEd25519Signature as Dt, MultiSig as E, ZkpVariant as En, MultiEd25519PublicKey as Et, TransactionPayloadEntryFunction as F, AptosApiType as Fn, MoveOption as Ft, TypeTagI32 as G, U128 as Gt, TypeTagI128 as H, I32 as Ht, TransactionPayloadMultiSig as I, DEFAULT_MAX_GAS_AMOUNT as In, MoveString as It, TypeTagReference as J, U32 as Jt, TypeTagI64 as K, U16 as Kt, TransactionPayloadScript as L, FIREBASE_AUTH_ISS_PATTERN as Ln, MoveVector as Lt, TransactionExtraConfigV1 as M, randomBytes$1 as Mn, AnySignature as Mt, TransactionInnerPayloadV1 as N, APTOS_COIN as Nn, Secp256k1PrivateKey as Nt, Script as O, Serializable as On, AbstractMultiKey as Ot, TransactionPayloadEncryptedPayload as P, APTOS_FA as Pn, Secp256k1PublicKey as Pt, TypeTagU16 as Q, Deserializer as Qt, StructTag as R, MIN_MAX_GAS_AMOUNT as Rn, Bool as Rt, FeePayerRawTransaction as S, SigningScheme as Sn, Ed25519PublicKey as St, EntryFunction as T, TransactionResponseType as Tn, accountPublicKeyToSigningScheme as Tt, TypeTagI16 as U, I64 as Ut, TypeTagGeneric as V, I256 as Vt, TypeTagI256 as W, I8 as Wt, TypeTagStruct as X, U8 as Xt, TypeTagSigner as Y, U64 as Yt, TypeTagU128 as Z, FixedBytes as Zt, jwtDecode as _, EphemeralCertificateVariant as _n, AptosApiError as _t, ZeroKnowledgeSig as a, isEncodedStruct as an, stringStructTag as at, generateSigningMessage as b, MoveAbility as bn, EncryptionKey as bt, getIssAudAndUidVal as c, parseEncodedStruct as cn, PayloadAssociatedData as ct, FederatedKeylessPublicKey as d, warnIfDevelopment as dn, ChainId as dt, base64UrlDecode$1 as en, TypeTagU32 as et, bytesToBigIntLE as f, createObjectAddress as fn, getAptosFullNode as ft, EphemeralSignature as g, AnyPublicKeyVariant as gn, aptosRequest as gt, EphemeralPublicKey as h, AccountAuthenticatorVariant as hn, paginateWithObfuscatedCursor as ht, KeylessSignature as i, isBun as in, objectStructTag as it, TransactionExecutableScript as j, MAX_U64_BIG_INT as jn, AnyPublicKey as jt, TransactionExecutableEmpty as k, Serializer as kn, MultiKey as kt, getKeylessConfig as l, sleep as ln, ModuleId as lt, poseidonHash as m, AccountAddress as mn, paginateWithCursor as mt, Groth16Zkp as n, getEnvVar as nn, TypeTagU8 as nt, ZkProof as o, isValidFunctionInfo as on, ClaimedEntryFunction as ot, padAndPackBytesWithLen as p, sha3_256 as pn, getPageWithObfuscatedCursor as pt, TypeTagI8 as q, U256 as qt, KeylessPublicKey as r, getFunctionParts as rn, TypeTagVector as rt, fetchJWK as s, nowInSeconds as sn, DecryptedPlaintext as st, EphemeralCertificate as t, floorToWholeHour as tn, TypeTagU64 as tt, keyless_exports as u, u64ToNumberSafe as un, Identifier as ut, memoizeAsync as v, EphemeralPublicKeyVariant as vn, KeylessError as vt, RawTransaction as w, TransactionAuthenticatorVariant as wn, accountPublicKeyToBaseAccountPublicKey as wt, generateSigningMessageForTransaction as x, MoveFunctionVisibility as xn, Ed25519PrivateKey as xt, deriveTransactionType as y, MimeType as yn, KeylessErrorType as yt, TypeTagAddress as z, ProcessorType as zn, I128 as zt };
-//# sourceMappingURL=keyless-B3QnUmtL.js.map
+export { TypeTagU256 as $, AuthenticationKey as $t, TransactionExecutableEntryFunction as A, Hex as An, MultiKeySignature as At, TypeTagBool as B, I16 as Bt, MultiAgentRawTransaction as C, SigningSchemeInput as Cn, Ed25519Signature as Ct, MultiSigTransactionPayload as D, anyPublicKeyVariantToString as Dn, MultiEd25519Signature as Dt, MultiSig as E, ZkpVariant as En, MultiEd25519PublicKey as Et, TransactionPayloadEntryFunction as F, DEFAULT_MAX_GAS_AMOUNT as Fn, MoveOption as Ft, TypeTagI32 as G, U128 as Gt, TypeTagI128 as H, I32 as Ht, TransactionPayloadMultiSig as I, FIREBASE_AUTH_ISS_PATTERN as In, MoveString as It, TypeTagReference as J, U32 as Jt, TypeTagI64 as K, U16 as Kt, TransactionPayloadScript as L, MIN_MAX_GAS_AMOUNT as Ln, MoveVector as Lt, TransactionExtraConfigV1 as M, APTOS_COIN as Mn, AnySignature as Mt, TransactionInnerPayloadV1 as N, APTOS_FA as Nn, Secp256k1PrivateKey as Nt, Script as O, Serializable as On, AbstractMultiKey as Ot, TransactionPayloadEncryptedPayload as P, AptosApiType as Pn, Secp256k1PublicKey as Pt, TypeTagU16 as Q, Deserializer as Qt, StructTag as R, ProcessorType as Rn, Bool as Rt, FeePayerRawTransaction as S, SigningScheme as Sn, Ed25519PublicKey as St, EntryFunction as T, TransactionResponseType as Tn, accountPublicKeyToSigningScheme as Tt, TypeTagI16 as U, I64 as Ut, TypeTagGeneric as V, I256 as Vt, TypeTagI256 as W, I8 as Wt, TypeTagStruct as X, U8 as Xt, TypeTagSigner as Y, U64 as Yt, TypeTagU128 as Z, FixedBytes as Zt, jwtDecode as _, EphemeralCertificateVariant as _n, AptosApiError as _t, ZeroKnowledgeSig as a, isEncodedStruct as an, stringStructTag as at, generateSigningMessage as b, MoveAbility as bn, EncryptionKey as bt, getIssAudAndUidVal as c, parseEncodedStruct as cn, PayloadAssociatedData as ct, FederatedKeylessPublicKey as d, warnIfDevelopment as dn, ChainId as dt, base64UrlDecode$1 as en, TypeTagU32 as et, bytesToBigIntLE as f, createObjectAddress as fn, getAptosFullNode as ft, EphemeralSignature as g, AnyPublicKeyVariant as gn, aptosRequest as gt, EphemeralPublicKey as h, AccountAuthenticatorVariant as hn, paginateWithObfuscatedCursor as ht, KeylessSignature as i, isBun as in, objectStructTag as it, TransactionExecutableScript as j, MAX_U64_BIG_INT as jn, AnyPublicKey as jt, TransactionExecutableEmpty as k, Serializer as kn, MultiKey as kt, getKeylessConfig as l, sleep as ln, ModuleId as lt, poseidonHash as m, AccountAddress as mn, paginateWithCursor as mt, Groth16Zkp as n, getEnvVar as nn, TypeTagU8 as nt, ZkProof as o, isValidFunctionInfo as on, ClaimedEntryFunction as ot, padAndPackBytesWithLen as p, sha3_256 as pn, getPageWithObfuscatedCursor as pt, TypeTagI8 as q, U256 as qt, KeylessPublicKey as r, getFunctionParts as rn, TypeTagVector as rt, fetchJWK as s, nowInSeconds as sn, DecryptedPlaintext as st, EphemeralCertificate as t, floorToWholeHour as tn, TypeTagU64 as tt, keyless_exports as u, u64ToNumberSafe as un, Identifier as ut, memoizeAsync as v, EphemeralPublicKeyVariant as vn, KeylessError as vt, RawTransaction as w, TransactionAuthenticatorVariant as wn, accountPublicKeyToBaseAccountPublicKey as wt, generateSigningMessageForTransaction as x, MoveFunctionVisibility as xn, Ed25519PrivateKey as xt, deriveTransactionType as y, MimeType as yn, KeylessErrorType as yt, TypeTagAddress as z, TEXT_ENCODER as zn, I128 as zt };
+//# sourceMappingURL=keyless-nGiRkJjM.js.map