@bsv/wallet-toolbox 1.7.15 → 1.7.17

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

@@ -1,486 +0,0 @@
-import BigNumber from './BigNumber.js';
-import K256 from './K256.js';
-/**
- * A base reduction engine that provides several arithmetic operations over
- * big numbers under a modulus context. It's particularly suitable for
- * calculations required in cryptography algorithms and encoding schemas.
- *
- * @class ReductionContext
- *
- * @property prime - The prime number utilised in the reduction context, typically an instance of Mersenne class.
- * @property m - The modulus used for reduction operations.
- */
-export default class ReductionContext {
-    prime;
-    m;
-    /**
-     * Constructs a new ReductionContext.
-     *
-     * @constructor
-     * @param m - A BigNumber representing the modulus, or 'k256' to create a context for Koblitz curve.
-     *
-     * @example
-     * new ReductionContext(new BigNumber(11));
-     * new ReductionContext('k256');
-     */
-    constructor(m) {
-        if (m === 'k256') {
-            const prime = new K256();
-            this.m = prime.p;
-            this.prime = prime;
-        }
-        else {
-            this.assert(m.gtn(1), 'modulus must be greater than 1');
-            this.m = m;
-            this.prime = null;
-        }
-    }
-    /**
-     * Asserts that given value is truthy. Throws an Error with a provided message
-     * if the value is falsy.
-     *
-     * @private
-     * @param val - The value to be checked.
-     * @param msg - The error message to be thrown if the value is falsy.
-     *
-     * @example
-     * this.assert(1 < 2, '1 is not less than 2');
-     * this.assert(2 < 1, '2 is less than 1'); // throws an Error with message '2 is less than 1'
-     */
-    assert(val, msg = 'Assertion failed') {
-        if (!val)
-            throw new Error(msg);
-    }
-    /**
-     * Verifies that a BigNumber is positive and red. Throws an error if these
-     * conditions are not met.
-     *
-     * @param a - The BigNumber to be verified.
-     *
-     * @example
-     * this.verify1(new BigNumber(10).toRed());
-     * this.verify1(new BigNumber(-10).toRed()); //throws an Error
-     * this.verify1(new BigNumber(10)); //throws an Error
-     */
-    verify1(a) {
-        this.assert(a.negative === 0, 'red works only with positives');
-        this.assert(a.red, 'red works only with red numbers');
-    }
-    /**
-     * Verifies that two BigNumbers are both positive and red. Also checks
-     * that they have the same reduction context. Throws an error if these
-     * conditions are not met.
-     *
-     * @param a - The first BigNumber to be verified.
-     * @param b - The second BigNumber to be verified.
-     *
-     * @example
-     * this.verify2(new BigNumber(10).toRed(this), new BigNumber(20).toRed(this));
-     * this.verify2(new BigNumber(-10).toRed(this), new BigNumber(20).toRed(this)); //throws an Error
-     * this.verify2(new BigNumber(10).toRed(this), new BigNumber(20)); //throws an Error
-     */
-    verify2(a, b) {
-        this.assert((a.negative | b.negative) === 0, 'red works only with positives');
-        this.assert(a.red != null && a.red === b.red, 'red works only with red numbers');
-    }
-    /**
-     * Performs an in-place reduction of the given BigNumber by the modulus of the reduction context, 'm'.
-     *
-     * @method imod
-     *
-     * @param a - BigNumber to be reduced.
-     *
-     * @returns Returns the reduced result.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.imod(new BigNumber(19)); // Returns 5
-     */
-    imod(a) {
-        if (this.prime != null)
-            return this.prime.ireduce(a).forceRed(this);
-        BigNumber.move(a, a.umod(this.m).forceRed(this));
-        return a;
-    }
-    /**
-     * Negates a BigNumber in the context of the modulus.
-     *
-     * @method neg
-     *
-     * @param a - BigNumber to negate.
-     *
-     * @returns Returns the negation of 'a' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.neg(new BigNumber(3)); // Returns 4
-     */
-    neg(a) {
-        if (a.isZero()) {
-            return a.clone();
-        }
-        return this.m.sub(a).forceRed(this);
-    }
-    /**
-     * Performs the addition operation on two BigNumbers in the reduction context.
-     *
-     * @method add
-     *
-     * @param a - First BigNumber to add.
-     * @param b - Second BigNumber to add.
-     *
-     * @returns Returns the result of 'a + b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(5));
-     * context.add(new BigNumber(2), new BigNumber(4)); // Returns 1
-     */
-    add(a, b) {
-        this.verify2(a, b);
-        const res = a.add(b);
-        if (res.cmp(this.m) >= 0) {
-            res.isub(this.m);
-        }
-        return res.forceRed(this);
-    }
-    /**
-     * Performs an in-place addition operation on two BigNumbers in the reduction context
-     * in order to avoid creating a new BigNumber, it modifies the first one with the result.
-     *
-     * @method iadd
-     *
-     * @param a - First BigNumber to add.
-     * @param b - Second BigNumber to add.
-     *
-     * @returns Returns the modified 'a' after addition with 'b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(5));
-     * const a = new BigNumber(2);
-     * context.iadd(a, new BigNumber(4)); // Modifies 'a' to be 1
-     */
-    iadd(a, b) {
-        this.verify2(a, b);
-        const res = a.iadd(b);
-        if (res.cmp(this.m) >= 0) {
-            res.isub(this.m);
-        }
-        return res;
-    }
-    /**
-     * Subtracts one BigNumber from another BigNumber in the reduction context.
-     *
-     * @method sub
-     *
-     * @param a - BigNumber to be subtracted from.
-     * @param b - BigNumber to subtract.
-     *
-     * @returns Returns the result of 'a - b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.sub(new BigNumber(3), new BigNumber(2)); // Returns 1
-     */
-    sub(a, b) {
-        this.verify2(a, b);
-        const res = a.sub(b);
-        if (res.cmpn(0) < 0) {
-            res.iadd(this.m);
-        }
-        return res.forceRed(this);
-    }
-    /**
-     * Performs in-place subtraction of one BigNumber from another in the reduction context,
-     * it modifies the first BigNumber with the result.
-     *
-     * @method isub
-     *
-     * @param a - BigNumber to be subtracted from.
-     * @param b - BigNumber to subtract.
-     *
-     * @returns Returns the modified 'a' after subtraction of 'b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(5));
-     * const a = new BigNumber(4);
-     * context.isub(a, new BigNumber(2)); // Modifies 'a' to be 2
-     */
-    isub(a, b) {
-        this.verify2(a, b);
-        const res = a.isub(b);
-        if (res.cmpn(0) < 0) {
-            res.iadd(this.m);
-        }
-        return res;
-    }
-    /**
-     * Performs bitwise shift left operation on a BigNumber in the reduction context.
-     *
-     * @method shl
-     *
-     * @param a - BigNumber to perform shift on.
-     * @param num - The number of positions to shift.
-     *
-     * @returns Returns the result of shifting 'a' left by 'num' positions in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(32));
-     * context.shl(new BigNumber(4), 2); // Returns 16
-     */
-    shl(a, num) {
-        this.verify1(a);
-        return this.imod(a.ushln(num));
-    }
-    /**
-     * Performs in-place multiplication of two BigNumbers in the reduction context,
-     * modifying the first BigNumber with the result.
-     *
-     * @method imul
-     *
-     * @param a - First BigNumber to multiply.
-     * @param b - Second BigNumber to multiply.
-     *
-     * @returns Returns the modified 'a' after multiplication with 'b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * const a = new BigNumber(3);
-     * context.imul(a, new BigNumber(2)); // Modifies 'a' to be 6
-     */
-    imul(a, b) {
-        this.verify2(a, b);
-        return this.imod(a.imul(b));
-    }
-    /**
-     * Multiplies two BigNumbers in the reduction context.
-     *
-     * @method mul
-     *
-     * @param a - First BigNumber to multiply.
-     * @param b - Second BigNumber to multiply.
-     *
-     * @returns Returns the result of 'a * b' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.mul(new BigNumber(3), new BigNumber(2)); // Returns 6
-     */
-    mul(a, b) {
-        this.verify2(a, b);
-        return this.imod(a.mul(b));
-    }
-    /**
-     * Calculates the square of a BigNumber in the reduction context,
-     * modifying the original BigNumber with the result.
-     *
-     * @method isqr
-     *
-     * @param a - BigNumber to be squared.
-     *
-     * @returns Returns the squared 'a' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * const a = new BigNumber(3);
-     * context.isqr(a); // Modifies 'a' to be 2 (9 % 7 = 2)
-     */
-    isqr(a) {
-        return this.imul(a, a.clone());
-    }
-    /**
-     * Calculates the square of a BigNumber in the reduction context.
-     *
-     * @method sqr
-     *
-     * @param a - BigNumber to be squared.
-     *
-     * @returns Returns the result of 'a^2' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.sqr(new BigNumber(3)); // Returns 2 (9 % 7 = 2)
-     */
-    sqr(a) {
-        return this.mul(a, a);
-    }
-    /**
-     * Calculates the square root of a BigNumber in the reduction context.
-     *
-     * @method sqrt
-     *
-     * @param a - The BigNumber to calculate the square root of.
-     *
-     * @returns Returns the square root of 'a' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(9));
-     * context.sqrt(new BigNumber(4)); // Returns 2
-     */
-    sqrt(a) {
-        if (a.isZero())
-            return a.clone();
-        const mod3 = this.m.andln(3);
-        this.assert(mod3 % 2 === 1);
-        // Fast case
-        if (mod3 === 3) {
-            const pow = this.m.add(new BigNumber(1)).iushrn(2);
-            return this.pow(a, pow);
-        }
-        // Tonelli-Shanks algorithm (Totally unoptimized and slow)
-        //
-        // Find Q and S, that Q * 2 ^ S = (P - 1)
-        const q = this.m.subn(1);
-        let s = 0;
-        while (!q.isZero() && q.andln(1) === 0) {
-            s++;
-            q.iushrn(1);
-        }
-        this.assert(!q.isZero());
-        const one = new BigNumber(1).toRed(this);
-        const nOne = one.redNeg();
-        // Find quadratic non-residue
-        // NOTE: Max is such because of generalized Riemann hypothesis.
-        const lpow = this.m.subn(1).iushrn(1);
-        const zl = this.m.bitLength();
-        const z = new BigNumber(2 * zl * zl).toRed(this);
-        while (this.pow(z, lpow).cmp(nOne) !== 0) {
-            z.redIAdd(nOne);
-        }
-        let c = this.pow(z, q);
-        let r = this.pow(a, q.addn(1).iushrn(1));
-        let t = this.pow(a, q);
-        let m = s;
-        while (t.cmp(one) !== 0) {
-            let tmp = t;
-            let i = 0;
-            for (; tmp.cmp(one) !== 0; i++) {
-                tmp = tmp.redSqr();
-            }
-            this.assert(i < m);
-            const b = this.pow(c, new BigNumber(1).iushln(m - i - 1));
-            r = r.redMul(b);
-            c = b.redSqr();
-            t = t.redMul(c);
-            m = i;
-        }
-        return r;
-    }
-    /**
-     * Calculates the multiplicative inverse of a BigNumber in the reduction context.
-     *
-     * @method invm
-     *
-     * @param a - The BigNumber to find the multiplicative inverse of.
-     *
-     * @returns Returns the multiplicative inverse of 'a' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(11));
-     * context.invm(new BigNumber(3)); // Returns 4 (3*4 mod 11 = 1)
-     */
-    invm(a) {
-        const inv = a._invmp(this.m);
-        if (inv.negative !== 0) {
-            inv.negative = 0;
-            return this.imod(inv).redNeg();
-        }
-        else {
-            return this.imod(inv);
-        }
-    }
-    /**
-     * Raises a BigNumber to a power in the reduction context.
-     *
-     * @method pow
-     *
-     * @param a - The BigNumber to be raised to a power.
-     * @param num - The power to raise the BigNumber to.
-     *
-     * @returns Returns the result of 'a' raised to the power of 'num' in the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.pow(new BigNumber(3), new BigNumber(2)); // Returns 2 (3^2 % 7)
-     */
-    pow(a, num) {
-        if (num.isZero())
-            return new BigNumber(1).toRed(this);
-        if (num.cmpn(1) === 0)
-            return a.clone();
-        const windowSize = 4;
-        const wnd = new Array(1 << windowSize);
-        wnd[0] = new BigNumber(1).toRed(this);
-        wnd[1] = a;
-        let i = 2;
-        for (; i < wnd.length; i++) {
-            wnd[i] = this.mul(wnd[i - 1], a);
-        }
-        let res = wnd[0];
-        let current = 0;
-        let currentLen = 0;
-        let start = num.bitLength() % 26;
-        if (start === 0) {
-            start = 26;
-        }
-        for (i = num.length - 1; i >= 0; i--) {
-            const word = num.words[i];
-            for (let j = start - 1; j >= 0; j--) {
-                const bit = (word >> j) & 1;
-                if (res !== wnd[0]) {
-                    res = this.sqr(res);
-                }
-                if (bit === 0 && current === 0) {
-                    currentLen = 0;
-                    continue;
-                }
-                current <<= 1;
-                current |= bit;
-                currentLen++;
-                if (currentLen !== windowSize && (i !== 0 || j !== 0))
-                    continue;
-                res = this.mul(res, wnd[current]);
-                currentLen = 0;
-                current = 0;
-            }
-            start = 26;
-        }
-        return res;
-    }
-    /**
-     * Converts a BigNumber to its equivalent in the reduction context.
-     *
-     * @method convertTo
-     *
-     * @param num - The BigNumber to convert to the reduction context.
-     *
-     * @returns Returns the converted BigNumber compatible with the reduction context.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * context.convertTo(new BigNumber(8)); // Returns 1 (8 % 7)
-     */
-    convertTo(num) {
-        const r = num.umod(this.m);
-        return r === num ? r.clone() : r;
-    }
-    /**
-     * Converts a BigNumber from reduction context to its regular form.
-     *
-     * @method convertFrom
-     *
-     * @param num - The BigNumber to convert from the reduction context.
-     *
-     * @returns Returns the converted BigNumber in its regular form.
-     *
-     * @example
-     * const context = new ReductionContext(new BigNumber(7));
-     * const a = context.convertTo(new BigNumber(8)); // 'a' is now 1 in the reduction context
-     * context.convertFrom(a); // Returns 1
-     */
-    convertFrom(num) {
-        const res = num.clone();
-        res.red = null;
-        return res;
-    }
-}
-//# sourceMappingURL=ReductionContext.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ReductionContext.js","sourceRoot":"","sources":["../../../../src/primitives/ReductionContext.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAA;AACtC,OAAO,IAAI,MAAM,WAAW,CAAA;AAG5B;;;;;;;;;GASG;AACH,MAAM,CAAC,OAAO,OAAO,gBAAgB;IACnC,KAAK,CAAiB;IACtB,CAAC,CAAW;IAEZ;;;;;;;;;OASG;IACH,YAAa,CAAqB;QAChC,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAA;YACxB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAA;YAChB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QACpB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,gCAAgC,CAAC,CAAA;YACvD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;OAWG;IACK,MAAM,CAAE,GAAY,EAAE,MAAc,kBAAkB;QAC5D,IAAI,CAAE,GAAe;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;IAC7C,CAAC;IAED;;;;;;;;;;OAUG;IACH,OAAO,CAAE,CAAY;QACnB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,EAAE,+BAA+B,CAAC,CAAA;QAC9D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,iCAAiC,CAAC,CAAA;IACvD,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,OAAO,CAAE,CAAY,EAAE,CAAY;QACjC,IAAI,CAAC,MAAM,CACT,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAC/B,+BAA+B,CAChC,CAAA;QACD,IAAI,CAAC,MAAM,CACT,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAChC,iCAAiC,CAClC,CAAA;IACH,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,CAAE,CAAY;QAChB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAEnE,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;QAChD,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,GAAG,CAAE,CAAY;QACf,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YACf,OAAO,CAAC,CAAC,KAAK,EAAE,CAAA;QAClB,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAE,CAAY,EAAE,CAAY;QAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAElB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAE,CAAY,EAAE,CAAY;QAC9B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAElB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAE,CAAY,EAAE,CAAY;QAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAElB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAE,CAAY,EAAE,CAAY;QAC9B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAElB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAE,CAAY,EAAE,GAAW;QAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IAChC,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAE,CAAY,EAAE,CAAY;QAC9B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAE,CAAY,EAAE,CAAY;QAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5B,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAE,CAAY;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;IAChC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,GAAG,CAAE,CAAY;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACvB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,CAAE,CAAY;QAChB,IAAI,CAAC,CAAC,MAAM,EAAE;YAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAA;QAEhC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC5B,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;QAE3B,YAAY;QACZ,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QACzB,CAAC;QAED,0DAA0D;QAC1D,EAAE;QACF,yCAAyC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,CAAC,EAAE,CAAA;YACH,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACb,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;QAExB,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE,CAAA;QAEzB,6BAA6B;QAC7B,+DAA+D;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC7B,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAEhD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACzC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QAED,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,GAAG,GAAG,CAAC,CAAA;YACX,IAAI,CAAC,GAAG,CAAC,CAAA;YACT,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAA;YACpB,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAClB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAEzD,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YACf,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAA;YACd,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YACf,CAAC,GAAG,CAAC,CAAA;QACP,CAAC;QAED,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,CAAE,CAAY;QAChB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,IAAI,GAAG,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAA;YAChB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAA;QAChC,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACvB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAE,CAAY,EAAE,GAAc;QAC/B,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QACrD,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAA;QAEvC,MAAM,UAAU,GAAG,CAAC,CAAA;QACpB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,UAAU,CAAC,CAAA;QACtC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QACrC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAClC,CAAC;QAED,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QAChB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,IAAI,KAAK,GAAG,GAAG,CAAC,SAAS,EAAE,GAAG,EAAE,CAAA;QAChC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,KAAK,GAAG,EAAE,CAAA;QACZ,CAAC;QAED,KAAK,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YACzB,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC3B,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACrB,CAAC;gBAED,IAAI,GAAG,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;oBAC/B,UAAU,GAAG,CAAC,CAAA;oBACd,SAAQ;gBACV,CAAC;gBAED,OAAO,KAAK,CAAC,CAAA;gBACb,OAAO,IAAI,GAAG,CAAA;gBACd,UAAU,EAAE,CAAA;gBACZ,IAAI,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAAE,SAAQ;gBAE/D,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;gBACjC,UAAU,GAAG,CAAC,CAAA;gBACd,OAAO,GAAG,CAAC,CAAA;YACb,CAAC;YACD,KAAK,GAAG,EAAE,CAAA;QACZ,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,SAAS,CAAE,GAAc;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAE1B,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,WAAW,CAAE,GAAc;QACzB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAA;QACvB,GAAG,CAAC,GAAG,GAAG,IAAI,CAAA;QACd,OAAO,GAAG,CAAA;IACZ,CAAC;CACF"}

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

@@ -1,93 +0,0 @@
-import BigNumber from './BigNumber.js';
-import Curve from './Curve.js';
-import { sha256 } from './Hash.js';
-import { PrivateKey } from './index.js';
-/**
- * Class representing the Schnorr Zero-Knowledge Proof (ZKP) protocol.
- *
- * This class provides methods to generate and verify proofs that demonstrate knowledge of a secret without revealing it.
- * Specifically, it allows one party to prove to another that they know the private key corresponding to a public key
- * and have correctly computed a shared secret, without disclosing the private key itself.
- *
- * The protocol involves two main methods:
- * - `generateProof`: Generates a proof linking a public key `A` and a shared secret `S`, proving knowledge of the corresponding private key `a`.
- * - `verifyProof`: Verifies the provided proof, ensuring its validity without revealing any secret information.
- *
- * The class utilizes elliptic curve cryptography (ECC) and the SHA-256 hash function to compute challenges within the proof.
- *
- * @example
- * ```typescript
- * const schnorr = new Schnorr();
- * const a = PrivateKey.fromRandom(); // Prover's private key
- * const A = a.toPublicKey();         // Prover's public key
- * const b = PrivateKey.fromRandom(); // Other party's private key
- * const B = b.toPublicKey();         // Other party's public key
- * const S = B.mul(a);                // Shared secret
- *
- * // Prover generates the proof
- * const proof = schnorr.generateProof(a, A, B, S);
- *
- * // Verifier verifies the proof
- * const isValid = schnorr.verifyProof(A.point, B.point, S.point, proof);
- * console.log(`Proof is valid: ${isValid}`);
- * ```
- */
-export default class Schnorr {
-    curve;
-    constructor() {
-        this.curve = new Curve();
-    }
-    /**
-     * Generates a proof that demonstrates the link between public key A and shared secret S
-     * @param a Private key corresponding to public key A
-     * @param A Public key
-     * @param B Other party's public key
-     * @param S Shared secret
-     * @returns Proof (R, S', z)
-     */
-    generateProof(aArg, AArg, BArg, S) {
-        const r = PrivateKey.fromRandom();
-        const R = r.toPublicKey();
-        const SPrime = BArg.mul(r);
-        const e = this.computeChallenge(AArg, BArg, S, SPrime, R);
-        const z = r.add(e.mul(aArg)).umod(this.curve.n);
-        return { R, SPrime, z };
-    }
-    /**
-     * Verifies the proof of the link between public key A and shared secret S
-     * @param A Public key
-     * @param B Other party's public key
-     * @param S Shared secret
-     * @param proof Proof (R, S', z)
-     * @returns True if the proof is valid, false otherwise
-     */
-    verifyProof(A, B, S, proof) {
-        const { R, SPrime, z } = proof;
-        const e = this.computeChallenge(A, B, S, SPrime, R);
-        // Check zG = R + eA
-        const zG = this.curve.g.mul(z);
-        const RpluseA = R.add(A.mul(e));
-        if (!zG.eq(RpluseA)) {
-            return false;
-        }
-        // Check zB = S' + eS
-        const zB = B.mul(z);
-        const SprimeeS = SPrime.add(S.mul(e));
-        if (!zB.eq(SprimeeS)) {
-            return false;
-        }
-        return true;
-    }
-    computeChallenge(A, B, S, SPrime, R) {
-        const message = [
-            ...A.encode(true),
-            ...B.encode(true),
-            ...S.encode(true),
-            ...SPrime.encode(true),
-            ...R.encode(true)
-        ];
-        const hash = sha256(message);
-        return new BigNumber(hash).umod(this.curve.n);
-    }
-}
-//# sourceMappingURL=Schnorr.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Schnorr.js","sourceRoot":"","sources":["../../../../src/primitives/Schnorr.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAA;AACtC,OAAO,KAAK,MAAM,YAAY,CAAA;AAE9B,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAClC,OAAO,EAAE,UAAU,EAAa,MAAM,YAAY,CAAA;AAElD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,CAAC,OAAO,OAAO,OAAO;IACT,KAAK,CAAO;IAE7B;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,CAAA;IAC1B,CAAC;IAED;;;;;;;OAOG;IACH,aAAa,CACX,IAAgB,EAChB,IAAe,EACf,IAAe,EACf,CAAQ;QAER,MAAM,CAAC,GAAG,UAAU,CAAC,UAAU,EAAE,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAA;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;QACzD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC/C,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAA;IACzB,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CACT,CAAQ,EACR,CAAQ,EACR,CAAQ,EACR,KAAgD;QAEhD,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,CAAA;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;QAEnD,oBAAoB;QACpB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/B,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;YACpB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,qBAAqB;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACnB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACrC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAEO,gBAAgB,CACtB,CAAQ,EACR,CAAQ,EACR,CAAQ,EACR,MAAa,EACb,CAAQ;QAER,MAAM,OAAO,GAAG;YACd,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YACjB,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YACjB,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YACjB,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YACtB,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;SACN,CAAA;QACb,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;QAC5B,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAC/C,CAAC;CACF"}