@laceio/sdk 0.1.1 → 0.1.2-canary.0

package/dist/bip32-D6wd_QMn.cjs

@@ -0,0 +1,3851 @@
+//#region ../../node_modules/@scure/bip32/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$1(a) {
+	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
+}
+/** Asserts something is positive integer. */
+function anumber$1(n, title = "") {
+	if (!Number.isSafeInteger(n) || n < 0) {
+		const prefix = title && `"${title}" `;
+		throw new Error(`${prefix}expected integer >= 0, got ${n}`);
+	}
+}
+/** Asserts something is Uint8Array. */
+function abytes$1(value, length, title = "") {
+	const bytes = isBytes$1(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;
+}
+/** 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$1(h.outputLen);
+	anumber$1(h.blockLen);
+}
+/** Asserts a hash instance has not been destroyed / finished */
+function aexists(instance, checkFinished = true) {
+	if (instance.destroyed) throw new Error("Hash instance has been destroyed");
+	if (checkFinished && instance.finished) throw new Error("Hash#digest() has already been called");
+}
+/** Asserts output is properly-sized byte array */
+function aoutput(out, instance) {
+	abytes$1(out, void 0, "digestInto() output");
+	const min = instance.outputLen;
+	if (out.length < min) throw new Error("\"digestInto() output\" expected to be of length >=" + min);
+}
+/** Zeroize a byte array. Warning: JS provides no guarantees. */
+function clean(...arrays) {
+	for (let i = 0; i < arrays.length; i++) arrays[i].fill(0);
+}
+/** Create DataView of an array for easy byte-level manipulation. */
+function createView(arr) {
+	return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+}
+/** The rotate right (circular right shift) operation for uint32 */
+function rotr(word, shift) {
+	return word << 32 - shift | word >>> shift;
+}
+/** The rotate left (circular left shift) operation for uint32 */
+function rotl(word, shift) {
+	return word << shift | word >>> 32 - shift >>> 0;
+}
+new Uint8Array(new Uint32Array([287454020]).buffer)[0];
+const hasHexBuiltin$1 = 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$1(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;
+}
+/** Copies several Uint8Arrays into one. */
+function concatBytes(...arrays) {
+	let sum = 0;
+	for (let i = 0; i < arrays.length; i++) {
+		const a = arrays[i];
+		abytes$1(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;
+}
+/** Creates function with outputLen, blockLen, create properties from a class constructor. */
+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.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/@scure/bip32/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(this.buffer);
+	}
+	update(data) {
+		aexists(this);
+		abytes$1(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(data);
+				for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);
+				continue;
+			}
+			buffer.set(data.subarray(pos, pos + take), this.pos);
+			this.pos += take;
+			pos += take;
+			if (this.pos === blockLen) {
+				this.process(view, 0);
+				this.pos = 0;
+			}
+		}
+		this.length += data.length;
+		this.roundClean();
+		return this;
+	}
+	digestInto(out) {
+		aexists(this);
+		aoutput(out, this);
+		this.finished = true;
+		const { buffer, view, blockLen, isLE } = this;
+		let { pos } = this;
+		buffer[pos++] = 128;
+		clean(this.buffer.subarray(pos));
+		if (this.padOffset > blockLen - pos) {
+			this.process(view, 0);
+			pos = 0;
+		}
+		for (let i = pos; i < blockLen; i++) buffer[i] = 0;
+		view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);
+		this.process(view, 0);
+		const oview = createView(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/@scure/bip32/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/@scure/bip32/node_modules/@noble/hashes/sha2.js
+/**
+* SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.
+* SHA256 is the fastest hash implementable in JS, even faster than Blake3.
+* Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and
+* [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
+* @module
+*/
+/**
+* Round constants:
+* First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)
+*/
+const SHA256_K = /* @__PURE__ */ Uint32Array.from([
+	1116352408,
+	1899447441,
+	3049323471,
+	3921009573,
+	961987163,
+	1508970993,
+	2453635748,
+	2870763221,
+	3624381080,
+	310598401,
+	607225278,
+	1426881987,
+	1925078388,
+	2162078206,
+	2614888103,
+	3248222580,
+	3835390401,
+	4022224774,
+	264347078,
+	604807628,
+	770255983,
+	1249150122,
+	1555081692,
+	1996064986,
+	2554220882,
+	2821834349,
+	2952996808,
+	3210313671,
+	3336571891,
+	3584528711,
+	113926993,
+	338241895,
+	666307205,
+	773529912,
+	1294757372,
+	1396182291,
+	1695183700,
+	1986661051,
+	2177026350,
+	2456956037,
+	2730485921,
+	2820302411,
+	3259730800,
+	3345764771,
+	3516065817,
+	3600352804,
+	4094571909,
+	275423344,
+	430227734,
+	506948616,
+	659060556,
+	883997877,
+	958139571,
+	1322822218,
+	1537002063,
+	1747873779,
+	1955562222,
+	2024104815,
+	2227730452,
+	2361852424,
+	2428436474,
+	2756734187,
+	3204031479,
+	3329325298
+]);
+/** Reusable temporary buffer. "W" comes straight from spec. */
+const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
+/** Internal 32-byte base SHA2 hash class. */
+var SHA2_32B = class extends HashMD {
+	constructor(outputLen) {
+		super(64, outputLen, 8, false);
+	}
+	get() {
+		const { A, B, C, D, E, F, G, H } = this;
+		return [
+			A,
+			B,
+			C,
+			D,
+			E,
+			F,
+			G,
+			H
+		];
+	}
+	set(A, B, C, D, E, F, G, H) {
+		this.A = A | 0;
+		this.B = B | 0;
+		this.C = C | 0;
+		this.D = D | 0;
+		this.E = E | 0;
+		this.F = F | 0;
+		this.G = G | 0;
+		this.H = H | 0;
+	}
+	process(view, offset) {
+		for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);
+		for (let i = 16; i < 64; i++) {
+			const W15 = SHA256_W[i - 15];
+			const W2 = SHA256_W[i - 2];
+			const s0 = 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(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;
+			E = D + T1 | 0;
+			D = C;
+			C = B;
+			B = A;
+			A = T1 + T2 | 0;
+		}
+		A = A + this.A | 0;
+		B = B + this.B | 0;
+		C = C + this.C | 0;
+		D = D + this.D | 0;
+		E = E + this.E | 0;
+		F = F + this.F | 0;
+		G = G + this.G | 0;
+		H = H + this.H | 0;
+		this.set(A, B, C, D, E, F, G, H);
+	}
+	roundClean() {
+		clean(SHA256_W);
+	}
+	destroy() {
+		this.set(0, 0, 0, 0, 0, 0, 0, 0);
+		clean(this.buffer);
+	}
+};
+/** Internal SHA2-256 hash class. */
+var _SHA256 = class extends SHA2_32B {
+	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 = split([
+	"0x428a2f98d728ae22",
+	"0x7137449123ef65cd",
+	"0xb5c0fbcfec4d3b2f",
+	"0xe9b5dba58189dbbc",
+	"0x3956c25bf348b538",
+	"0x59f111f1b605d019",
+	"0x923f82a4af194f9b",
+	"0xab1c5ed5da6d8118",
+	"0xd807aa98a3030242",
+	"0x12835b0145706fbe",
+	"0x243185be4ee4b28c",
+	"0x550c7dc3d5ffb4e2",
+	"0x72be5d74f27b896f",
+	"0x80deb1fe3b1696b1",
+	"0x9bdc06a725c71235",
+	"0xc19bf174cf692694",
+	"0xe49b69c19ef14ad2",
+	"0xefbe4786384f25e3",
+	"0x0fc19dc68b8cd5b5",
+	"0x240ca1cc77ac9c65",
+	"0x2de92c6f592b0275",
+	"0x4a7484aa6ea6e483",
+	"0x5cb0a9dcbd41fbd4",
+	"0x76f988da831153b5",
+	"0x983e5152ee66dfab",
+	"0xa831c66d2db43210",
+	"0xb00327c898fb213f",
+	"0xbf597fc7beef0ee4",
+	"0xc6e00bf33da88fc2",
+	"0xd5a79147930aa725",
+	"0x06ca6351e003826f",
+	"0x142929670a0e6e70",
+	"0x27b70a8546d22ffc",
+	"0x2e1b21385c26c926",
+	"0x4d2c6dfc5ac42aed",
+	"0x53380d139d95b3df",
+	"0x650a73548baf63de",
+	"0x766a0abb3c77b2a8",
+	"0x81c2c92e47edaee6",
+	"0x92722c851482353b",
+	"0xa2bfe8a14cf10364",
+	"0xa81a664bbc423001",
+	"0xc24b8b70d0f89791",
+	"0xc76c51a30654be30",
+	"0xd192e819d6ef5218",
+	"0xd69906245565a910",
+	"0xf40e35855771202a",
+	"0x106aa07032bbd1b8",
+	"0x19a4c116b8d2d0c8",
+	"0x1e376c085141ab53",
+	"0x2748774cdf8eeb99",
+	"0x34b0bcb5e19b48a8",
+	"0x391c0cb3c5c95a63",
+	"0x4ed8aa4ae3418acb",
+	"0x5b9cca4f7763e373",
+	"0x682e6ff3d6b2b8a3",
+	"0x748f82ee5defb2fc",
+	"0x78a5636f43172f60",
+	"0x84c87814a1f0ab72",
+	"0x8cc702081a6439ec",
+	"0x90befffa23631e28",
+	"0xa4506cebde82bde9",
+	"0xbef9a3f7b2c67915",
+	"0xc67178f2e372532b",
+	"0xca273eceea26619c",
+	"0xd186b8c721c0c207",
+	"0xeada7dd6cde0eb1e",
+	"0xf57d4f7fee6ed178",
+	"0x06f067aa72176fba",
+	"0x0a637dc5a2c898a6",
+	"0x113f9804bef90dae",
+	"0x1b710b35131c471b",
+	"0x28db77f523047d84",
+	"0x32caab7b40c72493",
+	"0x3c9ebe0a15c9bebc",
+	"0x431d67c49c100d4c",
+	"0x4cc5d4becb3e42b6",
+	"0x597f299cfc657e2a",
+	"0x5fcb6fab3ad6faec",
+	"0x6c44198c4a475817"
+].map((n) => BigInt(n)));
+const SHA512_Kh = K512[0];
+const SHA512_Kl = 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 {
+	constructor(outputLen) {
+		super(128, outputLen, 16, false);
+	}
+	get() {
+		const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;
+		return [
+			Ah,
+			Al,
+			Bh,
+			Bl,
+			Ch,
+			Cl,
+			Dh,
+			Dl,
+			Eh,
+			El,
+			Fh,
+			Fl,
+			Gh,
+			Gl,
+			Hh,
+			Hl
+		];
+	}
+	set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {
+		this.Ah = Ah | 0;
+		this.Al = Al | 0;
+		this.Bh = Bh | 0;
+		this.Bl = Bl | 0;
+		this.Ch = Ch | 0;
+		this.Cl = Cl | 0;
+		this.Dh = Dh | 0;
+		this.Dl = Dl | 0;
+		this.Eh = Eh | 0;
+		this.El = El | 0;
+		this.Fh = Fh | 0;
+		this.Fl = Fl | 0;
+		this.Gh = Gh | 0;
+		this.Gl = Gl | 0;
+		this.Hh = Hh | 0;
+		this.Hl = Hl | 0;
+	}
+	process(view, offset) {
+		for (let i = 0; i < 16; i++, offset += 4) {
+			SHA512_W_H[i] = view.getUint32(offset);
+			SHA512_W_L[i] = view.getUint32(offset += 4);
+		}
+		for (let i = 16; i < 80; i++) {
+			const W15h = SHA512_W_H[i - 15] | 0;
+			const W15l = SHA512_W_L[i - 15] | 0;
+			const s0h = 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(W2h, W2l, 19) ^ rotrBH(W2h, W2l, 61) ^ shrSH(W2h, W2l, 6);
+			const SUMl = add4L(s0l, rotrSL(W2h, W2l, 19) ^ rotrBL(W2h, W2l, 61) ^ shrSL(W2h, W2l, 6), 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(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(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(Ah, Al, 28) ^ rotrBH(Ah, Al, 34) ^ rotrBH(Ah, Al, 39);
+			const sigma0l = rotrSL(Ah, Al, 28) ^ rotrBL(Ah, Al, 34) ^ rotrBL(Ah, Al, 39);
+			const MAJh = Ah & Bh ^ Ah & Ch ^ Bh & Ch;
+			const MAJl = Al & Bl ^ Al & Cl ^ Bl & Cl;
+			Hh = Gh | 0;
+			Hl = Gl | 0;
+			Gh = Fh | 0;
+			Gl = Fl | 0;
+			Fh = Eh | 0;
+			Fl = El | 0;
+			({h: Eh, l: El} = add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));
+			Dh = Ch | 0;
+			Dl = Cl | 0;
+			Ch = Bh | 0;
+			Cl = Bl | 0;
+			Bh = Ah | 0;
+			Bl = Al | 0;
+			const All = add3L(T1l, sigma0l, MAJl);
+			Ah = add3H(All, T1h, sigma0h, MAJh);
+			Al = All | 0;
+		}
+		({h: Ah, l: Al} = add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));
+		({h: Bh, l: Bl} = add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));
+		({h: Ch, l: Cl} = add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));
+		({h: Dh, l: Dl} = add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));
+		({h: Eh, l: El} = add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));
+		({h: Fh, l: Fl} = add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));
+		({h: Gh, l: Gl} = add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));
+		({h: Hh, l: Hl} = add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));
+		this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);
+	}
+	roundClean() {
+		clean(SHA512_W_H, SHA512_W_L);
+	}
+	destroy() {
+		clean(this.buffer);
+		this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+	}
+};
+/** Internal SHA2-512 hash class. */
+var _SHA512 = class extends SHA2_64B {
+	Ah = SHA512_IV[0] | 0;
+	Al = SHA512_IV[1] | 0;
+	Bh = SHA512_IV[2] | 0;
+	Bl = SHA512_IV[3] | 0;
+	Ch = SHA512_IV[4] | 0;
+	Cl = SHA512_IV[5] | 0;
+	Dh = SHA512_IV[6] | 0;
+	Dl = SHA512_IV[7] | 0;
+	Eh = SHA512_IV[8] | 0;
+	El = SHA512_IV[9] | 0;
+	Fh = SHA512_IV[10] | 0;
+	Fl = SHA512_IV[11] | 0;
+	Gh = SHA512_IV[12] | 0;
+	Gl = SHA512_IV[13] | 0;
+	Hh = SHA512_IV[14] | 0;
+	Hl = SHA512_IV[15] | 0;
+	constructor() {
+		super(64);
+	}
+};
+/**
+* SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:
+*
+* - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.
+* - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+* - Each sha256 hash is executing 2^18 bit operations.
+* - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.
+*/
+const sha256 = /* @__PURE__ */ createHasher$1(() => new _SHA256(), /* @__PURE__ */ oidNist(1));
+/** SHA2-512 hash function from RFC 4634. */
+const sha512 = /* @__PURE__ */ createHasher$1(() => new _SHA512(), /* @__PURE__ */ oidNist(3));
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/utils.js
+/**
+* Hex, bytes and number utilities.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const _0n$3 = /* @__PURE__ */ BigInt(0);
+const _1n$3 = /* @__PURE__ */ BigInt(1);
+function abool(value, title = "") {
+	if (typeof value !== "boolean") {
+		const prefix = title && `"${title}" `;
+		throw new Error(prefix + "expected boolean, got type=" + typeof value);
+	}
+	return value;
+}
+function abignumber(n) {
+	if (typeof n === "bigint") {
+		if (!isPosBig(n)) throw new Error("positive bigint expected, got " + n);
+	} else anumber$1(n);
+	return n;
+}
+function asafenumber(value, title = "") {
+	if (!Number.isSafeInteger(value)) {
+		const prefix = title && `"${title}" `;
+		throw new Error(prefix + "expected safe integer, got type=" + typeof value);
+	}
+}
+function numberToHexUnpadded(num) {
+	const hex = abignumber(num).toString(16);
+	return hex.length & 1 ? "0" + hex : hex;
+}
+function hexToNumber(hex) {
+	if (typeof hex !== "string") throw new Error("hex string expected, got " + typeof hex);
+	return hex === "" ? _0n$3 : BigInt("0x" + hex);
+}
+function bytesToNumberBE(bytes) {
+	return hexToNumber(bytesToHex(bytes));
+}
+function bytesToNumberLE(bytes) {
+	return hexToNumber(bytesToHex(copyBytes(abytes$1(bytes)).reverse()));
+}
+function numberToBytesBE(n, len) {
+	anumber$1(len);
+	n = abignumber(n);
+	const res = hexToBytes(n.toString(16).padStart(len * 2, "0"));
+	if (res.length !== len) throw new Error("number too large");
+	return res;
+}
+function numberToBytesLE(n, len) {
+	return numberToBytesBE(n, len).reverse();
+}
+/**
+* Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,
+* and Buffer#slice creates mutable copy. Never use Buffers!
+*/
+function copyBytes(bytes) {
+	return Uint8Array.from(bytes);
+}
+/**
+* Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols
+* Should be safe to use for things expected to be ASCII.
+* Returns exact same result as `TextEncoder` for ASCII or throws.
+*/
+function asciiToBytes(ascii) {
+	return Uint8Array.from(ascii, (c, i) => {
+		const charCode = c.charCodeAt(0);
+		if (c.length !== 1 || charCode > 127) throw new Error(`string contains non-ASCII character "${ascii[i]}" with code ${charCode} at position ${i}`);
+		return charCode;
+	});
+}
+const isPosBig = (n) => typeof n === "bigint" && _0n$3 <= n;
+function inRange(n, min, max) {
+	return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;
+}
+/**
+* Asserts min <= n < max. NOTE: It's < max and not <= max.
+* @example
+* aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)
+*/
+function aInRange(title, n, min, max) {
+	if (!inRange(n, min, max)) throw new Error("expected valid " + title + ": " + min + " <= n < " + max + ", got " + n);
+}
+/**
+* Calculates amount of bits in a bigint.
+* Same as `n.toString(2).length`
+* TODO: merge with nLength in modular
+*/
+function bitLen(n) {
+	let len;
+	for (len = 0; n > _0n$3; n >>= _1n$3, len += 1);
+	return len;
+}
+/**
+* Calculate mask for N bits. Not using ** operator with bigints because of old engines.
+* Same as BigInt(`0b${Array(i).fill('1').join('')}`)
+*/
+const bitMask = (n) => (_1n$3 << BigInt(n)) - _1n$3;
+/**
+* Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.
+* @returns function that will call DRBG until 2nd arg returns something meaningful
+* @example
+*   const drbg = createHmacDRBG<Key>(32, 32, hmac);
+*   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined
+*/
+function createHmacDrbg(hashLen, qByteLen, hmacFn) {
+	anumber$1(hashLen, "hashLen");
+	anumber$1(qByteLen, "qByteLen");
+	if (typeof hmacFn !== "function") throw new Error("hmacFn must be a function");
+	const u8n = (len) => new Uint8Array(len);
+	const NULL = Uint8Array.of();
+	const byte0 = Uint8Array.of(0);
+	const byte1 = Uint8Array.of(1);
+	const _maxDrbgIters = 1e3;
+	let v = u8n(hashLen);
+	let k = u8n(hashLen);
+	let i = 0;
+	const reset = () => {
+		v.fill(1);
+		k.fill(0);
+		i = 0;
+	};
+	const h = (...msgs) => hmacFn(k, concatBytes(v, ...msgs));
+	const reseed = (seed = NULL) => {
+		k = h(byte0, seed);
+		v = h();
+		if (seed.length === 0) return;
+		k = h(byte1, seed);
+		v = h();
+	};
+	const gen = () => {
+		if (i++ >= _maxDrbgIters) throw new Error("drbg: tried max amount of iterations");
+		let len = 0;
+		const out = [];
+		while (len < qByteLen) {
+			v = h();
+			const sl = v.slice();
+			out.push(sl);
+			len += v.length;
+		}
+		return concatBytes(...out);
+	};
+	const genUntil = (seed, pred) => {
+		reset();
+		reseed(seed);
+		let res = void 0;
+		while (!(res = pred(gen()))) reseed();
+		reset();
+		return res;
+	};
+	return genUntil;
+}
+function validateObject(object, fields = {}, optFields = {}) {
+	if (!object || typeof object !== "object") throw new Error("expected valid options object");
+	function checkField(fieldName, expectedType, isOpt) {
+		const val = object[fieldName];
+		if (isOpt && val === void 0) return;
+		const current = typeof val;
+		if (current !== expectedType || val === null) throw new Error(`param "${fieldName}" is invalid: expected ${expectedType}, got ${current}`);
+	}
+	const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));
+	iter(fields, false);
+	iter(optFields, true);
+}
+/**
+* Memoizes (caches) computation result.
+* Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.
+*/
+function memoized(fn) {
+	const map = /* @__PURE__ */ new WeakMap();
+	return (arg, ...args) => {
+		const val = map.get(arg);
+		if (val !== void 0) return val;
+		const computed = fn(arg, ...args);
+		map.set(arg, computed);
+		return computed;
+	};
+}
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/abstract/modular.js
+/**
+* Utils for modular division and fields.
+* Field over 11 is a finite (Galois) field is integer number operations `mod 11`.
+* There is no division: it is replaced by modular multiplicative inverse.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const _0n$2 = /* @__PURE__ */ BigInt(0), _1n$2 = /* @__PURE__ */ BigInt(1), _2n$2 = /* @__PURE__ */ BigInt(2);
+const _3n$1 = /* @__PURE__ */ BigInt(3), _4n$1 = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5);
+const _7n = /* @__PURE__ */ BigInt(7), _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9);
+const _16n = /* @__PURE__ */ BigInt(16);
+function mod(a, b) {
+	const result = a % b;
+	return result >= _0n$2 ? result : b + result;
+}
+/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */
+function pow2(x, power, modulo) {
+	let res = x;
+	while (power-- > _0n$2) {
+		res *= res;
+		res %= modulo;
+	}
+	return res;
+}
+/**
+* Inverses number over modulo.
+* Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).
+*/
+function invert(number, modulo) {
+	if (number === _0n$2) throw new Error("invert: expected non-zero number");
+	if (modulo <= _0n$2) throw new Error("invert: expected positive modulus, got " + modulo);
+	let a = mod(number, modulo);
+	let b = modulo;
+	let x = _0n$2, y = _1n$2, u = _1n$2, v = _0n$2;
+	while (a !== _0n$2) {
+		const q = b / a;
+		const r = b % a;
+		const m = x - u * q;
+		const n = y - v * q;
+		b = a, a = r, x = u, y = v, u = m, v = n;
+	}
+	if (b !== _1n$2) throw new Error("invert: does not exist");
+	return mod(x, modulo);
+}
+function assertIsSquare(Fp, root, n) {
+	if (!Fp.eql(Fp.sqr(root), n)) throw new Error("Cannot find square root");
+}
+function sqrt3mod4(Fp, n) {
+	const p1div4 = (Fp.ORDER + _1n$2) / _4n$1;
+	const root = Fp.pow(n, p1div4);
+	assertIsSquare(Fp, root, n);
+	return root;
+}
+function sqrt5mod8(Fp, n) {
+	const p5div8 = (Fp.ORDER - _5n) / _8n;
+	const n2 = Fp.mul(n, _2n$2);
+	const v = Fp.pow(n2, p5div8);
+	const nv = Fp.mul(n, v);
+	const i = Fp.mul(Fp.mul(nv, _2n$2), v);
+	const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));
+	assertIsSquare(Fp, root, n);
+	return root;
+}
+function sqrt9mod16(P) {
+	const Fp_ = Field(P);
+	const tn = tonelliShanks(P);
+	const c1 = tn(Fp_, Fp_.neg(Fp_.ONE));
+	const c2 = tn(Fp_, c1);
+	const c3 = tn(Fp_, Fp_.neg(c1));
+	const c4 = (P + _7n) / _16n;
+	return (Fp, n) => {
+		let tv1 = Fp.pow(n, c4);
+		let tv2 = Fp.mul(tv1, c1);
+		const tv3 = Fp.mul(tv1, c2);
+		const tv4 = Fp.mul(tv1, c3);
+		const e1 = Fp.eql(Fp.sqr(tv2), n);
+		const e2 = Fp.eql(Fp.sqr(tv3), n);
+		tv1 = Fp.cmov(tv1, tv2, e1);
+		tv2 = Fp.cmov(tv4, tv3, e2);
+		const e3 = Fp.eql(Fp.sqr(tv2), n);
+		const root = Fp.cmov(tv1, tv2, e3);
+		assertIsSquare(Fp, root, n);
+		return root;
+	};
+}
+/**
+* Tonelli-Shanks square root search algorithm.
+* 1. https://eprint.iacr.org/2012/685.pdf (page 12)
+* 2. Square Roots from 1; 24, 51, 10 to Dan Shanks
+* @param P field order
+* @returns function that takes field Fp (created from P) and number n
+*/
+function tonelliShanks(P) {
+	if (P < _3n$1) throw new Error("sqrt is not defined for small field");
+	let Q = P - _1n$2;
+	let S = 0;
+	while (Q % _2n$2 === _0n$2) {
+		Q /= _2n$2;
+		S++;
+	}
+	let Z = _2n$2;
+	const _Fp = Field(P);
+	while (FpLegendre(_Fp, Z) === 1) if (Z++ > 1e3) throw new Error("Cannot find square root: probably non-prime P");
+	if (S === 1) return sqrt3mod4;
+	let cc = _Fp.pow(Z, Q);
+	const Q1div2 = (Q + _1n$2) / _2n$2;
+	return function tonelliSlow(Fp, n) {
+		if (Fp.is0(n)) return n;
+		if (FpLegendre(Fp, n) !== 1) throw new Error("Cannot find square root");
+		let M = S;
+		let c = Fp.mul(Fp.ONE, cc);
+		let t = Fp.pow(n, Q);
+		let R = Fp.pow(n, Q1div2);
+		while (!Fp.eql(t, Fp.ONE)) {
+			if (Fp.is0(t)) return Fp.ZERO;
+			let i = 1;
+			let t_tmp = Fp.sqr(t);
+			while (!Fp.eql(t_tmp, Fp.ONE)) {
+				i++;
+				t_tmp = Fp.sqr(t_tmp);
+				if (i === M) throw new Error("Cannot find square root");
+			}
+			const exponent = _1n$2 << BigInt(M - i - 1);
+			const b = Fp.pow(c, exponent);
+			M = i;
+			c = Fp.sqr(b);
+			t = Fp.mul(t, c);
+			R = Fp.mul(R, b);
+		}
+		return R;
+	};
+}
+/**
+* Square root for a finite field. Will try optimized versions first:
+*
+* 1. P ≡ 3 (mod 4)
+* 2. P ≡ 5 (mod 8)
+* 3. P ≡ 9 (mod 16)
+* 4. Tonelli-Shanks algorithm
+*
+* Different algorithms can give different roots, it is up to user to decide which one they want.
+* For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).
+*/
+function FpSqrt(P) {
+	if (P % _4n$1 === _3n$1) return sqrt3mod4;
+	if (P % _8n === _5n) return sqrt5mod8;
+	if (P % _16n === _9n) return sqrt9mod16(P);
+	return tonelliShanks(P);
+}
+const FIELD_FIELDS = [
+	"create",
+	"isValid",
+	"is0",
+	"neg",
+	"inv",
+	"sqrt",
+	"sqr",
+	"eql",
+	"add",
+	"sub",
+	"mul",
+	"pow",
+	"div",
+	"addN",
+	"subN",
+	"mulN",
+	"sqrN"
+];
+function validateField(field) {
+	validateObject(field, FIELD_FIELDS.reduce((map, val) => {
+		map[val] = "function";
+		return map;
+	}, {
+		ORDER: "bigint",
+		BYTES: "number",
+		BITS: "number"
+	}));
+	return field;
+}
+/**
+* Same as `pow` but for Fp: non-constant-time.
+* Unsafe in some contexts: uses ladder, so can expose bigint bits.
+*/
+function FpPow(Fp, num, power) {
+	if (power < _0n$2) throw new Error("invalid exponent, negatives unsupported");
+	if (power === _0n$2) return Fp.ONE;
+	if (power === _1n$2) return num;
+	let p = Fp.ONE;
+	let d = num;
+	while (power > _0n$2) {
+		if (power & _1n$2) p = Fp.mul(p, d);
+		d = Fp.sqr(d);
+		power >>= _1n$2;
+	}
+	return p;
+}
+/**
+* Efficiently invert an array of Field elements.
+* Exception-free. Will return `undefined` for 0 elements.
+* @param passZero map 0 to 0 (instead of undefined)
+*/
+function FpInvertBatch(Fp, nums, passZero = false) {
+	const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : void 0);
+	const multipliedAcc = nums.reduce((acc, num, i) => {
+		if (Fp.is0(num)) return acc;
+		inverted[i] = acc;
+		return Fp.mul(acc, num);
+	}, Fp.ONE);
+	const invertedAcc = Fp.inv(multipliedAcc);
+	nums.reduceRight((acc, num, i) => {
+		if (Fp.is0(num)) return acc;
+		inverted[i] = Fp.mul(acc, inverted[i]);
+		return Fp.mul(acc, num);
+	}, invertedAcc);
+	return inverted;
+}
+/**
+* Legendre symbol.
+* Legendre constant is used to calculate Legendre symbol (a | p)
+* which denotes the value of a^((p-1)/2) (mod p).
+*
+* * (a | p) ≡ 1    if a is a square (mod p), quadratic residue
+* * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue
+* * (a | p) ≡ 0    if a ≡ 0 (mod p)
+*/
+function FpLegendre(Fp, n) {
+	const p1mod2 = (Fp.ORDER - _1n$2) / _2n$2;
+	const powered = Fp.pow(n, p1mod2);
+	const yes = Fp.eql(powered, Fp.ONE);
+	const zero = Fp.eql(powered, Fp.ZERO);
+	const no = Fp.eql(powered, Fp.neg(Fp.ONE));
+	if (!yes && !zero && !no) throw new Error("invalid Legendre symbol result");
+	return yes ? 1 : zero ? 0 : -1;
+}
+function nLength(n, nBitLength) {
+	if (nBitLength !== void 0) anumber$1(nBitLength);
+	const _nBitLength = nBitLength !== void 0 ? nBitLength : n.toString(2).length;
+	return {
+		nBitLength: _nBitLength,
+		nByteLength: Math.ceil(_nBitLength / 8)
+	};
+}
+var _Field = class {
+	ORDER;
+	BITS;
+	BYTES;
+	isLE;
+	ZERO = _0n$2;
+	ONE = _1n$2;
+	_lengths;
+	_sqrt;
+	_mod;
+	constructor(ORDER, opts = {}) {
+		if (ORDER <= _0n$2) throw new Error("invalid field: expected ORDER > 0, got " + ORDER);
+		let _nbitLength = void 0;
+		this.isLE = false;
+		if (opts != null && typeof opts === "object") {
+			if (typeof opts.BITS === "number") _nbitLength = opts.BITS;
+			if (typeof opts.sqrt === "function") this.sqrt = opts.sqrt;
+			if (typeof opts.isLE === "boolean") this.isLE = opts.isLE;
+			if (opts.allowedLengths) this._lengths = opts.allowedLengths?.slice();
+			if (typeof opts.modFromBytes === "boolean") this._mod = opts.modFromBytes;
+		}
+		const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);
+		if (nByteLength > 2048) throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+		this.ORDER = ORDER;
+		this.BITS = nBitLength;
+		this.BYTES = nByteLength;
+		this._sqrt = void 0;
+		Object.preventExtensions(this);
+	}
+	create(num) {
+		return mod(num, this.ORDER);
+	}
+	isValid(num) {
+		if (typeof num !== "bigint") throw new Error("invalid field element: expected bigint, got " + typeof num);
+		return _0n$2 <= num && num < this.ORDER;
+	}
+	is0(num) {
+		return num === _0n$2;
+	}
+	isValidNot0(num) {
+		return !this.is0(num) && this.isValid(num);
+	}
+	isOdd(num) {
+		return (num & _1n$2) === _1n$2;
+	}
+	neg(num) {
+		return mod(-num, this.ORDER);
+	}
+	eql(lhs, rhs) {
+		return lhs === rhs;
+	}
+	sqr(num) {
+		return mod(num * num, this.ORDER);
+	}
+	add(lhs, rhs) {
+		return mod(lhs + rhs, this.ORDER);
+	}
+	sub(lhs, rhs) {
+		return mod(lhs - rhs, this.ORDER);
+	}
+	mul(lhs, rhs) {
+		return mod(lhs * rhs, this.ORDER);
+	}
+	pow(num, power) {
+		return FpPow(this, num, power);
+	}
+	div(lhs, rhs) {
+		return mod(lhs * invert(rhs, this.ORDER), this.ORDER);
+	}
+	sqrN(num) {
+		return num * num;
+	}
+	addN(lhs, rhs) {
+		return lhs + rhs;
+	}
+	subN(lhs, rhs) {
+		return lhs - rhs;
+	}
+	mulN(lhs, rhs) {
+		return lhs * rhs;
+	}
+	inv(num) {
+		return invert(num, this.ORDER);
+	}
+	sqrt(num) {
+		if (!this._sqrt) this._sqrt = FpSqrt(this.ORDER);
+		return this._sqrt(this, num);
+	}
+	toBytes(num) {
+		return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);
+	}
+	fromBytes(bytes, skipValidation = false) {
+		abytes$1(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);
+			const padded = new Uint8Array(BYTES);
+			padded.set(bytes, isLE ? 0 : padded.length - bytes.length);
+			bytes = padded;
+		}
+		if (bytes.length !== BYTES) throw new Error("Field.fromBytes: expected " + BYTES + " bytes, got " + bytes.length);
+		let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);
+		if (modFromBytes) scalar = mod(scalar, ORDER);
+		if (!skipValidation) {
+			if (!this.isValid(scalar)) throw new Error("invalid field element: outside of range 0..ORDER");
+		}
+		return scalar;
+	}
+	invertBatch(lst) {
+		return FpInvertBatch(this, lst);
+	}
+	cmov(a, b, condition) {
+		return condition ? b : a;
+	}
+};
+/**
+* Creates a finite field. Major performance optimizations:
+* * 1. Denormalized operations like mulN instead of mul.
+* * 2. Identical object shape: never add or remove keys.
+* * 3. `Object.freeze`.
+* Fragile: always run a benchmark on a change.
+* Security note: operations don't check 'isValid' for all elements for performance reasons,
+* it is caller responsibility to check this.
+* This is low-level code, please make sure you know what you're doing.
+*
+* Note about field properties:
+* * CHARACTERISTIC p = prime number, number of elements in main subgroup.
+* * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.
+*
+* @param ORDER field order, probably prime, or could be composite
+* @param bitLen how many bits the field consumes
+* @param isLE (default: false) if encoding / decoding should be in little-endian
+* @param redef optional faster redefinitions of sqrt and other methods
+*/
+function Field(ORDER, opts = {}) {
+	return new _Field(ORDER, opts);
+}
+/**
+* Returns total number of bytes consumed by the field element.
+* For example, 32 bytes for usual 256-bit weierstrass curve.
+* @param fieldOrder number of field elements, usually CURVE.n
+* @returns byte length of field
+*/
+function getFieldBytesLength(fieldOrder) {
+	if (typeof fieldOrder !== "bigint") throw new Error("field order must be bigint");
+	const bitLength = fieldOrder.toString(2).length;
+	return Math.ceil(bitLength / 8);
+}
+/**
+* Returns minimal amount of bytes that can be safely reduced
+* by field order.
+* Should be 2^-128 for 128-bit curve such as P256.
+* @param fieldOrder number of field elements, usually CURVE.n
+* @returns byte length of target hash
+*/
+function getMinHashLength(fieldOrder) {
+	const length = getFieldBytesLength(fieldOrder);
+	return length + Math.ceil(length / 2);
+}
+/**
+* "Constant-time" private key generation utility.
+* Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF
+* and convert them into private scalar, with the modulo bias being negligible.
+* Needs at least 48 bytes of input for 32-byte private key.
+* https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/
+* FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final
+* RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5
+* @param hash hash output from SHA3 or a similar function
+* @param groupOrder size of subgroup - (e.g. secp256k1.Point.Fn.ORDER)
+* @param isLE interpret hash bytes as LE num
+* @returns valid private scalar
+*/
+function mapHashToField(key, fieldOrder, isLE = false) {
+	abytes$1(key);
+	const len = key.length;
+	const fieldLen = getFieldBytesLength(fieldOrder);
+	const minLen = getMinHashLength(fieldOrder);
+	if (len < 16 || len < minLen || len > 1024) throw new Error("expected " + minLen + "-1024 bytes of input, got " + len);
+	const reduced = mod(isLE ? bytesToNumberLE(key) : bytesToNumberBE(key), fieldOrder - _1n$2) + _1n$2;
+	return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
+}
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/abstract/curve.js
+/**
+* Methods for elliptic curve multiplication by scalars.
+* Contains wNAF, pippenger.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const _0n$1 = /* @__PURE__ */ BigInt(0);
+const _1n$1 = /* @__PURE__ */ BigInt(1);
+function negateCt(condition, item) {
+	const neg = item.negate();
+	return condition ? neg : item;
+}
+/**
+* Takes a bunch of Projective Points but executes only one
+* inversion on all of them. Inversion is very slow operation,
+* so this improves performance massively.
+* Optimization: converts a list of projective points to a list of identical points with Z=1.
+*/
+function normalizeZ(c, points) {
+	const invertedZs = FpInvertBatch(c.Fp, points.map((p) => p.Z));
+	return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));
+}
+function validateW(W, bits) {
+	if (!Number.isSafeInteger(W) || W <= 0 || W > bits) throw new Error("invalid window size, expected [1.." + bits + "], got W=" + W);
+}
+function calcWOpts(W, scalarBits) {
+	validateW(W, scalarBits);
+	const windows = Math.ceil(scalarBits / W) + 1;
+	const windowSize = 2 ** (W - 1);
+	const maxNumber = 2 ** W;
+	return {
+		windows,
+		windowSize,
+		mask: bitMask(W),
+		maxNumber,
+		shiftBy: BigInt(W)
+	};
+}
+function calcOffsets(n, window, wOpts) {
+	const { windowSize, mask, maxNumber, shiftBy } = wOpts;
+	let wbits = Number(n & mask);
+	let nextN = n >> shiftBy;
+	if (wbits > windowSize) {
+		wbits -= maxNumber;
+		nextN += _1n$1;
+	}
+	const offsetStart = window * windowSize;
+	const offset = offsetStart + Math.abs(wbits) - 1;
+	const isZero = wbits === 0;
+	const isNeg = wbits < 0;
+	const isNegF = window % 2 !== 0;
+	return {
+		nextN,
+		offset,
+		isZero,
+		isNeg,
+		isNegF,
+		offsetF: offsetStart
+	};
+}
+const pointPrecomputes = /* @__PURE__ */ new WeakMap();
+const pointWindowSizes = /* @__PURE__ */ new WeakMap();
+function getW(P) {
+	return pointWindowSizes.get(P) || 1;
+}
+function assert0(n) {
+	if (n !== _0n$1) throw new Error("invalid wNAF");
+}
+/**
+* Elliptic curve multiplication of Point by scalar. Fragile.
+* Table generation takes **30MB of ram and 10ms on high-end CPU**,
+* but may take much longer on slow devices. Actual generation will happen on
+* first call of `multiply()`. By default, `BASE` point is precomputed.
+*
+* Scalars should always be less than curve order: this should be checked inside of a curve itself.
+* Creates precomputation tables for fast multiplication:
+* - private scalar is split by fixed size windows of W bits
+* - every window point is collected from window's table & added to accumulator
+* - since windows are different, same point inside tables won't be accessed more than once per calc
+* - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)
+* - +1 window is neccessary for wNAF
+* - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication
+*
+* @todo Research returning 2d JS array of windows, instead of a single window.
+* This would allow windows to be in different memory locations
+*/
+var wNAF = class {
+	BASE;
+	ZERO;
+	Fn;
+	bits;
+	constructor(Point, bits) {
+		this.BASE = Point.BASE;
+		this.ZERO = Point.ZERO;
+		this.Fn = Point.Fn;
+		this.bits = bits;
+	}
+	_unsafeLadder(elm, n, p = this.ZERO) {
+		let d = elm;
+		while (n > _0n$1) {
+			if (n & _1n$1) p = p.add(d);
+			d = d.double();
+			n >>= _1n$1;
+		}
+		return p;
+	}
+	/**
+	* Creates a wNAF precomputation window. Used for caching.
+	* Default window size is set by `utils.precompute()` and is equal to 8.
+	* Number of precomputed points depends on the curve size:
+	* 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
+	* - 𝑊 is the window size
+	* - 𝑛 is the bitlength of the curve order.
+	* For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
+	* @param point Point instance
+	* @param W window size
+	* @returns precomputed point tables flattened to a single array
+	*/
+	precomputeWindow(point, W) {
+		const { windows, windowSize } = calcWOpts(W, this.bits);
+		const points = [];
+		let p = point;
+		let base = p;
+		for (let window = 0; window < windows; window++) {
+			base = p;
+			points.push(base);
+			for (let i = 1; i < windowSize; i++) {
+				base = base.add(p);
+				points.push(base);
+			}
+			p = base.double();
+		}
+		return points;
+	}
+	/**
+	* Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
+	* More compact implementation:
+	* https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541
+	* @returns real and fake (for const-time) points
+	*/
+	wNAF(W, precomputes, n) {
+		if (!this.Fn.isValid(n)) throw new Error("invalid scalar");
+		let p = this.ZERO;
+		let f = this.BASE;
+		const wo = calcWOpts(W, this.bits);
+		for (let window = 0; window < wo.windows; window++) {
+			const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);
+			n = nextN;
+			if (isZero) f = f.add(negateCt(isNegF, precomputes[offsetF]));
+			else p = p.add(negateCt(isNeg, precomputes[offset]));
+		}
+		assert0(n);
+		return {
+			p,
+			f
+		};
+	}
+	/**
+	* Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
+	* @param acc accumulator point to add result of multiplication
+	* @returns point
+	*/
+	wNAFUnsafe(W, precomputes, n, acc = this.ZERO) {
+		const wo = calcWOpts(W, this.bits);
+		for (let window = 0; window < wo.windows; window++) {
+			if (n === _0n$1) break;
+			const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);
+			n = nextN;
+			if (isZero) continue;
+			else {
+				const item = precomputes[offset];
+				acc = acc.add(isNeg ? item.negate() : item);
+			}
+		}
+		assert0(n);
+		return acc;
+	}
+	getPrecomputes(W, point, transform) {
+		let comp = pointPrecomputes.get(point);
+		if (!comp) {
+			comp = this.precomputeWindow(point, W);
+			if (W !== 1) {
+				if (typeof transform === "function") comp = transform(comp);
+				pointPrecomputes.set(point, comp);
+			}
+		}
+		return comp;
+	}
+	cached(point, scalar, transform) {
+		const W = getW(point);
+		return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);
+	}
+	unsafe(point, scalar, transform, prev) {
+		const W = getW(point);
+		if (W === 1) return this._unsafeLadder(point, scalar, prev);
+		return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);
+	}
+	createCache(P, W) {
+		validateW(W, this.bits);
+		pointWindowSizes.set(P, W);
+		pointPrecomputes.delete(P);
+	}
+	hasCache(elm) {
+		return getW(elm) !== 1;
+	}
+};
+/**
+* Endomorphism-specific multiplication for Koblitz curves.
+* Cost: 128 dbl, 0-256 adds.
+*/
+function mulEndoUnsafe(Point, point, k1, k2) {
+	let acc = point;
+	let p1 = Point.ZERO;
+	let p2 = Point.ZERO;
+	while (k1 > _0n$1 || k2 > _0n$1) {
+		if (k1 & _1n$1) p1 = p1.add(acc);
+		if (k2 & _1n$1) p2 = p2.add(acc);
+		acc = acc.double();
+		k1 >>= _1n$1;
+		k2 >>= _1n$1;
+	}
+	return {
+		p1,
+		p2
+	};
+}
+function createField(order, field, isLE) {
+	if (field) {
+		if (field.ORDER !== order) throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
+		validateField(field);
+		return field;
+	} else return Field(order, { isLE });
+}
+/** Validates CURVE opts and creates fields */
+function createCurveFields(type, CURVE, curveOpts = {}, FpFnLE) {
+	if (FpFnLE === void 0) FpFnLE = type === "edwards";
+	if (!CURVE || typeof CURVE !== "object") throw new Error(`expected valid ${type} CURVE object`);
+	for (const p of [
+		"p",
+		"n",
+		"h"
+	]) {
+		const val = CURVE[p];
+		if (!(typeof val === "bigint" && val > _0n$1)) throw new Error(`CURVE.${p} must be positive bigint`);
+	}
+	const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);
+	const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);
+	const params = [
+		"Gx",
+		"Gy",
+		"a",
+		type === "weierstrass" ? "b" : "d"
+	];
+	for (const p of params) if (!Fp.isValid(CURVE[p])) throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);
+	CURVE = Object.freeze(Object.assign({}, CURVE));
+	return {
+		CURVE,
+		Fp,
+		Fn
+	};
+}
+function createKeygen(randomSecretKey, getPublicKey) {
+	return function keygen(seed) {
+		const secretKey = randomSecretKey(seed);
+		return {
+			secretKey,
+			publicKey: getPublicKey(secretKey)
+		};
+	};
+}
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/abstract/hash-to-curve.js
+const os2ip = bytesToNumberBE;
+function i2osp(value, length) {
+	asafenumber(value);
+	asafenumber(length);
+	if (value < 0 || value >= 1 << 8 * length) throw new Error("invalid I2OSP input: " + value);
+	const res = Array.from({ length }).fill(0);
+	for (let i = length - 1; i >= 0; i--) {
+		res[i] = value & 255;
+		value >>>= 8;
+	}
+	return new Uint8Array(res);
+}
+function strxor(a, b) {
+	const arr = new Uint8Array(a.length);
+	for (let i = 0; i < a.length; i++) arr[i] = a[i] ^ b[i];
+	return arr;
+}
+function normDST(DST) {
+	if (!isBytes$1(DST) && typeof DST !== "string") throw new Error("DST must be Uint8Array or ascii string");
+	return typeof DST === "string" ? asciiToBytes(DST) : DST;
+}
+/**
+* Produces a uniformly random byte string using a cryptographic hash function H that outputs b bits.
+* [RFC 9380 5.3.1](https://www.rfc-editor.org/rfc/rfc9380#section-5.3.1).
+*/
+function expand_message_xmd(msg, DST, lenInBytes, H) {
+	abytes$1(msg);
+	asafenumber(lenInBytes);
+	DST = normDST(DST);
+	if (DST.length > 255) DST = H(concatBytes(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 Z_pad = i2osp(0, 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(...[
+		strxor(b_0, b[i - 1]),
+		i2osp(i + 1, 1),
+		DST_prime
+	]));
+	return concatBytes(...b).slice(0, lenInBytes);
+}
+/**
+* Produces a uniformly random byte string using an extendable-output function (XOF) H.
+* 1. The collision resistance of H MUST be at least k bits.
+* 2. H MUST be an XOF that has been proved indifferentiable from
+*    a random oracle under a reasonable cryptographic assumption.
+* [RFC 9380 5.3.2](https://www.rfc-editor.org/rfc/rfc9380#section-5.3.2).
+*/
+function expand_message_xof(msg, DST, lenInBytes, k, H) {
+	abytes$1(msg);
+	asafenumber(lenInBytes);
+	DST = normDST(DST);
+	if (DST.length > 255) {
+		const dkLen = Math.ceil(2 * k / 8);
+		DST = H.create({ dkLen }).update(asciiToBytes("H2C-OVERSIZE-DST-")).update(DST).digest();
+	}
+	if (lenInBytes > 65535 || DST.length > 255) throw new Error("expand_message_xof: invalid lenInBytes");
+	return H.create({ dkLen: lenInBytes }).update(msg).update(i2osp(lenInBytes, 2)).update(DST).update(i2osp(DST.length, 1)).digest();
+}
+/**
+* Hashes arbitrary-length byte strings to a list of one or more elements of a finite field F.
+* [RFC 9380 5.2](https://www.rfc-editor.org/rfc/rfc9380#section-5.2).
+* @param msg a byte string containing the message to hash
+* @param count the number of elements of F to output
+* @param options `{DST: string, p: bigint, m: number, k: number, expand: 'xmd' | 'xof', hash: H}`, see above
+* @returns [u_0, ..., u_(count - 1)], a list of field elements.
+*/
+function hash_to_field(msg, count, options) {
+	validateObject(options, {
+		p: "bigint",
+		m: "number",
+		k: "number",
+		hash: "function"
+	});
+	const { p, k, m, hash, expand, DST } = options;
+	asafenumber(hash.outputLen, "valid hash");
+	abytes$1(msg);
+	asafenumber(count);
+	const log2p = p.toString(2).length;
+	const L = Math.ceil((log2p + k) / 8);
+	const len_in_bytes = count * m * L;
+	let prb;
+	if (expand === "xmd") prb = expand_message_xmd(msg, DST, len_in_bytes, hash);
+	else if (expand === "xof") prb = expand_message_xof(msg, DST, len_in_bytes, k, hash);
+	else if (expand === "_internal_pass") prb = msg;
+	else throw new Error("expand must be \"xmd\" or \"xof\"");
+	const u = new Array(count);
+	for (let i = 0; i < count; i++) {
+		const e = new Array(m);
+		for (let j = 0; j < m; j++) {
+			const elm_offset = L * (j + i * m);
+			e[j] = mod(os2ip(prb.subarray(elm_offset, elm_offset + L)), p);
+		}
+		u[i] = e;
+	}
+	return u;
+}
+function isogenyMap(field, map) {
+	const coeff = map.map((i) => Array.from(i).reverse());
+	return (x, y) => {
+		const [xn, xd, yn, yd] = coeff.map((val) => val.reduce((acc, i) => field.add(field.mul(acc, x), i)));
+		const [xd_inv, yd_inv] = FpInvertBatch(field, [xd, yd], true);
+		x = field.mul(xn, xd_inv);
+		y = field.mul(y, field.mul(yn, yd_inv));
+		return {
+			x,
+			y
+		};
+	};
+}
+const _DST_scalar = asciiToBytes("HashToScalar-");
+/** Creates hash-to-curve methods from EC Point and mapToCurve function. See {@link H2CHasher}. */
+function createHasher(Point, mapToCurve, defaults) {
+	if (typeof mapToCurve !== "function") throw new Error("mapToCurve() must be defined");
+	function map(num) {
+		return Point.fromAffine(mapToCurve(num));
+	}
+	function clear(initial) {
+		const P = initial.clearCofactor();
+		if (P.equals(Point.ZERO)) return Point.ZERO;
+		P.assertValidity();
+		return P;
+	}
+	return {
+		defaults: Object.freeze(defaults),
+		Point,
+		hashToCurve(msg, options) {
+			const u = hash_to_field(msg, 2, Object.assign({}, defaults, options));
+			const u0 = map(u[0]);
+			const u1 = map(u[1]);
+			return clear(u0.add(u1));
+		},
+		encodeToCurve(msg, options) {
+			const optsDst = defaults.encodeDST ? { DST: defaults.encodeDST } : {};
+			return clear(map(hash_to_field(msg, 1, Object.assign({}, defaults, optsDst, options))[0]));
+		},
+		mapToCurve(scalars) {
+			if (defaults.m === 1) {
+				if (typeof scalars !== "bigint") throw new Error("expected bigint (m=1)");
+				return clear(map([scalars]));
+			}
+			if (!Array.isArray(scalars)) throw new Error("expected array of bigints");
+			for (const i of scalars) if (typeof i !== "bigint") throw new Error("expected array of bigints");
+			return clear(map(scalars));
+		},
+		hashToScalar(msg, options) {
+			const N = Point.Fn.ORDER;
+			return hash_to_field(msg, 1, Object.assign({}, defaults, {
+				p: N,
+				m: 1,
+				DST: _DST_scalar
+			}, options))[0][0];
+		}
+	};
+}
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/hashes/hmac.js
+/**
+* HMAC: RFC2104 message authentication code.
+* @module
+*/
+/** Internal class for HMAC. */
+var _HMAC = class {
+	oHash;
+	iHash;
+	blockLen;
+	outputLen;
+	finished = false;
+	destroyed = false;
+	constructor(hash, key) {
+		ahash(hash);
+		abytes$1(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;
+		this.outputLen = this.iHash.outputLen;
+		const blockLen = this.blockLen;
+		const pad = new Uint8Array(blockLen);
+		pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
+		for (let i = 0; i < pad.length; i++) pad[i] ^= 54;
+		this.iHash.update(pad);
+		this.oHash = hash.create();
+		for (let i = 0; i < pad.length; i++) pad[i] ^= 106;
+		this.oHash.update(pad);
+		clean(pad);
+	}
+	update(buf) {
+		aexists(this);
+		this.iHash.update(buf);
+		return this;
+	}
+	digestInto(out) {
+		aexists(this);
+		abytes$1(out, this.outputLen, "output");
+		this.finished = true;
+		this.iHash.digestInto(out);
+		this.oHash.update(out);
+		this.oHash.digestInto(out);
+		this.destroy();
+	}
+	digest() {
+		const out = new Uint8Array(this.oHash.outputLen);
+		this.digestInto(out);
+		return out;
+	}
+	_cloneInto(to) {
+		to ||= Object.create(Object.getPrototypeOf(this), {});
+		const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
+		to = to;
+		to.finished = finished;
+		to.destroyed = destroyed;
+		to.blockLen = blockLen;
+		to.outputLen = outputLen;
+		to.oHash = oHash._cloneInto(to.oHash);
+		to.iHash = iHash._cloneInto(to.iHash);
+		return to;
+	}
+	clone() {
+		return this._cloneInto();
+	}
+	destroy() {
+		this.destroyed = true;
+		this.oHash.destroy();
+		this.iHash.destroy();
+	}
+};
+/**
+* HMAC: RFC2104 message authentication code.
+* @param hash - function that would be used e.g. sha256
+* @param key - message key
+* @param message - message data
+* @example
+* import { hmac } from '@noble/hashes/hmac';
+* import { sha256 } from '@noble/hashes/sha2';
+* const mac1 = hmac(sha256, 'key', 'message');
+*/
+const hmac = (hash, key, message) => new _HMAC(hash, key).update(message).digest();
+hmac.create = (hash, key) => new _HMAC(hash, key);
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/abstract/weierstrass.js
+/**
+* Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.
+*
+* ### Design rationale for types
+*
+* * Interaction between classes from different curves should fail:
+*   `k256.Point.BASE.add(p256.Point.BASE)`
+* * For this purpose we want to use `instanceof` operator, which is fast and works during runtime
+* * Different calls of `curve()` would return different classes -
+*   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,
+*   it won't affect others
+*
+* TypeScript can't infer types for classes created inside a function. Classes is one instance
+* of nominative types in TypeScript and interfaces only check for shape, so it's hard to create
+* unique type for every function call.
+*
+* We can use generic types via some param, like curve opts, but that would:
+*     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)
+*     which is hard to debug.
+*     2. Params can be generic and we can't enforce them to be constant value:
+*     if somebody creates curve from non-constant params,
+*     it would be allowed to interact with other curves with non-constant params
+*
+* @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const divNearest = (num, den) => (num + (num >= 0 ? den : -den) / _2n$1) / den;
+/**
+* Splits scalar for GLV endomorphism.
+*/
+function _splitEndoScalar(k, basis, n) {
+	const [[a1, b1], [a2, b2]] = basis;
+	const c1 = divNearest(b2 * k, n);
+	const c2 = divNearest(-b1 * k, n);
+	let k1 = k - c1 * a1 - c2 * a2;
+	let k2 = -c1 * b1 - c2 * b2;
+	const k1neg = k1 < _0n;
+	const k2neg = k2 < _0n;
+	if (k1neg) k1 = -k1;
+	if (k2neg) k2 = -k2;
+	const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n;
+	if (k1 < _0n || k1 >= MAX_NUM || k2 < _0n || k2 >= MAX_NUM) throw new Error("splitScalar (endomorphism): failed, k=" + k);
+	return {
+		k1neg,
+		k1,
+		k2neg,
+		k2
+	};
+}
+function validateSigFormat(format) {
+	if (![
+		"compact",
+		"recovered",
+		"der"
+	].includes(format)) throw new Error("Signature format must be \"compact\", \"recovered\", or \"der\"");
+	return format;
+}
+function validateSigOpts(opts, def) {
+	const optsn = {};
+	for (let optName of Object.keys(def)) optsn[optName] = opts[optName] === void 0 ? def[optName] : opts[optName];
+	abool(optsn.lowS, "lowS");
+	abool(optsn.prehash, "prehash");
+	if (optsn.format !== void 0) validateSigFormat(optsn.format);
+	return optsn;
+}
+var DERErr = class extends Error {
+	constructor(m = "") {
+		super(m);
+	}
+};
+/**
+* ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:
+*
+*     [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]
+*
+* Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html
+*/
+const DER = {
+	Err: DERErr,
+	_tlv: {
+		encode: (tag, data) => {
+			const { Err: E } = DER;
+			if (tag < 0 || tag > 256) throw new E("tlv.encode: wrong tag");
+			if (data.length & 1) throw new E("tlv.encode: unpadded data");
+			const dataLen = data.length / 2;
+			const len = numberToHexUnpadded(dataLen);
+			if (len.length / 2 & 128) throw new E("tlv.encode: long form length too big");
+			const lenLen = dataLen > 127 ? numberToHexUnpadded(len.length / 2 | 128) : "";
+			return numberToHexUnpadded(tag) + lenLen + len + data;
+		},
+		decode(tag, data) {
+			const { Err: E } = DER;
+			let pos = 0;
+			if (tag < 0 || tag > 256) throw new E("tlv.encode: wrong tag");
+			if (data.length < 2 || data[pos++] !== tag) throw new E("tlv.decode: wrong tlv");
+			const first = data[pos++];
+			const isLong = !!(first & 128);
+			let length = 0;
+			if (!isLong) length = first;
+			else {
+				const lenLen = first & 127;
+				if (!lenLen) throw new E("tlv.decode(long): indefinite length not supported");
+				if (lenLen > 4) throw new E("tlv.decode(long): byte length is too big");
+				const lengthBytes = data.subarray(pos, pos + lenLen);
+				if (lengthBytes.length !== lenLen) throw new E("tlv.decode: length bytes not complete");
+				if (lengthBytes[0] === 0) throw new E("tlv.decode(long): zero leftmost byte");
+				for (const b of lengthBytes) length = length << 8 | b;
+				pos += lenLen;
+				if (length < 128) throw new E("tlv.decode(long): not minimal encoding");
+			}
+			const v = data.subarray(pos, pos + length);
+			if (v.length !== length) throw new E("tlv.decode: wrong value length");
+			return {
+				v,
+				l: data.subarray(pos + length)
+			};
+		}
+	},
+	_int: {
+		encode(num) {
+			const { Err: E } = DER;
+			if (num < _0n) throw new E("integer: negative integers are not allowed");
+			let hex = numberToHexUnpadded(num);
+			if (Number.parseInt(hex[0], 16) & 8) hex = "00" + hex;
+			if (hex.length & 1) throw new E("unexpected DER parsing assertion: unpadded hex");
+			return hex;
+		},
+		decode(data) {
+			const { Err: E } = DER;
+			if (data[0] & 128) throw new E("invalid signature integer: negative");
+			if (data[0] === 0 && !(data[1] & 128)) throw new E("invalid signature integer: unnecessary leading zero");
+			return bytesToNumberBE(data);
+		}
+	},
+	toSig(bytes) {
+		const { Err: E, _int: int, _tlv: tlv } = DER;
+		const data = abytes$1(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);
+		const { v: sBytes, l: sLeftBytes } = tlv.decode(2, rLeftBytes);
+		if (sLeftBytes.length) throw new E("invalid signature: left bytes after parsing");
+		return {
+			r: int.decode(rBytes),
+			s: int.decode(sBytes)
+		};
+	},
+	hexFromSig(sig) {
+		const { _tlv: tlv, _int: int } = DER;
+		const seq = tlv.encode(2, int.encode(sig.r)) + tlv.encode(2, int.encode(sig.s));
+		return tlv.encode(48, seq);
+	}
+};
+const _0n = BigInt(0), _1n = BigInt(1), _2n$1 = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);
+/**
+* Creates weierstrass Point constructor, based on specified curve options.
+*
+* See {@link WeierstrassOpts}.
+*
+* @example
+```js
+const opts = {
+p: 0xfffffffffffffffffffffffffffffffeffffac73n,
+n: 0x100000000000000000001b8fa16dfab9aca16b6b3n,
+h: 1n,
+a: 0n,
+b: 7n,
+Gx: 0x3b4c382ce37aa192a4019e763036f4f5dd4d7ebbn,
+Gy: 0x938cf935318fdced6bc28286531733c3f03c4feen,
+};
+const secp160k1_Point = weierstrass(opts);
+```
+*/
+function weierstrass(params, extraOpts = {}) {
+	const validated = createCurveFields("weierstrass", params, extraOpts);
+	const { Fp, Fn } = validated;
+	let CURVE = validated.CURVE;
+	const { h: cofactor, n: CURVE_ORDER } = CURVE;
+	validateObject(extraOpts, {}, {
+		allowInfinityPoint: "boolean",
+		clearCofactor: "function",
+		isTorsionFree: "function",
+		fromBytes: "function",
+		toBytes: "function",
+		endo: "object"
+	});
+	const { endo } = extraOpts;
+	if (endo) {
+		if (!Fp.is0(CURVE.a) || typeof endo.beta !== "bigint" || !Array.isArray(endo.basises)) throw new Error("invalid endo: expected \"beta\": bigint and \"basises\": array");
+	}
+	const lengths = getWLengths(Fp, Fn);
+	function assertCompressionIsSupported() {
+		if (!Fp.isOdd) throw new Error("compression is not supported: Field does not have .isOdd()");
+	}
+	function pointToBytes(_c, point, isCompressed) {
+		const { x, y } = point.toAffine();
+		const bx = Fp.toBytes(x);
+		abool(isCompressed, "isCompressed");
+		if (isCompressed) {
+			assertCompressionIsSupported();
+			return concatBytes(pprefix(!Fp.isOdd(y)), bx);
+		} else return concatBytes(Uint8Array.of(4), bx, Fp.toBytes(y));
+	}
+	function pointFromBytes(bytes) {
+		abytes$1(bytes, void 0, "Point");
+		const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths;
+		const length = bytes.length;
+		const head = bytes[0];
+		const tail = bytes.subarray(1);
+		if (length === comp && (head === 2 || head === 3)) {
+			const x = Fp.fromBytes(tail);
+			if (!Fp.isValid(x)) throw new Error("bad point: is not on curve, wrong x");
+			const y2 = weierstrassEquation(x);
+			let y;
+			try {
+				y = Fp.sqrt(y2);
+			} catch (sqrtError) {
+				const err = sqrtError instanceof Error ? ": " + sqrtError.message : "";
+				throw new Error("bad point: is not on curve, sqrt error" + err);
+			}
+			assertCompressionIsSupported();
+			const evenY = Fp.isOdd(y);
+			if ((head & 1) === 1 !== evenY) y = Fp.neg(y);
+			return {
+				x,
+				y
+			};
+		} else if (length === uncomp && head === 4) {
+			const L = Fp.BYTES;
+			const x = Fp.fromBytes(tail.subarray(0, L));
+			const y = Fp.fromBytes(tail.subarray(L, L * 2));
+			if (!isValidXY(x, y)) throw new Error("bad point: is not on curve");
+			return {
+				x,
+				y
+			};
+		} else throw new Error(`bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`);
+	}
+	const encodePoint = extraOpts.toBytes || pointToBytes;
+	const decodePoint = extraOpts.fromBytes || pointFromBytes;
+	function weierstrassEquation(x) {
+		const x2 = Fp.sqr(x);
+		const x3 = Fp.mul(x2, x);
+		return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b);
+	}
+	/** Checks whether equation holds for given x, y: y² == x³ + ax + b */
+	function isValidXY(x, y) {
+		const left = Fp.sqr(y);
+		const right = weierstrassEquation(x);
+		return Fp.eql(left, right);
+	}
+	if (!isValidXY(CURVE.Gx, CURVE.Gy)) throw new Error("bad curve params: generator point");
+	const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);
+	const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));
+	if (Fp.is0(Fp.add(_4a3, _27b2))) throw new Error("bad curve params: a or b");
+	/** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */
+	function acoord(title, n, banZero = false) {
+		if (!Fp.isValid(n) || banZero && Fp.is0(n)) throw new Error(`bad point coordinate ${title}`);
+		return n;
+	}
+	function aprjpoint(other) {
+		if (!(other instanceof Point)) throw new Error("Weierstrass Point expected");
+	}
+	function splitEndoScalarN(k) {
+		if (!endo || !endo.basises) throw new Error("no endo");
+		return _splitEndoScalar(k, endo.basises, Fn.ORDER);
+	}
+	const toAffineMemo = memoized((p, iz) => {
+		const { X, Y, Z } = p;
+		if (Fp.eql(Z, Fp.ONE)) return {
+			x: X,
+			y: Y
+		};
+		const is0 = p.is0();
+		if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(Z);
+		const x = Fp.mul(X, iz);
+		const y = Fp.mul(Y, iz);
+		const zz = Fp.mul(Z, iz);
+		if (is0) return {
+			x: Fp.ZERO,
+			y: Fp.ZERO
+		};
+		if (!Fp.eql(zz, Fp.ONE)) throw new Error("invZ was invalid");
+		return {
+			x,
+			y
+		};
+	});
+	const assertValidMemo = memoized((p) => {
+		if (p.is0()) {
+			if (extraOpts.allowInfinityPoint && !Fp.is0(p.Y)) return;
+			throw new Error("bad point: ZERO");
+		}
+		const { x, y } = p.toAffine();
+		if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error("bad point: x or y not field elements");
+		if (!isValidXY(x, y)) throw new Error("bad point: equation left != right");
+		if (!p.isTorsionFree()) throw new Error("bad point: not in prime-order subgroup");
+		return true;
+	});
+	function finishEndo(endoBeta, k1p, k2p, k1neg, k2neg) {
+		k2p = new Point(Fp.mul(k2p.X, endoBeta), k2p.Y, k2p.Z);
+		k1p = negateCt(k1neg, k1p);
+		k2p = negateCt(k2neg, k2p);
+		return k1p.add(k2p);
+	}
+	/**
+	* Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) ∋ (x=X/Z, y=Y/Z).
+	* Default Point works in 2d / affine coordinates: (x, y).
+	* We're doing calculations in projective, because its operations don't require costly inversion.
+	*/
+	class Point {
+		static BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);
+		static ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);
+		static Fp = Fp;
+		static Fn = Fn;
+		X;
+		Y;
+		Z;
+		/** Does NOT validate if the point is valid. Use `.assertValidity()`. */
+		constructor(X, Y, Z) {
+			this.X = acoord("x", X);
+			this.Y = acoord("y", Y, true);
+			this.Z = acoord("z", Z);
+			Object.freeze(this);
+		}
+		static CURVE() {
+			return CURVE;
+		}
+		/** Does NOT validate if the point is valid. Use `.assertValidity()`. */
+		static fromAffine(p) {
+			const { x, y } = p || {};
+			if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error("invalid affine point");
+			if (p instanceof Point) throw new Error("projective point not allowed");
+			if (Fp.is0(x) && Fp.is0(y)) return Point.ZERO;
+			return new Point(x, y, Fp.ONE);
+		}
+		static fromBytes(bytes) {
+			const P = Point.fromAffine(decodePoint(abytes$1(bytes, void 0, "point")));
+			P.assertValidity();
+			return P;
+		}
+		static fromHex(hex) {
+			return Point.fromBytes(hexToBytes(hex));
+		}
+		get x() {
+			return this.toAffine().x;
+		}
+		get y() {
+			return this.toAffine().y;
+		}
+		/**
+		*
+		* @param windowSize
+		* @param isLazy true will defer table computation until the first multiplication
+		* @returns
+		*/
+		precompute(windowSize = 8, isLazy = true) {
+			wnaf.createCache(this, windowSize);
+			if (!isLazy) this.multiply(_3n);
+			return this;
+		}
+		/** A point on curve is valid if it conforms to equation. */
+		assertValidity() {
+			assertValidMemo(this);
+		}
+		hasEvenY() {
+			const { y } = this.toAffine();
+			if (!Fp.isOdd) throw new Error("Field doesn't support isOdd");
+			return !Fp.isOdd(y);
+		}
+		/** Compare one point to another. */
+		equals(other) {
+			aprjpoint(other);
+			const { X: X1, Y: Y1, Z: Z1 } = this;
+			const { X: X2, Y: Y2, Z: Z2 } = other;
+			const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));
+			const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));
+			return U1 && U2;
+		}
+		/** Flips point to one corresponding to (x, -y) in Affine coordinates. */
+		negate() {
+			return new Point(this.X, Fp.neg(this.Y), this.Z);
+		}
+		double() {
+			const { a, b } = CURVE;
+			const b3 = Fp.mul(b, _3n);
+			const { X: X1, Y: Y1, Z: Z1 } = this;
+			let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO;
+			let t0 = Fp.mul(X1, X1);
+			let t1 = Fp.mul(Y1, Y1);
+			let t2 = Fp.mul(Z1, Z1);
+			let t3 = Fp.mul(X1, Y1);
+			t3 = Fp.add(t3, t3);
+			Z3 = Fp.mul(X1, Z1);
+			Z3 = Fp.add(Z3, Z3);
+			X3 = Fp.mul(a, Z3);
+			Y3 = Fp.mul(b3, t2);
+			Y3 = Fp.add(X3, Y3);
+			X3 = Fp.sub(t1, Y3);
+			Y3 = Fp.add(t1, Y3);
+			Y3 = Fp.mul(X3, Y3);
+			X3 = Fp.mul(t3, X3);
+			Z3 = Fp.mul(b3, Z3);
+			t2 = Fp.mul(a, t2);
+			t3 = Fp.sub(t0, t2);
+			t3 = Fp.mul(a, t3);
+			t3 = Fp.add(t3, Z3);
+			Z3 = Fp.add(t0, t0);
+			t0 = Fp.add(Z3, t0);
+			t0 = Fp.add(t0, t2);
+			t0 = Fp.mul(t0, t3);
+			Y3 = Fp.add(Y3, t0);
+			t2 = Fp.mul(Y1, Z1);
+			t2 = Fp.add(t2, t2);
+			t0 = Fp.mul(t2, t3);
+			X3 = Fp.sub(X3, t0);
+			Z3 = Fp.mul(t2, t1);
+			Z3 = Fp.add(Z3, Z3);
+			Z3 = Fp.add(Z3, Z3);
+			return new Point(X3, Y3, Z3);
+		}
+		add(other) {
+			aprjpoint(other);
+			const { X: X1, Y: Y1, Z: Z1 } = this;
+			const { X: X2, Y: Y2, Z: Z2 } = other;
+			let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO;
+			const a = CURVE.a;
+			const b3 = Fp.mul(CURVE.b, _3n);
+			let t0 = Fp.mul(X1, X2);
+			let t1 = Fp.mul(Y1, Y2);
+			let t2 = Fp.mul(Z1, Z2);
+			let t3 = Fp.add(X1, Y1);
+			let t4 = Fp.add(X2, Y2);
+			t3 = Fp.mul(t3, t4);
+			t4 = Fp.add(t0, t1);
+			t3 = Fp.sub(t3, t4);
+			t4 = Fp.add(X1, Z1);
+			let t5 = Fp.add(X2, Z2);
+			t4 = Fp.mul(t4, t5);
+			t5 = Fp.add(t0, t2);
+			t4 = Fp.sub(t4, t5);
+			t5 = Fp.add(Y1, Z1);
+			X3 = Fp.add(Y2, Z2);
+			t5 = Fp.mul(t5, X3);
+			X3 = Fp.add(t1, t2);
+			t5 = Fp.sub(t5, X3);
+			Z3 = Fp.mul(a, t4);
+			X3 = Fp.mul(b3, t2);
+			Z3 = Fp.add(X3, Z3);
+			X3 = Fp.sub(t1, Z3);
+			Z3 = Fp.add(t1, Z3);
+			Y3 = Fp.mul(X3, Z3);
+			t1 = Fp.add(t0, t0);
+			t1 = Fp.add(t1, t0);
+			t2 = Fp.mul(a, t2);
+			t4 = Fp.mul(b3, t4);
+			t1 = Fp.add(t1, t2);
+			t2 = Fp.sub(t0, t2);
+			t2 = Fp.mul(a, t2);
+			t4 = Fp.add(t4, t2);
+			t0 = Fp.mul(t1, t4);
+			Y3 = Fp.add(Y3, t0);
+			t0 = Fp.mul(t5, t4);
+			X3 = Fp.mul(t3, X3);
+			X3 = Fp.sub(X3, t0);
+			t0 = Fp.mul(t3, t1);
+			Z3 = Fp.mul(t5, Z3);
+			Z3 = Fp.add(Z3, t0);
+			return new Point(X3, Y3, Z3);
+		}
+		subtract(other) {
+			return this.add(other.negate());
+		}
+		is0() {
+			return this.equals(Point.ZERO);
+		}
+		/**
+		* Constant time multiplication.
+		* Uses wNAF method. Windowed method may be 10% faster,
+		* but takes 2x longer to generate and consumes 2x memory.
+		* Uses precomputes when available.
+		* Uses endomorphism for Koblitz curves.
+		* @param scalar by which the point would be multiplied
+		* @returns New point
+		*/
+		multiply(scalar) {
+			const { endo } = extraOpts;
+			if (!Fn.isValidNot0(scalar)) throw new Error("invalid scalar: out of range");
+			let point, fake;
+			const mul = (n) => wnaf.cached(this, n, (p) => normalizeZ(Point, p));
+			/** See docs for {@link EndomorphismOpts} */
+			if (endo) {
+				const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(scalar);
+				const { p: k1p, f: k1f } = mul(k1);
+				const { p: k2p, f: k2f } = mul(k2);
+				fake = k1f.add(k2f);
+				point = finishEndo(endo.beta, k1p, k2p, k1neg, k2neg);
+			} else {
+				const { p, f } = mul(scalar);
+				point = p;
+				fake = f;
+			}
+			return normalizeZ(Point, [point, fake])[0];
+		}
+		/**
+		* Non-constant-time multiplication. Uses double-and-add algorithm.
+		* It's faster, but should only be used when you don't care about
+		* an exposed secret key e.g. sig verification, which works over *public* keys.
+		*/
+		multiplyUnsafe(sc) {
+			const { endo } = extraOpts;
+			const p = this;
+			if (!Fn.isValid(sc)) throw new Error("invalid scalar: out of range");
+			if (sc === _0n || p.is0()) return Point.ZERO;
+			if (sc === _1n) return p;
+			if (wnaf.hasCache(this)) return this.multiply(sc);
+			if (endo) {
+				const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(sc);
+				const { p1, p2 } = mulEndoUnsafe(Point, p, k1, k2);
+				return finishEndo(endo.beta, p1, p2, k1neg, k2neg);
+			} else return wnaf.unsafe(p, sc);
+		}
+		/**
+		* Converts Projective point to affine (x, y) coordinates.
+		* @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
+		*/
+		toAffine(invertedZ) {
+			return toAffineMemo(this, invertedZ);
+		}
+		/**
+		* Checks whether Point is free of torsion elements (is in prime subgroup).
+		* Always torsion-free for cofactor=1 curves.
+		*/
+		isTorsionFree() {
+			const { isTorsionFree } = extraOpts;
+			if (cofactor === _1n) return true;
+			if (isTorsionFree) return isTorsionFree(Point, this);
+			return wnaf.unsafe(this, CURVE_ORDER).is0();
+		}
+		clearCofactor() {
+			const { clearCofactor } = extraOpts;
+			if (cofactor === _1n) return this;
+			if (clearCofactor) return clearCofactor(Point, this);
+			return this.multiplyUnsafe(cofactor);
+		}
+		isSmallOrder() {
+			return this.multiplyUnsafe(cofactor).is0();
+		}
+		toBytes(isCompressed = true) {
+			abool(isCompressed, "isCompressed");
+			this.assertValidity();
+			return encodePoint(Point, this, isCompressed);
+		}
+		toHex(isCompressed = true) {
+			return bytesToHex(this.toBytes(isCompressed));
+		}
+		toString() {
+			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
+		}
+	}
+	const bits = Fn.BITS;
+	const wnaf = new wNAF(Point, extraOpts.endo ? Math.ceil(bits / 2) : bits);
+	Point.BASE.precompute(8);
+	return Point;
+}
+function pprefix(hasEvenY) {
+	return Uint8Array.of(hasEvenY ? 2 : 3);
+}
+/**
+* Implementation of the Shallue and van de Woestijne method for any weierstrass curve.
+* TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.
+* b = True and y = sqrt(u / v) if (u / v) is square in F, and
+* b = False and y = sqrt(Z * (u / v)) otherwise.
+* @param Fp
+* @param Z
+* @returns
+*/
+function SWUFpSqrtRatio(Fp, Z) {
+	const q = Fp.ORDER;
+	let l = _0n;
+	for (let o = q - _1n; o % _2n$1 === _0n; o /= _2n$1) l += _1n;
+	const c1 = l;
+	const _2n_pow_c1_1 = _2n$1 << c1 - _1n - _1n;
+	const _2n_pow_c1 = _2n_pow_c1_1 * _2n$1;
+	const c2 = (q - _1n) / _2n_pow_c1;
+	const c3 = (c2 - _1n) / _2n$1;
+	const c4 = _2n_pow_c1 - _1n;
+	const c5 = _2n_pow_c1_1;
+	const c6 = Fp.pow(Z, c2);
+	const c7 = Fp.pow(Z, (c2 + _1n) / _2n$1);
+	let sqrtRatio = (u, v) => {
+		let tv1 = c6;
+		let tv2 = Fp.pow(v, c4);
+		let tv3 = Fp.sqr(tv2);
+		tv3 = Fp.mul(tv3, v);
+		let tv5 = Fp.mul(u, tv3);
+		tv5 = Fp.pow(tv5, c3);
+		tv5 = Fp.mul(tv5, tv2);
+		tv2 = Fp.mul(tv5, v);
+		tv3 = Fp.mul(tv5, u);
+		let tv4 = Fp.mul(tv3, tv2);
+		tv5 = Fp.pow(tv4, c5);
+		let isQR = Fp.eql(tv5, Fp.ONE);
+		tv2 = Fp.mul(tv3, c7);
+		tv5 = Fp.mul(tv4, tv1);
+		tv3 = Fp.cmov(tv2, tv3, isQR);
+		tv4 = Fp.cmov(tv5, tv4, isQR);
+		for (let i = c1; i > _1n; i--) {
+			let tv5 = i - _2n$1;
+			tv5 = _2n$1 << tv5 - _1n;
+			let tvv5 = Fp.pow(tv4, tv5);
+			const e1 = Fp.eql(tvv5, Fp.ONE);
+			tv2 = Fp.mul(tv3, tv1);
+			tv1 = Fp.mul(tv1, tv1);
+			tvv5 = Fp.mul(tv4, tv1);
+			tv3 = Fp.cmov(tv2, tv3, e1);
+			tv4 = Fp.cmov(tvv5, tv4, e1);
+		}
+		return {
+			isValid: isQR,
+			value: tv3
+		};
+	};
+	if (Fp.ORDER % _4n === _3n) {
+		const c1 = (Fp.ORDER - _3n) / _4n;
+		const c2 = Fp.sqrt(Fp.neg(Z));
+		sqrtRatio = (u, v) => {
+			let tv1 = Fp.sqr(v);
+			const tv2 = Fp.mul(u, v);
+			tv1 = Fp.mul(tv1, tv2);
+			let y1 = Fp.pow(tv1, c1);
+			y1 = Fp.mul(y1, tv2);
+			const y2 = Fp.mul(y1, c2);
+			const tv3 = Fp.mul(Fp.sqr(y1), v);
+			const isQR = Fp.eql(tv3, u);
+			return {
+				isValid: isQR,
+				value: Fp.cmov(y2, y1, isQR)
+			};
+		};
+	}
+	return sqrtRatio;
+}
+/**
+* Simplified Shallue-van de Woestijne-Ulas Method
+* https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2
+*/
+function mapToCurveSimpleSWU(Fp, opts) {
+	validateField(Fp);
+	const { A, B, Z } = opts;
+	if (!Fp.isValid(A) || !Fp.isValid(B) || !Fp.isValid(Z)) throw new Error("mapToCurveSimpleSWU: invalid opts");
+	const sqrtRatio = SWUFpSqrtRatio(Fp, Z);
+	if (!Fp.isOdd) throw new Error("Field does not have .isOdd()");
+	return (u) => {
+		let tv1, tv2, tv3, tv4, tv5, tv6, x, y;
+		tv1 = Fp.sqr(u);
+		tv1 = Fp.mul(tv1, Z);
+		tv2 = Fp.sqr(tv1);
+		tv2 = Fp.add(tv2, tv1);
+		tv3 = Fp.add(tv2, Fp.ONE);
+		tv3 = Fp.mul(tv3, B);
+		tv4 = Fp.cmov(Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO));
+		tv4 = Fp.mul(tv4, A);
+		tv2 = Fp.sqr(tv3);
+		tv6 = Fp.sqr(tv4);
+		tv5 = Fp.mul(tv6, A);
+		tv2 = Fp.add(tv2, tv5);
+		tv2 = Fp.mul(tv2, tv3);
+		tv6 = Fp.mul(tv6, tv4);
+		tv5 = Fp.mul(tv6, B);
+		tv2 = Fp.add(tv2, tv5);
+		x = Fp.mul(tv1, tv3);
+		const { isValid, value } = sqrtRatio(tv2, tv6);
+		y = Fp.mul(tv1, u);
+		y = Fp.mul(y, value);
+		x = Fp.cmov(x, tv3, isValid);
+		y = Fp.cmov(y, value, isValid);
+		const e1 = Fp.isOdd(u) === Fp.isOdd(y);
+		y = Fp.cmov(Fp.neg(y), y, e1);
+		const tv4_inv = FpInvertBatch(Fp, [tv4], true)[0];
+		x = Fp.mul(x, tv4_inv);
+		return {
+			x,
+			y
+		};
+	};
+}
+function getWLengths(Fp, Fn) {
+	return {
+		secretKey: Fn.BYTES,
+		publicKey: 1 + Fp.BYTES,
+		publicKeyUncompressed: 1 + 2 * Fp.BYTES,
+		publicKeyHasPrefix: true,
+		signature: 2 * Fn.BYTES
+	};
+}
+/**
+* Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.
+* This helper ensures no signature functionality is present. Less code, smaller bundle size.
+*/
+function ecdh(Point, ecdhOpts = {}) {
+	const { Fn } = Point;
+	const randomBytes_ = ecdhOpts.randomBytes || randomBytes;
+	const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });
+	function isValidSecretKey(secretKey) {
+		try {
+			const num = Fn.fromBytes(secretKey);
+			return Fn.isValidNot0(num);
+		} catch (error) {
+			return false;
+		}
+	}
+	function isValidPublicKey(publicKey, isCompressed) {
+		const { publicKey: comp, publicKeyUncompressed } = lengths;
+		try {
+			const l = publicKey.length;
+			if (isCompressed === true && l !== comp) return false;
+			if (isCompressed === false && l !== publicKeyUncompressed) return false;
+			return !!Point.fromBytes(publicKey);
+		} catch (error) {
+			return false;
+		}
+	}
+	/**
+	* Produces cryptographically secure secret key from random of size
+	* (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
+	*/
+	function randomSecretKey(seed = randomBytes_(lengths.seed)) {
+		return mapHashToField(abytes$1(seed, lengths.seed, "seed"), Fn.ORDER);
+	}
+	/**
+	* Computes public key for a secret key. Checks for validity of the secret key.
+	* @param isCompressed whether to return compact (default), or full key
+	* @returns Public key, full when isCompressed=false; short when isCompressed=true
+	*/
+	function getPublicKey(secretKey, isCompressed = true) {
+		return Point.BASE.multiply(Fn.fromBytes(secretKey)).toBytes(isCompressed);
+	}
+	/**
+	* Quick and dirty check for item being public key. Does not validate hex, or being on-curve.
+	*/
+	function isProbPub(item) {
+		const { secretKey, publicKey, publicKeyUncompressed } = lengths;
+		if (!isBytes$1(item)) return void 0;
+		if ("_lengths" in Fn && Fn._lengths || secretKey === publicKey) return void 0;
+		const l = abytes$1(item, void 0, "key").length;
+		return l === publicKey || l === publicKeyUncompressed;
+	}
+	/**
+	* ECDH (Elliptic Curve Diffie Hellman).
+	* Computes shared public key from secret key A and public key B.
+	* Checks: 1) secret key validity 2) shared key is on-curve.
+	* Does NOT hash the result.
+	* @param isCompressed whether to return compact (default), or full key
+	* @returns shared public key
+	*/
+	function getSharedSecret(secretKeyA, publicKeyB, isCompressed = true) {
+		if (isProbPub(secretKeyA) === true) throw new Error("first arg must be private key");
+		if (isProbPub(publicKeyB) === false) throw new Error("second arg must be public key");
+		const s = Fn.fromBytes(secretKeyA);
+		return Point.fromBytes(publicKeyB).multiply(s).toBytes(isCompressed);
+	}
+	const utils = {
+		isValidSecretKey,
+		isValidPublicKey,
+		randomSecretKey
+	};
+	const keygen = createKeygen(randomSecretKey, getPublicKey);
+	return Object.freeze({
+		getPublicKey,
+		getSharedSecret,
+		keygen,
+		Point,
+		utils,
+		lengths
+	});
+}
+/**
+* Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.
+*
+* @param Point created using {@link weierstrass} function
+* @param hash used for 1) message prehash-ing 2) k generation in `sign`, using hmac_drbg(hash)
+* @param ecdsaOpts rarely needed, see {@link ECDSAOpts}
+*
+* @example
+* ```js
+* const p256_Point = weierstrass(...);
+* const p256_sha256 = ecdsa(p256_Point, sha256);
+* const p256_sha224 = ecdsa(p256_Point, sha224);
+* const p256_sha224_r = ecdsa(p256_Point, sha224, { randomBytes: (length) => { ... } });
+* ```
+*/
+function ecdsa(Point, hash, ecdsaOpts = {}) {
+	ahash(hash);
+	validateObject(ecdsaOpts, {}, {
+		hmac: "function",
+		lowS: "boolean",
+		randomBytes: "function",
+		bits2int: "function",
+		bits2int_modN: "function"
+	});
+	ecdsaOpts = Object.assign({}, ecdsaOpts);
+	const randomBytes$1 = ecdsaOpts.randomBytes || randomBytes;
+	const hmac$1 = ecdsaOpts.hmac || ((key, msg) => hmac(hash, key, msg));
+	const { Fp, Fn } = Point;
+	const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;
+	const { keygen, getPublicKey, getSharedSecret, utils, lengths } = ecdh(Point, ecdsaOpts);
+	const defaultSigOpts = {
+		prehash: true,
+		lowS: typeof ecdsaOpts.lowS === "boolean" ? ecdsaOpts.lowS : true,
+		format: "compact",
+		extraEntropy: false
+	};
+	const hasLargeCofactor = CURVE_ORDER * _2n$1 < Fp.ORDER;
+	function isBiggerThanHalfOrder(number) {
+		return number > CURVE_ORDER >> _1n;
+	}
+	function validateRS(title, num) {
+		if (!Fn.isValidNot0(num)) throw new Error(`invalid signature ${title}: out of range 1..Point.Fn.ORDER`);
+		return num;
+	}
+	function assertSmallCofactor() {
+		if (hasLargeCofactor) throw new Error("\"recovered\" sig type is not supported for cofactor >2 curves");
+	}
+	function validateSigLength(bytes, format) {
+		validateSigFormat(format);
+		const size = lengths.signature;
+		return abytes$1(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0);
+	}
+	/**
+	* ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.
+	*/
+	class Signature {
+		r;
+		s;
+		recovery;
+		constructor(r, s, recovery) {
+			this.r = validateRS("r", r);
+			this.s = validateRS("s", s);
+			if (recovery != null) {
+				assertSmallCofactor();
+				if (![
+					0,
+					1,
+					2,
+					3
+				].includes(recovery)) throw new Error("invalid recovery id");
+				this.recovery = recovery;
+			}
+			Object.freeze(this);
+		}
+		static fromBytes(bytes, format = defaultSigOpts.format) {
+			validateSigLength(bytes, format);
+			let recid;
+			if (format === "der") {
+				const { r, s } = DER.toSig(abytes$1(bytes));
+				return new Signature(r, s);
+			}
+			if (format === "recovered") {
+				recid = bytes[0];
+				format = "compact";
+				bytes = bytes.subarray(1);
+			}
+			const L = lengths.signature / 2;
+			const r = bytes.subarray(0, L);
+			const s = bytes.subarray(L, L * 2);
+			return new Signature(Fn.fromBytes(r), Fn.fromBytes(s), recid);
+		}
+		static fromHex(hex, format) {
+			return this.fromBytes(hexToBytes(hex), format);
+		}
+		assertRecovery() {
+			const { recovery } = this;
+			if (recovery == null) throw new Error("invalid recovery id: must be present");
+			return recovery;
+		}
+		addRecoveryBit(recovery) {
+			return new Signature(this.r, this.s, recovery);
+		}
+		recoverPublicKey(messageHash) {
+			const { r, s } = this;
+			const recovery = this.assertRecovery();
+			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((recovery & 1) === 0), x));
+			const ir = Fn.inv(radj);
+			const h = bits2int_modN(abytes$1(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));
+			if (Q.is0()) throw new Error("invalid recovery: point at infinify");
+			Q.assertValidity();
+			return Q;
+		}
+		hasHighS() {
+			return isBiggerThanHalfOrder(this.s);
+		}
+		toBytes(format = defaultSigOpts.format) {
+			validateSigFormat(format);
+			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(Uint8Array.of(this.assertRecovery()), rb, sb);
+			}
+			return concatBytes(rb, sb);
+		}
+		toHex(format) {
+			return bytesToHex(this.toBytes(format));
+		}
+	}
+	const bits2int = ecdsaOpts.bits2int || function bits2int_def(bytes) {
+		if (bytes.length > 8192) throw new Error("input is too large");
+		const num = bytesToNumberBE(bytes);
+		const delta = bytes.length * 8 - fnBits;
+		return delta > 0 ? num >> BigInt(delta) : num;
+	};
+	const bits2int_modN = ecdsaOpts.bits2int_modN || function bits2int_modN_def(bytes) {
+		return Fn.create(bits2int(bytes));
+	};
+	const ORDER_MASK = bitMask(fnBits);
+	/** Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`. */
+	function int2octets(num) {
+		aInRange("num < 2^" + fnBits, num, _0n, ORDER_MASK);
+		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;
+	}
+	/**
+	* Steps A, D of RFC6979 3.2.
+	* Creates RFC6979 seed; converts msg/privKey to numbers.
+	* Used only in sign, not in verify.
+	*
+	* Warning: we cannot assume here that message has same amount of bytes as curve order,
+	* this will be invalid at least for P521. Also it can be bigger for P224 + SHA256.
+	*/
+	function prepSig(message, secretKey, opts) {
+		const { lowS, prehash, extraEntropy } = validateSigOpts(opts, defaultSigOpts);
+		message = validateMsgAndHash(message, prehash);
+		const h1int = bits2int_modN(message);
+		const d = Fn.fromBytes(secretKey);
+		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$1(lengths.secretKey) : extraEntropy;
+			seedArgs.push(abytes$1(e, void 0, "extraEntropy"));
+		}
+		const seed = concatBytes(...seedArgs);
+		const m = h1int;
+		function k2sig(kBytes) {
+			const k = bits2int(kBytes);
+			if (!Fn.isValidNot0(k)) return;
+			const ik = Fn.inv(k);
+			const q = Point.BASE.multiply(k).toAffine();
+			const r = Fn.create(q.x);
+			if (r === _0n) return;
+			const s = Fn.create(ik * Fn.create(m + r * d));
+			if (s === _0n) return;
+			let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n);
+			let normS = s;
+			if (lowS && isBiggerThanHalfOrder(s)) {
+				normS = Fn.neg(s);
+				recovery ^= 1;
+			}
+			return new Signature(r, normS, hasLargeCofactor ? void 0 : recovery);
+		}
+		return {
+			seed,
+			k2sig
+		};
+	}
+	/**
+	* Signs message hash with a secret key.
+	*
+	* ```
+	* sign(m, d) where
+	*   k = rfc6979_hmac_drbg(m, d)
+	*   (x, y) = G × k
+	*   r = x mod n
+	*   s = (m + dr) / k mod n
+	* ```
+	*/
+	function sign(message, secretKey, opts = {}) {
+		const { seed, k2sig } = prepSig(message, secretKey, opts);
+		return createHmacDrbg(hash.outputLen, Fn.BYTES, hmac$1)(seed, k2sig).toBytes(opts.format);
+	}
+	/**
+	* Verifies a signature against message and public key.
+	* Rejects lowS signatures by default: see {@link ECDSAVerifyOpts}.
+	* Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:
+	*
+	* ```
+	* verify(r, s, h, P) where
+	*   u1 = hs^-1 mod n
+	*   u2 = rs^-1 mod n
+	*   R = u1⋅G + u2⋅P
+	*   mod(R.x, n) == r
+	* ```
+	*/
+	function verify(signature, message, publicKey, opts = {}) {
+		const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);
+		publicKey = abytes$1(publicKey, void 0, "publicKey");
+		message = validateMsgAndHash(message, prehash);
+		if (!isBytes$1(signature)) {
+			const end = signature instanceof Signature ? ", use sig.toBytes()" : "";
+			throw new Error("verify expects Uint8Array signature" + end);
+		}
+		validateSigLength(signature, format);
+		try {
+			const sig = Signature.fromBytes(signature, format);
+			const P = Point.fromBytes(publicKey);
+			if (lowS && sig.hasHighS()) return false;
+			const { r, s } = sig;
+			const h = bits2int_modN(message);
+			const is = Fn.inv(s);
+			const u1 = Fn.create(h * is);
+			const u2 = Fn.create(r * is);
+			const R = Point.BASE.multiplyUnsafe(u1).add(P.multiplyUnsafe(u2));
+			if (R.is0()) return false;
+			return Fn.create(R.x) === r;
+		} catch (e) {
+			return false;
+		}
+	}
+	function recoverPublicKey(signature, message, opts = {}) {
+		const { prehash } = validateSigOpts(opts, defaultSigOpts);
+		message = validateMsgAndHash(message, prehash);
+		return Signature.fromBytes(signature, "recovered").recoverPublicKey(message).toBytes();
+	}
+	return Object.freeze({
+		keygen,
+		getPublicKey,
+		getSharedSecret,
+		utils,
+		lengths,
+		Point,
+		sign,
+		verify,
+		recoverPublicKey,
+		Signature,
+		hash
+	});
+}
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/curves/secp256k1.js
+/**
+* SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).
+*
+* Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism ψ,
+* check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const secp256k1_CURVE = {
+	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
+	n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
+	h: BigInt(1),
+	a: BigInt(0),
+	b: BigInt(7),
+	Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
+	Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
+};
+const secp256k1_ENDO = {
+	beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
+	basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
+};
+const _2n = /* @__PURE__ */ BigInt(2);
+/**
+* √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.
+* (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]
+*/
+function sqrtMod(y) {
+	const P = secp256k1_CURVE.p;
+	const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);
+	const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);
+	const b2 = y * y * y % P;
+	const b3 = b2 * b2 * y % P;
+	const b11 = pow2(pow2(pow2(b3, _3n, P) * b3 % P, _3n, P) * b3 % P, _2n, P) * b2 % P;
+	const b22 = pow2(b11, _11n, P) * b11 % P;
+	const b44 = pow2(b22, _22n, P) * b22 % P;
+	const b88 = pow2(b44, _44n, P) * b44 % P;
+	const root = pow2(pow2(pow2(pow2(pow2(pow2(b88, _88n, P) * b88 % P, _44n, P) * b44 % P, _3n, P) * b3 % P, _23n, P) * b22 % P, _6n, P) * b2 % P, _2n, P);
+	if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error("Cannot find square root");
+	return root;
+}
+const Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });
+const Pointk1 = /* @__PURE__ */ weierstrass(secp256k1_CURVE, {
+	Fp: Fpk1,
+	endo: secp256k1_ENDO
+});
+/**
+* secp256k1 curve: ECDSA and ECDH methods.
+*
+* Uses sha256 to hash messages. To use a different hash,
+* pass `{ prehash: false }` to sign / verify.
+*
+* @example
+* ```js
+* import { secp256k1 } from '@noble/curves/secp256k1.js';
+* const { secretKey, publicKey } = secp256k1.keygen();
+* // const publicKey = secp256k1.getPublicKey(secretKey);
+* const msg = new TextEncoder().encode('hello noble');
+* const sig = secp256k1.sign(msg, secretKey);
+* const isValid = secp256k1.verify(sig, msg, publicKey);
+* // const sigKeccak = secp256k1.sign(keccak256(msg), secretKey, { prehash: false });
+* ```
+*/
+const secp256k1 = /* @__PURE__ */ ecdsa(Pointk1, sha256);
+const isoMap = isogenyMap(Fpk1, [
+	[
+		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7",
+		"0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581",
+		"0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262",
+		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"
+	],
+	[
+		"0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b",
+		"0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14",
+		"0x0000000000000000000000000000000000000000000000000000000000000001"
+	],
+	[
+		"0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c",
+		"0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3",
+		"0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931",
+		"0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"
+	],
+	[
+		"0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b",
+		"0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573",
+		"0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f",
+		"0x0000000000000000000000000000000000000000000000000000000000000001"
+	]
+].map((i) => i.map((j) => BigInt(j))));
+const mapSWU = mapToCurveSimpleSWU(Fpk1, {
+	A: BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),
+	B: BigInt("1771"),
+	Z: Fpk1.create(BigInt("-11"))
+});
+createHasher(Pointk1, (scalars) => {
+	const { x, y } = mapSWU(Fpk1.create(scalars[0]));
+	return isoMap(x, y);
+}, {
+	DST: "secp256k1_XMD:SHA-256_SSWU_RO_",
+	encodeDST: "secp256k1_XMD:SHA-256_SSWU_NU_",
+	p: Fpk1.ORDER,
+	m: 1,
+	k: 128,
+	expand: "xmd",
+	hash: sha256
+});
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@noble/hashes/legacy.js
+/**
+
+SHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.
+Don't use them in a new protocol. What "weak" means:
+
+- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.
+- No practical pre-image attacks (only theoretical, 2^123.4)
+- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151
+* @module
+*/
+const Rho160 = /* @__PURE__ */ Uint8Array.from([
+	7,
+	4,
+	13,
+	1,
+	10,
+	6,
+	15,
+	3,
+	12,
+	0,
+	9,
+	5,
+	2,
+	14,
+	11,
+	8
+]);
+const Id160 = Uint8Array.from(new Array(16).fill(0).map((_, i) => i));
+const Pi160 = Id160.map((i) => (9 * i + 5) % 16);
+const idxLR = /* @__PURE__ */ (() => {
+	const res = [[Id160], [Pi160]];
+	for (let i = 0; i < 4; i++) for (let j of res) j.push(j[i].map((k) => Rho160[k]));
+	return res;
+})();
+const idxL = idxLR[0];
+const idxR = idxLR[1];
+const shifts160 = /* @__PURE__ */ [
+	[
+		11,
+		14,
+		15,
+		12,
+		5,
+		8,
+		7,
+		9,
+		11,
+		13,
+		14,
+		15,
+		6,
+		7,
+		9,
+		8
+	],
+	[
+		12,
+		13,
+		11,
+		15,
+		6,
+		9,
+		9,
+		7,
+		12,
+		15,
+		11,
+		13,
+		7,
+		8,
+		7,
+		7
+	],
+	[
+		13,
+		15,
+		14,
+		11,
+		7,
+		7,
+		6,
+		8,
+		13,
+		14,
+		13,
+		12,
+		5,
+		5,
+		6,
+		9
+	],
+	[
+		14,
+		11,
+		12,
+		14,
+		8,
+		6,
+		5,
+		5,
+		15,
+		12,
+		15,
+		14,
+		9,
+		9,
+		8,
+		6
+	],
+	[
+		15,
+		12,
+		13,
+		13,
+		9,
+		5,
+		8,
+		6,
+		14,
+		11,
+		12,
+		11,
+		8,
+		6,
+		5,
+		5
+	]
+].map((i) => Uint8Array.from(i));
+const shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));
+const shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));
+const Kl160 = /* @__PURE__ */ Uint32Array.from([
+	0,
+	1518500249,
+	1859775393,
+	2400959708,
+	2840853838
+]);
+const Kr160 = /* @__PURE__ */ Uint32Array.from([
+	1352829926,
+	1548603684,
+	1836072691,
+	2053994217,
+	0
+]);
+function ripemd_f(group, x, y, z) {
+	if (group === 0) return x ^ y ^ z;
+	if (group === 1) return x & y | ~x & z;
+	if (group === 2) return (x | ~y) ^ z;
+	if (group === 3) return x & z | y & ~z;
+	return x ^ (y | ~z);
+}
+const BUF_160 = /* @__PURE__ */ new Uint32Array(16);
+var _RIPEMD160 = class extends HashMD {
+	h0 = 1732584193;
+	h1 = -271733879;
+	h2 = -1732584194;
+	h3 = 271733878;
+	h4 = -1009589776;
+	constructor() {
+		super(64, 20, 8, true);
+	}
+	get() {
+		const { h0, h1, h2, h3, h4 } = this;
+		return [
+			h0,
+			h1,
+			h2,
+			h3,
+			h4
+		];
+	}
+	set(h0, h1, h2, h3, h4) {
+		this.h0 = h0 | 0;
+		this.h1 = h1 | 0;
+		this.h2 = h2 | 0;
+		this.h3 = h3 | 0;
+		this.h4 = h4 | 0;
+	}
+	process(view, offset) {
+		for (let i = 0; i < 16; i++, offset += 4) BUF_160[i] = view.getUint32(offset, true);
+		let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;
+		for (let group = 0; group < 5; group++) {
+			const rGroup = 4 - group;
+			const hbl = Kl160[group], hbr = Kr160[group];
+			const rl = idxL[group], rr = idxR[group];
+			const sl = shiftsL160[group], sr = shiftsR160[group];
+			for (let i = 0; i < 16; i++) {
+				const tl = rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el | 0;
+				al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl;
+			}
+			for (let i = 0; i < 16; i++) {
+				const tr = rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er | 0;
+				ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr;
+			}
+		}
+		this.set(this.h1 + cl + dr | 0, this.h2 + dl + er | 0, this.h3 + el + ar | 0, this.h4 + al + br | 0, this.h0 + bl + cr | 0);
+	}
+	roundClean() {
+		clean(BUF_160);
+	}
+	destroy() {
+		this.destroyed = true;
+		clean(this.buffer);
+		this.set(0, 0, 0, 0, 0);
+	}
+};
+/**
+* RIPEMD-160 - a legacy hash function from 1990s.
+* * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html
+* * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf
+*/
+const ripemd160 = /* @__PURE__ */ createHasher$1(() => new _RIPEMD160());
+//#endregion
+//#region ../../node_modules/@scure/bip32/node_modules/@scure/base/index.js
+/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function isBytes(a) {
+	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
+}
+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(n) {
+	if (!Number.isSafeInteger(n)) throw new Error(`invalid integer: ${n}`);
+}
+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(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(fn) {
+	afn(fn);
+	return {
+		encode: (from) => from,
+		decode: (to) => fn(to)
+	};
+}
+/**
+* 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(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(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(num);
+	const _256 = 2 ** 8;
+	return {
+		encode: (bytes) => {
+			if (!isBytes(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(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(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(len);
+	afn(fn);
+	return {
+		encode(data) {
+			if (!isBytes(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(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;
+		}
+	};
+}
+chain(radix2(4), alphabet("0123456789ABCDEF"), join(""));
+chain(radix2(5), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), padding(5), join(""));
+chain(radix2(5), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), join(""));
+chain(radix2(5), alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"), padding(5), join(""));
+chain(radix2(5), alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"), join(""));
+chain(radix2(5), alphabet("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), join(""), normalize((s) => s.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const hasBase64Builtin = typeof Uint8Array.from([]).toBase64 === "function" && typeof Uint8Array.fromBase64 === "function";
+hasBase64Builtin || chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), padding(6), join(""));
+chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), join(""));
+hasBase64Builtin || chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), padding(6), join(""));
+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(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
+	};
+}
+genBech32("bech32");
+genBech32("bech32m");
+typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function" || chain(radix2(4), alphabet("0123456789abcdef"), join(""), normalize((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/@scure/bip32/index.js
+/**
+* BIP32 hierarchical deterministic (HD) wallets over secp256k1.
+* @module
+* @example
+* ```js
+* import { HDKey } from "@scure/bip32";
+* const hdkey1 = HDKey.fromMasterSeed(seed);
+* const hdkey2 = HDKey.fromExtendedKey(base58key);
+* const hdkey3 = HDKey.fromJSON({ xpriv: string });
+*
+* // props
+* [hdkey1.depth, hdkey1.index, hdkey1.chainCode];
+* console.log(hdkey2.privateKey, hdkey2.publicKey);
+* console.log(hdkey3.derive("m/0/2147483647'/1"));
+* const sig = hdkey3.sign(hash);
+* hdkey3.verify(hash, sig);
+* ```
+*/
+/*! scure-bip32 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */
+const Point = secp256k1.Point;
+const { Fn } = Point;
+const base58check = createBase58check(sha256);
+const MASTER_SECRET = Uint8Array.from("Bitcoin seed".split(""), (char) => char.charCodeAt(0));
+const BITCOIN_VERSIONS = {
+	private: 76066276,
+	public: 76067358
+};
+/** Hardened offset from Bitcoin, default */
+const HARDENED_OFFSET = 2147483648;
+const hash160 = (data) => ripemd160(sha256(data));
+const fromU32 = (data) => createView(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 = new Uint8Array(4);
+	createView(buf).setUint32(0, n, false);
+	return buf;
+};
+/**
+* HDKey from BIP32
+* @example
+```js
+const hdkey1 = HDKey.fromMasterSeed(seed);
+const hdkey2 = HDKey.fromExtendedKey(base58key);
+const hdkey3 = HDKey.fromJSON({ xpriv: string });
+```
+*/
+var HDKey = class HDKey {
+	get fingerprint() {
+		if (!this.pubHash) throw new Error("No publicKey set!");
+		return fromU32(this.pubHash);
+	}
+	get identifier() {
+		return this.pubHash;
+	}
+	get pubKeyHash() {
+		return this.pubHash;
+	}
+	get privateKey() {
+		return this._privateKey || null;
+	}
+	get publicKey() {
+		return this._publicKey || null;
+	}
+	get privateExtendedKey() {
+		const priv = this._privateKey;
+		if (!priv) throw new Error("No private key");
+		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$1(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);
+		return new HDKey({
+			versions,
+			chainCode: I.slice(32),
+			privateKey
+		});
+	}
+	static fromExtendedKey(base58key, versions = BITCOIN_VERSIONS) {
+		const keyBuffer = base58check.decode(base58key);
+		const keyView = createView(keyBuffer);
+		const version = keyView.getUint32(0, false);
+		const opt = {
+			versions,
+			depth: keyBuffer[4],
+			parentFingerprint: keyView.getUint32(5, false),
+			index: keyView.getUint32(9, false),
+			chainCode: keyBuffer.slice(13, 45)
+		};
+		const key = keyBuffer.slice(45);
+		const isPriv = key[0] === 0;
+		if (version !== versions[isPriv ? "private" : "public"]) throw new Error("Version mismatch");
+		if (isPriv) return new HDKey({
+			...opt,
+			privateKey: key.slice(1)
+		});
+		else return new HDKey({
+			...opt,
+			publicKey: key
+		});
+	}
+	static fromJSON(json) {
+		return HDKey.fromExtendedKey(json.xpriv);
+	}
+	versions;
+	depth = 0;
+	index = 0;
+	chainCode = null;
+	parentFingerprint = 0;
+	_privateKey;
+	_publicKey;
+	pubHash;
+	constructor(opt) {
+		if (!opt || typeof opt !== "object") throw new Error("HDKey.constructor must not be called directly");
+		this.versions = opt.versions || BITCOIN_VERSIONS;
+		this.depth = opt.depth || 0;
+		this.chainCode = opt.chainCode || null;
+		this.index = opt.index || 0;
+		this.parentFingerprint = opt.parentFingerprint || 0;
+		if (!this.depth) {
+			if (this.parentFingerprint || this.index) throw new Error("HDKey: zero depth with non-zero index/parent fingerprint");
+		}
+		if (this.depth > 255) throw new Error("HDKey: depth exceeds the serializable value 255");
+		if (opt.publicKey && opt.privateKey) throw new Error("HDKey: publicKey and privateKey at same time.");
+		if (opt.privateKey) {
+			if (!secp256k1.utils.isValidSecretKey(opt.privateKey)) throw new Error("Invalid private key");
+			this._privateKey = opt.privateKey;
+			this._publicKey = secp256k1.getPublicKey(opt.privateKey, true);
+		} else if (opt.publicKey) this._publicKey = Point.fromBytes(opt.publicKey).toBytes(true);
+		else throw new Error("HDKey: no public or private key provided");
+		this.pubHash = hash160(this._publicKey);
+	}
+	derive(path) {
+		if (!/^[mM]'?/.test(path)) throw new Error("Path must start with \"m\" or \"M\"");
+		if (/^[mM]'?$/.test(path)) return this;
+		const parts = path.replace(/^[mM]'?\//, "").split("/");
+		let child = this;
+		for (const c of parts) {
+			const m = /^(\d+)('?)$/.exec(c);
+			const m1 = m && m[1];
+			if (!m || m.length !== 3 || typeof m1 !== "string") throw new Error("invalid child index: " + c);
+			let idx = +m1;
+			if (!Number.isSafeInteger(idx) || idx >= 2147483648) throw new Error("Invalid index");
+			if (m[2] === "'") idx += HARDENED_OFFSET;
+			child = child.deriveChild(idx);
+		}
+		return child;
+	}
+	deriveChild(index) {
+		if (!this._publicKey || !this.chainCode) throw new Error("No publicKey or chainCode set");
+		let data = toU32(index);
+		if (index >= 2147483648) {
+			const priv = this._privateKey;
+			if (!priv) throw new Error("Could not derive hardened child key");
+			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);
+		if (!secp256k1.utils.isValidSecretKey(childTweak)) throw new Error("Tweak bigger than curve order");
+		const opt = {
+			versions: this.versions,
+			chainCode,
+			depth: this.depth + 1,
+			parentFingerprint: this.fingerprint,
+			index
+		};
+		const ctweak = Fn.fromBytes(childTweak);
+		try {
+			if (this._privateKey) {
+				const added = Fn.create(Fn.fromBytes(this._privateKey) + ctweak);
+				if (!Fn.isValidNot0(added)) throw new Error("The tweak was out of range or the resulted private key is invalid");
+				opt.privateKey = Fn.toBytes(added);
+			} else {
+				const added = Point.fromBytes(this._publicKey).add(Point.BASE.multiply(ctweak));
+				if (added.equals(Point.ZERO)) throw new Error("The tweak was equal to negative P, which made the result key invalid");
+				opt.publicKey = added.toBytes(true);
+			}
+			return new HDKey(opt);
+		} catch (err) {
+			return this.deriveChild(index + 1);
+		}
+	}
+	sign(hash) {
+		if (!this._privateKey) throw new Error("No privateKey set!");
+		abytes$1(hash, 32);
+		return secp256k1.sign(hash, this._privateKey, { prehash: false });
+	}
+	verify(hash, signature) {
+		abytes$1(hash, 32);
+		abytes$1(signature, 64);
+		if (!this._publicKey) throw new Error("No publicKey set!");
+		return secp256k1.verify(signature, hash, this._publicKey, { prehash: false });
+	}
+	wipePrivateData() {
+		if (this._privateKey) {
+			this._privateKey.fill(0);
+			this._privateKey = void 0;
+		}
+		return this;
+	}
+	toJSON() {
+		return {
+			xpriv: this.privateExtendedKey,
+			xpub: this.publicExtendedKey
+		};
+	}
+	serialize(version, key) {
+		if (!this.chainCode) throw new Error("No chainCode set");
+		abytes$1(key, 33);
+		return concatBytes(toU32(version), new Uint8Array([this.depth]), toU32(this.parentFingerprint), toU32(this.index), this.chainCode, key);
+	}
+};
+//#endregion
+Object.defineProperty(exports, "HARDENED_OFFSET", {
+	enumerable: true,
+	get: function() {
+		return HARDENED_OFFSET;
+	}
+});
+Object.defineProperty(exports, "HDKey", {
+	enumerable: true,
+	get: function() {
+		return HDKey;
+	}
+});