@bsv/wallet-toolbox 1.7.14 → 1.7.16

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/K256.js

@@ -0,0 +1,121 @@
+import Mersenne from './Mersenne.js';
+/**
+ * A class representing K-256, a prime number with optimizations, specifically used in the secp256k1 curve.
+ * It extends the functionalities of the Mersenne class.
+ * K-256 prime is represented as 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'
+ *
+ * @class K256
+ * @extends {Mersenne}
+ *
+ * @example
+ * const k256 = new K256();
+ */
+export default class K256 extends Mersenne {
+    /**
+     * Constructor for the K256 class.
+     * Creates an instance of K256 using the super constructor from Mersenne.
+     *
+     * @constructor
+     *
+     * @example
+     * const k256 = new K256();
+     */
+    constructor() {
+        super('k256', 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');
+    }
+    /**
+     * Splits a BigNumber into a new BigNumber based on specific computation
+     * rules. This method modifies the input and output big numbers.
+     *
+     * @method split
+     * @param input - The BigNumber to be split.
+     * @param output - The BigNumber that results from the split.
+     *
+     * @example
+     * const input = new BigNumber(3456);
+     * const output = new BigNumber(0);
+     * k256.split(input, output);
+     */
+    split(input, output) {
+        const mask = 0x3fffff; // 22 bits
+        const inputWords = input.words; // Access via getter
+        const inputNominalLength = input.length; // Access via getter, respects _nominalWordLength
+        const outLen = Math.min(inputNominalLength, 9);
+        const tempOutputWords = new Array(outLen + (inputNominalLength > 9 ? 1 : 0)).fill(0);
+        for (let i = 0; i < outLen; i++) {
+            tempOutputWords[i] = inputWords[i];
+        }
+        let currentOutputWordCount = outLen;
+        if (inputNominalLength <= 9) {
+            const finalOutputWords = new Array(currentOutputWordCount);
+            for (let i = 0; i < currentOutputWordCount; ++i)
+                finalOutputWords[i] = tempOutputWords[i];
+            output.words = finalOutputWords; // Use setter
+            input.words = [0]; // Use setter to set to 0
+            return;
+        }
+        // Shift by 9 limbs
+        let prev = inputWords[9];
+        tempOutputWords[currentOutputWordCount++] = prev & mask;
+        const finalOutputWords = new Array(currentOutputWordCount);
+        for (let i = 0; i < currentOutputWordCount; ++i)
+            finalOutputWords[i] = tempOutputWords[i];
+        output.words = finalOutputWords; // Use setter for output
+        // For input modification
+        const tempInputNewWords = new Array(Math.max(1, inputNominalLength - 9)).fill(0);
+        let currentInputNewWordCount = 0;
+        for (let i = 10; i < inputNominalLength; i++) {
+            const next = inputWords[i] | 0;
+            if (currentInputNewWordCount < tempInputNewWords.length) { // Boundary check
+                tempInputNewWords[currentInputNewWordCount++] = ((next & mask) << 4) | (prev >>> 22);
+            }
+            prev = next;
+        }
+        prev >>>= 22;
+        if (currentInputNewWordCount < tempInputNewWords.length) { // Boundary check
+            tempInputNewWords[currentInputNewWordCount++] = prev;
+        }
+        else if (prev !== 0 && tempInputNewWords.length > 0) { // If prev is non-zero but no space, this is an issue.
+            // This case implies original logic might have relied on array auto-expansion or specific length handling
+            // For safety, if there's still a carry and no space, the array should have been bigger.
+            // However, the original logic `input.length -= 9` suggests truncation.
+        }
+        const finalInputNewWords = new Array(currentInputNewWordCount);
+        for (let i = 0; i < currentInputNewWordCount; ++i)
+            finalInputNewWords[i] = tempInputNewWords[i];
+        input.words = finalInputNewWords; // Use setter, which will strip and set magnitude
+    }
+    /**
+     * Multiplies a BigNumber ('num') with the constant 'K' in-place and returns the result.
+     * 'K' is equal to 0x1000003d1 or in decimal representation: [ 64, 977 ].
+     *
+     * @method imulK
+     * @param num - The BigNumber to multiply with K.
+     * @returns Returns the mutated BigNumber after multiplication.
+     *
+     * @example
+     * const number = new BigNumber(12345);
+     * const result = k256.imulK(number);
+     */
+    imulK(num) {
+        const currentWords = num.words; // Get current words based on _magnitude and _nominalWordLength
+        const originalNominalLength = num.length; // Getter
+        const newNominalLength = originalNominalLength + 2;
+        const tempWords = new Array(newNominalLength).fill(0);
+        for (let i = 0; i < originalNominalLength; i++) {
+            tempWords[i] = currentWords[i];
+        }
+        // tempWords is now effectively num.words expanded with zeroes
+        let lo = 0;
+        for (let i = 0; i < newNominalLength; i++) { // Iterate up to new expanded length
+            const w = tempWords[i] | 0;
+            lo += w * 0x3d1; // 0x3d1 = 977
+            tempWords[i] = lo & 0x3ffffff; // 26-bit mask
+            lo = w * 0x40 + ((lo / 0x4000000) | 0); // 0x40 = 64. 0x4000000 = 2^26
+        }
+        num.words = tempWords; // Use setter to re-initialize from tempWords
+        // The setter will handle _magnitude, _sign, _nominalWordLength, and strip.
+        return num;
+    }
+}
+//# sourceMappingURL=K256.js.map

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/K256.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"K256.js","sourceRoot":"","sources":["../../../../src/primitives/K256.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,eAAe,CAAA;AAGpC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,OAAO,OAAO,IAAK,SAAQ,QAAQ;IACxC;;;;;;;;OAQG;IACH;QACE,KAAK,CACH,MAAM,EACN,yEAAyE,CAC1E,CAAA;IACH,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAE,KAAgB,EAAE,MAAiB;QACxC,MAAM,IAAI,GAAG,QAAQ,CAAA,CAAC,UAAU;QAChC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAA,CAAC,oBAAoB;QACnD,MAAM,kBAAkB,GAAG,KAAK,CAAC,MAAM,CAAA,CAAC,iDAAiD;QAEzF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAA;QAC9C,MAAM,eAAe,GAAG,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEpF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,eAAe,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;QACpC,CAAC;QACD,IAAI,sBAAsB,GAAG,MAAM,CAAA;QAEnC,IAAI,kBAAkB,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,EAAE,CAAC;gBAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;YACzF,MAAM,CAAC,KAAK,GAAG,gBAAgB,CAAA,CAAC,aAAa;YAE7C,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA,CAAC,yBAAyB;YAC3C,OAAM;QACR,CAAC;QAED,mBAAmB;QACnB,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;QACxB,eAAe,CAAC,sBAAsB,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA;QAEvD,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAA;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,EAAE,CAAC;YAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,GAAG,gBAAgB,CAAA,CAAC,wBAAwB;QAExD,yBAAyB;QACzB,MAAM,iBAAiB,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChF,IAAI,wBAAwB,GAAG,CAAC,CAAA;QAEhC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAC9B,IAAI,wBAAwB,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,iBAAiB;gBAC1E,iBAAiB,CAAC,wBAAwB,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAA;YACtF,CAAC;YACD,IAAI,GAAG,IAAI,CAAA;QACb,CAAC;QACD,IAAI,MAAM,EAAE,CAAA;QACZ,IAAI,wBAAwB,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,iBAAiB;YAC1E,iBAAiB,CAAC,wBAAwB,EAAE,CAAC,GAAG,IAAI,CAAA;QACtD,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,sDAAsD;YAC7G,yGAAyG;YACzG,wFAAwF;YACxF,uEAAuE;QACzE,CAAC;QAED,MAAM,kBAAkB,GAAG,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;QAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,wBAAwB,EAAE,EAAE,CAAC;YAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;QAC/F,KAAK,CAAC,KAAK,GAAG,kBAAkB,CAAA,CAAC,iDAAiD;IACpF,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAE,GAAc;QACnB,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAA,CAAC,+DAA+D;QAC9F,MAAM,qBAAqB,GAAG,GAAG,CAAC,MAAM,CAAA,CAAC,SAAS;QAElD,MAAM,gBAAgB,GAAG,qBAAqB,GAAG,CAAC,CAAA;QAClD,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,8DAA8D;QAE9D,IAAI,EAAE,GAAG,CAAC,CAAA;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,oCAAoC;YAC/E,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAC1B,EAAE,IAAI,CAAC,GAAG,KAAK,CAAA,CAAC,cAAc;YAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,SAAS,CAAA,CAAC,cAAc;YAC5C,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAA,CAAC,8BAA8B;QACvE,CAAC;QAED,GAAG,CAAC,KAAK,GAAG,SAAS,CAAA,CAAC,6CAA6C;QACnE,2EAA2E;QAC3E,OAAO,GAAG,CAAA;IACZ,CAAC;CACF"}

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/Mersenne.js

@@ -0,0 +1,112 @@
+import BigNumber from './BigNumber.js';
+/**
+ * A representation of a pseudo-Mersenne prime.
+ * A pseudo-Mersenne prime has the general form 2^n - k, where n and k are integers.
+ *
+ * @class Mersenne
+ *
+ * @property name - The identifier for the Mersenne instance.
+ * @property p - BigNumber equivalent to 2^n - k.
+ * @property k - The constant subtracted from 2^n to derive a pseudo-Mersenne prime.
+ * @property n - The exponent which determines the magnitude of the prime.
+ */
+export default class Mersenne {
+    name;
+    p;
+    k;
+    n;
+    tmp;
+    /**
+     * @constructor
+     * @param name - An identifier for the Mersenne instance.
+     * @param p - A string representation of the pseudo-Mersenne prime, expressed in hexadecimal.
+     *
+     * @example
+     * const mersenne = new Mersenne('M31', '7FFFFFFF');
+     */
+    constructor(name, p) {
+        // P = 2 ^ N - K
+        this.name = name;
+        this.p = new BigNumber(p, 16);
+        this.n = this.p.bitLength();
+        this.k = new BigNumber(BigInt(1)).iushln(this.n).isub(this.p); // Use 1n for BigInt compatibility
+        this.tmp = this._tmp();
+    }
+    /**
+     * Creates a temporary BigNumber structure for computations,
+     * ensuring the appropriate number of words are initially allocated.
+     *
+     * @method _tmp
+     * @returns A BigNumber with scaled size depending on prime magnitude.
+     */
+    _tmp() {
+        const tmp = new BigNumber(BigInt(0)); // Initialize with BigInt 0
+        const requiredWords = Math.ceil(this.n / BigNumber.wordSize);
+        tmp.expand(Math.max(1, requiredWords)); // Expand sets _nominalWordLength
+        return tmp;
+    }
+    /**
+     * Reduces an input BigNumber in place, under the assumption that
+     * it is less than the square of the pseudo-Mersenne prime.
+     *
+     * @method ireduce
+     * @param num - The BigNumber to be reduced.
+     * @returns The reduced BigNumber.
+     *
+     * @example
+     * const reduced = mersenne.ireduce(new BigNumber('2345', 16));
+     */
+    ireduce(num) {
+        // Assumes that `num` is less than `P^2`
+        // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)
+        const r = num; // num is directly modified
+        let rlen;
+        do {
+            this.split(r, this.tmp); // r is modified (becomes HI), this.tmp becomes LO
+            this.imulK(r); // r becomes HI * K
+            r.iadd(this.tmp); // r becomes HI * K + LO
+            rlen = r.bitLength();
+        } while (rlen > this.n);
+        const cmp = rlen < this.n ? -1 : r.ucmp(this.p);
+        if (cmp === 0) {
+            r.words = [0]; // Set to zero using the words setter
+        }
+        else if (cmp > 0) {
+            r.isub(this.p);
+        }
+        // No explicit strip needed here if operations maintain correctness and setter handles it.
+        // However, ensuring it's stripped to minimal form after reduction is good.
+        r.strip();
+        return r;
+    }
+    /**
+     * Shifts bits of the input BigNumber to the right, in place,
+     * to meet the magnitude of the pseudo-Mersenne prime.
+     *
+     * @method split
+     * @param input - The BigNumber to be shifted (will contain HI part).
+     * @param out - The BigNumber to hold the shifted result (LO part).
+     *
+     * @example
+     * mersenne.split(new BigNumber('2345', 16), new BigNumber());
+     */
+    split(input, out) {
+        // out gets the LO bits (shifted out part)
+        // input gets modified to be the HI bits (remaining part after shift)
+        input.iushrn(this.n, 0, out);
+    }
+    /**
+     * Performs an in-place multiplication of the parameter by constant k.
+     *
+     * @method imulK
+     * @param num - The BigNumber to multiply with k.
+     * @returns The result of the multiplication, in BigNumber format.
+     *
+     * @example
+     * const multiplied = mersenne.imulK(new BigNumber('2345', 16));
+     */
+    imulK(num) {
+        return num.imul(this.k);
+    }
+}
+//# sourceMappingURL=Mersenne.js.map

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/Mersenne.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Mersenne.js","sourceRoot":"","sources":["../../../../src/primitives/Mersenne.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAA;AAEtC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,OAAO,OAAO,QAAQ;IAC3B,IAAI,CAAQ;IACZ,CAAC,CAAW;IACZ,CAAC,CAAW;IACZ,CAAC,CAAQ;IACQ,GAAG,CAAW;IAE/B;;;;;;;OAOG;IACH,YAAa,IAAY,EAAE,CAAS;QAClC,gBAAgB;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QAC7B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC3B,IAAI,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,kCAAkC;QAEhG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;IACxB,CAAC;IAED;;;;;;OAMG;IACK,IAAI;QACV,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA,CAAC,2BAA2B;QAChE,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAA;QAC5D,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAA,CAAC,iCAAiC;QACxE,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;;;;;;OAUG;IACH,OAAO,CAAE,GAAc;QACrB,wCAAwC;QACxC,6DAA6D;QAC7D,MAAM,CAAC,GAAG,GAAG,CAAA,CAAC,2BAA2B;QACzC,IAAI,IAAI,CAAA;QAER,GAAG,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,kDAAkD;YAC1E,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,CAAC,mBAAmB;YACjC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,wBAAwB;YACzC,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,CAAA;QACtB,CAAC,QAAQ,IAAI,GAAG,IAAI,CAAC,CAAC,EAAC;QAEvB,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC/C,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA,CAAC,qCAAqC;QACrD,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChB,CAAC;QACD,0FAA0F;QAC1F,2EAA2E;QAC3E,CAAC,CAAC,KAAK,EAAE,CAAA;QACT,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAE,KAAgB,EAAE,GAAc;QACrC,0CAA0C;QAC1C,qEAAqE;QACrE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAE,GAAc;QACnB,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACzB,CAAC;CACF"}

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/MontgomoryMethod.js

@@ -0,0 +1,149 @@
+import ReductionContext from './ReductionContext.js';
+import BigNumber from './BigNumber.js';
+/**
+ * Represents a Montgomery reduction context, which is a mathematical method
+ * for performing modular multiplication without division.
+ *
+ * Montgomery reduction is an algorithm used mainly in cryptography which can
+ * help to speed up calculations in contexts where there are many repeated
+ * computations.
+ *
+ * This class extends the `ReductionContext` class.
+ *
+ * @class MontgomoryMethod
+ * @extends {ReductionContext}
+ *
+ * @property shift - The number of bits in the modulus.
+ * @property r - The 2^shift, shifted left by the bit length of modulus `m`.
+ * @property r2 - The square of `r` modulo `m`.
+ * @property rinv - The modular multiplicative inverse of `r` mod `m`.
+ * @property minv - The modular multiplicative inverse of `m` mod `r`.
+ */
+export default class MontgomoryMethod extends ReductionContext {
+    shift;
+    r;
+    r2;
+    rinv;
+    minv;
+    /**
+     * @constructor
+     * @param m - The modulus to be used for the Montgomery method reductions.
+     */
+    constructor(m) {
+        super(m);
+        this.shift = this.m.bitLength();
+        if (this.shift % 26 !== 0) {
+            this.shift += 26 - (this.shift % 26);
+        }
+        this.r = new BigNumber(1).iushln(this.shift);
+        this.r2 = this.imod(this.r.sqr());
+        this.rinv = this.r._invmp(this.m);
+        this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
+        this.minv = this.minv.umod(this.r);
+        this.minv = this.r.sub(this.minv);
+    }
+    /**
+     * Converts a number into the Montgomery domain.
+     *
+     * @method convertTo
+     * @param num - The number to be converted into the Montgomery domain.
+     * @returns The result of the conversion into the Montgomery domain.
+     *
+     * @example
+     * const montMethod = new MontgomoryMethod(m);
+     * const convertedNum = montMethod.convertTo(num);
+     */
+    convertTo(num) {
+        return this.imod(num.ushln(this.shift));
+    }
+    /**
+     * Converts a number from the Montgomery domain back to the original domain.
+     *
+     * @method convertFrom
+     * @param num - The number to be converted from the Montgomery domain.
+     * @returns The result of the conversion from the Montgomery domain.
+     *
+     * @example
+     * const montMethod = new MontgomoryMethod(m);
+     * const convertedNum = montMethod.convertFrom(num);
+     */
+    convertFrom(num) {
+        const r = this.imod(num.mul(this.rinv));
+        r.red = null;
+        return r;
+    }
+    /**
+     * Performs an in-place multiplication of two numbers in the Montgomery domain.
+     *
+     * @method imul
+     * @param a - The first number to multiply.
+     * @param b - The second number to multiply.
+     * @returns The result of the in-place multiplication.
+     *
+     * @example
+     * const montMethod = new MontgomoryMethod(m);
+     * const product = montMethod.imul(a, b);
+     */
+    imul(a, b) {
+        if (a.isZero() || b.isZero()) {
+            a.words[0] = 0;
+            a.length = 1;
+            return a;
+        }
+        const t = a.imul(b);
+        const c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
+        const u = t.isub(c).iushrn(this.shift);
+        let res = u;
+        if (u.cmp(this.m) >= 0) {
+            res = u.isub(this.m);
+        }
+        else if (u.cmpn(0) < 0) {
+            res = u.iadd(this.m);
+        }
+        return res.forceRed(this);
+    }
+    /**
+     * Performs the multiplication of two numbers in the Montgomery domain.
+     *
+     * @method mul
+     * @param a - The first number to multiply.
+     * @param b - The second number to multiply.
+     * @returns The result of the multiplication.
+     *
+     * @example
+     * const montMethod = new MontgomoryMethod(m);
+     * const product = montMethod.mul(a, b);
+     */
+    mul(a, b) {
+        if (a.isZero() || b.isZero())
+            return new BigNumber(0).forceRed(this);
+        const t = a.mul(b);
+        const c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
+        const u = t.isub(c).iushrn(this.shift);
+        let res = u;
+        if (u.cmp(this.m) >= 0) {
+            res = u.isub(this.m);
+        }
+        else if (u.cmpn(0) < 0) {
+            res = u.iadd(this.m);
+        }
+        return res.forceRed(this);
+    }
+    /**
+     * Calculates the modular multiplicative inverse of a number in the Montgomery domain.
+     *
+     * @method invm
+     * @param a - The number to compute the modular multiplicative inverse of.
+     * @returns The modular multiplicative inverse of 'a'.
+     *
+     * @example
+     * const montMethod = new MontgomoryMethod(m);
+     * const inverse = montMethod.invm(a);
+     */
+    invm(a) {
+        // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R
+        const res = this.imod(a._invmp(this.m).mul(this.r2));
+        return res.forceRed(this);
+    }
+}
+//# sourceMappingURL=MontgomoryMethod.js.map

package/mobile/node_modules/@bsv/sdk/dist/esm/src/primitives/MontgomoryMethod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MontgomoryMethod.js","sourceRoot":"","sources":["../../../../src/primitives/MontgomoryMethod.ts"],"names":[],"mappings":"AAAA,OAAO,gBAAgB,MAAM,uBAAuB,CAAA;AACpD,OAAO,SAAS,MAAM,gBAAgB,CAAA;AAEtC;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,OAAO,OAAO,gBAAiB,SAAQ,gBAAgB;IAC5D,KAAK,CAAQ;IACb,CAAC,CAAW;IACZ,EAAE,CAAW;IACb,IAAI,CAAW;IACf,IAAI,CAAW;IAEf;;;OAGG;IACH,YAAa,CAAqB;QAChC,KAAK,CAAC,CAAC,CAAC,CAAA;QAER,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC/B,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAA;QACtC,CAAC;QAED,IAAI,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC5C,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAED;;;;;;;;;;OAUG;IACH,SAAS,CAAE,GAAc;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IACzC,CAAC;IAED;;;;;;;;;;OAUG;IACH,WAAW,CAAE,GAAc;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QACvC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAA;QACZ,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;;;;;;;OAWG;IACH,IAAI,CAAE,CAAY,EAAE,CAAY;QAC9B,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7B,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,CAAS,CAAC,MAAM,GAAG,CAAC,CAAA;YACrB,OAAO,CAAC,CAAA;QACV,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACnB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3E,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,GAAG,CAAC,CAAA;QAEX,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtB,CAAC;QAED,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED;;;;;;;;;;;OAWG;IACH,GAAG,CAAE,CAAY,EAAE,CAAY;QAC7B,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE;YAAE,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAEpE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAClB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3E,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtB,CAAC;QAED,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,CAAE,CAAY;QAChB,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;QACpD,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;CACF"}