| 1 | {"version":3,"file":"bn.interface.min.mjs","sources":["../../src/biginteger/bn.interface.js"],"sourcesContent":["import BN from 'bn.js';\n\n/**\n * @fileoverview\n * BigInteger implementation of basic operations\n * Wrapper of bn.js library (wwww.github.com/indutny/bn.js)\n * @module biginteger/bn\n * @private\n */\n\n/**\n * @private\n */\nexport default class BigInteger {\n /**\n * Get a BigInteger (input must be big endian for strings and arrays)\n * @param {Number|String|Uint8Array} n - Value to convert\n * @throws {Error} on undefined input\n */\n constructor(n) {\n if (n === undefined) {\n throw new Error('Invalid BigInteger input');\n }\n\n this.value = new BN(n);\n }\n\n clone() {\n const clone = new BigInteger(null);\n this.value.copy(clone.value);\n return clone;\n }\n\n /**\n * BigInteger increment in place\n */\n iinc() {\n this.value.iadd(new BN(1));\n return this;\n }\n\n /**\n * BigInteger increment\n * @returns {BigInteger} this + 1.\n */\n inc() {\n return this.clone().iinc();\n }\n\n /**\n * BigInteger decrement in place\n */\n idec() {\n this.value.isub(new BN(1));\n return this;\n }\n\n /**\n * BigInteger decrement\n * @returns {BigInteger} this - 1.\n */\n dec() {\n return this.clone().idec();\n }\n\n\n /**\n * BigInteger addition in place\n * @param {BigInteger} x - Value to add\n */\n iadd(x) {\n this.value.iadd(x.value);\n return this;\n }\n\n /**\n * BigInteger addition\n * @param {BigInteger} x - Value to add\n * @returns {BigInteger} this + x.\n */\n add(x) {\n return this.clone().iadd(x);\n }\n\n /**\n * BigInteger subtraction in place\n * @param {BigInteger} x - Value to subtract\n */\n isub(x) {\n this.value.isub(x.value);\n return this;\n }\n\n /**\n * BigInteger subtraction\n * @param {BigInteger} x - Value to subtract\n * @returns {BigInteger} this - x.\n */\n sub(x) {\n return this.clone().isub(x);\n }\n\n /**\n * BigInteger multiplication in place\n * @param {BigInteger} x - Value to multiply\n */\n imul(x) {\n this.value.imul(x.value);\n return this;\n }\n\n /**\n * BigInteger multiplication\n * @param {BigInteger} x - Value to multiply\n * @returns {BigInteger} this * x.\n */\n mul(x) {\n return this.clone().imul(x);\n }\n\n /**\n * Compute value modulo m, in place\n * @param {BigInteger} m - Modulo\n */\n imod(m) {\n this.value = this.value.umod(m.value);\n return this;\n }\n\n /**\n * Compute value modulo m\n * @param {BigInteger} m - Modulo\n * @returns {BigInteger} this mod m.\n */\n mod(m) {\n return this.clone().imod(m);\n }\n\n /**\n * Compute modular exponentiation\n * Much faster than this.exp(e).mod(n)\n * @param {BigInteger} e - Exponent\n * @param {BigInteger} n - Modulo\n * @returns {BigInteger} this ** e mod n.\n */\n modExp(e, n) {\n // We use either Montgomery or normal reduction context\n // Montgomery requires coprime n and R (montogmery multiplier)\n // bn.js picks R as power of 2, so n must be odd\n const nred = n.isEven() ? BN.red(n.value) : BN.mont(n.value);\n const x = this.clone();\n x.value = x.value.toRed(nred).redPow(e.value).fromRed();\n return x;\n }\n\n /**\n * Compute the inverse of this value modulo n\n * Note: this and and n must be relatively prime\n * @param {BigInteger} n - Modulo\n * @returns {BigInteger} x such that this*x = 1 mod n\n * @throws {Error} if the inverse does not exist\n */\n modInv(n) {\n // invm returns a wrong result if the inverse does not exist\n if (!this.gcd(n).isOne()) {\n throw new Error('Inverse does not exist');\n }\n return new BigInteger(this.value.invm(n.value));\n }\n\n /**\n * Compute greatest common divisor between this and n\n * @param {BigInteger} n - Operand\n * @returns {BigInteger} gcd\n */\n gcd(n) {\n return new BigInteger(this.value.gcd(n.value));\n }\n\n /**\n * Shift this to the left by x, in place\n * @param {BigInteger} x - Shift value\n */\n ileftShift(x) {\n this.value.ishln(x.value.toNumber());\n return this;\n }\n\n /**\n * Shift this to the left by x\n * @param {BigInteger} x - Shift value\n * @returns {BigInteger} this << x.\n */\n leftShift(x) {\n return this.clone().ileftShift(x);\n }\n\n /**\n * Shift this to the right by x, in place\n * @param {BigInteger} x - Shift value\n */\n irightShift(x) {\n this.value.ishrn(x.value.toNumber());\n return this;\n }\n\n /**\n * Shift this to the right by x\n * @param {BigInteger} x - Shift value\n * @returns {BigInteger} this >> x.\n */\n rightShift(x) {\n return this.clone().irightShift(x);\n }\n\n /**\n * Whether this value is equal to x\n * @param {BigInteger} x\n * @returns {Boolean}\n */\n equal(x) {\n return this.value.eq(x.value);\n }\n\n /**\n * Whether this value is less than x\n * @param {BigInteger} x\n * @returns {Boolean}\n */\n lt(x) {\n return this.value.lt(x.value);\n }\n\n /**\n * Whether this value is less than or equal to x\n * @param {BigInteger} x\n * @returns {Boolean}\n */\n lte(x) {\n return this.value.lte(x.value);\n }\n\n /**\n * Whether this value is greater than x\n * @param {BigInteger} x\n * @returns {Boolean}\n */\n gt(x) {\n return this.value.gt(x.value);\n }\n\n /**\n * Whether this value is greater than or equal to x\n * @param {BigInteger} x\n * @returns {Boolean}\n */\n gte(x) {\n return this.value.gte(x.value);\n }\n\n isZero() {\n return this.value.isZero();\n }\n\n isOne() {\n return this.value.eq(new BN(1));\n }\n\n isNegative() {\n return this.value.isNeg();\n }\n\n isEven() {\n return this.value.isEven();\n }\n\n abs() {\n const res = this.clone();\n res.value = res.value.abs();\n return res;\n }\n\n /**\n * Get this value as a string\n * @returns {String} this value.\n */\n toString() {\n return this.value.toString();\n }\n\n /**\n * Get this value as an exact Number (max 53 bits)\n * Fails if this value is too large\n * @returns {Number}\n */\n toNumber() {\n return this.value.toNumber();\n }\n\n /**\n * Get value of i-th bit\n * @param {Number} i - Bit index\n * @returns {Number} Bit value.\n */\n getBit(i) {\n return this.value.testn(i) ? 1 : 0;\n }\n\n /**\n * Compute bit length\n * @returns {Number} Bit length.\n */\n bitLength() {\n return this.value.bitLength();\n }\n\n /**\n * Compute byte length\n * @returns {Number} Byte length.\n */\n byteLength() {\n return this.value.byteLength();\n }\n\n /**\n * Get Uint8Array representation of this number\n * @param {String} endian - Endianess of output array (defaults to 'be')\n * @param {Number} length - Of output array\n * @returns {Uint8Array}\n */\n toUint8Array(endian = 'be', length) {\n return this.value.toArrayLike(Uint8Array, endian, length);\n }\n}\n"],"names":["BigInteger","[object Object]","n","undefined","Error","this","value","BN","clone","copy","iadd","iinc","isub","idec","x","imul","m","umod","imod","e","nred","isEven","red","mont","toRed","redPow","fromRed","gcd","isOne","invm","ishln","toNumber","ileftShift","ishrn","irightShift","eq","lt","lte","gt","gte","isZero","isNeg","res","abs","toString","i","testn","bitLength","byteLength","endian","length","toArrayLike","Uint8Array"],"mappings":";yJAae,MAAMA,EAMnBC,YAAYC,GACV,QAAUC,IAAND,EACF,MAAUE,MAAM,4BAGlBC,KAAKC,MAAQ,IAAIC,EAAGL,GAGtBD,QACE,MAAMO,EAAQ,IAAIR,EAAW,MAE7B,OADAK,KAAKC,MAAMG,KAAKD,EAAMF,OACfE,EAMTP,OAEE,OADAI,KAAKC,MAAMI,KAAK,IAAIH,EAAG,IAChBF,KAOTJ,MACE,OAAOI,KAAKG,QAAQG,OAMtBV,OAEE,OADAI,KAAKC,MAAMM,KAAK,IAAIL,EAAG,IAChBF,KAOTJ,MACE,OAAOI,KAAKG,QAAQK,OAQtBZ,KAAKa,GAEH,OADAT,KAAKC,MAAMI,KAAKI,EAAER,OACXD,KAQTJ,IAAIa,GACF,OAAOT,KAAKG,QAAQE,KAAKI,GAO3Bb,KAAKa,GAEH,OADAT,KAAKC,MAAMM,KAAKE,EAAER,OACXD,KAQTJ,IAAIa,GACF,OAAOT,KAAKG,QAAQI,KAAKE,GAO3Bb,KAAKa,GAEH,OADAT,KAAKC,MAAMS,KAAKD,EAAER,OACXD,KAQTJ,IAAIa,GACF,OAAOT,KAAKG,QAAQO,KAAKD,GAO3Bb,KAAKe,GAEH,OADAX,KAAKC,MAAQD,KAAKC,MAAMW,KAAKD,EAAEV,OACxBD,KAQTJ,IAAIe,GACF,OAAOX,KAAKG,QAAQU,KAAKF,GAU3Bf,OAAOkB,EAAGjB,GAIR,MAAMkB,EAAOlB,EAAEmB,SAAWd,EAAGe,IAAIpB,EAAEI,OAASC,EAAGgB,KAAKrB,EAAEI,OAChDQ,EAAIT,KAAKG,QAEf,OADAM,EAAER,MAAQQ,EAAER,MAAMkB,MAAMJ,GAAMK,OAAON,EAAEb,OAAOoB,UACvCZ,EAUTb,OAAOC,GAEL,IAAKG,KAAKsB,IAAIzB,GAAG0B,QACf,MAAUxB,MAAM,0BAElB,OAAO,IAAIJ,EAAWK,KAAKC,MAAMuB,KAAK3B,EAAEI,QAQ1CL,IAAIC,GACF,OAAO,IAAIF,EAAWK,KAAKC,MAAMqB,IAAIzB,EAAEI,QAOzCL,WAAWa,GAET,OADAT,KAAKC,MAAMwB,MAAMhB,EAAER,MAAMyB,YAClB1B,KAQTJ,UAAUa,GACR,OAAOT,KAAKG,QAAQwB,WAAWlB,GAOjCb,YAAYa,GAEV,OADAT,KAAKC,MAAM2B,MAAMnB,EAAER,MAAMyB,YAClB1B,KAQTJ,WAAWa,GACT,OAAOT,KAAKG,QAAQ0B,YAAYpB,GAQlCb,MAAMa,GACJ,OAAOT,KAAKC,MAAM6B,GAAGrB,EAAER,OAQzBL,GAAGa,GACD,OAAOT,KAAKC,MAAM8B,GAAGtB,EAAER,OAQzBL,IAAIa,GACF,OAAOT,KAAKC,MAAM+B,IAAIvB,EAAER,OAQ1BL,GAAGa,GACD,OAAOT,KAAKC,MAAMgC,GAAGxB,EAAER,OAQzBL,IAAIa,GACF,OAAOT,KAAKC,MAAMiC,IAAIzB,EAAER,OAG1BL,SACE,OAAOI,KAAKC,MAAMkC,SAGpBvC,QACE,OAAOI,KAAKC,MAAM6B,GAAG,IAAI5B,EAAG,IAG9BN,aACE,OAAOI,KAAKC,MAAMmC,QAGpBxC,SACE,OAAOI,KAAKC,MAAMe,SAGpBpB,MACE,MAAMyC,EAAMrC,KAAKG,QAEjB,OADAkC,EAAIpC,MAAQoC,EAAIpC,MAAMqC,MACfD,EAOTzC,WACE,OAAOI,KAAKC,MAAMsC,WAQpB3C,WACE,OAAOI,KAAKC,MAAMyB,WAQpB9B,OAAO4C,GACL,OAAOxC,KAAKC,MAAMwC,MAAMD,GAAK,EAAI,EAOnC5C,YACE,OAAOI,KAAKC,MAAMyC,YAOpB9C,aACE,OAAOI,KAAKC,MAAM0C,aASpB/C,aAAagD,EAAS,KAAMC,GAC1B,OAAO7C,KAAKC,MAAM6C,YAAYC,WAAYH,EAAQC"} |