@happyvertical/smrt-profiles 0.37.2 → 0.37.3

package/dist/chunks/NostrIdentityCollection-CG6HGf6c.js

@@ -0,0 +1,3267 @@
+import { SmrtCollection, SmrtObject, foreignKey, smrt } from "@happyvertical/smrt-core";
+import { createCipheriv, createDecipheriv, createHash, hkdfSync, randomBytes } from "node:crypto";
+//#region \0rolldown/runtime.js
+var __defProp$1 = Object.defineProperty;
+var __commonJSMin = (cb, mod) => () => (mod || (cb((mod = { exports: {} }).exports, mod), cb = null), mod.exports);
+var __exportAll = (all, no_symbols) => {
+	let target = {};
+	for (var name in all) __defProp$1(target, name, {
+		get: all[name],
+		enumerable: true
+	});
+	if (!no_symbols) __defProp$1(target, Symbol.toStringTag, { value: "Module" });
+	return target;
+};
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/crypto.js
+var crypto = typeof globalThis === "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/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(a) {
+	return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array";
+}
+/** Asserts something is positive integer. */
+function anumber(n) {
+	if (!Number.isSafeInteger(n) || n < 0) throw new Error("positive integer expected, got " + n);
+}
+/** Asserts something is Uint8Array. */
+function abytes(b, ...lengths) {
+	if (!isBytes(b)) throw new Error("Uint8Array expected");
+	if (lengths.length > 0 && !lengths.includes(b.length)) throw new Error("Uint8Array expected of length " + lengths + ", got length=" + b.length);
+}
+/** Asserts something is hash */
+function ahash(h) {
+	if (typeof h !== "function" || typeof h.create !== "function") throw new Error("Hash should be wrapped by utils.createHasher");
+	anumber(h.outputLen);
+	anumber(h.blockLen);
+}
+/** Asserts a hash instance has not been destroyed / finished */
+function aexists(instance, checkFinished = true) {
+	if (instance.destroyed) throw new Error("Hash instance has been destroyed");
+	if (checkFinished && instance.finished) throw new Error("Hash#digest() has already been called");
+}
+/** Asserts output is properly-sized byte array */
+function aoutput(out, instance) {
+	abytes(out);
+	const min = instance.outputLen;
+	if (out.length < min) throw new Error("digestInto() expects output buffer of length at least " + min);
+}
+/** 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;
+}
+var hasHexBuiltin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function")();
+var hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
+/**
+* Convert byte array to hex string. Uses built-in function, when available.
+* @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'
+*/
+function bytesToHex(bytes) {
+	abytes(bytes);
+	if (hasHexBuiltin) return bytes.toHex();
+	let hex = "";
+	for (let i = 0; i < bytes.length; i++) hex += hexes[bytes[i]];
+	return hex;
+}
+var asciis = {
+	_0: 48,
+	_9: 57,
+	A: 65,
+	F: 70,
+	a: 97,
+	f: 102
+};
+function asciiToBase16(ch) {
+	if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0;
+	if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10);
+	if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10);
+}
+/**
+* Convert hex string to byte array. Uses built-in function, when available.
+* @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])
+*/
+function hexToBytes(hex) {
+	if (typeof hex !== "string") throw new Error("hex string expected, got " + typeof hex);
+	if (hasHexBuiltin) return Uint8Array.fromHex(hex);
+	const hl = hex.length;
+	const al = hl / 2;
+	if (hl % 2) throw new Error("hex string expected, got unpadded hex of length " + hl);
+	const array = new Uint8Array(al);
+	for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
+		const n1 = asciiToBase16(hex.charCodeAt(hi));
+		const n2 = asciiToBase16(hex.charCodeAt(hi + 1));
+		if (n1 === void 0 || n2 === void 0) {
+			const char = hex[hi] + hex[hi + 1];
+			throw new Error("hex string expected, got non-hex character \"" + char + "\" at index " + hi);
+		}
+		array[ai] = n1 * 16 + n2;
+	}
+	return array;
+}
+/**
+* Converts string to bytes using UTF8 encoding.
+* @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])
+*/
+function utf8ToBytes(str) {
+	if (typeof str !== "string") throw new Error("string expected");
+	return new Uint8Array(new TextEncoder().encode(str));
+}
+/**
+* Normalizes (non-hex) string or Uint8Array to Uint8Array.
+* Warning: when Uint8Array is passed, it would NOT get copied.
+* Keep in mind for future mutable operations.
+*/
+function toBytes(data) {
+	if (typeof data === "string") data = utf8ToBytes(data);
+	abytes(data);
+	return data;
+}
+/** Copies several Uint8Arrays into one. */
+function concatBytes(...arrays) {
+	let sum = 0;
+	for (let i = 0; i < arrays.length; i++) {
+		const a = arrays[i];
+		abytes(a);
+		sum += a.length;
+	}
+	const res = new Uint8Array(sum);
+	for (let i = 0, pad = 0; i < arrays.length; i++) {
+		const a = arrays[i];
+		res.set(a, pad);
+		pad += a.length;
+	}
+	return res;
+}
+/** For runtime check if class implements interface */
+var Hash = class {};
+/** Wraps hash function, creating an interface on top of it */
+function createHasher(hashCons) {
+	const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
+	const tmp = hashCons();
+	hashC.outputLen = tmp.outputLen;
+	hashC.blockLen = tmp.blockLen;
+	hashC.create = () => hashCons();
+	return hashC;
+}
+/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */
+function randomBytes$1(bytesLength = 32) {
+	if (crypto && typeof crypto.getRandomValues === "function") return crypto.getRandomValues(new Uint8Array(bytesLength));
+	if (crypto && typeof crypto.randomBytes === "function") return Uint8Array.from(crypto.randomBytes(bytesLength));
+	throw new Error("crypto.getRandomValues must be defined");
+}
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/_md.js
+/**
+* Internal Merkle-Damgard hash utils.
+* @module
+*/
+/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */
+function setBigUint64(view, byteOffset, value, isLE) {
+	if (typeof view.setBigUint64 === "function") return view.setBigUint64(byteOffset, value, isLE);
+	const _32n = BigInt(32);
+	const _u32_max = BigInt(4294967295);
+	const wh = Number(value >> _32n & _u32_max);
+	const wl = Number(value & _u32_max);
+	const h = isLE ? 4 : 0;
+	const l = isLE ? 0 : 4;
+	view.setUint32(byteOffset + h, wh, isLE);
+	view.setUint32(byteOffset + l, wl, isLE);
+}
+/** Choice: a ? b : c */
+function Chi(a, b, c) {
+	return a & b ^ ~a & c;
+}
+/** 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 extends Hash {
+	constructor(blockLen, outputLen, padOffset, isLE) {
+		super();
+		this.finished = false;
+		this.length = 0;
+		this.pos = 0;
+		this.destroyed = false;
+		this.blockLen = blockLen;
+		this.outputLen = outputLen;
+		this.padOffset = padOffset;
+		this.isLE = isLE;
+		this.buffer = new Uint8Array(blockLen);
+		this.view = createView(this.buffer);
+	}
+	update(data) {
+		aexists(this);
+		data = toBytes(data);
+		abytes(data);
+		const { view, buffer, blockLen } = this;
+		const len = data.length;
+		for (let pos = 0; pos < len;) {
+			const take = Math.min(blockLen - this.pos, len - pos);
+			if (take === blockLen) {
+				const dataView = 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;
+		setBigUint64(view, 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 should be aligned to 32bit");
+		const outLen = len / 4;
+		const state = this.get();
+		if (outLen > state.length) throw new Error("_sha2: outputLen bigger than state");
+		for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);
+	}
+	digest() {
+		const { buffer, outputLen } = this;
+		this.digestInto(buffer);
+		const res = buffer.slice(0, outputLen);
+		this.destroy();
+		return res;
+	}
+	_cloneInto(to) {
+		to || (to = new this.constructor());
+		to.set(...this.get());
+		const { blockLen, buffer, length, finished, destroyed, pos } = this;
+		to.destroyed = destroyed;
+		to.finished = finished;
+		to.length = length;
+		to.pos = pos;
+		if (length % blockLen) to.buffer.set(buffer);
+		return to;
+	}
+	clone() {
+		return this._cloneInto();
+	}
+};
+/**
+* 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 */
+var SHA256_IV = /* @__PURE__ */ Uint32Array.from([
+	1779033703,
+	3144134277,
+	1013904242,
+	2773480762,
+	1359893119,
+	2600822924,
+	528734635,
+	1541459225
+]);
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/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://datatracker.ietf.org/doc/html/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)
+*/
+var SHA256_K = /* @__PURE__ */ Uint32Array.from([
+	1116352408,
+	1899447441,
+	3049323471,
+	3921009573,
+	961987163,
+	1508970993,
+	2453635748,
+	2870763221,
+	3624381080,
+	310598401,
+	607225278,
+	1426881987,
+	1925078388,
+	2162078206,
+	2614888103,
+	3248222580,
+	3835390401,
+	4022224774,
+	264347078,
+	604807628,
+	770255983,
+	1249150122,
+	1555081692,
+	1996064986,
+	2554220882,
+	2821834349,
+	2952996808,
+	3210313671,
+	3336571891,
+	3584528711,
+	113926993,
+	338241895,
+	666307205,
+	773529912,
+	1294757372,
+	1396182291,
+	1695183700,
+	1986661051,
+	2177026350,
+	2456956037,
+	2730485921,
+	2820302411,
+	3259730800,
+	3345764771,
+	3516065817,
+	3600352804,
+	4094571909,
+	275423344,
+	430227734,
+	506948616,
+	659060556,
+	883997877,
+	958139571,
+	1322822218,
+	1537002063,
+	1747873779,
+	1955562222,
+	2024104815,
+	2227730452,
+	2361852424,
+	2428436474,
+	2756734187,
+	3204031479,
+	3329325298
+]);
+/** Reusable temporary buffer. "W" comes straight from spec. */
+var SHA256_W = /* @__PURE__ */ new Uint32Array(64);
+var SHA256 = class extends HashMD {
+	constructor(outputLen = 32) {
+		super(64, outputLen, 8, false);
+		this.A = SHA256_IV[0] | 0;
+		this.B = SHA256_IV[1] | 0;
+		this.C = SHA256_IV[2] | 0;
+		this.D = SHA256_IV[3] | 0;
+		this.E = SHA256_IV[4] | 0;
+		this.F = SHA256_IV[5] | 0;
+		this.G = SHA256_IV[6] | 0;
+		this.H = SHA256_IV[7] | 0;
+	}
+	get() {
+		const { A, B, C, D, E, F, G, H } = this;
+		return [
+			A,
+			B,
+			C,
+			D,
+			E,
+			F,
+			G,
+			H
+		];
+	}
+	set(A, B, C, D, E, F, G, H) {
+		this.A = A | 0;
+		this.B = B | 0;
+		this.C = C | 0;
+		this.D = D | 0;
+		this.E = E | 0;
+		this.F = F | 0;
+		this.G = G | 0;
+		this.H = H | 0;
+	}
+	process(view, offset) {
+		for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);
+		for (let i = 16; i < 64; i++) {
+			const W15 = SHA256_W[i - 15];
+			const W2 = SHA256_W[i - 2];
+			const s0 = 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);
+	}
+};
+/**
+* SHA2-256 hash function from RFC 4634.
+*
+* It is the fastest JS hash, even faster than Blake3.
+* To break sha256 using birthday attack, attackers need to try 2^128 hashes.
+* BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
+*/
+var sha256 = /* @__PURE__ */ createHasher(() => new SHA256());
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/hmac.js
+/**
+* HMAC: RFC2104 message authentication code.
+* @module
+*/
+var HMAC = class extends Hash {
+	constructor(hash, _key) {
+		super();
+		this.finished = false;
+		this.destroyed = false;
+		ahash(hash);
+		const key = toBytes(_key);
+		this.iHash = hash.create();
+		if (typeof this.iHash.update !== "function") throw new Error("Expected instance of class which extends utils.Hash");
+		this.blockLen = this.iHash.blockLen;
+		this.outputLen = this.iHash.outputLen;
+		const blockLen = this.blockLen;
+		const pad = new Uint8Array(blockLen);
+		pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);
+		for (let i = 0; i < pad.length; i++) pad[i] ^= 54;
+		this.iHash.update(pad);
+		this.oHash = hash.create();
+		for (let i = 0; i < pad.length; i++) pad[i] ^= 106;
+		this.oHash.update(pad);
+		clean(pad);
+	}
+	update(buf) {
+		aexists(this);
+		this.iHash.update(buf);
+		return this;
+	}
+	digestInto(out) {
+		aexists(this);
+		abytes(out, this.outputLen);
+		this.finished = true;
+		this.iHash.digestInto(out);
+		this.oHash.update(out);
+		this.oHash.digestInto(out);
+		this.destroy();
+	}
+	digest() {
+		const out = new Uint8Array(this.oHash.outputLen);
+		this.digestInto(out);
+		return out;
+	}
+	_cloneInto(to) {
+		to || (to = Object.create(Object.getPrototypeOf(this), {}));
+		const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
+		to = to;
+		to.finished = finished;
+		to.destroyed = destroyed;
+		to.blockLen = blockLen;
+		to.outputLen = outputLen;
+		to.oHash = oHash._cloneInto(to.oHash);
+		to.iHash = iHash._cloneInto(to.iHash);
+		return to;
+	}
+	clone() {
+		return this._cloneInto();
+	}
+	destroy() {
+		this.destroyed = true;
+		this.oHash.destroy();
+		this.iHash.destroy();
+	}
+};
+/**
+* HMAC: RFC2104 message authentication code.
+* @param hash - function that would be used e.g. sha256
+* @param key - message key
+* @param message - message data
+* @example
+* import { hmac } from '@noble/hashes/hmac';
+* import { sha256 } from '@noble/hashes/sha2';
+* const mac1 = hmac(sha256, 'key', 'message');
+*/
+var hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();
+hmac.create = (hash, key) => new HMAC(hash, key);
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/utils.js
+/**
+* Hex, bytes and number utilities.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n$4 = /* @__PURE__ */ BigInt(0);
+var _1n$4 = /* @__PURE__ */ BigInt(1);
+function _abool2(value, title = "") {
+	if (typeof value !== "boolean") {
+		const prefix = title && `"${title}"`;
+		throw new Error(prefix + "expected boolean, got type=" + typeof value);
+	}
+	return value;
+}
+/** Asserts something is Uint8Array. */
+function _abytes2(value, length, title = "") {
+	const bytes = isBytes(value);
+	const len = value?.length;
+	const needsLen = length !== void 0;
+	if (!bytes || needsLen && len !== length) {
+		const prefix = title && `"${title}" `;
+		const ofLen = needsLen ? ` of length ${length}` : "";
+		const got = bytes ? `length=${len}` : `type=${typeof value}`;
+		throw new Error(prefix + "expected Uint8Array" + ofLen + ", got " + got);
+	}
+	return value;
+}
+function numberToHexUnpadded(num) {
+	const hex = 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$4 : BigInt("0x" + hex);
+}
+function bytesToNumberBE(bytes) {
+	return hexToNumber(bytesToHex(bytes));
+}
+function bytesToNumberLE(bytes) {
+	abytes(bytes);
+	return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));
+}
+function numberToBytesBE(n, len) {
+	return hexToBytes(n.toString(16).padStart(len * 2, "0"));
+}
+function numberToBytesLE(n, len) {
+	return numberToBytesBE(n, len).reverse();
+}
+/**
+* Takes hex string or Uint8Array, converts to Uint8Array.
+* Validates output length.
+* Will throw error for other types.
+* @param title descriptive title for an error e.g. 'secret key'
+* @param hex hex string or Uint8Array
+* @param expectedLength optional, will compare to result array's length
+* @returns
+*/
+function ensureBytes(title, hex, expectedLength) {
+	let res;
+	if (typeof hex === "string") try {
+		res = hexToBytes(hex);
+	} catch (e) {
+		throw new Error(title + " must be hex string or Uint8Array, cause: " + e);
+	}
+	else if (isBytes(hex)) res = Uint8Array.from(hex);
+	else throw new Error(title + " must be hex string or Uint8Array");
+	const len = res.length;
+	if (typeof expectedLength === "number" && len !== expectedLength) throw new Error(title + " of length " + expectedLength + " expected, got " + len);
+	return res;
+}
+/**
+* @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
+*/
+/**
+* Converts bytes to string using UTF8 encoding.
+* @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'
+*/
+var isPosBig = (n) => typeof n === "bigint" && _0n$4 <= 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$4; n >>= _1n$4, 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('')}`)
+*/
+var bitMask = (n) => (_1n$4 << BigInt(n)) - _1n$4;
+/**
+* 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) {
+	if (typeof hashLen !== "number" || hashLen < 2) throw new Error("hashLen must be a number");
+	if (typeof qByteLen !== "number" || qByteLen < 2) throw new Error("qByteLen must be a number");
+	if (typeof hmacFn !== "function") throw new Error("hmacFn must be a function");
+	const u8n = (len) => new Uint8Array(len);
+	const u8of = (byte) => Uint8Array.of(byte);
+	let v = u8n(hashLen);
+	let k = u8n(hashLen);
+	let i = 0;
+	const reset = () => {
+		v.fill(1);
+		k.fill(0);
+		i = 0;
+	};
+	const h = (...b) => hmacFn(k, v, ...b);
+	const reseed = (seed = u8n(0)) => {
+		k = h(u8of(0), seed);
+		v = h();
+		if (seed.length === 0) return;
+		k = h(u8of(1), seed);
+		v = h();
+	};
+	const gen = () => {
+		if (i++ >= 1e3) throw new Error("drbg: tried 1000 values");
+		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}`);
+	}
+	Object.entries(fields).forEach(([k, v]) => checkField(k, v, false));
+	Object.entries(optFields).forEach(([k, v]) => checkField(k, v, 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/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/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) */
+var _0n$3 = BigInt(0), _1n$3 = BigInt(1), _2n$2 = /* @__PURE__ */ BigInt(2), _3n$1 = /* @__PURE__ */ BigInt(3);
+var _4n$1 = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _7n = /* @__PURE__ */ BigInt(7);
+var _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ BigInt(16);
+function mod(a, b) {
+	const result = a % b;
+	return result >= _0n$3 ? 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$3) {
+		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$3) throw new Error("invert: expected non-zero number");
+	if (modulo <= _0n$3) throw new Error("invert: expected positive modulus, got " + modulo);
+	let a = mod(number, modulo);
+	let b = modulo;
+	let x = _0n$3, y = _1n$3, u = _1n$3, v = _0n$3;
+	while (a !== _0n$3) {
+		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$3) 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$3) / _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$3;
+	let S = 0;
+	while (Q % _2n$2 === _0n$3) {
+		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$3) / _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$3 << 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);
+}
+var 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",
+		MASK: "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$3) throw new Error("invalid exponent, negatives unsupported");
+	if (power === _0n$3) return Fp.ONE;
+	if (power === _1n$3) return num;
+	let p = Fp.ONE;
+	let d = num;
+	while (power > _0n$3) {
+		if (power & _1n$3) p = Fp.mul(p, d);
+		d = Fp.sqr(d);
+		power >>= _1n$3;
+	}
+	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$3) / _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(nBitLength);
+	const _nBitLength = nBitLength !== void 0 ? nBitLength : n.toString(2).length;
+	return {
+		nBitLength: _nBitLength,
+		nByteLength: Math.ceil(_nBitLength / 8)
+	};
+}
+/**
+* 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, bitLenOrOpts, isLE = false, opts = {}) {
+	if (ORDER <= _0n$3) throw new Error("invalid field: expected ORDER > 0, got " + ORDER);
+	let _nbitLength = void 0;
+	let _sqrt = void 0;
+	let modFromBytes = false;
+	let allowedLengths = void 0;
+	if (typeof bitLenOrOpts === "object" && bitLenOrOpts != null) {
+		if (opts.sqrt || isLE) throw new Error("cannot specify opts in two arguments");
+		const _opts = bitLenOrOpts;
+		if (_opts.BITS) _nbitLength = _opts.BITS;
+		if (_opts.sqrt) _sqrt = _opts.sqrt;
+		if (typeof _opts.isLE === "boolean") isLE = _opts.isLE;
+		if (typeof _opts.modFromBytes === "boolean") modFromBytes = _opts.modFromBytes;
+		allowedLengths = _opts.allowedLengths;
+	} else {
+		if (typeof bitLenOrOpts === "number") _nbitLength = bitLenOrOpts;
+		if (opts.sqrt) _sqrt = opts.sqrt;
+	}
+	const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, _nbitLength);
+	if (BYTES > 2048) throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+	let sqrtP;
+	const f = Object.freeze({
+		ORDER,
+		isLE,
+		BITS,
+		BYTES,
+		MASK: bitMask(BITS),
+		ZERO: _0n$3,
+		ONE: _1n$3,
+		allowedLengths,
+		create: (num) => mod(num, ORDER),
+		isValid: (num) => {
+			if (typeof num !== "bigint") throw new Error("invalid field element: expected bigint, got " + typeof num);
+			return _0n$3 <= num && num < ORDER;
+		},
+		is0: (num) => num === _0n$3,
+		isValidNot0: (num) => !f.is0(num) && f.isValid(num),
+		isOdd: (num) => (num & _1n$3) === _1n$3,
+		neg: (num) => mod(-num, ORDER),
+		eql: (lhs, rhs) => lhs === rhs,
+		sqr: (num) => mod(num * num, ORDER),
+		add: (lhs, rhs) => mod(lhs + rhs, ORDER),
+		sub: (lhs, rhs) => mod(lhs - rhs, ORDER),
+		mul: (lhs, rhs) => mod(lhs * rhs, ORDER),
+		pow: (num, power) => FpPow(f, num, power),
+		div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),
+		sqrN: (num) => num * num,
+		addN: (lhs, rhs) => lhs + rhs,
+		subN: (lhs, rhs) => lhs - rhs,
+		mulN: (lhs, rhs) => lhs * rhs,
+		inv: (num) => invert(num, ORDER),
+		sqrt: _sqrt || ((n) => {
+			if (!sqrtP) sqrtP = FpSqrt(ORDER);
+			return sqrtP(f, n);
+		}),
+		toBytes: (num) => isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES),
+		fromBytes: (bytes, skipValidation = true) => {
+			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 (!f.isValid(scalar)) throw new Error("invalid field element: outside of range 0..ORDER");
+			}
+			return scalar;
+		},
+		invertBatch: (lst) => FpInvertBatch(f, lst),
+		cmov: (a, b, c) => c ? b : a
+	});
+	return Object.freeze(f);
+}
+/**
+* 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.CURVE.n)
+* @param isLE interpret hash bytes as LE num
+* @returns valid private scalar
+*/
+function mapHashToField(key, fieldOrder, isLE = false) {
+	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$3) + _1n$3;
+	return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
+}
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/abstract/curve.js
+/**
+* Methods for elliptic curve multiplication by scalars.
+* Contains wNAF, pippenger.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n$2 = BigInt(0);
+var _1n$2 = 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$2;
+	}
+	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
+	};
+}
+function validateMSMPoints(points, c) {
+	if (!Array.isArray(points)) throw new Error("array expected");
+	points.forEach((p, i) => {
+		if (!(p instanceof c)) throw new Error("invalid point at index " + i);
+	});
+}
+function validateMSMScalars(scalars, field) {
+	if (!Array.isArray(scalars)) throw new Error("array of scalars expected");
+	scalars.forEach((s, i) => {
+		if (!field.isValid(s)) throw new Error("invalid scalar at index " + i);
+	});
+}
+var pointPrecomputes = /* @__PURE__ */ new WeakMap();
+var pointWindowSizes = /* @__PURE__ */ new WeakMap();
+function getW(P) {
+	return pointWindowSizes.get(P) || 1;
+}
+function assert0(n) {
+	if (n !== _0n$2) 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 {
+	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$2) {
+			if (n & _1n$2) p = p.add(d);
+			d = d.double();
+			n >>= _1n$2;
+		}
+		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$2) 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$2 || k2 > _0n$2) {
+		if (k1 & _1n$2) p1 = p1.add(acc);
+		if (k2 & _1n$2) p2 = p2.add(acc);
+		acc = acc.double();
+		k1 >>= _1n$2;
+		k2 >>= _1n$2;
+	}
+	return {
+		p1,
+		p2
+	};
+}
+/**
+* Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).
+* 30x faster vs naive addition on L=4096, 10x faster than precomputes.
+* For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.
+* Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.
+* @param c Curve Point constructor
+* @param fieldN field over CURVE.N - important that it's not over CURVE.P
+* @param points array of L curve points
+* @param scalars array of L scalars (aka secret keys / bigints)
+*/
+function pippenger(c, fieldN, points, scalars) {
+	validateMSMPoints(points, c);
+	validateMSMScalars(scalars, fieldN);
+	const plength = points.length;
+	const slength = scalars.length;
+	if (plength !== slength) throw new Error("arrays of points and scalars must have equal length");
+	const zero = c.ZERO;
+	const wbits = bitLen(BigInt(plength));
+	let windowSize = 1;
+	if (wbits > 12) windowSize = wbits - 3;
+	else if (wbits > 4) windowSize = wbits - 2;
+	else if (wbits > 0) windowSize = 2;
+	const MASK = bitMask(windowSize);
+	const buckets = new Array(Number(MASK) + 1).fill(zero);
+	const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;
+	let sum = zero;
+	for (let i = lastBits; i >= 0; i -= windowSize) {
+		buckets.fill(zero);
+		for (let j = 0; j < slength; j++) {
+			const scalar = scalars[j];
+			const wbits = Number(scalar >> BigInt(i) & MASK);
+			buckets[wbits] = buckets[wbits].add(points[j]);
+		}
+		let resI = zero;
+		for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {
+			sumI = sumI.add(buckets[j]);
+			resI = resI.add(sumI);
+		}
+		sum = sum.add(resI);
+		if (i !== 0) for (let j = 0; j < windowSize; j++) sum = sum.double();
+	}
+	return sum;
+}
+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$2)) 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
+	};
+}
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/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) */
+var 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$1;
+	const k2neg = k2 < _0n$1;
+	if (k1neg) k1 = -k1;
+	if (k2neg) k2 = -k2;
+	const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n$1;
+	if (k1 < _0n$1 || k1 >= MAX_NUM || k2 < _0n$1 || 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];
+	_abool2(optsn.lowS, "lowS");
+	_abool2(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
+*/
+var 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$1) 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(hex) {
+		const { Err: E, _int: int, _tlv: tlv } = DER;
+		const data = ensureBytes("signature", hex);
+		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);
+	}
+};
+var _0n$1 = BigInt(0), _1n$1 = BigInt(1), _2n$1 = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);
+function _normFnElement(Fn, key) {
+	const { BYTES: expected } = Fn;
+	let num;
+	if (typeof key === "bigint") num = key;
+	else {
+		let bytes = ensureBytes("private key", key);
+		try {
+			num = Fn.fromBytes(bytes);
+		} catch (error) {
+			throw new Error(`invalid private key: expected ui8a of size ${expected}, got ${typeof key}`);
+		}
+	}
+	if (!Fn.isValidNot0(num)) throw new Error("invalid private key: out of range [1..N-1]");
+	return num;
+}
+/**
+* Creates weierstrass Point constructor, based on specified curve options.
+*
+* @example
+```js
+const opts = {
+p: BigInt('0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff'),
+n: BigInt('0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551'),
+h: BigInt(1),
+a: BigInt('0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc'),
+b: BigInt('0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b'),
+Gx: BigInt('0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296'),
+Gy: BigInt('0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5'),
+};
+const p256_Point = weierstrass(opts);
+```
+*/
+function weierstrassN(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",
+		wrapPrivateKey: "boolean"
+	});
+	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);
+		_abool2(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) {
+		_abytes2(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 isYOdd = Fp.isOdd(y);
+			if ((head & 1) === 1 !== isYOdd) 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("ProjectivePoint 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 {
+		/** 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(_abytes2(bytes, void 0, "point")));
+			P.assertValidity();
+			return P;
+		}
+		static fromHex(hex) {
+			return Point.fromBytes(ensureBytes("pointHex", 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$1 || p.is0()) return Point.ZERO;
+			if (sc === _1n$1) 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);
+		}
+		multiplyAndAddUnsafe(Q, a, b) {
+			const sum = this.multiplyUnsafe(a).add(Q.multiplyUnsafe(b));
+			return sum.is0() ? void 0 : sum;
+		}
+		/**
+		* 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$1) return true;
+			if (isTorsionFree) return isTorsionFree(Point, this);
+			return wnaf.unsafe(this, CURVE_ORDER).is0();
+		}
+		clearCofactor() {
+			const { clearCofactor } = extraOpts;
+			if (cofactor === _1n$1) return this;
+			if (clearCofactor) return clearCofactor(Point, this);
+			return this.multiplyUnsafe(cofactor);
+		}
+		isSmallOrder() {
+			return this.multiplyUnsafe(cofactor).is0();
+		}
+		toBytes(isCompressed = true) {
+			_abool2(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()}>`;
+		}
+		get px() {
+			return this.X;
+		}
+		get py() {
+			return this.X;
+		}
+		get pz() {
+			return this.Z;
+		}
+		toRawBytes(isCompressed = true) {
+			return this.toBytes(isCompressed);
+		}
+		_setWindowSize(windowSize) {
+			this.precompute(windowSize);
+		}
+		static normalizeZ(points) {
+			return normalizeZ(Point, points);
+		}
+		static msm(points, scalars) {
+			return pippenger(Point, Fn, points, scalars);
+		}
+		static fromPrivateKey(privateKey) {
+			return Point.BASE.multiply(_normFnElement(Fn, privateKey));
+		}
+	}
+	Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);
+	Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);
+	Point.Fp = Fp;
+	Point.Fn = Fn;
+	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);
+}
+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$1;
+	const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });
+	function isValidSecretKey(secretKey) {
+		try {
+			return !!_normFnElement(Fn, secretKey);
+		} 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(_abytes2(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(_normFnElement(Fn, secretKey)).toBytes(isCompressed);
+	}
+	function keygen(seed) {
+		const secretKey = randomSecretKey(seed);
+		return {
+			secretKey,
+			publicKey: getPublicKey(secretKey)
+		};
+	}
+	/**
+	* Quick and dirty check for item being public key. Does not validate hex, or being on-curve.
+	*/
+	function isProbPub(item) {
+		if (typeof item === "bigint") return false;
+		if (item instanceof Point) return true;
+		const { secretKey, publicKey, publicKeyUncompressed } = lengths;
+		if (Fn.allowedLengths || secretKey === publicKey) return void 0;
+		const l = ensureBytes("key", item).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 = _normFnElement(Fn, secretKeyA);
+		return Point.fromHex(publicKeyB).multiply(s).toBytes(isCompressed);
+	}
+	return Object.freeze({
+		getPublicKey,
+		getSharedSecret,
+		keygen,
+		Point,
+		utils: {
+			isValidSecretKey,
+			isValidPublicKey,
+			randomSecretKey,
+			isValidPrivateKey: isValidSecretKey,
+			randomPrivateKey: randomSecretKey,
+			normPrivateKeyToScalar: (key) => _normFnElement(Fn, key),
+			precompute(windowSize = 8, point = Point.BASE) {
+				return point.precompute(windowSize, false);
+			}
+		},
+		lengths
+	});
+}
+/**
+* Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.
+* We need `hash` for 2 features:
+* 1. Message prehash-ing. NOT used if `sign` / `verify` are called with `prehash: false`
+* 2. k generation in `sign`, using HMAC-drbg(hash)
+*
+* ECDSAOpts are only rarely needed.
+*
+* @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"
+	});
+	const randomBytes = ecdsaOpts.randomBytes || randomBytes$1;
+	const hmac$1 = ecdsaOpts.hmac || ((key, ...msgs) => hmac(hash, key, concatBytes(...msgs)));
+	const { Fp, Fn } = Point;
+	const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;
+	const { keygen, getPublicKey, getSharedSecret, utils, lengths } = ecdh(Point, ecdsaOpts);
+	const defaultSigOpts = {
+		prehash: false,
+		lowS: typeof ecdsaOpts.lowS === "boolean" ? ecdsaOpts.lowS : false,
+		format: void 0,
+		extraEntropy: false
+	};
+	const defaultSigOpts_format = "compact";
+	function isBiggerThanHalfOrder(number) {
+		return number > CURVE_ORDER >> _1n$1;
+	}
+	function validateRS(title, num) {
+		if (!Fn.isValidNot0(num)) throw new Error(`invalid signature ${title}: out of range 1..Point.Fn.ORDER`);
+		return num;
+	}
+	function validateSigLength(bytes, format) {
+		validateSigFormat(format);
+		const size = lengths.signature;
+		return _abytes2(bytes, format === "compact" ? size : format === "recovered" ? size + 1 : void 0, `${format} signature`);
+	}
+	/**
+	* ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.
+	*/
+	class Signature {
+		constructor(r, s, recovery) {
+			this.r = validateRS("r", r);
+			this.s = validateRS("s", s);
+			if (recovery != null) 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(_abytes2(bytes));
+				return new Signature(r, s);
+			}
+			if (format === "recovered") {
+				recid = bytes[0];
+				format = "compact";
+				bytes = bytes.subarray(1);
+			}
+			const L = Fn.BYTES;
+			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);
+		}
+		addRecoveryBit(recovery) {
+			return new Signature(this.r, this.s, recovery);
+		}
+		recoverPublicKey(messageHash) {
+			const FIELD_ORDER = Fp.ORDER;
+			const { r, s, recovery: rec } = this;
+			if (rec == null || ![
+				0,
+				1,
+				2,
+				3
+			].includes(rec)) throw new Error("recovery id invalid");
+			if (CURVE_ORDER * _2n$1 < FIELD_ORDER && rec > 1) throw new Error("recovery id is ambiguous for h>1 curve");
+			const radj = rec === 2 || rec === 3 ? r + CURVE_ORDER : r;
+			if (!Fp.isValid(radj)) throw new Error("recovery id 2 or 3 invalid");
+			const x = Fp.toBytes(radj);
+			const R = Point.fromBytes(concatBytes(pprefix((rec & 1) === 0), x));
+			const ir = Fn.inv(radj);
+			const h = bits2int_modN(ensureBytes("msgHash", messageHash));
+			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("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 = Fn.toBytes(this.r);
+			const s = Fn.toBytes(this.s);
+			if (format === "recovered") {
+				if (this.recovery == null) throw new Error("recovery bit must be present");
+				return concatBytes(Uint8Array.of(this.recovery), r, s);
+			}
+			return concatBytes(r, s);
+		}
+		toHex(format) {
+			return bytesToHex(this.toBytes(format));
+		}
+		assertValidity() {}
+		static fromCompact(hex) {
+			return Signature.fromBytes(ensureBytes("sig", hex), "compact");
+		}
+		static fromDER(hex) {
+			return Signature.fromBytes(ensureBytes("sig", hex), "der");
+		}
+		normalizeS() {
+			return this.hasHighS() ? new Signature(this.r, Fn.neg(this.s), this.recovery) : this;
+		}
+		toDERRawBytes() {
+			return this.toBytes("der");
+		}
+		toDERHex() {
+			return bytesToHex(this.toBytes("der"));
+		}
+		toCompactRawBytes() {
+			return this.toBytes("compact");
+		}
+		toCompactHex() {
+			return bytesToHex(this.toBytes("compact"));
+		}
+	}
+	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$1, ORDER_MASK);
+		return Fn.toBytes(num);
+	}
+	function validateMsgAndHash(message, prehash) {
+		_abytes2(message, void 0, "message");
+		return prehash ? _abytes2(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, privateKey, opts) {
+		if (["recovered", "canonical"].some((k) => k in opts)) throw new Error("sign() legacy options not supported");
+		const { lowS, prehash, extraEntropy } = validateSigOpts(opts, defaultSigOpts);
+		message = validateMsgAndHash(message, prehash);
+		const h1int = bits2int_modN(message);
+		const d = _normFnElement(Fn, privateKey);
+		const seedArgs = [int2octets(d), int2octets(h1int)];
+		if (extraEntropy != null && extraEntropy !== false) {
+			const e = extraEntropy === true ? randomBytes(lengths.secretKey) : extraEntropy;
+			seedArgs.push(ensureBytes("extraEntropy", e));
+		}
+		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$1) return;
+			const s = Fn.create(ik * Fn.create(m + r * d));
+			if (s === _0n$1) return;
+			let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n$1);
+			let normS = s;
+			if (lowS && isBiggerThanHalfOrder(s)) {
+				normS = Fn.neg(s);
+				recovery ^= 1;
+			}
+			return new Signature(r, normS, 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 = {}) {
+		message = ensureBytes("message", message);
+		const { seed, k2sig } = prepSig(message, secretKey, opts);
+		return createHmacDrbg(hash.outputLen, Fn.BYTES, hmac$1)(seed, k2sig);
+	}
+	function tryParsingSig(sg) {
+		let sig = void 0;
+		const isHex = typeof sg === "string" || isBytes(sg);
+		const isObj = !isHex && sg !== null && typeof sg === "object" && typeof sg.r === "bigint" && typeof sg.s === "bigint";
+		if (!isHex && !isObj) throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
+		if (isObj) sig = new Signature(sg.r, sg.s);
+		else if (isHex) {
+			try {
+				sig = Signature.fromBytes(ensureBytes("sig", sg), "der");
+			} catch (derError) {
+				if (!(derError instanceof DER.Err)) throw derError;
+			}
+			if (!sig) try {
+				sig = Signature.fromBytes(ensureBytes("sig", sg), "compact");
+			} catch (error) {
+				return false;
+			}
+		}
+		if (!sig) return false;
+		return sig;
+	}
+	/**
+	* 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 = ensureBytes("publicKey", publicKey);
+		message = validateMsgAndHash(ensureBytes("message", message), prehash);
+		if ("strict" in opts) throw new Error("options.strict was renamed to lowS");
+		const sig = format === void 0 ? tryParsingSig(signature) : Signature.fromBytes(ensureBytes("sig", signature), format);
+		if (sig === false) return false;
+		try {
+			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
+	});
+}
+function _weierstrass_legacy_opts_to_new(c) {
+	const CURVE = {
+		a: c.a,
+		b: c.b,
+		p: c.Fp.ORDER,
+		n: c.n,
+		h: c.h,
+		Gx: c.Gx,
+		Gy: c.Gy
+	};
+	const Fp = c.Fp;
+	let allowedLengths = c.allowedPrivateKeyLengths ? Array.from(new Set(c.allowedPrivateKeyLengths.map((l) => Math.ceil(l / 2)))) : void 0;
+	return {
+		CURVE,
+		curveOpts: {
+			Fp,
+			Fn: Field(CURVE.n, {
+				BITS: c.nBitLength,
+				allowedLengths,
+				modFromBytes: c.wrapPrivateKey
+			}),
+			allowInfinityPoint: c.allowInfinityPoint,
+			endo: c.endo,
+			isTorsionFree: c.isTorsionFree,
+			clearCofactor: c.clearCofactor,
+			fromBytes: c.fromBytes,
+			toBytes: c.toBytes
+		}
+	};
+}
+function _ecdsa_legacy_opts_to_new(c) {
+	const { CURVE, curveOpts } = _weierstrass_legacy_opts_to_new(c);
+	const ecdsaOpts = {
+		hmac: c.hmac,
+		randomBytes: c.randomBytes,
+		lowS: c.lowS,
+		bits2int: c.bits2int,
+		bits2int_modN: c.bits2int_modN
+	};
+	return {
+		CURVE,
+		curveOpts,
+		hash: c.hash,
+		ecdsaOpts
+	};
+}
+function _ecdsa_new_output_to_legacy(c, _ecdsa) {
+	const Point = _ecdsa.Point;
+	return Object.assign({}, _ecdsa, {
+		ProjectivePoint: Point,
+		CURVE: Object.assign({}, c, nLength(Point.Fn.ORDER, Point.Fn.BITS))
+	});
+}
+function weierstrass(c) {
+	const { CURVE, curveOpts, hash, ecdsaOpts } = _ecdsa_legacy_opts_to_new(c);
+	return _ecdsa_new_output_to_legacy(c, ecdsa(weierstrassN(CURVE, curveOpts), hash, ecdsaOpts));
+}
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/_shortw_utils.js
+/**
+* Utilities for short weierstrass curves, combined with noble-hashes.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+/** @deprecated use new `weierstrass()` and `ecdsa()` methods */
+function createCurve(curveDef, defHash) {
+	const create = (hash) => weierstrass({
+		...curveDef,
+		hash
+	});
+	return {
+		...create(defHash),
+		create
+	};
+}
+//#endregion
+//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/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) */
+var secp256k1_CURVE = {
+	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
+	n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
+	h: BigInt(1),
+	a: BigInt(0),
+	b: BigInt(7),
+	Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
+	Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
+};
+var secp256k1_ENDO = {
+	beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
+	basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
+};
+var _0n = /* @__PURE__ */ BigInt(0);
+var _1n = /* @__PURE__ */ BigInt(1);
+var _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;
+}
+var Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });
+/**
+* secp256k1 curve, ECDSA and ECDH methods.
+*
+* Field: `2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n`
+*
+* @example
+* ```js
+* import { secp256k1 } from '@noble/curves/secp256k1';
+* const { secretKey, publicKey } = secp256k1.keygen();
+* const msg = new TextEncoder().encode('hello');
+* const sig = secp256k1.sign(msg, secretKey);
+* const isValid = secp256k1.verify(sig, msg, publicKey) === true;
+* ```
+*/
+var secp256k1 = createCurve({
+	...secp256k1_CURVE,
+	Fp: Fpk1,
+	lowS: true,
+	endo: secp256k1_ENDO
+}, sha256);
+/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */
+var TAGGED_HASH_PREFIXES = {};
+function taggedHash(tag, ...messages) {
+	let tagP = TAGGED_HASH_PREFIXES[tag];
+	if (tagP === void 0) {
+		const tagH = sha256(utf8ToBytes(tag));
+		tagP = concatBytes(tagH, tagH);
+		TAGGED_HASH_PREFIXES[tag] = tagP;
+	}
+	return sha256(concatBytes(tagP, ...messages));
+}
+var pointToBytes = (point) => point.toBytes(true).slice(1);
+var Pointk1 = /* @__PURE__ */ (() => secp256k1.Point)();
+var hasEven = (y) => y % _2n === _0n;
+function schnorrGetExtPubKey(priv) {
+	const { Fn, BASE } = Pointk1;
+	const d_ = _normFnElement(Fn, priv);
+	const p = BASE.multiply(d_);
+	return {
+		scalar: hasEven(p.y) ? d_ : Fn.neg(d_),
+		bytes: pointToBytes(p)
+	};
+}
+/**
+* lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.
+* @returns valid point checked for being on-curve
+*/
+function lift_x(x) {
+	const Fp = Fpk1;
+	if (!Fp.isValidNot0(x)) throw new Error("invalid x: Fail if x ≥ p");
+	const xx = Fp.create(x * x);
+	const c = Fp.create(xx * x + BigInt(7));
+	let y = Fp.sqrt(c);
+	if (!hasEven(y)) y = Fp.neg(y);
+	const p = Pointk1.fromAffine({
+		x,
+		y
+	});
+	p.assertValidity();
+	return p;
+}
+var num = bytesToNumberBE;
+/**
+* Create tagged hash, convert it to bigint, reduce modulo-n.
+*/
+function challenge(...args) {
+	return Pointk1.Fn.create(num(taggedHash("BIP0340/challenge", ...args)));
+}
+/**
+* Schnorr public key is just `x` coordinate of Point as per BIP340.
+*/
+function schnorrGetPublicKey(secretKey) {
+	return schnorrGetExtPubKey(secretKey).bytes;
+}
+/**
+* Creates Schnorr signature as per BIP340. Verifies itself before returning anything.
+* auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.
+*/
+function schnorrSign(message, secretKey, auxRand = randomBytes$1(32)) {
+	const { Fn } = Pointk1;
+	const m = ensureBytes("message", message);
+	const { bytes: px, scalar: d } = schnorrGetExtPubKey(secretKey);
+	const a = ensureBytes("auxRand", auxRand, 32);
+	const { bytes: rx, scalar: k } = schnorrGetExtPubKey(taggedHash("BIP0340/nonce", Fn.toBytes(d ^ num(taggedHash("BIP0340/aux", a))), px, m));
+	const e = challenge(rx, px, m);
+	const sig = /* @__PURE__ */ new Uint8Array(64);
+	sig.set(rx, 0);
+	sig.set(Fn.toBytes(Fn.create(k + e * d)), 32);
+	if (!schnorrVerify(sig, m, px)) throw new Error("sign: Invalid signature produced");
+	return sig;
+}
+/**
+* Verifies Schnorr signature.
+* Will swallow errors & return false except for initial type validation of arguments.
+*/
+function schnorrVerify(signature, message, publicKey) {
+	const { Fn, BASE } = Pointk1;
+	const sig = ensureBytes("signature", signature, 64);
+	const m = ensureBytes("message", message);
+	const pub = ensureBytes("publicKey", publicKey, 32);
+	try {
+		const P = lift_x(num(pub));
+		const r = num(sig.subarray(0, 32));
+		if (!inRange(r, _1n, secp256k1_CURVE.p)) return false;
+		const s = num(sig.subarray(32, 64));
+		if (!inRange(s, _1n, secp256k1_CURVE.n)) return false;
+		const e = challenge(Fn.toBytes(r), pointToBytes(P), m);
+		const R = BASE.multiplyUnsafe(s).add(P.multiplyUnsafe(Fn.neg(e)));
+		const { x, y } = R.toAffine();
+		if (R.is0() || !hasEven(y) || x !== r) return false;
+		return true;
+	} catch (error) {
+		return false;
+	}
+}
+/**
+* Schnorr signatures over secp256k1.
+* https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki
+* @example
+* ```js
+* import { schnorr } from '@noble/curves/secp256k1';
+* const { secretKey, publicKey } = schnorr.keygen();
+* // const publicKey = schnorr.getPublicKey(secretKey);
+* const msg = new TextEncoder().encode('hello');
+* const sig = schnorr.sign(msg, secretKey);
+* const isValid = schnorr.verify(sig, msg, publicKey);
+* ```
+*/
+var schnorr = /* @__PURE__ */ (() => {
+	const size = 32;
+	const seedLength = 48;
+	const randomSecretKey = (seed = randomBytes$1(seedLength)) => {
+		return mapHashToField(seed, secp256k1_CURVE.n);
+	};
+	secp256k1.utils.randomSecretKey;
+	function keygen(seed) {
+		const secretKey = randomSecretKey(seed);
+		return {
+			secretKey,
+			publicKey: schnorrGetPublicKey(secretKey)
+		};
+	}
+	return {
+		keygen,
+		getPublicKey: schnorrGetPublicKey,
+		sign: schnorrSign,
+		verify: schnorrVerify,
+		Point: Pointk1,
+		utils: {
+			randomSecretKey,
+			randomPrivateKey: randomSecretKey,
+			taggedHash,
+			lift_x,
+			pointToBytes,
+			numberToBytesBE,
+			bytesToNumberBE,
+			mod
+		},
+		lengths: {
+			secretKey: size,
+			publicKey: size,
+			publicKeyHasPrefix: false,
+			signature: size * 2,
+			seed: seedLength
+		}
+	};
+})();
+//#endregion
+//#region src/auth/nostrCrypto.ts
+var import_dist = (/* @__PURE__ */ __commonJSMin(((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.bech32m = exports.bech32 = void 0;
+	var ALPHABET = "qpzry9x8gf2tvdw0s3jn54khce6mua7l";
+	var ALPHABET_MAP = {};
+	for (let z = 0; z < 32; z++) {
+		const x = ALPHABET.charAt(z);
+		ALPHABET_MAP[x] = z;
+	}
+	function polymodStep(pre) {
+		const b = pre >> 25;
+		return (pre & 33554431) << 5 ^ -(b >> 0 & 1) & 996825010 ^ -(b >> 1 & 1) & 642813549 ^ -(b >> 2 & 1) & 513874426 ^ -(b >> 3 & 1) & 1027748829 ^ -(b >> 4 & 1) & 705979059;
+	}
+	function prefixChk(prefix) {
+		let chk = 1;
+		for (let i = 0; i < prefix.length; ++i) {
+			const c = prefix.charCodeAt(i);
+			if (c < 33 || c > 126) return "Invalid prefix (" + prefix + ")";
+			chk = polymodStep(chk) ^ c >> 5;
+		}
+		chk = polymodStep(chk);
+		for (let i = 0; i < prefix.length; ++i) {
+			const v = prefix.charCodeAt(i);
+			chk = polymodStep(chk) ^ v & 31;
+		}
+		return chk;
+	}
+	function convert(data, inBits, outBits, pad) {
+		let value = 0;
+		let bits = 0;
+		const maxV = (1 << outBits) - 1;
+		const result = [];
+		for (let i = 0; i < data.length; ++i) {
+			value = value << inBits | data[i];
+			bits += inBits;
+			while (bits >= outBits) {
+				bits -= outBits;
+				result.push(value >> bits & maxV);
+			}
+		}
+		if (pad) {
+			if (bits > 0) result.push(value << outBits - bits & maxV);
+		} else {
+			if (bits >= inBits) return "Excess padding";
+			if (value << outBits - bits & maxV) return "Non-zero padding";
+		}
+		return result;
+	}
+	function toWords(bytes) {
+		return convert(bytes, 8, 5, true);
+	}
+	function fromWordsUnsafe(words) {
+		const res = convert(words, 5, 8, false);
+		if (Array.isArray(res)) return res;
+	}
+	function fromWords(words) {
+		const res = convert(words, 5, 8, false);
+		if (Array.isArray(res)) return res;
+		throw new Error(res);
+	}
+	function getLibraryFromEncoding(encoding) {
+		let ENCODING_CONST;
+		if (encoding === "bech32") ENCODING_CONST = 1;
+		else ENCODING_CONST = 734539939;
+		function encode(prefix, words, LIMIT) {
+			LIMIT = LIMIT || 90;
+			if (prefix.length + 7 + words.length > LIMIT) throw new TypeError("Exceeds length limit");
+			prefix = prefix.toLowerCase();
+			let chk = prefixChk(prefix);
+			if (typeof chk === "string") throw new Error(chk);
+			let result = prefix + "1";
+			for (let i = 0; i < words.length; ++i) {
+				const x = words[i];
+				if (x >> 5 !== 0) throw new Error("Non 5-bit word");
+				chk = polymodStep(chk) ^ x;
+				result += ALPHABET.charAt(x);
+			}
+			for (let i = 0; i < 6; ++i) chk = polymodStep(chk);
+			chk ^= ENCODING_CONST;
+			for (let i = 0; i < 6; ++i) {
+				const v = chk >> (5 - i) * 5 & 31;
+				result += ALPHABET.charAt(v);
+			}
+			return result;
+		}
+		function __decode(str, LIMIT) {
+			LIMIT = LIMIT || 90;
+			if (str.length < 8) return str + " too short";
+			if (str.length > LIMIT) return "Exceeds length limit";
+			const lowered = str.toLowerCase();
+			const uppered = str.toUpperCase();
+			if (str !== lowered && str !== uppered) return "Mixed-case string " + str;
+			str = lowered;
+			const split = str.lastIndexOf("1");
+			if (split === -1) return "No separator character for " + str;
+			if (split === 0) return "Missing prefix for " + str;
+			const prefix = str.slice(0, split);
+			const wordChars = str.slice(split + 1);
+			if (wordChars.length < 6) return "Data too short";
+			let chk = prefixChk(prefix);
+			if (typeof chk === "string") return chk;
+			const words = [];
+			for (let i = 0; i < wordChars.length; ++i) {
+				const c = wordChars.charAt(i);
+				const v = ALPHABET_MAP[c];
+				if (v === void 0) return "Unknown character " + c;
+				chk = polymodStep(chk) ^ v;
+				if (i + 6 >= wordChars.length) continue;
+				words.push(v);
+			}
+			if (chk !== ENCODING_CONST) return "Invalid checksum for " + str;
+			return {
+				prefix,
+				words
+			};
+		}
+		function decodeUnsafe(str, LIMIT) {
+			const res = __decode(str, LIMIT);
+			if (typeof res === "object") return res;
+		}
+		function decode(str, LIMIT) {
+			const res = __decode(str, LIMIT);
+			if (typeof res === "object") return res;
+			throw new Error(res);
+		}
+		return {
+			decodeUnsafe,
+			decode,
+			encode,
+			toWords,
+			fromWordsUnsafe,
+			fromWords
+		};
+	}
+	exports.bech32 = getLibraryFromEncoding("bech32");
+	exports.bech32m = getLibraryFromEncoding("bech32m");
+})))();
+function generateNostrKeypair() {
+	const privkeyBytes = randomBytes(32);
+	const privkey = Buffer.from(privkeyBytes).toString("hex");
+	const pubkeyBytes = secp256k1.getPublicKey(privkeyBytes, true);
+	return {
+		pubkey: Buffer.from(pubkeyBytes.slice(1)).toString("hex"),
+		privkey
+	};
+}
+function deriveEncryptionKey(masterSecret) {
+	const salt = Buffer.from("nostr-privkey-encryption", "utf8");
+	const info = Buffer.from("aes-256-gcm", "utf8");
+	const keyMaterial = Buffer.from(masterSecret, "utf8");
+	return Buffer.from(hkdfSync("sha256", keyMaterial, salt, info, 32));
+}
+function encryptPrivkey(privkey, masterSecret) {
+	const key = deriveEncryptionKey(masterSecret);
+	const iv = randomBytes(12);
+	const cipher = createCipheriv("aes-256-gcm", key, iv);
+	const encrypted = Buffer.concat([cipher.update(privkey, "utf8"), cipher.final()]);
+	const tag = cipher.getAuthTag();
+	return {
+		ciphertext: encrypted.toString("base64"),
+		iv: iv.toString("base64"),
+		tag: tag.toString("base64")
+	};
+}
+function decryptPrivkey(encrypted, masterSecret) {
+	const key = deriveEncryptionKey(masterSecret);
+	const iv = Buffer.from(encrypted.iv, "base64");
+	const tag = Buffer.from(encrypted.tag, "base64");
+	const ciphertext = Buffer.from(encrypted.ciphertext, "base64");
+	const decipher = createDecipheriv("aes-256-gcm", key, iv);
+	decipher.setAuthTag(tag);
+	return Buffer.concat([decipher.update(ciphertext), decipher.final()]).toString("utf8");
+}
+function computeEventId(event) {
+	const serialized = JSON.stringify([
+		0,
+		event.pubkey,
+		event.created_at,
+		event.kind,
+		event.tags,
+		event.content
+	]);
+	return createHash("sha256").update(serialized).digest("hex");
+}
+function signEvent(event, privkey) {
+	const id = computeEventId(event);
+	const privkeyBytes = Buffer.from(privkey, "hex");
+	const idBytes = Buffer.from(id, "hex");
+	const sig = schnorr.sign(idBytes, privkeyBytes);
+	const sigHex = Buffer.from(sig).toString("hex");
+	return {
+		...event,
+		id,
+		sig: sigHex
+	};
+}
+function verifyNostrSignature(event) {
+	if (!event.id || !event.sig) return false;
+	if (computeEventId(event) !== event.id) return false;
+	try {
+		const sigBytes = Buffer.from(event.sig, "hex");
+		const idBytes = Buffer.from(event.id, "hex");
+		const pubkeyBytes = Buffer.from(event.pubkey, "hex");
+		return schnorr.verify(sigBytes, idBytes, pubkeyBytes);
+	} catch {
+		return false;
+	}
+}
+function createAuthEvent(privkey, challenge, relay) {
+	const privkeyBytes = Buffer.from(privkey, "hex");
+	const pubkeyBytes = secp256k1.getPublicKey(privkeyBytes, true);
+	const pubkey = Buffer.from(pubkeyBytes.slice(1)).toString("hex");
+	const tags = [["challenge", challenge]];
+	if (relay) tags.push(["relay", relay]);
+	return signEvent({
+		pubkey,
+		created_at: Math.floor(Date.now() / 1e3),
+		kind: 22242,
+		tags,
+		content: ""
+	}, privkey);
+}
+function verifyAuthEvent(event, expectedChallenge, maxAgeSeconds = 300) {
+	if (event.kind !== 22242) return {
+		valid: false,
+		error: "Invalid event kind"
+	};
+	const age = Math.floor(Date.now() / 1e3) - event.created_at;
+	if (age > maxAgeSeconds || age < -60) return {
+		valid: false,
+		error: "Event expired or too far in future"
+	};
+	const challengeTag = event.tags.find((t) => t[0] === "challenge");
+	if (!challengeTag || challengeTag[1] !== expectedChallenge) return {
+		valid: false,
+		error: "Challenge mismatch"
+	};
+	if (!verifyNostrSignature(event)) return {
+		valid: false,
+		error: "Invalid signature"
+	};
+	return { valid: true };
+}
+function pubkeyToNpub(pubkey) {
+	const words = import_dist.bech32.toWords(Buffer.from(pubkey, "hex"));
+	return import_dist.bech32.encode("npub", words, 1e3);
+}
+function npubToPubkey(npub) {
+	const { prefix, words } = import_dist.bech32.decode(npub, 1e3);
+	if (prefix !== "npub") throw new Error("Invalid npub prefix");
+	return Buffer.from(import_dist.bech32.fromWords(words)).toString("hex");
+}
+function privkeyToNsec(privkey) {
+	const words = import_dist.bech32.toWords(Buffer.from(privkey, "hex"));
+	return import_dist.bech32.encode("nsec", words, 1e3);
+}
+function nsecToPrivkey(nsec) {
+	const { prefix, words } = import_dist.bech32.decode(nsec, 1e3);
+	if (prefix !== "nsec") throw new Error("Invalid nsec prefix");
+	return Buffer.from(import_dist.bech32.fromWords(words)).toString("hex");
+}
+function getPublicKey(privkey) {
+	const privkeyBytes = Buffer.from(privkey, "hex");
+	const pubkeyBytes = secp256k1.getPublicKey(privkeyBytes, true);
+	return Buffer.from(pubkeyBytes.slice(1)).toString("hex");
+}
+function isValidPubkey(pubkey) {
+	if (!/^[0-9a-f]{64}$/i.test(pubkey)) return false;
+	try {
+		const fullPubkey = Buffer.from(`02${pubkey}`, "hex");
+		secp256k1.ProjectivePoint.fromHex(fullPubkey);
+		return true;
+	} catch {
+		return false;
+	}
+}
+function isValidPrivkey(privkey) {
+	if (!/^[0-9a-f]{64}$/i.test(privkey)) return false;
+	try {
+		const privkeyBytes = Buffer.from(privkey, "hex");
+		secp256k1.getPublicKey(privkeyBytes);
+		return true;
+	} catch {
+		return false;
+	}
+}
+//#endregion
+//#region src/models/NostrIdentity.ts
+var NostrIdentity_exports = /* @__PURE__ */ __exportAll({ NostrIdentity: () => NostrIdentity });
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __decorateClass = (decorators, target, key, kind) => {
+	var result = kind > 1 ? void 0 : kind ? __getOwnPropDesc(target, key) : target;
+	for (var i = decorators.length - 1, decorator; i >= 0; i--) if (decorator = decorators[i]) result = (kind ? decorator(target, key, result) : decorator(result)) || result;
+	if (kind && result) __defProp(target, key, result);
+	return result;
+};
+var NostrIdentity = class extends SmrtObject {
+	profileId;
+	/**
+	* Hex-encoded secp256k1 public key (64 characters)
+	*/
+	pubkey = "";
+	/**
+	* AES-256-GCM encrypted private key (base64-encoded ciphertext)
+	*/
+	encryptedPrivkey = "";
+	/**
+	* Initialization vector for AES-GCM decryption (base64)
+	*/
+	encryptionIv = "";
+	/**
+	* Authentication tag from AES-GCM (base64)
+	*/
+	encryptionTag = "";
+	/**
+	* Email address associated with this identity
+	*/
+	email = "";
+	/**
+	* Username for NIP-05 verification (e.g., "alice" for alice@domain.com)
+	*/
+	nip05Username = "";
+	/**
+	* Last time this identity was used for authentication
+	*/
+	lastUsedAt = null;
+	/**
+	* When this identity was verified via magic link
+	*/
+	verifiedAt = null;
+	constructor(options = {}) {
+		super(options);
+		if (options.profileId) this.profileId = options.profileId;
+		if (options.pubkey) this.pubkey = options.pubkey;
+		if (options.encryptedPrivkey) this.encryptedPrivkey = options.encryptedPrivkey;
+		if (options.encryptionIv) this.encryptionIv = options.encryptionIv;
+		if (options.encryptionTag) this.encryptionTag = options.encryptionTag;
+		if (options.email) this.email = options.email;
+		if (options.nip05Username) this.nip05Username = options.nip05Username;
+		if (options.lastUsedAt !== void 0) this.lastUsedAt = options.lastUsedAt;
+		if (options.verifiedAt !== void 0) this.verifiedAt = options.verifiedAt;
+	}
+	/**
+	* Get the linked Profile
+	*/
+	async getProfile() {
+		return await this.getRelated("profileId");
+	}
+	/**
+	* Find identity by public key
+	*/
+	static async findByPubkey(pubkey, options = {}) {
+		const { NostrIdentityCollection } = await Promise.resolve().then(() => NostrIdentityCollection_exports);
+		return await (await NostrIdentityCollection.create(options)).findOne({ where: { pubkey } });
+	}
+	/**
+	* Find identity by email
+	*/
+	static async findByEmail(email, options = {}) {
+		const { NostrIdentityCollection } = await Promise.resolve().then(() => NostrIdentityCollection_exports);
+		return await (await NostrIdentityCollection.create(options)).findOne({ where: { email: email.toLowerCase() } });
+	}
+	/**
+	* Find identity by NIP-05 username
+	*/
+	static async findByNip05(username, options = {}) {
+		const { NostrIdentityCollection } = await Promise.resolve().then(() => NostrIdentityCollection_exports);
+		return await (await NostrIdentityCollection.create(options)).findOne({ where: { nip05Username: username.toLowerCase() } });
+	}
+	/**
+	* Decrypt the private key using the server master secret
+	* @param masterSecret - SERVER_MASTER_SECRET from environment
+	* @returns Hex-encoded private key
+	*/
+	decryptPrivkey(masterSecret) {
+		return decryptPrivkey({
+			ciphertext: this.encryptedPrivkey,
+			iv: this.encryptionIv,
+			tag: this.encryptionTag
+		}, masterSecret);
+	}
+	/**
+	* Get the full keypair (requires master secret)
+	* @param masterSecret - SERVER_MASTER_SECRET from environment
+	*/
+	getKeypair(masterSecret) {
+		const privkey = this.decryptPrivkey(masterSecret);
+		return {
+			pubkey: this.pubkey,
+			privkey,
+			npub: pubkeyToNpub(this.pubkey),
+			nsec: privkeyToNsec(privkey)
+		};
+	}
+	/**
+	* Record usage of this identity
+	*/
+	async recordUsage() {
+		this.lastUsedAt = /* @__PURE__ */ new Date();
+		await this.save();
+	}
+	/**
+	* Mark this identity as verified
+	*/
+	async markVerified() {
+		this.verifiedAt = /* @__PURE__ */ new Date();
+		this.lastUsedAt = /* @__PURE__ */ new Date();
+		await this.save();
+	}
+	/**
+	* Check if this identity is verified
+	*/
+	isVerified() {
+		return this.verifiedAt !== null;
+	}
+	/**
+	* Get the NIP-05 identifier (username@domain)
+	* Note: Domain must be provided by the application
+	*/
+	getNip05Identifier(domain) {
+		return `${this.nip05Username || this.email.split("@")[0]}@${domain}`;
+	}
+};
+__decorateClass([foreignKey("Profile", { required: true })], NostrIdentity.prototype, "profileId", 2);
+NostrIdentity = __decorateClass([smrt({
+	tableName: "nostr_identities",
+	api: { include: ["list", "get"] },
+	mcp: { include: ["list", "get"] },
+	cli: { include: ["list", "get"] }
+})], NostrIdentity);
+//#endregion
+//#region src/collections/NostrIdentityCollection.ts
+var NostrIdentityCollection_exports = /* @__PURE__ */ __exportAll({ NostrIdentityCollection: () => NostrIdentityCollection });
+var NostrIdentityCollection = class extends SmrtCollection {
+	static _itemClass = NostrIdentity;
+	/**
+	* Find identities for a profile
+	*/
+	async findByProfile(profileId) {
+		return await this.list({ where: { profileId } });
+	}
+	/**
+	* Find identity by public key
+	*/
+	async findByPubkey(pubkey) {
+		return await this.findOne({ where: { pubkey } });
+	}
+	/**
+	* Find identity by email
+	*/
+	async findByEmail(email) {
+		return await this.findOne({ where: { email: email.toLowerCase() } });
+	}
+	/**
+	* Find identity by NIP-05 username
+	*/
+	async findByNip05(username) {
+		return await this.findOne({ where: { nip05Username: username.toLowerCase() } });
+	}
+	/**
+	* Link a new Nostr identity to a profile with a new keypair
+	* @param profile - The profile to link to
+	* @param email - Email address for this identity
+	* @param masterSecret - Server master secret for encryption
+	* @param nip05Username - Optional NIP-05 username (defaults to email local part)
+	*/
+	async createForProfile(profile, email, masterSecret, nip05Username) {
+		const normalizedEmail = email.toLowerCase();
+		if (await this.findByEmail(normalizedEmail)) throw new Error(`Nostr identity already exists for email: ${email}`);
+		const keypair = generateNostrKeypair();
+		const encrypted = encryptPrivkey(keypair.privkey, masterSecret);
+		const username = nip05Username?.toLowerCase() || normalizedEmail.split("@")[0];
+		const identity = new NostrIdentity({
+			...this.options,
+			profileId: profile.id,
+			pubkey: keypair.pubkey,
+			encryptedPrivkey: encrypted.ciphertext,
+			encryptionIv: encrypted.iv,
+			encryptionTag: encrypted.tag,
+			email: normalizedEmail,
+			nip05Username: username
+		});
+		await identity.initialize();
+		await identity.save();
+		return identity;
+	}
+	/**
+	* Link an existing Nostr identity (with encrypted keypair) to a profile
+	*/
+	async linkToProfile(profile, nostrData) {
+		if (await this.findByPubkey(nostrData.pubkey)) throw new Error("Nostr identity with this public key already exists");
+		if (await this.findByEmail(nostrData.email)) throw new Error("Nostr identity with this email already exists");
+		const identity = new NostrIdentity({
+			...this.options,
+			profileId: profile.id,
+			pubkey: nostrData.pubkey,
+			encryptedPrivkey: nostrData.encryptedPrivkey,
+			encryptionIv: nostrData.encryptionIv,
+			encryptionTag: nostrData.encryptionTag,
+			email: nostrData.email.toLowerCase(),
+			nip05Username: nostrData.nip05Username?.toLowerCase() || nostrData.email.toLowerCase().split("@")[0]
+		});
+		await identity.initialize();
+		await identity.save();
+		return identity;
+	}
+	/**
+	* Unlink a Nostr identity from a profile
+	*/
+	async unlinkFromProfile(profileId, pubkey) {
+		const identity = await this.findOne({ where: {
+			profileId,
+			pubkey
+		} });
+		if (identity) {
+			await identity.delete();
+			return true;
+		}
+		return false;
+	}
+	/**
+	* Get NIP-05 response data for the /.well-known/nostr.json endpoint
+	* @param username - Optional username filter, returns all if not provided
+	*/
+	async getNip05Response(username) {
+		const where = username ? { nip05Username: username.toLowerCase() } : {};
+		const identities = await this.list({ where });
+		const names = {};
+		for (const identity of identities) if (identity.nip05Username && identity.pubkey) names[identity.nip05Username] = identity.pubkey;
+		return { names };
+	}
+	/**
+	* Check if a NIP-05 username is available
+	*/
+	async isNip05Available(username) {
+		return await this.findByNip05(username) === null;
+	}
+	/**
+	* Update NIP-05 username for an identity
+	*/
+	async updateNip05Username(identity, newUsername) {
+		const normalizedUsername = newUsername.toLowerCase();
+		const existing = await this.findByNip05(normalizedUsername);
+		if (existing && existing.id !== identity.id) throw new Error(`NIP-05 username "${newUsername}" is already taken`);
+		identity.nip05Username = normalizedUsername;
+		await identity.save();
+		return identity;
+	}
+};
+//#endregion
+export { pubkeyToNpub as _, computeEventId as a, verifyNostrSignature as b, deriveEncryptionKey as c, getPublicKey as d, isValidPrivkey as f, privkeyToNsec as g, nsecToPrivkey as h, NostrIdentity_exports as i, encryptPrivkey as l, npubToPubkey as m, NostrIdentityCollection_exports as n, createAuthEvent as o, isValidPubkey as p, NostrIdentity as r, decryptPrivkey as s, NostrIdentityCollection as t, generateNostrKeypair as u, signEvent as v, __exportAll as x, verifyAuthEvent as y };
+
+//# sourceMappingURL=NostrIdentityCollection-CG6HGf6c.js.map