ccxt 4.2.18 → 4.2.19

package/dist/cjs/js/src/static_dependencies/jsencrypt/lib/jsrsasign/yahoo.js

@@ -1,74 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-/*!
-Copyright (c) 2011, Yahoo! Inc. All rights reserved.
-Code licensed under the BSD License:
-http://developer.yahoo.com/yui/license.html
-version: 2.9.0
-*/
-var YAHOO = {};
-YAHOO.lang = {
-    /**
-     * Utility to set up the prototype, constructor and superclass properties to
-     * support an inheritance strategy that can chain constructors and methods.
-     * Static members will not be inherited.
-     *
-     * @method extend
-     * @static
-     * @param {Function} subc   the object to modify
-     * @param {Function} superc the object to inherit
-     * @param {Object} overrides  additional properties/methods to add to the
-     *                              subclass prototype.  These will override the
-     *                              matching items obtained from the superclass
-     *                              if present.
-     */
-    extend: function (subc, superc, overrides) {
-        if (!superc || !subc) {
-            throw new Error("YAHOO.lang.extend failed, please check that " +
-                "all dependencies are included.");
-        }
-        var F = function () { };
-        F.prototype = superc.prototype;
-        subc.prototype = new F();
-        subc.prototype.constructor = subc;
-        subc.superclass = superc.prototype;
-        if (superc.prototype.constructor == Object.prototype.constructor) {
-            superc.prototype.constructor = superc;
-        }
-        if (overrides) {
-            var i;
-            for (i in overrides) {
-                subc.prototype[i] = overrides[i];
-            }
-            /*
-             * IE will not enumerate native functions in a derived object even if the
-             * function was overridden.  This is a workaround for specific functions
-             * we care about on the Object prototype.
-             * @property _IEEnumFix
-             * @param {Function} r  the object to receive the augmentation
-             * @param {Function} s  the object that supplies the properties to augment
-             * @static
-             * @private
-             */
-            var _IEEnumFix = function () { }, ADD = ["toString", "valueOf"];
-            try {
-                if (/MSIE/.test(navigator.userAgent)) {
-                    _IEEnumFix = function (r, s) {
-                        for (i = 0; i < ADD.length; i = i + 1) {
-                            var fname = ADD[i], f = s[fname];
-                            if (typeof f === 'function' && f != Object.prototype[fname]) {
-                                r[fname] = f;
-                            }
-                        }
-                    };
-                }
-            }
-            catch (ex) { }
-            _IEEnumFix(subc.prototype, overrides);
-        }
-    }
-};
-
-exports.YAHOO = YAHOO;

package/dist/cjs/js/src/static_dependencies/noble-curves/_shortw_utils.js

@@ -1,24 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var hmac = require('../noble-hashes/hmac.js');
-var utils = require('../noble-hashes/utils.js');
-var weierstrass = require('./abstract/weierstrass.js');
-
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-// connects noble-curves to noble-hashes
-function getHash(hash) {
-    return {
-        hash,
-        hmac: (key, ...msgs) => hmac.hmac(hash, key, utils.concatBytes(...msgs)),
-        randomBytes: utils.randomBytes,
-    };
-}
-function createCurve(curveDef, defHash) {
-    const create = (hash) => weierstrass.weierstrass({ ...curveDef, ...getHash(hash) });
-    return Object.freeze({ ...create(defHash), create });
-}
-
-exports.createCurve = createCurve;
-exports.getHash = getHash;

package/dist/cjs/js/src/static_dependencies/noble-curves/abstract/curve.js

@@ -1,158 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var modular = require('./modular.js');
-var utils = require('./utils.js');
-
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const _0n = BigInt(0);
-const _1n = BigInt(1);
-// Elliptic curve multiplication of Point by scalar. Fragile.
-// Scalars should always be less than curve order: this should be checked inside of a curve itself.
-// Creates precomputation tables for fast multiplication:
-// - private scalar is split by fixed size windows of W bits
-// - every window point is collected from window's table & added to accumulator
-// - since windows are different, same point inside tables won't be accessed more than once per calc
-// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)
-// - +1 window is neccessary for wNAF
-// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication
-// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow
-// windows to be in different memory locations
-function wNAF(c, bits) {
-    const constTimeNegate = (condition, item) => {
-        const neg = item.negate();
-        return condition ? neg : item;
-    };
-    const opts = (W) => {
-        const windows = Math.ceil(bits / W) + 1; // +1, because
-        const windowSize = 2 ** (W - 1); // -1 because we skip zero
-        return { windows, windowSize };
-    };
-    return {
-        constTimeNegate,
-        // non-const time multiplication ladder
-        unsafeLadder(elm, n) {
-            let p = c.ZERO;
-            let d = elm;
-            while (n > _0n) {
-                if (n & _1n)
-                    p = p.add(d);
-                d = d.double();
-                n >>= _1n;
-            }
-            return p;
-        },
-        /**
-         * Creates a wNAF precomputation window. Used for caching.
-         * Default window size is set by `utils.precompute()` and is equal to 8.
-         * Number of precomputed points depends on the curve size:
-         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-         * - 𝑊 is the window size
-         * - 𝑛 is the bitlength of the curve order.
-         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-         * @returns precomputed point tables flattened to a single array
-         */
-        precomputeWindow(elm, W) {
-            const { windows, windowSize } = opts(W);
-            const points = [];
-            let p = elm;
-            let base = p;
-            for (let window = 0; window < windows; window++) {
-                base = p;
-                points.push(base);
-                // =1, because we skip zero
-                for (let i = 1; i < windowSize; i++) {
-                    base = base.add(p);
-                    points.push(base);
-                }
-                p = base.double();
-            }
-            return points;
-        },
-        /**
-         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-         * @param W window size
-         * @param precomputes precomputed tables
-         * @param n scalar (we don't check here, but should be less than curve order)
-         * @returns real and fake (for const-time) points
-         */
-        wNAF(W, precomputes, n) {
-            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise
-            // But need to carefully remove other checks before wNAF. ORDER == bits here
-            const { windows, windowSize } = opts(W);
-            let p = c.ZERO;
-            let f = c.BASE;
-            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.
-            const maxNumber = 2 ** W;
-            const shiftBy = BigInt(W);
-            for (let window = 0; window < windows; window++) {
-                const offset = window * windowSize;
-                // Extract W bits.
-                let wbits = Number(n & mask);
-                // Shift number by W bits.
-                n >>= shiftBy;
-                // If the bits are bigger than max size, we'll split those.
-                // +224 => 256 - 32
-                if (wbits > windowSize) {
-                    wbits -= maxNumber;
-                    n += _1n;
-                }
-                // This code was first written with assumption that 'f' and 'p' will never be infinity point:
-                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,
-                // there is negate now: it is possible that negated element from low value
-                // would be the same as high element, which will create carry into next window.
-                // It's not obvious how this can fail, but still worth investigating later.
-                // Check if we're onto Zero point.
-                // Add random point inside current window to f.
-                const offset1 = offset;
-                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero
-                const cond1 = window % 2 !== 0;
-                const cond2 = wbits < 0;
-                if (wbits === 0) {
-                    // The most important part for const-time getPublicKey
-                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));
-                }
-                else {
-                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));
-                }
-            }
-            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()
-            // Even if the variable is still unused, there are some checks which will
-            // throw an exception, so compiler needs to prove they won't happen, which is hard.
-            // At this point there is a way to F be infinity-point even if p is not,
-            // which makes it less const-time: around 1 bigint multiply.
-            return { p, f };
-        },
-        wNAFCached(P, precomputesMap, n, transform) {
-            // @ts-ignore
-            const W = P._WINDOW_SIZE || 1;
-            // Calculate precomputes on a first run, reuse them after
-            let comp = precomputesMap.get(P);
-            if (!comp) {
-                comp = this.precomputeWindow(P, W);
-                if (W !== 1) {
-                    precomputesMap.set(P, transform(comp));
-                }
-            }
-            return this.wNAF(W, comp, n);
-        },
-    };
-}
-function validateBasic(curve) {
-    modular.validateField(curve.Fp);
-    utils.validateObject(curve, {
-        n: 'bigint',
-        h: 'bigint',
-        Gx: 'field',
-        Gy: 'field',
-    }, {
-        nBitLength: 'isSafeInteger',
-        nByteLength: 'isSafeInteger',
-    });
-    // Set defaults
-    return Object.freeze({ ...modular.nLength(curve.n, curve.nBitLength), ...curve });
-}
-
-exports.validateBasic = validateBasic;
-exports.wNAF = wNAF;

package/dist/cjs/js/src/static_dependencies/noble-curves/abstract/edwards.js

@@ -1,429 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var modular = require('./modular.js');
-var utils = require('./utils.js');
-var curve = require('./curve.js');
-
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-// 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$1) {
-    const opts = curve.validateBasic(curve$1);
-    utils.validateObject(curve$1, {
-        hash: 'function',
-        a: 'bigint',
-        d: 'bigint',
-        randomBytes: 'function',
-    }, {
-        adjustScalarBytes: 'function',
-        domain: 'function',
-        uvRatio: 'function',
-        mapToCurve: 'function',
-    });
-    // Set defaults
-    return Object.freeze({ ...opts });
-}
-// It is not generic twisted curve for now, but ed25519/ed448 generic implementation
-function twistedEdwards(curveDef) {
-    const CURVE = validateOpts(curveDef);
-    const { Fp, n: CURVE_ORDER, preHash, hash: cHash, randomBytes, nByteLength, h: cofactor } = CURVE;
-    const MASK = _2n ** BigInt(nByteLength * 8);
-    const modP = Fp.create; // Function overrides
-    // sqrt(u/v)
-    const uvRatio = CURVE.uvRatio ||
-        ((u, v) => {
-            try {
-                return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };
-            }
-            catch (e) {
-                return { isValid: false, value: _0n };
-            }
-        });
-    const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP
-    const domain = CURVE.domain ||
-        ((data, ctx, phflag) => {
-            if (ctx.length || phflag)
-                throw new Error('Contexts/pre-hash are not supported');
-            return data;
-        }); // NOOP
-    const inBig = (n) => typeof n === 'bigint' && 0n < n; // n in [1..]
-    const inRange = (n, max) => inBig(n) && inBig(max) && n < max; // n in [1..max-1]
-    const in0MaskRange = (n) => n === _0n || inRange(n, MASK); // n in [0..MASK-1]
-    function assertInRange(n, max) {
-        // n in [1..max-1]
-        if (inRange(n, max))
-            return n;
-        throw new Error(`Expected valid scalar < ${max}, got ${typeof n} ${n}`);
-    }
-    function assertGE0(n) {
-        // n in [0..CURVE_ORDER-1]
-        return n === _0n ? n : assertInRange(n, CURVE_ORDER); // GE = prime subgroup, not full group
-    }
-    const pointPrecomputes = new Map();
-    function isPoint(other) {
-        if (!(other instanceof Point))
-            throw new Error('ExtendedPoint expected');
-    }
-    // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).
-    // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates
-    class Point {
-        constructor(ex, ey, ez, et) {
-            this.ex = ex;
-            this.ey = ey;
-            this.ez = ez;
-            this.et = et;
-            if (!in0MaskRange(ex))
-                throw new Error('x required');
-            if (!in0MaskRange(ey))
-                throw new Error('y required');
-            if (!in0MaskRange(ez))
-                throw new Error('z required');
-            if (!in0MaskRange(et))
-                throw new Error('t required');
-        }
-        get x() {
-            return this.toAffine().x;
-        }
-        get y() {
-            return this.toAffine().y;
-        }
-        static fromAffine(p) {
-            if (p instanceof Point)
-                throw new Error('extended point not allowed');
-            const { x, y } = p || {};
-            if (!in0MaskRange(x) || !in0MaskRange(y))
-                throw new Error('invalid affine point');
-            return new Point(x, y, _1n, modP(x * y));
-        }
-        static normalizeZ(points) {
-            const toInv = Fp.invertBatch(points.map((p) => p.ez));
-            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);
-        }
-        // "Private method", don't use it directly
-        _setWindowSize(windowSize) {
-            this._WINDOW_SIZE = windowSize;
-            pointPrecomputes.delete(this);
-        }
-        // Not required for fromHex(), which always creates valid points.
-        // Could be useful for fromAffine().
-        assertValidity() {
-            const { a, d } = CURVE;
-            if (this.is0())
-                throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?
-            // Equation in affine coordinates: ax² + y² = 1 + dx²y²
-            // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX² + Y²)Z² = Z⁴ + dX²Y²
-            const { ex: X, ey: Y, ez: Z, et: T } = this;
-            const X2 = modP(X * X); // X²
-            const Y2 = modP(Y * Y); // Y²
-            const Z2 = modP(Z * Z); // Z²
-            const Z4 = modP(Z2 * Z2); // Z⁴
-            const aX2 = modP(X2 * a); // aX²
-            const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²
-            const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²
-            if (left !== right)
-                throw new Error('bad point: equation left != right (1)');
-            // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T
-            const XY = modP(X * Y);
-            const ZT = modP(Z * T);
-            if (XY !== ZT)
-                throw new Error('bad point: equation left != right (2)');
-        }
-        // Compare one point to another.
-        equals(other) {
-            isPoint(other);
-            const { ex: X1, ey: Y1, ez: Z1 } = this;
-            const { ex: X2, ey: Y2, ez: Z2 } = other;
-            const X1Z2 = modP(X1 * Z2);
-            const X2Z1 = modP(X2 * Z1);
-            const Y1Z2 = modP(Y1 * Z2);
-            const Y2Z1 = modP(Y2 * Z1);
-            return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;
-        }
-        is0() {
-            return this.equals(Point.ZERO);
-        }
-        negate() {
-            // Flips point sign to a negative one (-x, y in affine coords)
-            return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));
-        }
-        // Fast algo for doubling Extended Point.
-        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
-        // Cost: 4M + 4S + 1*a + 6add + 1*2.
-        double() {
-            const { a } = CURVE;
-            const { ex: X1, ey: Y1, ez: Z1 } = this;
-            const A = modP(X1 * X1); // A = X12
-            const B = modP(Y1 * Y1); // B = Y12
-            const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12
-            const D = modP(a * A); // D = a*A
-            const x1y1 = X1 + Y1;
-            const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B
-            const G = D + B; // G = D+B
-            const F = G - C; // F = G-C
-            const H = D - B; // H = D-B
-            const X3 = modP(E * F); // X3 = E*F
-            const Y3 = modP(G * H); // Y3 = G*H
-            const T3 = modP(E * H); // T3 = E*H
-            const Z3 = modP(F * G); // Z3 = F*G
-            return new Point(X3, Y3, Z3, T3);
-        }
-        // Fast algo for adding 2 Extended Points.
-        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd
-        // Cost: 9M + 1*a + 1*d + 7add.
-        add(other) {
-            isPoint(other);
-            const { a, d } = CURVE;
-            const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;
-            const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;
-            // Faster algo for adding 2 Extended Points when curve's a=-1.
-            // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4
-            // Cost: 8M + 8add + 2*2.
-            // Note: It does not check whether the `other` point is valid.
-            if (a === BigInt(-1)) {
-                const A = modP((Y1 - X1) * (Y2 + X2));
-                const B = modP((Y1 + X1) * (Y2 - X2));
-                const F = modP(B - A);
-                if (F === _0n)
-                    return this.double(); // Same point. Tests say it doesn't affect timing
-                const C = modP(Z1 * _2n * T2);
-                const D = modP(T1 * _2n * Z2);
-                const E = D + C;
-                const G = B + A;
-                const H = D - C;
-                const X3 = modP(E * F);
-                const Y3 = modP(G * H);
-                const T3 = modP(E * H);
-                const Z3 = modP(F * G);
-                return new Point(X3, Y3, Z3, T3);
-            }
-            const A = modP(X1 * X2); // A = X1*X2
-            const B = modP(Y1 * Y2); // B = Y1*Y2
-            const C = modP(T1 * d * T2); // C = T1*d*T2
-            const D = modP(Z1 * Z2); // D = Z1*Z2
-            const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B
-            const F = D - C; // F = D-C
-            const G = D + C; // G = D+C
-            const H = modP(B - a * A); // H = B-a*A
-            const X3 = modP(E * F); // X3 = E*F
-            const Y3 = modP(G * H); // Y3 = G*H
-            const T3 = modP(E * H); // T3 = E*H
-            const Z3 = modP(F * G); // Z3 = F*G
-            return new Point(X3, Y3, Z3, T3);
-        }
-        subtract(other) {
-            return this.add(other.negate());
-        }
-        wNAF(n) {
-            return wnaf.wNAFCached(this, pointPrecomputes, n, Point.normalizeZ);
-        }
-        // Constant-time multiplication.
-        multiply(scalar) {
-            const { p, f } = this.wNAF(assertInRange(scalar, CURVE_ORDER));
-            return Point.normalizeZ([p, f])[0];
-        }
-        // Non-constant-time multiplication. Uses double-and-add algorithm.
-        // It's faster, but should only be used when you don't care about
-        // an exposed private key e.g. sig verification.
-        multiplyUnsafe(scalar) {
-            let n = assertGE0(scalar);
-            if (n === _0n)
-                return I;
-            if (this.equals(I) || n === _1n)
-                return this;
-            if (this.equals(G))
-                return this.wNAF(n).p;
-            return wnaf.unsafeLadder(this, n);
-        }
-        // Checks if point is of small order.
-        // If you add something to small order point, you will have "dirty"
-        // point with torsion component.
-        // Multiplies point by cofactor and checks if the result is 0.
-        isSmallOrder() {
-            return this.multiplyUnsafe(cofactor).is0();
-        }
-        // Multiplies point by curve order and checks if the result is 0.
-        // Returns `false` is the point is dirty.
-        isTorsionFree() {
-            return wnaf.unsafeLadder(this, CURVE_ORDER).is0();
-        }
-        // Converts Extended point to default (x, y) coordinates.
-        // Can accept precomputed Z^-1 - for example, from invertBatch.
-        toAffine(iz) {
-            const { ex: x, ey: y, ez: z } = this;
-            const is0 = this.is0();
-            if (iz == null)
-                iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily
-            const ax = modP(x * iz);
-            const ay = modP(y * iz);
-            const zz = modP(z * iz);
-            if (is0)
-                return { x: _0n, y: _1n };
-            if (zz !== _1n)
-                throw new Error('invZ was invalid');
-            return { x: ax, y: ay };
-        }
-        clearCofactor() {
-            const { h: cofactor } = CURVE;
-            if (cofactor === _1n)
-                return this;
-            return this.multiplyUnsafe(cofactor);
-        }
-        // Converts hash string or Uint8Array to Point.
-        // Uses algo from RFC8032 5.1.3.
-        static fromHex(hex, strict = true) {
-            const { d, a } = CURVE;
-            const len = Fp.BYTES;
-            hex = utils.ensureBytes('pointHex', hex, len); // copy hex to a new array
-            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 = utils.bytesToNumberLE(normed);
-            if (y === _0n) ;
-            else {
-                // RFC8032 prohibits >= p, but ZIP215 doesn't
-                if (strict)
-                    assertInRange(y, Fp.ORDER); // strict=true [1..P-1] (2^255-19-1 for ed25519)
-                else
-                    assertInRange(y, MASK); // strict=false [1..MASK-1] (2^256-1 for ed25519)
-            }
-            // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:
-            // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)
-            const y2 = modP(y * y); // denominator is always non-0 mod p.
-            const u = modP(y2 - _1n); // u = y² - 1
-            const v = modP(d * y2 - a); // v = d y² + 1.
-            let { isValid, value: x } = uvRatio(u, v); // √(u/v)
-            if (!isValid)
-                throw new Error('Point.fromHex: invalid y coordinate');
-            const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper
-            const isLastByteOdd = (lastByte & 0x80) !== 0; // if x=0 and x_0 = 1, fail
-            if (isLastByteOdd !== isXOdd)
-                x = modP(-x); // if x_0 != x mod 2, set x = p-x
-            return Point.fromAffine({ x, y });
-        }
-        static fromPrivateKey(privKey) {
-            return getExtendedPublicKey(privKey).point;
-        }
-        toRawBytes() {
-            const { x, y } = this.toAffine();
-            const bytes = utils.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 utils.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.
-        }
-    }
-    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));
-    Point.ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0
-    const { BASE: G, ZERO: I } = Point;
-    const wnaf = curve.wNAF(Point, nByteLength * 8);
-    function modN(a) {
-        return modular.mod(a, CURVE_ORDER);
-    }
-    // Little-endian SHA512 with modulo n
-    function modN_LE(hash) {
-        return modN(utils.bytesToNumberLE(hash));
-    }
-    /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */
-    function getExtendedPublicKey(key) {
-        const len = nByteLength;
-        key = utils.ensureBytes('private key', key, len);
-        // Hash private key with curve's hash function to produce uniformingly random input
-        // Check byte lengths: ensure(64, h(ensure(32, key)))
-        const hashed = utils.ensureBytes('hashed private key', cHash(key), 2 * len);
-        const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE
-        const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)
-        const scalar = modN_LE(head); // The actual private scalar
-        const point = G.multiply(scalar); // Point on Edwards curve aka public key
-        const pointBytes = point.toRawBytes(); // Uint8Array representation
-        return { head, prefix, scalar, point, pointBytes };
-    }
-    // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared
-    function getPublicKey(privKey) {
-        return getExtendedPublicKey(privKey).pointBytes;
-    }
-    // int('LE', SHA512(dom2(F, C) || msgs)) mod N
-    function hashDomainToScalar(context = new Uint8Array(), ...msgs) {
-        const msg = utils.concatBytes(...msgs);
-        return modN_LE(cHash(domain(msg, utils.ensureBytes('context', context), !!preHash)));
-    }
-    /** Signs message with privateKey. RFC8032 5.1.6 */
-    function sign(msg, privKey, context) {
-        msg = utils.ensureBytes('message', msg);
-        if (preHash)
-            msg = preHash(msg); // for ed25519ph etc.
-        const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);
-        const r = hashDomainToScalar(context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)
-        const R = G.multiply(r).toRawBytes(); // R = rG
-        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 = utils.concatBytes(R, utils.numberToBytesLE(s, Fp.BYTES));
-        return utils.ensureBytes('result', res, nByteLength * 2); // 64-byte signature
-    }
-    function signModified(msg, privKey, context) {
-        msg = utils.ensureBytes('message', msg);
-        const privKeyBytes = utils.ensureBytes('privKey', privKey);
-        const privKeyNumber = utils.bytesToNumberLE(privKeyBytes);
-        const publicKey = G.multiply(modN(privKeyNumber)).toRawBytes();
-        const signBit = publicKey[31] & 0x80;
-        const r = hashDomainToScalar(context, privKeyBytes, msg); // r = dom2(F, C) || prefix || PH(M)
-        const R = G.multiply(r).toRawBytes(); // R = rG
-        const k = hashDomainToScalar(context, R, publicKey, msg); // R || A || PH(M)
-        const s = k * privKeyNumber; // S = (r + k * s) mod L
-        const S = modN(r + s);
-        assertGE0(S); // 0 <= s < l
-        const Sencoded = utils.numberToBytesLE(S, Fp.BYTES);
-        Sencoded[31] |= signBit;
-        const res = utils.concatBytes(R, Sencoded);
-        return utils.ensureBytes('result', res, nByteLength * 2); // 64-byte signature
-    }
-    function verify(sig, msg, publicKey, context) {
-        const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.
-        sig = utils.ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.
-        msg = utils.ensureBytes('message', msg); // ZIP215 compliant, which means not fully RFC8032 compliant.
-        if (preHash)
-            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 = utils.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));
-        // [8][S]B = [8]R + [8][k]A'
-        return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);
-    }
-    G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.
-    const utils$1 = {
-        getExtendedPublicKey,
-        // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.
-        randomPrivateKey: () => randomBytes(Fp.BYTES),
-        /**
-         * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT
-         * values. This slows down first getPublicKey() by milliseconds (see Speed section),
-         * but allows to speed-up subsequent getPublicKey() calls up to 20x.
-         * @param windowSize 2, 4, 8, 16
-         */
-        precompute(windowSize = 8, point = Point.BASE) {
-            point._setWindowSize(windowSize);
-            point.multiply(BigInt(3));
-            return point;
-        },
-    };
-    return {
-        CURVE,
-        getPublicKey,
-        sign,
-        signModified,
-        verify,
-        ExtendedPoint: Point,
-        utils: utils$1,
-    };
-}
-
-exports.twistedEdwards = twistedEdwards;