@noble/curves 0.6.0 → 0.6.1

package/lib/esm/abstract/montgomery.js

@@ -1,31 +1,19 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 import { mod, pow } from './modular.js';
-import { ensureBytes, numberToBytesLE, bytesToNumberLE } from './utils.js';
+import { bytesToNumberLE, ensureBytes, numberToBytesLE, validateObject } from './utils.js';
 const _0n = BigInt(0);
 const _1n = BigInt(1);
 function validateOpts(curve) {
-    for (const i of ['a24']) {
-        if (typeof curve[i] !== 'bigint')
-            throw new Error(`Invalid curve param ${i}=${curve[i]} (${typeof curve[i]})`);
-    }
-    for (const i of ['montgomeryBits', 'nByteLength']) {
-        if (curve[i] === undefined)
-            continue; // Optional
-        if (!Number.isSafeInteger(curve[i]))
-            throw new Error(`Invalid curve param ${i}=${curve[i]} (${typeof curve[i]})`);
-    }
-    for (const fn of ['adjustScalarBytes', 'domain', 'powPminus2']) {
-        if (curve[fn] === undefined)
-            continue; // Optional
-        if (typeof curve[fn] !== 'function')
-            throw new Error(`Invalid ${fn} function`);
-    }
-    for (const i of ['Gu']) {
-        if (curve[i] === undefined)
-            continue; // Optional
-        if (typeof curve[i] !== 'string')
-            throw new Error(`Invalid curve param ${i}=${curve[i]} (${typeof curve[i]})`);
-    }
+    validateObject(curve, {
+        a24: 'bigint',
+    }, {
+        montgomeryBits: 'isSafeInteger',
+        nByteLength: 'isSafeInteger',
+        adjustScalarBytes: 'function',
+        domain: 'function',
+        powPminus2: 'function',
+        Gu: 'string',
+    });
     // Set defaults
     return Object.freeze({ ...curve });
 }
@@ -40,31 +28,7 @@ export function montgomery(curveDef) {
     const fieldLen = CURVE.nByteLength;
     const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes);
     const powPminus2 = CURVE.powPminus2 || ((x) => pow(x, P - BigInt(2), P));
-    /**
-     * Checks for num to be in range:
-     * For strict == true:  `0 <  num < max`.
-     * For strict == false: `0 <= num < max`.
-     * Converts non-float safe numbers to bigints.
-     */
-    function normalizeScalar(num, max, strict = true) {
-        if (!max)
-            throw new TypeError('Specify max value');
-        if (typeof num === 'number' && Number.isSafeInteger(num))
-            num = BigInt(num);
-        if (typeof num === 'bigint' && num < max) {
-            if (strict) {
-                if (_0n < num)
-                    return num;
-            }
-            else {
-                if (_0n <= num)
-                    return num;
-            }
-        }
-        throw new TypeError('Expected valid scalar: 0 < scalar < max');
-    }
-    // cswap from RFC7748
-    // NOTE: cswap is not from RFC7748!
+    // cswap from RFC7748. But it is not from RFC7748!
     /*
       cswap(swap, x_2, x_3):
            dummy = mask(swap) AND (x_2 XOR x_3)
@@ -80,6 +44,11 @@ export function montgomery(curveDef) {
         x_3 = modP(x_3 + dummy);
         return [x_2, x_3];
     }
+    function assertFieldElement(n) {
+        if (typeof n === 'bigint' && _0n <= n && n < P)
+            return n;
+        throw new Error('Expected valid scalar 0 < scalar < CURVE.P');
+    }
     // x25519 from 4
     /**
      *
@@ -88,11 +57,10 @@ export function montgomery(curveDef) {
      * @returns new Point on Montgomery curve
      */
     function montgomeryLadder(pointU, scalar) {
-        const { P } = CURVE;
-        const u = normalizeScalar(pointU, P);
+        const u = assertFieldElement(pointU);
         // Section 5: Implementations MUST accept non-canonical values and process them as
         // if they had been reduced modulo the field prime.
-        const k = normalizeScalar(scalar, P);
+        const k = assertFieldElement(scalar);
         // The constant a24 is (486662 - 2) / 4 = 121665 for curve25519/X25519
         const a24 = CURVE.a24;
         const x_1 = u;
@@ -145,11 +113,11 @@ export function montgomery(curveDef) {
         return numberToBytesLE(modP(u), montgomeryBytes);
     }
     function decodeUCoordinate(uEnc) {
-        const u = ensureBytes(uEnc, montgomeryBytes);
         // Section 5: When receiving such an array, implementations of X25519
         // MUST mask the most significant bit in the final byte.
         // This is very ugly way, but it works because fieldLen-1 is outside of bounds for X448, so this becomes NOOP
         // fieldLen - scalaryBytes = 1 for X448 and = 0 for X25519
+        const u = ensureBytes(uEnc, montgomeryBytes);
         u[fieldLen - 1] &= 127; // 0b0111_1111
         return bytesToNumberLE(u);
     }
@@ -159,13 +127,6 @@ export function montgomery(curveDef) {
             throw new Error(`Expected ${montgomeryBytes} or ${fieldLen} bytes, got ${bytes.length}`);
         return bytesToNumberLE(adjustScalarBytes(bytes));
     }
-    /**
-     * Computes shared secret between private key "scalar" and public key's "u" (x) coordinate.
-     * We can get 'y' coordinate from 'u',
-     * but Point.fromHex also wants 'x' coordinate oddity flag,
-     * and we cannot get 'x' without knowing 'v'.
-     * Need to add generic conversion between twisted edwards and complimentary curve for JubJub.
-     */
     function scalarMult(scalar, u) {
         const pointU = decodeUCoordinate(u);
         const _scalar = decodeScalar(scalar);
@@ -176,12 +137,7 @@ export function montgomery(curveDef) {
             throw new Error('Invalid private or public key received');
         return encodeUCoordinate(pu);
     }
-    /**
-     * Computes public key from private.
-     * Executes scalar multiplication of curve's base point by scalar.
-     * @param scalar private key
-     * @returns new public key
-     */
+    // Computes public key from private. By doing scalar multiplication of base point.
     function scalarMultBase(scalar) {
         return scalarMult(scalar, CURVE.Gu);
     }

package/lib/esm/abstract/poseidon.js

@@ -1,6 +1,6 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 // Poseidon Hash: https://eprint.iacr.org/2019/458.pdf, https://www.poseidon-hash.info
-import { validateField, FpPow } from './modular.js';
+import { FpPow, validateField } from './modular.js';
 export function validateOpts(opts) {
     const { Fp } = opts;
     validateField(Fp);

package/lib/esm/abstract/utils.js

@@ -6,7 +6,7 @@ const u8a = (a) => a instanceof Uint8Array;
 const hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));
 export 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++) {
@@ -20,23 +20,23 @@ export function numberToHexUnpadded(num) {
 }
 export 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}`);
 }
 // Caching slows it down 2-3x
 export 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;
@@ -47,18 +47,13 @@ export function bytesToNumberBE(bytes) {
 }
 export function bytesToNumberLE(bytes) {
     if (!u8a(bytes))
-        throw new Error('Expected Uint8Array');
+        throw new Error('Uint8Array expected');
     return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));
 }
 export const numberToBytesBE = (n, len) => hexToBytes(n.toString(16).padStart(len * 2, '0'));
 export const numberToBytesLE = (n, len) => numberToBytesBE(n, len).reverse();
 // Returns variable number bytes (minimal bigint encoding?)
-export const numberToVarBytesBE = (n) => {
-    let hex = n.toString(16);
-    if (hex.length & 1)
-        hex = '0' + hex;
-    return hexToBytes(hex);
-};
+export const numberToVarBytesBE = (n) => hexToBytes(numberToHexUnpadded(n));
 export function ensureBytes(hex, expectedLength) {
     // Uint8Array.from() instead of hash.slice() because node.js Buffer
     // is instance of Uint8Array, and its slice() creates **mutable** copy
@@ -68,19 +63,16 @@ export function ensureBytes(hex, expectedLength) {
     return bytes;
 }
 // Copies several Uint8Arrays into one.
-export 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;
+export 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;
 }
 export function equalBytes(b1, b2) {
     // We don't care about timing attacks here
@@ -107,3 +99,32 @@ export const bitSet = (n, pos, value) => n | ((value ? _1n : _0n) << BigInt(pos)
 // Return mask for N bits (Same as BigInt(`0b${Array(i).fill('1').join('')}`))
 // Not using ** operator with bigints for old engines.
 export const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;
+export 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;
+}

package/lib/esm/abstract/weierstrass.js

@@ -3,23 +3,23 @@
 import * as mod from './modular.js';
 import * as ut from './utils.js';
 import { ensureBytes } from './utils.js';
-import { wNAF, validateAbsOpts, } from './curve.js';
+import { wNAF, validateBasic } from './curve.js';
 function validatePointOpts(curve) {
-    const opts = 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 = 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' ||
@@ -28,11 +28,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
@@ -113,39 +108,28 @@ export 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(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(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();
@@ -499,14 +483,16 @@ export function weierstrassPoints(opts) {
     };
 }
 function validateOpts(curve) {
-    const opts = 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 = 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
@@ -615,7 +601,7 @@ export 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`);
             }
         },
     });
@@ -677,7 +663,7 @@ export 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();
@@ -800,9 +786,10 @@ export 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);
     }
@@ -812,6 +799,7 @@ export 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))
@@ -819,28 +807,20 @@ export 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(ensureBytes(msgHash));
+            msgHash = hash(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(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 = 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(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!
@@ -950,7 +930,6 @@ export function weierstrass(curveDef) {
         getSharedSecret,
         sign,
         verify,
-        // Point,
         ProjectivePoint: Point,
         Signature,
         utils,

package/lib/esm/p224.js

@@ -8,7 +8,7 @@ export const P224 = createCurve({
     // Params: a, b
     a: BigInt('0xfffffffffffffffffffffffffffffffefffffffffffffffffffffffe'),
     b: BigInt('0xb4050a850c04b3abf54132565044b0b7d7bfd8ba270b39432355ffb4'),
-    // Field over which we'll do calculations; 2n**224n - 2n**96n + 1n
+    // Field over which we'll do calculations;
     Fp: Fp(BigInt('0xffffffffffffffffffffffffffffffff000000000000000000000001')),
     // Curve order, total count of valid points in the field
     n: BigInt('0xffffffffffffffffffffffffffff16a2e0b8f03e13dd29455c5c2a3d'),

package/lib/esm/p521.js

@@ -1,7 +1,6 @@
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 import { createCurve } from './_shortw_utils.js';
 import { sha512 } from '@noble/hashes/sha512';
-import { bytesToHex } from './abstract/utils.js';
 import { Fp as Field } from './abstract/modular.js';
 import { mapToCurveSimpleSWU } from './abstract/weierstrass.js';
 import * as htf from './abstract/hash-to-curve.js';
@@ -33,18 +32,7 @@ export const P521 = createCurve({
     Gy: BigInt('0x011839296a789a3bc0045c8a5fb42c7d1bd998f54449579b446817afbd17273e662c97ee72995ef42640c550b9013fad0761353c7086a272c24088be94769fd16650'),
     h: BigInt(1),
     lowS: false,
-    // P521 keys could be 130, 131, 132 bytes. We normalize to 132 bytes.
-    // Does not replace validation; invalid keys would still be rejected.
-    normalizePrivateKey(key) {
-        if (typeof key === 'bigint')
-            return key;
-        if (key instanceof Uint8Array)
-            key = bytesToHex(key);
-        if (typeof key !== 'string' || !([130, 131, 132].includes(key.length))) {
-            throw new Error('Invalid key');
-        }
-        return key.padStart(66 * 2, '0'); // ensure it's always 132 bytes
-    },
+    allowedPrivateKeyLengths: [130, 131, 132] // P521 keys are variable-length. Normalize to 132b
 }, sha512);
 export const secp521r1 = P521;
 const { hashToCurve, encodeToCurve } = htf.hashToCurve(secp521r1.ProjectivePoint, (scalars) => mapSWU(scalars[0]), {