@noble/curves 0.6.0 → 0.6.1

package/lib/abstract/utils.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.bitMask = exports.bitSet = exports.bitGet = exports.bitLen = exports.equalBytes = exports.concatBytes = exports.ensureBytes = exports.numberToVarBytesBE = exports.numberToBytesLE = exports.numberToBytesBE = exports.bytesToNumberLE = exports.bytesToNumberBE = exports.hexToBytes = exports.hexToNumber = exports.numberToHexUnpadded = exports.bytesToHex = void 0;
+exports.validateObject = exports.bitMask = exports.bitSet = exports.bitGet = exports.bitLen = exports.equalBytes = exports.concatBytes = exports.ensureBytes = exports.numberToVarBytesBE = exports.numberToBytesLE = exports.numberToBytesBE = exports.bytesToNumberLE = exports.bytesToNumberBE = exports.hexToBytes = exports.hexToNumber = exports.numberToHexUnpadded = exports.bytesToHex = void 0;
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const _0n = BigInt(0);
 const _1n = BigInt(1);
@@ -9,7 +9,7 @@ const u8a = (a) => a instanceof Uint8Array;
 const hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));
 function bytesToHex(bytes) {
     if (!u8a(bytes))
-        throw new Error('Expected Uint8Array');
+        throw new Error('Uint8Array expected');
     // pre-caching improves the speed 6x
     let hex = '';
     for (let i = 0; i < bytes.length; i++) {
@@ -25,7 +25,7 @@ function numberToHexUnpadded(num) {
 exports.numberToHexUnpadded = numberToHexUnpadded;
 function hexToNumber(hex) {
     if (typeof hex !== 'string')
-        throw new Error('hexToNumber: expected string, got ' + typeof hex);
+        throw new Error('string expected, got ' + typeof hex);
     // Big Endian
     return BigInt(`0x${hex}`);
 }
@@ -33,16 +33,16 @@ exports.hexToNumber = hexToNumber;
 // Caching slows it down 2-3x
 function hexToBytes(hex) {
     if (typeof hex !== 'string')
-        throw new Error('hexToBytes: expected string, got ' + typeof hex);
+        throw new Error('string expected, got ' + typeof hex);
     if (hex.length % 2)
-        throw new Error('hexToBytes: received invalid unpadded hex ' + hex.length);
+        throw new Error('hex string is invalid: unpadded ' + hex.length);
     const array = new Uint8Array(hex.length / 2);
     for (let i = 0; i < array.length; i++) {
         const j = i * 2;
         const hexByte = hex.slice(j, j + 2);
         const byte = Number.parseInt(hexByte, 16);
         if (Number.isNaN(byte) || byte < 0)
-            throw new Error('Invalid byte sequence');
+            throw new Error('invalid byte sequence');
         array[i] = byte;
     }
     return array;
@@ -55,7 +55,7 @@ function bytesToNumberBE(bytes) {
 exports.bytesToNumberBE = bytesToNumberBE;
 function bytesToNumberLE(bytes) {
     if (!u8a(bytes))
-        throw new Error('Expected Uint8Array');
+        throw new Error('Uint8Array expected');
     return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));
 }
 exports.bytesToNumberLE = bytesToNumberLE;
@@ -64,12 +64,7 @@ exports.numberToBytesBE = numberToBytesBE;
 const numberToBytesLE = (n, len) => (0, exports.numberToBytesBE)(n, len).reverse();
 exports.numberToBytesLE = numberToBytesLE;
 // Returns variable number bytes (minimal bigint encoding?)
-const numberToVarBytesBE = (n) => {
-    let hex = n.toString(16);
-    if (hex.length & 1)
-        hex = '0' + hex;
-    return hexToBytes(hex);
-};
+const numberToVarBytesBE = (n) => hexToBytes(numberToHexUnpadded(n));
 exports.numberToVarBytesBE = numberToVarBytesBE;
 function ensureBytes(hex, expectedLength) {
     // Uint8Array.from() instead of hash.slice() because node.js Buffer
@@ -81,19 +76,16 @@ function ensureBytes(hex, expectedLength) {
 }
 exports.ensureBytes = ensureBytes;
 // Copies several Uint8Arrays into one.
-function concatBytes(...arrays) {
-    if (!arrays.every((b) => u8a(b)))
-        throw new Error('Uint8Array list expected');
-    if (arrays.length === 1)
-        return arrays[0];
-    const length = arrays.reduce((a, arr) => a + arr.length, 0);
-    const result = new Uint8Array(length);
-    for (let i = 0, pad = 0; i < arrays.length; i++) {
-        const arr = arrays[i];
-        result.set(arr, pad);
-        pad += arr.length;
-    }
-    return result;
+function concatBytes(...arrs) {
+    const r = new Uint8Array(arrs.reduce((sum, a) => sum + a.length, 0));
+    let pad = 0; // walk through each item, ensure they have proper type
+    arrs.forEach((a) => {
+        if (!u8a(a))
+            throw new Error('Uint8Array expected');
+        r.set(a, pad);
+        pad += a.length;
+    });
+    return r;
 }
 exports.concatBytes = concatBytes;
 function equalBytes(b1, b2) {
@@ -126,3 +118,33 @@ exports.bitSet = bitSet;
 // Not using ** operator with bigints for old engines.
 const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;
 exports.bitMask = bitMask;
+function validateObject(object, validators, optValidators = {}) {
+    const validatorFns = {
+        bigint: (val) => typeof val === 'bigint',
+        function: (val) => typeof val === 'function',
+        boolean: (val) => typeof val === 'boolean',
+        string: (val) => typeof val === 'string',
+        isSafeInteger: (val) => Number.isSafeInteger(val),
+        array: (val) => Array.isArray(val),
+        field: (val) => object.Fp.isValid(val),
+        hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),
+    };
+    // type Key = keyof typeof validators;
+    const checkField = (fieldName, type, isOptional) => {
+        const checkVal = validatorFns[type];
+        if (typeof checkVal !== 'function')
+            throw new Error(`Invalid validator "${type}", expected function`);
+        const val = object[fieldName];
+        if (isOptional && val === undefined)
+            return;
+        if (!checkVal(val)) {
+            throw new Error(`Invalid param ${fieldName}=${val} (${typeof val}), expected ${type}`);
+        }
+    };
+    for (let [fieldName, type] of Object.entries(validators))
+        checkField(fieldName, type, false);
+    for (let [fieldName, type] of Object.entries(optValidators))
+        checkField(fieldName, type, true);
+    return object;
+}
+exports.validateObject = validateObject;

package/lib/abstract/weierstrass.d.ts

@@ -1,8 +1,8 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 import * as mod from './modular.js';
 import * as ut from './utils.js';
-import { Hex, PrivKey, CHash } from './utils.js';
-import { Group, GroupConstructor, AbstractCurve, AffinePoint } from './curve.js';
+import { CHash, Hex, PrivKey } from './utils.js';
+import { Group, GroupConstructor, BasicCurve, AffinePoint } from './curve.js';
 export type { AffinePoint };
 declare type HmacFnSync = (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array;
 declare type EndomorphismOpts = {
@@ -14,10 +14,10 @@ declare type EndomorphismOpts = {
         k2: bigint;
     };
 };
-export declare type BasicCurve<T> = AbstractCurve<T> & {
+export declare type BasicWCurve<T> = BasicCurve<T> & {
     a: T;
     b: T;
-    normalizePrivateKey?: (key: PrivKey) => PrivKey;
+    allowedPrivateKeyLengths?: readonly number[];
     wrapPrivateKey?: boolean;
     endo?: EndomorphismOpts;
     isTorsionFree?: (c: ProjConstructor<T>, point: ProjPointType<T>) => boolean;
@@ -77,7 +77,7 @@ export interface ProjConstructor<T> extends GroupConstructor<ProjPointType<T>> {
     fromPrivateKey(privateKey: PrivKey): ProjPointType<T>;
     normalizeZ(points: ProjPointType<T>[]): ProjPointType<T>[];
 }
-export declare type CurvePointsType<T> = BasicCurve<T> & {
+export declare type CurvePointsType<T> = BasicWCurve<T> & {
     fromBytes: (bytes: Uint8Array) => AffinePoint<T>;
     toBytes: (c: ProjConstructor<T>, point: ProjPointType<T>, compressed: boolean) => Uint8Array;
 };
@@ -117,11 +117,11 @@ declare type SignatureLike = {
     s: bigint;
 };
 export declare type PubKey = Hex | ProjPointType<bigint>;
-export declare type CurveType = BasicCurve<bigint> & {
-    lowS?: boolean;
+export declare type CurveType = BasicWCurve<bigint> & {
     hash: CHash;
     hmac: HmacFnSync;
     randomBytes: (bytesLength?: number) => Uint8Array;
+    lowS?: boolean;
     bits2int?: (bytes: Uint8Array) => bigint;
     bits2int_modN?: (bytes: Uint8Array) => bigint;
 };
@@ -134,18 +134,18 @@ declare function validateOpts(curve: CurveType): Readonly<{
     readonly hEff?: bigint | undefined;
     readonly Gx: bigint;
     readonly Gy: bigint;
-    readonly wrapPrivateKey?: boolean | undefined;
     readonly allowInfinityPoint?: boolean | undefined;
     readonly a: bigint;
     readonly b: bigint;
-    readonly normalizePrivateKey?: ((key: ut.PrivKey) => ut.PrivKey) | undefined;
+    readonly allowedPrivateKeyLengths?: readonly number[] | undefined;
+    readonly wrapPrivateKey?: boolean | undefined;
     readonly endo?: EndomorphismOpts | undefined;
     readonly isTorsionFree?: ((c: ProjConstructor<bigint>, point: ProjPointType<bigint>) => boolean) | undefined;
     readonly clearCofactor?: ((c: ProjConstructor<bigint>, point: ProjPointType<bigint>) => ProjPointType<bigint>) | undefined;
-    lowS: boolean;
     readonly hash: ut.CHash;
     readonly hmac: HmacFnSync;
     readonly randomBytes: (bytesLength?: number | undefined) => Uint8Array;
+    lowS: boolean;
     readonly bits2int?: ((bytes: Uint8Array) => bigint) | undefined;
     readonly bits2int_modN?: ((bytes: Uint8Array) => bigint) | undefined;
 }>;

package/lib/abstract/weierstrass.js

@@ -8,21 +8,21 @@ const ut = require("./utils.js");
 const utils_js_1 = require("./utils.js");
 const curve_js_1 = require("./curve.js");
 function validatePointOpts(curve) {
-    const opts = (0, curve_js_1.validateAbsOpts)(curve);
-    const Fp = opts.Fp;
-    for (const i of ['a', 'b']) {
-        if (!Fp.isValid(curve[i]))
-            throw new Error(`Invalid curve param ${i}=${opts[i]} (${typeof opts[i]})`);
-    }
-    for (const i of ['isTorsionFree', 'clearCofactor']) {
-        if (curve[i] === undefined)
-            continue; // Optional
-        if (typeof curve[i] !== 'function')
-            throw new Error(`Invalid ${i} function`);
-    }
-    const endo = opts.endo;
+    const opts = (0, curve_js_1.validateBasic)(curve);
+    ut.validateObject(opts, {
+        a: 'field',
+        b: 'field',
+        fromBytes: 'function',
+        toBytes: 'function',
+    }, {
+        allowedPrivateKeyLengths: 'array',
+        wrapPrivateKey: 'boolean',
+        isTorsionFree: 'function',
+        clearCofactor: 'function',
+    });
+    const { endo, Fp, a } = opts;
     if (endo) {
-        if (!Fp.eql(opts.a, Fp.ZERO)) {
+        if (!Fp.eql(a, Fp.ZERO)) {
             throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');
         }
         if (typeof endo !== 'object' ||
@@ -31,11 +31,6 @@ function validatePointOpts(curve) {
             throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');
         }
     }
-    if (typeof opts.fromBytes !== 'function')
-        throw new Error('Invalid fromBytes function');
-    if (typeof opts.toBytes !== 'function')
-        throw new Error('Invalid fromBytes function');
-    // Set defaults
     return Object.freeze({ ...opts });
 }
 // ASN.1 DER encoding utilities
@@ -116,39 +111,28 @@ function weierstrassPoints(opts) {
         if (!isWithinCurveOrder(num))
             throw new Error('Expected valid bigint: 0 < bigint < curve.n');
     }
-    /**
-     * Validates if a private key is valid and converts it to bigint form.
-     * Supports two options, that are passed when CURVE is initialized:
-     * - `normalizePrivateKey()` executed before all checks
-     * - `wrapPrivateKey` when true, executed after most checks, but before `0 < key < n`
-     */
+    // Validates if priv key is valid and converts it to bigint.
+    // Supports options CURVE.normalizePrivateKey and CURVE.wrapPrivateKey.
     function normalizePrivateKey(key) {
-        const { normalizePrivateKey: custom, nByteLength: groupLen, wrapPrivateKey, n } = CURVE;
-        if (typeof custom === 'function')
-            key = custom(key);
-        let num;
-        if (typeof key === 'bigint') {
-            // Curve order check is done below
-            num = key;
+        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;
+        if (lengths && typeof key !== 'bigint') {
+            if (key instanceof Uint8Array)
+                key = ut.bytesToHex(key);
+            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes
+            if (typeof key !== 'string' || !lengths.includes(key.length))
+                throw new Error('Invalid key');
+            key = key.padStart(nByteLength * 2, '0');
         }
-        else if (typeof key === 'string') {
-            if (key.length !== 2 * groupLen)
-                throw new Error(`must be ${groupLen} bytes`);
-            // Validates individual octets
-            num = ut.bytesToNumberBE((0, utils_js_1.ensureBytes)(key));
-        }
-        else if (key instanceof Uint8Array) {
-            if (key.length !== groupLen)
-                throw new Error(`must be ${groupLen} bytes`);
-            num = ut.bytesToNumberBE(key);
+        let num;
+        try {
+            num = typeof key === 'bigint' ? key : ut.bytesToNumberBE((0, utils_js_1.ensureBytes)(key, nByteLength));
         }
-        else {
-            throw new Error('private key must be bytes, hex or bigint, not ' + typeof key);
+        catch (error) {
+            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);
         }
-        // Useful for curves with cofactor != 1
         if (wrapPrivateKey)
-            num = mod.mod(num, n);
-        assertGE(num);
+            num = mod.mod(num, n); // disabled by default, enabled for BLS
+        assertGE(num); // num in range [1..N-1]
         return num;
     }
     const pointPrecomputes = new Map();
@@ -503,14 +487,16 @@ function weierstrassPoints(opts) {
 }
 exports.weierstrassPoints = weierstrassPoints;
 function validateOpts(curve) {
-    const opts = (0, curve_js_1.validateAbsOpts)(curve);
-    if (typeof opts.hash !== 'function' || !Number.isSafeInteger(opts.hash.outputLen))
-        throw new Error('Invalid hash function');
-    if (typeof opts.hmac !== 'function')
-        throw new Error('Invalid hmac function');
-    if (typeof opts.randomBytes !== 'function')
-        throw new Error('Invalid randomBytes function');
-    // Set defaults
+    const opts = (0, curve_js_1.validateBasic)(curve);
+    ut.validateObject(opts, {
+        hash: 'hash',
+        hmac: 'function',
+        randomBytes: 'function',
+    }, {
+        bits2int: 'function',
+        bits2int_modN: 'function',
+        lowS: 'boolean',
+    });
     return Object.freeze({ lowS: true, ...opts });
 }
 const u8n = (data) => new Uint8Array(data); // creates Uint8Array
@@ -619,7 +605,7 @@ function weierstrass(curveDef) {
                 return { x, y };
             }
             else {
-                throw new Error(`Point.fromHex: received invalid point. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);
+                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);
             }
         },
     });
@@ -681,7 +667,7 @@ function weierstrass(curveDef) {
             const ir = invN(radj); // r^-1
             const u1 = modN(-h * ir); // -hr^-1
             const u2 = modN(s * ir); // sr^-1
-            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); //  (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)
+            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)
             if (!Q)
                 throw new Error('point at infinify'); // unsafe is fine: no priv data leaked
             Q.assertValidity();
@@ -804,9 +790,10 @@ function weierstrass(curveDef) {
     const ORDER_MASK = ut.bitMask(CURVE.nBitLength);
     function int2octets(num) {
         if (typeof num !== 'bigint')
-            throw new Error('Expected bigint');
+            throw new Error('bigint expected');
         if (!(_0n <= num && num < ORDER_MASK))
-            throw new Error(`Expected number < 2^${CURVE.nBitLength}`);
+            // n in [0..ORDER_MASK-1]
+            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);
         // works with order, can have different size than numToField!
         return ut.numberToBytesBE(num, CURVE.nByteLength);
     }
@@ -816,6 +803,7 @@ function weierstrass(curveDef) {
     // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.
     // Also it can be bigger for P224 + SHA256
     function prepSig(msgHash, privateKey, opts = defaultSigOpts) {
+        const { hash, randomBytes } = CURVE;
         if (msgHash == null)
             throw new Error(`sign: expected valid message hash, not "${msgHash}"`);
         if (['recovered', 'canonical'].some((k) => k in opts))
@@ -823,28 +811,20 @@ function weierstrass(curveDef) {
             throw new Error('sign() legacy options not supported');
         let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default
         if (prehash)
-            msgHash = CURVE.hash((0, utils_js_1.ensureBytes)(msgHash));
+            msgHash = hash((0, utils_js_1.ensureBytes)(msgHash));
         if (lowS == null)
-            lowS = true; // RFC6979 3.2: we skip step A, because
-        // Step A is ignored, since we already provide hash instead of msg
-        // NOTE: instead of bits2int, we calling here truncateHash, since we need
-        // custom truncation for stark. For other curves it is essentially same as calling bits2int + mod
-        // However, we cannot later call bits2octets (which is truncateHash + int2octets), since nested bits2int is broken
-        // for curves where nBitLength % 8 !== 0, so we unwrap it here as int2octets call.
-        // const bits2octets = (bits)=>int2octets(bytesToNumberBE(truncateHash(bits)))
+            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash
+        // We can't later call bits2octets, since nested bits2int is broken for curves
+        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.
+        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))
         const h1int = bits2int_modN((0, utils_js_1.ensureBytes)(msgHash));
-        const h1octets = int2octets(h1int);
-        const d = normalizePrivateKey(privateKey);
-        // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')
-        const seedArgs = [int2octets(d), h1octets];
+        const d = normalizePrivateKey(privateKey); // validate private key, convert to bigint
+        const seedArgs = [int2octets(d), int2octets(h1int)];
+        // extraEntropy. RFC6979 3.6: additional k' (optional).
         if (ent != null) {
-            // RFC6979 3.6: additional k' (optional)
-            if (ent === true)
-                ent = CURVE.randomBytes(Fp.BYTES);
-            const e = (0, utils_js_1.ensureBytes)(ent);
-            if (e.length !== Fp.BYTES)
-                throw new Error(`sign: Expected ${Fp.BYTES} bytes of extra data`);
-            seedArgs.push(e);
+            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')
+            // Either pass as-is, or generate random bytes. Then validate for being ui8a of size BYTES
+            seedArgs.push((0, utils_js_1.ensureBytes)(ent === true ? randomBytes(Fp.BYTES) : ent, Fp.BYTES));
         }
         const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2
         const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!
@@ -954,7 +934,6 @@ function weierstrass(curveDef) {
         getSharedSecret,
         sign,
         verify,
-        // Point,
         ProjectivePoint: Point,
         Signature,
         utils,

package/lib/esm/abstract/curve.js

@@ -1,6 +1,7 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 // Abelian group utilities
 import { validateField, nLength } from './modular.js';
+import { validateObject } from './utils.js';
 const _0n = BigInt(0);
 const _1n = BigInt(1);
 // Elliptic curve multiplication of Point by scalar. Complicated and fragile. Uses wNAF method.
@@ -121,24 +122,17 @@ export function wNAF(c, bits) {
         },
     };
 }
-export function validateAbsOpts(curve) {
+export function validateBasic(curve) {
     validateField(curve.Fp);
-    for (const i of ['n', 'h']) {
-        const val = curve[i];
-        if (typeof val !== 'bigint')
-            throw new Error(`Invalid curve param ${i}=${val} (${typeof val})`);
-    }
-    if (!curve.Fp.isValid(curve.Gx))
-        throw new Error('Invalid generator X coordinate Fp element');
-    if (!curve.Fp.isValid(curve.Gy))
-        throw new Error('Invalid generator Y coordinate Fp element');
-    for (const i of ['nBitLength', 'nByteLength']) {
-        const val = curve[i];
-        if (val === undefined)
-            continue; // Optional
-        if (!Number.isSafeInteger(val))
-            throw new Error(`Invalid param ${i}=${val} (${typeof val})`);
-    }
+    validateObject(curve, {
+        n: 'bigint',
+        h: 'bigint',
+        Gx: 'field',
+        Gy: 'field',
+    }, {
+        nBitLength: 'isSafeInteger',
+        nByteLength: 'isSafeInteger',
+    });
     // Set defaults
     return Object.freeze({ ...nLength(curve.n, curve.nBitLength), ...curve });
 }

package/lib/esm/abstract/edwards.js

@@ -1,32 +1,27 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 // Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²
 import { mod } from './modular.js';
-import { bytesToHex, bytesToNumberLE, concatBytes, ensureBytes, numberToBytesLE, } from './utils.js';
-import { wNAF, validateAbsOpts, } from './curve.js';
+import * as ut from './utils.js';
+import { ensureBytes } from './utils.js';
+import { wNAF, validateBasic } from './curve.js';
 // Be friendly to bad ECMAScript parsers by not using bigint literals like 123n
 const _0n = BigInt(0);
 const _1n = BigInt(1);
 const _2n = BigInt(2);
 const _8n = BigInt(8);
 function validateOpts(curve) {
-    const opts = validateAbsOpts(curve);
-    if (typeof opts.hash !== 'function')
-        throw new Error('Invalid hash function');
-    for (const i of ['a', 'd']) {
-        const val = opts[i];
-        if (typeof val !== 'bigint')
-            throw new Error(`Invalid curve param ${i}=${val} (${typeof val})`);
-    }
-    for (const fn of ['randomBytes']) {
-        if (typeof opts[fn] !== 'function')
-            throw new Error(`Invalid ${fn} function`);
-    }
-    for (const fn of ['adjustScalarBytes', 'domain', 'uvRatio', 'mapToCurve']) {
-        if (opts[fn] === undefined)
-            continue; // Optional
-        if (typeof opts[fn] !== 'function')
-            throw new Error(`Invalid ${fn} function`);
-    }
+    const opts = validateBasic(curve);
+    ut.validateObject(curve, {
+        hash: 'function',
+        a: 'bigint',
+        d: 'bigint',
+        randomBytes: 'function',
+    }, {
+        adjustScalarBytes: 'function',
+        domain: 'function',
+        uvRatio: 'function',
+        mapToCurve: 'function',
+    });
     // Set defaults
     return Object.freeze({ ...opts });
 }
@@ -261,7 +256,7 @@ export function twistedEdwards(curveDef) {
             const normed = hex.slice(); // copy again, we'll manipulate it
             const lastByte = hex[len - 1]; // select last byte
             normed[len - 1] = lastByte & ~0x80; // clear last bit
-            const y = bytesToNumberLE(normed);
+            const y = ut.bytesToNumberLE(normed);
             if (y === _0n) {
                 // y=0 is allowed
             }
@@ -291,12 +286,12 @@ export function twistedEdwards(curveDef) {
         }
         toRawBytes() {
             const { x, y } = this.toAffine();
-            const bytes = numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)
+            const bytes = ut.numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)
             bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0; // when compressing, it's enough to store y
             return bytes; // and use the last byte to encode sign of x
         }
         toHex() {
-            return bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.
+            return ut.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.
         }
     }
     Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));
@@ -308,7 +303,7 @@ export function twistedEdwards(curveDef) {
     }
     // Little-endian SHA512 with modulo n
     function modN_LE(hash) {
-        return modN(bytesToNumberLE(hash));
+        return modN(ut.bytesToNumberLE(hash));
     }
     function isHex(item, err) {
         if (typeof item !== 'string' && !(item instanceof Uint8Array))
@@ -334,7 +329,7 @@ export function twistedEdwards(curveDef) {
     }
     // int('LE', SHA512(dom2(F, C) || msgs)) mod N
     function hashDomainToScalar(context = new Uint8Array(), ...msgs) {
-        const msg = concatBytes(...msgs);
+        const msg = ut.concatBytes(...msgs);
         return modN_LE(cHash(domain(msg, ensureBytes(context), !!preHash)));
     }
     /** Signs message with privateKey. RFC8032 5.1.6 */
@@ -349,7 +344,7 @@ export function twistedEdwards(curveDef) {
         const k = hashDomainToScalar(context, R, pointBytes, msg); // R || A || PH(M)
         const s = modN(r + k * scalar); // S = (r + k * s) mod L
         assertGE0(s); // 0 <= s < l
-        const res = concatBytes(R, numberToBytesLE(s, Fp.BYTES));
+        const res = ut.concatBytes(R, ut.numberToBytesLE(s, Fp.BYTES));
         return ensureBytes(res, nByteLength * 2); // 64-byte signature
     }
     function verify(sig, msg, publicKey, context) {
@@ -362,7 +357,7 @@ export function twistedEdwards(curveDef) {
             msg = preHash(msg); // for ed25519ph, etc
         const A = Point.fromHex(publicKey, false); // Check for s bounds, hex validity
         const R = Point.fromHex(sig.slice(0, len), false); // 0 <= R < 2^256: ZIP215 R can be >= P
-        const s = bytesToNumberLE(sig.slice(len, 2 * len)); // 0 <= s < l
+        const s = ut.bytesToNumberLE(sig.slice(len, 2 * len)); // 0 <= s < l
         const SB = G.multiplyUnsafe(s);
         const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);
         const RkA = R.add(A.multiplyUnsafe(k));

package/lib/esm/abstract/hash-to-curve.js

@@ -16,7 +16,7 @@ export function validateOpts(opts) {
 }
 export function stringToBytes(str) {
     if (typeof str !== 'string') {
-        throw new TypeError(`utf8ToBytes expected string, got ${typeof str}`);
+        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
     }
     return new TextEncoder().encode(str);
 }

package/lib/esm/abstract/modular.js

@@ -1,6 +1,6 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 // Utilities for modular arithmetics and finite fields
-import { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, } from './utils.js';
+import { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';
 // prettier-ignore
 const _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);
 // prettier-ignore
@@ -34,7 +34,6 @@ export function pow(num, power, modulo) {
     return res;
 }
 // Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)
-// TODO: Fp version?
 export function pow2(x, power, modulo) {
     let res = x;
     while (power-- > _0n) {
@@ -193,18 +192,17 @@ const FIELD_FIELDS = [
     'addN', 'subN', 'mulN', 'sqrN'
 ];
 export function validateField(field) {
-    for (const i of ['ORDER', 'MASK']) {
-        if (typeof field[i] !== 'bigint')
-            throw new Error(`Invalid field param ${i}=${field[i]} (${typeof field[i]})`);
-    }
-    for (const i of ['BYTES', 'BITS']) {
-        if (typeof field[i] !== 'number')
-            throw new Error(`Invalid field param ${i}=${field[i]} (${typeof field[i]})`);
-    }
-    for (const i of FIELD_FIELDS) {
-        if (typeof field[i] !== 'function')
-            throw new Error(`Invalid field param ${i}=${field[i]} (${typeof field[i]})`);
-    }
+    const initial = {
+        ORDER: 'bigint',
+        MASK: 'bigint',
+        BYTES: 'isSafeInteger',
+        BITS: 'isSafeInteger',
+    };
+    const opts = FIELD_FIELDS.reduce((map, val) => {
+        map[val] = 'function';
+        return map;
+    }, initial);
+    return validateObject(field, opts);
 }
 // Generic field functions
 export function FpPow(f, num, power) {