@bsv/sdk 1.6.15 → 1.6.17

package/dist/esm/src/primitives/ECDSA.js

@@ -49,264 +49,73 @@ function truncateToN(msg, truncOnly, curve = new Curve()) {
  * const signature = sign(msg, key)
  */
 export const sign = (msg, key, forceLowS = false, customK) => {
-    if (typeof BigInt === 'function') {
-        // Curve parameters for secp256k1
-        const zero = BigInt(0);
-        const one = BigInt(1);
-        const two = BigInt(2);
-        const n = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141'); // Order of the curve
-        const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F'); // Field prime
-        const Gx = BigInt('0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798');
-        const Gy = BigInt('0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8');
-        const G = { x: Gx, y: Gy };
-        // Convert msg and key to BigInt
-        const z = BigInt('0x' + msg.toString(16));
-        const d = BigInt('0x' + key.toString(16));
-        // Validate private key
-        if (d <= zero || d >= n) {
-            throw new Error('Invalid private key');
+    const curve = new Curve();
+    msg = truncateToN(msg);
+    // Zero-extend key to provide enough entropy
+    const bytes = curve.n.byteLength();
+    const bkey = key.toArray('be', bytes);
+    // Zero-extend nonce to have the same byte size as N
+    const nonce = msg.toArray('be', bytes);
+    // Instantiate Hmac_DRBG
+    const drbg = new DRBG(bkey, nonce);
+    // Number of bytes to generate
+    const ns1 = curve.n.subn(1);
+    for (let iter = 0;; iter++) {
+        // Compute the k-value
+        let k = typeof customK === 'function'
+            ? customK(iter)
+            : BigNumber.isBN(customK)
+                ? customK
+                : new BigNumber(drbg.generate(bytes), 16);
+        if (k != null) {
+            k = truncateToN(k, true);
         }
-        // Helper function to convert BigInt to byte array
-        function bigIntToBytes(value, length) {
-            const hex = value.toString(16).padStart(length * 2, '0');
-            const bytes = new Uint8Array(length);
-            for (let i = 0; i < length; i++) {
-                bytes[i] = parseInt(hex.substr(i * 2, 2), 16);
-            }
-            return bytes;
+        else {
+            throw new Error('k is undefined');
         }
-        // Zero-extend key to provide enough entropy
-        const bytes = 32; // Assuming 256-bit curve
-        const bkey = bigIntToBytes(d, bytes); // 'd' is the private key BigInt
-        // Zero-extend nonce to have the same byte size as N
-        const nonce = bigIntToBytes(z, bytes); // 'z' is the message hash BigInt
-        // Instantiate Hmac_DRBG
-        const drbg = new DRBG(Array.from(bkey), Array.from(nonce));
-        // Number of bytes to generate
-        const ns1 = n - one;
-        let iter = 0;
-        // Truncate to N function for BigInt
-        function truncateToN(k, n, truncOnly = true) {
-            const kBitLength = k.toString(2).length;
-            const nBitLength = n.toString(2).length;
-            const delta = kBitLength - nBitLength;
-            if (delta > 0) {
-                k = k >> BigInt(delta);
-            }
-            if (!truncOnly && k >= n) {
-                return k - n;
+        if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0) {
+            if (BigNumber.isBN(customK)) {
+                throw new Error('Invalid fixed custom K value (must be more than 1 and less than N-1)');
             }
             else {
-                return k;
+                continue;
             }
         }
-        function generateK(customK) {
-            if (typeof customK === 'function') {
-                // Call customK function to get k as BigNumber
-                const kbn = customK(iter);
-                // Convert k_bn (BigNumber) to BigInt
-                const kstr = kbn.toString(16);
-                return BigInt('0x' + kstr);
-            }
-            else if ((customK != null) && BigNumber.isBN(customK)) {
-                // Use customK provided, convert to BigInt
-                const kstr = customK.toString(16);
-                return BigInt('0x' + kstr);
+        const kp = curve.g.mul(k);
+        if (kp.isInfinity()) {
+            if (BigNumber.isBN(customK)) {
+                throw new Error('Invalid fixed custom K value (must not create a point at infinity when multiplied by the generator point)');
             }
             else {
-                // Use DRBG to generate k
-                const khex = drbg.generate(bytes); // Generate hex string
-                return BigInt('0x' + khex);
-            }
-        }
-        // Modular arithmetic functions
-        function mod(a, m) {
-            return ((a % m) + m) % m;
-        }
-        function modInv(a, m) {
-            let lm = one;
-            let hm = zero;
-            let low = mod(a, m);
-            let high = m;
-            while (low > one) {
-                const r = high / low;
-                const nm = hm - lm * r;
-                const neww = high - low * r;
-                hm = lm;
-                lm = nm;
-                high = low;
-                low = neww;
+                continue;
             }
-            return mod(lm, m);
         }
-        function pointAdd(P, Q) {
-            if (P === null)
-                return Q;
-            if (Q === null)
-                return P;
-            if (P.x === Q.x && P.y === mod(-Q.y, p)) {
-                return null; // Point at infinity
-            }
-            let m;
-            if (P.x === Q.x && P.y === Q.y) {
-                // Point doubling
-                if (P.y === zero) {
-                    return null; // Point at infinity
-                }
-                const numerator = mod(BigInt(3) * P.x * P.x, p); // 3 * x^2
-                const denominator = modInv(two * P.y, p);
-                m = mod(numerator * denominator, p);
+        const kpX = kp.getX();
+        const r = kpX.umod(curve.n);
+        if (r.cmpn(0) === 0) {
+            if (BigNumber.isBN(customK)) {
+                throw new Error('Invalid fixed custom K value (when multiplied by G, the resulting x coordinate mod N must not be zero)');
             }
             else {
-                const numerator = mod(Q.y - P.y, p);
-                const denominator = modInv(Q.x - P.x, p);
-                m = mod(numerator * denominator, p);
-            }
-            const xR = mod(m * m - P.x - Q.x, p);
-            const yR = mod(m * (P.x - xR) - P.y, p);
-            return { x: xR, y: yR };
-        }
-        function scalarMul(k, P) {
-            let N = P;
-            let Q = null;
-            while (k > BigInt(0)) {
-                if (k % BigInt(2) === BigInt(1)) {
-                    Q = Q === null ? N : (pointAdd(Q, N) ?? Q);
-                }
-                N = pointAdd(N, N) ?? N;
-                k >>= BigInt(1);
-            }
-            if (Q === null) {
-                throw new Error('Scalar multiplication resulted in an invalid point.');
+                continue;
             }
-            return Q;
-        }
-        let validSignature = false;
-        while (!validSignature) {
-            iter += 1;
-            validSignature = true;
-            iter += 1;
-            // Generate k value
-            let k = generateK(customK);
-            // Truncate k to n bits
-            k = truncateToN(k, n, true);
-            if (k <= one || k >= ns1) {
-                if (customK instanceof BigNumber) {
-                    throw new Error('Invalid fixed custom K value (must be more than 1 and less than N-1)');
-                }
-                else {
-                    continue;
-                }
-            }
-            const R = scalarMul(k, G);
-            if (R === null) {
-                if (customK instanceof BigNumber) {
-                    throw new Error('Invalid fixed custom K value (must not create a point at infinity when multiplied by the generator point)');
-                }
-                else {
-                    continue;
-                }
-            }
-            const r = mod(R.x, n);
-            if (r === zero) {
-                if (customK instanceof BigNumber) {
-                    throw new Error('Invalid fixed custom K value (when multiplied by G, the resulting x coordinate mod N must not be zero)');
-                }
-                else {
-                    continue;
-                }
-            }
-            const kInv = modInv(k, n);
-            const rd = mod(r * d, n);
-            let s = mod(kInv * (z + rd), n);
-            if (s === zero) {
-                if (customK instanceof BigNumber) {
-                    throw new Error('Invalid fixed custom K value (when used with the key, it cannot create a zero value for S)');
-                }
-                else {
-                    continue;
-                }
-            }
-            // Use complement of `s` if it is > n / 2
-            if (forceLowS && s > n / two) {
-                s = n - s;
-            }
-            // Return signature as BigNumbers
-            const rbn = new BigNumber(r.toString(16), 16);
-            const sbn = new BigNumber(s.toString(16), 16);
-            return new Signature(rbn, sbn);
         }
-    }
-    else {
-        const curve = new Curve();
-        msg = truncateToN(msg);
-        // Zero-extend key to provide enough entropy
-        const bytes = curve.n.byteLength();
-        const bkey = key.toArray('be', bytes);
-        // Zero-extend nonce to have the same byte size as N
-        const nonce = msg.toArray('be', bytes);
-        // Instantiate Hmac_DRBG
-        const drbg = new DRBG(bkey, nonce);
-        // Number of bytes to generate
-        const ns1 = curve.n.subn(1);
-        for (let iter = 0;; iter++) {
-            // Compute the k-value
-            let k = typeof customK === 'function'
-                ? customK(iter)
-                : BigNumber.isBN(customK)
-                    ? customK
-                    : new BigNumber(drbg.generate(bytes), 16);
-            if (k != null) {
-                k = truncateToN(k, true);
+        let s = k.invm(curve.n).mul(r.mul(key).iadd(msg));
+        s = s.umod(curve.n);
+        if (s.cmpn(0) === 0) {
+            if (BigNumber.isBN(customK)) {
+                throw new Error('Invalid fixed custom K value (when used with the key, it cannot create a zero value for S)');
             }
             else {
-                throw new Error('k is undefined');
+                continue;
             }
-            if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0) {
-                if (BigNumber.isBN(customK)) {
-                    throw new Error('Invalid fixed custom K value (must be more than 1 and less than N-1)');
-                }
-                else {
-                    continue;
-                }
-            }
-            const kp = curve.g.mul(k);
-            if (kp.isInfinity()) {
-                if (BigNumber.isBN(customK)) {
-                    throw new Error('Invalid fixed custom K value (must not create a point at infinity when multiplied by the generator point)');
-                }
-                else {
-                    continue;
-                }
-            }
-            const kpX = kp.getX();
-            const r = kpX.umod(curve.n);
-            if (r.cmpn(0) === 0) {
-                if (BigNumber.isBN(customK)) {
-                    throw new Error('Invalid fixed custom K value (when multiplied by G, the resulting x coordinate mod N must not be zero)');
-                }
-                else {
-                    continue;
-                }
-            }
-            let s = k.invm(curve.n).mul(r.mul(key).iadd(msg));
-            s = s.umod(curve.n);
-            if (s.cmpn(0) === 0) {
-                if (BigNumber.isBN(customK)) {
-                    throw new Error('Invalid fixed custom K value (when used with the key, it cannot create a zero value for S)');
-                }
-                else {
-                    continue;
-                }
-            }
-            // Use complement of `s`, if it is > `n / 2`
-            if (forceLowS && s.cmp(curve.n.ushrn(1)) > 0) {
-                s = curve.n.sub(s);
-            }
-            return new Signature(r, s);
         }
+        // Use complement of `s`, if it is > `n / 2`
+        if (forceLowS && s.cmp(curve.n.ushrn(1)) > 0) {
+            s = curve.n.sub(s);
+        }
+        return new Signature(r, s);
     }
-    throw new Error('Failed to generate a valid signature');
 };
 /**
  * Verifies a digital signature of a given message.
@@ -327,173 +136,143 @@ export const sign = (msg, key, forceLowS = false, customK) => {
  * const isVerified = verify(msg, sig, key)
  */
 export const verify = (msg, sig, key) => {
-    // Use BigInt for verification opportunistically
-    if (typeof BigInt === 'function') {
-        // Curve parameters for secp256k1
-        const zero = BigInt(0);
-        const one = BigInt(1);
-        const two = BigInt(2);
-        const three = BigInt(3);
-        const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F'); // Field prime
-        const n = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141'); // Order of the curve
-        const G = {
-            x: BigInt('0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798'),
-            y: BigInt('0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8')
-        };
-        // Modular arithmetic functions
-        const mod = (a, m) => ((a % m) + m) % m;
-        const modInv = (a, m) => {
-            // Extended Euclidean Algorithm for modular inverse
-            let [oldr, r] = [a, m];
-            let [olds, s] = [BigInt(1), BigInt(0)];
-            while (r !== zero) {
-                const q = oldr / r;
-                [oldr, r] = [r, oldr - q * r];
-                [olds, s] = [s, olds - q * s];
-            }
-            if (oldr > one)
-                return zero; // No inverse
-            return mod(olds, m);
-        };
-        const modMul = (a, b, m) => mod(a * b, m);
-        const modSub = (a, b, m) => mod(a - b, m);
-        // Define constants
-        const four = BigInt(4);
-        const eight = BigInt(8);
-        // Point Doubling
-        const pointDouble = (P) => {
-            const { X: X1, Y: Y1, Z: Z1 } = P;
-            if (Y1 === zero) {
-                return { X: zero, Y: one, Z: zero }; // Point at infinity
-            }
-            const Y1sq = modMul(Y1, Y1, p); // Y1^2
-            const S = modMul(four, modMul(X1, Y1sq, p), p); // S = 4 * X1 * Y1^2
-            const M = modMul(three, modMul(X1, X1, p), p); // M = 3 * X1^2
-            const X3 = modSub(modMul(M, M, p), modMul(two, S, p), p); // X3 = M^2 - 2 * S
-            const Y3 = modSub(modMul(M, modSub(S, X3, p), p), modMul(eight, modMul(Y1sq, Y1sq, p), p), p); // Y3 = M * (S - X3) - 8 * Y1^4
-            const Z3 = modMul(two, modMul(Y1, Z1, p), p); // Z3 = 2 * Y1 * Z1
-            return { X: X3, Y: Y3, Z: Z3 };
-        };
-        // Point Addition
-        const pointAdd = (P, Q) => {
-            if (P.Z === zero)
-                return Q;
-            if (Q.Z === zero)
-                return P;
-            const Z1Z1 = modMul(P.Z, P.Z, p);
-            const Z2Z2 = modMul(Q.Z, Q.Z, p);
-            const U1 = modMul(P.X, Z2Z2, p);
-            const U2 = modMul(Q.X, Z1Z1, p);
-            const S1 = modMul(P.Y, modMul(Z2Z2, Q.Z, p), p);
-            const S2 = modMul(Q.Y, modMul(Z1Z1, P.Z, p), p);
-            const H = modSub(U2, U1, p);
-            const r = modSub(S2, S1, p);
-            if (H === zero) {
-                if (r === zero) {
-                    // P == Q
-                    return pointDouble(P);
-                }
-                else {
-                    // Point at infinity
-                    return { X: zero, Y: one, Z: zero };
-                }
-            }
-            const HH = modMul(H, H, p);
-            const HHH = modMul(H, HH, p);
-            const V = modMul(U1, HH, p);
-            const X3 = modSub(modSub(modMul(r, r, p), HHH, p), modMul(two, V, p), p);
-            const Y3 = modSub(modMul(r, modSub(V, X3, p), p), modMul(S1, HHH, p), p);
-            const Z3 = modMul(H, modMul(P.Z, Q.Z, p), p);
-            return { X: X3, Y: Y3, Z: Z3 };
-        };
-        // Scalar Multiplication
-        const scalarMultiply = (k, P) => {
-            const N = { X: P.x, Y: P.y, Z: one };
-            let Q = { X: zero, Y: one, Z: zero }; // Point at infinity
-            const kBin = k.toString(2);
-            for (let i = 0; i < kBin.length; i++) {
-                Q = pointDouble(Q);
-                if (kBin[i] === '1') {
-                    Q = pointAdd(Q, N);
-                }
-            }
+    // Curve parameters for secp256k1
+    const zero = BigInt(0);
+    const one = BigInt(1);
+    const two = BigInt(2);
+    const three = BigInt(3);
+    const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F'); // Field prime
+    const n = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141'); // Order of the curve
+    const G = {
+        x: BigInt('0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798'),
+        y: BigInt('0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8')
+    };
+    // Modular arithmetic functions
+    const mod = (a, m) => ((a % m) + m) % m;
+    const modInv = (a, m) => {
+        // Extended Euclidean Algorithm for modular inverse
+        let [oldr, r] = [a, m];
+        let [olds, s] = [BigInt(1), BigInt(0)];
+        while (r !== zero) {
+            const q = oldr / r;
+            [oldr, r] = [r, oldr - q * r];
+            [olds, s] = [s, olds - q * s];
+        }
+        if (oldr > one)
+            return zero; // No inverse
+        return mod(olds, m);
+    };
+    const modMul = (a, b, m) => mod(a * b, m);
+    const modSub = (a, b, m) => mod(a - b, m);
+    // Define constants
+    const four = BigInt(4);
+    const eight = BigInt(8);
+    // Point Doubling
+    const pointDouble = (P) => {
+        const { X: X1, Y: Y1, Z: Z1 } = P;
+        if (Y1 === zero) {
+            return { X: zero, Y: one, Z: zero }; // Point at infinity
+        }
+        const Y1sq = modMul(Y1, Y1, p); // Y1^2
+        const S = modMul(four, modMul(X1, Y1sq, p), p); // S = 4 * X1 * Y1^2
+        const M = modMul(three, modMul(X1, X1, p), p); // M = 3 * X1^2
+        const X3 = modSub(modMul(M, M, p), modMul(two, S, p), p); // X3 = M^2 - 2 * S
+        const Y3 = modSub(modMul(M, modSub(S, X3, p), p), modMul(eight, modMul(Y1sq, Y1sq, p), p), p); // Y3 = M * (S - X3) - 8 * Y1^4
+        const Z3 = modMul(two, modMul(Y1, Z1, p), p); // Z3 = 2 * Y1 * Z1
+        return { X: X3, Y: Y3, Z: Z3 };
+    };
+    // Point Addition
+    const pointAdd = (P, Q) => {
+        if (P.Z === zero)
             return Q;
-        };
-        // Verify Function Using Jacobian Coordinates
-        const verifyECDSA = (hash, publicKey, signature) => {
-            const { r, s } = signature;
-            const z = hash;
-            // Check r and s are in [1, n - 1]
-            if (r <= zero || r >= n || s <= zero || s >= n) {
-                return false;
-            }
-            const w = modInv(s, n); // w = s^-1 mod n
-            if (w === zero) {
-                return false; // No inverse exists
+        if (Q.Z === zero)
+            return P;
+        const Z1Z1 = modMul(P.Z, P.Z, p);
+        const Z2Z2 = modMul(Q.Z, Q.Z, p);
+        const U1 = modMul(P.X, Z2Z2, p);
+        const U2 = modMul(Q.X, Z1Z1, p);
+        const S1 = modMul(P.Y, modMul(Z2Z2, Q.Z, p), p);
+        const S2 = modMul(Q.Y, modMul(Z1Z1, P.Z, p), p);
+        const H = modSub(U2, U1, p);
+        const r = modSub(S2, S1, p);
+        if (H === zero) {
+            if (r === zero) {
+                // P == Q
+                return pointDouble(P);
             }
-            const u1 = modMul(z, w, n);
-            const u2 = modMul(r, w, n);
-            // Compute point R = u1 * G + u2 * Q
-            const RG = scalarMultiply(u1, G);
-            const RQ = scalarMultiply(u2, publicKey);
-            const R = pointAdd(RG, RQ);
-            if (R.Z === zero) {
+            else {
                 // Point at infinity
-                return false;
+                return { X: zero, Y: one, Z: zero };
             }
-            // Compute affine x-coordinate x1 = X / Z^2 mod p
-            const ZInv = modInv(R.Z, p);
-            if (ZInv === zero) {
-                return false; // No inverse exists
+        }
+        const HH = modMul(H, H, p);
+        const HHH = modMul(H, HH, p);
+        const V = modMul(U1, HH, p);
+        const X3 = modSub(modSub(modMul(r, r, p), HHH, p), modMul(two, V, p), p);
+        const Y3 = modSub(modMul(r, modSub(V, X3, p), p), modMul(S1, HHH, p), p);
+        const Z3 = modMul(H, modMul(P.Z, Q.Z, p), p);
+        return { X: X3, Y: Y3, Z: Z3 };
+    };
+    // Scalar Multiplication
+    const scalarMultiply = (k, P) => {
+        const N = { X: P.x, Y: P.y, Z: one };
+        let Q = { X: zero, Y: one, Z: zero }; // Point at infinity
+        const kBin = k.toString(2);
+        for (let i = 0; i < kBin.length; i++) {
+            Q = pointDouble(Q);
+            if (kBin[i] === '1') {
+                Q = pointAdd(Q, N);
             }
-            const ZInv2 = modMul(ZInv, ZInv, p);
-            const x1affine = modMul(R.X, ZInv2, p);
-            // Compute v = x1_affine mod n
-            const v = mod(x1affine, n);
-            // Signature is valid if v == r mod n
-            return v === r;
-        };
-        // Convert inputs to BigInt
-        const hash = BigInt('0x' + msg.toString(16));
-        if ((key.x == null) || (key.y == null)) {
-            throw new Error('Invalid public key: missing coordinates.');
         }
-        const publicKey = {
-            x: BigInt('0x' + key.x.toString(16)),
-            y: BigInt('0x' + key.y.toString(16))
-        };
-        const signature = {
-            r: BigInt('0x' + sig.r.toString(16)),
-            s: BigInt('0x' + sig.s.toString(16))
-        };
-        return verifyECDSA(hash, publicKey, signature);
-    }
-    else {
-        const curve = new Curve();
-        msg = truncateToN(msg);
-        // Perform primitive values validation
-        const r = sig.r;
-        const s = sig.s;
-        if (r.cmpn(1) < 0 || r.cmp(curve.n) >= 0) {
+        return Q;
+    };
+    // Verify Function Using Jacobian Coordinates
+    const verifyECDSA = (hash, publicKey, signature) => {
+        const { r, s } = signature;
+        const z = hash;
+        // Check r and s are in [1, n - 1]
+        if (r <= zero || r >= n || s <= zero || s >= n) {
             return false;
         }
-        if (s.cmpn(1) < 0 || s.cmp(curve.n) >= 0) {
-            return false;
+        const w = modInv(s, n); // w = s^-1 mod n
+        if (w === zero) {
+            return false; // No inverse exists
         }
-        // Validate signature
-        const sinv = s.invm(curve.n);
-        const u1 = sinv.mul(msg).umod(curve.n);
-        const u2 = sinv.mul(r).umod(curve.n);
-        // NOTE: Greg Maxwell's trick, inspired by:
-        // https://git.io/vad3K
-        const p = curve.g.jmulAdd(u1, key, u2);
-        if (p.isInfinity()) {
+        const u1 = modMul(z, w, n);
+        const u2 = modMul(r, w, n);
+        // Compute point R = u1 * G + u2 * Q
+        const RG = scalarMultiply(u1, G);
+        const RQ = scalarMultiply(u2, publicKey);
+        const R = pointAdd(RG, RQ);
+        if (R.Z === zero) {
+            // Point at infinity
             return false;
         }
-        // Compare `p.x` of Jacobian point with `r`,
-        // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the
-        // inverse of `p.z^2`
-        return p.eqXToP(r);
+        // Compute affine x-coordinate x1 = X / Z^2 mod p
+        const ZInv = modInv(R.Z, p);
+        if (ZInv === zero) {
+            return false; // No inverse exists
+        }
+        const ZInv2 = modMul(ZInv, ZInv, p);
+        const x1affine = modMul(R.X, ZInv2, p);
+        // Compute v = x1_affine mod n
+        const v = mod(x1affine, n);
+        // Signature is valid if v == r mod n
+        return v === r;
+    };
+    // Convert inputs to BigInt
+    const hash = BigInt('0x' + msg.toString(16));
+    if ((key.x == null) || (key.y == null)) {
+        throw new Error('Invalid public key: missing coordinates.');
     }
+    const publicKey = {
+        x: BigInt('0x' + key.x.toString(16)),
+        y: BigInt('0x' + key.y.toString(16))
+    };
+    const signature = {
+        r: BigInt('0x' + sig.r.toString(16)),
+        s: BigInt('0x' + sig.s.toString(16))
+    };
+    return verifyECDSA(hash, publicKey, signature);
 };
 //# sourceMappingURL=ECDSA.js.map