@ghostlytools/cli 1.0.0

package/dist/assets/noble_curves-DDWn5AH0.js

@@ -0,0 +1,2978 @@
+import { D as toBytes, E as shake256, T as sha512$1, a as abytes, b as sha384, c as anumber, d as concatBytes, f as createHasher, h as randomBytes, l as bytesToHex, m as isBytes, n as Hash, o as aexists, p as hexToBytes, s as ahash, u as clean, v as sha256, w as sha512, x as sha384$1, y as sha256$1 } from "./sha512-BYId-G-T.js";
+//#region ../../node_modules/openpgp/dist/lightweight/noble_curves.mjs
+/*! OpenPGP.js v6.3.2 - 2026-09-24 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+/**
+* Hex, bytes and number utilities.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n$5 = /* @__PURE__ */ BigInt(0);
+var _1n$6 = /* @__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$5 : 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;
+}
+/**
+* Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,
+* and Buffer#slice creates mutable copy. Never use Buffers!
+*/
+function copyBytes(bytes) {
+	return Uint8Array.from(bytes);
+}
+/**
+* Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols
+* Should be safe to use for things expected to be ASCII.
+* Returns exact same result as utf8ToBytes for ASCII or throws.
+*/
+function asciiToBytes(ascii) {
+	return Uint8Array.from(ascii, (c, i) => {
+		const charCode = c.charCodeAt(0);
+		if (c.length !== 1 || charCode > 127) throw new Error(`string contains non-ASCII character "${ascii[i]}" with code ${charCode} at position ${i}`);
+		return charCode;
+	});
+}
+/**
+* @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$5 <= 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 = 0;
+	for (; n > _0n$5; n >>= _1n$6, 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$6 << BigInt(n)) - _1n$6;
+/**
+* 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;
+	};
+}
+/**
+* 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$4 = BigInt(0);
+var _1n$5 = BigInt(1);
+var _2n$5 = /* @__PURE__ */ BigInt(2);
+var _3n$2 = /* @__PURE__ */ BigInt(3);
+var _4n$1 = /* @__PURE__ */ BigInt(4);
+var _5n = /* @__PURE__ */ BigInt(5);
+var _7n = /* @__PURE__ */ BigInt(7);
+var _8n$1 = /* @__PURE__ */ BigInt(8);
+var _9n = /* @__PURE__ */ BigInt(9);
+var _16n = /* @__PURE__ */ BigInt(16);
+function mod(a, b) {
+	const result = a % b;
+	return result >= _0n$4 ? 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$4) {
+		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$4) throw new Error("invert: expected non-zero number");
+	if (modulo <= _0n$4) throw new Error("invert: expected positive modulus, got " + modulo);
+	let a = mod(number, modulo);
+	let b = modulo;
+	let x = _0n$4, u = _1n$5;
+	while (a !== _0n$4) {
+		const q = b / a;
+		const r = b % a;
+		const m = x - u * q;
+		b = a, a = r, x = u, u = m;
+	}
+	if (b !== _1n$5) 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$5) / _4n$1;
+	const root = Fp.pow(n, p1div4);
+	assertIsSquare(Fp, root, n);
+	return root;
+}
+function sqrt5mod8(Fp, n) {
+	const p5div8 = (Fp.ORDER - _5n) / _8n$1;
+	const n2 = Fp.mul(n, _2n$5);
+	const v = Fp.pow(n2, p5div8);
+	const nv = Fp.mul(n, v);
+	const i = Fp.mul(Fp.mul(nv, _2n$5), 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$2) throw new Error("sqrt is not defined for small field");
+	let Q = P - _1n$5;
+	let S = 0;
+	while (Q % _2n$5 === _0n$4) {
+		Q /= _2n$5;
+		S++;
+	}
+	let Z = _2n$5;
+	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$5) / _2n$5;
+	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$5 << 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$2) return sqrt3mod4;
+	if (P % _8n$1 === _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$4) throw new Error("invalid exponent, negatives unsupported");
+	if (power === _0n$4) return Fp.ONE;
+	if (power === _1n$5) return num;
+	let p = Fp.ONE;
+	let d = num;
+	while (power > _0n$4) {
+		if (power & _1n$5) p = Fp.mul(p, d);
+		d = Fp.sqr(d);
+		power >>= _1n$5;
+	}
+	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$5) / _2n$5;
+	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$4) 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$4,
+		ONE: _1n$5,
+		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$4 <= num && num < ORDER;
+		},
+		is0: (num) => num === _0n$4,
+		isValidNot0: (num) => !f.is0(num) && f.isValid(num),
+		isOdd: (num) => (num & _1n$5) === _1n$5,
+		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$5) + _1n$5;
+	return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
+}
+/**
+* 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);
+/**
+* Methods for elliptic curve multiplication by scalars.
+* Contains wNAF, pippenger.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n$3 = BigInt(0);
+var _1n$4 = 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$4;
+	}
+	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$3) 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$3) {
+			if (n & _1n$4) p = p.add(d);
+			d = d.double();
+			n >>= _1n$4;
+		}
+		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$3) 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$3 || k2 > _0n$3) {
+		if (k1 & _1n$4) p1 = p1.add(acc);
+		if (k2 & _1n$4) p2 = p2.add(acc);
+		acc = acc.double();
+		k1 >>= _1n$4;
+		k2 >>= _1n$4;
+	}
+	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$3)) 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
+	};
+}
+/**
+* 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$4) / 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$2;
+	const k2neg = k2 < _0n$2;
+	if (k1neg) k1 = -k1;
+	if (k2neg) k2 = -k2;
+	const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n$3;
+	if (k1 < _0n$2 || k1 >= MAX_NUM || k2 < _0n$2 || 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$2) 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$2 = BigInt(0);
+var _1n$3 = BigInt(1);
+var _2n$4 = BigInt(2);
+var _3n$1 = BigInt(3);
+var _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();
+			const hasEvenY = !Fp.isOdd(y);
+			return concatBytes(pprefix(hasEvenY), 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$1), _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$1);
+			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$1);
+			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$1);
+			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$2 || p.is0()) return Point.ZERO;
+			if (sc === _1n$3) 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$3) return true;
+			if (isTorsionFree) return isTorsionFree(Point, this);
+			return wnaf.unsafe(this, CURVE_ORDER).is0();
+		}
+		clearCofactor() {
+			const { clearCofactor } = extraOpts;
+			if (cofactor === _1n$3) 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;
+	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$1 = ecdsaOpts.randomBytes || randomBytes;
+	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$3;
+	}
+	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$4 < 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$2, 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$1(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$2) return;
+			const s = Fn.create(ik * Fn.create(m + r * d));
+			if (s === _0n$2) return;
+			let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n$3);
+			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));
+}
+/**
+* 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
+	};
+}
+/**
+* Internal module for NIST P256, P384, P521 curves.
+* Do not use for now.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var p256_CURVE = {
+	p: BigInt("0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff"),
+	n: BigInt("0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551"),
+	h: BigInt(1),
+	a: BigInt("0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc"),
+	b: BigInt("0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b"),
+	Gx: BigInt("0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296"),
+	Gy: BigInt("0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5")
+};
+var p384_CURVE = {
+	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff"),
+	n: BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973"),
+	h: BigInt(1),
+	a: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc"),
+	b: BigInt("0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef"),
+	Gx: BigInt("0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7"),
+	Gy: BigInt("0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f")
+};
+var p521_CURVE = {
+	p: BigInt("0x1ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),
+	n: BigInt("0x01fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffa51868783bf2f966b7fcc0148f709a5d03bb5c9b8899c47aebb6fb71e91386409"),
+	h: BigInt(1),
+	a: BigInt("0x1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc"),
+	b: BigInt("0x0051953eb9618e1c9a1f929a21a0b68540eea2da725b99b315f3b8b489918ef109e156193951ec7e937b1652c0bd3bb1bf073573df883d2c34f1ef451fd46b503f00"),
+	Gx: BigInt("0x00c6858e06b70404e9cd9e3ecb662395b4429c648139053fb521f828af606b4d3dbaa14b5e77efe75928fe1dc127a2ffa8de3348b3c1856a429bf97e7e31c2e5bd66"),
+	Gy: BigInt("0x011839296a789a3bc0045c8a5fb42c7d1bd998f54449579b446817afbd17273e662c97ee72995ef42640c550b9013fad0761353c7086a272c24088be94769fd16650")
+};
+var Fp256 = Field(p256_CURVE.p);
+var Fp384 = Field(p384_CURVE.p);
+var Fp521 = Field(p521_CURVE.p);
+/** NIST P256 (aka secp256r1, prime256v1) curve, ECDSA and ECDH methods. */
+var p256$1 = createCurve({
+	...p256_CURVE,
+	Fp: Fp256,
+	lowS: false
+}, sha256$1);
+/** NIST P384 (aka secp384r1) curve, ECDSA and ECDH methods. */
+var p384$1 = createCurve({
+	...p384_CURVE,
+	Fp: Fp384,
+	lowS: false
+}, sha384$1);
+/** NIST P521 (aka secp521r1) curve, ECDSA and ECDH methods. */
+var p521$1 = createCurve({
+	...p521_CURVE,
+	Fp: Fp521,
+	lowS: false,
+	allowedPrivateKeyLengths: [
+		130,
+		131,
+		132
+	]
+}, sha512$1);
+/**
+* NIST secp256r1 aka p256.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+/** @deprecated use `import { p256 } from '@noble/curves/nist.js';` */
+var p256 = p256$1;
+/**
+* NIST secp384r1 aka p384.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+/** @deprecated use `import { p384 } from '@noble/curves/nist.js';` */
+var p384 = p384$1;
+/**
+* NIST secp521r1 aka p521.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+/** @deprecated use `import { p521 } from '@noble/curves/nist.js';` */
+var p521 = p521$1;
+/**
+* Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y².
+* For design rationale of types / exports, see weierstrass module documentation.
+* Untwisted Edwards curves exist, but they aren't used in real-world protocols.
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n$1 = BigInt(0);
+var _1n$2 = BigInt(1);
+var _2n$3 = BigInt(2);
+var _8n = BigInt(8);
+function isEdValidXY(Fp, CURVE, x, y) {
+	const x2 = Fp.sqr(x);
+	const y2 = Fp.sqr(y);
+	const left = Fp.add(Fp.mul(CURVE.a, x2), y2);
+	const right = Fp.add(Fp.ONE, Fp.mul(CURVE.d, Fp.mul(x2, y2)));
+	return Fp.eql(left, right);
+}
+function edwards(params, extraOpts = {}) {
+	const validated = _createCurveFields("edwards", params, extraOpts, extraOpts.FpFnLE);
+	const { Fp, Fn } = validated;
+	let CURVE = validated.CURVE;
+	const { h: cofactor } = CURVE;
+	_validateObject(extraOpts, {}, { uvRatio: "function" });
+	const MASK = _2n$3 << BigInt(Fn.BYTES * 8) - _1n$2;
+	const modP = (n) => Fp.create(n);
+	const uvRatio = extraOpts.uvRatio || ((u, v) => {
+		try {
+			return {
+				isValid: true,
+				value: Fp.sqrt(Fp.div(u, v))
+			};
+		} catch (e) {
+			return {
+				isValid: false,
+				value: _0n$1
+			};
+		}
+	});
+	if (!isEdValidXY(Fp, CURVE, CURVE.Gx, CURVE.Gy)) throw new Error("bad curve params: generator point");
+	/**
+	* Asserts coordinate is valid: 0 <= n < MASK.
+	* Coordinates >= Fp.ORDER are allowed for zip215.
+	*/
+	function acoord(title, n, banZero = false) {
+		const min = banZero ? _1n$2 : _0n$1;
+		aInRange("coordinate " + title, n, min, MASK);
+		return n;
+	}
+	function aextpoint(other) {
+		if (!(other instanceof Point)) throw new Error("ExtendedPoint expected");
+	}
+	const toAffineMemo = memoized((p, iz) => {
+		const { X, Y, Z } = p;
+		const is0 = p.is0();
+		if (iz == null) iz = is0 ? _8n : Fp.inv(Z);
+		const x = modP(X * iz);
+		const y = modP(Y * iz);
+		const zz = Fp.mul(Z, iz);
+		if (is0) return {
+			x: _0n$1,
+			y: _1n$2
+		};
+		if (zz !== _1n$2) throw new Error("invZ was invalid");
+		return {
+			x,
+			y
+		};
+	});
+	const assertValidMemo = memoized((p) => {
+		const { a, d } = CURVE;
+		if (p.is0()) throw new Error("bad point: ZERO");
+		const { X, Y, Z, T } = p;
+		const X2 = modP(X * X);
+		const Y2 = modP(Y * Y);
+		const Z2 = modP(Z * Z);
+		const Z4 = modP(Z2 * Z2);
+		const aX2 = modP(X2 * a);
+		if (modP(Z2 * modP(aX2 + Y2)) !== modP(Z4 + modP(d * modP(X2 * Y2)))) throw new Error("bad point: equation left != right (1)");
+		if (modP(X * Y) !== modP(Z * T)) throw new Error("bad point: equation left != right (2)");
+		return true;
+	});
+	class Point {
+		constructor(X, Y, Z, T) {
+			this.X = acoord("x", X);
+			this.Y = acoord("y", Y);
+			this.Z = acoord("z", Z, true);
+			this.T = acoord("t", T);
+			Object.freeze(this);
+		}
+		static CURVE() {
+			return CURVE;
+		}
+		static fromAffine(p) {
+			if (p instanceof Point) throw new Error("extended point not allowed");
+			const { x, y } = p || {};
+			acoord("x", x);
+			acoord("y", y);
+			return new Point(x, y, _1n$2, modP(x * y));
+		}
+		static fromBytes(bytes, zip215 = false) {
+			const len = Fp.BYTES;
+			const { a, d } = CURVE;
+			bytes = copyBytes(_abytes2(bytes, len, "point"));
+			_abool2(zip215, "zip215");
+			const normed = copyBytes(bytes);
+			const lastByte = bytes[len - 1];
+			normed[len - 1] = lastByte & -129;
+			const y = bytesToNumberLE(normed);
+			aInRange("point.y", y, _0n$1, zip215 ? MASK : Fp.ORDER);
+			const y2 = modP(y * y);
+			const u = modP(y2 - _1n$2);
+			const v = modP(d * y2 - a);
+			let { isValid, value: x } = uvRatio(u, v);
+			if (!isValid) throw new Error("bad point: invalid y coordinate");
+			const isXOdd = (x & _1n$2) === _1n$2;
+			const isLastByteOdd = (lastByte & 128) !== 0;
+			if (!zip215 && x === _0n$1 && isLastByteOdd) throw new Error("bad point: x=0 and x_0=1");
+			if (isLastByteOdd !== isXOdd) x = modP(-x);
+			return Point.fromAffine({
+				x,
+				y
+			});
+		}
+		static fromHex(bytes, zip215 = false) {
+			return Point.fromBytes(ensureBytes("point", bytes), zip215);
+		}
+		get x() {
+			return this.toAffine().x;
+		}
+		get y() {
+			return this.toAffine().y;
+		}
+		precompute(windowSize = 8, isLazy = true) {
+			wnaf.createCache(this, windowSize);
+			if (!isLazy) this.multiply(_2n$3);
+			return this;
+		}
+		assertValidity() {
+			assertValidMemo(this);
+		}
+		equals(other) {
+			aextpoint(other);
+			const { X: X1, Y: Y1, Z: Z1 } = this;
+			const { X: X2, Y: Y2, Z: Z2 } = other;
+			const X1Z2 = modP(X1 * Z2);
+			const X2Z1 = modP(X2 * Z1);
+			const Y1Z2 = modP(Y1 * Z2);
+			const Y2Z1 = modP(Y2 * Z1);
+			return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;
+		}
+		is0() {
+			return this.equals(Point.ZERO);
+		}
+		negate() {
+			return new Point(modP(-this.X), this.Y, this.Z, modP(-this.T));
+		}
+		double() {
+			const { a } = CURVE;
+			const { X: X1, Y: Y1, Z: Z1 } = this;
+			const A = modP(X1 * X1);
+			const B = modP(Y1 * Y1);
+			const C = modP(_2n$3 * modP(Z1 * Z1));
+			const D = modP(a * A);
+			const x1y1 = X1 + Y1;
+			const E = modP(modP(x1y1 * x1y1) - A - B);
+			const G = D + B;
+			const F = G - C;
+			const H = D - B;
+			const X3 = modP(E * F);
+			const Y3 = modP(G * H);
+			const T3 = modP(E * H);
+			const Z3 = modP(F * G);
+			return new Point(X3, Y3, Z3, T3);
+		}
+		add(other) {
+			aextpoint(other);
+			const { a, d } = CURVE;
+			const { X: X1, Y: Y1, Z: Z1, T: T1 } = this;
+			const { X: X2, Y: Y2, Z: Z2, T: T2 } = other;
+			const A = modP(X1 * X2);
+			const B = modP(Y1 * Y2);
+			const C = modP(T1 * d * T2);
+			const D = modP(Z1 * Z2);
+			const E = modP((X1 + Y1) * (X2 + Y2) - A - B);
+			const F = D - C;
+			const G = D + C;
+			const H = modP(B - a * A);
+			const X3 = modP(E * F);
+			const Y3 = modP(G * H);
+			const T3 = modP(E * H);
+			const Z3 = modP(F * G);
+			return new Point(X3, Y3, Z3, T3);
+		}
+		subtract(other) {
+			return this.add(other.negate());
+		}
+		multiply(scalar) {
+			if (!Fn.isValidNot0(scalar)) throw new Error("invalid scalar: expected 1 <= sc < curve.n");
+			const { p, f } = wnaf.cached(this, scalar, (p) => normalizeZ(Point, p));
+			return normalizeZ(Point, [p, f])[0];
+		}
+		multiplyUnsafe(scalar, acc = Point.ZERO) {
+			if (!Fn.isValid(scalar)) throw new Error("invalid scalar: expected 0 <= sc < curve.n");
+			if (scalar === _0n$1) return Point.ZERO;
+			if (this.is0() || scalar === _1n$2) return this;
+			return wnaf.unsafe(this, scalar, (p) => normalizeZ(Point, p), acc);
+		}
+		isSmallOrder() {
+			return this.multiplyUnsafe(cofactor).is0();
+		}
+		isTorsionFree() {
+			return wnaf.unsafe(this, CURVE.n).is0();
+		}
+		toAffine(invertedZ) {
+			return toAffineMemo(this, invertedZ);
+		}
+		clearCofactor() {
+			if (cofactor === _1n$2) return this;
+			return this.multiplyUnsafe(cofactor);
+		}
+		toBytes() {
+			const { x, y } = this.toAffine();
+			const bytes = Fp.toBytes(y);
+			bytes[bytes.length - 1] |= x & _1n$2 ? 128 : 0;
+			return bytes;
+		}
+		toHex() {
+			return bytesToHex(this.toBytes());
+		}
+		toString() {
+			return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
+		}
+		get ex() {
+			return this.X;
+		}
+		get ey() {
+			return this.Y;
+		}
+		get ez() {
+			return this.Z;
+		}
+		get et() {
+			return this.T;
+		}
+		static normalizeZ(points) {
+			return normalizeZ(Point, points);
+		}
+		static msm(points, scalars) {
+			return pippenger(Point, Fn, points, scalars);
+		}
+		_setWindowSize(windowSize) {
+			this.precompute(windowSize);
+		}
+		toRawBytes() {
+			return this.toBytes();
+		}
+	}
+	Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n$2, modP(CURVE.Gx * CURVE.Gy));
+	Point.ZERO = new Point(_0n$1, _1n$2, _1n$2, _0n$1);
+	Point.Fp = Fp;
+	Point.Fn = Fn;
+	const wnaf = new wNAF(Point, Fn.BITS);
+	Point.BASE.precompute(8);
+	return Point;
+}
+/**
+* Initializes EdDSA signatures over given Edwards curve.
+*/
+function eddsa(Point, cHash, eddsaOpts = {}) {
+	if (typeof cHash !== "function") throw new Error("\"hash\" function param is required");
+	_validateObject(eddsaOpts, {}, {
+		adjustScalarBytes: "function",
+		randomBytes: "function",
+		domain: "function",
+		prehash: "function",
+		mapToCurve: "function"
+	});
+	const { prehash } = eddsaOpts;
+	const { BASE, Fp, Fn } = Point;
+	const randomBytes$1 = eddsaOpts.randomBytes || randomBytes;
+	const adjustScalarBytes = eddsaOpts.adjustScalarBytes || ((bytes) => bytes);
+	const domain = eddsaOpts.domain || ((data, ctx, phflag) => {
+		_abool2(phflag, "phflag");
+		if (ctx.length || phflag) throw new Error("Contexts/pre-hash are not supported");
+		return data;
+	});
+	function modN_LE(hash) {
+		return Fn.create(bytesToNumberLE(hash));
+	}
+	function getPrivateScalar(key) {
+		const len = lengths.secretKey;
+		key = ensureBytes("private key", key, len);
+		const hashed = ensureBytes("hashed private key", cHash(key), 2 * len);
+		const head = adjustScalarBytes(hashed.slice(0, len));
+		return {
+			head,
+			prefix: hashed.slice(len, 2 * len),
+			scalar: modN_LE(head)
+		};
+	}
+	/** Convenience method that creates public key from scalar. RFC8032 5.1.5 */
+	function getExtendedPublicKey(secretKey) {
+		const { head, prefix, scalar } = getPrivateScalar(secretKey);
+		const point = BASE.multiply(scalar);
+		return {
+			head,
+			prefix,
+			scalar,
+			point,
+			pointBytes: point.toBytes()
+		};
+	}
+	/** Calculates EdDSA pub key. RFC8032 5.1.5. */
+	function getPublicKey(secretKey) {
+		return getExtendedPublicKey(secretKey).pointBytes;
+	}
+	function hashDomainToScalar(context = Uint8Array.of(), ...msgs) {
+		const msg = concatBytes(...msgs);
+		return modN_LE(cHash(domain(msg, ensureBytes("context", context), !!prehash)));
+	}
+	/** Signs message with privateKey. RFC8032 5.1.6 */
+	function sign(msg, secretKey, options = {}) {
+		msg = ensureBytes("message", msg);
+		if (prehash) msg = prehash(msg);
+		const { prefix, scalar, pointBytes } = getExtendedPublicKey(secretKey);
+		const r = hashDomainToScalar(options.context, prefix, msg);
+		const R = BASE.multiply(r).toBytes();
+		const k = hashDomainToScalar(options.context, R, pointBytes, msg);
+		const s = Fn.create(r + k * scalar);
+		if (!Fn.isValid(s)) throw new Error("sign failed: invalid s");
+		return _abytes2(concatBytes(R, Fn.toBytes(s)), lengths.signature, "result");
+	}
+	const verifyOpts = { zip215: true };
+	/**
+	* Verifies EdDSA signature against message and public key. RFC8032 5.1.7.
+	* An extended group equation is checked.
+	*/
+	function verify(sig, msg, publicKey, options = verifyOpts) {
+		const { context, zip215 } = options;
+		const len = lengths.signature;
+		sig = ensureBytes("signature", sig, len);
+		msg = ensureBytes("message", msg);
+		publicKey = ensureBytes("publicKey", publicKey, lengths.publicKey);
+		if (zip215 !== void 0) _abool2(zip215, "zip215");
+		if (prehash) msg = prehash(msg);
+		const mid = len / 2;
+		const r = sig.subarray(0, mid);
+		const s = bytesToNumberLE(sig.subarray(mid, len));
+		let A, R, SB;
+		try {
+			A = Point.fromBytes(publicKey, zip215);
+			R = Point.fromBytes(r, zip215);
+			SB = BASE.multiplyUnsafe(s);
+		} catch (error) {
+			return false;
+		}
+		if (!zip215 && A.isSmallOrder()) return false;
+		const k = hashDomainToScalar(context, R.toBytes(), A.toBytes(), msg);
+		return R.add(A.multiplyUnsafe(k)).subtract(SB).clearCofactor().is0();
+	}
+	const _size = Fp.BYTES;
+	const lengths = {
+		secretKey: _size,
+		publicKey: _size,
+		signature: 2 * _size,
+		seed: _size
+	};
+	function randomSecretKey(seed = randomBytes$1(lengths.seed)) {
+		return _abytes2(seed, lengths.seed, "seed");
+	}
+	function keygen(seed) {
+		const secretKey = utils.randomSecretKey(seed);
+		return {
+			secretKey,
+			publicKey: getPublicKey(secretKey)
+		};
+	}
+	function isValidSecretKey(key) {
+		return isBytes(key) && key.length === Fn.BYTES;
+	}
+	function isValidPublicKey(key, zip215) {
+		try {
+			return !!Point.fromBytes(key, zip215);
+		} catch (error) {
+			return false;
+		}
+	}
+	const utils = {
+		getExtendedPublicKey,
+		randomSecretKey,
+		isValidSecretKey,
+		isValidPublicKey,
+		/**
+		* Converts ed public key to x public key. Uses formula:
+		* - ed25519:
+		*   - `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`
+		*   - `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`
+		* - ed448:
+		*   - `(u, v) = ((y-1)/(y+1), sqrt(156324)*u/x)`
+		*   - `(x, y) = (sqrt(156324)*u/v, (1+u)/(1-u))`
+		*/
+		toMontgomery(publicKey) {
+			const { y } = Point.fromBytes(publicKey);
+			const size = lengths.publicKey;
+			const is25519 = size === 32;
+			if (!is25519 && size !== 57) throw new Error("only defined for 25519 and 448");
+			const u = is25519 ? Fp.div(_1n$2 + y, _1n$2 - y) : Fp.div(y - _1n$2, y + _1n$2);
+			return Fp.toBytes(u);
+		},
+		toMontgomerySecret(secretKey) {
+			const size = lengths.secretKey;
+			_abytes2(secretKey, size);
+			const hashed = cHash(secretKey.subarray(0, size));
+			return adjustScalarBytes(hashed).subarray(0, size);
+		},
+		/** @deprecated */
+		randomPrivateKey: randomSecretKey,
+		/** @deprecated */
+		precompute(windowSize = 8, point = Point.BASE) {
+			return point.precompute(windowSize, false);
+		}
+	};
+	return Object.freeze({
+		keygen,
+		getPublicKey,
+		sign,
+		verify,
+		utils,
+		Point,
+		lengths
+	});
+}
+function _eddsa_legacy_opts_to_new(c) {
+	const CURVE = {
+		a: c.a,
+		d: c.d,
+		p: c.Fp.ORDER,
+		n: c.n,
+		h: c.h,
+		Gx: c.Gx,
+		Gy: c.Gy
+	};
+	const curveOpts = {
+		Fp: c.Fp,
+		Fn: Field(CURVE.n, c.nBitLength, true),
+		uvRatio: c.uvRatio
+	};
+	const eddsaOpts = {
+		randomBytes: c.randomBytes,
+		adjustScalarBytes: c.adjustScalarBytes,
+		domain: c.domain,
+		prehash: c.prehash,
+		mapToCurve: c.mapToCurve
+	};
+	return {
+		CURVE,
+		curveOpts,
+		hash: c.hash,
+		eddsaOpts
+	};
+}
+function _eddsa_new_output_to_legacy(c, eddsa) {
+	const Point = eddsa.Point;
+	return Object.assign({}, eddsa, {
+		ExtendedPoint: Point,
+		CURVE: c,
+		nBitLength: Point.Fn.BITS,
+		nByteLength: Point.Fn.BYTES
+	});
+}
+function twistedEdwards(c) {
+	const { CURVE, curveOpts, hash, eddsaOpts } = _eddsa_legacy_opts_to_new(c);
+	return _eddsa_new_output_to_legacy(c, eddsa(edwards(CURVE, curveOpts), hash, eddsaOpts));
+}
+/**
+* Montgomery curve methods. It's not really whole montgomery curve,
+* just bunch of very specific methods for X25519 / X448 from
+* [RFC 7748](https://www.rfc-editor.org/rfc/rfc7748)
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var _0n = BigInt(0);
+var _1n$1 = BigInt(1);
+var _2n$2 = BigInt(2);
+function validateOpts(curve) {
+	_validateObject(curve, {
+		adjustScalarBytes: "function",
+		powPminus2: "function"
+	});
+	return Object.freeze({ ...curve });
+}
+function montgomery(curveDef) {
+	const { P, type, adjustScalarBytes, powPminus2, randomBytes: rand } = validateOpts(curveDef);
+	const is25519 = type === "x25519";
+	if (!is25519 && type !== "x448") throw new Error("invalid type");
+	const randomBytes_ = rand || randomBytes;
+	const montgomeryBits = is25519 ? 255 : 448;
+	const fieldLen = is25519 ? 32 : 56;
+	const Gu = is25519 ? BigInt(9) : BigInt(5);
+	const a24 = is25519 ? BigInt(121665) : BigInt(39081);
+	const minScalar = is25519 ? _2n$2 ** BigInt(254) : _2n$2 ** BigInt(447);
+	const maxScalar = minScalar + (is25519 ? BigInt(8) * _2n$2 ** BigInt(251) - _1n$1 : BigInt(4) * _2n$2 ** BigInt(445) - _1n$1) + _1n$1;
+	const modP = (n) => mod(n, P);
+	const GuBytes = encodeU(Gu);
+	function encodeU(u) {
+		return numberToBytesLE(modP(u), fieldLen);
+	}
+	function decodeU(u) {
+		const _u = ensureBytes("u coordinate", u, fieldLen);
+		if (is25519) _u[31] &= 127;
+		return modP(bytesToNumberLE(_u));
+	}
+	function decodeScalar(scalar) {
+		return bytesToNumberLE(adjustScalarBytes(ensureBytes("scalar", scalar, fieldLen)));
+	}
+	function scalarMult(scalar, u) {
+		const pu = montgomeryLadder(decodeU(u), decodeScalar(scalar));
+		if (pu === _0n) throw new Error("invalid private or public key received");
+		return encodeU(pu);
+	}
+	function scalarMultBase(scalar) {
+		return scalarMult(scalar, GuBytes);
+	}
+	function cswap(swap, x_2, x_3) {
+		const dummy = modP(swap * (x_2 - x_3));
+		x_2 = modP(x_2 - dummy);
+		x_3 = modP(x_3 + dummy);
+		return {
+			x_2,
+			x_3
+		};
+	}
+	/**
+	* Montgomery x-only multiplication ladder.
+	* @param pointU u coordinate (x) on Montgomery Curve 25519
+	* @param scalar by which the point would be multiplied
+	* @returns new Point on Montgomery curve
+	*/
+	function montgomeryLadder(u, scalar) {
+		aInRange("u", u, _0n, P);
+		aInRange("scalar", scalar, minScalar, maxScalar);
+		const k = scalar;
+		const x_1 = u;
+		let x_2 = _1n$1;
+		let z_2 = _0n;
+		let x_3 = u;
+		let z_3 = _1n$1;
+		let swap = _0n;
+		for (let t = BigInt(montgomeryBits - 1); t >= _0n; t--) {
+			const k_t = k >> t & _1n$1;
+			swap ^= k_t;
+			({x_2, x_3} = cswap(swap, x_2, x_3));
+			({x_2: z_2, x_3: z_3} = cswap(swap, z_2, z_3));
+			swap = k_t;
+			const A = x_2 + z_2;
+			const AA = modP(A * A);
+			const B = x_2 - z_2;
+			const BB = modP(B * B);
+			const E = AA - BB;
+			const C = x_3 + z_3;
+			const D = x_3 - z_3;
+			const DA = modP(D * A);
+			const CB = modP(C * B);
+			const dacb = DA + CB;
+			const da_cb = DA - CB;
+			x_3 = modP(dacb * dacb);
+			z_3 = modP(x_1 * modP(da_cb * da_cb));
+			x_2 = modP(AA * BB);
+			z_2 = modP(E * (AA + modP(a24 * E)));
+		}
+		({x_2, x_3} = cswap(swap, x_2, x_3));
+		({x_2: z_2, x_3: z_3} = cswap(swap, z_2, z_3));
+		const z2 = powPminus2(z_2);
+		return modP(x_2 * z2);
+	}
+	const lengths = {
+		secretKey: fieldLen,
+		publicKey: fieldLen,
+		seed: fieldLen
+	};
+	const randomSecretKey = (seed = randomBytes_(fieldLen)) => {
+		abytes(seed, lengths.seed);
+		return seed;
+	};
+	function keygen(seed) {
+		const secretKey = randomSecretKey(seed);
+		return {
+			secretKey,
+			publicKey: scalarMultBase(secretKey)
+		};
+	}
+	return {
+		keygen,
+		getSharedSecret: (secretKey, publicKey) => scalarMult(secretKey, publicKey),
+		getPublicKey: (secretKey) => scalarMultBase(secretKey),
+		scalarMult,
+		scalarMultBase,
+		utils: {
+			randomSecretKey,
+			randomPrivateKey: randomSecretKey
+		},
+		GuBytes: GuBytes.slice(),
+		lengths
+	};
+}
+/**
+* Edwards448 (not Ed448-Goldilocks) curve with following addons:
+* - X448 ECDH
+* - Decaf cofactor elimination
+* - Elligator hash-to-group / point indistinguishability
+* Conforms to RFC 8032 https://www.rfc-editor.org/rfc/rfc8032.html#section-5.2
+* @module
+*/
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+var ed448_CURVE = {
+	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffffffffffffffffffffffffffffffffffffffffffffffffffff"),
+	n: BigInt("0x3fffffffffffffffffffffffffffffffffffffffffffffffffffffff7cca23e9c44edb49aed63690216cc2728dc58f552378c292ab5844f3"),
+	h: BigInt(4),
+	a: BigInt(1),
+	d: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffffffffffffffffffffffffffffffffffffffffffffffff6756"),
+	Gx: BigInt("0x4f1970c66bed0ded221d15a622bf36da9e146570470f1767ea6de324a3d3a46412ae1af72ab66511433b80e18b00938e2626a82bc70cc05e"),
+	Gy: BigInt("0x693f46716eb6bc248876203756c9c7624bea73736ca3984087789c1e05a0c2d73ad3ff1ce67c39c4fdbd132c4ed7c8ad9808795bf230fa14")
+};
+var E448_CURVE = Object.assign({}, ed448_CURVE, {
+	d: BigInt("0xd78b4bdc7f0daf19f24f38c29373a2ccad46157242a50f37809b1da3412a12e79ccc9c81264cfe9ad080997058fb61c4243cc32dbaa156b9"),
+	Gx: BigInt("0x79a70b2b70400553ae7c9df416c792c61128751ac92969240c25a07d728bdc93e21f7787ed6972249de732f38496cd11698713093e9c04fc"),
+	Gy: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffff80000000000000000000000000000000000000000000000000000001")
+});
+var shake256_114 = /* @__PURE__ */ createHasher(() => shake256.create({ dkLen: 114 }));
+var _1n = BigInt(1);
+var _2n$1 = BigInt(2);
+var _3n = BigInt(3);
+var _11n = BigInt(11);
+var _22n = BigInt(22);
+var _44n = BigInt(44);
+var _88n = BigInt(88);
+var _223n = BigInt(223);
+function ed448_pow_Pminus3div4(x) {
+	const P = ed448_CURVE.p;
+	const b2 = x * x * x % P;
+	const b3 = b2 * b2 * x % P;
+	const b11 = pow2(pow2(pow2(b3, _3n, P) * b3 % P, _3n, P) * b3 % P, _2n$1, 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 b222 = pow2(pow2(pow2(b88, _88n, P) * b88 % P, _44n, P) * b44 % P, _2n$1, P) * b2 % P;
+	return pow2(pow2(b222, _1n, P) * x % P, _223n, P) * b222 % P;
+}
+function adjustScalarBytes(bytes) {
+	bytes[0] &= 252;
+	bytes[55] |= 128;
+	bytes[56] = 0;
+	return bytes;
+}
+function uvRatio(u, v) {
+	const P = ed448_CURVE.p;
+	const u2v = mod(u * u * v, P);
+	const u3v = mod(u2v * u, P);
+	const x = mod(u3v * ed448_pow_Pminus3div4(mod(u3v * u2v * v, P)), P);
+	return {
+		isValid: mod(mod(x * x, P) * v, P) === u,
+		value: x
+	};
+}
+var Fp$3 = /* @__PURE__ */ (() => Field(ed448_CURVE.p, {
+	BITS: 456,
+	isLE: true
+}))();
+var Fn = /* @__PURE__ */ (() => Field(ed448_CURVE.n, {
+	BITS: 456,
+	isLE: true
+}))();
+function dom4(data, ctx, phflag) {
+	if (ctx.length > 255) throw new Error("context must be smaller than 255, got: " + ctx.length);
+	return concatBytes(asciiToBytes("SigEd448"), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);
+}
+/**
+* ed448 EdDSA curve and methods.
+* @example
+* import { ed448 } from '@noble/curves/ed448';
+* const { secretKey, publicKey } = ed448.keygen();
+* const msg = new TextEncoder().encode('hello');
+* const sig = ed448.sign(msg, secretKey);
+* const isValid = ed448.verify(sig, msg, publicKey);
+*/
+var ed448 = twistedEdwards(/* @__PURE__ */ (() => ({
+	...ed448_CURVE,
+	Fp: Fp$3,
+	Fn,
+	nBitLength: Fn.BITS,
+	hash: shake256_114,
+	adjustScalarBytes,
+	domain: dom4,
+	uvRatio
+}))());
+/**
+* E448 curve, defined by NIST.
+* E448 != edwards448 used in ed448.
+* E448 is birationally equivalent to edwards448.
+*/
+edwards(E448_CURVE);
+/**
+* ECDH using curve448 aka x448.
+* x448 has 56-byte keys as per RFC 7748, while
+* ed448 has 57-byte keys as per RFC 8032.
+*/
+var x448 = /* @__PURE__ */ (() => {
+	const P = ed448_CURVE.p;
+	return montgomery({
+		P,
+		type: "x448",
+		powPminus2: (x) => {
+			return mod(pow2(ed448_pow_Pminus3div4(x), _2n$1, P) * x, P);
+		},
+		adjustScalarBytes
+	});
+})();
+/**
+* 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 _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$1);
+/** @access private */
+var Fp$2 = Field(BigInt("0xa9fb57dba1eea9bc3e660a909d838d726e3bf623d52620282013481d1f6e5377"));
+var brainpoolP256r1 = createCurve({
+	a: Fp$2.create(BigInt("0x7d5a0975fc2c3057eef67530417affe7fb8055c126dc5c6ce94a4b44f330b5d9")),
+	b: BigInt("0x26dc5c6ce94a4b44f330b5d9bbd77cbf958416295cf7e1ce6bccdc18ff8c07b6"),
+	Fp: Fp$2,
+	n: BigInt("0xa9fb57dba1eea9bc3e660a909d838d718c397aa3b561a6f7901e0e82974856a7"),
+	Gx: BigInt("0x8bd2aeb9cb7e57cb2c4b482ffc81b7afb9de27e1e3bd23c23a4453bd9ace3262"),
+	Gy: BigInt("0x547ef835c3dac4fd97f8461a14611dc9c27745132ded8e545c1d54c72f046997"),
+	h: BigInt(1),
+	lowS: false
+}, sha256);
+/** @access private */
+var Fp$1 = Field(BigInt("0x8cb91e82a3386d280f5d6f7e50e641df152f7109ed5456b412b1da197fb71123acd3a729901d1a71874700133107ec53"));
+var brainpoolP384r1 = createCurve({
+	a: Fp$1.create(BigInt("0x7bc382c63d8c150c3c72080ace05afa0c2bea28e4fb22787139165efba91f90f8aa5814a503ad4eb04a8c7dd22ce2826")),
+	b: BigInt("0x04a8c7dd22ce28268b39b55416f0447c2fb77de107dcd2a62e880ea53eeb62d57cb4390295dbc9943ab78696fa504c11"),
+	Fp: Fp$1,
+	n: BigInt("0x8cb91e82a3386d280f5d6f7e50e641df152f7109ed5456b31f166e6cac0425a7cf3ab6af6b7fc3103b883202e9046565"),
+	Gx: BigInt("0x1d1c64f068cf45ffa2a63a81b7c13f6b8847a3e77ef14fe3db7fcafe0cbd10e8e826e03436d646aaef87b2e247d4af1e"),
+	Gy: BigInt("0x8abe1d7520f9c2a45cb1eb8e95cfd55262b70b29feec5864e19c054ff99129280e4646217791811142820341263c5315"),
+	h: BigInt(1),
+	lowS: false
+}, sha384);
+/** @access private */
+var Fp = Field(BigInt("0xaadd9db8dbe9c48b3fd4e6ae33c9fc07cb308db3b3c9d20ed6639cca703308717d4d9b009bc66842aecda12ae6a380e62881ff2f2d82c68528aa6056583a48f3"));
+var brainpoolP512r1 = createCurve({
+	a: Fp.create(BigInt("0x7830a3318b603b89e2327145ac234cc594cbdd8d3df91610a83441caea9863bc2ded5d5aa8253aa10a2ef1c98b9ac8b57f1117a72bf2c7b9e7c1ac4d77fc94ca")),
+	b: BigInt("0x3df91610a83441caea9863bc2ded5d5aa8253aa10a2ef1c98b9ac8b57f1117a72bf2c7b9e7c1ac4d77fc94cadc083e67984050b75ebae5dd2809bd638016f723"),
+	Fp,
+	n: BigInt("0xaadd9db8dbe9c48b3fd4e6ae33c9fc07cb308db3b3c9d20ed6639cca70330870553e5c414ca92619418661197fac10471db1d381085ddaddb58796829ca90069"),
+	Gx: BigInt("0x81aee4bdd82ed9645a21322e9c4c6a9385ed9f70b5d916c1b43b62eef4d0098eff3b1f78e2d0d48d50d1687b93b97d5f7c6d5047406a5e688b352209bcb9f822"),
+	Gy: BigInt("0x7dde385d566332ecc0eabfa9cf7822fdf209f70024a57b1aa000c55b881f8111b2dcde494a5f485e5bca4bd88a2763aed1ca2b2fa8f0540678cd1e0f3ad80892"),
+	h: BigInt(1),
+	lowS: false
+}, sha512);
+/**
+* @access private
+* This file is needed to dynamic import the noble-curves.
+* Separate dynamic imports are not convenient as they result in too many chunks,
+* which share a lot of code anyway.
+*/
+var nobleCurves = new Map(Object.entries({
+	nistP256: p256,
+	nistP384: p384,
+	nistP521: p521,
+	brainpoolP256r1,
+	brainpoolP384r1,
+	brainpoolP512r1,
+	secp256k1,
+	x448,
+	ed448
+}));
+//#endregion
+export { nobleCurves };
+
+//# sourceMappingURL=noble_curves-DDWn5AH0.js.map