@hfunlabs/hyperliquid 0.29.1-hfunlabs.1 → 0.30.0-hfunlabs.1

package/src/deps/jsr.io/@noble/curves/2.0.1/src/secp256k1.ts

@@ -1,327 +0,0 @@
-/**
- * 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) */
-import { sha256 } from '../../../hashes/2.0.1/src/sha2.js';
-import { randomBytes } from '../../../hashes/2.0.1/src/utils.js';
-import { createKeygen, type CurveLengths } from './abstract/curve.js';
-import { createHasher, type H2CHasher, isogenyMap } from './abstract/hash-to-curve.js';
-import { Field, mapHashToField, pow2 } from './abstract/modular.js';
-import {
-  type ECDSA,
-  ecdsa,
-  type EndomorphismOpts,
-  mapToCurveSimpleSWU,
-  type WeierstrassPoint as PointType,
-  weierstrass,
-  type WeierstrassOpts,
-  type WeierstrassPointCons,
-} from './abstract/weierstrass.js';
-import { abytes, asciiToBytes, bytesToNumberBE, concatBytes } from './utils.js';
-
-// Seems like generator was produced from some seed:
-// `Pointk1.BASE.multiply(Pointk1.Fn.inv(2n, N)).toAffine().x`
-// // gives short x 0x3b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63n
-const secp256k1_CURVE: WeierstrassOpts<bigint> = {
-  p: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),
-  n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),
-  h: BigInt(1),
-  a: BigInt(0),
-  b: BigInt(7),
-  Gx: BigInt('0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798'),
-  Gy: BigInt('0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8'),
-};
-
-const secp256k1_ENDO: EndomorphismOpts = {
-  beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),
-  basises: [
-    [BigInt('0x3086d221a7d46bcde86c90e49284eb15'), -BigInt('0xe4437ed6010e88286f547fa90abfe4c3')],
-    [BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8'), BigInt('0x3086d221a7d46bcde86c90e49284eb15')],
-  ],
-};
-
-const _0n = /* @__PURE__ */ BigInt(0);
-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: bigint): bigint {
-  const P = secp256k1_CURVE.p;
-  // prettier-ignore
-  const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);
-  // prettier-ignore
-  const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);
-  const b2 = (y * y * y) % P; // x^3, 11
-  const b3 = (b2 * b2 * y) % P; // x^7
-  const b6 = (pow2(b3, _3n, P) * b3) % P;
-  const b9 = (pow2(b6, _3n, P) * b3) % P;
-  const b11 = (pow2(b9, _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 b176 = (pow2(b88, _88n, P) * b88) % P;
-  const b220 = (pow2(b176, _44n, P) * b44) % P;
-  const b223 = (pow2(b220, _3n, P) * b3) % P;
-  const t1 = (pow2(b223, _23n, P) * b22) % P;
-  const t2 = (pow2(t1, _6n, P) * b2) % P;
-  const root = pow2(t2, _2n, P);
-  if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error('Cannot find square root');
-  return root;
-}
-
-const Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });
-const Pointk1 = /* @__PURE__ */ weierstrass(secp256k1_CURVE, {
-  Fp: Fpk1,
-  endo: secp256k1_ENDO,
-});
-
-/**
- * secp256k1 curve: ECDSA and ECDH methods.
- *
- * Uses sha256 to hash messages. To use a different hash,
- * pass `{ prehash: false }` to sign / verify.
- *
- * @example
- * ```js
- * import { secp256k1 } from '@noble/curves/secp256k1.js';
- * const { secretKey, publicKey } = secp256k1.keygen();
- * // const publicKey = secp256k1.getPublicKey(secretKey);
- * const msg = new TextEncoder().encode('hello noble');
- * const sig = secp256k1.sign(msg, secretKey);
- * const isValid = secp256k1.verify(sig, msg, publicKey);
- * // const sigKeccak = secp256k1.sign(keccak256(msg), secretKey, { prehash: false });
- * ```
- */
-export const secp256k1: ECDSA = /* @__PURE__ */ ecdsa(Pointk1, sha256);
-
-// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.
-// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki
-/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */
-const TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};
-function taggedHash(tag: string, ...messages: Uint8Array[]): Uint8Array {
-  let tagP = TAGGED_HASH_PREFIXES[tag];
-  if (tagP === undefined) {
-    const tagH = sha256(asciiToBytes(tag));
-    tagP = concatBytes(tagH, tagH);
-    TAGGED_HASH_PREFIXES[tag] = tagP;
-  }
-  return sha256(concatBytes(tagP, ...messages));
-}
-
-// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03
-const pointToBytes = (point: PointType<bigint>) => point.toBytes(true).slice(1);
-const hasEven = (y: bigint) => y % _2n === _0n;
-
-// Calculate point, scalar and bytes
-function schnorrGetExtPubKey(priv: Uint8Array) {
-  const { Fn, BASE } = Pointk1;
-  const d_ = Fn.fromBytes(priv);
-  const p = BASE.multiply(d_); // P = d'⋅G; 0 < d' < n check is done inside
-  const scalar = hasEven(p.y) ? d_ : Fn.neg(d_);
-  return { scalar, bytes: pointToBytes(p) };
-}
-/**
- * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.
- * @returns valid point checked for being on-curve
- */
-function lift_x(x: bigint): PointType<bigint> {
-  const Fp = Fpk1;
-  if (!Fp.isValidNot0(x)) throw new Error('invalid x: Fail if x ≥ p');
-  const xx = Fp.create(x * x);
-  const c = Fp.create(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.
-  let y = Fp.sqrt(c); // Let y = c^(p+1)/4 mod p. Same as sqrt().
-  // Return the unique point P such that x(P) = x and
-  // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.
-  if (!hasEven(y)) y = Fp.neg(y);
-  const p = Pointk1.fromAffine({ x, y });
-  p.assertValidity();
-  return p;
-}
-const num = bytesToNumberBE;
-/**
- * Create tagged hash, convert it to bigint, reduce modulo-n.
- */
-function challenge(...args: Uint8Array[]): bigint {
-  return Pointk1.Fn.create(num(taggedHash('BIP0340/challenge', ...args)));
-}
-
-/**
- * Schnorr public key is just `x` coordinate of Point as per BIP340.
- */
-function schnorrGetPublicKey(secretKey: Uint8Array): Uint8Array {
-  return schnorrGetExtPubKey(secretKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)
-}
-
-/**
- * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.
- * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.
- */
-function schnorrSign(
-  message: Uint8Array,
-  secretKey: Uint8Array,
-  auxRand: Uint8Array = randomBytes(32)
-): Uint8Array {
-  const { Fn } = Pointk1;
-  const m = abytes(message, undefined, 'message');
-  const { bytes: px, scalar: d } = schnorrGetExtPubKey(secretKey); // checks for isWithinCurveOrder
-  const a = abytes(auxRand, 32, 'auxRand'); // Auxiliary random data a: a 32-byte array
-  const t = Fn.toBytes(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)
-  const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)
-  // Let k' = int(rand) mod n. Fail if k' = 0. Let R = k'⋅G
-  const { bytes: rx, scalar: k } = schnorrGetExtPubKey(rand);
-  const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.
-  const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).
-  sig.set(rx, 0);
-  sig.set(Fn.toBytes(Fn.create(k + e * d)), 32);
-  // If Verify(bytes(P), m, sig) (see below) returns failure, abort
-  if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');
-  return sig;
-}
-
-/**
- * Verifies Schnorr signature.
- * Will swallow errors & return false except for initial type validation of arguments.
- */
-function schnorrVerify(signature: Uint8Array, message: Uint8Array, publicKey: Uint8Array): boolean {
-  const { Fp, Fn, BASE } = Pointk1;
-  const sig = abytes(signature, 64, 'signature');
-  const m = abytes(message, undefined, 'message');
-  const pub = abytes(publicKey, 32, 'publicKey');
-  try {
-    const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails
-    const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.
-    if (!Fp.isValidNot0(r)) return false;
-    const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.
-    if (!Fn.isValidNot0(s)) return false;
-
-    const e = challenge(Fn.toBytes(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n
-    // R = s⋅G - e⋅P, where -eP == (n-e)P
-    const R = BASE.multiplyUnsafe(s).add(P.multiplyUnsafe(Fn.neg(e)));
-    const { x, y } = R.toAffine();
-    // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.
-    if (R.is0() || !hasEven(y) || x !== r) return false;
-    return true;
-  } catch (error) {
-    return false;
-  }
-}
-
-export type SecpSchnorr = {
-  keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };
-  getPublicKey: typeof schnorrGetPublicKey;
-  sign: typeof schnorrSign;
-  verify: typeof schnorrVerify;
-  Point: WeierstrassPointCons<bigint>;
-  utils: {
-    randomSecretKey: (seed?: Uint8Array) => Uint8Array;
-    pointToBytes: (point: PointType<bigint>) => Uint8Array;
-    lift_x: typeof lift_x;
-    taggedHash: typeof taggedHash;
-  };
-  lengths: CurveLengths;
-};
-/**
- * Schnorr signatures over secp256k1.
- * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki
- * @example
- * ```js
- * import { schnorr } from '@noble/curves/secp256k1.js';
- * const { secretKey, publicKey } = schnorr.keygen();
- * // const publicKey = schnorr.getPublicKey(secretKey);
- * const msg = new TextEncoder().encode('hello');
- * const sig = schnorr.sign(msg, secretKey);
- * const isValid = schnorr.verify(sig, msg, publicKey);
- * ```
- */
-export const schnorr: SecpSchnorr = /* @__PURE__ */ (() => {
-  const size = 32;
-  const seedLength = 48;
-  const randomSecretKey = (seed = randomBytes(seedLength)): Uint8Array => {
-    return mapHashToField(seed, secp256k1_CURVE.n);
-  };
-  return {
-    keygen: createKeygen(randomSecretKey, schnorrGetPublicKey),
-    getPublicKey: schnorrGetPublicKey,
-    sign: schnorrSign,
-    verify: schnorrVerify,
-    Point: Pointk1,
-    utils: {
-      randomSecretKey,
-      taggedHash,
-      lift_x,
-      pointToBytes,
-    },
-    lengths: {
-      secretKey: size,
-      publicKey: size,
-      publicKeyHasPrefix: false,
-      signature: size * 2,
-      seed: seedLength,
-    },
-  };
-})();
-
-const isoMap = /* @__PURE__ */ (() =>
-  isogenyMap(
-    Fpk1,
-    [
-      // xNum
-      [
-        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',
-        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',
-        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',
-        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',
-      ],
-      // xDen
-      [
-        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',
-        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',
-        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1
-      ],
-      // yNum
-      [
-        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',
-        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',
-        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',
-        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',
-      ],
-      // yDen
-      [
-        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',
-        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',
-        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',
-        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1
-      ],
-    ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]
-  ))();
-const mapSWU = /* @__PURE__ */ (() =>
-  mapToCurveSimpleSWU(Fpk1, {
-    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),
-    B: BigInt('1771'),
-    Z: Fpk1.create(BigInt('-11')),
-  }))();
-
-/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */
-export const secp256k1_hasher: H2CHasher<WeierstrassPointCons<bigint>> = /* @__PURE__ */ (() =>
-  createHasher(
-    Pointk1,
-    (scalars: bigint[]) => {
-      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,
-    }
-  ))();

package/src/deps/jsr.io/@noble/curves/2.0.1/src/utils.ts

@@ -1,306 +0,0 @@
-/**
- * Hex, bytes and number utilities.
- * @module
- */
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-import {
-  abytes as abytes_,
-  anumber,
-  bytesToHex as bytesToHex_,
-  concatBytes as concatBytes_,
-  hexToBytes as hexToBytes_,
-} from '../../../hashes/2.0.1/src/utils.js';
-export {
-  abytes,
-  anumber,
-  bytesToHex,
-  concatBytes,
-  hexToBytes,
-  isBytes,
-  randomBytes,
-} from '../../../hashes/2.0.1/src/utils.js';
-const _0n = /* @__PURE__ */ BigInt(0);
-const _1n = /* @__PURE__ */ BigInt(1);
-
-export type CHash = {
-  (message: Uint8Array): Uint8Array;
-  blockLen: number;
-  outputLen: number;
-  create(opts?: { dkLen?: number }): any; // For shake
-};
-export type FHash = (message: Uint8Array) => Uint8Array;
-export function abool(value: boolean, title: string = ''): boolean {
-  if (typeof value !== 'boolean') {
-    const prefix = title && `"${title}" `;
-    throw new Error(prefix + 'expected boolean, got type=' + typeof value);
-  }
-  return value;
-}
-
-// Used in weierstrass, der
-function abignumber(n: number | bigint) {
-  if (typeof n === 'bigint') {
-    if (!isPosBig(n)) throw new Error('positive bigint expected, got ' + n);
-  } else anumber(n);
-  return n;
-}
-
-export function asafenumber(value: number, title: string = ''): void {
-  if (!Number.isSafeInteger(value)) {
-    const prefix = title && `"${title}" `;
-    throw new Error(prefix + 'expected safe integer, got type=' + typeof value);
-  }
-}
-
-export function numberToHexUnpadded(num: number | bigint): string {
-  const hex = abignumber(num).toString(16);
-  return hex.length & 1 ? '0' + hex : hex;
-}
-
-export function hexToNumber(hex: string): bigint {
-  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);
-  return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian
-}
-
-// BE: Big Endian, LE: Little Endian
-export function bytesToNumberBE(bytes: Uint8Array): bigint {
-  return hexToNumber(bytesToHex_(bytes));
-}
-export function bytesToNumberLE(bytes: Uint8Array): bigint {
-  return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));
-}
-
-export function numberToBytesBE(n: number | bigint, len: number): Uint8Array {
-  anumber(len);
-  n = abignumber(n);
-  const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));
-  if (res.length !== len) throw new Error('number too large');
-  return res;
-}
-export function numberToBytesLE(n: number | bigint, len: number): Uint8Array {
-  return numberToBytesBE(n, len).reverse();
-}
-// Unpadded, rarely used
-export function numberToVarBytesBE(n: number | bigint): Uint8Array {
-  return hexToBytes_(numberToHexUnpadded(abignumber(n)));
-}
-
-// Compares 2 u8a-s in kinda constant time
-export function equalBytes(a: Uint8Array, b: Uint8Array): boolean {
-  if (a.length !== b.length) return false;
-  let diff = 0;
-  for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];
-  return diff === 0;
-}
-
-/**
- * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,
- * and Buffer#slice creates mutable copy. Never use Buffers!
- */
-export function copyBytes(bytes: Uint8Array): Uint8Array {
-  return Uint8Array.from(bytes);
-}
-
-/**
- * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols
- * Should be safe to use for things expected to be ASCII.
- * Returns exact same result as `TextEncoder` for ASCII or throws.
- */
-export function asciiToBytes(ascii: string): Uint8Array {
-  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;
-  });
-}
-
-// Is positive bigint
-const isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;
-
-export function inRange(n: bigint, min: bigint, max: bigint): boolean {
-  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)
- */
-export function aInRange(title: string, n: bigint, min: bigint, max: bigint): void {
-  // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?
-  // consider P=256n, min=0n, max=P
-  // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`
-  // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`
-  // - our way is the cleanest:               `inRange('x', x, 0n, P)
-  if (!inRange(n, min, max))
-    throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);
-}
-
-// Bit operations
-
-/**
- * Calculates amount of bits in a bigint.
- * Same as `n.toString(2).length`
- * TODO: merge with nLength in modular
- */
-export function bitLen(n: bigint): number {
-  let len;
-  for (len = 0; n > _0n; n >>= _1n, len += 1);
-  return len;
-}
-
-/**
- * Gets single bit at position.
- * NOTE: first bit position is 0 (same as arrays)
- * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`
- */
-export function bitGet(n: bigint, pos: number): bigint {
-  return (n >> BigInt(pos)) & _1n;
-}
-
-/**
- * Sets single bit at position.
- */
-export function bitSet(n: bigint, pos: number, value: boolean): bigint {
-  return n | ((value ? _1n : _0n) << BigInt(pos));
-}
-
-/**
- * Calculate mask for N bits. Not using ** operator with bigints because of old engines.
- * Same as BigInt(`0b${Array(i).fill('1').join('')}`)
- */
-export const bitMask = (n: number): bigint => (_1n << BigInt(n)) - _1n;
-
-// DRBG
-
-type Pred<T> = (v: Uint8Array) => T | undefined;
-/**
- * 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
- */
-export function createHmacDrbg<T>(
-  hashLen: number,
-  qByteLen: number,
-  hmacFn: (key: Uint8Array, message: Uint8Array) => Uint8Array
-): (seed: Uint8Array, predicate: Pred<T>) => T {
-  anumber(hashLen, 'hashLen');
-  anumber(qByteLen, 'qByteLen');
-  if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');
-  const u8n = (len: number): Uint8Array => new Uint8Array(len); // creates Uint8Array
-  const NULL = Uint8Array.of();
-  const byte0 = Uint8Array.of(0x00);
-  const byte1 = Uint8Array.of(0x01);
-  const _maxDrbgIters = 1000;
-
-  // Step B, Step C: set hashLen to 8*ceil(hlen/8)
-  let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.
-  let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same
-  let i = 0; // Iterations counter, will throw when over 1000
-  const reset = () => {
-    v.fill(1);
-    k.fill(0);
-    i = 0;
-  };
-  const h = (...msgs: Uint8Array[]) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)
-  const reseed = (seed: Uint8Array = NULL) => {
-    // HMAC-DRBG reseed() function. Steps D-G
-    k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)
-    v = h(); // v = hmac(k || v)
-    if (seed.length === 0) return;
-    k = h(byte1, seed); // k = hmac(k || v || 0x01 || seed)
-    v = h(); // v = hmac(k || v)
-  };
-  const gen = () => {
-    // HMAC-DRBG generate() function
-    if (i++ >= _maxDrbgIters) throw new Error('drbg: tried max amount of iterations');
-    let len = 0;
-    const out: Uint8Array[] = [];
-    while (len < qByteLen) {
-      v = h();
-      const sl = v.slice();
-      out.push(sl);
-      len += v.length;
-    }
-    return concatBytes_(...out);
-  };
-  const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {
-    reset();
-    reseed(seed); // Steps D-G
-    let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]
-    while (!(res = pred(gen()))) reseed();
-    reset();
-    return res;
-  };
-  return genUntil;
-}
-
-export function validateObject(
-  object: Record<string, any>,
-  fields: Record<string, string> = {},
-  optFields: Record<string, string> = {}
-): void {
-  if (!object || typeof object !== 'object') throw new Error('expected valid options object');
-  type Item = keyof typeof object;
-  function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {
-    const val = object[fieldName];
-    if (isOpt && val === undefined) return;
-    const current = typeof val;
-    if (current !== expectedType || val === null)
-      throw new Error(`param "${fieldName}" is invalid: expected ${expectedType}, got ${current}`);
-  }
-  const iter = (f: typeof fields, isOpt: boolean) =>
-    Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));
-  iter(fields, false);
-  iter(optFields, true);
-}
-
-/**
- * throws not implemented error
- */
-export const notImplemented = (): never => {
-  throw new Error('not implemented');
-};
-
-/**
- * Memoizes (caches) computation result.
- * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.
- */
-export function memoized<T extends object, R, O extends any[]>(
-  fn: (arg: T, ...args: O) => R
-): (arg: T, ...args: O) => R {
-  const map = new WeakMap<T, R>();
-  return (arg: T, ...args: O): R => {
-    const val = map.get(arg);
-    if (val !== undefined) return val;
-    const computed = fn(arg, ...args);
-    map.set(arg, computed);
-    return computed;
-  };
-}
-
-export interface CryptoKeys {
-  lengths: { seed?: number; public?: number; secret?: number };
-  keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };
-  getPublicKey: (secretKey: Uint8Array) => Uint8Array;
-}
-
-/** Generic interface for signatures. Has keygen, sign and verify. */
-export interface Signer extends CryptoKeys {
-  // Interfaces are fun. We cannot just add new fields without copying old ones.
-  lengths: {
-    seed?: number;
-    public?: number;
-    secret?: number;
-    signRand?: number;
-    signature?: number;
-  };
-  sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;
-  verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;
-}