@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/secp256k1.cjs

@@ -1,119 +0,0 @@
-const require_sha2 = require('../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/sha2.cjs');
-const require_modular = require('./abstract/modular.cjs');
-const require_weierstrass = require('./abstract/weierstrass.cjs');
-const require__shortw_utils = require('./_shortw_utils.cjs');
-const require_hash_to_curve = require('./abstract/hash-to-curve.cjs');
-
-//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/secp256k1.js
-/**
-* SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).
-*
-* Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism ψ,
-* check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).
-* @module
-*/
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const secp256k1_CURVE = {
-	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
-	n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
-	h: BigInt(1),
-	a: BigInt(0),
-	b: BigInt(7),
-	Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
-	Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
-};
-const secp256k1_ENDO = {
-	beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-	basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
-};
-const _2n = /* @__PURE__ */ BigInt(2);
-/**
-* √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.
-* (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]
-*/
-function sqrtMod(y) {
-	const P = secp256k1_CURVE.p;
-	const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);
-	const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);
-	const b2 = y * y * y % P;
-	const b3 = b2 * b2 * y % P;
-	const b11 = require_modular.pow2(require_modular.pow2(require_modular.pow2(b3, _3n, P) * b3 % P, _3n, P) * b3 % P, _2n, P) * b2 % P;
-	const b22 = require_modular.pow2(b11, _11n, P) * b11 % P;
-	const b44 = require_modular.pow2(b22, _22n, P) * b22 % P;
-	const b88 = require_modular.pow2(b44, _44n, P) * b44 % P;
-	const root = require_modular.pow2(require_modular.pow2(require_modular.pow2(require_modular.pow2(require_modular.pow2(require_modular.pow2(b88, _88n, P) * b88 % P, _44n, P) * b44 % P, _3n, P) * b3 % P, _23n, P) * b22 % P, _6n, P) * b2 % P, _2n, P);
-	if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error("Cannot find square root");
-	return root;
-}
-const Fpk1 = require_modular.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;
-* ```
-*/
-const secp256k1 = require__shortw_utils.createCurve({
-	...secp256k1_CURVE,
-	Fp: Fpk1,
-	lowS: true,
-	endo: secp256k1_ENDO
-}, require_sha2.sha256);
-const Pointk1 = secp256k1.Point;
-const isoMap = require_hash_to_curve.isogenyMap(Fpk1, [
-	[
-		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7",
-		"0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581",
-		"0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262",
-		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"
-	],
-	[
-		"0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b",
-		"0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14",
-		"0x0000000000000000000000000000000000000000000000000000000000000001"
-	],
-	[
-		"0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c",
-		"0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3",
-		"0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931",
-		"0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"
-	],
-	[
-		"0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b",
-		"0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573",
-		"0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f",
-		"0x0000000000000000000000000000000000000000000000000000000000000001"
-	]
-].map((i) => i.map((j) => BigInt(j))));
-const mapSWU = require_weierstrass.mapToCurveSimpleSWU(Fpk1, {
-	A: BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),
-	B: BigInt("1771"),
-	Z: Fpk1.create(BigInt("-11"))
-});
-/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */
-const secp256k1_hasher = require_hash_to_curve.createHasher(secp256k1.Point, (scalars) => {
-	const { x, y } = mapSWU(Fpk1.create(scalars[0]));
-	return isoMap(x, y);
-}, {
-	DST: "secp256k1_XMD:SHA-256_SSWU_RO_",
-	encodeDST: "secp256k1_XMD:SHA-256_SSWU_NU_",
-	p: Fpk1.ORDER,
-	m: 1,
-	k: 128,
-	expand: "xmd",
-	hash: require_sha2.sha256
-});
-/** @deprecated use `import { secp256k1_hasher } from '@noble/curves/secp256k1.js';` */
-const hashToCurve = secp256k1_hasher.hashToCurve;
-/** @deprecated use `import { secp256k1_hasher } from '@noble/curves/secp256k1.js';` */
-const encodeToCurve = secp256k1_hasher.encodeToCurve;
-
-//#endregion
-exports.secp256k1 = secp256k1;

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

@@ -1,119 +0,0 @@
-import { sha256 } from "../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/sha2.mjs";
-import { Field, pow2 } from "./abstract/modular.mjs";
-import { mapToCurveSimpleSWU } from "./abstract/weierstrass.mjs";
-import { createCurve } from "./_shortw_utils.mjs";
-import { createHasher, isogenyMap } from "./abstract/hash-to-curve.mjs";
-
-//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/secp256k1.js
-/**
-* SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).
-*
-* Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism ψ,
-* check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).
-* @module
-*/
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const secp256k1_CURVE = {
-	p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
-	n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
-	h: BigInt(1),
-	a: BigInt(0),
-	b: BigInt(7),
-	Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
-	Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
-};
-const secp256k1_ENDO = {
-	beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-	basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
-};
-const _2n = /* @__PURE__ */ BigInt(2);
-/**
-* √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.
-* (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]
-*/
-function sqrtMod(y) {
-	const P = secp256k1_CURVE.p;
-	const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);
-	const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);
-	const b2 = y * y * y % P;
-	const b3 = b2 * b2 * y % P;
-	const b11 = pow2(pow2(pow2(b3, _3n, P) * b3 % P, _3n, P) * b3 % P, _2n, P) * b2 % P;
-	const b22 = pow2(b11, _11n, P) * b11 % P;
-	const b44 = pow2(b22, _22n, P) * b22 % P;
-	const b88 = pow2(b44, _44n, P) * b44 % P;
-	const root = pow2(pow2(pow2(pow2(pow2(pow2(b88, _88n, P) * b88 % P, _44n, P) * b44 % P, _3n, P) * b3 % P, _23n, P) * b22 % P, _6n, P) * b2 % P, _2n, P);
-	if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error("Cannot find square root");
-	return root;
-}
-const Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });
-/**
-* 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;
-* ```
-*/
-const secp256k1 = createCurve({
-	...secp256k1_CURVE,
-	Fp: Fpk1,
-	lowS: true,
-	endo: secp256k1_ENDO
-}, sha256);
-const Pointk1 = secp256k1.Point;
-const isoMap = isogenyMap(Fpk1, [
-	[
-		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7",
-		"0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581",
-		"0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262",
-		"0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c"
-	],
-	[
-		"0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b",
-		"0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14",
-		"0x0000000000000000000000000000000000000000000000000000000000000001"
-	],
-	[
-		"0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c",
-		"0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3",
-		"0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931",
-		"0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84"
-	],
-	[
-		"0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b",
-		"0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573",
-		"0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f",
-		"0x0000000000000000000000000000000000000000000000000000000000000001"
-	]
-].map((i) => i.map((j) => BigInt(j))));
-const mapSWU = mapToCurveSimpleSWU(Fpk1, {
-	A: BigInt("0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533"),
-	B: BigInt("1771"),
-	Z: Fpk1.create(BigInt("-11"))
-});
-/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */
-const secp256k1_hasher = createHasher(secp256k1.Point, (scalars) => {
-	const { x, y } = mapSWU(Fpk1.create(scalars[0]));
-	return isoMap(x, y);
-}, {
-	DST: "secp256k1_XMD:SHA-256_SSWU_RO_",
-	encodeDST: "secp256k1_XMD:SHA-256_SSWU_NU_",
-	p: Fpk1.ORDER,
-	m: 1,
-	k: 128,
-	expand: "xmd",
-	hash: sha256
-});
-/** @deprecated use `import { secp256k1_hasher } from '@noble/curves/secp256k1.js';` */
-const hashToCurve = secp256k1_hasher.hashToCurve;
-/** @deprecated use `import { secp256k1_hasher } from '@noble/curves/secp256k1.js';` */
-const encodeToCurve = secp256k1_hasher.encodeToCurve;
-
-//#endregion
-export { secp256k1 };

package/dist/node_modules/.pnpm/@noble_curves@1.9.7/node_modules/@noble/curves/esm/utils.cjs

@@ -1,203 +0,0 @@
-const require_utils = require('../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/utils.cjs');
-
-//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/utils.js
-/**
-* Hex, bytes and number utilities.
-* @module
-*/
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const _0n = /* @__PURE__ */ BigInt(0);
-const _1n = /* @__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 = require_utils.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 : BigInt("0x" + hex);
-}
-function bytesToNumberBE(bytes) {
-	return hexToNumber(require_utils.bytesToHex(bytes));
-}
-function bytesToNumberLE(bytes) {
-	require_utils.abytes(bytes);
-	return hexToNumber(require_utils.bytesToHex(Uint8Array.from(bytes).reverse()));
-}
-function numberToBytesBE(n, len) {
-	return require_utils.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 = require_utils.hexToBytes(hex);
-	} catch (e) {
-		throw new Error(title + " must be hex string or Uint8Array, cause: " + e);
-	}
-	else if (require_utils.isBytes(hex)) res = Uint8Array.from(hex);
-	else throw new Error(title + " must be hex string or Uint8Array");
-	const len = res.length;
-	if (typeof expectedLength === "number" && len !== expectedLength) throw new Error(title + " of length " + expectedLength + " expected, got " + len);
-	return res;
-}
-/**
-* @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
-*/
-/**
-* Converts bytes to string using UTF8 encoding.
-* @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'
-*/
-const isPosBig = (n) => typeof n === "bigint" && _0n <= n;
-function inRange(n, min, max) {
-	return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;
-}
-/**
-* Asserts min <= n < max. NOTE: It's < max and not <= max.
-* @example
-* aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)
-*/
-function aInRange(title, n, min, max) {
-	if (!inRange(n, min, max)) throw new Error("expected valid " + title + ": " + min + " <= n < " + max + ", got " + n);
-}
-/**
-* Calculates amount of bits in a bigint.
-* Same as `n.toString(2).length`
-* TODO: merge with nLength in modular
-*/
-function bitLen(n) {
-	let len;
-	for (len = 0; n > _0n; n >>= _1n, len += 1);
-	return len;
-}
-/**
-* Calculate mask for N bits. Not using ** operator with bigints because of old engines.
-* Same as BigInt(`0b${Array(i).fill('1').join('')}`)
-*/
-const bitMask = (n) => (_1n << BigInt(n)) - _1n;
-/**
-* 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 require_utils.concatBytes(...out);
-	};
-	const genUntil = (seed, pred) => {
-		reset();
-		reseed(seed);
-		let res = void 0;
-		while (!(res = pred(gen()))) reseed();
-		reset();
-		return res;
-	};
-	return genUntil;
-}
-function isHash(val) {
-	return typeof val === "function" && Number.isSafeInteger(val.outputLen);
-}
-function _validateObject(object, fields, optFields = {}) {
-	if (!object || typeof object !== "object") throw new Error("expected valid options object");
-	function checkField(fieldName, expectedType, isOpt) {
-		const val = object[fieldName];
-		if (isOpt && val === void 0) return;
-		const current = typeof val;
-		if (current !== expectedType || val === null) throw new Error(`param "${fieldName}" is invalid: expected ${expectedType}, got ${current}`);
-	}
-	Object.entries(fields).forEach(([k, v]) => checkField(k, v, false));
-	Object.entries(optFields).forEach(([k, v]) => checkField(k, v, true));
-}
-/**
-* Memoizes (caches) computation result.
-* Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.
-*/
-function memoized(fn) {
-	const map = /* @__PURE__ */ new WeakMap();
-	return (arg, ...args) => {
-		const val = map.get(arg);
-		if (val !== void 0) return val;
-		const computed = fn(arg, ...args);
-		map.set(arg, computed);
-		return computed;
-	};
-}
-
-//#endregion
-exports._abool2 = _abool2;
-exports._abytes2 = _abytes2;
-exports._validateObject = _validateObject;
-exports.aInRange = aInRange;
-exports.bitLen = bitLen;
-exports.bitMask = bitMask;
-exports.bytesToNumberBE = bytesToNumberBE;
-exports.bytesToNumberLE = bytesToNumberLE;
-exports.createHmacDrbg = createHmacDrbg;
-exports.ensureBytes = ensureBytes;
-exports.isHash = isHash;
-exports.memoized = memoized;
-exports.numberToBytesBE = numberToBytesBE;
-exports.numberToBytesLE = numberToBytesLE;
-exports.numberToHexUnpadded = numberToHexUnpadded;

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

@@ -1,189 +0,0 @@
-import { abytes, anumber, bytesToHex, concatBytes, hexToBytes, isBytes, randomBytes, utf8ToBytes } from "../../../../../@noble_hashes@1.8.0/node_modules/@noble/hashes/esm/utils.mjs";
-
-//#region ../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/esm/utils.js
-/**
-* Hex, bytes and number utilities.
-* @module
-*/
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const _0n = /* @__PURE__ */ BigInt(0);
-const _1n = /* @__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 : BigInt("0x" + hex);
-}
-function bytesToNumberBE(bytes) {
-	return hexToNumber(bytesToHex(bytes));
-}
-function bytesToNumberLE(bytes) {
-	abytes(bytes);
-	return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));
-}
-function numberToBytesBE(n, len) {
-	return hexToBytes(n.toString(16).padStart(len * 2, "0"));
-}
-function numberToBytesLE(n, len) {
-	return numberToBytesBE(n, len).reverse();
-}
-/**
-* Takes hex string or Uint8Array, converts to Uint8Array.
-* Validates output length.
-* Will throw error for other types.
-* @param title descriptive title for an error e.g. 'secret key'
-* @param hex hex string or Uint8Array
-* @param expectedLength optional, will compare to result array's length
-* @returns
-*/
-function ensureBytes(title, hex, expectedLength) {
-	let res;
-	if (typeof hex === "string") try {
-		res = hexToBytes(hex);
-	} catch (e) {
-		throw new Error(title + " must be hex string or Uint8Array, cause: " + e);
-	}
-	else if (isBytes(hex)) res = Uint8Array.from(hex);
-	else throw new Error(title + " must be hex string or Uint8Array");
-	const len = res.length;
-	if (typeof expectedLength === "number" && len !== expectedLength) throw new Error(title + " of length " + expectedLength + " expected, got " + len);
-	return res;
-}
-/**
-* @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
-*/
-/**
-* Converts bytes to string using UTF8 encoding.
-* @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'
-*/
-const isPosBig = (n) => typeof n === "bigint" && _0n <= n;
-function inRange(n, min, max) {
-	return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;
-}
-/**
-* Asserts min <= n < max. NOTE: It's < max and not <= max.
-* @example
-* aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)
-*/
-function aInRange(title, n, min, max) {
-	if (!inRange(n, min, max)) throw new Error("expected valid " + title + ": " + min + " <= n < " + max + ", got " + n);
-}
-/**
-* Calculates amount of bits in a bigint.
-* Same as `n.toString(2).length`
-* TODO: merge with nLength in modular
-*/
-function bitLen(n) {
-	let len;
-	for (len = 0; n > _0n; n >>= _1n, len += 1);
-	return len;
-}
-/**
-* Calculate mask for N bits. Not using ** operator with bigints because of old engines.
-* Same as BigInt(`0b${Array(i).fill('1').join('')}`)
-*/
-const bitMask = (n) => (_1n << BigInt(n)) - _1n;
-/**
-* 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 isHash(val) {
-	return typeof val === "function" && Number.isSafeInteger(val.outputLen);
-}
-function _validateObject(object, fields, optFields = {}) {
-	if (!object || typeof object !== "object") throw new Error("expected valid options object");
-	function checkField(fieldName, expectedType, isOpt) {
-		const val = object[fieldName];
-		if (isOpt && val === void 0) return;
-		const current = typeof val;
-		if (current !== expectedType || val === null) throw new Error(`param "${fieldName}" is invalid: expected ${expectedType}, got ${current}`);
-	}
-	Object.entries(fields).forEach(([k, v]) => checkField(k, v, false));
-	Object.entries(optFields).forEach(([k, v]) => checkField(k, v, true));
-}
-/**
-* Memoizes (caches) computation result.
-* Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.
-*/
-function memoized(fn) {
-	const map = /* @__PURE__ */ new WeakMap();
-	return (arg, ...args) => {
-		const val = map.get(arg);
-		if (val !== void 0) return val;
-		const computed = fn(arg, ...args);
-		map.set(arg, computed);
-		return computed;
-	};
-}
-
-//#endregion
-export { _abool2, _abytes2, _validateObject, aInRange, bitLen, bitMask, bytesToNumberBE, bytesToNumberLE, createHmacDrbg, ensureBytes, isHash, memoized, numberToBytesBE, numberToBytesLE, numberToHexUnpadded };