@bsv/sdk 1.6.16 → 1.6.18

package/dist/cjs/src/primitives/Point.js

@@ -104,98 +104,63 @@ class Point extends BasePoint_js_1.default {
      * const point = Point.fromX(xCoordinate, true);
      */
     static fromX(x, odd) {
-        if (typeof BigInt === 'function') {
-            function mod(a, n) {
-                return ((a % n) + n) % n;
-            }
-            function modPow(base, exponent, modulus) {
-                let result = BigInt(1);
-                base = mod(base, modulus);
-                while (exponent > BigInt(0)) {
-                    if ((exponent & BigInt(1)) === BigInt(1)) {
-                        result = mod(result * base, modulus);
-                    }
-                    exponent >>= BigInt(1);
-                    base = mod(base * base, modulus);
-                }
-                return result;
-            }
-            function sqrtMod(a, p) {
-                const exponent = (p + BigInt(1)) >> BigInt(2); // Precomputed exponent
-                const sqrtCandidate = modPow(a, exponent, p);
-                if (mod(sqrtCandidate * sqrtCandidate, p) === mod(a, p)) {
-                    return sqrtCandidate;
-                }
-                else {
-                    // No square root exists
-                    return null;
+        function mod(a, n) {
+            return ((a % n) + n) % n;
+        }
+        function modPow(base, exponent, modulus) {
+            let result = BigInt(1);
+            base = mod(base, modulus);
+            while (exponent > BigInt(0)) {
+                if ((exponent & BigInt(1)) === BigInt(1)) {
+                    result = mod(result * base, modulus);
                 }
+                exponent >>= BigInt(1);
+                base = mod(base * base, modulus);
             }
-            // Curve parameters for secp256k1
-            const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F');
-            // const a = BigInt(0)
-            const b = BigInt(7);
-            // Convert x to BigInt
-            let xBigInt;
-            if (x instanceof BigNumber_js_1.default) {
-                xBigInt = BigInt('0x' + x.toString(16));
-            }
-            else if (typeof x === 'string') {
-                xBigInt = BigInt('0x' + x);
-            }
-            else if (Array.isArray(x)) {
-                xBigInt = BigInt('0x' + (0, utils_js_1.toHex)(x).padStart(64, '0'));
-            }
-            else if (typeof x === 'number') {
-                xBigInt = BigInt(x);
+            return result;
+        }
+        function sqrtMod(a, p) {
+            const exponent = (p + BigInt(1)) >> BigInt(2);
+            const sqrtCandidate = modPow(a, exponent, p);
+            if (mod(sqrtCandidate * sqrtCandidate, p) === mod(a, p)) {
+                return sqrtCandidate;
             }
             else {
-                throw new Error('Invalid x-coordinate type');
+                return null;
             }
-            // Ensure x is within field range
-            xBigInt = mod(xBigInt, p);
-            // Compute y^2 = x^3 + a x + b mod p
-            const y2 = mod(modPow(xBigInt, BigInt(3), p) + b, p);
-            // Compute modular square root y = sqrt(y2) mod p
-            let y = sqrtMod(y2, p);
-            if (y === null) {
-                throw new Error('Invalid point');
-            }
-            // Adjust y to match the oddness
-            const isYOdd = y % BigInt(2) === BigInt(1);
-            if ((odd && !isYOdd) || (!odd && isYOdd)) {
-                y = p - y;
-            }
-            // Convert x and y to BigNumber
-            const xBN = new BigNumber_js_1.default(xBigInt.toString(16), 16);
-            const yBN = new BigNumber_js_1.default(y.toString(16), 16);
-            return new Point(xBN, yBN);
+        }
+        // Curve parameters for secp256k1
+        const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F');
+        const b = BigInt(7);
+        let xBigInt;
+        if (x instanceof BigNumber_js_1.default) {
+            xBigInt = BigInt('0x' + x.toString(16));
+        }
+        else if (typeof x === 'string') {
+            xBigInt = BigInt('0x' + x);
+        }
+        else if (Array.isArray(x)) {
+            xBigInt = BigInt('0x' + (0, utils_js_1.toHex)(x).padStart(64, '0'));
+        }
+        else if (typeof x === 'number') {
+            xBigInt = BigInt(x);
         }
         else {
-            const red = new ReductionContext_js_1.default('k256');
-            const a = new BigNumber_js_1.default(0).toRed(red);
-            const b = new BigNumber_js_1.default(7).toRed(red);
-            const zero = new BigNumber_js_1.default(0).toRed(red);
-            if (!BigNumber_js_1.default.isBN(x)) {
-                x = new BigNumber_js_1.default(x, 16);
-            }
-            x = x;
-            if (x.red == null) {
-                x = x.toRed(red);
-            }
-            const y2 = x.redSqr().redMul(x).redIAdd(x.redMul(a)).redIAdd(b);
-            let y = y2.redSqrt();
-            if (y.redSqr().redSub(y2).cmp(zero) !== 0) {
-                throw new Error('invalid point');
-            }
-            // XXX Is there any way to tell if the number is odd without converting it
-            // to non-red form?
-            const isOdd = y.fromRed().isOdd();
-            if ((odd && !isOdd) || (!odd && isOdd)) {
-                y = y.redNeg();
-            }
-            return new Point(x, y);
+            throw new Error('Invalid x-coordinate type');
+        }
+        xBigInt = mod(xBigInt, p);
+        const y2 = mod(modPow(xBigInt, BigInt(3), p) + b, p);
+        let y = sqrtMod(y2, p);
+        if (y === null) {
+            throw new Error('Invalid point');
         }
+        const isYOdd = y % BigInt(2) === BigInt(1);
+        if ((odd && !isYOdd) || (!odd && isYOdd)) {
+            y = p - y;
+        }
+        const xBN = new BigNumber_js_1.default(xBigInt.toString(16), 16);
+        const yBN = new BigNumber_js_1.default(y.toString(16), 16);
+        return new Point(xBN, yBN);
     }
     /**
      * Generates a point from a serialized JSON object. The function accounts for different options in the JSON object,
@@ -388,14 +353,13 @@ class Point extends BasePoint_js_1.default {
      * console.log(aPoint.inspect());
      */
     inspect() {
-        var _a, _b, _c, _d, _e, _f;
         if (this.isInfinity()) {
             return '<EC Point Infinity>';
         }
         return ('<EC Point x: ' +
-            ((_c = (_b = (_a = this.x) === null || _a === void 0 ? void 0 : _a.fromRed()) === null || _b === void 0 ? void 0 : _b.toString(16, 2)) !== null && _c !== void 0 ? _c : 'undefined') +
+            (this.x?.fromRed()?.toString(16, 2) ?? 'undefined') +
             ' y: ' +
-            ((_f = (_e = (_d = this.y) === null || _d === void 0 ? void 0 : _d.fromRed()) === null || _e === void 0 ? void 0 : _e.toString(16, 2)) !== null && _f !== void 0 ? _f : 'undefined') +
+            (this.y?.fromRed()?.toString(16, 2) ?? 'undefined') +
             '>');
     }
     /**
@@ -423,7 +387,6 @@ class Point extends BasePoint_js_1.default {
      * const result = p1.add(p2);
      */
     add(p) {
-        var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m;
         // O + P = P
         if (this.inf) {
             return p;
@@ -441,18 +404,18 @@ class Point extends BasePoint_js_1.default {
             return new Point(new BigNumber_js_1.default(0), new BigNumber_js_1.default(0));
         }
         // P + Q = O
-        if (((_a = this.x) === null || _a === void 0 ? void 0 : _a.cmp((_b = p.x) !== null && _b !== void 0 ? _b : new BigNumber_js_1.default(0))) === 0) {
+        if (this.x?.cmp(p.x ?? new BigNumber_js_1.default(0)) === 0) {
             return new Point(new BigNumber_js_1.default(0), new BigNumber_js_1.default(0));
         }
-        let c = (_e = (_c = this.y) === null || _c === void 0 ? void 0 : _c.redSub((_d = p.y) !== null && _d !== void 0 ? _d : new BigNumber_js_1.default(0))) !== null && _e !== void 0 ? _e : new BigNumber_js_1.default(0);
+        let c = this.y?.redSub(p.y ?? new BigNumber_js_1.default(0)) ?? new BigNumber_js_1.default(0);
         if (c.cmpn(0) !== 0) {
-            c = c.redMul((_h = (_f = this.x) === null || _f === void 0 ? void 0 : _f.redSub((_g = p.x) !== null && _g !== void 0 ? _g : new BigNumber_js_1.default(0)).redInvm()) !== null && _h !== void 0 ? _h : new BigNumber_js_1.default(1));
+            c = c.redMul(this.x?.redSub(p.x ?? new BigNumber_js_1.default(0)).redInvm() ?? new BigNumber_js_1.default(1));
         }
-        const nx = c === null || c === void 0 ? void 0 : c.redSqr().redISub((_j = this.x) !== null && _j !== void 0 ? _j : new BigNumber_js_1.default(0)).redISub((_k = p.x) !== null && _k !== void 0 ? _k : new BigNumber_js_1.default(0));
-        const ny = (c !== null && c !== void 0 ? c : new BigNumber_js_1.default(1))
-            .redMul(((_l = this.x) !== null && _l !== void 0 ? _l : new BigNumber_js_1.default(0)).redSub(nx !== null && nx !== void 0 ? nx : new BigNumber_js_1.default(0)))
-            .redISub((_m = this.y) !== null && _m !== void 0 ? _m : new BigNumber_js_1.default(0));
-        return new Point(nx !== null && nx !== void 0 ? nx : new BigNumber_js_1.default(0), ny !== null && ny !== void 0 ? ny : new BigNumber_js_1.default(0));
+        const nx = c?.redSqr().redISub(this.x ?? new BigNumber_js_1.default(0)).redISub(p.x ?? new BigNumber_js_1.default(0));
+        const ny = (c ?? new BigNumber_js_1.default(1))
+            .redMul((this.x ?? new BigNumber_js_1.default(0)).redSub(nx ?? new BigNumber_js_1.default(0)))
+            .redISub(this.y ?? new BigNumber_js_1.default(0));
+        return new Point(nx ?? new BigNumber_js_1.default(0), ny ?? new BigNumber_js_1.default(0));
     }
     /**
      * Doubles the current point.
@@ -464,21 +427,20 @@ class Point extends BasePoint_js_1.default {
      * const result = P.dbl();
      * */
     dbl() {
-        var _a, _b, _c, _d, _e, _f, _g;
         if (this.inf) {
             return this;
         }
         // 2P = O
-        const ys1 = ((_a = this.y) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).redAdd((_b = this.y) !== null && _b !== void 0 ? _b : new BigNumber_js_1.default(0));
+        const ys1 = (this.y ?? new BigNumber_js_1.default(0)).redAdd(this.y ?? new BigNumber_js_1.default(0));
         if (ys1.cmpn(0) === 0) {
             return new Point(new BigNumber_js_1.default(0), new BigNumber_js_1.default(0));
         }
         const a = this.curve.a;
-        const x2 = ((_c = this.x) !== null && _c !== void 0 ? _c : new BigNumber_js_1.default(0)).redSqr();
+        const x2 = (this.x ?? new BigNumber_js_1.default(0)).redSqr();
         const dyinv = ys1.redInvm();
         const c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);
-        const nx = c.redSqr().redISub(((_d = this.x) !== null && _d !== void 0 ? _d : new BigNumber_js_1.default(0)).redAdd((_e = this.x) !== null && _e !== void 0 ? _e : new BigNumber_js_1.default(0)));
-        const ny = c.redMul(((_f = this.x) !== null && _f !== void 0 ? _f : new BigNumber_js_1.default(0)).redSub(nx)).redISub((_g = this.y) !== null && _g !== void 0 ? _g : new BigNumber_js_1.default(0));
+        const nx = c.redSqr().redISub((this.x ?? new BigNumber_js_1.default(0)).redAdd(this.x ?? new BigNumber_js_1.default(0)));
+        const ny = c.redMul((this.x ?? new BigNumber_js_1.default(0)).redSub(nx)).redISub(this.y ?? new BigNumber_js_1.default(0));
         return new Point(nx, ny);
     }
     /**
@@ -489,8 +451,7 @@ class Point extends BasePoint_js_1.default {
      * const x = P.getX();
      */
     getX() {
-        var _a;
-        return ((_a = this.x) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).fromRed();
+        return (this.x ?? new BigNumber_js_1.default(0)).fromRed();
     }
     /**
      * Returns X coordinate of point
@@ -500,8 +461,7 @@ class Point extends BasePoint_js_1.default {
      * const x = P.getX();
      */
     getY() {
-        var _a;
-        return ((_a = this.y) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).fromRed();
+        return (this.y ?? new BigNumber_js_1.default(0)).fromRed();
     }
     /**
      * Multiplies this Point by a scalar value, returning a new Point.
@@ -523,12 +483,8 @@ class Point extends BasePoint_js_1.default {
             if (this.inf) {
                 return this;
             }
-            const zero = BigInt(0);
-            const one = BigInt(1);
-            const two = BigInt(2);
-            const three = BigInt(3);
-            const four = BigInt(4);
-            const eight = BigInt(8);
+            const zero = 0n;
+            const one = 1n;
             const p = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F');
             const n = BigInt('0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141');
             let kBig = BigInt('0x' + k.toString(16));
@@ -542,11 +498,18 @@ class Point extends BasePoint_js_1.default {
             if (this.x === null || this.y === null) {
                 throw new Error('Point coordinates cannot be null');
             }
-            const Px = BigInt('0x' + this.x.fromRed().toString(16));
-            const Py = BigInt('0x' + this.y.fromRed().toString(16));
+            let Px;
+            let Py;
+            if (this === this.curve.g) {
+                Px = GX_BIGINT;
+                Py = GY_BIGINT;
+            }
+            else {
+                Px = BigInt('0x' + this.x.fromRed().toString(16));
+                Py = BigInt('0x' + this.y.fromRed().toString(16));
+            }
             const mod = (a, m) => ((a % m) + m) % m;
             const modMul = (a, b, m) => mod(a * b, m);
-            const modSub = (a, b, m) => mod(a - b, m);
             const modInv = (a, m) => {
                 let lm = one;
                 let hm = zero;
@@ -563,60 +526,11 @@ class Point extends BasePoint_js_1.default {
                 }
                 return mod(lm, m);
             };
-            const pointDouble = (P) => {
-                const { X: X1, Y: Y1, Z: Z1 } = P;
-                if (Y1 === zero) {
-                    return { X: zero, Y: one, Z: zero };
-                }
-                const Y1sq = modMul(Y1, Y1, p);
-                const S = modMul(four, modMul(X1, Y1sq, p), p);
-                const M = modMul(three, modMul(X1, X1, p), p);
-                const X3 = modSub(modMul(M, M, p), modMul(two, S, p), p);
-                const Y3 = modSub(modMul(M, modSub(S, X3, p), p), modMul(eight, modMul(Y1sq, Y1sq, p), p), p);
-                const Z3 = modMul(two, modMul(Y1, Z1, p), p);
-                return { X: X3, Y: Y3, Z: Z3 };
-            };
-            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) {
-                        return pointDouble(P);
-                    }
-                    else {
-                        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 };
-            };
             const scalarMultiply = (kVal, P0) => {
-                let N = { X: P0.x, Y: P0.y, Z: one };
-                let Q = { X: zero, Y: one, Z: zero };
-                let kk = kVal;
-                while (kk > zero) {
-                    if ((kk & one) === one) {
-                        Q = pointAdd(Q, N);
-                    }
-                    N = pointDouble(N);
-                    kk >>= one;
-                }
-                return Q;
+                // Delegate to the hoisted windowed-NAF implementation above.  We
+                // keep the wrapper so that the rest of the mul() code remains
+                // untouched while providing a massive speed-up (≈4-6×).
+                return scalarMultiplyWNAF(kVal, P0);
             };
             const R = scalarMultiply(kBig, { x: Px, y: Py });
             if (R.Z === zero) {
@@ -700,10 +614,9 @@ class Point extends BasePoint_js_1.default {
      * const areEqual = p1.eq(p2); // returns true
      */
     eq(p) {
-        var _a, _b, _c, _d;
         return (this === p ||
             (this.inf === p.inf &&
-                (this.inf || (((_a = this.x) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).cmp((_b = p.x) !== null && _b !== void 0 ? _b : new BigNumber_js_1.default(0)) === 0 && ((_c = this.y) !== null && _c !== void 0 ? _c : new BigNumber_js_1.default(0)).cmp((_d = p.y) !== null && _d !== void 0 ? _d : new BigNumber_js_1.default(0)) === 0))));
+                (this.inf || ((this.x ?? new BigNumber_js_1.default(0)).cmp(p.x ?? new BigNumber_js_1.default(0)) === 0 && (this.y ?? new BigNumber_js_1.default(0)).cmp(p.y ?? new BigNumber_js_1.default(0)) === 0))));
     }
     /**
      * Negate a point. The negation of a point P is the mirror of P about x-axis.
@@ -715,11 +628,10 @@ class Point extends BasePoint_js_1.default {
      * const result = P.neg();
      */
     neg(_precompute) {
-        var _a;
         if (this.inf) {
             return this;
         }
-        const res = new Point(this.x, ((_a = this.y) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).redNeg());
+        const res = new Point(this.x, (this.y ?? new BigNumber_js_1.default(0)).redNeg());
         if (_precompute === true && this.precomputed != null) {
             const pre = this.precomputed;
             const negate = (p) => p.neg();
@@ -782,7 +694,6 @@ class Point extends BasePoint_js_1.default {
         return res;
     }
     _getBeta() {
-        var _a;
         if (typeof this.curve.endo !== 'object') {
             return;
         }
@@ -793,7 +704,7 @@ class Point extends BasePoint_js_1.default {
             pre.beta !== null) {
             return pre.beta;
         }
-        const beta = new Point(((_a = this.x) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).redMul(this.curve.endo.beta), this.y);
+        const beta = new Point((this.x ?? new BigNumber_js_1.default(0)).redMul(this.curve.endo.beta), this.y);
         if (pre != null) {
             const curve = this.curve;
             const endoMul = (p) => {
@@ -858,7 +769,6 @@ class Point extends BasePoint_js_1.default {
         return a.toP();
     }
     _wnafMulAdd(defW, points, coeffs, len, jacobianResult) {
-        var _a, _b, _c, _d;
         const wndWidth = this.curve._wnafT1.map(num => num.toNumber()); // Convert BigNumber to number
         const wnd = this.curve._wnafT2.map(() => []); // Initialize as empty Point[][] array
         const naf = this.curve._wnafT3.map(() => []); // Initialize as empty number[][] array
@@ -888,11 +798,11 @@ class Point extends BasePoint_js_1.default {
                 points[b] /* 7 */
             ];
             // Try to avoid Projective points, if possible
-            if (((_a = points[a].y) !== null && _a !== void 0 ? _a : new BigNumber_js_1.default(0)).cmp((_b = points[b].y) !== null && _b !== void 0 ? _b : new BigNumber_js_1.default(0)) === 0) {
+            if ((points[a].y ?? new BigNumber_js_1.default(0)).cmp(points[b].y ?? new BigNumber_js_1.default(0)) === 0) {
                 comb[1] = points[a].add(points[b]);
                 comb[2] = points[a].toJ().mixedAdd(points[b].neg());
             }
-            else if (((_c = points[a].y) !== null && _c !== void 0 ? _c : new BigNumber_js_1.default(0)).cmp(((_d = points[b].y) !== null && _d !== void 0 ? _d : new BigNumber_js_1.default(0)).redNeg()) === 0) {
+            else if ((points[a].y ?? new BigNumber_js_1.default(0)).cmp((points[b].y ?? new BigNumber_js_1.default(0)).redNeg()) === 0) {
                 comb[1] = points[a].toJ().mixedAdd(points[b]);
                 comb[2] = points[a].add(points[b].neg());
             }
@@ -976,14 +886,13 @@ class Point extends BasePoint_js_1.default {
     }
     _endoWnafMulAdd(points, coeffs, // Explicitly type coeffs
     jacobianResult) {
-        var _a;
         const npoints = new Array(points.length * 2);
         const ncoeffs = new Array(points.length * 2);
         let i;
         for (i = 0; i < points.length; i++) {
             const split = this.curve._endoSplit(coeffs[i]);
             let p = points[i];
-            let beta = (_a = p._getBeta()) !== null && _a !== void 0 ? _a : new Point(new BigNumber_js_1.default(0), new BigNumber_js_1.default(0));
+            let beta = p._getBeta() ?? new Point(new BigNumber_js_1.default(0), new BigNumber_js_1.default(0));
             if (split.k1.negative !== 0) {
                 split.k1.ineg();
                 p = p.neg(true);
@@ -1025,14 +934,14 @@ class Point extends BasePoint_js_1.default {
         const doubles = [this];
         /* eslint-disable @typescript-eslint/no-this-alias */
         let acc = this;
-        for (let i = 0; i < (power !== null && power !== void 0 ? power : 0); i += (step !== null && step !== void 0 ? step : 1)) {
-            for (let j = 0; j < (step !== null && step !== void 0 ? step : 1); j++) {
+        for (let i = 0; i < (power ?? 0); i += (step ?? 1)) {
+            for (let j = 0; j < (step ?? 1); j++) {
                 acc = acc.dbl();
             }
             doubles.push(acc);
         }
         return {
-            step: step !== null && step !== void 0 ? step : 1,
+            step: step ?? 1,
             points: doubles
         };
     }
@@ -1062,4 +971,131 @@ Point.a = new BigNumber_js_1.default(0).toRed(Point.red);
 Point.b = new BigNumber_js_1.default(7).toRed(Point.red);
 Point.zero = new BigNumber_js_1.default(0).toRed(Point.red);
 exports.default = Point;
+// -----------------------------------------------------------------------------
+// BigInt helpers & constants (secp256k1) – hoisted so we don't recreate them on
+// every Point.mul() call.
+// -----------------------------------------------------------------------------
+const BI_ZERO = 0n;
+const BI_ONE = 1n;
+const BI_TWO = 2n;
+const BI_THREE = 3n;
+const BI_FOUR = 4n;
+const BI_EIGHT = 8n;
+const P_BIGINT = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn;
+const MASK_256 = (1n << 256n) - 1n; // 0xffff…ffff (256 sones)
+function red(x) {
+    // first fold
+    let hi = x >> 256n;
+    x = (x & MASK_256) + (hi << 32n) + hi * 977n;
+    // second fold  (hi ≤ 2³² + 977 here, so one more pass is enough)
+    hi = x >> 256n;
+    x = (x & MASK_256) + (hi << 32n) + hi * 977n;
+    // final conditional subtraction
+    if (x >= P_BIGINT)
+        x -= P_BIGINT;
+    return x;
+}
+const biModSub = (a, b) => (a >= b ? a - b : P_BIGINT - (b - a));
+const biModMul = (a, b) => red(a * b);
+// Generator point coordinates as bigint constants
+const GX_BIGINT = BigInt('0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798');
+const GY_BIGINT = BigInt('0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8');
+// Cache for precomputed windowed tables keyed by 'window:x:y'
+const WNAF_TABLE_CACHE = new Map();
+const jpDouble = (P) => {
+    const { X: X1, Y: Y1, Z: Z1 } = P;
+    if (Y1 === BI_ZERO)
+        return { X: BI_ZERO, Y: BI_ONE, Z: BI_ZERO };
+    const Y1sq = biModMul(Y1, Y1);
+    const S = biModMul(BI_FOUR, biModMul(X1, Y1sq));
+    const M = biModMul(BI_THREE, biModMul(X1, X1));
+    const X3 = biModSub(biModMul(M, M), biModMul(BI_TWO, S));
+    const Y3 = biModSub(biModMul(M, biModSub(S, X3)), biModMul(BI_EIGHT, biModMul(Y1sq, Y1sq)));
+    const Z3 = biModMul(BI_TWO, biModMul(Y1, Z1));
+    return { X: X3, Y: Y3, Z: Z3 };
+};
+const jpAdd = (P, Q) => {
+    if (P.Z === BI_ZERO)
+        return Q;
+    if (Q.Z === BI_ZERO)
+        return P;
+    const Z1Z1 = biModMul(P.Z, P.Z);
+    const Z2Z2 = biModMul(Q.Z, Q.Z);
+    const U1 = biModMul(P.X, Z2Z2);
+    const U2 = biModMul(Q.X, Z1Z1);
+    const S1 = biModMul(P.Y, biModMul(Z2Z2, Q.Z));
+    const S2 = biModMul(Q.Y, biModMul(Z1Z1, P.Z));
+    const H = biModSub(U2, U1);
+    const r = biModSub(S2, S1);
+    if (H === BI_ZERO) {
+        if (r === BI_ZERO)
+            return jpDouble(P);
+        return { X: BI_ZERO, Y: BI_ONE, Z: BI_ZERO }; // Infinity
+    }
+    const HH = biModMul(H, H);
+    const HHH = biModMul(H, HH);
+    const V = biModMul(U1, HH);
+    const X3 = biModSub(biModSub(biModMul(r, r), HHH), biModMul(BI_TWO, V));
+    const Y3 = biModSub(biModMul(r, biModSub(V, X3)), biModMul(S1, HHH));
+    const Z3 = biModMul(H, biModMul(P.Z, Q.Z));
+    return { X: X3, Y: Y3, Z: Z3 };
+};
+const jpNeg = (P) => {
+    if (P.Z === BI_ZERO)
+        return P;
+    return { X: P.X, Y: P_BIGINT - P.Y, Z: P.Z };
+};
+// Fast windowed-NAF scalar multiplication (default window = 5) in Jacobian
+// coordinates.  Returns Q = k * P0 as a JacobianPoint.
+const scalarMultiplyWNAF = (k, P0, window = 5) => {
+    const key = `${window}:${P0.x.toString(16)}:${P0.y.toString(16)}`;
+    let tbl = WNAF_TABLE_CACHE.get(key);
+    let P;
+    if (tbl === undefined) {
+        // Convert affine to Jacobian and pre-compute odd multiples
+        const tblSize = 1 << (window - 1); // e.g. w=5 → 16 entries
+        tbl = new Array(tblSize);
+        P = { X: P0.x, Y: P0.y, Z: BI_ONE };
+        tbl[0] = P;
+        const twoP = jpDouble(P);
+        for (let i = 1; i < tblSize; i++) {
+            tbl[i] = jpAdd(tbl[i - 1], twoP);
+        }
+        WNAF_TABLE_CACHE.set(key, tbl);
+    }
+    else {
+        P = tbl[0];
+    }
+    // Build wNAF representation of k
+    const wnaf = [];
+    const wBig = 1n << BigInt(window);
+    const wHalf = wBig >> 1n;
+    let kTmp = k;
+    while (kTmp > 0n) {
+        if ((kTmp & BI_ONE) === BI_ZERO) {
+            wnaf.push(0);
+            kTmp >>= BI_ONE;
+        }
+        else {
+            let z = kTmp & (wBig - 1n); // kTmp mod 2^w
+            if (z > wHalf)
+                z -= wBig; // make it odd & within (-2^{w-1}, 2^{w-1})
+            wnaf.push(Number(z));
+            kTmp -= z;
+            kTmp >>= BI_ONE;
+        }
+    }
+    // Accumulate from MSB to LSB
+    let Q = { X: BI_ZERO, Y: BI_ONE, Z: BI_ZERO }; // infinity
+    for (let i = wnaf.length - 1; i >= 0; i--) {
+        Q = jpDouble(Q);
+        const di = wnaf[i];
+        if (di !== 0) {
+            const idx = Math.abs(di) >> 1; // (|di|-1)/2  because di is odd
+            const addend = di > 0 ? tbl[idx] : jpNeg(tbl[idx]);
+            Q = jpAdd(Q, addend);
+        }
+    }
+    return Q;
+};
 //# sourceMappingURL=Point.js.map