';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16);\n };\n\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n assert(typeof Buffer !== 'undefined');\n return this.toArrayLike(Buffer, endian, length);\n };\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\n if (!littleEndian) {\n // Assume big-endian\n for (i = 0; i < reqLength - byteLength; i++) {\n res[i] = 0;\n }\n\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[reqLength - i - 1] = b;\n }\n } else {\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[i] = b;\n }\n\n for (; i < reqLength; i++) {\n res[i] = 0;\n }\n }\n\n return res;\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this.strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this.strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this.strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this.strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this.strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n function jumboMulTo (self, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this.strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) < num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this.strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this.strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modn = function modn (num) {\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return acc;\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n return this.strip();\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is BN v4 instance\n r.strip();\n } else {\n // r is BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n return a.umod(this.m)._forceRed(this);\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e7a9c006686001942ed784e7a792314.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e7a9c006686001942ed784e7a792314.json
new file mode 100644
index 000000000..38d12d312
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e7a9c006686001942ed784e7a792314.json
@@ -0,0 +1 @@
+{"ast":null,"code":"import _slicedToArray from \"@babel/runtime/helpers/slicedToArray\";\nvar _jsxFileName = \"/Users/samueltang/Desktop/Aster/frontend-mobile/App.js\";\nimport _regeneratorRuntime from \"@babel/runtime/regenerator\";\nimport React, { useState, useEffect } from 'react';\nimport \"./global\";\nimport { web3, kit } from \"./root\";\nimport Image from \"react-native-web/dist/exports/Image\";\nimport StyleSheet from \"react-native-web/dist/exports/StyleSheet\";\nimport Text from \"react-native-web/dist/exports/Text\";\nimport TextInput from \"react-native-web/dist/exports/TextInput\";\nimport Button from \"react-native-web/dist/exports/Button\";\nimport View from \"react-native-web/dist/exports/View\";\nimport YellowBox from \"react-native-web/dist/exports/YellowBox\";\nimport { requestTxSig, waitForSignedTxs, requestAccountAddress, waitForAccountAuth, FeeCurrency } from '@celo/dappkit';\nimport * as Linking from 'expo-linking';\nimport CeloDAppKit from \"./celo-dappkit\";\nimport TaskList from \"./pages/TaskList\";\nYellowBox.ignoreWarnings(['Warning: The provided value \\'moz', 'Warning: The provided value \\'ms-stream']);\nvar styles = StyleSheet.create({\n container: {\n flex: 1,\n backgroundColor: '#35d07f',\n alignItems: 'center',\n justifyContent: 'center'\n },\n title: {\n marginVertical: 8,\n fontSize: 20,\n fontWeight: 'bold'\n }\n});\n\nvar App = function App() {\n var _useState = useState('Not logged in'),\n _useState2 = _slicedToArray(_useState, 2),\n address = _useState2[0],\n setAddress = _useState2[1];\n\n var _useState3 = useState('Not logged in'),\n _useState4 = _slicedToArray(_useState3, 2),\n phoneNumber = _useState4[0],\n setPhoneNumber = _useState4[1];\n\n var _useState5 = useState('Not logged in'),\n _useState6 = _slicedToArray(_useState5, 2),\n cUSDBalance = _useState6[0],\n setcUSDBalance = _useState6[1];\n\n var _useState7 = useState(true),\n _useState8 = _slicedToArray(_useState7, 2),\n isLoadingBalance = _useState8[0],\n setIsLoadingBalance = _useState8[1];\n\n var login = function login() {\n var requestId, dappName, callback, dappkitResponse, stableToken, cUSDBalanceBig, ERC20_DECIMALS, cUSDBalanceDec, cUSDBalance;\n return _regeneratorRuntime.async(function login$(_context) {\n while (1) {\n switch (_context.prev = _context.next) {\n case 0:\n requestId = 'login';\n dappName = 'Hello Celo';\n callback = Linking.makeUrl('/my/path');\n requestAccountAddress({\n requestId: requestId,\n dappName: dappName,\n callback: callback\n });\n _context.next = 6;\n return _regeneratorRuntime.awrap(waitForAccountAuth(requestId));\n\n case 6:\n dappkitResponse = _context.sent;\n kit.defaultAccount = dappkitResponse.address;\n _context.next = 10;\n return _regeneratorRuntime.awrap(kit.contracts.getStableToken());\n\n case 10:\n stableToken = _context.sent;\n _context.next = 13;\n return _regeneratorRuntime.awrap(stableToken.balanceOf(kit.defaultAccount));\n\n case 13:\n cUSDBalanceBig = _context.sent;\n ERC20_DECIMALS = 18;\n cUSDBalanceDec = cUSDBalanceBig.shiftedBy(-ERC20_DECIMALS).toFixed(2);\n cUSDBalance = cUSDBalanceDec.toString();\n setcUSDBalance(cUSDBalance);\n setIsLoadingBalance(false);\n setAddress(dappkitResponse.address);\n setPhoneNumber(dappkitResponse.phoneNumber);\n\n case 21:\n case \"end\":\n return _context.stop();\n }\n }\n }, null, null, null, Promise);\n };\n\n return React.createElement(View, {\n style: styles.container,\n __source: {\n fileName: _jsxFileName,\n lineNumber: 84,\n columnNumber: 5\n }\n }, React.createElement(TaskList, {\n __source: {\n fileName: _jsxFileName,\n lineNumber: 95,\n columnNumber: 7\n }\n }));\n};\n\nexport default App;","map":{"version":3,"sources":["/Users/samueltang/Desktop/Aster/frontend-mobile/App.js"],"names":["React","useState","useEffect","web3","kit","requestTxSig","waitForSignedTxs","requestAccountAddress","waitForAccountAuth","FeeCurrency","Linking","CeloDAppKit","TaskList","YellowBox","ignoreWarnings","styles","StyleSheet","create","container","flex","backgroundColor","alignItems","justifyContent","title","marginVertical","fontSize","fontWeight","App","address","setAddress","phoneNumber","setPhoneNumber","cUSDBalance","setcUSDBalance","isLoadingBalance","setIsLoadingBalance","login","requestId","dappName","callback","makeUrl","dappkitResponse","defaultAccount","contracts","getStableToken","stableToken","balanceOf","cUSDBalanceBig","ERC20_DECIMALS","cUSDBalanceDec","shiftedBy","toFixed","toString"],"mappings":";;;AAAA,OAAOA,KAAP,IAAgBC,QAAhB,EAA0BC,SAA1B,QAA2C,OAA3C;AACA;AACA,SAASC,IAAT,EAAeC,GAAf;;;;;;;;AAEA,SACEC,YADF,EAEEC,gBAFF,EAGEC,qBAHF,EAIEC,kBAJF,EAKEC,WALF,QAMO,eANP;AAOA,OAAO,KAAKC,OAAZ,MAAyB,cAAzB;AACA,OAAOC,WAAP;AACA,OAAOC,QAAP;AAEAC,SAAS,CAACC,cAAV,CAAyB,CAAC,mCAAD,EAAsC,yCAAtC,CAAzB;AAEA,IAAMC,MAAM,GAAGC,UAAU,CAACC,MAAX,CAAkB;AAC/BC,EAAAA,SAAS,EAAE;AACTC,IAAAA,IAAI,EAAE,CADG;AAETC,IAAAA,eAAe,EAAE,SAFR;AAGTC,IAAAA,UAAU,EAAE,QAHH;AAITC,IAAAA,cAAc,EAAE;AAJP,GADoB;AAO/BC,EAAAA,KAAK,EAAE;AACLC,IAAAA,cAAc,EAAE,CADX;AAELC,IAAAA,QAAQ,EAAE,EAFL;AAGLC,IAAAA,UAAU,EAAE;AAHP;AAPwB,CAAlB,CAAf;;AAcA,IAAMC,GAAG,GAAG,SAANA,GAAM,GAAM;AAGhB,kBAA8B1B,QAAQ,CAAC,eAAD,CAAtC;AAAA;AAAA,MAAO2B,OAAP;AAAA,MAAgBC,UAAhB;;AACA,mBAAsC5B,QAAQ,CAAC,eAAD,CAA9C;AAAA;AAAA,MAAO6B,WAAP;AAAA,MAAoBC,cAApB;;AACA,mBAAsC9B,QAAQ,CAAC,eAAD,CAA9C;AAAA;AAAA,MAAO+B,WAAP;AAAA,MAAoBC,cAApB;;AACA,mBAAgDhC,QAAQ,CAAC,IAAD,CAAxD;AAAA;AAAA,MAAOiC,gBAAP;AAAA,MAAyBC,mBAAzB;;AAGA,MAAMC,KAAK,GAAG,SAARA,KAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAGNC,YAAAA,SAHM,GAGM,OAHN;AAMNC,YAAAA,QANM,GAMK,YANL;AASNC,YAAAA,QATM,GASK7B,OAAO,CAAC8B,OAAR,CAAgB,UAAhB,CATL;AAYZjC,YAAAA,qBAAqB,CAAC;AACpB8B,cAAAA,SAAS,EAATA,SADoB;AAEpBC,cAAAA,QAAQ,EAARA,QAFoB;AAGpBC,cAAAA,QAAQ,EAARA;AAHoB,aAAD,CAArB;AAZY;AAAA,6CAmBkB/B,kBAAkB,CAAC6B,SAAD,CAnBpC;;AAAA;AAmBNI,YAAAA,eAnBM;AAsBZrC,YAAAA,GAAG,CAACsC,cAAJ,GAAqBD,eAAe,CAACb,OAArC;AAtBY;AAAA,6CAyBcxB,GAAG,CAACuC,SAAJ,CAAcC,cAAd,EAzBd;;AAAA;AAyBNC,YAAAA,WAzBM;AAAA;AAAA,6CA4BiBA,WAAW,CAACC,SAAZ,CAAsB1C,GAAG,CAACsC,cAA1B,CA5BjB;;AAAA;AA4BNK,YAAAA,cA5BM;AA+BNC,YAAAA,cA/BM,GA+BW,EA/BX;AAgCRC,YAAAA,cAhCQ,GAgCSF,cAAc,CAACG,SAAf,CAAyB,CAACF,cAA1B,EAA0CG,OAA1C,CAAkD,CAAlD,CAhCT;AAiCRnB,YAAAA,WAjCQ,GAiCMiB,cAAc,CAACG,QAAf,EAjCN;AAoCZnB,YAAAA,cAAc,CAACD,WAAD,CAAd;AACAG,YAAAA,mBAAmB,CAAC,KAAD,CAAnB;AACAN,YAAAA,UAAU,CAACY,eAAe,CAACb,OAAjB,CAAV;AACAG,YAAAA,cAAc,CAACU,eAAe,CAACX,WAAjB,CAAd;;AAvCY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAAd;;AA0CA,SACE,oBAAC,IAAD;AAAM,IAAA,KAAK,EAAEf,MAAM,CAACG,SAApB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAWE,oBAAC,QAAD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAXF,CADF;AAgBD,CAnED;;AAqEA,eAAeS,GAAf","sourcesContent":["import React, { useState, useEffect } from 'react'\nimport './global'\nimport { web3, kit } from './root'\nimport { Image, StyleSheet, Text, TextInput, Button, View, YellowBox } from 'react-native'\nimport { \n requestTxSig,\n waitForSignedTxs,\n requestAccountAddress,\n waitForAccountAuth,\n FeeCurrency\n} from '@celo/dappkit'\nimport * as Linking from 'expo-linking'\nimport CeloDAppKit from './celo-dappkit'\nimport TaskList from './pages/TaskList'\n\nYellowBox.ignoreWarnings(['Warning: The provided value \\'moz', 'Warning: The provided value \\'ms-stream'])\n\nconst styles = StyleSheet.create({\n container: {\n flex: 1,\n backgroundColor: '#35d07f',\n alignItems: 'center',\n justifyContent: 'center',\n },\n title: {\n marginVertical: 8, \n fontSize: 20, \n fontWeight: 'bold'\n }\n});\n\nconst App = () => {\n\n // Set the defaults for the state\n const [address, setAddress] = useState('Not logged in');\n const [phoneNumber, setPhoneNumber] = useState('Not logged in');\n const [cUSDBalance, setcUSDBalance] = useState('Not logged in');\n const [isLoadingBalance, setIsLoadingBalance] = useState(true);\n\n\n const login = async () => {\n \n // A string you can pass to DAppKit, that you can use to listen to the response for that request\n const requestId = 'login'\n \n // A string that will be displayed to the user, indicating the DApp requesting access/signature\n const dappName = 'Hello Celo'\n \n // The deeplink that the Celo Wallet will use to redirect the user back to the DApp with the appropriate payload.\n const callback = Linking.makeUrl('/my/path')\n \n // Ask the Celo Alfajores Wallet for user info\n requestAccountAddress({\n requestId,\n dappName,\n callback,\n })\n \n // Wait for the Celo Wallet response\n const dappkitResponse = await waitForAccountAuth(requestId)\n\n // Set the default account to the account returned from the wallet\n kit.defaultAccount = dappkitResponse.address\n\n // Get the stabel token contract\n const stableToken = await kit.contracts.getStableToken()\n\n // Get the user account balance (cUSD)\n const cUSDBalanceBig = await stableToken.balanceOf(kit.defaultAccount)\n \n // Convert from a big number to a string by rounding it to the appropriate number of decimal places\n const ERC20_DECIMALS = 18\n let cUSDBalanceDec = cUSDBalanceBig.shiftedBy(-ERC20_DECIMALS).toFixed(2)\n let cUSDBalance = cUSDBalanceDec.toString()\n \n // Update state\n setcUSDBalance(cUSDBalance);\n setIsLoadingBalance(false);\n setAddress(dappkitResponse.address);\n setPhoneNumber(dappkitResponse.phoneNumber);\n }\n\n return (\n \n\n {/* */}\n {/* Login first\n \n );\n \n}\n\nexport default App;"]},"metadata":{},"sourceType":"module"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e94840122d00ead93d0bcb17435867b.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e94840122d00ead93d0bcb17435867b.json
new file mode 100644
index 000000000..07dde42eb
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/0e94840122d00ead93d0bcb17435867b.json
@@ -0,0 +1 @@
+{"ast":null,"code":"var hash = exports;\nhash.utils = require(\"./hash/utils\");\nhash.common = require(\"./hash/common\");\nhash.sha = require(\"./hash/sha\");\nhash.ripemd = require(\"./hash/ripemd\");\nhash.hmac = require(\"./hash/hmac\");\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/hash.js/lib/hash.js"],"names":["hash","exports","utils","require","common","sha","ripemd","hmac","sha1","sha256","sha224","sha384","sha512","ripemd160"],"mappings":"AAAA,IAAIA,IAAI,GAAGC,OAAX;AAEAD,IAAI,CAACE,KAAL,GAAaC,OAAO,gBAApB;AACAH,IAAI,CAACI,MAAL,GAAcD,OAAO,iBAArB;AACAH,IAAI,CAACK,GAAL,GAAWF,OAAO,cAAlB;AACAH,IAAI,CAACM,MAAL,GAAcH,OAAO,iBAArB;AACAH,IAAI,CAACO,IAAL,GAAYJ,OAAO,eAAnB;AAGAH,IAAI,CAACQ,IAAL,GAAYR,IAAI,CAACK,GAAL,CAASG,IAArB;AACAR,IAAI,CAACS,MAAL,GAAcT,IAAI,CAACK,GAAL,CAASI,MAAvB;AACAT,IAAI,CAACU,MAAL,GAAcV,IAAI,CAACK,GAAL,CAASK,MAAvB;AACAV,IAAI,CAACW,MAAL,GAAcX,IAAI,CAACK,GAAL,CAASM,MAAvB;AACAX,IAAI,CAACY,MAAL,GAAcZ,IAAI,CAACK,GAAL,CAASO,MAAvB;AACAZ,IAAI,CAACa,SAAL,GAAiBb,IAAI,CAACM,MAAL,CAAYO,SAA7B","sourcesContent":["var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1056a500064acc6db50fdfb7ca1d9420.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1056a500064acc6db50fdfb7ca1d9420.json
new file mode 100644
index 000000000..aa265f2e7
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1056a500064acc6db50fdfb7ca1d9420.json
@@ -0,0 +1 @@
+{"ast":null,"code":"exports.pbkdf2 = require(\"./lib/async\");\nexports.pbkdf2Sync = require(\"./lib/sync\");","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/pbkdf2/browser.js"],"names":["exports","pbkdf2","require","pbkdf2Sync"],"mappings":"AAAAA,OAAO,CAACC,MAAR,GAAiBC,OAAO,eAAxB;AACAF,OAAO,CAACG,UAAR,GAAqBD,OAAO,cAA5B","sourcesContent":["exports.pbkdf2 = require('./lib/async')\nexports.pbkdf2Sync = require('./lib/sync')\n"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/105ec6d450b76ec9ab7876818692b3e2.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/105ec6d450b76ec9ab7876818692b3e2.json
new file mode 100644
index 000000000..c4a86182c
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/105ec6d450b76ec9ab7876818692b3e2.json
@@ -0,0 +1 @@
+{"ast":null,"code":"var inherits = require('inherits');\n\nvar Hash = require(\"./hash\");\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817];\nvar W = new Array(160);\n\nfunction Sha512() {\n this.init();\n this._w = W;\n Hash.call(this, 128, 112);\n}\n\ninherits(Sha512, Hash);\n\nSha512.prototype.init = function () {\n this._ah = 0x6a09e667;\n this._bh = 0xbb67ae85;\n this._ch = 0x3c6ef372;\n this._dh = 0xa54ff53a;\n this._eh = 0x510e527f;\n this._fh = 0x9b05688c;\n this._gh = 0x1f83d9ab;\n this._hh = 0x5be0cd19;\n this._al = 0xf3bcc908;\n this._bl = 0x84caa73b;\n this._cl = 0xfe94f82b;\n this._dl = 0x5f1d36f1;\n this._el = 0xade682d1;\n this._fl = 0x2b3e6c1f;\n this._gl = 0xfb41bd6b;\n this._hl = 0x137e2179;\n return this;\n};\n\nfunction Ch(x, y, z) {\n return z ^ x & (y ^ z);\n}\n\nfunction maj(x, y, z) {\n return x & y | z & (x | y);\n}\n\nfunction sigma0(x, xl) {\n return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25);\n}\n\nfunction sigma1(x, xl) {\n return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23);\n}\n\nfunction Gamma0(x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ x >>> 7;\n}\n\nfunction Gamma0l(x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25);\n}\n\nfunction Gamma1(x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ x >>> 6;\n}\n\nfunction Gamma1l(x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26);\n}\n\nfunction getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n}\n\nSha512.prototype._update = function (M) {\n var W = this._w;\n var ah = this._ah | 0;\n var bh = this._bh | 0;\n var ch = this._ch | 0;\n var dh = this._dh | 0;\n var eh = this._eh | 0;\n var fh = this._fh | 0;\n var gh = this._gh | 0;\n var hh = this._hh | 0;\n var al = this._al | 0;\n var bl = this._bl | 0;\n var cl = this._cl | 0;\n var dl = this._dl | 0;\n var el = this._el | 0;\n var fl = this._fl | 0;\n var gl = this._gl | 0;\n var hl = this._hl | 0;\n\n for (var i = 0; i < 32; i += 2) {\n W[i] = M.readInt32BE(i * 4);\n W[i + 1] = M.readInt32BE(i * 4 + 4);\n }\n\n for (; i < 160; i += 2) {\n var xh = W[i - 15 * 2];\n var xl = W[i - 15 * 2 + 1];\n var gamma0 = Gamma0(xh, xl);\n var gamma0l = Gamma0l(xl, xh);\n xh = W[i - 2 * 2];\n xl = W[i - 2 * 2 + 1];\n var gamma1 = Gamma1(xh, xl);\n var gamma1l = Gamma1l(xl, xh);\n var Wi7h = W[i - 7 * 2];\n var Wi7l = W[i - 7 * 2 + 1];\n var Wi16h = W[i - 16 * 2];\n var Wi16l = W[i - 16 * 2 + 1];\n var Wil = gamma0l + Wi7l | 0;\n var Wih = gamma0 + Wi7h + getCarry(Wil, gamma0l) | 0;\n Wil = Wil + gamma1l | 0;\n Wih = Wih + gamma1 + getCarry(Wil, gamma1l) | 0;\n Wil = Wil + Wi16l | 0;\n Wih = Wih + Wi16h + getCarry(Wil, Wi16l) | 0;\n W[i] = Wih;\n W[i + 1] = Wil;\n }\n\n for (var j = 0; j < 160; j += 2) {\n Wih = W[j];\n Wil = W[j + 1];\n var majh = maj(ah, bh, ch);\n var majl = maj(al, bl, cl);\n var sigma0h = sigma0(ah, al);\n var sigma0l = sigma0(al, ah);\n var sigma1h = sigma1(eh, el);\n var sigma1l = sigma1(el, eh);\n var Kih = K[j];\n var Kil = K[j + 1];\n var chh = Ch(eh, fh, gh);\n var chl = Ch(el, fl, gl);\n var t1l = hl + sigma1l | 0;\n var t1h = hh + sigma1h + getCarry(t1l, hl) | 0;\n t1l = t1l + chl | 0;\n t1h = t1h + chh + getCarry(t1l, chl) | 0;\n t1l = t1l + Kil | 0;\n t1h = t1h + Kih + getCarry(t1l, Kil) | 0;\n t1l = t1l + Wil | 0;\n t1h = t1h + Wih + getCarry(t1l, Wil) | 0;\n var t2l = sigma0l + majl | 0;\n var t2h = sigma0h + majh + getCarry(t2l, sigma0l) | 0;\n hh = gh;\n hl = gl;\n gh = fh;\n gl = fl;\n fh = eh;\n fl = el;\n el = dl + t1l | 0;\n eh = dh + t1h + getCarry(el, dl) | 0;\n dh = ch;\n dl = cl;\n ch = bh;\n cl = bl;\n bh = ah;\n bl = al;\n al = t1l + t2l | 0;\n ah = t1h + t2h + getCarry(al, t1l) | 0;\n }\n\n this._al = this._al + al | 0;\n this._bl = this._bl + bl | 0;\n this._cl = this._cl + cl | 0;\n this._dl = this._dl + dl | 0;\n this._el = this._el + el | 0;\n this._fl = this._fl + fl | 0;\n this._gl = this._gl + gl | 0;\n this._hl = this._hl + hl | 0;\n this._ah = this._ah + ah + getCarry(this._al, al) | 0;\n this._bh = this._bh + bh + getCarry(this._bl, bl) | 0;\n this._ch = this._ch + ch + getCarry(this._cl, cl) | 0;\n this._dh = this._dh + dh + getCarry(this._dl, dl) | 0;\n this._eh = this._eh + eh + getCarry(this._el, el) | 0;\n this._fh = this._fh + fh + getCarry(this._fl, fl) | 0;\n this._gh = this._gh + gh + getCarry(this._gl, gl) | 0;\n this._hh = this._hh + hh + getCarry(this._hl, hl) | 0;\n};\n\nSha512.prototype._hash = function () {\n var H = Buffer.allocUnsafe(64);\n\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset);\n H.writeInt32BE(l, offset + 4);\n }\n\n writeInt64BE(this._ah, this._al, 0);\n writeInt64BE(this._bh, this._bl, 8);\n writeInt64BE(this._ch, this._cl, 16);\n writeInt64BE(this._dh, this._dl, 24);\n writeInt64BE(this._eh, this._el, 32);\n writeInt64BE(this._fh, this._fl, 40);\n writeInt64BE(this._gh, this._gl, 48);\n writeInt64BE(this._hh, this._hl, 56);\n return H;\n};\n\nmodule.exports = Sha512;","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/sha.js/sha512.js"],"names":["inherits","require","Hash","Buffer","K","W","Array","Sha512","init","_w","call","prototype","_ah","_bh","_ch","_dh","_eh","_fh","_gh","_hh","_al","_bl","_cl","_dl","_el","_fl","_gl","_hl","Ch","x","y","z","maj","sigma0","xl","sigma1","Gamma0","Gamma0l","Gamma1","Gamma1l","getCarry","a","b","_update","M","ah","bh","ch","dh","eh","fh","gh","hh","al","bl","cl","dl","el","fl","gl","hl","i","readInt32BE","xh","gamma0","gamma0l","gamma1","gamma1l","Wi7h","Wi7l","Wi16h","Wi16l","Wil","Wih","j","majh","majl","sigma0h","sigma0l","sigma1h","sigma1l","Kih","Kil","chh","chl","t1l","t1h","t2l","t2h","_hash","H","allocUnsafe","writeInt64BE","h","l","offset","writeInt32BE","module","exports"],"mappings":"AAAA,IAAIA,QAAQ,GAAGC,OAAO,CAAC,UAAD,CAAtB;;AACA,IAAIC,IAAI,GAAGD,OAAO,UAAlB;;AACA,IAAIE,MAAM,GAAGF,OAAO,CAAC,aAAD,CAAP,CAAuBE,MAApC;;AAEA,IAAIC,CAAC,GAAG,CACN,UADM,EACM,UADN,EACkB,UADlB,EAC8B,UAD9B,EAEN,UAFM,EAEM,UAFN,EAEkB,UAFlB,EAE8B,UAF9B,EAGN,UAHM,EAGM,UAHN,EAGkB,UAHlB,EAG8B,UAH9B,EAIN,UAJM,EAIM,UAJN,EAIkB,UAJlB,EAI8B,UAJ9B,EAKN,UALM,EAKM,UALN,EAKkB,UALlB,EAK8B,UAL9B,EAMN,UANM,EAMM,UANN,EAMkB,UANlB,EAM8B,UAN9B,EAON,UAPM,EAOM,UAPN,EAOkB,UAPlB,EAO8B,UAP9B,EAQN,UARM,EAQM,UARN,EAQkB,UARlB,EAQ8B,UAR9B,EASN,UATM,EASM,UATN,EASkB,UATlB,EAS8B,UAT9B,EAUN,UAVM,EAUM,UAVN,EAUkB,UAVlB,EAU8B,UAV9B,EAWN,UAXM,EAWM,UAXN,EAWkB,UAXlB,EAW8B,UAX9B,EAYN,UAZM,EAYM,UAZN,EAYkB,UAZlB,EAY8B,UAZ9B,EAaN,UAbM,EAaM,UAbN,EAakB,UAblB,EAa8B,UAb9B,EAcN,UAdM,EAcM,UAdN,EAckB,UAdlB,EAc8B,UAd9B,EAeN,UAfM,EAeM,UAfN,EAekB,UAflB,EAe8B,UAf9B,EAgBN,UAhBM,EAgBM,UAhBN,EAgBkB,UAhBlB,EAgB8B,UAhB9B,EAiBN,UAjBM,EAiBM,UAjBN,EAiBkB,UAjBlB,EAiB8B,UAjB9B,EAkBN,UAlBM,EAkBM,UAlBN,EAkBkB,UAlBlB,EAkB8B,UAlB9B,EAmBN,UAnBM,EAmBM,UAnBN,EAmBkB,UAnBlB,EAmB8B,UAnB9B,EAoBN,UApBM,EAoBM,UApBN,EAoBkB,UApBlB,EAoB8B,UApB9B,EAqBN,UArBM,EAqBM,UArBN,EAqBkB,UArBlB,EAqB8B,UArB9B,EAsBN,UAtBM,EAsBM,UAtBN,EAsBkB,UAtBlB,EAsB8B,UAtB9B,EAuBN,UAvBM,EAuBM,UAvBN,EAuBkB,UAvBlB,EAuB8B,UAvB9B,EAwBN,UAxBM,EAwBM,UAxBN,EAwBkB,UAxBlB,EAwB8B,UAxB9B,EAyBN,UAzBM,EAyBM,UAzBN,EAyBkB,UAzBlB,EAyB8B,UAzB9B,EA0BN,UA1BM,EA0BM,UA1BN,EA0BkB,UA1BlB,EA0B8B,UA1B9B,EA2BN,UA3BM,EA2BM,UA3BN,EA2BkB,UA3BlB,EA2B8B,UA3B9B,EA4BN,UA5BM,EA4BM,UA5BN,EA4BkB,UA5BlB,EA4B8B,UA5B9B,EA6BN,UA7BM,EA6BM,UA7BN,EA6BkB,UA7BlB,EA6B8B,UA7B9B,EA8BN,UA9BM,EA8BM,UA9BN,EA8BkB,UA9BlB,EA8B8B,UA9B9B,EA+BN,UA/BM,EA+BM,UA/BN,EA+BkB,UA/BlB,EA+B8B,UA/B9B,EAgCN,UAhCM,EAgCM,UAhCN,EAgCkB,UAhClB,EAgC8B,UAhC9B,EAiCN,UAjCM,EAiCM,UAjCN,EAiCkB,UAjClB,EAiC8B,UAjC9B,EAkCN,UAlCM,EAkCM,UAlCN,EAkCkB,UAlClB,EAkC8B,UAlC9B,EAmCN,UAnCM,EAmCM,UAnCN,EAmCkB,UAnClB,EAmC8B,UAnC9B,EAoCN,UApCM,EAoCM,UApCN,EAoCkB,UApClB,EAoC8B,UApC9B,EAqCN,UArCM,EAqCM,UArCN,EAqCkB,UArClB,EAqC8B,UArC9B,EAsCN,UAtCM,EAsCM,UAtCN,EAsCkB,UAtClB,EAsC8B,UAtC9B,EAuCN,UAvCM,EAuCM,UAvCN,EAuCkB,UAvClB,EAuC8B,UAvC9B,EAwCN,UAxCM,EAwCM,UAxCN,EAwCkB,UAxClB,EAwC8B,UAxC9B,CAAR;AA2CA,IAAIC,CAAC,GAAG,IAAIC,KAAJ,CAAU,GAAV,CAAR;;AAEA,SAASC,MAAT,GAAmB;AACjB,OAAKC,IAAL;AACA,OAAKC,EAAL,GAAUJ,CAAV;AAEAH,EAAAA,IAAI,CAACQ,IAAL,CAAU,IAAV,EAAgB,GAAhB,EAAqB,GAArB;AACD;;AAEDV,QAAQ,CAACO,MAAD,EAASL,IAAT,CAAR;;AAEAK,MAAM,CAACI,SAAP,CAAiBH,IAAjB,GAAwB,YAAY;AAClC,OAAKI,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AAEA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AACA,OAAKC,GAAL,GAAW,UAAX;AAEA,SAAO,IAAP;AACD,CApBD;;AAsBA,SAASC,EAAT,CAAaC,CAAb,EAAgBC,CAAhB,EAAmBC,CAAnB,EAAsB;AACpB,SAAOA,CAAC,GAAIF,CAAC,IAAIC,CAAC,GAAGC,CAAR,CAAb;AACD;;AAED,SAASC,GAAT,CAAcH,CAAd,EAAiBC,CAAjB,EAAoBC,CAApB,EAAuB;AACrB,SAAQF,CAAC,GAAGC,CAAL,GAAWC,CAAC,IAAIF,CAAC,GAAGC,CAAR,CAAnB;AACD;;AAED,SAASG,MAAT,CAAiBJ,CAAjB,EAAoBK,EAApB,EAAwB;AACtB,SAAO,CAACL,CAAC,KAAK,EAAN,GAAWK,EAAE,IAAI,CAAlB,KAAwBA,EAAE,KAAK,CAAP,GAAWL,CAAC,IAAI,EAAxC,KAA+CK,EAAE,KAAK,CAAP,GAAWL,CAAC,IAAI,EAA/D,CAAP;AACD;;AAED,SAASM,MAAT,CAAiBN,CAAjB,EAAoBK,EAApB,EAAwB;AACtB,SAAO,CAACL,CAAC,KAAK,EAAN,GAAWK,EAAE,IAAI,EAAlB,KAAyBL,CAAC,KAAK,EAAN,GAAWK,EAAE,IAAI,EAA1C,KAAiDA,EAAE,KAAK,CAAP,GAAWL,CAAC,IAAI,EAAjE,CAAP;AACD;;AAED,SAASO,MAAT,CAAiBP,CAAjB,EAAoBK,EAApB,EAAwB;AACtB,SAAO,CAACL,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAAjB,KAAwBL,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAAxC,IAA+CL,CAAC,KAAK,CAA5D;AACD;;AAED,SAASQ,OAAT,CAAkBR,CAAlB,EAAqBK,EAArB,EAAyB;AACvB,SAAO,CAACL,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAAjB,KAAwBL,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAAxC,KAA+CL,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAA/D,CAAP;AACD;;AAED,SAASI,MAAT,CAAiBT,CAAjB,EAAoBK,EAApB,EAAwB;AACtB,SAAO,CAACL,CAAC,KAAK,EAAN,GAAWK,EAAE,IAAI,EAAlB,KAAyBA,EAAE,KAAK,EAAP,GAAYL,CAAC,IAAI,CAA1C,IAAgDA,CAAC,KAAK,CAA7D;AACD;;AAED,SAASU,OAAT,CAAkBV,CAAlB,EAAqBK,EAArB,EAAyB;AACvB,SAAO,CAACL,CAAC,KAAK,EAAN,GAAWK,EAAE,IAAI,EAAlB,KAAyBA,EAAE,KAAK,EAAP,GAAYL,CAAC,IAAI,CAA1C,KAAgDA,CAAC,KAAK,CAAN,GAAUK,EAAE,IAAI,EAAhE,CAAP;AACD;;AAED,SAASM,QAAT,CAAmBC,CAAnB,EAAsBC,CAAtB,EAAyB;AACvB,SAAQD,CAAC,KAAK,CAAP,GAAaC,CAAC,KAAK,CAAnB,GAAwB,CAAxB,GAA4B,CAAnC;AACD;;AAEDnC,MAAM,CAACI,SAAP,CAAiBgC,OAAjB,GAA2B,UAAUC,CAAV,EAAa;AACtC,MAAIvC,CAAC,GAAG,KAAKI,EAAb;AAEA,MAAIoC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AAEA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;AACA,MAAIkC,EAAE,GAAG,KAAKjC,GAAL,GAAW,CAApB;;AAEA,OAAK,IAAIkC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,EAApB,EAAwBA,CAAC,IAAI,CAA7B,EAAgC;AAC9BxD,IAAAA,CAAC,CAACwD,CAAD,CAAD,GAAOjB,CAAC,CAACkB,WAAF,CAAcD,CAAC,GAAG,CAAlB,CAAP;AACAxD,IAAAA,CAAC,CAACwD,CAAC,GAAG,CAAL,CAAD,GAAWjB,CAAC,CAACkB,WAAF,CAAcD,CAAC,GAAG,CAAJ,GAAQ,CAAtB,CAAX;AACD;;AACD,SAAOA,CAAC,GAAG,GAAX,EAAgBA,CAAC,IAAI,CAArB,EAAwB;AACtB,QAAIE,EAAE,GAAG1D,CAAC,CAACwD,CAAC,GAAG,KAAK,CAAV,CAAV;AACA,QAAI3B,EAAE,GAAG7B,CAAC,CAACwD,CAAC,GAAG,KAAK,CAAT,GAAa,CAAd,CAAV;AACA,QAAIG,MAAM,GAAG5B,MAAM,CAAC2B,EAAD,EAAK7B,EAAL,CAAnB;AACA,QAAI+B,OAAO,GAAG5B,OAAO,CAACH,EAAD,EAAK6B,EAAL,CAArB;AAEAA,IAAAA,EAAE,GAAG1D,CAAC,CAACwD,CAAC,GAAG,IAAI,CAAT,CAAN;AACA3B,IAAAA,EAAE,GAAG7B,CAAC,CAACwD,CAAC,GAAG,IAAI,CAAR,GAAY,CAAb,CAAN;AACA,QAAIK,MAAM,GAAG5B,MAAM,CAACyB,EAAD,EAAK7B,EAAL,CAAnB;AACA,QAAIiC,OAAO,GAAG5B,OAAO,CAACL,EAAD,EAAK6B,EAAL,CAArB;AAGA,QAAIK,IAAI,GAAG/D,CAAC,CAACwD,CAAC,GAAG,IAAI,CAAT,CAAZ;AACA,QAAIQ,IAAI,GAAGhE,CAAC,CAACwD,CAAC,GAAG,IAAI,CAAR,GAAY,CAAb,CAAZ;AAEA,QAAIS,KAAK,GAAGjE,CAAC,CAACwD,CAAC,GAAG,KAAK,CAAV,CAAb;AACA,QAAIU,KAAK,GAAGlE,CAAC,CAACwD,CAAC,GAAG,KAAK,CAAT,GAAa,CAAd,CAAb;AAEA,QAAIW,GAAG,GAAIP,OAAO,GAAGI,IAAX,GAAmB,CAA7B;AACA,QAAII,GAAG,GAAIT,MAAM,GAAGI,IAAT,GAAgB5B,QAAQ,CAACgC,GAAD,EAAMP,OAAN,CAAzB,GAA2C,CAArD;AACAO,IAAAA,GAAG,GAAIA,GAAG,GAAGL,OAAP,GAAkB,CAAxB;AACAM,IAAAA,GAAG,GAAIA,GAAG,GAAGP,MAAN,GAAe1B,QAAQ,CAACgC,GAAD,EAAML,OAAN,CAAxB,GAA0C,CAAhD;AACAK,IAAAA,GAAG,GAAIA,GAAG,GAAGD,KAAP,GAAgB,CAAtB;AACAE,IAAAA,GAAG,GAAIA,GAAG,GAAGH,KAAN,GAAc9B,QAAQ,CAACgC,GAAD,EAAMD,KAAN,CAAvB,GAAuC,CAA7C;AAEAlE,IAAAA,CAAC,CAACwD,CAAD,CAAD,GAAOY,GAAP;AACApE,IAAAA,CAAC,CAACwD,CAAC,GAAG,CAAL,CAAD,GAAWW,GAAX;AACD;;AAED,OAAK,IAAIE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,GAApB,EAAyBA,CAAC,IAAI,CAA9B,EAAiC;AAC/BD,IAAAA,GAAG,GAAGpE,CAAC,CAACqE,CAAD,CAAP;AACAF,IAAAA,GAAG,GAAGnE,CAAC,CAACqE,CAAC,GAAG,CAAL,CAAP;AAEA,QAAIC,IAAI,GAAG3C,GAAG,CAACa,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAd;AACA,QAAI6B,IAAI,GAAG5C,GAAG,CAACqB,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAd;AAEA,QAAIsB,OAAO,GAAG5C,MAAM,CAACY,EAAD,EAAKQ,EAAL,CAApB;AACA,QAAIyB,OAAO,GAAG7C,MAAM,CAACoB,EAAD,EAAKR,EAAL,CAApB;AACA,QAAIkC,OAAO,GAAG5C,MAAM,CAACc,EAAD,EAAKQ,EAAL,CAApB;AACA,QAAIuB,OAAO,GAAG7C,MAAM,CAACsB,EAAD,EAAKR,EAAL,CAApB;AAGA,QAAIgC,GAAG,GAAG7E,CAAC,CAACsE,CAAD,CAAX;AACA,QAAIQ,GAAG,GAAG9E,CAAC,CAACsE,CAAC,GAAG,CAAL,CAAX;AAEA,QAAIS,GAAG,GAAGvD,EAAE,CAACqB,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAZ;AACA,QAAIiC,GAAG,GAAGxD,EAAE,CAAC6B,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAZ;AAEA,QAAI0B,GAAG,GAAIzB,EAAE,GAAGoB,OAAN,GAAiB,CAA3B;AACA,QAAIM,GAAG,GAAIlC,EAAE,GAAG2B,OAAL,GAAevC,QAAQ,CAAC6C,GAAD,EAAMzB,EAAN,CAAxB,GAAqC,CAA/C;AACAyB,IAAAA,GAAG,GAAIA,GAAG,GAAGD,GAAP,GAAc,CAApB;AACAE,IAAAA,GAAG,GAAIA,GAAG,GAAGH,GAAN,GAAY3C,QAAQ,CAAC6C,GAAD,EAAMD,GAAN,CAArB,GAAmC,CAAzC;AACAC,IAAAA,GAAG,GAAIA,GAAG,GAAGH,GAAP,GAAc,CAApB;AACAI,IAAAA,GAAG,GAAIA,GAAG,GAAGL,GAAN,GAAYzC,QAAQ,CAAC6C,GAAD,EAAMH,GAAN,CAArB,GAAmC,CAAzC;AACAG,IAAAA,GAAG,GAAIA,GAAG,GAAGb,GAAP,GAAc,CAApB;AACAc,IAAAA,GAAG,GAAIA,GAAG,GAAGb,GAAN,GAAYjC,QAAQ,CAAC6C,GAAD,EAAMb,GAAN,CAArB,GAAmC,CAAzC;AAGA,QAAIe,GAAG,GAAIT,OAAO,GAAGF,IAAX,GAAmB,CAA7B;AACA,QAAIY,GAAG,GAAIX,OAAO,GAAGF,IAAV,GAAiBnC,QAAQ,CAAC+C,GAAD,EAAMT,OAAN,CAA1B,GAA4C,CAAtD;AAEA1B,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAR,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAR,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAA,IAAAA,EAAE,GAAID,EAAE,GAAG6B,GAAN,GAAa,CAAlB;AACApC,IAAAA,EAAE,GAAID,EAAE,GAAGsC,GAAL,GAAW9C,QAAQ,CAACiB,EAAD,EAAKD,EAAL,CAApB,GAAgC,CAArC;AACAR,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAR,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAR,IAAAA,EAAE,GAAGD,EAAL;AACAS,IAAAA,EAAE,GAAGD,EAAL;AACAA,IAAAA,EAAE,GAAIgC,GAAG,GAAGE,GAAP,GAAc,CAAnB;AACA1C,IAAAA,EAAE,GAAIyC,GAAG,GAAGE,GAAN,GAAYhD,QAAQ,CAACa,EAAD,EAAKgC,GAAL,CAArB,GAAkC,CAAvC;AACD;;AAED,OAAKjE,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AACA,OAAKhC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAZ,GAAkB,CAA7B;AAEA,OAAKhD,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBL,QAAQ,CAAC,KAAKpB,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBN,QAAQ,CAAC,KAAKnB,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBP,QAAQ,CAAC,KAAKlB,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBR,QAAQ,CAAC,KAAKjB,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBT,QAAQ,CAAC,KAAKhB,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBV,QAAQ,CAAC,KAAKf,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBX,QAAQ,CAAC,KAAKd,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACA,OAAKxC,GAAL,GAAY,KAAKA,GAAL,GAAWiC,EAAX,GAAgBZ,QAAQ,CAAC,KAAKb,GAAN,EAAWiC,EAAX,CAAzB,GAA2C,CAAtD;AACD,CAzHD;;AA2HArD,MAAM,CAACI,SAAP,CAAiB8E,KAAjB,GAAyB,YAAY;AACnC,MAAIC,CAAC,GAAGvF,MAAM,CAACwF,WAAP,CAAmB,EAAnB,CAAR;;AAEA,WAASC,YAAT,CAAuBC,CAAvB,EAA0BC,CAA1B,EAA6BC,MAA7B,EAAqC;AACnCL,IAAAA,CAAC,CAACM,YAAF,CAAeH,CAAf,EAAkBE,MAAlB;AACAL,IAAAA,CAAC,CAACM,YAAF,CAAeF,CAAf,EAAkBC,MAAM,GAAG,CAA3B;AACD;;AAEDH,EAAAA,YAAY,CAAC,KAAKhF,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,CAArB,CAAZ;AACAwE,EAAAA,YAAY,CAAC,KAAK/E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,CAArB,CAAZ;AACAuE,EAAAA,YAAY,CAAC,KAAK9E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AACAsE,EAAAA,YAAY,CAAC,KAAK7E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AACAqE,EAAAA,YAAY,CAAC,KAAK5E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AACAoE,EAAAA,YAAY,CAAC,KAAK3E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AACAmE,EAAAA,YAAY,CAAC,KAAK1E,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AACAkE,EAAAA,YAAY,CAAC,KAAKzE,GAAN,EAAW,KAAKQ,GAAhB,EAAqB,EAArB,CAAZ;AAEA,SAAO+D,CAAP;AACD,CAlBD;;AAoBAO,MAAM,CAACC,OAAP,GAAiB3F,MAAjB","sourcesContent":["var inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n]\n\nvar W = new Array(160)\n\nfunction Sha512 () {\n this.init()\n this._w = W\n\n Hash.call(this, 128, 112)\n}\n\ninherits(Sha512, Hash)\n\nSha512.prototype.init = function () {\n this._ah = 0x6a09e667\n this._bh = 0xbb67ae85\n this._ch = 0x3c6ef372\n this._dh = 0xa54ff53a\n this._eh = 0x510e527f\n this._fh = 0x9b05688c\n this._gh = 0x1f83d9ab\n this._hh = 0x5be0cd19\n\n this._al = 0xf3bcc908\n this._bl = 0x84caa73b\n this._cl = 0xfe94f82b\n this._dl = 0x5f1d36f1\n this._el = 0xade682d1\n this._fl = 0x2b3e6c1f\n this._gl = 0xfb41bd6b\n this._hl = 0x137e2179\n\n return this\n}\n\nfunction Ch (x, y, z) {\n return z ^ (x & (y ^ z))\n}\n\nfunction maj (x, y, z) {\n return (x & y) | (z & (x | y))\n}\n\nfunction sigma0 (x, xl) {\n return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25)\n}\n\nfunction sigma1 (x, xl) {\n return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23)\n}\n\nfunction Gamma0 (x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7)\n}\n\nfunction Gamma0l (x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25)\n}\n\nfunction Gamma1 (x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6)\n}\n\nfunction Gamma1l (x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26)\n}\n\nfunction getCarry (a, b) {\n return (a >>> 0) < (b >>> 0) ? 1 : 0\n}\n\nSha512.prototype._update = function (M) {\n var W = this._w\n\n var ah = this._ah | 0\n var bh = this._bh | 0\n var ch = this._ch | 0\n var dh = this._dh | 0\n var eh = this._eh | 0\n var fh = this._fh | 0\n var gh = this._gh | 0\n var hh = this._hh | 0\n\n var al = this._al | 0\n var bl = this._bl | 0\n var cl = this._cl | 0\n var dl = this._dl | 0\n var el = this._el | 0\n var fl = this._fl | 0\n var gl = this._gl | 0\n var hl = this._hl | 0\n\n for (var i = 0; i < 32; i += 2) {\n W[i] = M.readInt32BE(i * 4)\n W[i + 1] = M.readInt32BE(i * 4 + 4)\n }\n for (; i < 160; i += 2) {\n var xh = W[i - 15 * 2]\n var xl = W[i - 15 * 2 + 1]\n var gamma0 = Gamma0(xh, xl)\n var gamma0l = Gamma0l(xl, xh)\n\n xh = W[i - 2 * 2]\n xl = W[i - 2 * 2 + 1]\n var gamma1 = Gamma1(xh, xl)\n var gamma1l = Gamma1l(xl, xh)\n\n // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n var Wi7h = W[i - 7 * 2]\n var Wi7l = W[i - 7 * 2 + 1]\n\n var Wi16h = W[i - 16 * 2]\n var Wi16l = W[i - 16 * 2 + 1]\n\n var Wil = (gamma0l + Wi7l) | 0\n var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0\n Wil = (Wil + gamma1l) | 0\n Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0\n Wil = (Wil + Wi16l) | 0\n Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0\n\n W[i] = Wih\n W[i + 1] = Wil\n }\n\n for (var j = 0; j < 160; j += 2) {\n Wih = W[j]\n Wil = W[j + 1]\n\n var majh = maj(ah, bh, ch)\n var majl = maj(al, bl, cl)\n\n var sigma0h = sigma0(ah, al)\n var sigma0l = sigma0(al, ah)\n var sigma1h = sigma1(eh, el)\n var sigma1l = sigma1(el, eh)\n\n // t1 = h + sigma1 + ch + K[j] + W[j]\n var Kih = K[j]\n var Kil = K[j + 1]\n\n var chh = Ch(eh, fh, gh)\n var chl = Ch(el, fl, gl)\n\n var t1l = (hl + sigma1l) | 0\n var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0\n t1l = (t1l + chl) | 0\n t1h = (t1h + chh + getCarry(t1l, chl)) | 0\n t1l = (t1l + Kil) | 0\n t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0\n t1l = (t1l + Wil) | 0\n t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0\n\n // t2 = sigma0 + maj\n var t2l = (sigma0l + majl) | 0\n var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0\n\n hh = gh\n hl = gl\n gh = fh\n gl = fl\n fh = eh\n fl = el\n el = (dl + t1l) | 0\n eh = (dh + t1h + getCarry(el, dl)) | 0\n dh = ch\n dl = cl\n ch = bh\n cl = bl\n bh = ah\n bl = al\n al = (t1l + t2l) | 0\n ah = (t1h + t2h + getCarry(al, t1l)) | 0\n }\n\n this._al = (this._al + al) | 0\n this._bl = (this._bl + bl) | 0\n this._cl = (this._cl + cl) | 0\n this._dl = (this._dl + dl) | 0\n this._el = (this._el + el) | 0\n this._fl = (this._fl + fl) | 0\n this._gl = (this._gl + gl) | 0\n this._hl = (this._hl + hl) | 0\n\n this._ah = (this._ah + ah + getCarry(this._al, al)) | 0\n this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0\n this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0\n this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0\n this._eh = (this._eh + eh + getCarry(this._el, el)) | 0\n this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0\n this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0\n this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0\n}\n\nSha512.prototype._hash = function () {\n var H = Buffer.allocUnsafe(64)\n\n function writeInt64BE (h, l, offset) {\n H.writeInt32BE(h, offset)\n H.writeInt32BE(l, offset + 4)\n }\n\n writeInt64BE(this._ah, this._al, 0)\n writeInt64BE(this._bh, this._bl, 8)\n writeInt64BE(this._ch, this._cl, 16)\n writeInt64BE(this._dh, this._dl, 24)\n writeInt64BE(this._eh, this._el, 32)\n writeInt64BE(this._fh, this._fl, 40)\n writeInt64BE(this._gh, this._gl, 48)\n writeInt64BE(this._hh, this._hl, 56)\n\n return H\n}\n\nmodule.exports = Sha512\n"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/107a612e2ee9fce909240a26341818fa.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/107a612e2ee9fce909240a26341818fa.json
new file mode 100644
index 000000000..dc1fd73c4
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/107a612e2ee9fce909240a26341818fa.json
@@ -0,0 +1 @@
+{"ast":null,"code":"'use strict';\n\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n\n for (var key in obj) {\n keys.push(key);\n }\n\n return keys;\n};\n\nmodule.exports = Duplex;\n\nvar Readable = require(\"./_stream_readable\");\n\nvar Writable = require(\"./_stream_writable\");\n\nrequire('inherits')(Duplex, Readable);\n\n{\n var keys = objectKeys(Writable.prototype);\n\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\n\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n});\n\nfunction onend() {\n if (this._writableState.ended) return;\n process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/hash-base/node_modules/readable-stream/lib/_stream_duplex.js"],"names":["objectKeys","Object","keys","obj","key","push","module","exports","Duplex","Readable","require","Writable","prototype","v","length","method","options","call","allowHalfOpen","readable","writable","once","onend","defineProperty","enumerable","get","_writableState","highWaterMark","getBuffer","ended","process","nextTick","onEndNT","self","end","_readableState","undefined","destroyed","set","value"],"mappings":"AAwBA;;AAGA,IAAIA,UAAU,GAAGC,MAAM,CAACC,IAAP,IAAe,UAAUC,GAAV,EAAe;AAC7C,MAAID,IAAI,GAAG,EAAX;;AAEA,OAAK,IAAIE,GAAT,IAAgBD,GAAhB,EAAqB;AACnBD,IAAAA,IAAI,CAACG,IAAL,CAAUD,GAAV;AACD;;AAED,SAAOF,IAAP;AACD,CARD;;AAYAI,MAAM,CAACC,OAAP,GAAiBC,MAAjB;;AAEA,IAAIC,QAAQ,GAAGC,OAAO,sBAAtB;;AAEA,IAAIC,QAAQ,GAAGD,OAAO,sBAAtB;;AAEAA,OAAO,CAAC,UAAD,CAAP,CAAoBF,MAApB,EAA4BC,QAA5B;;AAEA;AAEE,MAAIP,IAAI,GAAGF,UAAU,CAACW,QAAQ,CAACC,SAAV,CAArB;;AAEA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGX,IAAI,CAACY,MAAzB,EAAiCD,CAAC,EAAlC,EAAsC;AACpC,QAAIE,MAAM,GAAGb,IAAI,CAACW,CAAD,CAAjB;AACA,QAAI,CAACL,MAAM,CAACI,SAAP,CAAiBG,MAAjB,CAAL,EAA+BP,MAAM,CAACI,SAAP,CAAiBG,MAAjB,IAA2BJ,QAAQ,CAACC,SAAT,CAAmBG,MAAnB,CAA3B;AAChC;AACF;;AAED,SAASP,MAAT,CAAgBQ,OAAhB,EAAyB;AACvB,MAAI,EAAE,gBAAgBR,MAAlB,CAAJ,EAA+B,OAAO,IAAIA,MAAJ,CAAWQ,OAAX,CAAP;AAC/BP,EAAAA,QAAQ,CAACQ,IAAT,CAAc,IAAd,EAAoBD,OAApB;AACAL,EAAAA,QAAQ,CAACM,IAAT,CAAc,IAAd,EAAoBD,OAApB;AACA,OAAKE,aAAL,GAAqB,IAArB;;AAEA,MAAIF,OAAJ,EAAa;AACX,QAAIA,OAAO,CAACG,QAAR,KAAqB,KAAzB,EAAgC,KAAKA,QAAL,GAAgB,KAAhB;AAChC,QAAIH,OAAO,CAACI,QAAR,KAAqB,KAAzB,EAAgC,KAAKA,QAAL,GAAgB,KAAhB;;AAEhC,QAAIJ,OAAO,CAACE,aAAR,KAA0B,KAA9B,EAAqC;AACnC,WAAKA,aAAL,GAAqB,KAArB;AACA,WAAKG,IAAL,CAAU,KAAV,EAAiBC,KAAjB;AACD;AACF;AACF;;AAEDrB,MAAM,CAACsB,cAAP,CAAsBf,MAAM,CAACI,SAA7B,EAAwC,uBAAxC,EAAiE;AAI/DY,EAAAA,UAAU,EAAE,KAJmD;AAK/DC,EAAAA,GAAG,EAAE,SAASA,GAAT,GAAe;AAClB,WAAO,KAAKC,cAAL,CAAoBC,aAA3B;AACD;AAP8D,CAAjE;AASA1B,MAAM,CAACsB,cAAP,CAAsBf,MAAM,CAACI,SAA7B,EAAwC,gBAAxC,EAA0D;AAIxDY,EAAAA,UAAU,EAAE,KAJ4C;AAKxDC,EAAAA,GAAG,EAAE,SAASA,GAAT,GAAe;AAClB,WAAO,KAAKC,cAAL,IAAuB,KAAKA,cAAL,CAAoBE,SAApB,EAA9B;AACD;AAPuD,CAA1D;AASA3B,MAAM,CAACsB,cAAP,CAAsBf,MAAM,CAACI,SAA7B,EAAwC,gBAAxC,EAA0D;AAIxDY,EAAAA,UAAU,EAAE,KAJ4C;AAKxDC,EAAAA,GAAG,EAAE,SAASA,GAAT,GAAe;AAClB,WAAO,KAAKC,cAAL,CAAoBZ,MAA3B;AACD;AAPuD,CAA1D;;AAUA,SAASQ,KAAT,GAAiB;AAEf,MAAI,KAAKI,cAAL,CAAoBG,KAAxB,EAA+B;AAG/BC,EAAAA,OAAO,CAACC,QAAR,CAAiBC,OAAjB,EAA0B,IAA1B;AACD;;AAED,SAASA,OAAT,CAAiBC,IAAjB,EAAuB;AACrBA,EAAAA,IAAI,CAACC,GAAL;AACD;;AAEDjC,MAAM,CAACsB,cAAP,CAAsBf,MAAM,CAACI,SAA7B,EAAwC,WAAxC,EAAqD;AAInDY,EAAAA,UAAU,EAAE,KAJuC;AAKnDC,EAAAA,GAAG,EAAE,SAASA,GAAT,GAAe;AAClB,QAAI,KAAKU,cAAL,KAAwBC,SAAxB,IAAqC,KAAKV,cAAL,KAAwBU,SAAjE,EAA4E;AAC1E,aAAO,KAAP;AACD;;AAED,WAAO,KAAKD,cAAL,CAAoBE,SAApB,IAAiC,KAAKX,cAAL,CAAoBW,SAA5D;AACD,GAXkD;AAYnDC,EAAAA,GAAG,EAAE,SAASA,GAAT,CAAaC,KAAb,EAAoB;AAGvB,QAAI,KAAKJ,cAAL,KAAwBC,SAAxB,IAAqC,KAAKV,cAAL,KAAwBU,SAAjE,EAA4E;AAC1E;AACD;;AAID,SAAKD,cAAL,CAAoBE,SAApB,GAAgCE,KAAhC;AACA,SAAKb,cAAL,CAAoBW,SAApB,GAAgCE,KAAhC;AACD;AAvBkD,CAArD","sourcesContent":["// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n'use strict';\n/**/\n\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n\n for (var key in obj) {\n keys.push(key);\n }\n\n return keys;\n};\n/**/\n\n\nmodule.exports = Duplex;\n\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nrequire('inherits')(Duplex, Readable);\n\n{\n // Allow the keys array to be GC'ed.\n var keys = objectKeys(Writable.prototype);\n\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\n\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n this.allowHalfOpen = true;\n\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.length;\n }\n}); // the no-half-open enforcer\n\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return; // no more data can be written.\n // But allow more writes to happen in this tick.\n\n process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n } // backward compatibility, the user is explicitly\n // managing destroyed\n\n\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/10ceb24ab85e6a592606b00ff01ea2f8.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/10ceb24ab85e6a592606b00ff01ea2f8.json
new file mode 100644
index 000000000..99f6eba3e
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/10ceb24ab85e6a592606b00ff01ea2f8.json
@@ -0,0 +1 @@
+{"ast":null,"code":"export * from '@unimodules/react-native-adapter';","map":{"version":3,"sources":["../src/AdapterProxy.ts"],"names":[],"mappings":"AAAA,cAAc,kCAAd","sourcesContent":["export * from '@unimodules/react-native-adapter';\n"],"sourceRoot":""},"metadata":{},"sourceType":"module"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/115a8bb4aee7af41cbc54e55f71f16bd.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/115a8bb4aee7af41cbc54e55f71f16bd.json
new file mode 100644
index 000000000..9ea97f3da
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/115a8bb4aee7af41cbc54e55f71f16bd.json
@@ -0,0 +1 @@
+{"ast":null,"code":"'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require(\"../../../errors\").codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n\n return Math.floor(hwm);\n }\n\n return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/hash-base/node_modules/readable-stream/lib/internal/streams/state.js"],"names":["ERR_INVALID_OPT_VALUE","require","codes","highWaterMarkFrom","options","isDuplex","duplexKey","highWaterMark","getHighWaterMark","state","hwm","isFinite","Math","floor","name","objectMode","module","exports"],"mappings":"AAAA;;AAEA,IAAIA,qBAAqB,GAAGC,OAAO,mBAAP,CAA2BC,KAA3B,CAAiCF,qBAA7D;;AAEA,SAASG,iBAAT,CAA2BC,OAA3B,EAAoCC,QAApC,EAA8CC,SAA9C,EAAyD;AACvD,SAAOF,OAAO,CAACG,aAAR,IAAyB,IAAzB,GAAgCH,OAAO,CAACG,aAAxC,GAAwDF,QAAQ,GAAGD,OAAO,CAACE,SAAD,CAAV,GAAwB,IAA/F;AACD;;AAED,SAASE,gBAAT,CAA0BC,KAA1B,EAAiCL,OAAjC,EAA0CE,SAA1C,EAAqDD,QAArD,EAA+D;AAC7D,MAAIK,GAAG,GAAGP,iBAAiB,CAACC,OAAD,EAAUC,QAAV,EAAoBC,SAApB,CAA3B;;AAEA,MAAII,GAAG,IAAI,IAAX,EAAiB;AACf,QAAI,EAAEC,QAAQ,CAACD,GAAD,CAAR,IAAiBE,IAAI,CAACC,KAAL,CAAWH,GAAX,MAAoBA,GAAvC,KAA+CA,GAAG,GAAG,CAAzD,EAA4D;AAC1D,UAAII,IAAI,GAAGT,QAAQ,GAAGC,SAAH,GAAe,eAAlC;AACA,YAAM,IAAIN,qBAAJ,CAA0Bc,IAA1B,EAAgCJ,GAAhC,CAAN;AACD;;AAED,WAAOE,IAAI,CAACC,KAAL,CAAWH,GAAX,CAAP;AACD;;AAGD,SAAOD,KAAK,CAACM,UAAN,GAAmB,EAAnB,GAAwB,KAAK,IAApC;AACD;;AAEDC,MAAM,CAACC,OAAP,GAAiB;AACfT,EAAAA,gBAAgB,EAAEA;AADH,CAAjB","sourcesContent":["'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n\n return Math.floor(hwm);\n } // Default value\n\n\n return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1179fd778af8f8b7d5dad1ce06168ac7.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1179fd778af8f8b7d5dad1ce06168ac7.json
new file mode 100644
index 000000000..a6783f107
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/1179fd778af8f8b7d5dad1ce06168ac7.json
@@ -0,0 +1 @@
+{"ast":null,"code":"'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar Transform = require('readable-stream').Transform;\n\nvar inherits = require('inherits');\n\nfunction throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer.isBuffer(val) && typeof val !== 'string') {\n throw new TypeError(prefix + ' must be a string or a buffer');\n }\n}\n\nfunction HashBase(blockSize) {\n Transform.call(this);\n this._block = Buffer.allocUnsafe(blockSize);\n this._blockSize = blockSize;\n this._blockOffset = 0;\n this._length = [0, 0, 0, 0];\n this._finalized = false;\n}\n\ninherits(HashBase, Transform);\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null;\n\n try {\n this.update(chunk, encoding);\n } catch (err) {\n error = err;\n }\n\n callback(error);\n};\n\nHashBase.prototype._flush = function (callback) {\n var error = null;\n\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n\n callback(error);\n};\n\nHashBase.prototype.update = function (data, encoding) {\n throwIfNotStringOrBuffer(data, 'Data');\n if (this._finalized) throw new Error('Digest already called');\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding);\n var block = this._block;\n var offset = 0;\n\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) {\n block[i++] = data[offset++];\n }\n\n this._update();\n\n this._blockOffset = 0;\n }\n\n while (offset < data.length) {\n block[this._blockOffset++] = data[offset++];\n }\n\n for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n this._length[j] += carry;\n carry = this._length[j] / 0x0100000000 | 0;\n if (carry > 0) this._length[j] -= 0x0100000000 * carry;\n }\n\n return this;\n};\n\nHashBase.prototype._update = function () {\n throw new Error('_update is not implemented');\n};\n\nHashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error('Digest already called');\n this._finalized = true;\n\n var digest = this._digest();\n\n if (encoding !== undefined) digest = digest.toString(encoding);\n\n this._block.fill(0);\n\n this._blockOffset = 0;\n\n for (var i = 0; i < 4; ++i) {\n this._length[i] = 0;\n }\n\n return digest;\n};\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented');\n};\n\nmodule.exports = HashBase;","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/hash-base/index.js"],"names":["Buffer","require","Transform","inherits","throwIfNotStringOrBuffer","val","prefix","isBuffer","TypeError","HashBase","blockSize","call","_block","allocUnsafe","_blockSize","_blockOffset","_length","_finalized","prototype","_transform","chunk","encoding","callback","error","update","err","_flush","push","digest","data","Error","from","block","offset","length","i","_update","j","carry","_digest","undefined","toString","fill","module","exports"],"mappings":"AAAA;;AACA,IAAIA,MAAM,GAAGC,OAAO,CAAC,aAAD,CAAP,CAAuBD,MAApC;;AACA,IAAIE,SAAS,GAAGD,OAAO,CAAC,iBAAD,CAAP,CAA2BC,SAA3C;;AACA,IAAIC,QAAQ,GAAGF,OAAO,CAAC,UAAD,CAAtB;;AAEA,SAASG,wBAAT,CAAmCC,GAAnC,EAAwCC,MAAxC,EAAgD;AAC9C,MAAI,CAACN,MAAM,CAACO,QAAP,CAAgBF,GAAhB,CAAD,IAAyB,OAAOA,GAAP,KAAe,QAA5C,EAAsD;AACpD,UAAM,IAAIG,SAAJ,CAAcF,MAAM,GAAG,+BAAvB,CAAN;AACD;AACF;;AAED,SAASG,QAAT,CAAmBC,SAAnB,EAA8B;AAC5BR,EAAAA,SAAS,CAACS,IAAV,CAAe,IAAf;AAEA,OAAKC,MAAL,GAAcZ,MAAM,CAACa,WAAP,CAAmBH,SAAnB,CAAd;AACA,OAAKI,UAAL,GAAkBJ,SAAlB;AACA,OAAKK,YAAL,GAAoB,CAApB;AACA,OAAKC,OAAL,GAAe,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,EAAU,CAAV,CAAf;AAEA,OAAKC,UAAL,GAAkB,KAAlB;AACD;;AAEDd,QAAQ,CAACM,QAAD,EAAWP,SAAX,CAAR;;AAEAO,QAAQ,CAACS,SAAT,CAAmBC,UAAnB,GAAgC,UAAUC,KAAV,EAAiBC,QAAjB,EAA2BC,QAA3B,EAAqC;AACnE,MAAIC,KAAK,GAAG,IAAZ;;AACA,MAAI;AACF,SAAKC,MAAL,CAAYJ,KAAZ,EAAmBC,QAAnB;AACD,GAFD,CAEE,OAAOI,GAAP,EAAY;AACZF,IAAAA,KAAK,GAAGE,GAAR;AACD;;AAEDH,EAAAA,QAAQ,CAACC,KAAD,CAAR;AACD,CATD;;AAWAd,QAAQ,CAACS,SAAT,CAAmBQ,MAAnB,GAA4B,UAAUJ,QAAV,EAAoB;AAC9C,MAAIC,KAAK,GAAG,IAAZ;;AACA,MAAI;AACF,SAAKI,IAAL,CAAU,KAAKC,MAAL,EAAV;AACD,GAFD,CAEE,OAAOH,GAAP,EAAY;AACZF,IAAAA,KAAK,GAAGE,GAAR;AACD;;AAEDH,EAAAA,QAAQ,CAACC,KAAD,CAAR;AACD,CATD;;AAWAd,QAAQ,CAACS,SAAT,CAAmBM,MAAnB,GAA4B,UAAUK,IAAV,EAAgBR,QAAhB,EAA0B;AACpDjB,EAAAA,wBAAwB,CAACyB,IAAD,EAAO,MAAP,CAAxB;AACA,MAAI,KAAKZ,UAAT,EAAqB,MAAM,IAAIa,KAAJ,CAAU,uBAAV,CAAN;AACrB,MAAI,CAAC9B,MAAM,CAACO,QAAP,CAAgBsB,IAAhB,CAAL,EAA4BA,IAAI,GAAG7B,MAAM,CAAC+B,IAAP,CAAYF,IAAZ,EAAkBR,QAAlB,CAAP;AAG5B,MAAIW,KAAK,GAAG,KAAKpB,MAAjB;AACA,MAAIqB,MAAM,GAAG,CAAb;;AACA,SAAO,KAAKlB,YAAL,GAAoBc,IAAI,CAACK,MAAzB,GAAkCD,MAAlC,IAA4C,KAAKnB,UAAxD,EAAoE;AAClE,SAAK,IAAIqB,CAAC,GAAG,KAAKpB,YAAlB,EAAgCoB,CAAC,GAAG,KAAKrB,UAAzC;AAAsDkB,MAAAA,KAAK,CAACG,CAAC,EAAF,CAAL,GAAaN,IAAI,CAACI,MAAM,EAAP,CAAjB;AAAtD;;AACA,SAAKG,OAAL;;AACA,SAAKrB,YAAL,GAAoB,CAApB;AACD;;AACD,SAAOkB,MAAM,GAAGJ,IAAI,CAACK,MAArB;AAA6BF,IAAAA,KAAK,CAAC,KAAKjB,YAAL,EAAD,CAAL,GAA6Bc,IAAI,CAACI,MAAM,EAAP,CAAjC;AAA7B;;AAGA,OAAK,IAAII,CAAC,GAAG,CAAR,EAAWC,KAAK,GAAGT,IAAI,CAACK,MAAL,GAAc,CAAtC,EAAyCI,KAAK,GAAG,CAAjD,EAAoD,EAAED,CAAtD,EAAyD;AACvD,SAAKrB,OAAL,CAAaqB,CAAb,KAAmBC,KAAnB;AACAA,IAAAA,KAAK,GAAI,KAAKtB,OAAL,CAAaqB,CAAb,IAAkB,YAAnB,GAAmC,CAA3C;AACA,QAAIC,KAAK,GAAG,CAAZ,EAAe,KAAKtB,OAAL,CAAaqB,CAAb,KAAmB,eAAeC,KAAlC;AAChB;;AAED,SAAO,IAAP;AACD,CAvBD;;AAyBA7B,QAAQ,CAACS,SAAT,CAAmBkB,OAAnB,GAA6B,YAAY;AACvC,QAAM,IAAIN,KAAJ,CAAU,4BAAV,CAAN;AACD,CAFD;;AAIArB,QAAQ,CAACS,SAAT,CAAmBU,MAAnB,GAA4B,UAAUP,QAAV,EAAoB;AAC9C,MAAI,KAAKJ,UAAT,EAAqB,MAAM,IAAIa,KAAJ,CAAU,uBAAV,CAAN;AACrB,OAAKb,UAAL,GAAkB,IAAlB;;AAEA,MAAIW,MAAM,GAAG,KAAKW,OAAL,EAAb;;AACA,MAAIlB,QAAQ,KAAKmB,SAAjB,EAA4BZ,MAAM,GAAGA,MAAM,CAACa,QAAP,CAAgBpB,QAAhB,CAAT;;AAG5B,OAAKT,MAAL,CAAY8B,IAAZ,CAAiB,CAAjB;;AACA,OAAK3B,YAAL,GAAoB,CAApB;;AACA,OAAK,IAAIoB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB;AAA4B,SAAKnB,OAAL,CAAamB,CAAb,IAAkB,CAAlB;AAA5B;;AAEA,SAAOP,MAAP;AACD,CAbD;;AAeAnB,QAAQ,CAACS,SAAT,CAAmBqB,OAAnB,GAA6B,YAAY;AACvC,QAAM,IAAIT,KAAJ,CAAU,4BAAV,CAAN;AACD,CAFD;;AAIAa,MAAM,CAACC,OAAP,GAAiBnC,QAAjB","sourcesContent":["'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('readable-stream').Transform\nvar inherits = require('inherits')\n\nfunction throwIfNotStringOrBuffer (val, prefix) {\n if (!Buffer.isBuffer(val) && typeof val !== 'string') {\n throw new TypeError(prefix + ' must be a string or a buffer')\n }\n}\n\nfunction HashBase (blockSize) {\n Transform.call(this)\n\n this._block = Buffer.allocUnsafe(blockSize)\n this._blockSize = blockSize\n this._blockOffset = 0\n this._length = [0, 0, 0, 0]\n\n this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null\n try {\n this.update(chunk, encoding)\n } catch (err) {\n error = err\n }\n\n callback(error)\n}\n\nHashBase.prototype._flush = function (callback) {\n var error = null\n try {\n this.push(this.digest())\n } catch (err) {\n error = err\n }\n\n callback(error)\n}\n\nHashBase.prototype.update = function (data, encoding) {\n throwIfNotStringOrBuffer(data, 'Data')\n if (this._finalized) throw new Error('Digest already called')\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n // consume data\n var block = this._block\n var offset = 0\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n this._update()\n this._blockOffset = 0\n }\n while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n // update length\n for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n this._length[j] += carry\n carry = (this._length[j] / 0x0100000000) | 0\n if (carry > 0) this._length[j] -= 0x0100000000 * carry\n }\n\n return this\n}\n\nHashBase.prototype._update = function () {\n throw new Error('_update is not implemented')\n}\n\nHashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error('Digest already called')\n this._finalized = true\n\n var digest = this._digest()\n if (encoding !== undefined) digest = digest.toString(encoding)\n\n // reset state\n this._block.fill(0)\n this._blockOffset = 0\n for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n return digest\n}\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n"]},"metadata":{},"sourceType":"script"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11b5c5b207cd7e508a33f35f124fb8fe.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11b5c5b207cd7e508a33f35f124fb8fe.json
new file mode 100644
index 000000000..38d6f794e
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11b5c5b207cd7e508a33f35f124fb8fe.json
@@ -0,0 +1 @@
+{"ast":null,"code":"var _window$document;\n\nexport var isDOMAvailable = typeof window !== 'undefined' && !!((_window$document = window.document) != null && _window$document.createElement);","map":{"version":3,"sources":["../../src/environment/browser.web.ts"],"names":[],"mappings":";;AAEA,OAAO,IAAM,cAAc,GAAG,OAAO,MAAP,KAAkB,WAAlB,IAAiC,CAAC,sBAAC,MAAM,CAAC,QAAR,aAAC,iBAAiB,aAAlB,CAAzD","sourcesContent":["// Used for delegating node actions when browser APIs aren't available\n// like in SSR websites.\nexport const isDOMAvailable = typeof window !== 'undefined' && !!window.document?.createElement;\n"],"sourceRoot":""},"metadata":{},"sourceType":"module"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11f8c638b8c7e66d34e8e80e116e0b69.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11f8c638b8c7e66d34e8e80e116e0b69.json
new file mode 100644
index 000000000..2b37c7312
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/11f8c638b8c7e66d34e8e80e116e0b69.json
@@ -0,0 +1 @@
+{"ast":null,"code":"import { CodedError } from '@unimodules/react-native-adapter';\nimport compareVersions from 'compare-versions';\nvar postedWarnings = {};\nexport default function deprecate(library, deprecatedAPI) {\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n var currentVersion = options.currentVersion,\n versionToRemove = options.versionToRemove,\n replacement = options.replacement;\n var code = codeFromLibrary(library);\n var key = code + \":\" + deprecatedAPI + \":\" + replacement;\n\n if (!postedWarnings[key]) {\n postedWarnings[key] = true;\n }\n\n if (!currentVersion || !versionToRemove || compareVersions(currentVersion, versionToRemove) >= 0) {\n var _message = \"`\" + deprecatedAPI + \"` has been removed\";\n\n if (versionToRemove) {\n _message = _message + \" as of version \\\"\" + versionToRemove + \"\\\"\";\n }\n\n if (replacement && replacement.length) {\n _message = _message + \" please migrate to: `\" + replacement + \"`\";\n }\n\n throw new CodedError(\"ERR_DEPRECATED_API\", prependLibrary(library, _message));\n }\n\n var message = \"`\" + deprecatedAPI + \"` has been deprecated\";\n\n if (replacement && replacement.length) {\n message = message + \" in favor of `\" + replacement + \"`\";\n }\n\n if (versionToRemove && versionToRemove.length) {\n message = message + \" and will be removed in version \\\"\" + versionToRemove + \"\\\"\";\n }\n\n console.warn(prependLibrary(library, message));\n}\n\nfunction prependLibrary(library, message) {\n return library + \": \" + message;\n}\n\nfunction codeFromLibrary(library) {\n var code = library.replace(/[-.]/g, '_').toUpperCase();\n return code;\n}","map":{"version":3,"sources":["../src/deprecate.ts"],"names":[],"mappings":"AAAA,SAAS,UAAT,QAA2B,kCAA3B;AACA,OAAO,eAAP,MAA4B,kBAA5B;AAEA,IAAM,cAAc,GAA+B,EAAnD;AAKA,eAAc,SAAU,SAAV,CACZ,OADY,EAEZ,aAFY,EAON;AAAA,MAJN,OAIM,uEAAF,EAAE;AAEN,MAAQ,cAAR,GAAyD,OAAzD,CAAQ,cAAR;AAAA,MAAwB,eAAxB,GAAyD,OAAzD,CAAwB,eAAxB;AAAA,MAAyC,WAAzC,GAAyD,OAAzD,CAAyC,WAAzC;AACA,MAAM,IAAI,GAAG,eAAe,CAAC,OAAD,CAA5B;AACA,MAAM,GAAG,GAAM,IAAN,SAAc,aAAd,SAA+B,WAAxC;;AACA,MAAI,CAAC,cAAc,CAAC,GAAD,CAAnB,EAA0B;AACxB,IAAA,cAAc,CAAC,GAAD,CAAd,GAAsB,IAAtB;AACD;;AAED,MACE,CAAC,cAAD,IACA,CAAC,eADD,IAEA,eAAe,CAAC,cAAD,EAAiB,eAAjB,CAAf,IAAoD,CAHtD,EAIE;AACA,QAAI,QAAO,SAAQ,aAAR,uBAAX;;AACA,QAAI,eAAJ,EAAqB;AACnB,MAAA,QAAO,GAAM,QAAN,yBAAgC,eAAhC,OAAP;AACD;;AACD,QAAI,WAAW,IAAI,WAAW,CAAC,MAA/B,EAAuC;AACrC,MAAA,QAAO,GAAM,QAAN,6BAAsC,WAAtC,MAAP;AACD;;AAED,UAAM,IAAI,UAAJ,uBAAqC,cAAc,CAAC,OAAD,EAAU,QAAV,CAAnD,CAAN;AACD;;AAED,MAAI,OAAO,SAAQ,aAAR,0BAAX;;AACA,MAAI,WAAW,IAAI,WAAW,CAAC,MAA/B,EAAuC;AACrC,IAAA,OAAO,GAAM,OAAN,sBAA+B,WAA/B,MAAP;AACD;;AACD,MAAI,eAAe,IAAI,eAAe,CAAC,MAAvC,EAA+C;AAC7C,IAAA,OAAO,GAAM,OAAN,0CAAiD,eAAjD,OAAP;AACD;;AACD,EAAA,OAAO,CAAC,IAAR,CAAa,cAAc,CAAC,OAAD,EAAU,OAAV,CAA3B;AACD;;AAED,SAAS,cAAT,CAAwB,OAAxB,EAAyC,OAAzC,EAAwD;AACtD,SAAU,OAAV,UAAsB,OAAtB;AACD;;AAOD,SAAS,eAAT,CAAyB,OAAzB,EAAwC;AACtC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAR,CAAgB,OAAhB,EAAyB,GAAzB,EAA8B,WAA9B,EAAb;AACA,SAAO,IAAP;AACD","sourcesContent":["import { CodedError } from '@unimodules/react-native-adapter';\nimport compareVersions from 'compare-versions';\n\nconst postedWarnings: { [key: string]: boolean } = {};\n\n/**\n * Used for deprecating values and throwing an error if a given version of Expo has passed.\n */\nexport default function deprecate(\n library: string,\n deprecatedAPI: string,\n options: {\n replacement?: string;\n currentVersion?: string;\n versionToRemove?: string;\n } = {}\n): void {\n const { currentVersion, versionToRemove, replacement } = options;\n const code = codeFromLibrary(library);\n const key = `${code}:${deprecatedAPI}:${replacement}`;\n if (!postedWarnings[key]) {\n postedWarnings[key] = true;\n }\n\n if (\n !currentVersion ||\n !versionToRemove ||\n compareVersions(currentVersion, versionToRemove) >= 0\n ) {\n let message = `\\`${deprecatedAPI}\\` has been removed`;\n if (versionToRemove) {\n message = `${message} as of version \"${versionToRemove}\"`;\n }\n if (replacement && replacement.length) {\n message = `${message} please migrate to: \\`${replacement}\\``;\n }\n\n throw new CodedError(`ERR_DEPRECATED_API`, prependLibrary(library, message));\n }\n\n let message = `\\`${deprecatedAPI}\\` has been deprecated`;\n if (replacement && replacement.length) {\n message = `${message} in favor of \\`${replacement}\\``;\n }\n if (versionToRemove && versionToRemove.length) {\n message = `${message} and will be removed in version \"${versionToRemove}\"`;\n }\n console.warn(prependLibrary(library, message));\n}\n\nfunction prependLibrary(library: string, message: string): string {\n return `${library}: ${message}`;\n}\n\n/**\n * Transform format:\n * Expo.AR -> EXPO_AR\n * expo-ar -> EXPO_AR\n */\nfunction codeFromLibrary(library: string): string {\n const code = library.replace(/[-.]/g, '_').toUpperCase();\n return code;\n}\n"],"sourceRoot":""},"metadata":{},"sourceType":"module"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/126ced5b7c092b1d3d4d15193de1f777.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/126ced5b7c092b1d3d4d15193de1f777.json
new file mode 100644
index 000000000..690ed66db
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/126ced5b7c092b1d3d4d15193de1f777.json
@@ -0,0 +1 @@
+{"ast":null,"code":"import _extends from \"@babel/runtime/helpers/extends\";\nimport _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport _classCallCheck from \"@babel/runtime/helpers/classCallCheck\";\nimport _createClass from \"@babel/runtime/helpers/createClass\";\nimport _inherits from \"@babel/runtime/helpers/inherits\";\nimport _possibleConstructorReturn from \"@babel/runtime/helpers/possibleConstructorReturn\";\nimport _getPrototypeOf from \"@babel/runtime/helpers/getPrototypeOf\";\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\n\nimport * as ErrorRecovery from 'expo-error-recovery';\nimport * as React from 'react';\nexport default function withExpoRoot(AppRootComponent) {\n return function (_React$Component) {\n _inherits(ExpoRootComponent, _React$Component);\n\n var _super = _createSuper(ExpoRootComponent);\n\n function ExpoRootComponent() {\n _classCallCheck(this, ExpoRootComponent);\n\n return _super.apply(this, arguments);\n }\n\n _createClass(ExpoRootComponent, [{\n key: \"render\",\n value: function render() {\n var props = _objectSpread(_objectSpread({}, this.props), {}, {\n exp: _objectSpread(_objectSpread({}, this.props.exp), {}, {\n errorRecovery: ErrorRecovery.recoveredProps\n })\n });\n\n return React.createElement(AppRootComponent, _extends({}, props));\n }\n }]);\n\n return ExpoRootComponent;\n }(React.Component);\n}","map":{"version":3,"sources":["../../src/launch/withExpoRoot.web.tsx"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,OAAO,KAAK,aAAZ,MAA+B,qBAA/B;AACA,OAAO,KAAK,KAAZ,MAAuB,OAAvB;AAIA,eAAc,SAAU,YAAV,CACZ,gBADY,EAC4B;AAExC;AAAA;;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA,aACE,kBAAM;AACJ,YAAM,KAAK,mCACN,KAAK,KADC;AAET,UAAA,GAAG,kCAAO,KAAK,KAAL,CAAW,GAAlB;AAAuB,YAAA,aAAa,EAAE,aAAa,CAAC;AAApD;AAFM,UAAX;;AAKA,eAAO,KAAA,CAAA,aAAA,CAAC,gBAAD,EAAiB,SAAA,EAAA,EAAK,KAAL,CAAjB,CAAP;AACD;AARH;;AAAA;AAAA,IAAuC,KAAK,CAAC,SAA7C;AAUD","sourcesContent":["import * as ErrorRecovery from 'expo-error-recovery';\nimport * as React from 'react';\n\nimport { InitialProps } from './withExpoRoot.types';\n\nexport default function withExpoRoot(\n AppRootComponent: React.ComponentType
\n): React.ComponentClass
{\n return class ExpoRootComponent extends React.Component
{\n render() {\n const props = {\n ...this.props,\n exp: { ...this.props.exp, errorRecovery: ErrorRecovery.recoveredProps },\n };\n\n return ;\n }\n };\n}\n"],"sourceRoot":""},"metadata":{},"sourceType":"module"}
\ No newline at end of file
diff --git a/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/12f60e4677d137157fa9f42f18026076.json b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/12f60e4677d137157fa9f42f18026076.json
new file mode 100644
index 000000000..520694e3e
--- /dev/null
+++ b/Aster/codebase/frontend-mobile/.expo/web/cache/development/babel-loader/12f60e4677d137157fa9f42f18026076.json
@@ -0,0 +1 @@
+{"ast":null,"code":"(function (global, undefined) {\n \"use strict\";\n\n if (global.setImmediate) {\n return;\n }\n\n var nextHandle = 1;\n var tasksByHandle = {};\n var currentlyRunningATask = false;\n var doc = global.document;\n var registerImmediate;\n\n function setImmediate(callback) {\n if (typeof callback !== \"function\") {\n callback = new Function(\"\" + callback);\n }\n\n var args = new Array(arguments.length - 1);\n\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i + 1];\n }\n\n var task = {\n callback: callback,\n args: args\n };\n tasksByHandle[nextHandle] = task;\n registerImmediate(nextHandle);\n return nextHandle++;\n }\n\n function clearImmediate(handle) {\n delete tasksByHandle[handle];\n }\n\n function run(task) {\n var callback = task.callback;\n var args = task.args;\n\n switch (args.length) {\n case 0:\n callback();\n break;\n\n case 1:\n callback(args[0]);\n break;\n\n case 2:\n callback(args[0], args[1]);\n break;\n\n case 3:\n callback(args[0], args[1], args[2]);\n break;\n\n default:\n callback.apply(undefined, args);\n break;\n }\n }\n\n function runIfPresent(handle) {\n if (currentlyRunningATask) {\n setTimeout(runIfPresent, 0, handle);\n } else {\n var task = tasksByHandle[handle];\n\n if (task) {\n currentlyRunningATask = true;\n\n try {\n run(task);\n } finally {\n clearImmediate(handle);\n currentlyRunningATask = false;\n }\n }\n }\n }\n\n function installNextTickImplementation() {\n registerImmediate = function registerImmediate(handle) {\n process.nextTick(function () {\n runIfPresent(handle);\n });\n };\n }\n\n function canUsePostMessage() {\n if (global.postMessage && !global.importScripts) {\n var postMessageIsAsynchronous = true;\n var oldOnMessage = global.onmessage;\n\n global.onmessage = function () {\n postMessageIsAsynchronous = false;\n };\n\n global.postMessage(\"\", \"*\");\n global.onmessage = oldOnMessage;\n return postMessageIsAsynchronous;\n }\n }\n\n function installPostMessageImplementation() {\n var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n\n var onGlobalMessage = function onGlobalMessage(event) {\n if (event.source === global && typeof event.data === \"string\" && event.data.indexOf(messagePrefix) === 0) {\n runIfPresent(+event.data.slice(messagePrefix.length));\n }\n };\n\n if (global.addEventListener) {\n global.addEventListener(\"message\", onGlobalMessage, false);\n } else {\n global.attachEvent(\"onmessage\", onGlobalMessage);\n }\n\n registerImmediate = function registerImmediate(handle) {\n global.postMessage(messagePrefix + handle, \"*\");\n };\n }\n\n function installMessageChannelImplementation() {\n var channel = new MessageChannel();\n\n channel.port1.onmessage = function (event) {\n var handle = event.data;\n runIfPresent(handle);\n };\n\n registerImmediate = function registerImmediate(handle) {\n channel.port2.postMessage(handle);\n };\n }\n\n function installReadyStateChangeImplementation() {\n var html = doc.documentElement;\n\n registerImmediate = function registerImmediate(handle) {\n var script = doc.createElement(\"script\");\n\n script.onreadystatechange = function () {\n runIfPresent(handle);\n script.onreadystatechange = null;\n html.removeChild(script);\n script = null;\n };\n\n html.appendChild(script);\n };\n }\n\n function installSetTimeoutImplementation() {\n registerImmediate = function registerImmediate(handle) {\n setTimeout(runIfPresent, 0, handle);\n };\n }\n\n var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n if ({}.toString.call(global.process) === \"[object process]\") {\n installNextTickImplementation();\n } else if (canUsePostMessage()) {\n installPostMessageImplementation();\n } else if (global.MessageChannel) {\n installMessageChannelImplementation();\n } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n installReadyStateChangeImplementation();\n } else {\n installSetTimeoutImplementation();\n }\n\n attachTo.setImmediate = setImmediate;\n attachTo.clearImmediate = clearImmediate;\n})(typeof self === \"undefined\" ? typeof global === \"undefined\" ? this : global : self);","map":{"version":3,"sources":["/usr/local/lib/node_modules/expo-cli/node_modules/setimmediate/setImmediate.js"],"names":["global","undefined","setImmediate","nextHandle","tasksByHandle","currentlyRunningATask","doc","document","registerImmediate","callback","Function","args","Array","arguments","length","i","task","clearImmediate","handle","run","apply","runIfPresent","setTimeout","installNextTickImplementation","process","nextTick","canUsePostMessage","postMessage","importScripts","postMessageIsAsynchronous","oldOnMessage","onmessage","installPostMessageImplementation","messagePrefix","Math","random","onGlobalMessage","event","source","data","indexOf","slice","addEventListener","attachEvent","installMessageChannelImplementation","channel","MessageChannel","port1","port2","installReadyStateChangeImplementation","html","documentElement","script","createElement","onreadystatechange","removeChild","appendChild","installSetTimeoutImplementation","attachTo","Object","getPrototypeOf","toString","call","self"],"mappings":"AAAC,WAAUA,MAAV,EAAkBC,SAAlB,EAA6B;AAC1B;;AAEA,MAAID,MAAM,CAACE,YAAX,EAAyB;AACrB;AACH;;AAED,MAAIC,UAAU,GAAG,CAAjB;AACA,MAAIC,aAAa,GAAG,EAApB;AACA,MAAIC,qBAAqB,GAAG,KAA5B;AACA,MAAIC,GAAG,GAAGN,MAAM,CAACO,QAAjB;AACA,MAAIC,iBAAJ;;AAEA,WAASN,YAAT,CAAsBO,QAAtB,EAAgC;AAE9B,QAAI,OAAOA,QAAP,KAAoB,UAAxB,EAAoC;AAClCA,MAAAA,QAAQ,GAAG,IAAIC,QAAJ,CAAa,KAAKD,QAAlB,CAAX;AACD;;AAED,QAAIE,IAAI,GAAG,IAAIC,KAAJ,CAAUC,SAAS,CAACC,MAAV,GAAmB,CAA7B,CAAX;;AACA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAAI,CAACG,MAAzB,EAAiCC,CAAC,EAAlC,EAAsC;AAClCJ,MAAAA,IAAI,CAACI,CAAD,CAAJ,GAAUF,SAAS,CAACE,CAAC,GAAG,CAAL,CAAnB;AACH;;AAED,QAAIC,IAAI,GAAG;AAAEP,MAAAA,QAAQ,EAAEA,QAAZ;AAAsBE,MAAAA,IAAI,EAAEA;AAA5B,KAAX;AACAP,IAAAA,aAAa,CAACD,UAAD,CAAb,GAA4Ba,IAA5B;AACAR,IAAAA,iBAAiB,CAACL,UAAD,CAAjB;AACA,WAAOA,UAAU,EAAjB;AACD;;AAED,WAASc,cAAT,CAAwBC,MAAxB,EAAgC;AAC5B,WAAOd,aAAa,CAACc,MAAD,CAApB;AACH;;AAED,WAASC,GAAT,CAAaH,IAAb,EAAmB;AACf,QAAIP,QAAQ,GAAGO,IAAI,CAACP,QAApB;AACA,QAAIE,IAAI,GAAGK,IAAI,CAACL,IAAhB;;AACA,YAAQA,IAAI,CAACG,MAAb;AACA,WAAK,CAAL;AACIL,QAAAA,QAAQ;AACR;;AACJ,WAAK,CAAL;AACIA,QAAAA,QAAQ,CAACE,IAAI,CAAC,CAAD,CAAL,CAAR;AACA;;AACJ,WAAK,CAAL;AACIF,QAAAA,QAAQ,CAACE,IAAI,CAAC,CAAD,CAAL,EAAUA,IAAI,CAAC,CAAD,CAAd,CAAR;AACA;;AACJ,WAAK,CAAL;AACIF,QAAAA,QAAQ,CAACE,IAAI,CAAC,CAAD,CAAL,EAAUA,IAAI,CAAC,CAAD,CAAd,EAAmBA,IAAI,CAAC,CAAD,CAAvB,CAAR;AACA;;AACJ;AACIF,QAAAA,QAAQ,CAACW,KAAT,CAAenB,SAAf,EAA0BU,IAA1B;AACA;AAfJ;AAiBH;;AAED,WAASU,YAAT,CAAsBH,MAAtB,EAA8B;AAG1B,QAAIb,qBAAJ,EAA2B;AAGvBiB,MAAAA,UAAU,CAACD,YAAD,EAAe,CAAf,EAAkBH,MAAlB,CAAV;AACH,KAJD,MAIO;AACH,UAAIF,IAAI,GAAGZ,aAAa,CAACc,MAAD,CAAxB;;AACA,UAAIF,IAAJ,EAAU;AACNX,QAAAA,qBAAqB,GAAG,IAAxB;;AACA,YAAI;AACAc,UAAAA,GAAG,CAACH,IAAD,CAAH;AACH,SAFD,SAEU;AACNC,UAAAA,cAAc,CAACC,MAAD,CAAd;AACAb,UAAAA,qBAAqB,GAAG,KAAxB;AACH;AACJ;AACJ;AACJ;;AAED,WAASkB,6BAAT,GAAyC;AACrCf,IAAAA,iBAAiB,GAAG,2BAASU,MAAT,EAAiB;AACjCM,MAAAA,OAAO,CAACC,QAAR,CAAiB,YAAY;AAAEJ,QAAAA,YAAY,CAACH,MAAD,CAAZ;AAAuB,OAAtD;AACH,KAFD;AAGH;;AAED,WAASQ,iBAAT,GAA6B;AAGzB,QAAI1B,MAAM,CAAC2B,WAAP,IAAsB,CAAC3B,MAAM,CAAC4B,aAAlC,EAAiD;AAC7C,UAAIC,yBAAyB,GAAG,IAAhC;AACA,UAAIC,YAAY,GAAG9B,MAAM,CAAC+B,SAA1B;;AACA/B,MAAAA,MAAM,CAAC+B,SAAP,GAAmB,YAAW;AAC1BF,QAAAA,yBAAyB,GAAG,KAA5B;AACH,OAFD;;AAGA7B,MAAAA,MAAM,CAAC2B,WAAP,CAAmB,EAAnB,EAAuB,GAAvB;AACA3B,MAAAA,MAAM,CAAC+B,SAAP,GAAmBD,YAAnB;AACA,aAAOD,yBAAP;AACH;AACJ;;AAED,WAASG,gCAAT,GAA4C;AAKxC,QAAIC,aAAa,GAAG,kBAAkBC,IAAI,CAACC,MAAL,EAAlB,GAAkC,GAAtD;;AACA,QAAIC,eAAe,GAAG,SAAlBA,eAAkB,CAASC,KAAT,EAAgB;AAClC,UAAIA,KAAK,CAACC,MAAN,KAAiBtC,MAAjB,IACA,OAAOqC,KAAK,CAACE,IAAb,KAAsB,QADtB,IAEAF,KAAK,CAACE,IAAN,CAAWC,OAAX,CAAmBP,aAAnB,MAAsC,CAF1C,EAE6C;AACzCZ,QAAAA,YAAY,CAAC,CAACgB,KAAK,CAACE,IAAN,CAAWE,KAAX,CAAiBR,aAAa,CAACnB,MAA/B,CAAF,CAAZ;AACH;AACJ,KAND;;AAQA,QAAId,MAAM,CAAC0C,gBAAX,EAA6B;AACzB1C,MAAAA,MAAM,CAAC0C,gBAAP,CAAwB,SAAxB,EAAmCN,eAAnC,EAAoD,KAApD;AACH,KAFD,MAEO;AACHpC,MAAAA,MAAM,CAAC2C,WAAP,CAAmB,WAAnB,EAAgCP,eAAhC;AACH;;AAED5B,IAAAA,iBAAiB,GAAG,2BAASU,MAAT,EAAiB;AACjClB,MAAAA,MAAM,CAAC2B,WAAP,CAAmBM,aAAa,GAAGf,MAAnC,EAA2C,GAA3C;AACH,KAFD;AAGH;;AAED,WAAS0B,mCAAT,GAA+C;AAC3C,QAAIC,OAAO,GAAG,IAAIC,cAAJ,EAAd;;AACAD,IAAAA,OAAO,CAACE,KAAR,CAAchB,SAAd,GAA0B,UAASM,KAAT,EAAgB;AACtC,UAAInB,MAAM,GAAGmB,KAAK,CAACE,IAAnB;AACAlB,MAAAA,YAAY,CAACH,MAAD,CAAZ;AACH,KAHD;;AAKAV,IAAAA,iBAAiB,GAAG,2BAASU,MAAT,EAAiB;AACjC2B,MAAAA,OAAO,CAACG,KAAR,CAAcrB,WAAd,CAA0BT,MAA1B;AACH,KAFD;AAGH;;AAED,WAAS+B,qCAAT,GAAiD;AAC7C,QAAIC,IAAI,GAAG5C,GAAG,CAAC6C,eAAf;;AACA3C,IAAAA,iBAAiB,GAAG,2BAASU,MAAT,EAAiB;AAGjC,UAAIkC,MAAM,GAAG9C,GAAG,CAAC+C,aAAJ,CAAkB,QAAlB,CAAb;;AACAD,MAAAA,MAAM,CAACE,kBAAP,GAA4B,YAAY;AACpCjC,QAAAA,YAAY,CAACH,MAAD,CAAZ;AACAkC,QAAAA,MAAM,CAACE,kBAAP,GAA4B,IAA5B;AACAJ,QAAAA,IAAI,CAACK,WAAL,CAAiBH,MAAjB;AACAA,QAAAA,MAAM,GAAG,IAAT;AACH,OALD;;AAMAF,MAAAA,IAAI,CAACM,WAAL,CAAiBJ,MAAjB;AACH,KAXD;AAYH;;AAED,WAASK,+BAAT,GAA2C;AACvCjD,IAAAA,iBAAiB,GAAG,2BAASU,MAAT,EAAiB;AACjCI,MAAAA,UAAU,CAACD,YAAD,EAAe,CAAf,EAAkBH,MAAlB,CAAV;AACH,KAFD;AAGH;;AAGD,MAAIwC,QAAQ,GAAGC,MAAM,CAACC,cAAP,IAAyBD,MAAM,CAACC,cAAP,CAAsB5D,MAAtB,CAAxC;AACA0D,EAAAA,QAAQ,GAAGA,QAAQ,IAAIA,QAAQ,CAACpC,UAArB,GAAkCoC,QAAlC,GAA6C1D,MAAxD;;AAGA,MAAI,GAAG6D,QAAH,CAAYC,IAAZ,CAAiB9D,MAAM,CAACwB,OAAxB,MAAqC,kBAAzC,EAA6D;AAEzDD,IAAAA,6BAA6B;AAEhC,GAJD,MAIO,IAAIG,iBAAiB,EAArB,EAAyB;AAE5BM,IAAAA,gCAAgC;AAEnC,GAJM,MAIA,IAAIhC,MAAM,CAAC8C,cAAX,EAA2B;AAE9BF,IAAAA,mCAAmC;AAEtC,GAJM,MAIA,IAAItC,GAAG,IAAI,wBAAwBA,GAAG,CAAC+C,aAAJ,CAAkB,QAAlB,CAAnC,EAAgE;AAEnEJ,IAAAA,qCAAqC;AAExC,GAJM,MAIA;AAEHQ,IAAAA,+BAA+B;AAClC;;AAEDC,EAAAA,QAAQ,CAACxD,YAAT,GAAwBA,YAAxB;AACAwD,EAAAA,QAAQ,CAACzC,cAAT,GAA0BA,cAA1B;AACH,CAzLA,EAyLC,OAAO8C,IAAP,KAAgB,WAAhB,GAA8B,OAAO/D,MAAP,KAAkB,WAAlB,GAAgC,IAAhC,GAAuCA,MAArE,GAA8E+D,IAzL/E,CAAD","sourcesContent":["(function (global, undefined) {\n \"use strict\";\n\n if (global.setImmediate) {\n return;\n }\n\n var nextHandle = 1; // Spec says greater than zero\n var tasksByHandle = {};\n var currentlyRunningATask = false;\n var doc = global.document;\n var registerImmediate;\n\n function setImmediate(callback) {\n // Callback can either be a function or a string\n if (typeof callback !== \"function\") {\n callback = new Function(\"\" + callback);\n }\n // Copy function arguments\n var args = new Array(arguments.length - 1);\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i + 1];\n }\n // Store and register the task\n var task = { callback: callback, args: args };\n tasksByHandle[nextHandle] = task;\n registerImmediate(nextHandle);\n return nextHandle++;\n }\n\n function clearImmediate(handle) {\n delete tasksByHandle[handle];\n }\n\n function run(task) {\n var callback = task.callback;\n var args = task.args;\n switch (args.length) {\n case 0:\n callback();\n break;\n case 1:\n callback(args[0]);\n break;\n case 2:\n callback(args[0], args[1]);\n break;\n case 3:\n callback(args[0], args[1], args[2]);\n break;\n default:\n callback.apply(undefined, args);\n break;\n }\n }\n\n function runIfPresent(handle) {\n // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n // So if we're currently running a task, we'll need to delay this invocation.\n if (currentlyRunningATask) {\n // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n // \"too much recursion\" error.\n setTimeout(runIfPresent, 0, handle);\n } else {\n var task = tasksByHandle[handle];\n if (task) {\n currentlyRunningATask = true;\n try {\n run(task);\n } finally {\n clearImmediate(handle);\n currentlyRunningATask = false;\n }\n }\n }\n }\n\n function installNextTickImplementation() {\n registerImmediate = function(handle) {\n process.nextTick(function () { runIfPresent(handle); });\n };\n }\n\n function canUsePostMessage() {\n // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n // where `global.postMessage` means something completely different and can't be used for this purpose.\n if (global.postMessage && !global.importScripts) {\n var postMessageIsAsynchronous = true;\n var oldOnMessage = global.onmessage;\n global.onmessage = function() {\n postMessageIsAsynchronous = false;\n };\n global.postMessage(\"\", \"*\");\n global.onmessage = oldOnMessage;\n return postMessageIsAsynchronous;\n }\n }\n\n function installPostMessageImplementation() {\n // Installs an event handler on `global` for the `message` event: see\n // * https://developer.mozilla.org/en/DOM/window.postMessage\n // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n var onGlobalMessage = function(event) {\n if (event.source === global &&\n typeof event.data === \"string\" &&\n event.data.indexOf(messagePrefix) === 0) {\n runIfPresent(+event.data.slice(messagePrefix.length));\n }\n };\n\n if (global.addEventListener) {\n global.addEventListener(\"message\", onGlobalMessage, false);\n } else {\n global.attachEvent(\"onmessage\", onGlobalMessage);\n }\n\n registerImmediate = function(handle) {\n global.postMessage(messagePrefix + handle, \"*\");\n };\n }\n\n function installMessageChannelImplementation() {\n var channel = new MessageChannel();\n channel.port1.onmessage = function(event) {\n var handle = event.data;\n runIfPresent(handle);\n };\n\n registerImmediate = function(handle) {\n channel.port2.postMessage(handle);\n };\n }\n\n function installReadyStateChangeImplementation() {\n var html = doc.documentElement;\n registerImmediate = function(handle) {\n // Create a