@chainflip/processor 2.1.0-beta.1 → 2.1.0-beta.3

package/dist/node_modules/.pnpm/@noble_curves@1.9.7/node_modules/@noble/curves/esm/abstract/weierstrass.mjs

@@ -1,1194 +0,0 @@
-import { ahash, bytesToHex, concatBytes, hexToBytes, isBytes, randomBytes } from "../../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/utils.mjs";
-import { hmac } from "../../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/hmac.mjs";
-import { _abool2, _abytes2, _validateObject, aInRange, bitLen, bitMask, bytesToNumberBE, createHmacDrbg, ensureBytes, memoized, numberToHexUnpadded } from "../utils.mjs";
-import { Field, FpInvertBatch, getMinHashLength, mapHashToField, nLength, validateField } from "./modular.mjs";
-import { _createCurveFields, mulEndoUnsafe, negateCt, normalizeZ, pippenger, wNAF } from "./curve.mjs";
-
-//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/abstract/weierstrass.js
-/**
-* Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.
-*
-* ### Design rationale for types
-*
-* * Interaction between classes from different curves should fail:
-*   `k256.Point.BASE.add(p256.Point.BASE)`
-* * For this purpose we want to use `instanceof` operator, which is fast and works during runtime
-* * Different calls of `curve()` would return different classes -
-*   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,
-*   it won't affect others
-*
-* TypeScript can't infer types for classes created inside a function. Classes is one instance
-* of nominative types in TypeScript and interfaces only check for shape, so it's hard to create
-* unique type for every function call.
-*
-* We can use generic types via some param, like curve opts, but that would:
-*     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)
-*     which is hard to debug.
-*     2. Params can be generic and we can't enforce them to be constant value:
-*     if somebody creates curve from non-constant params,
-*     it would be allowed to interact with other curves with non-constant params
-*
-* @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol
-* @module
-*/
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const divNearest = (num, den) => (num + (num >= 0 ? den : -den) / _2n) / den;
-/**
-* Splits scalar for GLV endomorphism.
-*/
-function _splitEndoScalar(k, basis, n) {
-	const [[a1, b1], [a2, b2]] = basis;
-	const c1 = divNearest(b2 * k, n);
-	const c2 = divNearest(-b1 * k, n);
-	let k1 = k - c1 * a1 - c2 * a2;
-	let k2 = -c1 * b1 - c2 * b2;
-	const k1neg = k1 < _0n;
-	const k2neg = k2 < _0n;
-	if (k1neg) k1 = -k1;
-	if (k2neg) k2 = -k2;
-	const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n;
-	if (k1 < _0n || k1 >= MAX_NUM || k2 < _0n || k2 >= MAX_NUM) throw new Error("splitScalar (endomorphism): failed, k=" + k);
-	return {
-		k1neg,
-		k1,
-		k2neg,
-		k2
-	};
-}
-function validateSigFormat(format) {
-	if (![
-		"compact",
-		"recovered",
-		"der"
-	].includes(format)) throw new Error("Signature format must be \"compact\", \"recovered\", or \"der\"");
-	return format;
-}
-function validateSigOpts(opts, def) {
-	const optsn = {};
-	for (let optName of Object.keys(def)) optsn[optName] = opts[optName] === void 0 ? def[optName] : opts[optName];
-	_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
-*/
-const DER = {
-	Err: DERErr,
-	_tlv: {
-		encode: (tag, data) => {
-			const { Err: E } = DER;
-			if (tag < 0 || tag > 256) throw new E("tlv.encode: wrong tag");
-			if (data.length & 1) throw new E("tlv.encode: unpadded data");
-			const dataLen = data.length / 2;
-			const len = numberToHexUnpadded(dataLen);
-			if (len.length / 2 & 128) throw new E("tlv.encode: long form length too big");
-			const lenLen = dataLen > 127 ? numberToHexUnpadded(len.length / 2 | 128) : "";
-			return numberToHexUnpadded(tag) + lenLen + len + data;
-		},
-		decode(tag, data) {
-			const { Err: E } = DER;
-			let pos = 0;
-			if (tag < 0 || tag > 256) throw new E("tlv.encode: wrong tag");
-			if (data.length < 2 || data[pos++] !== tag) throw new E("tlv.decode: wrong tlv");
-			const first = data[pos++];
-			const isLong = !!(first & 128);
-			let length = 0;
-			if (!isLong) length = first;
-			else {
-				const lenLen = first & 127;
-				if (!lenLen) throw new E("tlv.decode(long): indefinite length not supported");
-				if (lenLen > 4) throw new E("tlv.decode(long): byte length is too big");
-				const lengthBytes = data.subarray(pos, pos + lenLen);
-				if (lengthBytes.length !== lenLen) throw new E("tlv.decode: length bytes not complete");
-				if (lengthBytes[0] === 0) throw new E("tlv.decode(long): zero leftmost byte");
-				for (const b of lengthBytes) length = length << 8 | b;
-				pos += lenLen;
-				if (length < 128) throw new E("tlv.decode(long): not minimal encoding");
-			}
-			const v = data.subarray(pos, pos + length);
-			if (v.length !== length) throw new E("tlv.decode: wrong value length");
-			return {
-				v,
-				l: data.subarray(pos + length)
-			};
-		}
-	},
-	_int: {
-		encode(num) {
-			const { Err: E } = DER;
-			if (num < _0n) throw new E("integer: negative integers are not allowed");
-			let hex = numberToHexUnpadded(num);
-			if (Number.parseInt(hex[0], 16) & 8) hex = "00" + hex;
-			if (hex.length & 1) throw new E("unexpected DER parsing assertion: unpadded hex");
-			return hex;
-		},
-		decode(data) {
-			const { Err: E } = DER;
-			if (data[0] & 128) throw new E("invalid signature integer: negative");
-			if (data[0] === 0 && !(data[1] & 128)) throw new E("invalid signature integer: unnecessary leading zero");
-			return bytesToNumberBE(data);
-		}
-	},
-	toSig(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);
-	}
-};
-const _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);
-function _normFnElement(Fn, key) {
-	const { BYTES: expected } = Fn;
-	let num;
-	if (typeof key === "bigint") num = key;
-	else {
-		let bytes = ensureBytes("private key", key);
-		try {
-			num = Fn.fromBytes(bytes);
-		} catch (error) {
-			throw new Error(`invalid private key: expected ui8a of size ${expected}, got ${typeof key}`);
-		}
-	}
-	if (!Fn.isValidNot0(num)) throw new Error("invalid private key: out of range [1..N-1]");
-	return num;
-}
-/**
-* Creates weierstrass Point constructor, based on specified curve options.
-*
-* @example
-```js
-const opts = {
-p: BigInt('0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff'),
-n: BigInt('0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551'),
-h: BigInt(1),
-a: BigInt('0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc'),
-b: BigInt('0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b'),
-Gx: BigInt('0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296'),
-Gy: BigInt('0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5'),
-};
-const p256_Point = weierstrass(opts);
-```
-*/
-function weierstrassN(params, extraOpts = {}) {
-	const validated = _createCurveFields("weierstrass", params, extraOpts);
-	const { Fp, Fn } = validated;
-	let CURVE = validated.CURVE;
-	const { h: cofactor, n: CURVE_ORDER } = CURVE;
-	_validateObject(extraOpts, {}, {
-		allowInfinityPoint: "boolean",
-		clearCofactor: "function",
-		isTorsionFree: "function",
-		fromBytes: "function",
-		toBytes: "function",
-		endo: "object",
-		wrapPrivateKey: "boolean"
-	});
-	const { endo } = extraOpts;
-	if (endo) {
-		if (!Fp.is0(CURVE.a) || typeof endo.beta !== "bigint" || !Array.isArray(endo.basises)) throw new Error("invalid endo: expected \"beta\": bigint and \"basises\": array");
-	}
-	const lengths = getWLengths(Fp, Fn);
-	function assertCompressionIsSupported() {
-		if (!Fp.isOdd) throw new Error("compression is not supported: Field does not have .isOdd()");
-	}
-	function pointToBytes(_c, point, isCompressed) {
-		const { x, y } = point.toAffine();
-		const bx = Fp.toBytes(x);
-		_abool2(isCompressed, "isCompressed");
-		if (isCompressed) {
-			assertCompressionIsSupported();
-			return concatBytes(pprefix(!Fp.isOdd(y)), bx);
-		} else return concatBytes(Uint8Array.of(4), bx, Fp.toBytes(y));
-	}
-	function pointFromBytes(bytes) {
-		_abytes2(bytes, void 0, "Point");
-		const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths;
-		const length = bytes.length;
-		const head = bytes[0];
-		const tail = bytes.subarray(1);
-		if (length === comp && (head === 2 || head === 3)) {
-			const x = Fp.fromBytes(tail);
-			if (!Fp.isValid(x)) throw new Error("bad point: is not on curve, wrong x");
-			const y2 = weierstrassEquation(x);
-			let y;
-			try {
-				y = Fp.sqrt(y2);
-			} catch (sqrtError) {
-				const err = sqrtError instanceof Error ? ": " + sqrtError.message : "";
-				throw new Error("bad point: is not on curve, sqrt error" + err);
-			}
-			assertCompressionIsSupported();
-			const isYOdd = Fp.isOdd(y);
-			if ((head & 1) === 1 !== isYOdd) y = Fp.neg(y);
-			return {
-				x,
-				y
-			};
-		} else if (length === uncomp && head === 4) {
-			const L = Fp.BYTES;
-			const x = Fp.fromBytes(tail.subarray(0, L));
-			const y = Fp.fromBytes(tail.subarray(L, L * 2));
-			if (!isValidXY(x, y)) throw new Error("bad point: is not on curve");
-			return {
-				x,
-				y
-			};
-		} else throw new Error(`bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`);
-	}
-	const encodePoint = extraOpts.toBytes || pointToBytes;
-	const decodePoint = extraOpts.fromBytes || pointFromBytes;
-	function weierstrassEquation(x) {
-		const x2 = Fp.sqr(x);
-		const x3 = Fp.mul(x2, x);
-		return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b);
-	}
-	/** Checks whether equation holds for given x, y: y² == x³ + ax + b */
-	function isValidXY(x, y) {
-		const left = Fp.sqr(y);
-		const right = weierstrassEquation(x);
-		return Fp.eql(left, right);
-	}
-	if (!isValidXY(CURVE.Gx, CURVE.Gy)) throw new Error("bad curve params: generator point");
-	const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);
-	const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));
-	if (Fp.is0(Fp.add(_4a3, _27b2))) throw new Error("bad curve params: a or b");
-	/** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */
-	function acoord(title, n, banZero = false) {
-		if (!Fp.isValid(n) || banZero && Fp.is0(n)) throw new Error(`bad point coordinate ${title}`);
-		return n;
-	}
-	function aprjpoint(other) {
-		if (!(other instanceof Point)) throw new Error("ProjectivePoint expected");
-	}
-	function splitEndoScalarN(k) {
-		if (!endo || !endo.basises) throw new Error("no endo");
-		return _splitEndoScalar(k, endo.basises, Fn.ORDER);
-	}
-	const toAffineMemo = memoized((p, iz) => {
-		const { X, Y, Z } = p;
-		if (Fp.eql(Z, Fp.ONE)) return {
-			x: X,
-			y: Y
-		};
-		const is0 = p.is0();
-		if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(Z);
-		const x = Fp.mul(X, iz);
-		const y = Fp.mul(Y, iz);
-		const zz = Fp.mul(Z, iz);
-		if (is0) return {
-			x: Fp.ZERO,
-			y: Fp.ZERO
-		};
-		if (!Fp.eql(zz, Fp.ONE)) throw new Error("invZ was invalid");
-		return {
-			x,
-			y
-		};
-	});
-	const assertValidMemo = memoized((p) => {
-		if (p.is0()) {
-			if (extraOpts.allowInfinityPoint && !Fp.is0(p.Y)) return;
-			throw new Error("bad point: ZERO");
-		}
-		const { x, y } = p.toAffine();
-		if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error("bad point: x or y not field elements");
-		if (!isValidXY(x, y)) throw new Error("bad point: equation left != right");
-		if (!p.isTorsionFree()) throw new Error("bad point: not in prime-order subgroup");
-		return true;
-	});
-	function finishEndo(endoBeta, k1p, k2p, k1neg, k2neg) {
-		k2p = new Point(Fp.mul(k2p.X, endoBeta), k2p.Y, k2p.Z);
-		k1p = negateCt(k1neg, k1p);
-		k2p = negateCt(k2neg, k2p);
-		return k1p.add(k2p);
-	}
-	/**
-	* Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) ∋ (x=X/Z, y=Y/Z).
-	* Default Point works in 2d / affine coordinates: (x, y).
-	* We're doing calculations in projective, because its operations don't require costly inversion.
-	*/
-	class Point {
-		/** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-		constructor(X, Y, Z) {
-			this.X = acoord("x", X);
-			this.Y = acoord("y", Y, true);
-			this.Z = acoord("z", Z);
-			Object.freeze(this);
-		}
-		static CURVE() {
-			return CURVE;
-		}
-		/** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-		static fromAffine(p) {
-			const { x, y } = p || {};
-			if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error("invalid affine point");
-			if (p instanceof Point) throw new Error("projective point not allowed");
-			if (Fp.is0(x) && Fp.is0(y)) return Point.ZERO;
-			return new Point(x, y, Fp.ONE);
-		}
-		static fromBytes(bytes) {
-			const P = Point.fromAffine(decodePoint(_abytes2(bytes, void 0, "point")));
-			P.assertValidity();
-			return P;
-		}
-		static fromHex(hex) {
-			return Point.fromBytes(ensureBytes("pointHex", hex));
-		}
-		get x() {
-			return this.toAffine().x;
-		}
-		get y() {
-			return this.toAffine().y;
-		}
-		/**
-		*
-		* @param windowSize
-		* @param isLazy true will defer table computation until the first multiplication
-		* @returns
-		*/
-		precompute(windowSize = 8, isLazy = true) {
-			wnaf.createCache(this, windowSize);
-			if (!isLazy) this.multiply(_3n);
-			return this;
-		}
-		/** A point on curve is valid if it conforms to equation. */
-		assertValidity() {
-			assertValidMemo(this);
-		}
-		hasEvenY() {
-			const { y } = this.toAffine();
-			if (!Fp.isOdd) throw new Error("Field doesn't support isOdd");
-			return !Fp.isOdd(y);
-		}
-		/** Compare one point to another. */
-		equals(other) {
-			aprjpoint(other);
-			const { X: X1, Y: Y1, Z: Z1 } = this;
-			const { X: X2, Y: Y2, Z: Z2 } = other;
-			const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));
-			const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));
-			return U1 && U2;
-		}
-		/** Flips point to one corresponding to (x, -y) in Affine coordinates. */
-		negate() {
-			return new Point(this.X, Fp.neg(this.Y), this.Z);
-		}
-		double() {
-			const { a, b } = CURVE;
-			const b3 = Fp.mul(b, _3n);
-			const { X: X1, Y: Y1, Z: Z1 } = this;
-			let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO;
-			let t0 = Fp.mul(X1, X1);
-			let t1 = Fp.mul(Y1, Y1);
-			let t2 = Fp.mul(Z1, Z1);
-			let t3 = Fp.mul(X1, Y1);
-			t3 = Fp.add(t3, t3);
-			Z3 = Fp.mul(X1, Z1);
-			Z3 = Fp.add(Z3, Z3);
-			X3 = Fp.mul(a, Z3);
-			Y3 = Fp.mul(b3, t2);
-			Y3 = Fp.add(X3, Y3);
-			X3 = Fp.sub(t1, Y3);
-			Y3 = Fp.add(t1, Y3);
-			Y3 = Fp.mul(X3, Y3);
-			X3 = Fp.mul(t3, X3);
-			Z3 = Fp.mul(b3, Z3);
-			t2 = Fp.mul(a, t2);
-			t3 = Fp.sub(t0, t2);
-			t3 = Fp.mul(a, t3);
-			t3 = Fp.add(t3, Z3);
-			Z3 = Fp.add(t0, t0);
-			t0 = Fp.add(Z3, t0);
-			t0 = Fp.add(t0, t2);
-			t0 = Fp.mul(t0, t3);
-			Y3 = Fp.add(Y3, t0);
-			t2 = Fp.mul(Y1, Z1);
-			t2 = Fp.add(t2, t2);
-			t0 = Fp.mul(t2, t3);
-			X3 = Fp.sub(X3, t0);
-			Z3 = Fp.mul(t2, t1);
-			Z3 = Fp.add(Z3, Z3);
-			Z3 = Fp.add(Z3, Z3);
-			return new Point(X3, Y3, Z3);
-		}
-		add(other) {
-			aprjpoint(other);
-			const { X: X1, Y: Y1, Z: Z1 } = this;
-			const { X: X2, Y: Y2, Z: Z2 } = other;
-			let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO;
-			const a = CURVE.a;
-			const b3 = Fp.mul(CURVE.b, _3n);
-			let t0 = Fp.mul(X1, X2);
-			let t1 = Fp.mul(Y1, Y2);
-			let t2 = Fp.mul(Z1, Z2);
-			let t3 = Fp.add(X1, Y1);
-			let t4 = Fp.add(X2, Y2);
-			t3 = Fp.mul(t3, t4);
-			t4 = Fp.add(t0, t1);
-			t3 = Fp.sub(t3, t4);
-			t4 = Fp.add(X1, Z1);
-			let t5 = Fp.add(X2, Z2);
-			t4 = Fp.mul(t4, t5);
-			t5 = Fp.add(t0, t2);
-			t4 = Fp.sub(t4, t5);
-			t5 = Fp.add(Y1, Z1);
-			X3 = Fp.add(Y2, Z2);
-			t5 = Fp.mul(t5, X3);
-			X3 = Fp.add(t1, t2);
-			t5 = Fp.sub(t5, X3);
-			Z3 = Fp.mul(a, t4);
-			X3 = Fp.mul(b3, t2);
-			Z3 = Fp.add(X3, Z3);
-			X3 = Fp.sub(t1, Z3);
-			Z3 = Fp.add(t1, Z3);
-			Y3 = Fp.mul(X3, Z3);
-			t1 = Fp.add(t0, t0);
-			t1 = Fp.add(t1, t0);
-			t2 = Fp.mul(a, t2);
-			t4 = Fp.mul(b3, t4);
-			t1 = Fp.add(t1, t2);
-			t2 = Fp.sub(t0, t2);
-			t2 = Fp.mul(a, t2);
-			t4 = Fp.add(t4, t2);
-			t0 = Fp.mul(t1, t4);
-			Y3 = Fp.add(Y3, t0);
-			t0 = Fp.mul(t5, t4);
-			X3 = Fp.mul(t3, X3);
-			X3 = Fp.sub(X3, t0);
-			t0 = Fp.mul(t3, t1);
-			Z3 = Fp.mul(t5, Z3);
-			Z3 = Fp.add(Z3, t0);
-			return new Point(X3, Y3, Z3);
-		}
-		subtract(other) {
-			return this.add(other.negate());
-		}
-		is0() {
-			return this.equals(Point.ZERO);
-		}
-		/**
-		* Constant time multiplication.
-		* Uses wNAF method. Windowed method may be 10% faster,
-		* but takes 2x longer to generate and consumes 2x memory.
-		* Uses precomputes when available.
-		* Uses endomorphism for Koblitz curves.
-		* @param scalar by which the point would be multiplied
-		* @returns New point
-		*/
-		multiply(scalar) {
-			const { endo } = extraOpts;
-			if (!Fn.isValidNot0(scalar)) throw new Error("invalid scalar: out of range");
-			let point, fake;
-			const mul = (n) => wnaf.cached(this, n, (p) => normalizeZ(Point, p));
-			/** See docs for {@link EndomorphismOpts} */
-			if (endo) {
-				const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(scalar);
-				const { p: k1p, f: k1f } = mul(k1);
-				const { p: k2p, f: k2f } = mul(k2);
-				fake = k1f.add(k2f);
-				point = finishEndo(endo.beta, k1p, k2p, k1neg, k2neg);
-			} else {
-				const { p, f } = mul(scalar);
-				point = p;
-				fake = f;
-			}
-			return normalizeZ(Point, [point, fake])[0];
-		}
-		/**
-		* Non-constant-time multiplication. Uses double-and-add algorithm.
-		* It's faster, but should only be used when you don't care about
-		* an exposed secret key e.g. sig verification, which works over *public* keys.
-		*/
-		multiplyUnsafe(sc) {
-			const { endo } = extraOpts;
-			const p = this;
-			if (!Fn.isValid(sc)) throw new Error("invalid scalar: out of range");
-			if (sc === _0n || p.is0()) return Point.ZERO;
-			if (sc === _1n) return p;
-			if (wnaf.hasCache(this)) return this.multiply(sc);
-			if (endo) {
-				const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(sc);
-				const { p1, p2 } = mulEndoUnsafe(Point, p, k1, k2);
-				return finishEndo(endo.beta, p1, p2, k1neg, k2neg);
-			} else return wnaf.unsafe(p, sc);
-		}
-		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) return true;
-			if (isTorsionFree) return isTorsionFree(Point, this);
-			return wnaf.unsafe(this, CURVE_ORDER).is0();
-		}
-		clearCofactor() {
-			const { clearCofactor } = extraOpts;
-			if (cofactor === _1n) return this;
-			if (clearCofactor) return clearCofactor(Point, this);
-			return this.multiplyUnsafe(cofactor);
-		}
-		isSmallOrder() {
-			return this.multiplyUnsafe(cofactor).is0();
-		}
-		toBytes(isCompressed = true) {
-			_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);
-}
-/**
-* Implementation of the Shallue and van de Woestijne method for any weierstrass curve.
-* TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.
-* b = True and y = sqrt(u / v) if (u / v) is square in F, and
-* b = False and y = sqrt(Z * (u / v)) otherwise.
-* @param Fp
-* @param Z
-* @returns
-*/
-function SWUFpSqrtRatio(Fp, Z) {
-	const q = Fp.ORDER;
-	let l = _0n;
-	for (let o = q - _1n; o % _2n === _0n; o /= _2n) l += _1n;
-	const c1 = l;
-	const _2n_pow_c1_1 = _2n << c1 - _1n - _1n;
-	const _2n_pow_c1 = _2n_pow_c1_1 * _2n;
-	const c2 = (q - _1n) / _2n_pow_c1;
-	const c3 = (c2 - _1n) / _2n;
-	const c4 = _2n_pow_c1 - _1n;
-	const c5 = _2n_pow_c1_1;
-	const c6 = Fp.pow(Z, c2);
-	const c7 = Fp.pow(Z, (c2 + _1n) / _2n);
-	let sqrtRatio = (u, v) => {
-		let tv1 = c6;
-		let tv2 = Fp.pow(v, c4);
-		let tv3 = Fp.sqr(tv2);
-		tv3 = Fp.mul(tv3, v);
-		let tv5 = Fp.mul(u, tv3);
-		tv5 = Fp.pow(tv5, c3);
-		tv5 = Fp.mul(tv5, tv2);
-		tv2 = Fp.mul(tv5, v);
-		tv3 = Fp.mul(tv5, u);
-		let tv4 = Fp.mul(tv3, tv2);
-		tv5 = Fp.pow(tv4, c5);
-		let isQR = Fp.eql(tv5, Fp.ONE);
-		tv2 = Fp.mul(tv3, c7);
-		tv5 = Fp.mul(tv4, tv1);
-		tv3 = Fp.cmov(tv2, tv3, isQR);
-		tv4 = Fp.cmov(tv5, tv4, isQR);
-		for (let i = c1; i > _1n; i--) {
-			let tv5 = i - _2n;
-			tv5 = _2n << tv5 - _1n;
-			let tvv5 = Fp.pow(tv4, tv5);
-			const e1 = Fp.eql(tvv5, Fp.ONE);
-			tv2 = Fp.mul(tv3, tv1);
-			tv1 = Fp.mul(tv1, tv1);
-			tvv5 = Fp.mul(tv4, tv1);
-			tv3 = Fp.cmov(tv2, tv3, e1);
-			tv4 = Fp.cmov(tvv5, tv4, e1);
-		}
-		return {
-			isValid: isQR,
-			value: tv3
-		};
-	};
-	if (Fp.ORDER % _4n === _3n) {
-		const c1 = (Fp.ORDER - _3n) / _4n;
-		const c2 = Fp.sqrt(Fp.neg(Z));
-		sqrtRatio = (u, v) => {
-			let tv1 = Fp.sqr(v);
-			const tv2 = Fp.mul(u, v);
-			tv1 = Fp.mul(tv1, tv2);
-			let y1 = Fp.pow(tv1, c1);
-			y1 = Fp.mul(y1, tv2);
-			const y2 = Fp.mul(y1, c2);
-			const tv3 = Fp.mul(Fp.sqr(y1), v);
-			const isQR = Fp.eql(tv3, u);
-			return {
-				isValid: isQR,
-				value: Fp.cmov(y2, y1, isQR)
-			};
-		};
-	}
-	return sqrtRatio;
-}
-/**
-* Simplified Shallue-van de Woestijne-Ulas Method
-* https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2
-*/
-function mapToCurveSimpleSWU(Fp, opts) {
-	validateField(Fp);
-	const { A, B, Z } = opts;
-	if (!Fp.isValid(A) || !Fp.isValid(B) || !Fp.isValid(Z)) throw new Error("mapToCurveSimpleSWU: invalid opts");
-	const sqrtRatio = SWUFpSqrtRatio(Fp, Z);
-	if (!Fp.isOdd) throw new Error("Field does not have .isOdd()");
-	return (u) => {
-		let tv1, tv2, tv3, tv4, tv5, tv6, x, y;
-		tv1 = Fp.sqr(u);
-		tv1 = Fp.mul(tv1, Z);
-		tv2 = Fp.sqr(tv1);
-		tv2 = Fp.add(tv2, tv1);
-		tv3 = Fp.add(tv2, Fp.ONE);
-		tv3 = Fp.mul(tv3, B);
-		tv4 = Fp.cmov(Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO));
-		tv4 = Fp.mul(tv4, A);
-		tv2 = Fp.sqr(tv3);
-		tv6 = Fp.sqr(tv4);
-		tv5 = Fp.mul(tv6, A);
-		tv2 = Fp.add(tv2, tv5);
-		tv2 = Fp.mul(tv2, tv3);
-		tv6 = Fp.mul(tv6, tv4);
-		tv5 = Fp.mul(tv6, B);
-		tv2 = Fp.add(tv2, tv5);
-		x = Fp.mul(tv1, tv3);
-		const { isValid, value } = sqrtRatio(tv2, tv6);
-		y = Fp.mul(tv1, u);
-		y = Fp.mul(y, value);
-		x = Fp.cmov(x, tv3, isValid);
-		y = Fp.cmov(y, value, isValid);
-		const e1 = Fp.isOdd(u) === Fp.isOdd(y);
-		y = Fp.cmov(Fp.neg(y), y, e1);
-		const tv4_inv = FpInvertBatch(Fp, [tv4], true)[0];
-		x = Fp.mul(x, tv4_inv);
-		return {
-			x,
-			y
-		};
-	};
-}
-function getWLengths(Fp, Fn) {
-	return {
-		secretKey: Fn.BYTES,
-		publicKey: 1 + Fp.BYTES,
-		publicKeyUncompressed: 1 + 2 * Fp.BYTES,
-		publicKeyHasPrefix: true,
-		signature: 2 * Fn.BYTES
-	};
-}
-/**
-* Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.
-* This helper ensures no signature functionality is present. Less code, smaller bundle size.
-*/
-function ecdh(Point, ecdhOpts = {}) {
-	const { Fn } = Point;
-	const randomBytes_ = ecdhOpts.randomBytes || randomBytes;
-	const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });
-	function isValidSecretKey(secretKey) {
-		try {
-			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);
-	}
-	const utils = {
-		isValidSecretKey,
-		isValidPublicKey,
-		randomSecretKey,
-		isValidPrivateKey: isValidSecretKey,
-		randomPrivateKey: randomSecretKey,
-		normPrivateKeyToScalar: (key) => _normFnElement(Fn, key),
-		precompute(windowSize = 8, point = Point.BASE) {
-			return point.precompute(windowSize, false);
-		}
-	};
-	return Object.freeze({
-		getPublicKey,
-		getSharedSecret,
-		keygen,
-		Point,
-		utils,
-		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;
-	}
-	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 < 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, 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) return;
-			const s = Fn.create(ik * Fn.create(m + r * d));
-			if (s === _0n) return;
-			let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n);
-			let normS = s;
-			if (lowS && isBiggerThanHalfOrder(s)) {
-				normS = Fn.neg(s);
-				recovery ^= 1;
-			}
-			return new Signature(r, normS, recovery);
-		}
-		return {
-			seed,
-			k2sig
-		};
-	}
-	/**
-	* Signs message hash with a secret key.
-	*
-	* ```
-	* sign(m, d) where
-	*   k = rfc6979_hmac_drbg(m, d)
-	*   (x, y) = G × k
-	*   r = x mod n
-	*   s = (m + dr) / k mod n
-	* ```
-	*/
-	function sign(message, secretKey, opts = {}) {
-		message = ensureBytes("message", message);
-		const { seed, k2sig } = prepSig(message, secretKey, opts);
-		return createHmacDrbg(hash.outputLen, Fn.BYTES, hmac$1)(seed, k2sig);
-	}
-	function tryParsingSig(sg) {
-		let sig = void 0;
-		const isHex = typeof sg === "string" || isBytes(sg);
-		const isObj = !isHex && sg !== null && typeof sg === "object" && typeof sg.r === "bigint" && typeof sg.s === "bigint";
-		if (!isHex && !isObj) throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-		if (isObj) sig = new Signature(sg.r, sg.s);
-		else if (isHex) {
-			try {
-				sig = Signature.fromBytes(ensureBytes("sig", sg), "der");
-			} catch (derError) {
-				if (!(derError instanceof DER.Err)) throw derError;
-			}
-			if (!sig) try {
-				sig = Signature.fromBytes(ensureBytes("sig", sg), "compact");
-			} catch (error) {
-				return false;
-			}
-		}
-		if (!sig) return false;
-		return sig;
-	}
-	/**
-	* Verifies a signature against message and public key.
-	* Rejects lowS signatures by default: see {@link ECDSAVerifyOpts}.
-	* Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:
-	*
-	* ```
-	* verify(r, s, h, P) where
-	*   u1 = hs^-1 mod n
-	*   u2 = rs^-1 mod n
-	*   R = u1⋅G + u2⋅P
-	*   mod(R.x, n) == r
-	* ```
-	*/
-	function verify(signature, message, publicKey, opts = {}) {
-		const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);
-		publicKey = ensureBytes("publicKey", publicKey);
-		message = validateMsgAndHash(ensureBytes("message", message), prehash);
-		if ("strict" in opts) throw new Error("options.strict was renamed to lowS");
-		const sig = format === void 0 ? tryParsingSig(signature) : Signature.fromBytes(ensureBytes("sig", signature), format);
-		if (sig === false) return false;
-		try {
-			const P = Point.fromBytes(publicKey);
-			if (lowS && sig.hasHighS()) return false;
-			const { r, s } = sig;
-			const h = bits2int_modN(message);
-			const is = Fn.inv(s);
-			const u1 = Fn.create(h * is);
-			const u2 = Fn.create(r * is);
-			const R = Point.BASE.multiplyUnsafe(u1).add(P.multiplyUnsafe(u2));
-			if (R.is0()) return false;
-			return Fn.create(R.x) === r;
-		} catch (e) {
-			return false;
-		}
-	}
-	function recoverPublicKey(signature, message, opts = {}) {
-		const { prehash } = validateSigOpts(opts, defaultSigOpts);
-		message = validateMsgAndHash(message, prehash);
-		return Signature.fromBytes(signature, "recovered").recoverPublicKey(message).toBytes();
-	}
-	return Object.freeze({
-		keygen,
-		getPublicKey,
-		getSharedSecret,
-		utils,
-		lengths,
-		Point,
-		sign,
-		verify,
-		recoverPublicKey,
-		Signature,
-		hash
-	});
-}
-function _weierstrass_legacy_opts_to_new(c) {
-	const CURVE = {
-		a: c.a,
-		b: c.b,
-		p: c.Fp.ORDER,
-		n: c.n,
-		h: c.h,
-		Gx: c.Gx,
-		Gy: c.Gy
-	};
-	const Fp = c.Fp;
-	let allowedLengths = c.allowedPrivateKeyLengths ? Array.from(new Set(c.allowedPrivateKeyLengths.map((l) => Math.ceil(l / 2)))) : void 0;
-	return {
-		CURVE,
-		curveOpts: {
-			Fp,
-			Fn: Field(CURVE.n, {
-				BITS: c.nBitLength,
-				allowedLengths,
-				modFromBytes: c.wrapPrivateKey
-			}),
-			allowInfinityPoint: c.allowInfinityPoint,
-			endo: c.endo,
-			isTorsionFree: c.isTorsionFree,
-			clearCofactor: c.clearCofactor,
-			fromBytes: c.fromBytes,
-			toBytes: c.toBytes
-		}
-	};
-}
-function _ecdsa_legacy_opts_to_new(c) {
-	const { CURVE, curveOpts } = _weierstrass_legacy_opts_to_new(c);
-	const ecdsaOpts = {
-		hmac: c.hmac,
-		randomBytes: c.randomBytes,
-		lowS: c.lowS,
-		bits2int: c.bits2int,
-		bits2int_modN: c.bits2int_modN
-	};
-	return {
-		CURVE,
-		curveOpts,
-		hash: c.hash,
-		ecdsaOpts
-	};
-}
-function _ecdsa_new_output_to_legacy(c, _ecdsa) {
-	const Point = _ecdsa.Point;
-	return Object.assign({}, _ecdsa, {
-		ProjectivePoint: Point,
-		CURVE: Object.assign({}, c, nLength(Point.Fn.ORDER, Point.Fn.BITS))
-	});
-}
-function weierstrass(c) {
-	const { CURVE, curveOpts, hash, ecdsaOpts } = _ecdsa_legacy_opts_to_new(c);
-	return _ecdsa_new_output_to_legacy(c, ecdsa(weierstrassN(CURVE, curveOpts), hash, ecdsaOpts));
-}
-
-//#endregion
-export { mapToCurveSimpleSWU, weierstrass };